Documentation

GQ2.Roe.Labute.StageLemma.Defect

The shift formula, modification stability, and the span theorem #

Piece 2/6 of GQ2.Roe.Labute.StageLemma (see that module for the mathematical overview and the statement freeze). Contains the transported shift formulas defectR0_mul / defectR2_mul, the level-k modification facts feeding sPR0_mul_mem / sPR2_mul_mem, the Frattini generation transfer, and the span theorem span_free_* / span_descent_*.

Shift formula and modification stability (spike §2.1–2.2; concrete towers) #

theorem GQ2.Roe.Labute.defectR0_mul (k : ) (hk : 3 k) {T : Fin 3levelQuot (↑DR.toProfinite.toTop) k} {w : Fin 3levelQuot (↑DR.toProfinite.toTop) (k + 1)} (hw : ∀ (i : Fin 3), w i lambdaImage (↑DR.toProfinite.toTop) (k - 1) (k + 1)) :
(defectR0 k fun (i : Fin 3) => T i * (levelProj (↑DR.toProfinite.toTop) k) (w i)) = defectR0 k T * dbarWordR0 (canonLift (↑DR.toProfinite.toTop) k (T 0)) (canonLift (↑DR.toProfinite.toTop) k (T 1)) (canonLift (↑DR.toProfinite.toTop) k (T 2)) w

The transported shift formula, direction 1 (spike §2.2, machine-verified 24/24): modifying a level-k triple by the projection of a λ_{k-1}-modification w shifts the defect by exactly d̄(w) at the canonical lift. No relator hypothesis: the identity is pure k ≥ 3 λ-calculus. Fill: L4a.

theorem GQ2.Roe.Labute.defectR2_mul (k : ) (hk : 3 k) {T : Fin 3levelQuot (↑D0.toProfinite.toTop) k} {w : Fin 3levelQuot (↑D0.toProfinite.toTop) (k + 1)} (hw : ∀ (i : Fin 3), w i lambdaImage (↑D0.toProfinite.toTop) (k - 1) (k + 1)) :
(defectR2 k fun (i : Fin 3) => T i * (levelProj (↑D0.toProfinite.toTop) k) (w i)) = defectR2 k T * dbarWordR2 (canonLift (↑D0.toProfinite.toTop) k (T 0)) (canonLift (↑D0.toProfinite.toTop) k (T 1)) (canonLift (↑D0.toProfinite.toTop) k (T 2)) w

The transported shift formula, direction 2. Fill: L4a.

Level-k modification facts (L4a fill helpers) #

At its own level a λ_{k-1}-modification is already central of exponent 2 in Qₖ — both and commP v g land in λₖ, which is trivial in Qₖ. So the relator clause of S⁰ₖ is preserved for the cheapest possible reason, and the χ-clause survives because χ(λ_{k-1}) ⊆ 1 + 2^kℤ₂ — one digit sharper than chiShadow_eq_one_of_mem gives, which is exactly the design reason the invariant P is stated at modulus 2^k.

theorem GQ2.Roe.Labute.chiLevel_lambdaImage_pred {G : Type u_1} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] (χ : G →ₜ* ℤ_[2]ˣ) (k : ) (hk : 3 k) {v : levelQuot G k} (hv : v lambdaImage G (k - 1) k) :
(chiLevel χ k) v = 1

The χ-clause survives (spike §2.1's design reason for the modulus 2^k): a character kills λ_{k-1} to precision 2^k, one digit sharper than the generic layer bound, because λ_{k-1}(ℤ₂ˣ) ⊆ 1 + 2^kℤ₂ (twoCentralSeries_units_le at index k - 1).

theorem GQ2.Roe.Labute.drTopGenFinset :
∃ (s : Finset DR.toProfinite.toTop), (Subgroup.closure s).topologicalClosure =

D_R is topologically generated by {s, x, y}, Finset form (private replica of the Assembly-file packaging of dr_topGen; needed here for the tower instance pack).

theorem GQ2.Roe.Labute.d0TopGenFinset :
∃ (s : Finset D0.toProfinite.toTop), (Subgroup.closure s).topologicalClosure =

D₀ is topologically generated by {A, S, Y}, Finset form (private replica).

Frattini generation transfer (the non-generator argument at the level quotients) #

theorem GQ2.Roe.Labute.lambdaImage_two_le_frattiniLike (G : Type) [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [T2Space G] [TotallyDisconnectedSpace G] (hfg : ∃ (s : Finset G), (Subgroup.closure s).topologicalClosure = ) (hpro : IsProP 2 G) (m : ) :

λ₂ is Frattini in every level quotient: the image λ₂λₘ/λₘ ≤ Qₘ lies in the Frattini-like subgroup Φ(Qₘ) = Qₘ²[Qₘ, Qₘ] (SectionSeven.frattiniLike ⊤). Immediate from the atomization principle lambdaImage_induction at j = 1 (λ₁ = ⊤): λ₂ is verbally generated by squares and commutators of λ₁-elements, and both kinds of residue are Frattini generators.

theorem GQ2.Roe.Labute.closure_range_mul_eq_top_of_mem_lambdaImage_two (G : Type) [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [CompactSpace G] [T2Space G] [TotallyDisconnectedSpace G] (hfg : ∃ (s : Finset G), (Subgroup.closure s).topologicalClosure = ) (hpro : IsProP 2 G) {m : } {ι : Type u_1} (T u : ιlevelQuot G m) (hgen : Subgroup.closure (Set.range T) = ) (hu : ∀ (i : ι), u i lambdaImage G 2 m) :
Subgroup.closure (Set.range fun (i : ι) => T i * u i) =

Generation transfer (Frattini non-generation): a generating family T of a level quotient Qₘ stays generating after each member is multiplied by an element of the λ₂-image. Indeed T i = (T i · u i) · (u i)⁻¹ puts ⟨T⟩ = ⊤ inside H ⊔ λ₂, where H = ⟨T · u⟩; since Qₘ is a finite 2-group and λ₂ ≤ Φ(Qₘ), Frattini non-generation (frattiniLike_nongen) upgrades H ⊔ Φ(Qₘ) = ⊤ to H = ⊤.

theorem GQ2.Roe.Labute.sPR0_mul_mem (k : ) (hk : 3 k) {T : Fin 3levelQuot (↑DR.toProfinite.toTop) k} (hT : T sPR0 k) {w : Fin 3levelQuot (↑DR.toProfinite.toTop) k} (hw : ∀ (i : Fin 3), w i lambdaImage (↑DR.toProfinite.toTop) (k - 1) k) :
(fun (i : Fin 3) => T i * w i) sPR0 k

Modification stability of S^P_ₖ, direction 1 (spike §2.1 + §2.4): λ_{k-1}-moves preserve all three clauses — relator kill (the shift lands in λₖ), generation (Frattini: λ_{k-1} ⊆ λ₂ for k ≥ 3), and the χ-clause (χ(λ_{k-1}) ⊆ 1 + 2^k ℤ₂ — the design reason P survives the calculus). Fill: L4a.

theorem GQ2.Roe.Labute.sPR2_mul_mem (k : ) (hk : 3 k) {T : Fin 3levelQuot (↑D0.toProfinite.toTop) k} (hT : T sPR2 k) {w : Fin 3levelQuot (↑D0.toProfinite.toTop) k} (hw : ∀ (i : Fin 3), w i lambdaImage (↑D0.toProfinite.toTop) (k - 1) k) :
(fun (i : Fin 3) => T i * w i) sPR2 k

Modification stability, direction 2. Fill: L4a.

The span theorem (spike §2.3; L4b) #

theorem GQ2.Roe.Labute.span_free_r0 (k : ) (hk : 3 k) :
zLayer (↑freeProTwo.toProfinite.toTop) k Subgroup.closure ((fun (w : Fin 3levelQuot (↑freeProTwo.toProfinite.toTop) (k + 1)) => dbarWordR0 ((levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 0)) ((levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 1)) ((levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 2)) w) '' {w : Fin 3levelQuot (↑freeProTwo.toProfinite.toTop) (k + 1) | ∀ (i : Fin 3), w i lambdaImage (↑freeProTwo.toProfinite.toTop) (k - 1) (k + 1)} {(levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 1) ^ 2 ^ (k - 1), (levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 2) ^ 2 ^ (k - 1)})

The span theorem, free form, r₀-shape (spike §2.3; Serre 252 §7 p. 151 with the 2^{h-1} erratum): for k ≥ 3, the graded layer Zₖ(F₃) is contained in the subgroup generated by the -image over λ_{k-1}-modifications at the standard generators together with the two adapted tails g₁^{2^{k-1}}, g₂^{2^{k-1}} (the non-π'd generators (S, Y)-slots = generators 1, 2). Machine-verified k ≤ 5 free / k ≤ 6 towers (20/20 rank rows). Fill: L4b — via the structural reduction of spike §2.5(a); on a snag, plan §7 O1/O2 apply (owner gate).

theorem GQ2.Roe.Labute.span_free_r2 (k : ) (hk : 3 k) :
zLayer (↑freeProTwo.toProfinite.toTop) k Subgroup.closure ((fun (w : Fin 3levelQuot (↑freeProTwo.toProfinite.toTop) (k + 1)) => dbarWordR2 ((levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 0)) ((levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 1)) ((levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 2)) w) '' {w : Fin 3levelQuot (↑freeProTwo.toProfinite.toTop) (k + 1) | ∀ (i : Fin 3), w i lambdaImage (↑freeProTwo.toProfinite.toTop) (k - 1) (k + 1)} {(levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 0) ^ 2 ^ (k - 1), (levelMk (↑freeProTwo.toProfinite.toTop) (k + 1)) (freeGen 1) ^ 2 ^ (k - 1)})

The span theorem, free form, r₂-shape: tails at the (s, x)-slots = generators 0, 1 (the relator-adapted pair — spike §2.3's caught wrong-pair failure makes this placement load-bearing). Fill: L4b.

theorem GQ2.Roe.Labute.span_descent_r0 (k : ) (hk : 3 k) (T' : Fin 3levelQuot (↑DR.toProfinite.toTop) (k + 1)) (hgen : Subgroup.closure (Set.range T') = ) :
zLayer (↑DR.toProfinite.toTop) k Subgroup.closure ((fun (w : Fin 3levelQuot (↑DR.toProfinite.toTop) (k + 1)) => dbarWordR0 (T' 0) (T' 1) (T' 2) w) '' {w : Fin 3levelQuot (↑DR.toProfinite.toTop) (k + 1) | ∀ (i : Fin 3), w i lambdaImage (↑DR.toProfinite.toTop) (k - 1) (k + 1)} {T' 1 ^ 2 ^ (k - 1), T' 2 ^ 2 ^ (k - 1)})

Span descent, direction 1 (spike §2.3: λ is verbal, so the statement descends along F₃ ↠ D_R and holds at any generating triple of Q_{k+1}(D_R); tails at the (S, Y)-slots of the triple). Fill: L4b (from span_free_r0 + map_twoCentralSeries_eq

  • the congruence calculus).
theorem GQ2.Roe.Labute.span_descent_r2 (k : ) (hk : 3 k) (T' : Fin 3levelQuot (↑D0.toProfinite.toTop) (k + 1)) (hgen : Subgroup.closure (Set.range T') = ) :
zLayer (↑D0.toProfinite.toTop) k Subgroup.closure ((fun (w : Fin 3levelQuot (↑D0.toProfinite.toTop) (k + 1)) => dbarWordR2 (T' 0) (T' 1) (T' 2) w) '' {w : Fin 3levelQuot (↑D0.toProfinite.toTop) (k + 1) | ∀ (i : Fin 3), w i lambdaImage (↑D0.toProfinite.toTop) (k - 1) (k + 1)} {T' 0 ^ 2 ^ (k - 1), T' 1 ^ 2 ^ (k - 1)})

Span descent, direction 2 (tails at the (s, x)-slots). Fill: L4b.