§8: central covers, affine fibres, and Fourier inversion — statements #
Statement-first extraction of the paper's §8 (pages 38–44): the half-torsor count (Lemma 8.6) and the closed exact-image recursion (Prop 8.9, displays (136)–(142)), together with the finite Fourier/Gauss engines they run on (Lemmas 8.4/8.5) and the central-cover bookkeeping (Lemma 8.2/8.3). The §9 induction consumes only the boxed system of Prop. 8.9 plus Lemma 8.3.
Setting (§8 opening): the simple-head block of §7 (GQ2.SectionSeven.MinimalBlock) on a
boundary-framed marked target 𝒴 = (Y, L_Y, π_Y, θ_Y) (GQ2.MarkedTarget), with
R = Φ(K), M = K/R, 0 → T → M → V → 0, B = Y/R, C = Y/K, and T = T₀ = (K∩S)R/R
(Lemma 7.1). All counts are the exact-image counts e^β_Γ(·) of eq. (29)
(GQ2.exactImageCount) for the two sources Γ ∈ {Γ_A, G_ℚ₂} through a BoundaryMaps
witness (the boundary-frame design).
Encoding decisions and deviations #
- Lemmas 8.4/8.5 are proved, in multiplied-out integer form. (125) is stated as
|D| · #{o = 0} = Σ_λ (2 m_λ − |X|)overℤ(no division), withDthe𝔽₂-linear dual; (126) as2|E| · N(κ,ε) = |W| + G(Q) Σ_χ (−1)^{χ(κ)+ε+Q(a_χ)}. In (126) the paper definesa_χfrom nonsingularity; hereais data with the defining specB_Q(a_χ, x) = χ(L x)(house style, cf.prop_7_4'slam), and nonsingularity is not needed for the identity itself. - Central double covers are a structure (
CentralCover): a surjectionp : Ỹ ↠ Ywith central kernel⟨z⟩of order 2. The pulled-back boundary-framed structure of Lemma 8.3 isCentralCover.pullTarget; the paper's side condition "the central kernel lies inker(π̃, θ̃)" holds by construction (π̃ = π_Y ∘ pkillsker p). - "Scalar pushout vanishes" / "pullback cover is split" is encoded as liftability:
u^β_Γ(p, J)(liftableCount) counts boundary-framed exact-image maps to theJ-stratum that lift throughpas continuous homomorphisms. This is the paper's torsor description verbatim (an unobstructed map has a lift, and its exact-image lifts are the summands of (124)). - Lemma 8.6's edge class is carried operationally. The
H¹-valued edge[ε̄]of (128) exists iff the cover does not descend toB/T; the paper's own descent clause says a descended cover is exactly a normal complement to the preimage ofT. We therefore phrase "edge ≠ 0" as¬∃ N ◁ B̃, N.map p = T ∧ z ∉ N, and state the half-torsor count in consequence form, per source (the degree-one duality that makes the variation functional (127) nonzero is B6 on the local side and §5 content on the candidate side, so a source-generic statement would need a duality hypothesis — flagged deviation; theH¹-form (128)/(127) is the internal §8 proof). - Lemma 8.7 and Prop 8.8 are not separately stated (the §§6–7 statement layer precedent: 6.7/6.10/6.11):
they are proof mechanisms for the (140)-clause of Prop 8.9. Their content enters the
statement layer only through the
∃-form of (140) below. If the §9 induction needs (131)/(135) as standalone statements, that is a reviewed addition. - Prop 8.9 is frozen as the boxed system. (136)–(139) are stated verbatim (integer
multiplied-out forms, target-side data from the §7 block). The scalar characters
λ ∈ D_R = (R^∨)^Care encoded asY-normal subgroupsR' ≤ Rof index ≤ 2 (the kernel ofλ;Y-normality =C-invariance — same encoding aslemma_7_1_dual), and the scalar coverp_λ : B_λ ↠ Bis the quotient mapY/R' ↠ Y/R. (140)–(142) are frozen in∃-family form: there exist a constantμand a target-side family of central covers of theC-stratum, indexed by the scalar duals ofT, satisfying (140) withs_Γfolded through (141)/(142) (then_{Γ,0}-liftability form). The family is target-side data, so one witness serves both sources — which is all the §9 induction uses. Pinning the family to the phase classesΔ_{χ,κ}of (133)/(134) is the O-half's work (via 6.21/6.22/8.8).
Axioms: none in this file (statement layer; the Ax budget B6/B7/B9 was consumed by the O-half proofs, which all proved).
Paper-tag ledger (auto-generated by paperforge; do not edit) #
- eq. (125) = ⟦eq-covertransform⟧
- eq. (126) = ⟦eq-fourier⟧
- eq. (29) = ⟦eq-eGamma⟧
- eq. (3) = ⟦eq-defwords3⟧
- Lemma 6.1 = ⟦lem-extraspecialconnecting⟧
- Lemma 7.1 = ⟦lem-simplehead⟧
- Lemma 8.2 = ⟦lem-commonscalars⟧
- Lemma 8.3 = ⟦lem-covertransform⟧
- Lemma 8.4 = ⟦lem-fourier⟧
- Lemma 8.5 = ⟦lem-constrainedgauss⟧
- Lemma 8.6 = ⟦lem-radicaledge⟧
- Lemma 8.7 = ⟦lem-affinelifting⟧
- Prop 7.4 = ⟦prop-simpleheaddet⟧
- Prop 8.8 = ⟦prop-phaseidentity⟧
- Proposition 8.9 = ⟦thm-closedrecursion⟧ (= theorem 8.17 in current tex)