FoxDifferential.Completed.FiniteStage.SemidirectCycles
This module develops the Fox-differential part of the theory. It records the formulas that connect generators, boundaries, Jacobians, and completed coordinates.
def finiteFoxStageSemidirectSourceKernelPoint
(q : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) :
FiniteFoxStageSemidirect (X := X) N n :=
{ left := finiteFoxStageQuotientDerivativeVector (X := X) N n q,
right := 1 }
@[simp]The finite semidirect point \((Dq,1)\) attached to a source-quotient element.
theorem finiteFoxStageSemidirectSourceKernelPoint_left
(q : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) :
(finiteFoxStageSemidirectSourceKernelPoint (X := X) N n q).left =
finiteFoxStageQuotientDerivativeVector (X := X) N n qThe left coordinate of the finite-stage semidirect point is the specified derivative component.
Show proof
rfl
@[simp]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 finiteFoxStageSemidirectSourceKernelPoint_right
(q : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) :
(finiteFoxStageSemidirectSourceKernelPoint (X := X) N n q).right = 1The right coordinate of the finite-stage semidirect point is the corresponding quotient component.
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 finiteFoxStageSemidirectKernelWordPoint (w : FreeGroup X) :
FiniteFoxStageSemidirect (X := X) N n :=
{ left := finiteFoxStageDerivativeVector (X := X) N n w,
right := 1 }
@[simp]The finite semidirect point (Dw,1) attached to a word.
theorem finiteFoxStageSemidirectKernelWordPoint_left (w : FreeGroup X) :
(finiteFoxStageSemidirectKernelWordPoint (X := X) N n w).left =
finiteFoxStageDerivativeVector (X := X) N n wThe left coordinate of the finite-stage semidirect point is the specified derivative component.
Show proof
rfl
@[simp]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 finiteFoxStageSemidirectKernelWordPoint_right (w : FreeGroup X) :
(finiteFoxStageSemidirectKernelWordPoint (X := X) N n w).right = 1The right coordinate of the finite-stage semidirect point is the corresponding quotient component.
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 finiteFoxStageSemidirectBoundaryCycleSet [Fintype X] :
Set (FiniteFoxStageSemidirect (X := X) N n) :=
{ y | y.right = 1 ∧
y.left ∈ finiteFoxStageBoundaryCycleSubmodule (X := X) N n }Finite-stage boundary cycles as semidirect points \((v,1)\) with \(\partial v = 0\).
theorem mem_finiteFoxStageSemidirectBoundaryCycleSet [Fintype X]
{y : FiniteFoxStageSemidirect (X := X) N n} :
y ∈ finiteFoxStageSemidirectBoundaryCycleSet (X := X) N n ↔
y.right = 1 ∧ y.left ∈ finiteFoxStageBoundaryCycleSubmodule (X := X) N nMembership in the finite-stage boundary-cycle object is characterized by the corresponding boundary-vanishing condition.
Show proof
Iff.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 finiteFoxStageSemidirectSourceKernelDerivativeSet :
Set (FiniteFoxStageSemidirect (X := X) N n) :=
{ y | ∃ q : FreeGroup X ⧸ finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n,
finiteFoxCommutatorPowerQuotientMapToNormalQuotient (F := FreeGroup X) N n q = 1 ∧
finiteFoxStageSemidirectSourceKernelPoint (X := X) N n q = y }Semidirect source-kernel derivative points in the finite stage.
def finiteFoxStageSemidirectKernelWordDerivativeSet :
Set (FiniteFoxStageSemidirect (X := X) N n) :=
{ y | ∃ w : FreeGroup X,
w ∈ N ∧ finiteFoxStageSemidirectKernelWordPoint (X := X) N n w = y }This set consists of semidirect kernel-word derivative points at the finite Fox stage.
theorem finiteFoxStageSemidirectSourceKernelDerivativeSet_eq_kernelWordDerivativeSet :
finiteFoxStageSemidirectSourceKernelDerivativeSet (X := X) N n =
finiteFoxStageSemidirectKernelWordDerivativeSet (X := X) N nSource-kernel semidirect points and actual kernel-word semidirect points coincide.
Show proof
by
ext y
constructor
· rintro ⟨q, hq, hy⟩
rcases QuotientGroup.mk'_surjective
(finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) q with ⟨w, rfl⟩
have hwN : w ∈ N := by
have hwq : QuotientGroup.mk' N w = 1 := by
simpa only [finiteFoxCommutatorPowerQuotientMapToNormalQuotient_mk] using hq
exact (QuotientGroup.eq_one_iff (N := N) w).1 hwq
refine ⟨w, hwN, ?_⟩
rw [← hy]
apply FiniteFoxStageSemidirect.ext
· exact (finiteFoxStageQuotientDerivativeVector_mk (X := X) N n w).symm
· simp only [finiteFoxStageSemidirectKernelWordPoint, finiteFoxStageSemidirectSourceKernelPoint,
QuotientGroup.mk'_apply]
· rintro ⟨w, hwN, hy⟩
refine ⟨QuotientGroup.mk'
(finiteFoxCommutatorPowerSubgroup (F := FreeGroup X) N n) w, ?_, ?_⟩
· rw [finiteFoxCommutatorPowerQuotientMapToNormalQuotient_mk]
exact (QuotientGroup.eq_one_iff (N := N) w).2 hwN
· rw [← hy]
apply FiniteFoxStageSemidirect.ext
· exact finiteFoxStageQuotientDerivativeVector_mk (X := X) N n w
· simp only [finiteFoxStageSemidirectSourceKernelPoint, QuotientGroup.mk'_apply,
finiteFoxStageSemidirectKernelWordPoint]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 finiteFoxStageSemidirectSourceKernelDerivativeSet_subset_boundaryCycleSet
[Fintype X] :
finiteFoxStageSemidirectSourceKernelDerivativeSet (X := X) N n ⊆
finiteFoxStageSemidirectBoundaryCycleSet (X := X) N nEvery finite semidirect source-kernel derivative point is a semidirect boundary cycle.
Show proof
by
intro y hy
rcases hy with ⟨q, hq, hy⟩
rw [← hy]
constructor
· simp only [finiteFoxStageSemidirectSourceKernelPoint]
· exact finiteFoxStageSourceKernelDerivativeSet_subset_boundaryCycleSubmodule
(X := X) N n ⟨q, hq, 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 finiteFoxStageSemidirectKernelWordDerivativeSet_subset_boundaryCycleSet
[Fintype X] :
finiteFoxStageSemidirectKernelWordDerivativeSet (X := X) N n ⊆
finiteFoxStageSemidirectBoundaryCycleSet (X := X) N nEvery finite semidirect kernel-word derivative point is a semidirect boundary cycle.
Show proof
by
rw [← finiteFoxStageSemidirectSourceKernelDerivativeSet_eq_kernelWordDerivativeSet
(X := X) N n]
exact finiteFoxStageSemidirectSourceKernelDerivativeSet_subset_boundaryCycleSet
(X := X) N 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.
□def finiteFoxStageSemidirectBoundaryCyclesCoveredBySourceKernel [Fintype X] : Prop :=
finiteFoxStageSemidirectBoundaryCycleSet (X := X) N n ⊆
finiteFoxStageSemidirectSourceKernelDerivativeSet (X := X) N nSemidirect finite-stage coverage: every semidirect boundary cycle is represented by a source-kernel derivative point.
theorem finiteFoxStageSemidirectBoundaryCyclesCoveredBySourceKernel_iff
[Fintype X] :
finiteFoxStageSemidirectBoundaryCyclesCoveredBySourceKernel (X := X) N n ↔
finiteFoxStageBoundaryCyclesCoveredBySourceKernel (X := X) N nThe semidirect finite-stage coverage target is equivalent to the coordinate coverage target.
Show proof
by
constructor
· intro hcover v hv
have hy :
({ left := v, right := (1 : finiteFoxStageTargetQuotient (X := X) N) } :
FiniteFoxStageSemidirect (X := X) N n) ∈
finiteFoxStageSemidirectBoundaryCycleSet (X := X) N n := by
exact ⟨rfl, hv⟩
rcases hcover hy with ⟨q, hq, hqy⟩
refine ⟨q, hq, ?_⟩
have hleft := congrArg (fun z : FiniteFoxStageSemidirect (X := X) N n => z.left) hqy
simpa [finiteFoxStageSemidirectSourceKernelPoint] using hleft
· intro hcover y hy
rcases hy with ⟨hyright, hyleft⟩
rcases hcover hyleft with ⟨q, hq, hqleft⟩
refine ⟨q, hq, ?_⟩
apply FiniteFoxStageSemidirect.ext
· simpa [finiteFoxStageSemidirectSourceKernelPoint] using hqleft
· simpa [finiteFoxStageSemidirectSourceKernelPoint] using hyright.symmProof. 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 finiteFoxStageSemidirectBoundaryCyclesCoveredByKernelWords_iff
[Fintype X] :
finiteFoxStageSemidirectBoundaryCycleSet (X := X) N n ⊆
finiteFoxStageSemidirectKernelWordDerivativeSet (X := X) N n ↔
finiteFoxStageBoundaryCyclesCoveredBySourceKernel (X := X) N nFinite-stage semidirect coverage is equivalent to coverage by actual kernel words.
Show proof
by
rw [← finiteFoxStageSemidirectSourceKernelDerivativeSet_eq_kernelWordDerivativeSet
(X := X) N n]
exact finiteFoxStageSemidirectBoundaryCyclesCoveredBySourceKernel_iff (X := X) N 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.
□