math / data /lean /OAI /ModelTheory /Choiceless /Forms.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
47.8 kB
import OAI.ModelTheory.Choiceless.Hereditary namespace OAI noncomputable section namespace CPTSeparation.Forms open Classical Counting Hereditary open scoped BigOperators private theorem card_eq_mul_fiber {X Y : Type*} [Fintype X] [Fintype Y] (f : X β†’ Y) (yβ‚€ : Y) (h : βˆ€ y, Fintype.card {x // f x = y} = Fintype.card {x // f x = yβ‚€}) : Fintype.card X = Fintype.card Y * Fintype.card {x // f x = yβ‚€} := by calc Fintype.card X = Fintype.card (Ξ£ y, {x // f x = y}) := Fintype.card_congr (Equiv.sigmaFiberEquiv f).symm _ = βˆ‘ y, Fintype.card {x // f x = y} := Fintype.card_sigma _ = _ := by simp only [h,Finset.sum_const,Finset.card_univ,smul_eq_mul] private theorem card_eq_of_uniform_fibers {X X' Y Y' : Type*} [Fintype X] [Fintype X'] [Fintype Y] [Fintype Y'] (f : X β†’ Y) (f' : X' β†’ Y') (y : Y) (y' : Y') (hx : Fintype.card X = Fintype.card X') (hf : βˆ€ z, Fintype.card {x // f x = z} = Fintype.card {x // f x = y}) (hf' : βˆ€ z, Fintype.card {x // f' x = z} = Fintype.card {x // f' x = y'}) (hy : 0 < Fintype.card {x // f x = y}) (he : Fintype.card {x // f x = y} = Fintype.card {x // f' x = y'}) : Fintype.card Y = Fintype.card Y' := by have h := (card_eq_mul_fiber f y hf).symm.trans (hx.trans (card_eq_mul_fiber f' y' hf')) rw [←he] at h exact Nat.eq_of_mul_eq_mul_right hy h private theorem range_card_mul_fiber {X Y : Type*} [Fintype X] (f : X β†’ Y) (xβ‚€ : X) (h : βˆ€ x, Nat.card {z // f z = f x} = Nat.card {z // f z = f xβ‚€}) : Fintype.card X = Nat.card (Set.range f) * Nat.card {z // f z = f xβ‚€} := by let := (Set.finite_range f).fintype let fR : X β†’ Set.range f := fun x => ⟨f x,⟨x,rfl⟩⟩ have k (y : Set.range f) : Nat.card {x // fR x = y} = Nat.card {z // f z = f xβ‚€} := by have hp (x : X) : fR x = y ↔ f x = y.1 := Subtype.ext_iff rw [Nat.card_congr (Equiv.subtypeEquivRight hp)] obtain ⟨x,hx⟩ := y.2 rw [←hx] exact h x have hh := card_eq_mul_fiber fR (fR xβ‚€) (fun y => by simpa only [←Nat.card_eq_fintype_card] using (k y).trans (k (fR xβ‚€)).symm) have hh' : Nat.card X = Nat.card (Set.range f) * Nat.card {x // fR x = fR xβ‚€} := by simpa only [←Nat.card_eq_fintype_card] using hh rw [k] at hh' simpa only [←Nat.card_eq_fintype_card] using hh' variable {R I A B P : Type*} [finiteI : Fintype I] [DecidableEq I] variable [finiteA : Fintype A] [Fintype B] [nonemptyA : Nonempty A] [Nonempty B] [finiteP : Fintype P] variable {s : β„•} def Molecules (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I) (p : P β†’ A) (Ο„ : Set (Formula R I)) := {a : Fin s β†’ A // tupleType S ep (Sum.elim p a) = Ο„} instance (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I) (p : P β†’ A) (Ο„ : Set (Formula R I)) : Fintype (Molecules S ep p Ο„) := inferInstanceAs (Fintype {a : Fin s β†’ A // tupleType S ep (Sum.elim p a) = Ο„}) def labelValues (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (p : P β†’ A) (Ο„ : Set (Formula R I)) (Ο† : Form (Fin s) (Set (Formula R I))) : Set (HF A) := Set.range (fun a : Molecules S ep p Ο„ => Form.value S e2 Ο† a.1) instance (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (p : P β†’ A) (Ο„ : Set (Formula R I)) (Ο† : Form (Fin s) (Set (Formula R I))) : Fintype (labelValues S ep e2 p Ο„ Ο†) := (Set.finite_range _).fintype section Group variable {G : Type*} [Group G] [MulAction G A] variable (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) variable (hAut : βˆ€ (g : G) r a b, S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) variable (p : P β†’ A) (Ο„ : Set (Formula R I)) omit R I A P s G S ep hAut p in private theorem mol_type_smul.{uDecl1, uDecl2, uDecl3, uDecl5, uDecl6} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} {P : Type uDecl5} [Fintype I] [DecidableEq I] [Fintype A] [Nonempty A] [Fintype P] {s : β„•} {G : Type uDecl6} [Group G] [MulAction G A] (S : Counting.Structure R A) (ep : P βŠ• Fin s β†ͺ I) (hAut : βˆ€ (g : G) (r : R) (a b : A), S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) (p : P β†’ A) (g : G) (hp : βˆ€ i, g β€’ p i = p i) (a : Fin s β†’ A) : tupleType S ep (Sum.elim p (fun i => g β€’ a i)) = tupleType S ep (Sum.elim p a) := by have hh := tupleType_iso S S ep (MulAction.toPerm g) (fun r a b => (hAut g r a b).symm) (Sum.elim p a) have hh' : (MulAction.toPerm g) ∘ Sum.elim p a = Sum.elim p (fun i => g β€’ a i) := by funext i; rcases i with i|i Β· exact hp i Β· rfl rw [hh'] at hh exact hh.symm def moleculesPerm (g : G) (hp : βˆ€ i, g β€’ p i = p i) : Molecules S ep p Ο„ ≃ Molecules S ep p Ο„ := (Equiv.piCongrRight (fun _ : Fin s => MulAction.toPerm g)).subtypeEquiv (fun a => by change tupleType S ep (Sum.elim p a) = Ο„ ↔ tupleType S ep (Sum.elim p (fun i => g β€’ a i)) = Ο„ rw [mol_type_smul S ep hAut p g hp a]) include hAut in omit R I A P s G S ep e2 hAut p Ο„ in theorem uniform_value_fibers.{uDecl1, uDecl2, uDecl3, uDecl5, uDecl6} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} {P : Type uDecl5} [Fintype I] [DecidableEq I] [Fintype A] [Nonempty A] [Fintype P] {s : β„•} {G : Type uDecl6} [Group G] [MulAction G A] (S : Counting.Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (hAut : βˆ€ (g : G) (r : R) (a b : A), S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) (p : P β†’ A) (Ο„ : Set (Counting.Formula R I)) (hHom : βˆ€ a b : P βŠ• Fin s β†’ A, tupleType S ep a = tupleType S ep b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (Ο† : Form (Fin s) (Set (Formula R I))) (a a' : Molecules S ep p Ο„) : Fintype.card {b : Molecules S ep p Ο„ // Form.value S e2 Ο† b.1 = Form.value S e2 Ο† a.1} = Fintype.card {b : Molecules S ep p Ο„ // Form.value S e2 Ο† b.1 = Form.value S e2 Ο† a'.1} := by obtain ⟨g,hg⟩ := hHom (Sum.elim p a.1) (Sum.elim p a'.1) (a.2.trans a'.2.symm) have hp : βˆ€ i, g β€’ p i = p i := fun i => hg (.inl i) have ha : (fun i => g β€’ a.1 i) = a'.1 := funext (fun i => hg (.inr i)) let f := moleculesPerm S ep hAut p Ο„ g hp have hv (b : Molecules S ep p Ο„) : Form.value S e2 Ο† (f b).1 = g β€’ Form.value S e2 Ο† b.1 := by exact (value_smul S e2 hAut g Ο† b.1).symm have hv' : Form.value S e2 Ο† a'.1 = g β€’ Form.value S e2 Ο† a.1 := by rw [←ha] exact (value_smul S e2 hAut g Ο† a.1).symm apply Fintype.card_congr apply f.subtypeEquiv intro b rw [hv,hv'] exact (MulAction.injective g).eq_iff.symm omit R I A P s G S ep e2 hAut p Ο„ in private theorem label_orbit.{uDecl1, uDecl2, uDecl3, uDecl5, uDecl6} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} {P : Type uDecl5} [Fintype I] [DecidableEq I] [Fintype A] [Nonempty A] [Fintype P] {s : β„•} {G : Type uDecl6} [Group G] [MulAction G A] (S : Counting.Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (hAut : βˆ€ (g : G) (r : R) (a b : A), S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) (p : P β†’ A) (Ο„ : Set (Counting.Formula R I)) (hHom : βˆ€ a b : P βŠ• Fin s β†’ A, tupleType S ep a = tupleType S ep b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (Ο† : Form (Fin s) (Set (Formula R I))) (x y : HF A) (hx : x ∈ labelValues S ep e2 p Ο„ Ο†) (hy : y ∈ labelValues S ep e2 p Ο„ Ο†) : βˆƒ g : G, (βˆ€ i, g β€’ p i = p i) ∧ g β€’ x = y := by obtain ⟨a,rfl⟩ := hx obtain ⟨b,rfl⟩ := hy obtain ⟨g,hg⟩ := hHom (Sum.elim p a.1) (Sum.elim p b.1) (a.2.trans b.2.symm) refine ⟨g,fun i => hg (.inl i),?_⟩ rw [value_smul S e2 hAut] exact congrArg (Form.value S e2 Ο†) (funext (fun i => hg (.inr i))) omit R I A P s G S ep e2 hAut p Ο„ in private theorem label_smul_mem.{uDecl1, uDecl2, uDecl3, uDecl5, uDecl6} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} {P : Type uDecl5} [Fintype I] [DecidableEq I] [Fintype A] [Nonempty A] [Fintype P] {s : β„•} {G : Type uDecl6} [Group G] [MulAction G A] (S : Counting.Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (hAut : βˆ€ (g : G) (r : R) (a b : A), S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) (p : P β†’ A) (Ο„ : Set (Counting.Formula R I)) (g : G) (hp : βˆ€ i, g β€’ p i = p i) (Ο† : Form (Fin s) (Set (Formula R I))) (x : HF A) (hx : x ∈ labelValues S ep e2 p Ο„ Ο†) : g β€’ x ∈ labelValues S ep e2 p Ο„ Ο† := by obtain ⟨a,rfl⟩ := hx refine ⟨moleculesPerm S ep hAut p Ο„ g hp a,?_⟩ exact (value_smul S e2 hAut g Ο† a.1).symm include hAut in theorem label_partition (hHom : βˆ€ a b : P βŠ• Fin s β†’ A, tupleType S ep a = tupleType S ep b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (Ο† ψ : Form (Fin s) (Set (Formula R I))) (Οƒ : Set (Formula R I)) (x : HF A) (hx : x ∈ labelValues S ep e2 p Ο„ Ο†) (hx' : x ∈ labelValues S ep e2 p Οƒ ψ) : labelValues S ep e2 p Ο„ Ο† = labelValues S ep e2 p Οƒ ψ := by ext y constructor Β· intro hy obtain ⟨g,hp,hg⟩ := label_orbit S ep e2 hAut p Ο„ hHom Ο† x y hx hy rw [←hg] exact label_smul_mem S ep e2 hAut p Οƒ g hp ψ x hx' Β· intro hy obtain ⟨g,hp,hg⟩ := label_orbit S ep e2 hAut p Οƒ hHom ψ x y hx' hy rw [←hg] exact label_smul_mem S ep e2 hAut p Ο„ g hp Ο† x hx end Group variable (S : Structure R A) (T : Structure R B) variable (ep : P βŠ• Fin s β†ͺ I) (epp : (P βŠ• Fin s) βŠ• Fin s β†ͺ I) variable (e2 : Fin s βŠ• Fin s β†ͺ I) variable (e3 : (Fin s βŠ• Fin s) βŠ• Fin s β†ͺ I) variable (e4 : ((Fin s βŠ• Fin s) βŠ• Fin s) βŠ• Fin s β†ͺ I) private def skipMiddle : P βŠ• Fin s β†ͺ (P βŠ• Fin s) βŠ• Fin s := Function.Embedding.sumMap Function.Embedding.inl (Function.Embedding.refl _) private def lastTwo : Fin s βŠ• Fin s β†ͺ (P βŠ• Fin s) βŠ• Fin s := Function.Embedding.sumMap Function.Embedding.inr (Function.Embedding.refl _) omit A P s in @[simp] private theorem elim_skipMiddle.{uDecl3, uDecl5} {A : Type uDecl3} {P : Type uDecl5} [Fintype A] [Nonempty A] [Fintype P] {s : β„•} (p : P β†’ A) (a b : Fin s β†’ A) : (Sum.elim (Sum.elim p a) b) ∘ skipMiddle = Sum.elim p b := by funext j; cases j <;> rfl omit A P s in @[simp] private theorem elim_lastTwo.{uDecl3, uDecl5} {A : Type uDecl3} {P : Type uDecl5} [Fintype A] [Nonempty A] [Fintype P] {s : β„•} (p : P β†’ A) (a b : Fin s β†’ A) : (Sum.elim (Sum.elim p a) b) ∘ lastTwo = Sum.elim a b := by funext j; cases j <;> rfl include epp e3 e4 in theorem value_fiber_equiv (p : P β†’ A) (q : P β†’ B) (Ο„ : Set (Formula R I)) (Ο† : Form (Fin s) (Set (Formula R I))) (a : Molecules S ep p Ο„) (a' : Molecules T ep q Ο„) : Nonempty ({b : Molecules S ep p Ο„ // Form.value S e2 Ο† b.1 = Form.value S e2 Ο† a.1} ≃ {b : Molecules T ep q Ο„ // Form.value T e2 Ο† b.1 = Form.value T e2 Ο† a'.1}) := by obtain ⟨f,hf⟩ := tupleType_append_bijection S T ep epp (Sum.elim p a.1) (Sum.elim q a'.1) (a.2.trans a'.2.symm) have htype (b : Fin s β†’ A) : tupleType S ep (Sum.elim p b) = tupleType T ep (Sum.elim q (f b)) := by have hh := tupleType_project S T epp ep skipMiddle _ _ (hf b) simpa only [elim_skipMiddle] using hh have hval (b : Fin s β†’ A) : Form.value S e2 Ο† b = Form.value S e2 Ο† a.1 ↔ Form.value T e2 Ο† (f b) = Form.value T e2 Ο† a'.1 := by have hh := tupleType_project S T epp e2 lastTwo _ _ (hf b) simp only [elim_lastTwo] at hh simpa only [eq_comm] using equality_transfer S T e2 e3 e4 Ο† Ο† a.1 b a'.1 (f b) hh let F : {b : Fin s β†’ A // tupleType S ep (Sum.elim p b) = Ο„ ∧ Form.value S e2 Ο† b = Form.value S e2 Ο† a.1} ≃ {b : Fin s β†’ B // tupleType T ep (Sum.elim q b) = Ο„ ∧ Form.value T e2 Ο† b = Form.value T e2 Ο† a'.1} := f.subtypeEquiv (fun b => show (tupleType S ep (Sum.elim p b) = Ο„ ∧ Form.value S e2 Ο† b = Form.value S e2 Ο† a.1) ↔ (tupleType T ep (Sum.elim q (f b)) = Ο„ ∧ Form.value T e2 Ο† (f b) = Form.value T e2 Ο† a'.1) from and_congr (by rw [htype b]) (hval b)) exact ⟨(Equiv.subtypeSubtypeEquivSubtypeInter _ _).trans (F.trans (Equiv.subtypeSubtypeEquivSubtypeInter _ _).symm)⟩ include epp e3 e4 in theorem label_overlap_transfer (e0 : P β†ͺ I) (p : P β†’ A) (q : P β†’ B) (hp : tupleType S e0 p = tupleType T e0 q) (Ο† ψ : Form (Fin s) (Set (Formula R I))) (Ο„ Οƒ : Set (Formula R I)) (hx : βˆƒ x, x ∈ labelValues S ep e2 p Ο„ Ο† ∧ x ∈ labelValues S ep e2 p Οƒ ψ) : βˆƒ y, y ∈ labelValues T ep e2 q Ο„ Ο† ∧ y ∈ labelValues T ep e2 q Οƒ ψ := by obtain ⟨x,⟨a,ha⟩,⟨b,hb⟩⟩ := hx obtain ⟨a',ha'⟩ := tupleType_append S T e0 ep p q a.1 hp obtain ⟨b',hb'⟩ := tupleType_append S T ep epp (Sum.elim p a.1) (Sum.elim q a') b.1 ha' have ht := tupleType_project S T epp ep skipMiddle _ _ hb' simp only [elim_skipMiddle] at ht have he := tupleType_project S T epp e2 lastTwo _ _ hb' simp only [elim_lastTwo] at he have hv := (equality_transfer S T e2 e3 e4 Ο† ψ a.1 b.1 a' b' he).mp (ha.trans hb.symm) refine ⟨Form.value T e2 Ο† a',?_,?_⟩ Β· exact ⟨⟨a',ha'.symm.trans a.2⟩,rfl⟩ Β· exact ⟨⟨b',ht.symm.trans b.2⟩,hv.symm⟩ include epp e3 e4 in theorem label_values_card {G H : Type*} [Group G] [MulAction G A] [Group H] [MulAction H B] (hAutA : βˆ€ (g : G) r a b, S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) (hAutB : βˆ€ (g : H) r a b, T.rel r (g β€’ a) (g β€’ b) ↔ T.rel r a b) (hHomA : βˆ€ a b : P βŠ• Fin s β†’ A, tupleType S ep a = tupleType S ep b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB : βˆ€ a b : P βŠ• Fin s β†’ B, tupleType T ep a = tupleType T ep b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (p : P β†’ A) (q : P β†’ B) (Ο„ : Set (Formula R I)) (Ο† : Form (Fin s) (Set (Formula R I))) (a : Molecules S ep p Ο„) (a' : Molecules T ep q Ο„) : Nat.card (labelValues S ep e2 p Ο„ Ο†) = Nat.card (labelValues T ep e2 q Ο„ Ο†) := by let va : Molecules S ep p Ο„ β†’ HF A := fun b => Form.value S e2 Ο† b.1 let vb : Molecules T ep q Ο„ β†’ HF B := fun b => Form.value T e2 Ο† b.1 have ha := range_card_mul_fiber va a (fun b => by simpa only [←Nat.card_eq_fintype_card] using uniform_value_fibers S ep e2 hAutA p Ο„ hHomA Ο† b a) have hb := range_card_mul_fiber vb a' (fun b => by simpa only [←Nat.card_eq_fintype_card] using uniform_value_fibers T ep e2 hAutB q Ο„ hHomB Ο† b a') let e0 := Function.Embedding.inl.trans ep have hp := tupleType_project S T ep e0 Function.Embedding.inl (Sum.elim p a.1) (Sum.elim q a'.1) (a.2.trans a'.2.symm) change tupleType S e0 p = tupleType T e0 q at hp obtain ⟨f⟩ := tupleType_extension_equiv S T e0 ep p q hp Ο„ have hn : Fintype.card (Molecules S ep p Ο„) = Fintype.card (Molecules T ep q Ο„) := Fintype.card_congr f obtain ⟨fv⟩ := value_fiber_equiv S T ep epp e2 e3 e4 p q Ο„ Ο† a a' have he : Nat.card {b // va b = va a} = Nat.card {b // vb b = vb a'} := Nat.card_congr fv have hpos : 0 < Nat.card {b // va b = va a} := by rw [Nat.card_eq_fintype_card] exact Fintype.card_pos_iff.mpr ⟨⟨a,rfl⟩⟩ have hc := ha.symm.trans (hn.trans hb) rw [←he] at hc have hh := Nat.eq_of_mul_eq_mul_right hpos hc simpa only [←Nat.card_eq_fintype_card,labelValues,va,vb] using hh end CPTSeparation.Forms namespace CPTSeparation open Classical private def cellSetoid {L X : Type*} (C : L β†’ Set X) : Setoid L := ⟨fun l k => C l = C k,⟨fun _ => rfl,Eq.symm,Eq.trans⟩⟩ theorem glue_finite_cells {L X Y : Type*} (C : L β†’ Set X) (D : L β†’ Set Y) (coverC : βˆ€ x, βˆƒ l, x ∈ C l) (coverD : βˆ€ y, βˆƒ l, y ∈ D l) (partC : βˆ€ l k x, x ∈ C l β†’ x ∈ C k β†’ C l = C k) (partD : βˆ€ l k y, y ∈ D l β†’ y ∈ D k β†’ D l = D k) (same : βˆ€ l k, C l = C k ↔ D l = D k) (finC : βˆ€ l, (C l).Finite) (finD : βˆ€ l, (D l).Finite) (card : βˆ€ l, Nat.card (C l) = Nat.card (D l)) : βˆƒ f : X ≃ Y, βˆ€ x, βˆƒ l, x ∈ C l ∧ f x ∈ D l := by let Q := Quotient (cellSetoid C) let lc : X β†’ L := fun x => (coverC x).choose let ld : Y β†’ L := fun y => (coverD y).choose have hc (x : X) : x ∈ C (lc x) := (coverC x).choose_spec have hd (y : Y) : y ∈ D (ld y) := (coverD y).choose_spec let c : X β†’ Q := fun x => Quotient.mk _ (lc x) let d : Y β†’ Q := fun y => Quotient.mk _ (ld y) have ce (x : X) (q : Q) : c x = q ↔ x ∈ C q.out := by constructor Β· intro h have he : C (lc x) = C q.out := Quotient.exact (h.trans (Quotient.out_eq q).symm) rw [←he]; exact hc x Β· intro h have he := partC (lc x) q.out x (hc x) h exact (Quotient.sound he).trans (Quotient.out_eq q) have de (y : Y) (q : Q) : d y = q ↔ y ∈ D q.out := by constructor Β· intro h have he : C (ld y) = C q.out := Quotient.exact (h.trans (Quotient.out_eq q).symm) rw [←(same _ _).mp he]; exact hd y Β· intro h have he := (same _ _).mpr (partD (ld y) q.out y (hd y) h) exact (Quotient.sound he).trans (Quotient.out_eq q) have ef (q : Q) : Nonempty ({x // c x = q} ≃ {y // d y = q}) := by let := (finC q.out).fintype let := (finD q.out).fintype have hcard : Fintype.card (C q.out) = Fintype.card (D q.out) := by simpa only [Nat.card_eq_fintype_card] using card q.out let e := Fintype.equivOfCardEq hcard exact ⟨(Equiv.subtypeEquivRight (fun x => ce x q)).trans (e.trans (Equiv.subtypeEquivRight (fun y => de y q)).symm)⟩ let F := Equiv.ofFiberEquiv (fun q => Classical.choice (ef q)) refine ⟨F,fun x => ⟨(c x).out,(ce x (c x)).mp rfl,?_⟩⟩ apply (de (F x) (c x)).mp exact Equiv.ofFiberEquiv_map _ x end CPTSeparation namespace CPTSeparation.Forms section open Classical Counting Hereditary variable {R I A B P G H : Type*} variable [Fintype I] [DecidableEq I] [Fintype A] [Fintype B] variable [Nonempty A] [Nonempty B] [Fintype P] variable [Group G] [MulAction G A] [Group H] [MulAction H B] variable {s : β„•} abbrev Domain (G : Type*) [Group G] [MulAction G A] (s : β„•) := {x : HF A // HereditarilySupported (G := G) s x} def Cell (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (p : P β†’ A) (Ο† : Form (Fin s) (Set (Formula R I))) (Ο„ : Set (Formula R I)) : Set (Domain (A := A) G s) := {x | x.1 ∈ labelValues S ep e2 p Ο„ Ο†} variable (S : Structure R A) (T : Structure R B) variable (ep : P βŠ• Fin s β†ͺ I) (epp : (P βŠ• Fin s) βŠ• Fin s β†ͺ I) variable (e2 : Fin s βŠ• Fin s β†ͺ I) (e3 : (Fin s βŠ• Fin s) βŠ• Fin s β†ͺ I) variable (e4 : ((Fin s βŠ• Fin s) βŠ• Fin s) βŠ• Fin s β†ͺ I) variable (hAutA : βˆ€ (g : G) r a b, S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) variable (hAutB : βˆ€ (g : H) r a b, T.rel r (g β€’ a) (g β€’ b) ↔ T.rel r a b) def cellEquiv (p : P β†’ A) (Ο† : Form (Fin s) (Set (Formula R I))) (Ο„ : Set (Formula R I)) : Cell (G := G) S ep e2 p Ο† Ο„ ≃ labelValues S ep e2 p Ο„ Ο† := Equiv.subtypeSubtypeEquivSubtype (p := HereditarilySupported (G := G) s) (q := fun x => x ∈ labelValues S ep e2 p Ο„ Ο†) (fun hx => by obtain ⟨a,rfl⟩ := hx exact value_hereditarily_supported S e2 hAutA Ο† a.1) include hAutA in private theorem cell_finite (p : P β†’ A) (Ο† : Form (Fin s) (Set (Formula R I))) (Ο„ : Set (Formula R I)) : (Cell (G := G) S ep e2 p Ο† Ο„).Finite := by let := Fintype.ofEquiv (labelValues S ep e2 p Ο„ Ο†) (cellEquiv S ep e2 hAutA p Ο† Ο„).symm exact Set.toFinite _ include hAutA hAutB epp e3 e4 in theorem supported_domain_bijection (hs : 0 < s) (e0 : P β†ͺ I) (hHomA2 : βˆ€ a b : Fin s βŠ• Fin s β†’ A, tupleType S e2 a = tupleType S e2 b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB2 : βˆ€ a b : Fin s βŠ• Fin s β†’ B, tupleType T e2 a = tupleType T e2 b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (hHomA : βˆ€ a b : P βŠ• Fin s β†’ A, tupleType S ep a = tupleType S ep b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB : βˆ€ a b : P βŠ• Fin s β†’ B, tupleType T ep a = tupleType T ep b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (p : P β†’ A) (q : P β†’ B) (hp : tupleType S e0 p = tupleType T e0 q) : βˆƒ f : Domain (A := A) G s ≃ Domain (A := B) H s, βˆ€ x, βˆƒ Ο† : Form (Fin s) (Set (Formula R I)), βˆƒ a : Fin s β†’ A, βˆƒ b : Fin s β†’ B, Form.value S e2 Ο† a = x.1 ∧ Form.value T e2 Ο† b = (f x).1 ∧ tupleType S ep (Sum.elim p a) = tupleType T ep (Sum.elim q b) := by let L := {l : Form (Fin s) (Set (Formula R I)) Γ— Set (Formula R I) // Nonempty (Molecules S ep p l.2)} let C : L β†’ Set (Domain (A := A) G s) := fun l => Cell S ep e2 p l.1.1 l.1.2 let D : L β†’ Set (Domain (A := B) H s) := fun l => Cell T ep e2 q l.1.1 l.1.2 have nonemptyB (l : L) : Nonempty (Molecules T ep q l.1.2) := by obtain ⟨f⟩ := tupleType_extension_equiv S T e0 ep p q hp l.1.2 exact Nonempty.map f l.2 have coverC : βˆ€ x, βˆƒ l, x ∈ C l := by intro x obtain βŸ¨Ο†,a,ha⟩ := representation S e2 hAutA hs hHomA2 x.1 x.2 let Ο„ := tupleType S ep (Sum.elim p a) let l : L := ⟨(Ο†,Ο„),⟨⟨a,rfl⟩⟩⟩ exact ⟨l,⟨⟨a,rfl⟩,ha⟩⟩ have coverD : βˆ€ y, βˆƒ l, y ∈ D l := by intro y obtain βŸ¨Ο†,b,hb⟩ := representation T e2 hAutB hs hHomB2 y.1 y.2 obtain ⟨a,ha⟩ := tupleType_append T S e0 ep q p b hp.symm let Ο„ := tupleType T ep (Sum.elim q b) let l : L := ⟨(Ο†,Ο„),⟨⟨a,ha.symm⟩⟩⟩ exact ⟨l,⟨⟨b,rfl⟩,hb⟩⟩ have partC : βˆ€ l k x, x ∈ C l β†’ x ∈ C k β†’ C l = C k := by intro l k x hx hk have hh := label_partition S ep e2 hAutA p l.1.2 hHomA l.1.1 k.1.1 k.1.2 x.1 hx hk exact congrArg (fun Z : Set (HF A) => {x : Domain G s | x.1 ∈ Z}) hh have partD : βˆ€ l k x, x ∈ D l β†’ x ∈ D k β†’ D l = D k := by intro l k x hx hk have hh := label_partition T ep e2 hAutB q l.1.2 hHomB l.1.1 k.1.1 k.1.2 x.1 hx hk exact congrArg (fun Z : Set (HF B) => {x : Domain H s | x.1 ∈ Z}) hh have same : βˆ€ l k, C l = C k ↔ D l = D k := by intro l k constructor Β· intro he obtain ⟨a⟩ := l.2 let x : Domain G s := ⟨Form.value S e2 l.1.1 a.1, value_hereditarily_supported S e2 hAutA _ _⟩ have hx : x ∈ C l := ⟨a,rfl⟩ have hk : x ∈ C k := he β–Έ hx obtain ⟨y,hy,hy'⟩ := label_overlap_transfer S T ep epp e2 e3 e4 e0 p q hp l.1.1 k.1.1 l.1.2 k.1.2 ⟨x.1,hx,hk⟩ have hsupp : HereditarilySupported (G := H) s y := by obtain ⟨b,rfl⟩ := hy exact value_hereditarily_supported T e2 hAutB _ _ exact partD l k ⟨y,hsupp⟩ hy hy' Β· intro he obtain ⟨b⟩ := nonemptyB l let y : Domain H s := ⟨Form.value T e2 l.1.1 b.1, value_hereditarily_supported T e2 hAutB _ _⟩ have hy : y ∈ D l := ⟨b,rfl⟩ have hk : y ∈ D k := he β–Έ hy obtain ⟨x,hx,hx'⟩ := label_overlap_transfer T S ep epp e2 e3 e4 e0 q p hp.symm l.1.1 k.1.1 l.1.2 k.1.2 ⟨y.1,hy,hk⟩ have hsupp : HereditarilySupported (G := G) s x := by obtain ⟨a,rfl⟩ := hx exact value_hereditarily_supported S e2 hAutA _ _ exact partC l k ⟨x,hsupp⟩ hx hx' have card : βˆ€ l, Nat.card (C l) = Nat.card (D l) := by intro l obtain ⟨a⟩ := l.2 obtain ⟨b⟩ := nonemptyB l have hh := label_values_card S T ep epp e2 e3 e4 hAutA hAutB hHomA hHomB p q l.1.2 l.1.1 a b have he := Nat.card_congr (cellEquiv S ep e2 hAutA p l.1.1 l.1.2) have hf := Nat.card_congr (cellEquiv T ep e2 hAutB q l.1.1 l.1.2) exact he.trans (hh.trans hf.symm) obtain ⟨f,hf⟩ := CPTSeparation.glue_finite_cells C D coverC coverD partC partD same (fun l => cell_finite S ep e2 hAutA p l.1.1 l.1.2) (fun l => cell_finite T ep e2 hAutB q l.1.1 l.1.2) card refine ⟨f,fun x => ?_⟩ obtain ⟨l,⟨a,ha⟩,⟨b,hb⟩⟩ := hf x exact ⟨l.1.1,a.1,b.1,ha,hb,a.2.trans b.2.symm⟩ end open Classical Counting Hereditary variable {R I A B V G H : Type*} variable [finiteI : Fintype I] [DecidableEq I] [finiteA : Fintype A] [Fintype B] variable [nonemptyA : Nonempty A] [Nonempty B] [finiteV : Fintype V] [decidableV : DecidableEq V] variable [Group G] [MulAction G A] [Group H] [MulAction H B] variable {s : β„•} inductive HFRelation (R : Type*) | mem | atom | base (r : R) def hfStructure (S : Structure R A) : Structure (HFRelation R) (Domain (A := A) G s) where rel | .mem, x, y => x.1 ∈ y.1 | .atom, x, _ => isSet x.1 = false | .base r, x, y => βˆƒ a b, x.1 = Hereditary.atom a ∧ y.1 = Hereditary.atom b ∧ S.rel r a b def Represented (S : Structure R A) (T : Structure R B) (ef : V Γ— Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) : Prop := βˆƒ Ο† : V β†’ Form (Fin s) (Set (Formula R I)), βˆƒ a : V Γ— Fin s β†’ A, βˆƒ b : V Γ— Fin s β†’ B, (βˆ€ i, Form.value S e2 (Ο† i) (fun j => a (i,j)) = (v i).1) ∧ (βˆ€ i, Form.value T e2 (Ο† i) (fun j => b (i,j)) = (w i).1) ∧ tupleType S ef a = tupleType T ef b def twoBlocks (i j : V) (h : i β‰  j) : Fin s βŠ• Fin s β†ͺ V Γ— Fin s where toFun := Sum.elim (Prod.mk i) (Prod.mk j) inj' := by intro a b hab cases a <;> cases b <;> simp only [Sum.elim_inl,Sum.elim_inr,Prod.mk.injEq] at hab Β· congr 1; exact hab.2 Β· exact (h hab.1).elim Β· exact (h hab.1.symm).elim Β· congr 1; exact hab.2 omit A V s in @[simp] theorem comp_twoBlocks.{uDecl3, uDecl5} {A : Type uDecl3} {V : Type uDecl5} [Fintype A] [Nonempty A] [Fintype V] [DecidableEq V] {s : β„•} (i j : V) (h : i β‰  j) (a : V Γ— Fin s β†’ A) : a ∘ twoBlocks i j h = Sum.elim (fun k => a (i,k)) (fun k => a (j,k)) := by funext x; cases x <;> rfl def splitBlock (i : V) : ({j : V // j β‰  i} Γ— Fin s) βŠ• Fin s ≃ V Γ— Fin s where toFun := Sum.elim (fun x => (x.1.1,x.2)) (fun j => (i,j)) invFun := fun x => if h : x.1 = i then .inr x.2 else .inl (⟨x.1,h⟩,x.2) left_inv := by intro x; cases x with | inl x => simp [x.1.2] | inr j => simp right_inv := by intro x; by_cases h : x.1 = i Β· simp [h]; exact Prod.ext h.symm rfl Β· simp [h] variable (S : Structure R A) (T : Structure R B) variable (ef : V Γ— Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) variable (e3 : (Fin s βŠ• Fin s) βŠ• Fin s β†ͺ I) variable (e4 : ((Fin s βŠ• Fin s) βŠ• Fin s) βŠ• Fin s β†ͺ I) include e3 e4 in theorem represented_equal (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) (h : Represented S T ef e2 v w) (i j : V) : v i = v j ↔ w i = w j := by by_cases hij : i = j Β· subst j; simp obtain βŸ¨Ο†,a,b,ha,hb,ht⟩ := h have hh := tupleType_project S T ef e2 (twoBlocks i j hij) a b ht simp only [comp_twoBlocks] at hh have he := equality_transfer S T e2 e3 e4 (Ο† i) (Ο† j) _ _ _ _ hh simpa only [ha,hb,Subtype.ext_iff] using he include e3 e4 in theorem represented_mem (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) (h : Represented S T ef e2 v w) (i j : V) : (v i).1 ∈ (v j).1 ↔ (w i).1 ∈ (w j).1 := by by_cases hij : i = j Β· subst j exact iff_of_false (fun h => (Nat.lt_irrefl _ (rank_lt_of_mem h))) (fun h => (Nat.lt_irrefl _ (rank_lt_of_mem h))) obtain βŸ¨Ο†,a,b,ha,hb,ht⟩ := h have hh := tupleType_project S T ef e2 (twoBlocks i j hij) a b ht simp only [comp_twoBlocks] at hh have he := membership_transfer S T e2 e3 e4 (Ο† i) (Ο† j) _ _ _ _ hh simpa only [ha,hb] using he omit R I A B V G H s S T ef e2 in theorem represented_atom.{uDecl1, uDecl2, uDecl3, uDecl4, uDecl5, uDecl6, uDecl7} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} {B : Type uDecl4} {V : Type uDecl5} {G : Type uDecl6} {H : Type uDecl7} [Fintype I] [DecidableEq I] [Fintype A] [Fintype B] [Nonempty A] [Nonempty B] [Fintype V] [DecidableEq V] [Group G] [MulAction G A] [Group H] [MulAction H B] {s : β„•} (S : Counting.Structure R A) (T : Counting.Structure R B) (ef : V Γ— Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) (h : Represented S T ef e2 v w) (i : V) : isSet (v i).1 = false ↔ isSet (w i).1 = false := by obtain βŸ¨Ο†,a,b,ha,hb,ht⟩ := h rw [←ha i,←hb i] cases Ο† i <;> simp omit R I A s S e2 in private theorem base_value.{uDecl1, uDecl2, uDecl3} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} [Fintype I] [DecidableEq I] [Fintype A] [Nonempty A] {s : β„•} (S : Counting.Structure R A) (e2 : Fin s βŠ• Fin s β†ͺ I) (Ο† ψ : Form (Fin s) (Set (Formula R I))) (a b : Fin s β†’ A) (r : R) : (βˆƒ x y, Form.value S e2 Ο† a = Hereditary.atom x ∧ Form.value S e2 ψ b = Hereditary.atom y ∧ S.rel r x y) ↔ match Ο†,ψ with | .atom i, .atom j => S.rel r (a i) (b j) | _, _ => False := by have hn (n : β„•) (child : Fin n β†’ Form (Fin s) (Set (Formula R I))) (label : Fin n β†’ Set (Formula R I)) (c : Fin s β†’ A) (x : A) : Form.value S e2 (.set n child label) c β‰  Hereditary.atom x := by intro h; have hh := congrArg isSet h; simp at hh cases Ο† <;> cases ψ <;> simp [Form.value_atom,atom_injective.eq_iff,hn] omit R I A B V G H s S T ef e2 in theorem represented_base.{uDecl1, uDecl2, uDecl3, uDecl4, uDecl5, uDecl6, uDecl7} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} {B : Type uDecl4} {V : Type uDecl5} {G : Type uDecl6} {H : Type uDecl7} [Fintype I] [DecidableEq I] [Fintype A] [Fintype B] [Nonempty A] [Nonempty B] [Fintype V] [DecidableEq V] [Group G] [MulAction G A] [Group H] [MulAction H B] {s : β„•} (S : Counting.Structure R A) (T : Counting.Structure R B) (ef : V Γ— Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I) (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) (h : Represented S T ef e2 v w) (r : R) (i j : V) : (hfStructure S).rel (.base r) (v i) (v j) ↔ (hfStructure T).rel (.base r) (w i) (w j) := by obtain βŸ¨Ο†,a,b,ha,hb,ht⟩ := h change (βˆƒ x y, (v i).1 = Hereditary.atom x ∧ (v j).1 = Hereditary.atom y ∧ S.rel r x y) ↔ (βˆƒ x y, (w i).1 = Hereditary.atom x ∧ (w j).1 = Hereditary.atom y ∧ T.rel r x y) rw [←ha i,←ha j,←hb i,←hb j,base_value S e2,base_value T e2] cases hi : Ο† i with | set n child label => simp | atom k => cases hj : Ο† j with | set n child label => simp | atom l => have he := (typeOf_eq_iff S T (tupleNames ef) _ _).mp ht (.relation r (ef (i,k)) (ef (j,l))) (by intro p hp simp only [Formula.free,Finset.mem_insert,Finset.mem_singleton] at hp rcases hp with rfl | rfl <;> exact (mem_tupleNames _ _).mpr ⟨_,rfl⟩) simpa only [Formula.eval,tupleAssignment_apply] using he omit V s in @[simp] theorem splitBlock_symm_new.{uDecl5} {V : Type uDecl5} [Fintype V] [DecidableEq V] {s : β„•} (i : V) (k : Fin s) : (splitBlock (s := s) i).symm (i,k) = .inr k := by simp [splitBlock] omit V s in @[simp] theorem splitBlock_symm_old.{uDecl5} {V : Type uDecl5} [Fintype V] [DecidableEq V] {s : β„•} (i j : V) (h : j β‰  i) (k : Fin s) : (splitBlock (s := s) i).symm (j,k) = .inl (⟨j,h⟩,k) := by simp [splitBlock,h] omit R I A G in private theorem homogeneity_reindex.{uDecl1, uDecl2, uDecl3, uDecl6, uDecl8, uDecl9} {R : Type uDecl1} {I : Type uDecl2} {A : Type uDecl3} {G : Type uDecl6} [Fintype I] [DecidableEq I] [Fintype A] [Nonempty A] [Group G] [MulAction G A] {J : Type uDecl8} {K : Type uDecl9} [Fintype J] [Fintype K] (S : Structure R A) (e : J β†ͺ I) (f : K β†ͺ I) (u : K ≃ J) (hh : βˆ€ a b : J β†’ A, tupleType S e a = tupleType S e b β†’ βˆƒ g : G, βˆ€ j, g β€’ a j = b j) : βˆ€ a b : K β†’ A, tupleType S f a = tupleType S f b β†’ βˆƒ g : G, βˆ€ j, g β€’ a j = b j := by intro a b hab have h := tupleType_project S S f e u.symm.toEmbedding a b hab obtain ⟨g,hg⟩ := hh _ _ h exact ⟨g,fun j => by simpa using hg (u j)⟩ variable (eplus : (V Γ— Fin s) βŠ• Fin s β†ͺ I) variable (hAutA : βˆ€ (g : G) r a b, S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) variable (hAutB : βˆ€ (g : H) r a b, T.rel r (g β€’ a) (g β€’ b) ↔ T.rel r a b) include eplus e3 e4 hAutA hAutB in theorem represented_extension (hs : 0 < s) (hHomA2 : βˆ€ a b : Fin s βŠ• Fin s β†’ A, tupleType S e2 a = tupleType S e2 b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB2 : βˆ€ a b : Fin s βŠ• Fin s β†’ B, tupleType T e2 a = tupleType T e2 b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (hHomA : βˆ€ a b : V Γ— Fin s β†’ A, tupleType S ef a = tupleType S ef b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB : βˆ€ a b : V Γ— Fin s β†’ B, tupleType T ef a = tupleType T ef b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) (h : Represented S T ef e2 v w) (i : V) : βˆƒ f : Domain (A := A) G s ≃ Domain (A := B) H s, βˆ€ x, Represented S T ef e2 (Function.update v i x) (Function.update w i (f x)) := by obtain βŸ¨Ο†,a,b,ha,hb,ht⟩ := h let P := {j : V // j β‰  i} Γ— Fin s let u : P βŠ• Fin s ≃ V Γ— Fin s := splitBlock i let ep := u.toEmbedding.trans ef let epp := (Equiv.sumCongr u (Equiv.refl (Fin s))).toEmbedding.trans eplus let e0 := Function.Embedding.inl.trans ep let keep : P β†ͺ V Γ— Fin s := Function.Embedding.inl.trans u.toEmbedding let p : P β†’ A := a ∘ keep let q : P β†’ B := b ∘ keep have hp : tupleType S e0 p = tupleType T e0 q := tupleType_project S T ef e0 keep a b ht have homA := homogeneity_reindex S ef ep u hHomA have homB := homogeneity_reindex T ef ep u hHomB obtain ⟨f,hf⟩ := supported_domain_bijection S T ep epp e2 e3 e4 hAutA hAutB hs e0 hHomA2 hHomB2 homA homB p q hp refine ⟨f,fun x => ?_⟩ obtain ⟨ψ,c,d,hc,hd,hcd⟩ := hf x let a' := Sum.elim p c ∘ u.symm let b' := Sum.elim q d ∘ u.symm refine ⟨Function.update Ο† i ψ,a',b',?_,?_,?_⟩ Β· intro j by_cases hj : j = i Β· subst j simpa [a',u,Function.comp_def,splitBlock] using hc Β· simpa [a',u,p,keep,Function.comp_def,splitBlock_symm_old i j hj, Function.update_of_ne hj,splitBlock,hj] using ha j Β· intro j by_cases hj : j = i Β· subst j simpa [b',u,Function.comp_def,splitBlock] using hd Β· simpa [b',u,q,keep,Function.comp_def,splitBlock_symm_old i j hj, Function.update_of_ne hj,splitBlock,hj] using hb j Β· exact tupleType_project S T ep ef u.symm.toEmbedding _ _ hcd include eplus e3 e4 hAutA hAutB in theorem supported_eval_transfer (hs : 0 < s) (hHomA2 : βˆ€ a b : Fin s βŠ• Fin s β†’ A, tupleType S e2 a = tupleType S e2 b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB2 : βˆ€ a b : Fin s βŠ• Fin s β†’ B, tupleType T e2 a = tupleType T e2 b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (hHomA : βˆ€ a b : V Γ— Fin s β†’ A, tupleType S ef a = tupleType S ef b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB : βˆ€ a b : V Γ— Fin s β†’ B, tupleType T ef a = tupleType T ef b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (Ο† : Formula (HFRelation R) V) (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) (h : Represented S T ef e2 v w) : Ο†.eval (hfStructure S) v ↔ Ο†.eval (hfStructure T) w := by apply Formula.eval_of_bijectionSystem (hfStructure S) (hfStructure T) (Represented S T ef e2) _ _ _ Ο† v w h Β· exact represented_equal S T ef e2 e3 e4 Β· intro v w h r i j cases r with | mem => exact represented_mem S T ef e2 e3 e4 v w h i j | atom => exact represented_atom S T ef e2 v w h i | base r => exact represented_base S T ef e2 v w h r i j Β· exact represented_extension S T ef e2 e3 e4 eplus hAutA hAutB hs hHomA2 hHomB2 hHomA hHomB include eplus e3 e4 hAutA hAutB in theorem supported_sentences_transfer (hs : 0 < s) (hHomA2 : βˆ€ a b : Fin s βŠ• Fin s β†’ A, tupleType S e2 a = tupleType S e2 b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB2 : βˆ€ a b : Fin s βŠ• Fin s β†’ B, tupleType T e2 a = tupleType T e2 b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (hHomA : βˆ€ a b : V Γ— Fin s β†’ A, tupleType S ef a = tupleType S ef b β†’ βˆƒ g : G, βˆ€ i, g β€’ a i = b i) (hHomB : βˆ€ a b : V Γ— Fin s β†’ B, tupleType T ef a = tupleType T ef b β†’ βˆƒ g : H, βˆ€ i, g β€’ a i = b i) (hbase : tupleType S (Function.Embedding.ofIsEmpty : Empty β†ͺ I) Empty.elim = tupleType T (Function.Embedding.ofIsEmpty : Empty β†ͺ I) Empty.elim) (Ο† : Formula (HFRelation R) V) (hΟ† : Ο†.free = βˆ…) (v : V β†’ Domain (A := A) G s) (w : V β†’ Domain (A := B) H s) : Ο†.eval (hfStructure S) v ↔ Ο†.eval (hfStructure T) w := by let a : V Γ— Fin s β†’ A := fun _ => Classical.choice inferInstance have he : tupleType S (Function.Embedding.ofIsEmpty : Empty β†ͺ I) (a ∘ (Function.Embedding.ofIsEmpty : Empty β†ͺ V Γ— Fin s)) = tupleType T (Function.Embedding.ofIsEmpty : Empty β†ͺ I) Empty.elim := by convert hbase using 1 congr 1; funext x; exact x.elim obtain ⟨b,_,hab⟩ := tupleType_extend S T (Function.Embedding.ofIsEmpty : Empty β†ͺ I) ef (Function.Embedding.ofIsEmpty : Empty β†ͺ V Γ— Fin s) a Empty.elim he let emptyForm : Form (Fin s) (Set (Formula R I)) := .set 0 Fin.elim0 Fin.elim0 let v' : V β†’ Domain (A := A) G s := fun i => ⟨Form.value S e2 emptyForm (fun j => a (i,j)), value_hereditarily_supported S e2 hAutA emptyForm _⟩ let w' : V β†’ Domain (A := B) H s := fun i => ⟨Form.value T e2 emptyForm (fun j => b (i,j)), value_hereditarily_supported T e2 hAutB emptyForm _⟩ have hr : Represented S T ef e2 v' w' := ⟨(fun _ => emptyForm),a,b,(fun _ => rfl),(fun _ => rfl),hab⟩ have hh := supported_eval_transfer S T ef e2 e3 e4 eplus hAutA hAutB hs hHomA2 hHomB2 hHomA hHomB Ο† v' w' hr exact (Formula.eval_congr _ Ο† (fun i hi => by simp [hΟ†] at hi)).trans (hh.trans (Formula.eval_congr _ Ο† (fun i hi => by simp [hΟ†] at hi))) def namesOfCard {J : Type*} [Fintype J] {M : β„•} (h : Fintype.card J ≀ M) : J β†ͺ Fin M := (Fintype.equivFin J).toEmbedding.trans (Fin.castLEEmb h) def HomogeneousThrough (S : Structure R A) (G : Type*) [Group G] [MulAction G A] (M r : β„•) : Prop := βˆ€ k ≀ r, βˆ€ e : Fin k β†ͺ Fin M, βˆ€ a b : Fin k β†’ A, tupleType S e a = tupleType S e b β†’ βˆƒ g : G, βˆ€ j, g β€’ a j = b j omit R A in private theorem homogeneous_tuple.{uDecl1, uDecl3, uDecl8, uDecl9} {R : Type uDecl1} {A : Type uDecl3} [Fintype A] [Nonempty A] {J : Type uDecl8} [Fintype J] {M r : β„•} (S : Structure R A) (G : Type uDecl9) [Group G] [MulAction G A] (h : HomogeneousThrough S G M r) (e : J β†ͺ Fin M) (hc : Fintype.card J ≀ r) : βˆ€ a b : J β†’ A, tupleType S e a = tupleType S e b β†’ βˆƒ g : G, βˆ€ j, g β€’ a j = b j := by exact homogeneity_reindex S ((Fintype.equivFin J).symm.toEmbedding.trans e) e (Fintype.equivFin J) (h _ hc _) theorem hf_transfer {m M : β„•} (hs : 0 < s) (_ : 0 < m) (hM : 0 < M) (hwidth : max 4 (m+1) * s ≀ M) (hAutA : βˆ€ (g : G) r a b, S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b) (hAutB : βˆ€ (g : H) r a b, T.rel r (g β€’ a) (g β€’ b) ↔ T.rel r a b) (hHomA : HomogeneousThrough S G M (max 2 m * s)) (hHomB : HomogeneousThrough T H M (max 2 m * s)) (hbase : tupleType S (Function.Embedding.ofIsEmpty : Empty β†ͺ Fin M) Empty.elim = tupleType T (Function.Embedding.ofIsEmpty : Empty β†ͺ Fin M) Empty.elim) (Ο† : Formula (HFRelation R) (Fin m)) (hΟ† : Ο†.free = βˆ…) (v : Fin m β†’ Domain (A := A) G s) (w : Fin m β†’ Domain (A := B) H s) : Ο†.eval (hfStructure S) v ↔ Ο†.eval (hfStructure T) w := by have h4 : 4*s ≀ M := (Nat.mul_le_mul_right s (le_max_left _ _)).trans hwidth have hp : (m+1)*s ≀ M := (Nat.mul_le_mul_right s (le_max_right _ _)).trans hwidth have h2 : Fintype.card (Fin s βŠ• Fin s) ≀ M := by simp only [Fintype.card_sum,Fintype.card_fin]; omega have h3 : Fintype.card ((Fin s βŠ• Fin s) βŠ• Fin s) ≀ M := by simp only [Fintype.card_sum,Fintype.card_fin]; omega have h4' : Fintype.card (((Fin s βŠ• Fin s) βŠ• Fin s) βŠ• Fin s) ≀ M := by simp only [Fintype.card_sum,Fintype.card_fin]; omega have hpf : Fintype.card ((Fin m Γ— Fin s) βŠ• Fin s) ≀ M := by simpa [Nat.add_mul] using hp have hfull : Fintype.card (Fin m Γ— Fin s) ≀ M := by simp only [Fintype.card_prod,Fintype.card_fin]; nlinarith have hom2 : Fintype.card (Fin s βŠ• Fin s) ≀ max 2 m*s := by simpa [two_mul] using Nat.mul_le_mul_right s (le_max_left 2 m) have homf : Fintype.card (Fin m Γ— Fin s) ≀ max 2 m*s := by simpa using Nat.mul_le_mul_right s (le_max_right 2 m) exact supported_sentences_transfer S T (namesOfCard hfull) (namesOfCard h2) (namesOfCard h3) (namesOfCard h4') (namesOfCard hpf) hAutA hAutB hs (homogeneous_tuple S G hHomA _ hom2) (homogeneous_tuple T H hHomB _ hom2) (homogeneous_tuple S G hHomA _ homf) (homogeneous_tuple T H hHomB _ homf) hbase Ο† hΟ† v w end CPTSeparation.Forms namespace CPTSeparation.Hereditary variable {A G : Type*} [Group G] [MulAction G A] theorem supports_pad {k s : β„•} (hks : k ≀ s) (aβ‚€ : A) (alpha : Fin k β†’ A) {x : HF A} (h : Supports (G := G) alpha x) : Supported (G := G) s x := by classical let beta (i : Fin s) : A := if hi : i.val < k then alpha ⟨i.val,hi⟩ else aβ‚€ refine ⟨beta,?_⟩ intro g hg apply h g intro i have hi := hg (i.castLE hks) simpa only [beta, Fin.val_castLE, dite_eq_left i.isLt] using hi end CPTSeparation.Hereditary namespace CPTSeparation.Grid section open Support Hereditary variable {n : β„•} {b : Vertex n β†’ Scalar} @[simp] theorem central_smul_HF (k : CentralGroup n) (x : HF (Atom b)) : k β€’ x = centralHom k β€’ x := rfl theorem small_orbit_supported (hn : 1 ≀ n) (x : HF (Atom b)) (N : β„•) (hN : 0 < N) (q : ℝ) (hq : 0 ≀ q) (horbit : (Nat.card (MulAction.orbit (BoxGroup n) x) : ℝ) ≀ (N : ℝ)^q) : Supported (G := CentralGroup n) ⌈2 * (n+1 : ℝ) * (q * Real.logb 3 N)^2βŒ‰β‚Š x := by classical obtain ⟨T,hT,hfix⟩ := small_orbit_support_edges x N hN q hq horbit obtain ⟨alpha,ha⟩ := edge_support_tuple (b := b) T x hfix have hsupport : Supports (G := CentralGroup n) alpha x := by intro k hk exact ha k hk have hlen : T.card ≀ ⌈2 * (n+1 : ℝ) * (q * Real.logb 3 N)^2βŒ‰β‚Š := by exact_mod_cast le_trans hT (Nat.le_ceil _) let aβ‚€ : Atom b := zeroEdgeAtom b (ex ⟨0,by omega⟩ 0 0) exact supports_pad hlen aβ‚€ alpha hsupport theorem orbit_card_le_invariant_family (F : Finset (HF (Atom b))) (hF : βˆ€ g : BoxGroup n, βˆ€ x ∈ F, g β€’ x ∈ F) {x : HF (Atom b)} (hx : x ∈ F) : Nat.card (MulAction.orbit (BoxGroup n) x) ≀ F.card := by classical let f : MulAction.orbit (BoxGroup n) x β†’ {y // y ∈ F} := fun y => ⟨y.val,by obtain ⟨g,hg⟩ := y.property; rw [← hg]; exact hF g x hx⟩ have hf : Function.Injective f := by intro a c h exact Subtype.ext (congrArg (fun z : {y // y ∈ F} => z.val) h) have hn := Nat.card_le_card_of_injective f hf simpa only [Nat.card_eq_fintype_card, Fintype.card_coe] using hn theorem invariant_family_hereditarily_supported (hn : 1 ≀ n) (F : Finset (HF (Atom b))) (hF : βˆ€ g : BoxGroup n, βˆ€ x ∈ F, g β€’ x ∈ F) (htrans : βˆ€ x ∈ F, βˆ€ y, y ∈ x β†’ y ∈ F) (N : β„•) (hN : 0 < N) (q : ℝ) (hq : 0 ≀ q) (hsize : (F.card : ℝ) ≀ (N : ℝ)^q) : βˆ€ x ∈ F, HereditarilySupported (G := CentralGroup n) ⌈2 * (n+1 : ℝ) * (q * Real.logb 3 N)^2βŒ‰β‚Š x := by intro x hx y hy have hymem : y ∈ F := by induction hy with | refl => exact hx | @tail z w hpath hmem ih => exact ih (htrans w hx z hmem) apply small_orbit_supported hn y N hN q hq exact le_trans (by exact_mod_cast orbit_card_le_invariant_family F hF hymem) hsize end open Classical Finset variable {n M m s : β„•} {b : Vertex n β†’ Scalar} theorem atom_nonempty (hn : 1 ≀ n) (b : Vertex n β†’ Scalar) : Nonempty (Atom b) := ⟨.inr ⟨(0,0,0),someConfiguration hn b (0,0,0)⟩⟩ instance atom_nonempty_succ (b : Vertex (n+1) β†’ Scalar) : Nonempty (Atom b) := atom_nonempty (by omega) b theorem central_analysis_isomorphism (k : CentralGroup n) (r : AnalysisSymbol) (x y : Atom b) : (analysisStructure b).rel r (k β€’ x) (k β€’ y) ↔ (analysisStructure b).rel r x y := ((central_atomShift k x).analysisRelation (central_atomShift k y) r).symm theorem homogeneous_through_numeric (hn : 1 ≀ n) [Nonempty (Atom b)] (R : β„•) (hw : (7*R:ℝ)+7*((6*R:ℝ)/boxConstant)^((3:ℝ)/2)+1 ≀ M) : Forms.HomogeneousThrough (analysisStructure b) (CentralGroup n) M R := by intro k hk names a a' ht apply quantitative_homogeneity hn names a a' _ ht simp only [Fintype.card_fin] have hkr : (k:ℝ) ≀ R := by exact_mod_cast hk have hp : ((6*k:ℝ)/boxConstant)^((3:ℝ)/2) ≀ ((6*R:ℝ)/boxConstant)^((3:ℝ)/2) := by apply Real.rpow_le_rpow (div_nonneg (by positivity) boxConstant_pos.le) _ (by norm_num) exact div_le_div_of_nonneg_right (by linarith) boxConstant_pos.le linarith theorem base_empty_type (hn : 1 ≀ n) (hbound : GiantBound n M) (vstar : Vertex n) [Nonempty (Atom (0 : Vertex n β†’ Scalar))] [Nonempty (Atom (Pi.single vstar 1))] : Counting.tupleType (analysisStructure (0 : Vertex n β†’ Scalar)) (Function.Embedding.ofIsEmpty : Empty β†ͺ Fin M) Empty.elim = Counting.tupleType (analysisStructure (Pi.single vstar 1)) (Function.Embedding.ofIsEmpty : Empty β†ͺ Fin M) Empty.elim := by apply (Counting.typeOf_eq_iff _ _ _ _ _).mpr intro Ο† hΟ† have he : Ο†.free = βˆ… := by apply subset_empty.mp simpa only [Counting.tupleNames,Finset.univ_eq_empty,Finset.map_empty] using hΟ† exact base_equivalence_numeric hn hbound vstar Ο† he _ _ theorem grid_hf_transfer (hn : 1 ≀ n) (hs : 0 < s) (hm : 0 < m) (vstar : Vertex n) [Nonempty (Atom (0 : Vertex n β†’ Scalar))] [Nonempty (Atom (Pi.single vstar 1))] (hwidth : max 4 (m+1)*s ≀ M) (hhom : (7*(max 2 m*s):ℝ)+7*((6*(max 2 m*s):ℝ)/boxConstant)^((3:ℝ)/2)+1 ≀ M) (hgiant : GiantBound n M) (Ο† : Counting.Formula (Forms.HFRelation AnalysisSymbol) (Fin m)) (hΟ† : Ο†.free = βˆ…) (v : Fin m β†’ Forms.Domain (A := Atom (0 : Vertex n β†’ Scalar)) (CentralGroup n) s) (w : Fin m β†’ Forms.Domain (A := Atom (Pi.single vstar 1)) (CentralGroup n) s) : Ο†.eval (Forms.hfStructure (analysisStructure (0 : Vertex n β†’ Scalar))) v ↔ Ο†.eval (Forms.hfStructure (analysisStructure (Pi.single vstar 1))) w := by have hM : 0 < M := lt_of_lt_of_le (Nat.mul_pos (by omega) hs) hwidth exact Forms.hf_transfer _ _ hs hm hM hwidth (fun g r a b => central_analysis_isomorphism g r a b) (fun g r a b => central_analysis_isomorphism g r a b) (homogeneous_through_numeric hn _ (by simpa only [Nat.cast_mul] using hhom)) (homogeneous_through_numeric hn _ (by simpa only [Nat.cast_mul] using hhom)) (base_empty_type hn hgiant vstar) Ο† hΟ† v w end CPTSeparation.Grid end end OAI
import OAI.ModelTheory.Choiceless.Hereditary
namespace OAI
noncomputable section
namespace CPTSeparation.Forms
open Classical Counting Hereditary
open scoped BigOperators
private theorem card_eq_mul_fiber {X Y : Type*} [Fintype X] [Fintype Y]
(f : X β†’ Y) (yβ‚€ : Y)
(h : βˆ€ y, Fintype.card {x // f x = y} = Fintype.card {x // f x = yβ‚€}) :
Fintype.card X = Fintype.card Y * Fintype.card {x // f x = yβ‚€} := by
calc
Fintype.card X = Fintype.card (Ξ£ y, {x // f x = y}) :=
Fintype.card_congr (Equiv.sigmaFiberEquiv f).symm
_ = βˆ‘ y, Fintype.card {x // f x = y} := Fintype.card_sigma
_ = _ := by simp only [h,Finset.sum_const,Finset.card_univ,smul_eq_mul]
private theorem card_eq_of_uniform_fibers {X X' Y Y' : Type*}
[Fintype X] [Fintype X'] [Fintype Y] [Fintype Y']
(f : X β†’ Y) (f' : X' β†’ Y') (y : Y) (y' : Y')
(hx : Fintype.card X = Fintype.card X')
(hf : βˆ€ z, Fintype.card {x // f x = z} = Fintype.card {x // f x = y})
(hf' : βˆ€ z, Fintype.card {x // f' x = z} = Fintype.card {x // f' x = y'})
(hy : 0 < Fintype.card {x // f x = y})
(he : Fintype.card {x // f x = y} = Fintype.card {x // f' x = y'}) :
Fintype.card Y = Fintype.card Y' := by
have h := (card_eq_mul_fiber f y hf).symm.trans
(hx.trans (card_eq_mul_fiber f' y' hf'))
rw [←he] at h
exact Nat.eq_of_mul_eq_mul_right hy h
private theorem range_card_mul_fiber {X Y : Type*} [Fintype X]
(f : X β†’ Y) (xβ‚€ : X)
(h : βˆ€ x, Nat.card {z // f z = f x} = Nat.card {z // f z = f xβ‚€}) :
Fintype.card X = Nat.card (Set.range f) * Nat.card {z // f z = f xβ‚€} := by
let := (Set.finite_range f).fintype
let fR : X β†’ Set.range f := fun x => ⟨f x,⟨x,rfl⟩⟩
have k (y : Set.range f) : Nat.card {x // fR x = y} =
Nat.card {z // f z = f xβ‚€} := by
have hp (x : X) : fR x = y ↔ f x = y.1 := Subtype.ext_iff
rw [Nat.card_congr (Equiv.subtypeEquivRight hp)]
obtain ⟨x,hx⟩ := y.2
rw [←hx]
exact h x
have hh := card_eq_mul_fiber fR (fR xβ‚€) (fun y => by
simpa only [←Nat.card_eq_fintype_card] using (k y).trans (k (fR xβ‚€)).symm)
have hh' : Nat.card X = Nat.card (Set.range f) * Nat.card {x // fR x = fR xβ‚€} := by
simpa only [←Nat.card_eq_fintype_card] using hh
rw [k] at hh'
simpa only [←Nat.card_eq_fintype_card] using hh'
variable {R I A B P : Type*} [finiteI : Fintype I] [DecidableEq I]
variable [finiteA : Fintype A] [Fintype B] [nonemptyA : Nonempty A] [Nonempty B] [finiteP : Fintype P]
variable {s : β„•}
def Molecules (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I)
(p : P β†’ A) (Ο„ : Set (Formula R I)) :=
{a : Fin s β†’ A // tupleType S ep (Sum.elim p a) = Ο„}
instance (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I)
(p : P β†’ A) (Ο„ : Set (Formula R I)) : Fintype (Molecules S ep p Ο„) :=
inferInstanceAs (Fintype {a : Fin s β†’ A // tupleType S ep (Sum.elim p a) = Ο„})
def labelValues (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I)
(e2 : Fin s βŠ• Fin s β†ͺ I) (p : P β†’ A) (Ο„ : Set (Formula R I))
(Ο† : Form (Fin s) (Set (Formula R I))) : Set (HF A) :=
Set.range (fun a : Molecules S ep p Ο„ => Form.value S e2 Ο† a.1)
instance (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I)
(e2 : Fin s βŠ• Fin s β†ͺ I) (p : P β†’ A) (Ο„ : Set (Formula R I))
(Ο† : Form (Fin s) (Set (Formula R I))) : Fintype (labelValues S ep e2 p Ο„ Ο†) :=
(Set.finite_range _).fintype
section Group
variable {G : Type*} [Group G] [MulAction G A]
variable (S : Structure R A) (ep : P βŠ• Fin s β†ͺ I) (e2 : Fin s βŠ• Fin s β†ͺ I)
variable (hAut : βˆ€ (g : G) r a b, S.rel r (g β€’ a) (g β€’ b) ↔ S.rel r a b)
variable (p : P β†’ A) (Ο„ : Set (Formula R I))
omit R I A P s G S ep hAut p in
private theorem mol_type_smul.{uDecl1, uDecl2, uDecl3, uDecl5, uDecl6}
{R : Type uDecl1}
{I : Type uDecl2}
{A : Type uDecl3}
{P : Type uDecl5}
[Fintype I]
[DecidableEq I]
[Fintype A]
[Nonempty A]