Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Second supplement from Frobenius on Q(zeta_8)

Statement

For every odd prime q, the element t=ζ8+ζ8−1 satisfies t2=2, so Q(2)=Q(t) is a quadratic subfield of Q(ζ8), and the arithmetic Frobenius of q acts on it by Frob⁡q(t)=(2q)t=(−1)(q2−1)/8 t.

Facts & Assumptions

Given: An odd prime q, a primitive eighth root of unity ζ=ζ8, and the element t:=ζ+ζ−1∈Q(ζ).

[F1]

The index f=8 is reduced, and q∤8; hence the arithmetic Frobenius of q in Q(ζ8)/Q is the power map σq(ζ)=ζ q (Arithmetic Frobenius is the power map in an unramified cyclotomic field, The cyclotomic extension K(μn) as a splitting field of tn−1).

[F2]

ζ2=ζ4 has order 4, so ζ2+ζ−2=i+(−i)=0 and t2=ζ2+2+ζ−2=2; in particular t is a square root of 2 and Q(t)=Q(2) is a degree-two subfield of Q(ζ8) (Ring of integers of every cyclotomic field, The cyclotomic extension K(μn) as a splitting field of tn−1).

[F3]

For every odd integer m, writing the residue of m modulo 8 gives ζm+ζ−m=t when m≡±1(mod8) and ζm+ζ−m=−t when m≡±3(mod8), because ζ4=−1 and ζ3=−ζ−1. For residues 1,7 the integer (m2−1)/8 is even, and for residues 3,5 it is odd. Thus σq(t)=(−1)(q2−1)/8t. [F1, algebra]

[F4]

Euler's criterion: for every integer a and odd prime q, (a/q)≡a(q−1)/2(modq), and (a/q)∈{−1,0,1} (Euler's criterion: (a/p)≡a(p−1)/2(modp), The Legendre symbol, including its zero value).

Proof

technique · direct
1.1F2

By [F2], t generates the quadratic field Q(2) inside Q(ζ8), and t≠0.

1.2F3

By [F3] there is a sign ε∈{±1} with σq(t)=εt, namely ε=(−1)(q2−1)/8.

2.1F1F2step 1.2

Since σq is the arithmetic Frobenius, σq(t)≡tq(modP) for every prime P above q; here tq=t (t2)(q−1)/2=2(q−1)/2t, and t≢0(modP) because t2=2 and q is odd. Hence ε≡2(q−1)/2(modq) as integers.

3.1F4step 2.1

Euler's criterion with a=2 gives 2(q−1)/2≡(2/q)(modq); since both ε and (2/q) lie in {−1,1} and their difference is divisible by the odd prime q, they are equal. Therefore Frob⁡q(t)=(2/q)t.

4.1step 1.2step 3.1∎

Finally (2/q)=(−1)(q2−1)/8, the exponent (q2−1)/8 being an integer for odd q and even exactly when q≡±1(mod8), which matches the sign computed in step 1.2.

Remarks

  • The quadratic field Q(2) is a subfield of Q(ζ8) because ζ8+ζ8−1=2 up to sign; no uniqueness statement for the quadratic subfield is needed for the Frobenius restriction.
  • Consistency of the two signs. The combinatorial sign in step 1.2 and the Legendre sign in step 3.1 are computed by different means and then compared modulo q; this is what fixes (2/q)=(−1)(q2−1)/8 without invoking the earlier second-supplement theorem.

Depends on

Used by

Dependency tree · two levels

38 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources