Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Gaussian and eisenstein frobenius

Example

In Q(i), an odd prime p splits if p1(mod4) and is inert if p3(mod4); arithmetic Frobenius sends iip. The prime 2 ramifies. In Q(ζ3), a prime p3 splits if p1(mod3) and is inert if p2(mod3); arithmetic Frobenius sends ζ3ζ3p. The prime 3 ramifies.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Frobenius cycle type and prime splitting: Let FZ[T] be monic separable with splitting field L, and let p be a rational prime not dividing Disc(F). Then p is unramified in L and FˉFp[T] 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.

[F2]

Decomposition inertia in a quadratic field: In a quadratic Galois extension of number fields, let G=C2. For any nonzero base prime the three possibilities are: split: (e,f,g)=(1,1,2), D=I=1, Frobenius identity; inert: (1,2,1), D=C2, I=1, Frobenius the nonidentity element; ramified: (2,1,1), D=I=C2, arithmetic Frobenius coset identity in D/I.

[F3]

The multiplicative group Fq× of a finite field is cyclic: The multiplicative group F×=F{0} of every finite field F is cyclic.

[F4]

Integers in a quadratic field: For squarefree d1, OQ(d)=Z[(1+d)/2] if d1(mod4), and Z[d] otherwise.

Verification

1.1

The quadratic integral-basis theorem gives OQ(i)=Z[i] and OQ(ζ3)=Z[ζ3], since ζ3=(1+3)/2. The polynomials are T2+1 and T2+T+1, with discriminants -4 and -3. At the stated nonexceptional primes they have good reduction.

F4
2.1

For odd p, roots of T2+1 are elements of order four in Fp×. Cyclicity says they exist exactly when 4p1. For p3, roots of T2+T+1 are elements of order three, since (T1)(T2+T+1)=T31 and T=1 is not a root unless p=3. Cyclicity gives roots exactly when 3p1. 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.

F1F2F3step 1.1
2.2

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.

F1step 1.1
3.1

In the Gaussian ring, (1+i)2=2i and Z[i]/(1+i)=F2 by substituting i=-1. Thus (1+i) is prime and (2)=(1+i)2 as ideals. In the Eisenstein ring, (1ζ3)2=3ζ3 and the quotient by (1ζ3) is F3 by substituting ζ3=1. Hence (3)=(1ζ3)2 as ideals. Both exceptional primes ramify.

step 1.1algebra

Depends on

Used by

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