Documentation

BanachTarski.Basic

def Equidecomposible {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E F : Set X) :

In this top-level module we prove the main theorems specific Equidecompsibility and Paridoxicality. In particular we prove the main theorem that theorem banach_tarski_paradox_B3 : Paradoxical G3 B3

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem equidecomposibility_trans {X : Type u_1} {G : Type u_2} [Group G] [MulAction G X] {L M N : Set X} :

    Equidecomposibility is a transitive relation.

    theorem equidecomposibility_symm {X : Type u_1} {G : Type u_2} [Group G] [MulAction G X] {M N : Set X} :

    Equidecomposibility is a symmetric relation.

    def Paradoxical {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E : Set X) :
    Equations
    Instances For
      theorem paradoxical_of_equidecomposible_of_paradoxical {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E F : Set X) :

      Equidecomposibility preserves Paradoxicallity.

      theorem equidecomposible_of_supergroup_of_equidecomposible {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E F : Set X) (H : Subgroup G) :
      Equidecomposible (↥H) E FEquidecomposible G E F
      theorem paradoxical_of_supergroup_of_paradoxical {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (H : Subgroup G) (E : Set X) :
      Paradoxical (↥H) EParadoxical G E
      theorem paradoxical_preserved_by_iso {X : Type u_1} {Y : Type u_2} {G : Type u_3} {H : Type u_4} [Group G] [Group H] [MulAction G X] [MulAction H Y] (E : Set X) (iso : G ≃* H) (f : X Y) :
      (∀ (x : X) (g : G), iso g f x = f (g x))Paradoxical G EParadoxical H (f '' E)
      theorem self_paradoxical_preserved_by_iso {G : Type u_1} {H : Type u_2} [Group G] [Group H] :
      SelfParadoxical G∀ (a✝ : G ≃* H), SelfParadoxical H

      Our first proof that something is Paradoxical. All other results will derive from this.

      def FixedPoints {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E : Set X) :
      Set X

      Set of points in X fixed by some non-identity element of G.

      Equations
      Instances For
        theorem paradoxical_of_action_of_self_paradoxical {X : Type u_1} (G : Type u_2) [Group G] [MulAction G G] [MulAction G X] (Dom : Set X) :
        (∀ (g : G), f g '' Dom Dom)SelfParadoxical G(¬∃ (fp : X), fp FixedPoints G Dom) → Dom.NonemptyParadoxical G Dom

        If G is SelfParadoxical and acts on X without any nontrivial fixed points, then X is G-Paradoxical.

        theorem hausdorff_paradox :
        DS2, Countable D Paradoxical (↥SO3) (S2 \ D)

        We can find a countable subset of the 2-sphere such that removing it results in a set that is paradoxical under SO(3).

        theorem absorption_lemma_1 {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E S : Set X) :
        (∃ DE, S D ∃ (ρ : G), f ρ '' D = D \ S)Equidecomposible G E (E \ S)

        A series of lemmas showing that when considering the paradoxicality of a set E certain subsets S ⊆ E can be "absorbed" into E, specifically that E is equidcomposible with E \ S.

        theorem absorption_lemma_2 {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E S : Set X) :
        (∃ (ρ : G), (∀ (i : ), (f ρ)^[i] '' S E) ∀ (i : ), Disjoint S ((f ρ)^[i + 1] '' S))Equidecomposible G E (E \ S)
        theorem absorption_lemma_3 {X : Type u_1} (G : Type u_2) [Group G] [MulAction G X] (E S : Set X) :
        (∃ (F : G), Countable (Bad F S) ∀ (r : ), orbit (F r) S E)Equidecomposible G E (E \ S)

        Our first application of absorption: We can absorb any countable subset of the 2-sphere.

        First we prove a simpler version of the main theorem on just the 2-sphere.

        Next we extend the claim to the solid ball minus the origin.

        Finally we show that we can absorb the origin.