FoxDifferential.Completed.FiniteStage.RelationIdealPrimitive
This module develops the Fox-differential part of the theory. It records the formulas that connect generators, boundaries, Jacobians, and completed coordinates.
def finiteFoxStageSourceBoundaryPrimitive [Fintype X]
(x : finiteFoxStageSourceGroupAlgebra (X := X) N n) : Prop :=
∃ p : finiteFoxStageSourceCoordinateVector (X := X) N n,
finiteFoxStageSourceFoxBoundary (X := X) N n p = x ∧
finiteFoxStageCoordinateSourceToTarget (X := X) N n p ∈
finiteFoxStageRelationBoundarySubmodule (X := X) N nAn element of the source finite group algebra has a relation-compatible source Fox primitive if it is the source boundary of a vector whose target projection lies in the finite relation-boundary submodule.
theorem finiteFoxStageSourceBoundaryPrimitive_zero [Fintype X] :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n 0The zero source-boundary primitive.
Show proof
by
refine ⟨0, ?_, ?_⟩
· simp only [finiteFoxStageSourceFoxBoundary_apply, Pi.zero_apply, QuotientGroup.mk'_apply,
MonoidAlgebra.of_apply, zero_mul, Finset.sum_const_zero]
· exact (finiteFoxStageRelationBoundarySubmodule (X := X) N n).zero_memProof. 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 finiteFoxStageSourceBoundaryPrimitive_add [Fintype X]
{x y : finiteFoxStageSourceGroupAlgebra (X := X) N n}
(hx : finiteFoxStageSourceBoundaryPrimitive (X := X) N n x)
(hy : finiteFoxStageSourceBoundaryPrimitive (X := X) N n y) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n (x + y)Source-boundary primitives are closed under addition.
Show proof
by
rcases hx with ⟨px, hpx, hpxrel⟩
rcases hy with ⟨py, hpy, hpyrel⟩
refine ⟨px + py, ?_, ?_⟩
· rw [map_add, hpx, hpy]
· rw [map_add]
exact (finiteFoxStageRelationBoundarySubmodule (X := X) N n).add_mem hpxrel hpyrelProof. 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 finiteFoxStageSourceBoundaryPrimitive_neg [Fintype X]
{x : finiteFoxStageSourceGroupAlgebra (X := X) N n}
(hx : finiteFoxStageSourceBoundaryPrimitive (X := X) N n x) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n (-x)Source-boundary primitives are closed under negation.
Show proof
by
rcases hx with ⟨p, hp, hprel⟩
refine ⟨-p, ?_, ?_⟩
· rw [map_neg, hp]
· rw [map_neg]
exact (finiteFoxStageRelationBoundarySubmodule (X := X) N n).neg_mem hprelProof. 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 finiteFoxStageSourceBoundaryPrimitive_sub [Fintype X]
{x y : finiteFoxStageSourceGroupAlgebra (X := X) N n}
(hx : finiteFoxStageSourceBoundaryPrimitive (X := X) N n x)
(hy : finiteFoxStageSourceBoundaryPrimitive (X := X) N n y) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n (x - y)Source-boundary primitives are closed under subtraction.
Show proof
by
simpa [sub_eq_add_neg] using
finiteFoxStageSourceBoundaryPrimitive_add (X := X) N n hx
(finiteFoxStageSourceBoundaryPrimitive_neg (X := X) N n hy)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 finiteFoxStageSourceBoundaryPrimitive_smul [Fintype X]
(a : finiteFoxStageSourceGroupAlgebra (X := X) N n)
{x : finiteFoxStageSourceGroupAlgebra (X := X) N n}
(hx : finiteFoxStageSourceBoundaryPrimitive (X := X) N n x) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n (a • x)Source-boundary primitives are closed under left multiplication by source coefficients.
Show proof
by
rcases hx with ⟨p, hp, hprel⟩
refine ⟨a • p, ?_, ?_⟩
· rw [map_smul, hp]
· rw [finiteFoxStageCoordinateSourceToTarget_smul_source]
exact (finiteFoxStageRelationBoundarySubmodule (X := X) N n).smul_mem
(finiteFoxCommutatorPowerGroupAlgebraMap (F := FreeGroup X) N n a) hprelProof. 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 finiteFoxStageSourceBoundaryPrimitiveSubmodule [Fintype X] :
Submodule (finiteFoxStageSourceGroupAlgebra (X := X) N n)
(finiteFoxStageSourceGroupAlgebra (X := X) N n) where
carrier := {x | finiteFoxStageSourceBoundaryPrimitive (X := X) N n x}
zero_mem' := finiteFoxStageSourceBoundaryPrimitive_zero (X := X) N n
add_mem' := by
intro x y hx hy
exact finiteFoxStageSourceBoundaryPrimitive_add (X := X) N n hx hy
smul_mem' := by
intro a x hx
exact finiteFoxStageSourceBoundaryPrimitive_smul (X := X) N n a hx
@[simp]Source-boundary primitives form a left submodule of the source group algebra.
theorem finiteFoxStageSourceBoundaryPrimitiveSubmodule_coe [Fintype X] :
((finiteFoxStageSourceBoundaryPrimitiveSubmodule (X := X) N n :
Submodule (finiteFoxStageSourceGroupAlgebra (X := X) N n)
(finiteFoxStageSourceGroupAlgebra (X := X) N n)) :
Set (finiteFoxStageSourceGroupAlgebra (X := X) N n)) =
{x | finiteFoxStageSourceBoundaryPrimitive (X := X) N n x}The source-boundary primitive submodule has exactly the finite-stage source-boundary primitive elements 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.
□def finiteFoxStageRelationAugmentationPrimitiveVector
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxStageSourceCoordinateVector (X := X) N n :=
finiteFoxStageSourceDerivativeVector (X := X) N n q.1The source primitive attached to a finite relation q.
theorem finiteFoxStageSourceFoxBoundary_relationAugmentationPrimitiveVector
[Fintype X]
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxStageSourceFoxBoundary (X := X) N n
(finiteFoxStageRelationAugmentationPrimitiveVector (X := X) N n q) =
finiteFoxStageRelationAugmentationGenerator (X := X) N n qThe source boundary of the primitive vector for q is the augmentation generator \(q-1\).
Show proof
by
rw [finiteFoxStageRelationAugmentationPrimitiveVector,
finiteFoxStageSourceFoxBoundary_sourceDerivativeVector,
finiteFoxStageRelationAugmentationGenerator]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 finiteFoxStageCoordinateSourceToTarget_relationAugmentationPrimitiveVector
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxStageCoordinateSourceToTarget (X := X) N n
(finiteFoxStageRelationAugmentationPrimitiveVector (X := X) N n q) =
finiteFoxStageRelationBoundaryAddMonoidHom (X := X) N n (Additive.ofMul q)The target projection of the primitive vector for q is the finite relation boundary of q.
Show proof
by
rw [finiteFoxStageRelationAugmentationPrimitiveVector,
finiteFoxStageCoordinateSourceToTarget_sourceDerivativeVector,
finiteFoxStageRelationBoundaryAddMonoidHom_of]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 finiteFoxStageSourceBoundaryPrimitive_relationAugmentationGenerator
[Fintype X]
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n
(finiteFoxStageRelationAugmentationGenerator (X := X) N n q)Relation augmentation generators have relation-compatible source Fox primitives.
Show proof
by
refine ⟨finiteFoxStageRelationAugmentationPrimitiveVector (X := X) N n q, ?_, ?_⟩
· exact finiteFoxStageSourceFoxBoundary_relationAugmentationPrimitiveVector
(X := X) N n q
· rw [finiteFoxStageCoordinateSourceToTarget_relationAugmentationPrimitiveVector]
exact finiteFoxStageRelationBoundaryRange_subset_relationBoundarySubmodule
(X := X) N n
((mem_finiteFoxStageRelationBoundaryRange_iff (X := X) N n).2
⟨Additive.ofMul q, 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.
□theorem finiteFoxStageSourceBoundaryPrimitive_sourceBasis_mul_relationAugmentationGenerator
[Fintype X]
(s : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n)
(q : finiteFoxStageRelationGroup (X := X) N n) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n
(MonoidAlgebra.of (ModNCompletedCoeff n)
(FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) s *
finiteFoxStageRelationAugmentationGenerator (X := X) N n q)Left multiplication of a relation augmentation generator by a source quotient basis element has an explicit relation-compatible source primitive.
Show proof
by
simpa [Algebra.smul_def] using
finiteFoxStageSourceBoundaryPrimitive_smul (X := X) N n
(MonoidAlgebra.of (ModNCompletedCoeff n)
(FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) s)
(finiteFoxStageSourceBoundaryPrimitive_relationAugmentationGenerator (X := X) N n q)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 finiteFoxStageRelationAugmentationRightBasisPrimitiveVector
(q : finiteFoxStageRelationGroup (X := X) N n)
(s : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) :
finiteFoxStageSourceCoordinateVector (X := X) N n :=
finiteFoxStageSourceDerivativeVector (X := X) N n (q.1 * s) -
finiteFoxStageSourceDerivativeVector (X := X) N n sSource primitive for the right basis multiple \((q - 1)s\); the primitive is \(D_{\mathrm{src}}(q s) - D_{\mathrm{src}}(s)\).
theorem finiteFoxStageSourceFoxBoundary_relationAugmentationRightBasisPrimitiveVector
[Fintype X]
(q : finiteFoxStageRelationGroup (X := X) N n)
(s : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) :
finiteFoxStageSourceFoxBoundary (X := X) N n
(finiteFoxStageRelationAugmentationRightBasisPrimitiveVector (X := X) N n q s) =
finiteFoxStageRelationAugmentationGenerator (X := X) N n q *
MonoidAlgebra.of (ModNCompletedCoeff n)
(FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) sThe source boundary of \(D_{\mathrm{src}}(q s) - D_{\mathrm{src}}(s)\) is \((q - 1)s\).
Show proof
by
rw [finiteFoxStageRelationAugmentationRightBasisPrimitiveVector, map_sub,
finiteFoxStageSourceFoxBoundary_sourceDerivativeVector,
finiteFoxStageSourceFoxBoundary_sourceDerivativeVector,
finiteFoxStageRelationAugmentationGenerator]
simp only [MonoidAlgebra.of, MonoidHom.coe_mk, OneHom.coe_mk, sub_eq_add_neg, neg_add_rev, neg_neg, add_comm,
add_left_comm, add_assoc, add_neg_cancel, add_zero, add_mul, MonoidAlgebra.single_mul_single, mul_one, neg_mul,
one_mul]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 finiteFoxStageCoordinateSourceToTarget_relationAugmentationRightBasisPrimitiveVector
(q : finiteFoxStageRelationGroup (X := X) N n)
(s : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) :
finiteFoxStageCoordinateSourceToTarget (X := X) N n
(finiteFoxStageRelationAugmentationRightBasisPrimitiveVector (X := X) N n q s) =
finiteFoxStageRelationBoundaryAddMonoidHom (X := X) N n (Additive.ofMul q)The target projection of \(D_{\mathrm{src}}(q s) - D_{\mathrm{src}}(s)\) is the relation boundary of \(q\).
Show proof
by
rw [finiteFoxStageRelationAugmentationRightBasisPrimitiveVector, map_sub,
finiteFoxStageCoordinateSourceToTarget_sourceDerivativeVector,
finiteFoxStageCoordinateSourceToTarget_sourceDerivativeVector,
finiteFoxStageRelationBoundaryAddMonoidHom_of,
finiteFoxStageQuotientDerivativeVector_mul,
finiteFoxStageQuotientCoefficient_relation_eq_one]
simp only [one_smul, add_sub_cancel_right]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 finiteFoxStageSourceBoundaryPrimitive_relationAugmentationGenerator_mul_sourceBasis
[Fintype X]
(q : finiteFoxStageRelationGroup (X := X) N n)
(s : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n
(finiteFoxStageRelationAugmentationGenerator (X := X) N n q *
MonoidAlgebra.of (ModNCompletedCoeff n)
(FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) s)Right multiplication of a relation augmentation generator by a source quotient basis element has an explicit relation-compatible source primitive.
Show proof
by
refine ⟨finiteFoxStageRelationAugmentationRightBasisPrimitiveVector (X := X) N n q s, ?_, ?_⟩
· exact finiteFoxStageSourceFoxBoundary_relationAugmentationRightBasisPrimitiveVector
(X := X) N n q s
· rw [finiteFoxStageCoordinateSourceToTarget_relationAugmentationRightBasisPrimitiveVector]
exact finiteFoxStageRelationBoundaryRange_subset_relationBoundarySubmodule
(X := X) N n
((mem_finiteFoxStageRelationBoundaryRange_iff (X := X) N n).2
⟨Additive.ofMul q, 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 finiteFoxStageRelationAugmentationLeftSubmodule [Fintype X] :
Submodule (finiteFoxStageSourceGroupAlgebra (X := X) N n)
(finiteFoxStageSourceGroupAlgebra (X := X) N n) :=
Submodule.span (finiteFoxStageSourceGroupAlgebra (X := X) N n)
(Set.range (finiteFoxStageRelationAugmentationGenerator (X := X) N n))The left source-submodule generated by the relation augmentation generators.
theorem finiteFoxStageRelationAugmentationLeftSubmodule_le_primitiveSubmodule
[Fintype X] :
finiteFoxStageRelationAugmentationLeftSubmodule (X := X) N n ≤
finiteFoxStageSourceBoundaryPrimitiveSubmodule (X := X) N nThe left relation-augmentation submodule is contained in the primitive submodule.
Show proof
by
refine Submodule.span_le.2 ?_
rintro x ⟨q, rfl⟩
exact finiteFoxStageSourceBoundaryPrimitive_relationAugmentationGenerator
(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 finiteFoxStageSourceBoundaryPrimitive_of_mem_relationAugmentationLeftSubmodule
[Fintype X]
{x : finiteFoxStageSourceGroupAlgebra (X := X) N n}
(hx : x ∈ finiteFoxStageRelationAugmentationLeftSubmodule (X := X) N n) :
finiteFoxStageSourceBoundaryPrimitive (X := X) N n xMembership in the left relation-augmentation submodule gives a relation-compatible source primitive.
Show proof
finiteFoxStageRelationAugmentationLeftSubmodule_le_primitiveSubmodule (X := X) N n hxProof. 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.
□