Documentation

GQ2.AffineTLift

§8 zero-edge engines: Lemma 8.7 (affine T-lifting) + Prop 8.8, target side #

When the radical edge of the scalar cover p_λ vanishes — the N-branch of the (140) case split, i.e. ¬ D.NoDescent — the paper (pp. 40–43) runs three steps to evaluate the constrained Gauss sum. This file provides the source-generic, target-side halves:

  1. descended_splitting (Lemma 6.21 application): the descent datum N makes Q = Bg/T a split extension of C₀ by V, i.e. ∃ σ : C₀ →* Q sectioning piQbar. Consumes the κ⁰_q datum (the Enrichment fields of the Prop. 8.9 assembly) exactly as the paper's "fix the base determinant class" clause requires.
  2. lemma_8_7_count (Lemma 8.7, (131)/(132), count form): the central M-lifts over a lower map ρ fibre over their V-coordinates with constant multiplicity #Z¹_{Γ,ρ}(T). The torsor structure is the central-obstruction framework twist involution; Central-invariance under a T-twist is ob_twist with the vanishing variation class (the N-complement has edge ≡ 0).
  3. prop_8_8_target (Prop 8.8, (133)/(134), target side): the edge-killing shear, an instance of the proved lemma_6_22, produces the total scalar phase DeltaScalar. The Γ-level completed-square (135) — which consumes cor. 5.17 — is out of scope (the Prop. 8.9 assembly, behind the Prop. 5.15 proof firewall).

Plus exists_polar_inverse, the finite-linear-algebra supplier of the shift vectors a_{χ,κ} of (133) (cf. lemma_8_5's a-data-with-spec).

Design decisions D1–D6 and the full work order: docs/orchestration/p16d4-plan.md. Deviation-ledger entries D1 (cocycle-level 8.7) and D3 (6.22-normalized Δ): docs/section8-extraction.md. Everything is finite-group / generic-Γ; no B6/B7, no the Prop. 5.15 proof material; all std-3.

The N-section and the vanishing edge #

In the zero-edge regime we are handed a normal complement N ◁ B̃ with p(N) = T and z ∉ N (the negation of NoDescent). Since p|_N : N ≅ T is a bijection, its inverse sectN is a homomorphic section of p over T whose image N is normal — so the edge cocycle of the resulting TComplement vanishes identically.

structure GQ2.SectionEight.AffineTLift.Descent {Bg : Type} [Group Bg] [Finite Bg] (D : RadicalCoverData Bg) :

A descent datum for the scalar cover: a normal complement N ◁ B̃ to ⟨z⟩ over T (p(N) = T, z ∉ N). This is the negation of D.NoDescent unpacked; d6 obtains it from radData_noDescent_iff. Its existence is the zero-edge case of the (140) split.

  • N : Subgroup D.C.cover

    The normal complement.

  • hN : self.N.Normal
  • hNT : Subgroup.map D.C.p self.N = D.T

    N covers T.

  • hNz : D.C.zself.N

    N misses the central z.

Instances For
    theorem GQ2.SectionEight.AffineTLift.pN_mem_T {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (n : Dsc.N) :
    D.C.p n D.T

    Every element of N covers a T-element (p(N) = T).

    noncomputable def GQ2.SectionEight.AffineTLift.pN {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
    Dsc.N →* D.T

    p|_N : N → T as a homomorphism.

    Equations
    Instances For
      noncomputable def GQ2.SectionEight.AffineTLift.eN {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
      Dsc.N ≃* D.T

      p|_N : N ≅ T as a group isomorphism.

      Equations
      Instances For
        noncomputable def GQ2.SectionEight.AffineTLift.sectN {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
        D.T →* D.C.cover

        The N-section T → B̃: the inverse of p|_N, landing in the normal complement.

        Equations
        Instances For
          noncomputable def GQ2.SectionEight.AffineTLift.SN {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :

          The N-section, packaged as a TComplement.

          Equations
          Instances For
            theorem GQ2.SectionEight.AffineTLift.edge_zero {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (b : Bg) (t : D.T) :
            CentralObstruction.edge D (SN Dsc) b t = 0

            The edge vanishes on the N-complement: conjugation preserves the normal N, so the section's conjugation defect is trivial. This is what makes the (129) variation class zero in the zero-edge regime.

            The descended semidirect structure on Q = Bg/T #

            T is normal (it is D.hT), so Q := Bg ⧸ T is a group and the projection piT sits over piQbar : Q ↠ C₀ (the lift of piC₀, which kills T ≤ M). Its kernel is V = M/T, and the descent iso descend : M ↠ V gives the inclusion iV : V ↪ Q characterized by iV (descend m) = piT m. All the extension data of 1 → V → Q → C₀ → 1 reads off iV.

            instance GQ2.SectionEight.AffineTLift.instNormalT {Bg : Type} [Group Bg] [Finite Bg] (D : RadicalCoverData Bg) :
            D.T.Normal
            structure GQ2.SectionEight.AffineTLift.DescData {Bg : Type} [Group Bg] [Finite Bg] (D : RadicalCoverData Bg) :

            The descended κ⁰_q datum for the zero-edge regime (the Prop. 8.9 assembly Enrichment fields at a fixed nonzero λ, in the source-generic RadicalCoverData vocabulary). The C-stage group C₀ (with piC₀ : Bg ↠ C₀, ker = M), the descended module V = M/T with its C₀-action and the descent surjection descend : M ↠ V, the descended nonsingular form , and its fixed equivariant factor-set datum (Lemma 6.1's κ⁰_{q̄} — the relative hypothesis of lemma_6_21). d6 builds one DescData from E : RF.Enrichment at (l,h) via E.radData l h, RF.piBC, RF.ker_piBC, and the descended-module fields.

            • C0 : Type

              The C-stage group C₀ = B/M.

            • gC0 : Group self.C0
            • fC0 : Finite self.C0
            • piC0 : Bg →* self.C0

              The projection piC₀ : B ↠ C₀.

            • hpiC0 : Function.Surjective self.piC0
            • hkerC0 : self.piC0.ker = D.M
            • Vmod : Type

              The descended module V = M/T.

            • aVmod : AddCommGroup self.Vmod
            • fVmod : Finite self.Vmod
            • actVmod : DistribMulAction self.C0 self.Vmod
            • descend : D.M →* Multiplicative self.Vmod

              The descent surjection M ↠ V.

            • hdesc_surj : Function.Surjective self.descend
            • hdesc_ker (m : D.M) : self.descend m = 1 m D.T
            • hdesc_conj (bb : Bg) (m : D.M) (hm : bb * m * bb⁻¹ D.M) : self.descend bb * m * bb⁻¹, hm = Multiplicative.ofAdd (self.piC0 bb Multiplicative.toAdd (self.descend m))

              descend intertwines B-conjugation with the C₀-action through piC₀.

            • qbar : self.VmodZMod 2

              The descended form on V.

            • dat : FactorSet self.C0 self.Vmod

              The fixed equivariant factor-set datum for (Lemma 6.1's κ⁰_{q̄}).

            • hqbar (m : D.M) : D.q m = self.qbar (Multiplicative.toAdd (self.descend m))

              q_λ = q̄ ∘ descend on M.

            Instances For
              @[reducible, inline]
              abbrev GQ2.SectionEight.AffineTLift.piT {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} :
              Bg →* Bg D.T

              The T-projection Bg ↠ Q.

              Equations
              Instances For
                theorem GQ2.SectionEight.AffineTLift.T_le_kerC0 {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) :
                D.T DD.piC0.ker

                T ≤ ker piC₀ (= M), so piC₀ descends to Q.

                noncomputable def GQ2.SectionEight.AffineTLift.piQbar {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) :
                Bg D.T →* DD.C0

                The connecting map piQbar : Q ↠ C₀, the descent of piC₀ through T ≤ M.

                Equations
                Instances For
                  @[simp]
                  theorem GQ2.SectionEight.AffineTLift.piQbar_mk {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) (b : Bg) :
                  (piQbar DD) (piT b) = DD.piC0 b
                  theorem GQ2.SectionEight.AffineTLift.descend_ker_eq_mMap_ker {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) :
                  DD.descend.ker = (piT.comp D.M.subtype).ker

                  descend and the M-into-Q map have the same kernel T ∩ M.

                  noncomputable def GQ2.SectionEight.AffineTLift.iV {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) :
                  Multiplicative DD.Vmod →* Bg D.T

                  The V-inclusion iV : V ↪ Q, the descent of M ↪ Bg ↠ Q through descend.

                  Equations
                  • One or more equations did not get rendered due to their size.
                  Instances For
                    @[simp]
                    theorem GQ2.SectionEight.AffineTLift.iV_spec {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) (m : D.M) :
                    (iV DD) (DD.descend m) = piT m

                    The characterizing identity: iV (descend m) = piT m for m ∈ M. Everything about iV (injectivity, range, conjugation) is derived from this.

                    theorem GQ2.SectionEight.AffineTLift.iV_injective {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) :
                    Function.Injective (iV DD)
                    theorem GQ2.SectionEight.AffineTLift.iV_range {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) :
                    (iV DD).range = (piQbar DD).ker

                    range iV = ker piQbar (= V): the extension 1 → V → Q → C₀ → 1 in lemma_6_21 form.

                    theorem GQ2.SectionEight.AffineTLift.iV_conj {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) (qq : Bg D.T) (v : DD.Vmod) :
                    qq * (iV DD) (Multiplicative.ofAdd v) * qq⁻¹ = (iV DD) (Multiplicative.ofAdd ((piQbar DD) qq v))

                    The conjugation law for the extension (lemma_6_21's hconj): iV intertwines Q-conjugation with the C₀-action through piQbar.

                    The descended central double cover and its defect cocycle ξ #

                    Q̃ := B̃/N ↠ Q = B/T is a central double cover (its kernel is ⟨z̄⟩, z̄ = mk z, missing 1 since z ∉ N). Its defect cocycle ξ — the -sign of the associativity defect of a set-section — is the 𝔽₂-class of the extension, with ξ(iv, iv) = q̄(v) on the fibre V. This is the class lemma_6_21 consumes; ξ avoids bundling as a CentralCover (hence no quotient-topology diamond) by reusing only the kernel-sign calculus.

                    instance GQ2.SectionEight.AffineTLift.instDescentNormal {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                    Dsc.N.Normal
                    @[reducible, inline]
                    abbrev GQ2.SectionEight.AffineTLift.covQ {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :

                    The covering group Q̃ = B̃/N.

                    Equations
                    Instances For
                      theorem GQ2.SectionEight.AffineTLift.N_le_ker {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                      Dsc.N (piT.comp D.C.p).ker

                      N ≤ ker(piT ∘ p): elements of N cover T, which dies in Q.

                      noncomputable def GQ2.SectionEight.AffineTLift.descP {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                      covQ Dsc →* Bg D.T

                      The descended cover map descP : Q̃ ↠ Q.

                      Equations
                      Instances For
                        @[simp]
                        theorem GQ2.SectionEight.AffineTLift.descP_mk {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (x : D.C.cover) :
                        (descP Dsc) ((QuotientGroup.mk' Dsc.N) x) = piT (D.C.p x)
                        theorem GQ2.SectionEight.AffineTLift.descP_surj {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                        Function.Surjective (descP Dsc)
                        noncomputable def GQ2.SectionEight.AffineTLift.zbar {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                        covQ Dsc

                        The central involution z̄ = mk z of the descended cover.

                        Equations
                        Instances For
                          theorem GQ2.SectionEight.AffineTLift.zbar_sq {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                          zbar Dsc * zbar Dsc = 1
                          theorem GQ2.SectionEight.AffineTLift.descKerCases {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) {x : covQ Dsc} (hx : x (descP Dsc).ker) :
                          x = 1 x = zbar Dsc

                          Kernel elements of descP are 1 or .

                          noncomputable def GQ2.SectionEight.AffineTLift.ccZsign {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (x : covQ Dsc) :
                          ZMod 2

                          The -sign on the descended cover (meaningful on ker descP = {1, z̄}).

                          Equations
                          Instances For
                            theorem GQ2.SectionEight.AffineTLift.ccZsign_one {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                            ccZsign Dsc 1 = 0
                            theorem GQ2.SectionEight.AffineTLift.ccZsign_zbar {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                            ccZsign Dsc (zbar Dsc) = 1
                            theorem GQ2.SectionEight.AffineTLift.ccZsign_mul {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) {x y : covQ Dsc} (hx : x (descP Dsc).ker) (hy : y (descP Dsc).ker) :
                            ccZsign Dsc (x * y) = ccZsign Dsc x + ccZsign Dsc y

                            ccZsign is additive on the kernel.

                            theorem GQ2.SectionEight.AffineTLift.ccZsign_zbar_pow {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (a : ZMod 2) :
                            ccZsign Dsc (zbar Dsc ^ a.val) = a

                            ccZsign of a -power.

                            noncomputable def GQ2.SectionEight.AffineTLift.s0 {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (q : Bg D.T) :
                            covQ Dsc

                            A normalized set-section s₀ : Q → Q̃ of descP (s₀ 1 = 1).

                            Equations
                            Instances For
                              theorem GQ2.SectionEight.AffineTLift.s0_sect {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (q : Bg D.T) :
                              (descP Dsc) (s0 Dsc q) = q
                              theorem GQ2.SectionEight.AffineTLift.s0_one {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) :
                              s0 Dsc 1 = 1
                              noncomputable def GQ2.SectionEight.AffineTLift.xi {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (p : (Bg D.T) × Bg D.T) :
                              ZMod 2

                              The defect 𝔽₂-cocycle ξ of the descended cover: the -sign of the associativity defect of s₀. This is the class lemma_6_21 consumes.

                              Equations
                              • One or more equations did not get rendered due to their size.
                              Instances For
                                theorem GQ2.SectionEight.AffineTLift.defect_mem_ker {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (a b : Bg D.T) :
                                s0 Dsc a * s0 Dsc b * (s0 Dsc (a * b))⁻¹ (descP Dsc).ker
                                theorem GQ2.SectionEight.AffineTLift.ker_central {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) {d : covQ Dsc} (hd : d (descP Dsc).ker) (w : covQ Dsc) :
                                d * w = w * d
                                theorem GQ2.SectionEight.AffineTLift.xi_cocycle {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (g h k : Bg D.T) :
                                xi Dsc (h, k) + xi Dsc (g, h * k) = xi Dsc (g * h, k) + xi Dsc (g, h)

                                The ξ cocycle identity (lemma_6_21's hcocycle): from associativity of s₀ g · s₀ h · s₀ k, computed via the two central defects.

                                descended_splitting: the Lemma 6.21 application #

                                With ξ in hand, the extension 1 → V → Q → C₀ → 1 splits. hξq reads the fibre square map of ξ off (via D.hq/hqbar); lemma_6_21 (the Lemma 6.21 proof, proved) then delivers the group-theoretic section σ : C₀ →* Q.

                                theorem GQ2.SectionEight.AffineTLift.Vmod_exp2 {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) (v : DD.Vmod) :
                                v + v = 0

                                V has exponent 2 (it is M/T, and M is elementary abelian).

                                theorem GQ2.SectionEight.AffineTLift.xi_diag {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (DD : DescData D) (Dsc : Descent D) (v : DD.Vmod) :
                                xi Dsc ((iV DD) (Multiplicative.ofAdd v), (iV DD) (Multiplicative.ofAdd v)) = DD.qbar v

                                The fibre square identity ξ(iv, iv) = q̄(v) (lemma_6_21's hξq): the descended cover's square map on V is the descended form. Uses D.hq (cover square relation) pushed down through hqbar.

                                theorem GQ2.SectionEight.AffineTLift.descended_splitting {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (DD : DescData D) :
                                ∃ (σ : DD.C0 →* Bg D.T), ∀ (cc : DD.C0), (piQbar DD) (σ cc) = cc

                                descended_splitting (the Prop. 8.9 assembly, 2.2): in the zero-edge regime the extension 1 → V → Q → C₀ → 1 splits — ∃ σ : C₀ →* Q sectioning piQbar. This is Lemma 6.21 at the descended data, the paper's "B/T ≅ V ⋊ C". d6 provides DD/Dsc from the Enrichment.

                                Prop 8.8, target side: the edge-killing shear #

                                The completed-square identity (135), C-level half. Given an edge-killing shear a (B_q̄(a c, ·) = γ c, i.e. hkill), the general determinant class κ⁰ + Γ_γ + inf δ shears to κ⁰ + inf(Δ) up to coboundary, where Δ = δ + Θ⁰_q̄(a) + (γ ⌣ a) is the total scalar phase. Direct instance of the proved lemma_6_22 with the γ + B♭a = 0 collapse. The Γ-level (135) (which pulls this back along cor. 5.17) is d6, behind the Prop. 5.15 proof firewall.

                                noncomputable def GQ2.SectionEight.AffineTLift.DeltaScalar {C : Type} [Group C] {V : Type} [AddCommGroup V] [DistribMulAction C V] (dat : FactorSet C V) (γ : CV →+ ZMod 2) (δ : C × CZMod 2) (a : CV) :
                                C × CZMod 2

                                The total scalar phase Δ = δ + Θ⁰_q̄(a) + (γ ⌣ a) (the (134)-analog; the γ⌣a cup term is the lemma_6_22-normalized form, D3 — the family is -bound in prop_8_9).

                                Equations
                                Instances For
                                  theorem GQ2.SectionEight.AffineTLift.prop_8_8_target {C : Type} [Group C] {V : Type} [AddCommGroup V] [DistribMulAction C V] (q : VZMod 2) (hq : QuadraticFp2.IsQuadraticFp2 q) (dat : FactorSet C V) (hdat : IsEquivariantFactorSet q dat) (γ : CV →+ ZMod 2) (δ : C × CZMod 2) (a : CV) (ha : ∀ (c d : C), a (c * d) = a c + c a d) (hkill : ∀ (c : C) (v : V), QuadraticFp2.polar q (a c) v + (γ c) v = 0) :
                                  ∃ (w : V × CZMod 2), ∀ (p q' : V × C), kappa0 dat (SectionSix.shear a p) (SectionSix.shear a q') + SectionSix.gammaEdge γ (SectionSix.shear a p) (SectionSix.shear a q') + SectionSix.inflScalar δ (SectionSix.shear a p) (SectionSix.shear a q') = kappa0 dat p q' + SectionSix.inflScalar (DeltaScalar dat γ δ a) p q' + (w (p.1 + p.2 q'.1, p.2 * q'.2) + w p + w q')

                                  Prop 8.8, target side (the Prop. 8.9 assembly, 2.6): the edge-killing shear collapses the general determinant class to κ⁰ + inf Δ up to an explicit coboundary.

                                  The polar-inverse supplier (a_{χ,κ}) #

                                  Finite 𝔽₂-linear algebra: a nonsingular quadratic form's polar map B♭ : V ↪ V∨ is bijective, so every functional φ has a unique polar-preimage a. d5 uses this to define the (133) shift vectors a_{χ,κ} from γ_χ + γ_κ (cf. lemma_8_5's a-data-with-spec).

                                  theorem GQ2.SectionEight.AffineTLift.exists_polar_inverse {V : Type} [AddCommGroup V] [Module (ZMod 2) V] [Finite V] (q : VZMod 2) (hq : QuadraticFp2.IsQuadraticFp2 q) (hns : QuadraticFp2.Nonsingular q) (φ : Module.Dual (ZMod 2) V) :
                                  ∃ (a : V), ∀ (v : V), QuadraticFp2.polar q a v = φ v

                                  exists_polar_inverse (the Prop. 8.9 assembly, 2.5): for nonsingular q on a finite 𝔽₂-space, every functional φ is B_q(a, ·) for some a.

                                  Lemma 8.7, count form: the T-twist torsor #

                                  In the zero-edge regime the N-complement has edge ≡ 0, so the (129) variation class of every T-cocycle vanishes. Hence twisting by a T-cocycle preserves the central relation (central_twist_iff), and the fibres of the T-reduction map on M-lifts are free T-cocycle torsors on which Central is constant. This is the multiplicity μ = #Z¹(T) of Lemma 8.7 (131)/(132) — the V-coordinate factorization. The Γ-machinery is the central-obstruction framework's twist/ob/central_iff_ob_eq_zero, reused verbatim.

                                  theorem GQ2.SectionEight.AffineTLift.edgeQ_zero {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} (Dsc : Descent D) (c : Bg D.M) (t : D.T) :

                                  The N-complement's variation cochain vanishes (edge ≡ 0).

                                  theorem GQ2.SectionEight.AffineTLift.central_twist_iff {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} [TopologicalSpace Bg] [DiscreteTopology Bg] {Γ : Type} [Group Γ] [TopologicalSpace Γ] [IsTopologicalGroup Γ] (ρ : Γ →ₜ* Bg D.M) [DistribMulAction Γ (ZMod 2)] (Dsc : Descent D) (htriv : ∀ (γ : Γ) (m : ZMod 2), γ m = m) (u : CentralObstruction.TCocycle D ρ) (f : MLifts D ρ) :

                                  central_twist_iff (the Prop. 8.9 assembly, 2.4b): in the zero-edge regime, twisting an M-lift by a T-cocycle preserves the central relation — the (129) variation class is zero because the normal N-complement has vanishing edge. This is what makes Central constant on the T-cocycle torsors.

                                  def GQ2.SectionEight.AffineTLift.redT {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} [TopologicalSpace Bg] {Γ : Type} [Group Γ] [TopologicalSpace Γ] (ρ : Γ →ₜ* Bg D.M) (f : MLifts D ρ) :
                                  ΓBg D.T

                                  The T-reduction of an M-lift: red_T f = piT ∘ f : Γ → B/T. Its fibres are the T-cocycle torsors of Lemma 8.7.

                                  Equations
                                  Instances For
                                    theorem GQ2.SectionEight.AffineTLift.M_cent_T {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} {m : Bg} (hm : m D.M) {t : Bg} (ht : t D.T) :
                                    m * t * m⁻¹ = t

                                    M centralizes T (T ≤ M, M abelian) — makes the crossed condition rep-independent.

                                    theorem GQ2.SectionEight.AffineTLift.tcocycle_ext {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} [TopologicalSpace Bg] {Γ : Type} [Group Γ] [TopologicalSpace Γ] (ρ : Γ →ₜ* Bg D.M) {u v : CentralObstruction.TCocycle D ρ} (h : u.u = v.u) :
                                    u = v

                                    Extensionality for T-cocycles (only the underlying function matters).

                                    noncomputable def GQ2.SectionEight.AffineTLift.tcocycle_torsor_equiv {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} [TopologicalSpace Bg] [DiscreteTopology Bg] {Γ : Type} [Group Γ] [TopologicalSpace Γ] (ρ : Γ →ₜ* Bg D.M) (f₀ : MLifts D ρ) :
                                    CentralObstruction.TCocycle D ρ { f : MLifts D ρ // redT ρ f = redT ρ f₀ }

                                    The T-cocycle torsor (the Prop. 8.9 assembly, 2.4a): fixing an M-lift f₀, the fibre of red_T through f₀ is a torsor under Z¹_{Γ,ρ}(T) — every M-lift with the same T-reduction is a unique T-twist of f₀. (Combined with central_twist_iff, this is the constant μ multiplicity of (132).)

                                    Equations
                                    • One or more equations did not get rendered due to their size.
                                    Instances For
                                      theorem GQ2.SectionEight.AffineTLift.lemma_8_7_count {Bg : Type} [Group Bg] [Finite Bg] {D : RadicalCoverData Bg} [TopologicalSpace Bg] [DiscreteTopology Bg] {Γ : Type} [Group Γ] [TopologicalSpace Γ] [IsTopologicalGroup Γ] (ρ : Γ →ₜ* Bg D.M) [DistribMulAction Γ (ZMod 2)] (Dsc : Descent D) (htriv : ∀ (γ : Γ) (m : ZMod 2), γ m = m) (f₀ : MLifts D ρ) (hf₀ : MLifts.Central D f₀) :
                                      Nat.card { f : MLifts D ρ // MLifts.Central D f redT ρ f = redT ρ f₀ } = Nat.card (CentralObstruction.TCocycle D ρ)

                                      Lemma 8.7, count form (the Prop. 8.9 assembly, 2.4c): the central M-lifts sharing the T-reduction of a fixed central lift f₀ number exactly #Z¹_{Γ,ρ}(T) — the multiplicity μ of (132), constant over the V-coordinate. (Central is automatic on the torsor once f₀ is central, by central_twist_iff.) d6 sums this over the liftable V-coordinates to reach zBC.

                                      The phase covers: centralCoverOfCocycle #

                                      The twisted product 𝔽₂ ×_δ C₀ of a normalized 𝔽₂-valued 2-cocycle δ on a finite group C₀ — a central double cover of C₀. This is the (133)/(134) phase-cover constructor: d6's prop_8_9 phase family is ζ ↦ centralCoverOfCocycle (Δ_{χ,κ}), with the scalar Δ produced by prop_8_8_target/DeltaScalar. Multiplicative analog of the Lemma 6.21 proof's additive Transgression.Twisted.

                                      noncomputable def GQ2.SectionEight.AffineTLift.centralCoverOfCocycle {C0 : Type} [Group C0] [Finite C0] (δ : C0 × C0ZMod 2) (hcoc : ∀ (g h k : C0), δ (h, k) + δ (g, h * k) = δ (g * h, k) + δ (g, h)) (hone_l : ∀ (c : C0), δ (1, c) = 0) (hone_r : ∀ (c : C0), δ (c, 1) = 0) :

                                      The phase cover (the Prop. 8.9 assembly): the central double cover 𝔽₂ ×_δ C₀ ↠ C₀ of a normalized 𝔽₂-2-cocycle δ — multiplication (s,c)(t,d) = (s+t+δ(c,d), cd), kernel ⟨z⟩ with z = (1,1). d6 instantiates δ := DeltaScalar (the (134) total phase).

                                      Equations
                                      • One or more equations did not get rendered due to their size.
                                      Instances For
                                        noncomputable def GQ2.SectionEight.AffineTLift.phaseFamily {C0 : Type} [Group C0] [Finite C0] {DT : Type} (Δ : DTC0 × C0ZMod 2) (hcoc : ∀ (ζ : DT) (g h k : C0), Δ ζ (h, k) + Δ ζ (g, h * k) = Δ ζ (g * h, k) + Δ ζ (g, h)) (hl : ∀ (ζ : DT) (c : C0), Δ ζ (1, c) = 0) (hr : ∀ (ζ : DT) (c : C0), Δ ζ (c, 1) = 0) :
                                        DTCentralCover C0

                                        The phase family (the Prop. 8.9 assembly): the prop_8_9-shaped phase-cover family DT → CentralCover C₀ from a family of normalized 2-cocycles. d6 supplies Δ ζ := DeltaScalar (the (134) total phase Δ_{χ,κ}), giving prop_8_9's phase component directly; the shared (μ, G⁰, DT) are lemma_8_7_count's #Z¹(T), gaussSum of the enrichment form, and the (T^∨)^C index.

                                        Equations
                                        Instances For
                                          theorem GQ2.SectionEight.AffineTLift.centralCoverOfCocycle_exists_section {C0 : Type} [Group C0] [Finite C0] (δ : C0 × C0ZMod 2) (hcoc : ∀ (g h k : C0), δ (h, k) + δ (g, h * k) = δ (g * h, k) + δ (g, h)) (hone_l : ∀ (c : C0), δ (1, c) = 0) (hone_r : ∀ (c : C0), δ (c, 1) = 0) :
                                          ∃ (s : C0(centralCoverOfCocycle δ hcoc hone_l hone_r).cover), (∀ (c : C0), (centralCoverOfCocycle δ hcoc hone_l hone_r).p (s c) = c) s 1 = 1 ∀ (c d : C0), s c * s d = (centralCoverOfCocycle δ hcoc hone_l hone_r).z ^ (δ (c, d)).val * s (c * d)

                                          The canonical section of the twisted-product cover (the Prop. 8.9 assembly export): the phase cover 𝔽₂ ×_δ C₀ admits a normalized set-section s with multiplication defect exactly δ (s c · s d = z^{δ(c,d)} · s(cd)). This is the (only) internals fact the phase-obstruction layer needs: a lift of ρ through the cover exists iff ρ^*δ is a continuous coboundary (GQ2/PhaseObstruction.lean).

                                          Paper-tag ledger (auto-generated by paperforge; do not edit) #