Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedaudited 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.

Prime factorisation in quadratic fields

Example

In Z[i], the ideal (5)=(2+i)(2i) splits, (3) is inert, and (2)=(1+i)2 ramifies, where each parenthesized expression denotes a principal ideal.

Verification

Given: OQ(i)=Z[i].

1.1

In R=Z[i], (2+i)(2i)=5 as elements, hence (5)=(2+i)(2i) as ideals. The quotient by (2+i) is F5 via i2, and the quotient by (2i) is F5 via i2: in either quotient eliminate i, leaving the relation 5=0. Thus both factors are prime of residue degree one. They are distinct, since 2+i maps to 40 in the second quotient.

givenalgebra
1.2

The quotient R/(3) is F3[X]/(X2+1), a field of nine elements since X2+1 has no root in F3. Thus (3) is itself prime with residue degree two.

givenalgebra
2.1

Finally (1+i)2=2i as elements, and i is a unit, so (2)=(1+i)2 as ideals. The quotient R/(1+i) is F2 by substituting i=1, so (1+i) is prime with residue degree one. These explicit ideal products and residue fields give respectively (e,f)=(1,1),(1,1); (1,2); and (2,1). They satisfy the degree-two fundamental identity and the definitions of split, inert, and ramified.

step 1.1step 1.2algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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