Documentation

GQ2.HilbertLedger

The Hilbert ledger for Lemma 6.16 #

Proof layer for GQ2.SectionSix.lemma_6_16 (deep-unit Evens norm vanishing, paper eq. (110)), following the paper's ledger (111)–(114) through axioms B9 (evensKahn_dyadic) and B11 (dyadicNormCriterion). Every theorem uses only the standard three axioms, except the Tier-4 assembly evensNorm_deepUnit_vanish, which additionally uses B9 and B11. Tier 5 supplies the eq.-(94) deep-unit orthogonality instances: normForm_* is proved at the standard three axioms, while cup_deep_* additionally uses B11a.

The ledger (paper, proof of Lemma 6.16) #

With L = k(δ), δ² = d, a = u + vδ a deep unit (a = 1 + 2b, ‖b‖ < 1), and n = u² − dv²:

  1. (112) u = 1 + (b + sb) is a unit (‖b + sb‖ < 1), and n = 1 + 2t + 4m with t = b + sb, m = b·sb — pure algebra after applying the reflection s (which sends δ ↦ −δ since s ∉ Stab δ).
  2. B9 degree 1 rearranged through kummerClassK_mul gives cor α = [n].
  3. B9 degree 2 + bilinearity (map_add) + (x,x) = (x,−1) (cup_self_eq_neg_one) collapse to (113): N^{Ev}[a] = (u,−d) + (2du, n) — equivalently, at the atom level used below, N^{Ev}[a] = (u,−1) + (u,d) + (2u,n) + (d,n).
  4. (u,d) = 0 (cup_unramified_unit + cup_comm: u is a unit, k(δ)/k unramified) and (d,n) = 0 (cup_of_normForm: n = u² − dv² is the norm form on the nose).
  5. (114) n/(2u−1) = 1 + 4m/(1+2t) has ‖n/(2u−1) − 1‖ ≤ ‖4‖·‖b‖² < ‖4‖, so sq_of_near_one (Hensel) gives [n] = [2u−1].
  6. Steinberg (cup_steinberg: 1 − 2u = 1² − 2u·1²) gives (2u, 2u−1) = (2u, −1); and (2,−1) = 0 (cup_two_neg_one: −1 = 1² − 2·1²), so (2u,−1) = (u,−1) and the two surviving terms cancel by h2_add_self.

Supporting lemmas #

The lemma_6_16 splice additionally transports along the statement's hLδ, the Kummer presentation of L/k; see docs/section67-extraction.md for the encoding decision.

Tier 0: coefficient 2-torsion #

theorem GQ2.h1_add_self {G : Type u_1} [Group G] [TopologicalSpace G] [DistribMulAction G (ZMod 2)] (x : ContCoh.H1 G (ZMod 2)) :
x + x = 0

H¹(G, 𝔽₂) is 2-torsion. The representative satisfies f + f = 0 pointwise (char 2), so the sum is H1mk of the zero cocycle.

theorem GQ2.h2_add_self {G : Type u_1} [Group G] [TopologicalSpace G] [DistribMulAction G (ZMod 2)] (x : ContCoh.H2 G (ZMod 2)) :
x + x = 0

H²(G, 𝔽₂) is 2-torsion. Same shape as h1_add_self, at Z2.

Tier 1 helpers: base-general cocycle algebra over ℚ̄₂ #

theorem GQ2.kcf_root_indep' {α β : AlgebraicClosure ℚ_[2]} (h : α ^ 2 = β ^ 2) :

Two square roots of the same ℚ̄₂-element give the same Kummer cocycle: α² = β² forces α = ±β, and κ is sign-insensitive (kummerCocycleFun_neg). Base-general analogue of Kummer.kummerCocycleFun_root_indep (no algebraMap-image hypothesis on the radicand).

theorem GQ2.kcf_mul_of_fixed {A B γ α β : AlgebraicClosure ℚ_[2]} ( : γ ^ 2 = A * B) ( : α ^ 2 = A) ( : β ^ 2 = B) (hα0 : α 0) (hβ0 : β 0) {g : Kummer.GaloisGroup ℚ_[2]} (hgA : g A = A) (hgB : g B = B) :

Base-general cocycle multiplicativity at a group element g fixing both radicands A, B (the two_values case analysis with abstract fixed squares, via two_values_of_fixed). Here γ is any square root of A·B, so κ_γ = κ_{αβ} by kcf_root_indep'.

Tier 1: Kummer-class algebra over a finite dyadic base #

theorem GQ2.kummerClassK_mul (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) (a b : (↥k)ˣ) :
kummerClassK k (a * b) = kummerClassK k a + kummerClassK k b

Multiplicativity of the base-general Kummer class. [O: sqrtCl (ab) and sqrtCl a · sqrtCl b are square roots of the same nonzero element, so the cocycles agree by Kummer.kummerCocycleFun_root_indep; then Kummer.kummerCocycleFun_mul (GQ2/Kummer.lean:179) gives pointwise additivity, and H1mk is additive on Z1.]

theorem GQ2.kummerClassK_one (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) :
kummerClassK k 1 = 0

The Kummer class of 1 vanishes. [O: 1 is its own square root; root-independence makes the cocycle g ↦ if g • 1 = 1 then 0 else 1 ≡ 0.]

theorem GQ2.kummerClassK_inv (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) (a : (↥k)ˣ) :
kummerClassK k a⁻¹ = kummerClassK k a

[a⁻¹] = [a] (derived).

theorem GQ2.kummerClassK_mul_self (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) (a : (↥k)ˣ) :
kummerClassK k (a * a) = 0

[a²] = 0 (derived).

Tier 2: cup-symbol algebra #

theorem GQ2.trivialCupPairing_comm {G : Type u_1} [Group G] [TopologicalSpace G] [DistribMulAction G (ZMod 2)] [ContinuousSMul G (ZMod 2)] (htriv : ∀ (g : G) (m : ZMod 2), g m = m) (x y : ContCoh.H1 G (ZMod 2)) :
((trivialCupPairing 2 G htriv) x) y = ((trivialCupPairing 2 G htriv) y) x

Symmetry of the degree-(1,1) cup pairing in char 2. [O: at representatives, cup11Fun a b + cup11Fun b a = δ¹(g ↦ a g · b g) — expand dOne; the pointwise product of two 1-cocycles is a continuous 1-cochain, so the difference is in B2; conclude by QuotientAddGroup.eq' through H2mk.]

theorem GQ2.cup_of_normForm (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (a b : (↥k)ˣ) (x y : k) (hb : b = x ^ 2 - a * y ^ 2) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k b) = 0

The norm-form direction of the B11 criterion, applied: an explicit representation b = x² − a y² kills the symbol. This consumes B11a directly rather than the bundled dyadicNormCriterion, so the axiom trace is std-3 ∪ {B11a} without the unused B11b clause.

theorem GQ2.cup_neg_self (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (a : (↥k)ˣ) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k (-a)) = 0

(a, −a) = 0 — the norm form represents −a as 0² − a·1².

theorem GQ2.cup_steinberg (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (a b : (↥k)ˣ) (hab : b = 1 - a) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k b) = 0

Steinberg (a, 1−a) = 0 — the norm form represents 1 − a as 1² − a·1².

theorem GQ2.cup_two_neg_one (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k (twoUnit k))) (kummerClassK k (-1)) = 0

(2, −1) = 0−1 = 1² − 2·1² (the paper's 2 = N_{k(i)/k}(1+i) step, replaced by the explicit dyadic representation; cf. the B11 docstring).

theorem GQ2.cup_self_eq_neg_one (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (a : (↥k)ˣ) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k a) = ((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k (-1))

(a, a) = (a, −1) (derived: 0 = (a, −a) = (a, −1) + (a, a) + 2-torsion).

theorem GQ2.cup_unramified_unit (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (a : (↥k)ˣ) (δa : AlgebraicClosure ℚ_[2]) (hδa : δa ^ 2 = a) (hunram : ∀ (z : AlgebraicClosure ℚ_[2]), z 0(∃ (x : k) (y : k), z = x + y * δa)∃ (w : k), w 0 z = w) (u : (↥k)ˣ) (hu : u = 1) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k u) = 0

Unramified unit-norm vanishing: if k(δa)/k has equal norm value groups then every unit symbol (a, u) dies — the B11 clause-2 consumer.

Tier 3: dyadic arithmetic #

theorem GQ2.norm_galois (g : Kummer.GaloisGroup ℚ_[2]) (x : AlgebraicClosure ℚ_[2]) :
g x = x

Galois invariance of the spectral norm on ℚ̄₂. [O: ‖· ∘ g‖ is a field norm on ℚ̄₂ extending the ℚ₂-norm, and the extension norm on an algebraic extension of a complete field is unique (Mathlib spectralNorm uniqueness layer); alternatively via the |N_{k(x)/ℚ₂}(x)|^{1/deg} characterization, which is visibly g-invariant.]

theorem GQ2.sq_of_near_one (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (z : k) (hz : z - 1 < 4) :
∃ (w : k), w ^ 2 = z

Hensel depth over a finite dyadic base: anything within < ‖4‖ of 1 is a square — the (114) step U_{2e+2}(k) ⊆ (k^×)². [O: Newton contraction w ↦ w − (w²−z)/(2w) starting at w₀ = 1, run inside ↥k; needs NormedField ↥k (subfield of ℚ̄₂, SubfieldClass instance) and CompleteSpace ↥k (FiniteDimensional.complete ℚ_[2] ↥k — finite-dimensional over a complete field; NB ℚ̄₂ itself is NOT complete, completeness is intrinsic to k). Estimates: ‖w_n − 1‖ ≤ ‖2‖ throughout, ‖w_{n+1}² − z‖ ≤ (‖w_n² − z‖/‖2‖)² — strictly contracting below ‖4‖. Mathlib's Padic.hensels_lemma is ℤ_p-only; do not reach for it.]

Tier-4 helpers: reflection identities, the Hensel step, and 2-torsion bookkeeping #

Tier 4: the assembled ledger #

theorem GQ2.evensNorm_deepUnit_vanish (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (u n d : (↥k)ˣ) (v : k) (hn : n = u ^ 2 - d * v ^ 2) (δ β : AlgebraicClosure ℚ_[2]) ( : δ ^ 2 = d) ( : β ^ 2 = u + v * δ) (hβ0 : β 0) (hidx : ((MulAction.stabilizer (Kummer.GaloisGroup ℚ_[2]) δ).subgroupOf k.fixingSubgroup).index = 2) (s : k.fixingSubgroup) (hs : s(MulAction.stabilizer (Kummer.GaloisGroup ℚ_[2]) δ).subgroupOf k.fixingSubgroup) (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (hUo : IsOpen ((MulAction.stabilizer (Kummer.GaloisGroup ℚ_[2]) δ).subgroupOf k.fixingSubgroup)) (α : ((MulAction.stabilizer (Kummer.GaloisGroup ℚ_[2]) δ).subgroupOf k.fixingSubgroup)ZMod 2) (hαdef : ∀ (g : ((MulAction.stabilizer (Kummer.GaloisGroup ℚ_[2]) δ).subgroupOf k.fixingSubgroup)), α g = Kummer.kummerCocycleFun β g) ( : ∀ (g h : ((MulAction.stabilizer (Kummer.GaloisGroup ℚ_[2]) δ).subgroupOf k.fixingSubgroup)), α (g * h) = α g + α h) (hαc : Continuous α) (b : AlgebraicClosure ℚ_[2]) (hb : b < 1) (hA : u + v * δ = 1 + 2 * b) (hunram : ∀ (z : AlgebraicClosure ℚ_[2]), z 0(∃ (x : k) (y : k), z = x + y * δ)∃ (w : k), w 0 z = w) :
evensNormH2 htriv hUo hidx hs α hαc = 0

The Hilbert ledger (paper, proof of Lemma 6.16; eqs. (111)–(114)) in the B9-native vocabulary: for a deep unit a = u + vδ = 1 + 2b (‖b‖ < 1) over the unramified quadratic Kummer datum (d, δ), the index-two Evens norm of its Kummer cocycle vanishes.

Route (O-finish; every ingredient is in this file, B9, or B11):

  1. s • δ = −δ from hs ((s•δ)² = d forces ±δ; + would put s in the stabilizer).
  2. (112): from hA and its s-image, (u:ℚ̄₂) = 1 + (b + s•b) and (n:ℚ̄₂) = (1+2b)(1+2(s•b)) — so ‖u − 1‖ < 1 and, with norm_galois, ‖n/(2u−1) − 1‖ ≤ ‖4‖·‖b‖² < ‖4‖ (‖1+2t‖ = 1 by the ultrametric bound).
  3. Apply evensKahn_dyadic; rearrange degree 1 with kummerClassK_mul/h1_add_self to corH1 … α … = kummerClassK k nU (nU the unit n).
  4. Substitute into degree 2; expand with map_add/kummerClassK_mul; kill (u,d) by cup_unramified_unit + trivialCupPairing_comm, (d,n) by cup_of_normForm (witness ⟨u, v, hn⟩), normalize (x,x) by cup_self_eq_neg_one — reaching (113) in the form N^{Ev} = (u,−1) + (2u, n).
  5. sq_of_near_one on n/(2u−1) + kummerClassK_mul/kummerClassK_mul_self give [n] = [2u−1]; cup_steinberg (at a := 2u, b := 1−2u, sign-flipped through cup_neg_self) turns (2u, 2u−1) into (2u, −1); cup_two_neg_one reduces (2u,−1) = (u,−1); h2_add_self cancels the two surviving terms.

Tier 5: the eq.-(94) deep-unit orthogonality #

Paper eq. (94) (§6.3, p. 29) is the Hilbert-symbol orthogonality Uᵢ^⊥ = U_{2e−i+1} of the dyadic square-class filtration together with −1 ∈ U_e. Lemma 6.17 consumes only two "⊆" instances: deep ⟂ deep (U_{e+1} ⟂ U_{e+1} — f1's isotropy and f2's free orbits) and deep ⟂ −1 (f2's square orbits). Neither is a numbered theorem in the provided texts — Fesenko–Vostokov, Local Fields and Their Extensions (2nd ed.), Ch. VII §4 records the general statements only as Exercises 4c and 5b, and O'Meara, Introduction to Quadratic Forms, §63 assembles them from the quadratic-defect propositions. They are proved here by the classical norm-form descent:

  1. values of the binary norm form x² − a·y² are closed under multiplication (Brahmagupta–Fibonacci composition, normForm_mul) and inversion (normForm_inv);
  2. for deep b (‖b − 1‖ < ‖2‖), the exact solution x₀ = (b+1)/2, y₀ = (b−1)/2 of x² − y² = b represents b up to the multiplicative error u = (x₀² − a·y₀²)/b with ‖u − 1‖ = ‖a−1‖·(‖b−1‖/‖2‖)² ≤ ‖b−1‖·(‖a−1‖/‖2‖) — a strict contraction (a deep);
  3. iterating (normForm_of_deep_aux) drives the error below ‖4‖, where the Local Square Theorem (sq_of_near_one; O'Meara 63:1) makes it a square, hence a norm-form value;
  4. b = x² − a·y² kills the symbol via cup_of_normForm (B11a = Serre LF Ch. XIV §2, Prop. 7 iii — the only axiom in the chain).

The normForm_* layer uses only the standard axioms; the cup_deep_* corollaries additionally use B11a.

theorem GQ2.normForm_mul (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) (a p q r s : k) :
(p ^ 2 - a * q ^ 2) * (r ^ 2 - a * s ^ 2) = (p * r + a * q * s) ^ 2 - a * (p * s + q * r) ^ 2

Brahmagupta–Fibonacci composition: values of x² − a·y² are closed under products.

theorem GQ2.normForm_inv (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) (a x y u : k) (hu : u = x ^ 2 - a * y ^ 2) (hu0 : u 0) :
u⁻¹ = (x / u) ^ 2 - a * (y / u) ^ 2

Nonzero values of x² − a·y² are closed under inversion.

theorem GQ2.normForm_of_deep (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (a b : k) (ha : a - 1 < 2) (hb : b - 1 < 2) :
∃ (x : k) (y : k), b = x ^ 2 - a * y ^ 2

Deep units are norm-form values of each other — the "⊆" half of paper eq. (94) at (U_{e+1}, U_{e+1}): for deep a, b ∈ k^× (‖· − 1‖ < ‖2‖, i.e. ∈ U_{e+1}(k)), b is represented by the norm form x² − a·y² of k(√a)/k. [Provenance: paper §6.3 eq. (94); Fesenko–Vostokov Ch. VII §4 Ex. 4c states the general i + j > 2e triviality (exercise — hence proved, not leafed); O'Meara §63A is the quadratic-defect calculus behind it. No axiom: Brahmagupta descent + Local Square Theorem.]

theorem GQ2.normForm_of_mid (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (a b : k) (ha : a - 1 2) (hb : b - 1 < 2) :
∃ (x : k) (y : k), b = x ^ 2 - a * y ^ 2

Deep units are norm-form values of every MID unit — the "⊆" half of eq. (94) at (U_e, U_{e+1}): for a ∈ U_e(k) (‖a − 1‖ ≤ ‖2‖) and deep b ∈ U_{e+1}(k), b is represented by x² − a·y². [Provenance: paper §6.3 eq. (94); Fesenko–Vostokov Ch. VII §4 Ex. 4c's i + j > 2e triviality at (e, e+1) (exercise — hence proved, not leafed); O'Meara §63A. No axiom: Brahmagupta descent + Local Square Theorem.]

theorem GQ2.cup_deep_deep (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (a b : (↥k)ˣ) (ha : a - 1 < 2) (hb : b - 1 < 2) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k b) = 0

Eq. (94), deep ⟂ deep (the deep-part proof's isotropy hiso and the Lemma 6.17 vanishing proof's free-orbit leaf): the symbol of two deep units vanishes. std-3 ∪ {B11a}.

theorem GQ2.cup_mid_deep (k : IntermediateField ℚ_[2] (AlgebraicClosure ℚ_[2])) [FiniteDimensional ℚ_[2] k] (htriv : ∀ (g : k.fixingSubgroup) (m : ZMod 2), g m = m) (a b : (↥k)ˣ) (ha : a - 1 2) (hb : b - 1 < 2) :
((trivialCupPairing 2 (↥k.fixingSubgroup) htriv) (kummerClassK k a)) (kummerClassK k b) = 0

Eq. (94), mid ⟂ deep(U_e, U_{e+1}) = 1 (the deep-part proof's hsharp inclusion input): the symbol of a MID unit against a deep unit vanishes. std-3 ∪ {B11a}.

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