Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Lifted coprime factorisations are unique

Statement

Let (A,I) be a Henselian pair. Let f∈A[T] be monic, and let f‾=g0h0 in (A/I)[T] with g0,h0 monic and coprime. Then there is at most one factorization f=gh with g,h monic and g‾=g0, h‾=h0.

Facts & Assumptions

Given: A Henselian pair (A,I), a monic polynomial f∈A[T], and a coprime monic residue factorization f‾=g0h0.

[L1]

In a Henselian pair, such lifted factorisations are part of the defining lifting property (Henselian pairs and Henselian local rings).

[L2]

Any two lifts of the same coprime residue factorization agree modulo every power of the ideal (Two lifted factorisations agree modulo every ideal power).

Proof

technique · combine the definition with the congruence induction
1.1L2given

Suppose f=gh=g′h′ are two monic lifts of the given residue factorization. By [L2], they agree modulo Ir[T] for every r≥1.

2.1L1step 1.1

In the present page's convention, [L1] already includes uniqueness of the lifted factorization. Therefore the two lifts must coincide. Step 1.1 records the explicit congruence mechanism that later examples use.

3.1step 2.1∎

Hence a coprime monic residue factorization has at most one Hensel lift.

Depends on

Used by

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