Download data/lean/OAI/Combinatorics/InfiniteMatroid/OrdinalRank.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.31 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/InfiniteMatroid/OrdinalRank.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/InfiniteMatroid/OrdinalRank.lean
-
curl -L -o OrdinalRank.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/InfiniteMatroid/OrdinalRank.lean
5.31 kB
| import OAI.Combinatorics.InfiniteMatroid.Ideals | |
| namespace OAI | |
| section | |
| open Set Filter | |
| open scoped symmDiff | |
| namespace InfiniteMatroidCounterexample | |
| namespace SubsetIdeal | |
| variable {Ξ± : Type} (K : SubsetIdeal Ξ±) (U : Ultrafilter Ξ±) | |
| (hUK : β N, K.small N β N β U) | |
| include hUK in | |
| lemma large_of_modSubset {X Y : Set Ξ±} (hX : X β U) (hXY : K.ModSubset X Y) : Y β U := by | |
| have hc : (X \ Y)αΆ β U := Ultrafilter.compl_mem_iff_notMem.mpr (hUK _ hXY) | |
| exact Filter.mem_of_superset (inter_mem hX hc) (by intro x hx; by_contra hy; exact hx.2 β¨hx.1, hyβ©) | |
| include hUK in | |
| lemma large_iff_symmDiff {X Y : Set Ξ±} (h : K.small (X β Y)) : X β U β Y β U := by | |
| exact β¨fun hX β¦ K.large_of_modSubset U hUK hX (K.mono h (by simp [symmDiff_def])), | |
| fun hY β¦ K.large_of_modSubset U hUK hY (K.mono h (by simp [symmDiff_def]))β© | |
| end SubsetIdeal | |
| /-- The properties of the ordinal rank which are used by the global assembly. -/ | |
| structure RankModel (Ξ± : Type) where | |
| ideal : SubsetIdeal Ξ± | |
| ultra : Ultrafilter Ξ± | |
| avoids : β N, ideal.small N β N β ultra | |
| rank : Set Ξ± β CIndex | |
| antitone : β β¦X Yβ¦, X β ultra β Y β ultra β ideal.ModSubset X Y β rank Y β€ rank X | |
| thinning : β s X, s β X β s β ultra β X β ultra β β Ξ³ : CIndex, | |
| β u, s β u β§ u β X β§ u β ultra β§ Ξ³ < rank u | |
| namespace RankModel | |
| variable {Ξ± : Type} (R : RankModel Ξ±) | |
| lemma invariant {X Y : Set Ξ±} (h : R.ideal.small (X β Y)) : | |
| (X β R.ultra β Y β R.ultra) β§ (X β R.ultra β R.rank X = R.rank Y) := by | |
| have he := R.ideal.large_iff_symmDiff R.ultra R.avoids h | |
| refine β¨he, fun hX β¦ le_antisymm ?_ ?_β© | |
| Β· exact R.antitone (he.mp hX) hX (R.ideal.mono h (by simp [symmDiff_def])) | |
| Β· exact R.antitone hX (he.mp hX) (R.ideal.mono h (by simp [symmDiff_def])) | |
| end RankModel | |
| section Construction | |
| variable {Ξ± : Type} | |
| variable (K : SubsetIdeal Ξ±) (G : CIndex β Set Ξ±) (U : Ultrafilter Ξ±) | |
| (hUK : β N, K.small N β N β U) (hG : β t, G t β U) | |
| (hfinite : β X, X β U β {t | K.ModSubset X (G t)}.Finite) | |
| lemma exists_large_enumeration [Countable Ξ±] [Infinite Ξ±] : β F : CIndex β Set Ξ±, | |
| (β i, F i β U) β§ β X, X β U β β i, F i = X := by | |
| classical | |
| obtain β¨e, heβ© := exists_set_enumeration Ξ± | |
| refine β¨fun i β¦ if e i β U then e i else univ, ?_, ?_β© | |
| Β· intro i | |
| dsimp only | |
| split_ifs with h | |
| Β· exact h | |
| Β· exact univ_mem | |
| Β· intro X hX | |
| obtain β¨i, hiβ© := he X | |
| exact β¨i, by simp [hi, hX]β© | |
| variable (F : CIndex β Set Ξ±) (hF : β i, F i β U) | |
| (hFs : β X, X β U β β i, F i = X) | |
| include hFs in | |
| lemma rank_candidates_nonempty {X : Set Ξ±} (hX : X β U) : | |
| {i | K.ModSubset (F i) X}.Nonempty := by | |
| obtain β¨i, rflβ© := hFs X hX | |
| exact β¨i, K.modSubset_refl _β© | |
| noncomputable def ordinalRank (X : Set Ξ±) : CIndex := by | |
| classical | |
| exact if hX : X β U then wellFounded_lt.min {i | K.ModSubset (F i) X} | |
| (rank_candidates_nonempty K U F hFs hX) | |
| else cindexBinaryEquiv.symm (fun _ β¦ false) | |
| lemma ordinalRank_spec {X : Set Ξ±} (hX : X β U) : | |
| K.ModSubset (F (ordinalRank K U F hFs X)) X := by | |
| rw [ordinalRank, dite_eq_left hX] | |
| exact (wellFounded_lt (Ξ± := CIndex)).min_mem {i | K.ModSubset (F i) X} | |
| (rank_candidates_nonempty K U F hFs hX) | |
| lemma ordinalRank_le {X : Set Ξ±} (hX : X β U) {i : CIndex} (hi : K.ModSubset (F i) X) : | |
| ordinalRank K U F hFs X β€ i := by | |
| rw [ordinalRank, dite_eq_left hX] | |
| exact WellFoundedLT.min_le (s := {index | K.ModSubset (F index) X}) hi | |
| lemma ordinalRank_antitone {X Y : Set Ξ±} (hX : X β U) (hY : Y β U) | |
| (hXY : K.ModSubset X Y) : ordinalRank K U F hFs Y β€ ordinalRank K U F hFs X := | |
| ordinalRank_le K U F hFs hY (K.modSubset_trans (ordinalRank_spec K U F hFs hX) hXY) | |
| include hG hfinite hF in | |
| lemma ordinalRank_thinning (s X : Set Ξ±) (hsX : s β X) (hs : s β U) (hX : X β U) | |
| (Ξ³ : CIndex) : β u, s β u β§ u β X β§ u β U β§ Ξ³ < ordinalRank K U F hFs u := by | |
| classical | |
| let Y (i : Iic Ξ³) := F i β© (X \ s) | |
| have hY : β i, Y i β U := fun i β¦ | |
| inter_mem (hF i) (inter_mem hX (Ultrafilter.compl_mem_iff_notMem.mpr hs)) | |
| obtain β¨t, htβ© := exists_avoid_finite_family (cindex_initial_segment Ξ³) | |
| (fun i : Iic Ξ³ β¦ {t | K.ModSubset (Y i) (G t)}) (fun i β¦ hfinite _ (hY i)) | |
| let u := s βͺ (X β© G t) | |
| have hu : u β U := Filter.mem_of_superset (inter_mem hX (hG t)) subset_union_right | |
| refine β¨u, subset_union_left, union_subset hsX inter_subset_left, hu, ?_β© | |
| apply lt_of_not_ge | |
| intro hr | |
| let i : Iic Ξ³ := β¨ordinalRank K U F hFs u, hrβ© | |
| apply ht i | |
| apply K.mono (ordinalRank_spec K U F hFs hu) | |
| intro x hx | |
| refine β¨hx.1.1, ?_β© | |
| rintro (hxs | hxG) | |
| Β· exact hx.1.2.2 hxs | |
| Β· exact hx.2 hxG.2 | |
| include hUK hG hfinite in | |
| lemma exists_rankModel [Countable Ξ±] [Infinite Ξ±] : β R : RankModel Ξ±, R.ideal = K β§ R.ultra = U := by | |
| classical | |
| obtain β¨F, hF, hFsβ© := exists_large_enumeration U | |
| refine β¨β¨K, U, hUK, ordinalRank K U F hFs, | |
| ?_, ?_β©, rfl, rflβ© | |
| Β· exact fun _ _ hX hY hXY β¦ ordinalRank_antitone K U F hFs hX hY hXY | |
| Β· exact ordinalRank_thinning K G U hG hfinite F hF hFs | |
| end Construction | |
| end InfiniteMatroidCounterexample | |
| end | |
| end OAI | |