Documentation

TauCeti.NumberTheory.Multiquadratic.Frobenius

Frobenius actions on multiquadratic generators #

Let K = ℚ(√d₁, …, √dₙ) be a number field generated over ℚ by square roots r i of integers d i, and let p be an odd prime dividing none of the d i. The multiquadratic roadmap's Layer 1 states the splitting law in two forms: p splits completely iff every d i is a quadratic residue mod p (NumberField.ncard_primesOver_multiquadratic_iff), and, more precisely, the Frobenius at p acts on the generators by the Legendre symbols. This file supplies the second, finer form. An arithmetic Frobenius exists at every prime Q of 𝓞 K above p and acts on each generator by the corresponding symbol,

σ (r i) = legendreSym p (d i) • r i

(NumberField.exists_isArithFrobAt_multiquadratic), and the Frobenius is trivial iff every symbol is 1 (isArithFrobAt_multiquadratic_eq_one_iff).

The roadmap's actual sign-vector statement — the Frobenius equals ((d₁/p), …, (dₙ/p)) under the identification Gal ≅ (ℤ/2)ⁿ — is then proved for the multiquadratic field taken as the intermediate field M = ℚ(√dᵢ : i) = adjoin ℚ (Set.range root) itself, where TauCeti.Multiquadratic.galoisGroupEquiv lives (its automorphisms are of M, not of an abstract K). For a Frobenius σ on M at a prime over p, NumberField.signPattern_frobenius gives each coordinate signPattern root σ i = if legendreSym p (d i) = 1 then 0 else 1, and NumberField.galoisGroupEquiv_frobenius packages this as galoisGroupEquiv σ = ((d₁/p), …, (dₙ/p)).

Main results #

theorem NumberField.isArithFrobAt_multiquadratic_eq_one_iff {K : Type u_1} [Field K] [NumberField K] {ι : Type u_2} {p : ℕ} [Fact (Nat.Prime p)] (d : ι → ℤ) (r : ι → K) (hr : ∀ (i : ι), r i ^ 2 = (algebraMap ℤ K) (d i)) (htop : IntermediateField.adjoin ℚ (Set.range r) = ⊤) (hodd : p ≠ 2) (hcop : ∀ (i : ι), ¬↑p ∣ d i) (Q : Ideal (RingOfIntegers K)) [Q.LiesOver (Ideal.span {↑p})] {σ : Gal(K/ℚ)} (hσ : IsArithFrobAt ℤ σ Q) :
σ = 1 ↔ ∀ (i : ι), legendreSym p (d i) = 1

A multiquadratic Frobenius is trivial iff every radicand is a residue. Let K = ℚ(√d₁, …, √dₙ) be generated over ℚ by the square roots r i of the integers d i, let p be an odd prime with p ∤ d i for all i, and let σ be an arithmetic Frobenius at an ideal Q of 𝓞 K above p. Then σ = 1 iff every d i is a quadratic residue mod p. Combined with the splitting law, this is the Frobenius-theoretic reading of complete splitting.

theorem NumberField.exists_isArithFrobAt_multiquadratic {K : Type u_1} [Field K] [NumberField K] {ι : Type u_2} {p : ℕ} [Fact (Nat.Prime p)] [IsGalois ℚ K] (d : ι → ℤ) (r : ι → K) (hr : ∀ (i : ι), r i ^ 2 = (algebraMap ℤ K) (d i)) (hodd : p ≠ 2) (hcop : ∀ (i : ι), ¬↑p ∣ d i) (Q : Ideal (RingOfIntegers K)) [Q.IsPrime] [Q.LiesOver (Ideal.span {↑p})] :
∃ (σ : Gal(K/ℚ)), IsArithFrobAt ℤ σ Q ∧ ∀ (i : ι), σ (r i) = legendreSym p (d i) • r i

The Frobenius of a multiquadratic field acts on each generator by a Legendre symbol. For a Galois number field K with elements r i satisfying r i ² = d i ∈ ℤ, an odd prime p with p ∤ d i for all i, and any prime Q of 𝓞 K above p, there is an arithmetic Frobenius σ ∈ Gal(K/ℚ) at Q, and it sends each generator to the corresponding Legendre multiple: σ (r i) = legendreSym p (d i) • r i. This is the generator-wise Frobenius input of the multiquadratic splitting law; the sign-vector description under galoisGroupEquiv is not formed here (see the module docstring). The IsGalois ℚ K hypothesis holds in particular when the r i generate K (TauCeti.Multiquadratic.isGalois transported along adjoin ℚ … = ⊤).

The Frobenius as a sign vector under Gal ≅ (ℤ/2)ⁿ #

The signPattern/galoisGroupEquiv API of TauCeti.NumberTheory.Multiquadratic.Galois.Group is stated for automorphisms of the intermediate field M = adjoin ℚ (Set.range root). To match the roadmap's Gal(K/ℚ) ≅ (ℤ/2)ⁿ Frobenius-vector statement we take that intermediate field (a number field, NumberField.of_intermediateField) as the multiquadratic field itself, and compute the Frobenius sign pattern there.

@[instance_reducible]
def NumberField.algebraRatAdjoinRange {ι : Type u_2} {L : Type u_3} [Field L] [NumberField L] {root : ι → L} :

The rational algebra structure on the multiquadratic intermediate field.

Equations
Instances For
    theorem NumberField.signPattern_frobenius {ι : Type u_2} {L : Type u_3} [Field L] [NumberField L] {root : ι → L} {d : ι → ℤ} (hroot : ∀ (i : ι), root i ^ 2 = (algebraMap ℤ L) (d i)) (p : ℕ) [Fact (Nat.Prime p)] (hodd : p ≠ 2) (hcop : ∀ (i : ι), ¬↑p ∣ d i) (Q : Ideal (RingOfIntegers ↥(IntermediateField.adjoin ℚ (Set.range root)))) [Q.LiesOver (Ideal.span {↑p})] {σ : Gal(↥(IntermediateField.adjoin ℚ (Set.range root))/ℚ)} (hσ : IsArithFrobAt ℤ σ Q) (i : ι) :

    The Frobenius sign pattern of a multiquadratic field is the Legendre encoding. For the multiquadratic field M = ℚ(√dᵢ : i) = adjoin ℚ (Set.range root), an odd prime p ∤ dᵢ, and an arithmetic Frobenius σ on M at a prime Q above p, the i-th coordinate of the sign pattern is 0 when dᵢ is a quadratic residue mod p and 1 otherwise.

    theorem NumberField.galoisGroupEquiv_frobenius {ι : Type u_2} {L : Type u_3} [Field L] [NumberField L] {root : ι → L} {d : ι → ℤ} [Finite ι] (hroot : ∀ (i : ι), root i ^ 2 = (algebraMap ℤ L) (d i)) (hindep : ∀ (S : Finset ι), S.Nonempty → ¬IsSquare (∏ i ∈ S, ↑(d i))) (p : ℕ) [Fact (Nat.Prime p)] (hodd : p ≠ 2) (hcop : ∀ (i : ι), ¬↑p ∣ d i) (Q : Ideal (RingOfIntegers ↥(IntermediateField.adjoin ℚ (Set.range root)))) [Q.LiesOver (Ideal.span {↑p})] {σ : Gal(↥(IntermediateField.adjoin ℚ (Set.range root))/ℚ)} (hσ : IsArithFrobAt ℤ σ Q) :

    The Frobenius of a multiquadratic field is the Legendre sign vector. Under square-class independence of the dᵢ (so TauCeti.Multiquadratic.galoisGroupEquiv is the identification Gal(M/ℚ) ≅ (ℤ/2)ⁿ), an arithmetic Frobenius σ at a prime Q above the odd prime p ∤ dᵢ maps to the vector of Legendre symbols i ↦ (dᵢ/p). This is the roadmap's Layer 1 Frobenius statement.

    Dyadic Frobenius sign patterns in multiquadratic fields #

    For square roots of integers dᵢ ≡ 1 (mod 4), Frobenius at a prime over 2 has sign coordinate 0 if dᵢ ≡ 1 (mod 8) and 1 if dᵢ ≡ 5 (mod 8). Under square-class independence these are its coordinates in the explicit Galois-group isomorphism with (ℤ/2)ⁿ. In particular, Frobenius is the identity exactly when every radicand is 1 modulo 8.

    The condition modulo 4 lets one use integral half-generators to separate the two conjugates modulo 2. For prime-discriminant composita of odd discriminant, all generators satisfy this condition. This complements the odd-prime Legendre-symbol calculation above.

    theorem TauCeti.Multiquadratic.isArithFrobAt_eq_one_iff_mod_eight {K : Type u_1} [Field K] [CharZero K] {ι : Type u_2} (d : ι → ℤ) (r : ι → K) (hr : ∀ (i : ι), r i ^ 2 = (algebraMap ℤ K) (d i)) (htop : IntermediateField.adjoin ℚ (Set.range r) = ⊤) (hd : ∀ (i : ι), d i % 4 = 1) (Q : Ideal (NumberField.RingOfIntegers K)) [Q.LiesOver (Ideal.span {2})] {σ : Gal(K/ℚ)} (hσ : IsArithFrobAt ℤ σ Q) :
    σ = 1 ↔ ∀ (i : ι), d i % 8 = 1

    Frobenius above 2 on a field generated by square roots of dᵢ ≡ 1 (mod 4) is trivial exactly when all the radicands are 1 modulo 8. No independence assumption is needed.

    theorem TauCeti.Multiquadratic.signPattern_frobenius_two {L : Type u_1} [Field L] [CharZero L] {ι : Type u_2} {d : ι → ℤ} {root : ι → L} (hroot : ∀ (i : ι), root i ^ 2 = (algebraMap ℤ L) (d i)) (hd : ∀ (i : ι), d i % 4 = 1) (Q : Ideal (NumberField.RingOfIntegers ↥(IntermediateField.adjoin ℚ (Set.range root)))) [Q.LiesOver (Ideal.span {2})] {σ : Gal(↥(IntermediateField.adjoin ℚ (Set.range root))/ℚ)} (hσ : IsArithFrobAt ℤ σ Q) (i : ι) :
    signPattern root σ i = if d i % 8 = 1 then 0 else 1

    The sign vector of a dyadic Frobenius has a 1 exactly at the radicands congruent to 5 modulo 8.

    theorem TauCeti.Multiquadratic.galoisGroupEquiv_frobenius_two {L : Type u_1} [Field L] [CharZero L] {ι : Type u_2} {d : ι → ℤ} {root : ι → L} [Finite ι] (hroot : ∀ (i : ι), root i ^ 2 = (algebraMap ℤ L) (d i)) (hindep : ∀ (S : Finset ι), S.Nonempty → ¬IsSquare (∏ i ∈ S, ↑(d i))) (hd : ∀ (i : ι), d i % 4 = 1) (Q : Ideal (NumberField.RingOfIntegers ↥(IntermediateField.adjoin ℚ (Set.range root)))) [Q.LiesOver (Ideal.span {2})] {σ : Gal(↥(IntermediateField.adjoin ℚ (Set.range root))/ℚ)} (hσ : IsArithFrobAt ℤ σ Q) :
    (galoisGroupEquiv ⋯ hindep) σ = Multiplicative.ofAdd fun (i : ι) => if d i % 8 = 1 then 0 else 1

    Under square-class independence, the Galois-group coordinates of Frobenius above 2 are 0 at radicands 1 modulo 8 and 1 at radicands 5 modulo 8.