FoxDifferential.Completed.FiniteStage.Basic
This module develops the Fox-differential part of the theory. It records the formulas that connect generators, boundaries, Jacobians, and completed coordinates.
theorem modNCompletedGroupAlgebraStageMap_algebraMap
(U : _root_.CompletedGroupAlgebra.CompletedGroupAlgebraIndex G) (c : ModNCompletedCoeff n) :
modNCompletedGroupAlgebraStageMap n G U
(algebraMap (ModNCompletedCoeff n) (ModNCompletedGroupRing n G) c) =
algebraMap (ModNCompletedCoeff n) (ModNCompletedGroupAlgebraStage n G U) cThe finite-stage completed group-algebra projection preserves coefficient algebra maps.
Show proof
by
rcases ZMod.intCast_surjective c with ⟨t, rfl⟩
simp only [modNCompletedGroupAlgebraStageMap, map_intCast]Proof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□def finiteFoxCommutatorPowerRelatorSet (N : Subgroup F) (n : ℕ) : Set F :=
{g | (∃ a ∈ N, ∃ b ∈ N, ⁅a, b⁆ = g) ∨ ∃ a ∈ N, a ^ n = g}Relators defining the finite Fox source quotient: commutators in \(N\) and \(n\)-th powers in \(N\).
def finiteFoxCommutatorPowerSubgroup (N : Subgroup F) (n : ℕ) : Subgroup F :=
Subgroup.normalClosure (finiteFoxCommutatorPowerRelatorSet (F := F) N n)Normal subgroup generated by commutators in \(N\) and \(n\)-th powers in \(N\).
instance finiteFoxCommutatorPowerSubgroup_normal
(N : Subgroup F) (n : ℕ) :
(finiteFoxCommutatorPowerSubgroup (F := F) N n).Normal := by
dsimp [finiteFoxCommutatorPowerSubgroup]
infer_instanceThe finite Fox commutator-power subgroup is normal by construction.
theorem finiteFoxCommutatorPowerRelatorSet_subset
(N : Subgroup F) (n : ℕ) :
finiteFoxCommutatorPowerRelatorSet (F := F) N n ⊆ NThe finite Fox commutator-power relator set is contained in N.
Show proof
by
intro g hg
rcases hg with ⟨a, ha, b, hb, rfl⟩ | ⟨a, ha, rfl⟩
· rw [commutatorElement_def]
exact N.mul_mem (N.mul_mem (N.mul_mem ha hb) (N.inv_mem ha)) (N.inv_mem hb)
· exact N.pow_mem ha nProof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□theorem finiteFoxCommutatorPowerSubgroup_le_normal
(N : Subgroup F) [N.Normal] (n : ℕ) :
finiteFoxCommutatorPowerSubgroup (F := F) N n ≤ NThe finite Fox commutator-power subgroup is contained in \(N\) when \(N\) is normal.
Show proof
by
exact Subgroup.normalClosure_le_normal
(finiteFoxCommutatorPowerRelatorSet_subset (F := F) N n)Proof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□def finiteFoxCommutatorPowerQuotientMapToNormalQuotient
(N : Subgroup F) [N.Normal] (n : ℕ) :
F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n →* F ⧸ N :=
QuotientGroup.map _ _ (MonoidHom.id F)
(finiteFoxCommutatorPowerSubgroup_le_normal (F := F) N n)Natural quotient map \(F/[N,N]N^n \to F/N\).
theorem finiteFoxCommutatorPowerQuotientMapToNormalQuotient_mk
(N : Subgroup F) [N.Normal] (n : ℕ) (g : F) :
finiteFoxCommutatorPowerQuotientMapToNormalQuotient (F := F) N n
(QuotientGroup.mk'
(finiteFoxCommutatorPowerSubgroup (F := F) N n) g) =
QuotientGroup.mk' N gEvaluation of the natural quotient map \(F/[N,N]N^n \to F/N\) on a representative.
Show proof
by
rflProof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□theorem finiteFoxCommutatorPowerQuotientMapToNormalQuotient_surjective
(N : Subgroup F) [N.Normal] (n : ℕ) :
Function.Surjective
(finiteFoxCommutatorPowerQuotientMapToNormalQuotient (F := F) N n)The natural quotient map \(F/[N,N]N^n \to F/N\) is surjective.
Show proof
by
intro y
rcases QuotientGroup.mk'_surjective N y with ⟨g, rfl⟩
exact ⟨QuotientGroup.mk'
(finiteFoxCommutatorPowerSubgroup (F := F) N n) g, rfl⟩Proof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□def finiteFoxCommutatorPowerGroupAlgebraMap
(N : Subgroup F) [N.Normal] (n : ℕ) :
MonoidAlgebra (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) →+*
MonoidAlgebra (ModNCompletedCoeff n) (F ⧸ N) :=
MonoidAlgebra.mapDomainRingHom (ModNCompletedCoeff n)
(finiteFoxCommutatorPowerQuotientMapToNormalQuotient (F := F) N n)Group-algebra map induced by the natural quotient \(F/[N,N]N^n \to F/N\).
def finiteFoxCommutatorPowerGroupAlgebraAlgHom
(N : Subgroup F) [N.Normal] (n : ℕ) :
MonoidAlgebra (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) →ₐ[
ModNCompletedCoeff n]
MonoidAlgebra (ModNCompletedCoeff n) (F ⧸ N) :=
MonoidAlgebra.mapDomainAlgHom (ModNCompletedCoeff n) (ModNCompletedCoeff n)
(finiteFoxCommutatorPowerQuotientMapToNormalQuotient (F := F) N n)Algebra-hom version of the group-algebra map induced by \(F/[N,N]N^n \to F/N\).
theorem finiteFoxCommutatorPowerGroupAlgebraAlgHom_apply
(N : Subgroup F) [N.Normal] (n : ℕ)
(x : MonoidAlgebra (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n)) :
finiteFoxCommutatorPowerGroupAlgebraAlgHom (F := F) N n x =
finiteFoxCommutatorPowerGroupAlgebraMap (F := F) N n xThe algebra-hom and ring-hom versions of the finite Fox quotient map agree on values.
Show proof
rflProof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□def finiteFoxCommutatorPowerSourceGroupAlgebraAugmentation
(N : Subgroup F) (n : ℕ) :
MonoidAlgebra (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) →ₐ[
ModNCompletedCoeff n] ModNCompletedCoeff n :=
MonoidAlgebra.lift (ModNCompletedCoeff n) (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n)
(1 : (F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) →*
ModNCompletedCoeff n)Augmentation map on the finite Fox source group algebra.
theorem finiteFoxCommutatorPowerSourceGroupAlgebraAugmentation_of_quotient
(N : Subgroup F) (n : ℕ)
(q : F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) :
finiteFoxCommutatorPowerSourceGroupAlgebraAugmentation (F := F) N n
(MonoidAlgebra.of (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) q) =
1The source augmentation sends every quotient group basis element to \(1\).
Show proof
by
simp only [finiteFoxCommutatorPowerSourceGroupAlgebraAugmentation, MonoidAlgebra.of_apply,
MonoidAlgebra.lift_single, MonoidHom.one_apply, smul_eq_mul, mul_one]Proof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□theorem finiteFoxCommutatorPowerGroupAlgebraMap_of
(N : Subgroup F) [N.Normal] (n : ℕ) (g : F) :
finiteFoxCommutatorPowerGroupAlgebraMap (F := F) N n
(MonoidAlgebra.of (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n)
(QuotientGroup.mk'
(finiteFoxCommutatorPowerSubgroup (F := F) N n) g)) =
MonoidAlgebra.of (ModNCompletedCoeff n) (F ⧸ N) (QuotientGroup.mk' N g)The finite Fox source-to-target group-algebra map evaluated on a represented word.
Show proof
by
simp only [finiteFoxCommutatorPowerGroupAlgebraMap, MonoidAlgebra.of, MonoidAlgebra.single,
QuotientGroup.mk'_apply, MonoidHom.coe_mk, OneHom.coe_mk, MonoidAlgebra.mapDomainRingHom_apply,
Finsupp.mapDomain_single]
simpa using congrArg
(fun q : F ⧸ N => Finsupp.single q (1 : ModNCompletedCoeff n))
(finiteFoxCommutatorPowerQuotientMapToNormalQuotient_mk (F := F) N n g)Proof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□theorem finiteFoxCommutatorPowerGroupAlgebraMap_of_quotient
(N : Subgroup F) [N.Normal] (n : ℕ)
(q : F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) :
finiteFoxCommutatorPowerGroupAlgebraMap (F := F) N n
(MonoidAlgebra.of (ModNCompletedCoeff n)
(F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n) q) =
MonoidAlgebra.of (ModNCompletedCoeff n) (F ⧸ N)
(finiteFoxCommutatorPowerQuotientMapToNormalQuotient (F := F) N n q)The finite Fox source-to-target group-algebra map evaluated on a quotient basis element.
Show proof
by
rcases QuotientGroup.mk'_surjective
(finiteFoxCommutatorPowerSubgroup (F := F) N n) q with ⟨g, rfl⟩
rw [finiteFoxCommutatorPowerGroupAlgebraMap_of,
finiteFoxCommutatorPowerQuotientMapToNormalQuotient_mk]Proof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□theorem finiteFoxCommutatorPowerGroupAlgebraMap_single_apply
(N : Subgroup F) [N.Normal] (n : ℕ)
(q : F ⧸ finiteFoxCommutatorPowerSubgroup (F := F) N n)
(a : ModNCompletedCoeff n) :
finiteFoxCommutatorPowerGroupAlgebraMap (F := F) N n
(MonoidAlgebra.single q a) =
MonoidAlgebra.single
(finiteFoxCommutatorPowerQuotientMapToNormalQuotient (F := F) N n q) aThe finite Fox source-to-target group-algebra map evaluated on a single coefficient basis term.
Show proof
by
rw [finiteFoxCommutatorPowerGroupAlgebraMap]
exact Finsupp.mapDomain_singleProof. Work at the specified finite Fox stage. The quotient group and coefficient ring are finite, so all group-algebra expressions have finite support and the formulas are checked on group-like basis elements. The crossed-differential rule gives the product, inverse, derivative, and boundary identities; coefficient maps, quotient maps, source/target refinements, relation submodules, and semidirect constructions are then verified coordinatewise and extended by linearity. For stage systems or limit-comparison statements, compatibility under refinement and projection extensionality assemble the coordinate calculations.
□