Alphabeta Math
TheoremStatement: 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.

Galois action on primes above a prime is transitive

Statement

Let L/K be a finite Galois extension of number fields and p a nonzero prime of OK. Then G=Gal(L/K) acts transitively on the primes P above p.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Chinese remainder theorem for pairwise comaximal ideals: Let R be a commutative ring and let I1,,Ir be pairwise comaximal ideals, where r1. Then the canonical map Ri=1rR/Ii,x(x+I1,,x+Ir) is surjective, its kernel is i=1rIi, and i=1rIi=i=1rIi. Equivalently, R/i=1rIii=1rR/Ii.

[F2]

Integral ideal factorisation in a number field, in ZF: Every nonzero integral ideal a of OK has a unique finite factorisation a=i=1rpiei into distinct nonzero prime ideals, with ei>0. The finite choices in this construction are least-coded finite choices, so the assertion uses no Choice.

[F3]

Norm and trace from embeddings, with the inseparable exponent in the norm formula: Let K/F be a finite field extension, let Ω/F be an algebraic closure, let Σ=HomF(K,Ω), and let [K:F]i be the inseparable degree (def-inseparable-degree). Then for every aK, TrK/F(a)=[K:F]iσΣσ(a), and NK/F(a)=(σΣσ(a))[K:F]i. In particular, when K/F is separable these are the ordinary sum and product over the distinct F-embeddings of K into Ω; and when [K:F]i>1 in characteristic p>0, the trace map is identically zero because [K:F]i is a power of p.

Proof

1.1

Factor pOL into its finite nonempty set S of prime divisors. These primes are maximal, hence distinct ones are comaximal; G permutes S because it fixes p. If S had two orbits A,B, CRT would give αOL with residue zero at every prime in A and residue one at every prime in B. The remaining finitely many primes may also be assigned residue one.

F1F2
2.1

The product c=σGσ(α)=NL/K(α) belongs to K and is integral, hence belongs to OK. At a prime of A every factor is zero modulo that prime; at a prime of B every factor is one, because each inverse image prime is again in B. Thus cp but c1 at a prime above p, a contradiction. There is only one orbit.

F3step 1.1

Depends on

Used by

Dependency tree · two levels

21 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