Download data/lean/OAI/RingTheory/DirectFiniteness/DirectionCompleteness.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.08 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/RingTheory/DirectFiniteness/DirectionCompleteness.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/RingTheory/DirectFiniteness/DirectionCompleteness.lean
-
curl -L -o DirectionCompleteness.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/RingTheory/DirectFiniteness/DirectionCompleteness.lean
2.08 kB
| import OAI.RingTheory.DirectFiniteness.ChosenCriterion | |
| namespace OAI | |
| noncomputable section | |
| open scoped Classical | |
| namespace KaplanskyCounterexample.Prescription | |
| open IncidenceDirections | |
| variable (β : β) [Fact β.Prime] | |
| lemma every_direction (S : Submodule (ZMod β) (Fin 2 β ZMod β)) | |
| (hS : Module.finrank (ZMod β) S=1) : | |
| β d : Option (ZMod β), LinearMap.range (directionMap d)=S := by | |
| have hne : S β β₯ := by | |
| intro he | |
| rw [he, finrank_bot] at hS | |
| omega | |
| obtain β¨x,hx,hx0β© := Submodule.exists_mem_ne_zero_of_ne_bot hne | |
| obtain β¨d,c,hc,hcxβ© := directionMap_covers x hx0 | |
| refine β¨d,Submodule.eq_of_le_of_finrank_eq ?_ ?_β© | |
| Β· have h1 : directionMap d 1 β S := by | |
| have hh := S.smul_mem cβ»ΒΉ hx | |
| rw [β hcx,β map_smul] at hh | |
| simpa [hc] using hh | |
| rintro y β¨k,rflβ© | |
| have hh := S.smul_mem k h1 | |
| rw [β map_smul] at hh | |
| simpa using hh | |
| Β· rw [direction_range_finrank,hS] | |
| lemma mem_directionSet (d : Option (ZMod β)) (x : Fin 2 β ZMod β) : | |
| x β directionSet β d β x β LinearMap.range (directionMap d) := by | |
| simp only [directionSet,Finset.mem_image,Finset.mem_univ,true_and,LinearMap.mem_range] | |
| lemma every_direction_unique (S : Submodule (ZMod β) (Fin 2 β ZMod β)) | |
| (hS : Module.finrank (ZMod β) S=1) : | |
| β! d : Option (ZMod β), LinearMap.range (directionMap d)=S := by | |
| obtain β¨d,hdβ© := every_direction β S hS | |
| refine β¨d,hd,?_β© | |
| intro e he | |
| apply directionSet_injective β | |
| ext x | |
| rw [mem_directionSet,mem_directionSet,he,hd] | |
| lemma orderedAssignment_strictMono {V F : Type} [Fintype F] [LinearOrder F] | |
| (Inc : F β Finset V) (hdeg : β v, Fintype.card {f : F // v β Inc f}=β+1) (v : V) : | |
| letI := directionOrder β | |
| StrictMono (orderedAssignment β Inc hdeg v) := by | |
| let := directionOrder β | |
| exact (Fintype.orderIsoFinOfCardEq (Option (ZMod β)) (by simp)).strictMono.comp | |
| (Fintype.orderIsoFinOfCardEq {f : F // v β Inc f} (hdeg v)).symm.strictMono | |
| end KaplanskyCounterexample.Prescription | |
| end | |
| end OAI | |