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 compatibility in finite towers
Statement
Let M/L/K have M/K and L/K finite Galois, and let be nonzero primes with Q unramified over p. Then If with both finite Galois and Q unramified over p, the Frobenius elements at its two contractions determine uniquely by restriction.
Facts & Assumptions
Given: The data and hypotheses of the statement.
Decomposition and inertia in towers: Let M/L/K be a tower of number fields with M/K and L/K finite Galois, and fix nonzero primes . With , Restriction gives exact sequences The intersection identities also hold without L/K Galois; the displayed quotient assertions use that hypothesis.
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.
Ramification and residue degrees in towers: For and ,
Proof
Multiplicativity of e and positivity give e=1 for both steps. Restriction of belongs to D(P/p), and its congruences on reduce to the power map at P. Uniqueness gives the first formula.
Set . The residue power map on has order f: this follows directly since has elements, while for the polynomial has fewer roots than that field. Since the unramified residue action identifies D(P/p) with its image, the restriction of is identity. Thus and acts on as the power map. The relative unramified uniqueness gives the second formula.
An automorphism of a compositum is determined by its restrictions to the generating fields: if both restrictions are identity it fixes every field expression in those generators. Apply the first formula to each to obtain the stated determining pair. This assertion assumes the compositum prime is unramified.
Depends on
Used by
- Decomposition groups in a tower Example
Dependency tree · two levels
10 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, Propositions 8.15–8.17, p.142 (standard reference, not scraped)