Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 QPp be nonzero primes with Q unramified over p. Then Frob(Q/p)L=Frob(P/p),Frob(Q/P)=Frob(Q/p)f(P/p). If M=L1L2 with both Li/K finite Galois and Q unramified over p, the Frobenius elements at its two contractions determine Frob(Q/p) uniquely by restriction.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

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 QPp. With H=Gal(M/L), D(Q/P)=D(Q/p)H,I(Q/P)=I(Q/p)H. Restriction gives exact sequences 1D(Q/P)D(Q/p)D(P/p)1, 1I(Q/P)I(Q/p)I(P/p)1. The intersection identities also hold without L/K Galois; the displayed quotient assertions use that hypothesis.

[F2]

Unramified frobenius element exists uniquely: For finite Galois L/K and a nonzero prime Pp with e(P/p)=1, there is a unique FrobPD(P/p) satisfying FrobP(a)aNp(modP)(aOL). It is the arithmetic Frobenius element, the unique lift of the arithmetic Frobenius coset.

[F3]

Ramification and residue degrees in towers: For M/L/K and QPp, e(Q/p)=e(Q/P)e(P/p),f(Q/p)=f(Q/P)f(P/p).

Proof

1.1

Multiplicativity of e and positivity give e=1 for both steps. Restriction of σ=Frob(Q/p) belongs to D(P/p), and its congruences on OL reduce to the q=Np power map at P. Uniqueness gives the first formula.

F1F2F3
2.1

Set f=f(P/p). The residue power map on κ(P) has order f: this follows directly since κ(P) has qf elements, while for 0<j<f the polynomial TqjT has fewer roots than that field. Since the unramified residue action identifies D(P/p) with its image, the restriction of σf is identity. Thus σfD(Q/P) and acts on κ(Q) as the qf=NP power map. The relative unramified uniqueness gives the second formula.

F2step 1.1
3.1

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 Li to obtain the stated determining pair. This assertion assumes the compositum prime is unramified.

step 1.1

Depends on

Used by

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