Documentation

TauCeti.LinearAlgebra.QuadraticForm.Diagonal.Chain.Induction

Pairwise products along diagonal chains #

Several invariants of a diagonal quadratic form ⟨a₁, …, aₙ⟩ are products over the pairs of distinct coefficients, ∏_{i<j} F aᵢ aⱼ, for a pairing F of units with values in a commutative monoid: the Hasse invariant ∏_{i<j} [(aᵢ, aⱼ)] in the Brauer group, the local Hasse invariant built from the {±1}-valued Hilbert symbol, and the second Stiefel–Whitney class. By Witt's chain theorem, such a product is an invariant of the isometry class of the form as soon as it is unchanged by the two kinds of elementary steps of a diagonal chain. This file proves that invariance once, for an abstract pairing:

The second hypothesis already forces symmetry, because ⟨a, b⟩ ≅ ⟨b, a⟩. It also forces F (a * b) x = F (c * d) x whenever ⟨a, b⟩ ≅ ⟨c, d⟩, because their discriminants differ by a square, so rescaling the first coordinate gives ⟨a * b, x⟩ ≅ ⟨c * d, x⟩. Together with multiplicativity, this makes the cross terms between the changed pair and the unchanged coefficients agree.

Main results #

Which invariant each source means #

The sources give the name Hasse invariant to two different products of symbols, and the name Witt invariant to a third invariant that is not a pairwise product at all. Below, q ≅ ⟨a₁, …, aₙ⟩ and (a, b) is a symbol: the quaternion algebra up to isomorphism, its class in the Brauer group, or the {±1}-valued Hilbert symbol over a local field.

⚠ Lam (p. 120, Caution) records that the formula relating c and s published by C. T. C. Wall is incorrect; TauCeti.RegularFormClass.cliffordInvariant_eq_hasseInvariant_mul is Lam's formula, so a comparison with another source should start from it.

References #

theorem TauCeti.PermutationStep.prod_prod_Ioi_eq {R : Type u} {M : Type v} [CommMonoid M] {n : ℕ} [CommSemiring R] {F : Rˣ → Rˣ → M} (hF : ∀ (a b : Rˣ), F a b = F b a) {w w' : Fin n → Rˣ} (h : PermutationStep w w') :
∏ i : Fin n, ∏ j > i, F (w i) (w j) = ∏ i : Fin n, ∏ j > i, F (w' i) (w' j)

Pairwise products are invariant under a permutation step. For a symmetric pairing F, reordering the coefficients does not change ∏_{i<j} F (w i) (w j).

theorem TauCeti.BinaryStep.prod_prod_Ioi_eq {R : Type u} {M : Type v} [CommMonoid M] {n : ℕ} [CommRing R] [Invertible 2] {F : Rˣ → Rˣ → M} (hmul : ∀ (a b c : Rˣ), F (a * b) c = F a c * F b c) (hF : ∀ (a b c d : Rˣ), (QuadraticMap.weightedSumSquares R ![↑a, ↑b]).Equivalent (QuadraticMap.weightedSumSquares R ![↑c, ↑d]) → F a b = F c d) {w w' : Fin n → Rˣ} (h : BinaryStep w w') :
∏ i : Fin n, ∏ j > i, F (w i) (w j) = ∏ i : Fin n, ∏ j > i, F (w' i) (w' j)

Pairwise products are invariant under a binary step. Let F be multiplicative in its first argument and take equal values on the coefficients of isometric binary forms. Then replacing two coefficients of a diagonal form by the coefficients of an isometric binary form does not change ∏_{i<j} F (w i) (w j).