FoxDifferential.Completed.FiniteStage.RelationModule
This module sets up the finite-stage and inverse-limit description of the construction. It records the stage maps, projections, and comparison lemmas used to pass back to the completed object.
abbrev finiteFoxStageRelationGroup : Type u :=
(finiteFoxCommutatorPowerQuotientMapToNormalQuotient
(F := FreeGroup X) N n).kertheorem finiteFoxStageRelationGroup_target_eq_one
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxCommutatorPowerQuotientMapToNormalQuotient
(F := FreeGroup X) N n q.1 = 1Every finite-stage relation group element maps to \(1\) in the target normal quotient.
Show proof
q.2Proof. 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 finiteFoxStageQuotientCoefficient_relation_eq_one
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxStageQuotientCoefficient (X := X) N n q.1 = 1Every finite-stage relation group element has quotient coefficient equal to \(1\).
Show proof
finiteFoxStageQuotientCoefficient_eq_one_of_kernel (X := X) N n q.2Proof. 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 finiteFoxStageRelationBoundaryAddMonoidHom :
Additive (finiteFoxStageRelationGroup (X := X) N n) →+
finiteFoxStageCoordinateVector (X := X) N n :=
IsCrossedDifferential.restrictTrivialSubgroupAddMonoidHom
(finiteFoxStageQuotientDerivativeVector_isCrossedDifferential (X := X) N n)
((finiteFoxCommutatorPowerQuotientMapToNormalQuotient
(F := FreeGroup X) N n).ker)
(fun q => finiteFoxStageQuotientCoefficient_relation_eq_one (X := X) N n q)
@[simp]The finite-stage relation boundary, written additively: \(N/[N,N]N^n \to ((\mathbb{Z}/n\mathbb{Z})[F/N])^X\).
theorem finiteFoxStageRelationBoundaryAddMonoidHom_of
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxStageRelationBoundaryAddMonoidHom (X := X) N n (Additive.ofMul q) =
finiteFoxStageQuotientDerivativeVector (X := X) N n q.1Show 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 finiteFoxStageRelationBoundaryRange :
AddSubgroup (finiteFoxStageCoordinateVector (X := X) N n) :=
finiteFoxStageSourceKernelDerivativeAddSubgroup (X := X) N n
@[simp]The relation-boundary image, as an additive subgroup of the finite coordinate module.
theorem finiteFoxStageRelationBoundaryRange_coe :
((finiteFoxStageRelationBoundaryRange (X := X) N n :
AddSubgroup (finiteFoxStageCoordinateVector (X := X) N n)) :
Set (finiteFoxStageCoordinateVector (X := X) N n)) =
finiteFoxStageSourceKernelDerivativeSet (X := X) N nThe relation-boundary range has the finite-stage source-kernel derivative set as its underlying set.
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.
□theorem mem_finiteFoxStageRelationBoundaryRange_iff
{v : finiteFoxStageCoordinateVector (X := X) N n} :
v ∈ finiteFoxStageRelationBoundaryRange (X := X) N n ↔
∃ q : Additive (finiteFoxStageRelationGroup (X := X) N n),
finiteFoxStageRelationBoundaryAddMonoidHom (X := X) N n q = vMembership in the finite-stage relation-boundary range is equivalent to the displayed coordinate condition.
Show proof
by
constructor
· intro hv
rcases hv with ⟨q, hq, hv⟩
let qrel : finiteFoxStageRelationGroup (X := X) N n := ⟨q, hq⟩
refine ⟨Additive.ofMul qrel, ?_⟩
simpa [qrel] using hv
· rintro ⟨q, hq⟩
let qrel : finiteFoxStageRelationGroup (X := X) N n := Additive.toMul q
refine ⟨qrel.1, qrel.2, ?_⟩
simpa [qrel] using hqProof. 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 finiteFoxStageFoxBoundary_relationBoundary_eq_zero
[Fintype X] (q : Additive (finiteFoxStageRelationGroup (X := X) N n)) :
finiteFoxStageFoxBoundary (X := X) N n
(finiteFoxStageRelationBoundaryAddMonoidHom (X := X) N n q) = 0Show proof
by
change
finiteFoxStageFoxBoundary (X := X) N n
(finiteFoxStageQuotientDerivativeVector (X := X) N n (Additive.toMul q).1) = 0
rw [finiteFoxStageFoxBoundary_quotientDerivativeVector]
rw [finiteFoxStageQuotientCoefficient_eq_one_of_kernel
(X := X) N n (Additive.toMul q).2]
simp only [sub_self]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 finiteFoxStageRelationBoundary_range_le_boundaryCycleSubmodule
[Fintype X] :
finiteFoxStageRelationBoundaryRange (X := X) N n ≤
(finiteFoxStageBoundaryCycleSubmodule (X := X) N n).toAddSubgroupThe relation-boundary range is contained in \(\ker \partial\).
Show proof
by
intro v hv
rw [mem_finiteFoxStageRelationBoundaryRange_iff (X := X) N n] at hv
rcases hv with ⟨q, rfl⟩
exact finiteFoxStageFoxBoundary_relationBoundary_eq_zero (X := X) N n qProof. 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 finiteFoxStageRelationBoundaryExact [Fintype X] : Prop :=
Function.Exact
(finiteFoxStageRelationBoundaryAddMonoidHom (X := X) N n)
(finiteFoxStageFoxBoundary (X := X) N n)Finite-stage exactness at the coordinate module.
theorem finiteFoxStageRelationBoundaryExact_iff_boundaryCyclesCoveredBySourceKernel
[Fintype X] :
finiteFoxStageRelationBoundaryExact (X := X) N n ↔
finiteFoxStageBoundaryCyclesCoveredBySourceKernel (X := X) N nFinite-stage exactness is equivalent to the coverage statement formulated at the level of finite-stage boundary cycles.
Show proof
by
constructor
· intro hexact v hv
have hvzero : finiteFoxStageFoxBoundary (X := X) N n v = 0 := hv
rcases (hexact v).1 hvzero with ⟨q, hq⟩
change v ∈ finiteFoxStageRelationBoundaryRange (X := X) N n
rw [mem_finiteFoxStageRelationBoundaryRange_iff (X := X) N n]
exact ⟨q, hq⟩
· intro hcovered v
constructor
· intro hvzero
have hvcycle : v ∈ finiteFoxStageBoundaryCycleSubmodule (X := X) N n := hvzero
have hvsource : v ∈ finiteFoxStageSourceKernelDerivativeSet (X := X) N n :=
hcovered hvcycle
have hvsourceRange : v ∈ finiteFoxStageRelationBoundaryRange (X := X) N n := by
change v ∈ finiteFoxStageSourceKernelDerivativeSet (X := X) N n
exact hvsource
rw [mem_finiteFoxStageRelationBoundaryRange_iff (X := X) N n] at hvsourceRange
exact hvsourceRange
· rintro ⟨q, hq⟩
rw [← hq]
exact finiteFoxStageFoxBoundary_relationBoundary_eq_zero (X := X) N n qProof. 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 finiteFoxStageRelationBoundaryExact_of_boundaryCyclesCoveredBySourceKernel
[Fintype X]
(hcovered : finiteFoxStageBoundaryCyclesCoveredBySourceKernel (X := X) N n) :
finiteFoxStageRelationBoundaryExact (X := X) N nShow proof
(finiteFoxStageRelationBoundaryExact_iff_boundaryCyclesCoveredBySourceKernel
(X := X) N n).2 hcoveredProof. 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 finiteFoxStageBoundaryCyclesCoveredBySourceKernel_of_relationBoundaryExact
[Fintype X]
(hexact : finiteFoxStageRelationBoundaryExact (X := X) N n) :
finiteFoxStageBoundaryCyclesCoveredBySourceKernel (X := X) N nFunction-level finite-stage exactness gives the set-level coverage used by the density step.
Show proof
(finiteFoxStageRelationBoundaryExact_iff_boundaryCyclesCoveredBySourceKernel
(X := X) N n).1 hexactProof. 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.
□