File size: 5,019 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 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 | import OAI.RingTheory.DirectFiniteness.IncidenceDirections
namespace OAI
universe u_1 u_2 u_3
noncomputable section
open scoped Classical BigOperators
namespace KaplanskyCounterexample.AssignedDirections
open IncidenceDirections
variable {V : Type u_1} {F : Type u_2} (Inc : F β Finset V) (β : β) [Fact β.Prime]
variable (assign : β v, {f : F // v β Inc f} β Option (ZMod β))
def incidenceMap (v : V) (f : {f : F // v β Inc f}) : ZMod β β+ (Fin 2 β ZMod β) :=
(directionMap (assign v f)).toAddMonoidHom
lemma incidenceMap_injective (v : V) (f : {f : F // v β Inc f}) :
Function.Injective (incidenceMap Inc β assign v f) := directionMap_injective _
lemma incidenceMap_independent (v : V) (f g : {f : F // v β Inc f}) (hne : f β g)
(a b : ZMod β) (h : incidenceMap Inc β assign v f a + incidenceMap Inc β assign v g b = 0) :
a = 0 β§ b = 0 := directionMap_independent ((assign v).injective.ne hne) a b h
lemma incidenceMap_covers (v : V) (a : Fin 2 β ZMod β) (ha : a β 0) :
β (f : F) (hf : v β Inc f) (c : ZMod β), c β 0 β§ incidenceMap Inc β assign v β¨f,hfβ© c = a := by
obtain β¨d,c,hc,hcaβ© := directionMap_covers a ha
obtain β¨f,hfβ© := (assign v).surjective d
exact β¨f.val,f.property,c,hc,by simpa [incidenceMap,hf] using hcaβ©
end KaplanskyCounterexample.AssignedDirections
namespace KaplanskyCounterexample.AssignedDevelopment
open GluedGroup AssignedDirections IncidenceDirections
variable {V F : Type} (Inc : F β Finset V) (β : β) [Fact β.Prime]
variable (assign : β v, {f : F // v β Inc f} β Option (ZMod β))
variable (hInc : β f, (Inc f).Nonempty)
abbrev maps := AssignedDirections.incidenceMap Inc β assign
lemma covers : CoversPoints Inc β (maps Inc β assign) :=
AssignedDirections.incidenceMap_covers Inc β assign
abbrev Base := N Inc β (maps Inc β assign)
def point (v : V) : PointGroup β β* Base Inc β assign :=
theta Inc β (maps Inc β assign) (covers Inc β assign) v
include hInc in
lemma point_injective
(hg : 12 β€ (Planar.incidenceGraph (fun v f => v β Inc f)).egirth) (v : V) :
Function.Injective (point Inc β assign v) := by
apply theta_injective _ _ _ _ hInc _ _ hg v
Β· intro v f hv
rw [totalMap_of_mem _ _ _ v f hv]
exact AssignedDirections.incidenceMap_injective Inc β assign v β¨f, hvβ©
Β· intro v f g hf hg hne a b hab
rw [totalMap_of_mem _ _ _ v f hf, totalMap_of_mem _ _ _ v g hg] at hab
exact (AssignedDirections.incidenceMap_independent Inc β assign v β¨f, hfβ© β¨g, hgβ©
(fun h => hne (congrArg Subtype.val h)) a b hab).1
def line (f : F) : Multiplicative (ZMod β) β* Base Inc β assign :=
(point Inc β assign ((hInc f).choose)).comp
(AddMonoidHom.toMultiplicative (maps Inc β assign (hInc f).choose
β¨f, (hInc f).choose_specβ©))
lemma point_direction (v : V) (f : F) (hf : v β Inc f) (c : ZMod β) :
point Inc β assign v (Multiplicative.ofAdd (maps Inc β assign v β¨f, hfβ© c)) =
line Inc β assign hInc f (Multiplicative.ofAdd c) := by
by_cases hc : c = 0
Β· subst c
simp
Β· exact (theta_generator Inc β (maps Inc β assign) (covers Inc β assign) v f hf c hc).trans
(theta_generator Inc β (maps Inc β assign) (covers Inc β assign) (hInc f).choose f (hInc f).choose_spec c hc).symm
lemma line_injective
(hg : 12 β€ (Planar.incidenceGraph (fun v f => v β Inc f)).egirth) (f : F) :
Function.Injective (line Inc β assign hInc f) := by
apply (point_injective Inc β assign hInc hg (hInc f).choose).comp
exact AssignedDirections.incidenceMap_injective Inc β assign _ _
variable [Fintype F]
lemma subgroup_decomposition {K : Type u_3} [CommRing K] (v : V) :
β a : PointGroup β, MonoidAlgebra.single (point Inc β assign v a) (1 : K) =
1 + β f : {f : F // v β Inc f},
((β c : Multiplicative (ZMod β), MonoidAlgebra.single (line Inc β assign hInc f.val c) (1 : K)) - 1) := by
have h := sum_directions (K := ZMod β) (fun a =>
MonoidAlgebra.single (point Inc β assign v (Multiplicative.ofAdd a)) (1 : K))
rw [β Equiv.sum_comp Multiplicative.ofAdd
(fun a : PointGroup β => MonoidAlgebra.single (point Inc β assign v a) (1 : K))]
rw [h]
simp only [ofAdd_zero, map_one, β MonoidAlgebra.one_def]
congr 1
rw [β Equiv.sum_comp (assign v)
(fun d : Option (ZMod β) =>
(β c : ZMod β, MonoidAlgebra.single
(point Inc β assign v (Multiplicative.ofAdd (directionMap d c))) (1 : K)) - 1)]
apply Finset.sum_congr rfl
intro f _
congr 1
rw [β Equiv.sum_comp Multiplicative.ofAdd
(fun c : Multiplicative (ZMod β) => MonoidAlgebra.single (line Inc β assign hInc f.val c) (1 : K))]
apply Finset.sum_congr rfl
intro c _
exact congrArg (fun g => MonoidAlgebra.single g (1 : K))
(point_direction Inc β assign hInc v f.val f.property c)
end KaplanskyCounterexample.AssignedDevelopment
end
end OAI
|