File size: 2,079 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
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