Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Lift a Bezout identity for coprime residue factors

Statement

Let A be a commutative ring, let IA be an ideal, and let g0,h0(A/I)[T] generate the unit ideal. If g,hA[T] lift g0,h0, then there exist polynomials a,bA[T] such that ag+bh1(modI).

Facts & Assumptions

Given: A commutative ring A, an ideal I, residue polynomials g0,h0(A/I)[T] with (g0,h0)=(1), and lifts g,hA[T].

[L1]

The quotient ring A/I and the polynomial ring over a commutative ring are again commutative rings, so Bezout identities and coefficientwise lifting make sense in (A/I)[T] and A[T] (The quotient ring R/I with (r+I)(s+I)=rs+I, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).

Proof

technique · lift one residue Bezout identity coefficientwise
1.1

Because (g0,h0)=(1) in (A/I)[T], there exist a0,b0(A/I)[T] such that a0g0+b0h0=1.

L1givenchoose
2.1

Lift the coefficients of a0 and b0 to polynomials a,bA[T]. Reducing coefficientwise modulo I gives ag+bh=ag+bh=a0g0+b0h0=1. Hence ag+bh1(modI).

step 1.1L1choose
3.1

Thus a coprime residue factorization always admits a lifted Bezout relation modulo I.

step 2.1

Depends on

Used by

Dependency tree · two levels

8 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