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.
Frobenius elements above a prime are conjugate
Statement
In a finite Galois extension L/K let the nonzero prime p be unramified. If above p, then Thus p determines one conjugacy class. If the Galois group is abelian, the element is independent of P.
Facts & Assumptions
Given: The data and hypotheses of the statement.
Unramified frobenius element exists uniquely: For finite Galois L/K and a nonzero prime with , there is a unique satisfying It is the arithmetic Frobenius element, the unique lift of the arithmetic Frobenius coset.
Conjugacy of decomposition and inertia groups: In finite Galois L/K, if above a nonzero p, then The residue actions correspond under , .
Galois action on primes above a prime is transitive: Let L/K be a finite Galois extension of number fields and p a nonzero prime of . Then acts transitively on the primes P above p.
Proof
Conjugation by sigma transports D(P/p) to D(P'/p) and its residue action through the isomorphism induced by sigma. A field isomorphism commutes with taking the q-th power, where . Hence the conjugate of acts as that power map at P'.
Unramified Frobenius is uniquely characterized by this action, proving the formula. Transitivity says every prime P' above p is obtained in this way; conversely every sigma gives such a prime. The set of elements is therefore exactly a conjugacy class. In an abelian group conjugation fixes each element.
Depends on
Used by
Dependency tree · two levels
9 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, Proposition 8.14; Stein Proposition 9.4.1 (standard reference, not scraped)