home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!think.com!ames!purdue!mentor.cc.purdue.edu!news
- From: ags@seaman.cc.purdue.edu (Dave Seaman)
- Subject: Re: Measures, and Measurability
- Message-ID: <BzM5Jr.47v@mentor.cc.purdue.edu>
- Sender: news@mentor.cc.purdue.edu (USENET News)
- Organization: Purdue University
- References: <1992Dec21.053850.13489@news.media.mit.edu>
- Date: Mon, 21 Dec 1992 14:28:38 GMT
- Lines: 18
-
- In article <1992Dec21.053850.13489@news.media.mit.edu>
- minsky@media.mit.edu (Marvin Minsky) writes:
- > [...] Starts out with nice
- > proof of metric density theorem, which says that if a set of an
- > Euclidean space is measurable, then it contains rectangles whose
- > measures are arbitrarily close to 1.
-
- Without looking it up, I would venture to guess that it says if S is a
- measurable subset of a Euclidean space, then for each epsilon > 0 there is
- a rectangle D such that the measure of (D intersect S), divided by the
- measure of D, is greater than (1 - epsilon).
-
- But then, I suppose a measure theorist would say that the two statements
- are equivalent, except the first one just leaves out the obvious details.
-
- --
- Dave Seaman
- ags@seaman.cc.purdue.edu
-