Where can I find a proof of the Swiss cheese theorem?

  • Context: Undergrad 
  • Thread starter Thread starter Bestfrog
  • Start date Start date
  • Tags Tags
    Proof Theorem
Click For Summary
SUMMARY

The Swiss cheese theorem states that the Euclidean space ##\mathbb{R}^2## cannot be represented as the union of nondegenerate disjoint circles. This theorem is discussed in the context of topological proofs, specifically referencing the impossibility of covering the plane with closed disks while maintaining disjoint interiors. Key resources for further exploration include a moderated forum at York University and Math Stack Exchange. The discussion also touches on Baire category and measure theory, emphasizing the contradiction that arises when attempting to construct such a union.

PREREQUISITES
  • Understanding of Euclidean space and topology
  • Familiarity with Baire category theorem
  • Knowledge of measure theory, specifically measure zero sets
  • Basic concepts of closed and open sets in topology
NEXT STEPS
  • Research the Baire category theorem in detail
  • Study measure theory, focusing on measure zero sets
  • Explore topological proofs related to disjoint unions of sets
  • Investigate the implications of the Swiss cheese theorem in mathematical analysis
USEFUL FOR

Mathematicians, topologists, and students studying advanced geometry and topology, particularly those interested in the properties of Euclidean spaces and the implications of the Swiss cheese theorem.

Bestfrog
Does anyone know where I can find a proof of this theorem?
Theorem: The Euclidean space ##\mathbb{R}^2## is not the union of nondegenerate disjoints circles.
 
Physics news on Phys.org
Consider a sequence of circles S_i such that the disk bounded by S_i contains S_{i+1} and the radii r_i of these circles tend to zero (this is possible because given a circle of radius r, the circle passing through its center has radius \leq r/2) and let x_i be a point in the disk bounded by S_i. The sequence x_i converges since r_i\to 0 and we find that the circle passing through the limit of this sequence must intersect all but finitely many of the S_i. Contradiction.

Edit: This seems too easy to be a proof of a substantial theorem, so I might be missing something.

WWGD said:
Still, doesn't Baire category apply, if the union is countable?
If the union was countable, you could just use that the countable union of measure zero sets has measure zero.
 
Last edited:
Infrared said:
If the union was countable, you could just use that the countable union of measure zero sets has measure zero.

Seemed, by the type of problem, the OP wanted to address it from a purely topological perspective/approach.
 
I know a proof for a theorem that states that it is not possible to write the plane as a union of closed disks in such way that the interiors of the disks would be disjoint. In other words
<br /> \mathbb{R}^2 = \bigcup_{i\in\mathcal{I}} \bar{B}(x_i,r_i)<br />
and
<br /> i,i&#039;\in\mathcal{I},\; i\neq i&#039;\quad\implies\quad B(x_i,r_i)\cap B(x_{i&#039;},r_{i&#039;})=\emptyset<br />
lead to a contradiction, where r_i&gt;0 for all i\in\mathcal{I}, the index set \mathcal{I} can be arbitrary to start with,
<br /> B(x,r) = \big\{x&#039;\in\mathbb{R}^2\;\big|\; \|x&#039;-x\|&lt;r\big\}<br />
and
<br /> \bar{B}(x,r) = \big\{x&#039;\in\mathbb{R}^2\;\big|\; \|x&#039;-x\|\leq r\big\}.<br />
 
jostpuur said:
I know a proof for a theorem that states that it is not possible to write the plane as a union of closed disks in such way that the interiors of the disks would be disjoint.
Often named a "Swiss cheese" (https://en.wikipedia.org/wiki/Swiss_cheese_(mathematics)).
cheesecolour.png
 

Attachments

  • cheesecolour.png
    cheesecolour.png
    18.2 KB · Views: 660

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K