Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27
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.

x2+1 is irreducible over R and split over C

Example

The polynomial x2+1 is irreducible in R[x], while over C it factors as x2+1=(x−i)(x+i).

Facts & Assumptions

Given: The polynomial f(x)=x2+1.

[L1]

The polynomial x2+1 is irreducible in R[x] (x2+1 is irreducible over R).

[L2]

Every nonconstant polynomial in C[x] splits into linear factors (Every nonconstant polynomial in C[x] splits into linear factors).

Verification

technique · direct
1.1L1

Fact [L1] gives the real-side claim immediately: x2+1 is irreducible over R.

1.2L2algebra

In C[x] one has (x−i)(x+i)=x2+1, so f has the two complex roots i and −i. This agrees with the general splitting statement [L2].

2.1step 1.1step 1.2∎

Thus x2+1 is the standard smallest-degree polynomial that is irreducible over R but becomes reducible over C.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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