home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!elroy.jpl.nasa.gov!nntp-server.caltech.edu!allenk
- From: allenk@ugcs.caltech.edu (Allen Knutson)
- Newsgroups: sci.math
- Subject: Re: Measures, and Measurability
- Date: 21 Dec 1992 17:01:03 GMT
- Organization: California Institute of Technology, Pasadena
- Lines: 11
- Message-ID: <1h4t8fINNsmb@gap.caltech.edu>
- References: <1992Dec18.191446.7806@panix.com> <1992Dec21.053850.13489@news.media.mit.edu> <BzM3wH.5p@mentor.cc.purdue.edu>
- NNTP-Posting-Host: torment.ugcs.caltech.edu
-
- hrubin@pop.stat.purdue.edu (Herman Rubin) writes:
-
- >>remember it as being very clear and intuitive. 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.
-
- >This certainly is not the case unless a very unusual definition of
- >rectangle is given.
-
- Or a very usual measure, counting measure! : -8 )
-