math / data /lean /OAI /RingTheory /DirectFiniteness /AssignedDevelopment.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.02 kB
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