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.
Gaussian and eisenstein frobenius
Example
In , an odd prime p splits if and is inert if ; arithmetic Frobenius sends . The prime 2 ramifies. In , a prime splits if and is inert if ; arithmetic Frobenius sends . The prime 3 ramifies.
Facts & Assumptions
Given: The data and hypotheses of the statement.
Frobenius cycle type and prime splitting: Let be monic separable with splitting field L, and let p be a rational prime not dividing . Then p is unramified in L and is squarefree. The degrees of its monic irreducible factors, with each distinct factor counted once, are exactly the cycle lengths of arithmetic Frobenius on the roots of F.
Decomposition inertia in a quadratic field: In a quadratic Galois extension of number fields, let . For any nonzero base prime the three possibilities are: split: , , Frobenius identity; inert: , , , Frobenius the nonidentity element; ramified: , , arithmetic Frobenius coset identity in D/I.
The multiplicative group of a finite field is cyclic: The multiplicative group of every finite field is cyclic.
Integers in a quadratic field: For squarefree , if , and otherwise.
Verification
The quadratic integral-basis theorem gives and , since . The polynomials are and , with discriminants -4 and -3. At the stated nonexceptional primes they have good reduction.
For odd p, roots of are elements of order four in . Cyclicity says they exist exactly when . For , roots of are elements of order three, since and T=1 is not a root unless p=3. Cyclicity gives roots exactly when . A quadratic without a root is irreducible. Thus the cycle types are two fixed points or a transposition, giving split or inert cases in the quadratic table.
In good reduction the two roots are distinct. The Frobenius congruence sends each chosen root to its p-th power modulo P; that power is itself a root, so injectivity on the two root reductions forces equality in the number field. This gives both claimed formulas.
In the Gaussian ring, and by substituting i=-1. Thus (1+i) is prime and as ideals. In the Eisenstein ring, and the quotient by is by substituting . Hence as ideals. Both exceptional primes ramify.
Depends on
Used by
- Ramified frobenius has no canonical lift Counterexample
Dependency tree · two levels
17 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
- Chapter 8, Examples 8.18–8.19, pp.142–143 (standard reference, not scraped)