A Probabilistic Proof of the Vitali Covering Lemma
| dc.contributor.advisor | Hagelstein, Paul | |
| dc.contributor.author | Gwaltney, Ethan | |
| dc.contributor.department | University Scholars. | en_US |
| dc.contributor.other | Baylor University. | en_US |
| dc.contributor.other | Daniel Herden | en_US |
| dc.contributor.schools | Honors College. | en_US |
| dc.date.accessioned | 2017-05-23T20:05:56Z | |
| dc.date.available | 2017-05-23T20:05:56Z | |
| dc.date.copyright | 2017-04-25 | |
| dc.date.issued | 2017-05-23 | |
| dc.description.abstract | The Vitali Covering Lemma states that, given a finite collection of balls in R^d, there exists a disjoint subcollection that fills at least 3^{−d} of the measure of the union of the original collection. We present classical proofs of this lemma due to Banach and Garnett. Subsequently, we provide a new proof of this lemma that utilizes probabilistic “Erdo ̈s” type techniques and Padovan numbers. | en_US |
| dc.identifier.uri | http://hdl.handle.net/2104/9937 | |
| dc.language.iso | en_US | en_US |
| dc.rights | Baylor University projects are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact libraryquestions@baylor.edu for inquiries about permission. | en_US |
| dc.rights.accessrights | Worldwide access | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | A Probabilistic Proof of the Vitali Covering Lemma | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.87 KB
- Format:
- Item-specific license agreed upon to submission
- Description: