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 , the element satisfies , so is a quadratic subfield of , and the arithmetic Frobenius of acts on it by
Facts & Assumptions
Given: An odd prime , a primitive eighth root of unity , and the element .
The index is reduced, and ; hence the arithmetic Frobenius of in is the power map (Arithmetic Frobenius is the power map in an unramified cyclotomic field, The cyclotomic extension as a splitting field of ).
has order , so and ; in particular is a square root of and is a degree-two subfield of (Ring of integers of every cyclotomic field, The cyclotomic extension as a splitting field of ).
For every odd integer , writing the residue of modulo gives when and when , because and . For residues the integer is even, and for residues it is odd. Thus . [F1, algebra]
Euler's criterion: for every integer and odd prime , , and (Euler's criterion: , The Legendre symbol, including its zero value).
Proof
By [F2], generates the quadratic field inside , and .
By [F3] there is a sign with , namely .
Since is the arithmetic Frobenius, for every prime above ; here , and because and is odd. Hence as integers.
Euler's criterion with gives ; since both and lie in and their difference is divisible by the odd prime , they are equal. Therefore .
Finally , the exponent being an integer for odd and even exactly when , which matches the sign computed in step 1.2.
Remarks
- The quadratic field is a subfield of because 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 ; this is what fixes 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
- Jerry Shurman, Math 361 Ninth Lecture, sections 3-4 (standard reference, not scraped)
- J. S. Milne, Algebraic Number Theory, Ch. 8, Example 8.18 (standard reference, not scraped)