Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Idempotents lift through adically complete quotients

Statement

Let R be a commutative C-algebra, let I⊆R be an ideal, and suppose that R is I-adically complete and separated, so that R≅lim←⁡n≥1R/In (Separated and complete filtered modules, The I-adic completion of a module); over a complete local ring R one may take I its maximal ideal. Let A be an associative unital R-algebra which is finitely generated as an R-module and complete for the I-adic topology of the filtration InA, n≥0, so that A→lim←⁡n≥1A/InA is an isomorphism (The I-adic topology on a module). If x∈A satisfies x2−x∈IA, then there exists e∈A with e2=e,e≡x(modIA). Consequently: (1) every idempotent of A/IA is the image of an idempotent of A; (2) for every finite family of pairwise orthogonal idempotents xˉ1,…,xˉk of A/IA there are pairwise orthogonal idempotents e1,…,ek∈A with ei≡xˉi(modIA) for all i, and if xˉ1+⋯+xˉk=1 they may be chosen with e1+⋯+ek=1. Neither assertion uses a choice principle.

Facts & Assumptions

Given: A commutative C-algebra R, an ideal I⊆R with R I-adically complete and separated, an associative unital R-algebra A finitely generated over R and complete for the filtration InA, and an element x∈A with x2−x∈IA.

[F1]

The I-adic topology on a module has the neighbourhood basis InM of 0, so its basic open sets are the cosets x+InM (The I-adic topology on a module).

[F2]

Completeness of A for the filtration InA says that A→lim←⁡n≥1A/InA is an isomorphism, and it includes separatedness, that is, ⋂n≥0InA=0 (Separated and complete filtered modules, The I-adic completion of a module).

[L1]

For every n the submodule InA is a two-sided ideal of A, and multiplication A×A→A is continuous for the I-adic topology: if a′≡a and b′≡b modulo InA, then a′b′−ab=(a′−a)b′+a(b′−b)∈InA+InA=InA.

Proof

technique · direct
1.1F1F2L1

Multiplication of A is continuous by [L1], and limits in A are unique because A is separated by [F2]. A sequence is Cauchy precisely when for every n its terms eventually have a fixed residue modulo InA; completeness then gives its unique limit with those eventual residues. In particular a sequence with sm∈ImA tends to zero, and a series with its m-th term in ImA has Cauchy partial sums, whose limit agrees with each partial sum modulo the ideal containing its tail.

2.1step 1.1algebra

Let cm:=(−1/2m)∈C for m≥0. If ε∈IA then εm∈ImA for every m, so the partial sums SN:=∑m=0Ncmεm satisfy SN′−SN∈IN+1A whenever N′≥N: the series converges, and its limit f(ε):=∑m≥0cmεm satisfies f(ε)≡SN(modIN+1A) for every N by step 1.1. To justify the formal identity, put f(u)=∑m≥0cmum. The binomial coefficients satisfy 2(m+1)cm+1=−(2m+1)cm, so 2(1+u)f′(u)+f(u)=0. Consequently the formal derivative of (1+u)f(u)2 is zero, and its constant term is 1; over C this gives (1+u)f(u)2=1. Thus the identity (1+u)(∑m=0Ncmum)2=1+∑m>Ndmum of truncated formal power series over C shows (1+ε)SN2≡1(modIN+1A); passing to limits using the continuity of multiplication and the uniqueness of limits gives (1+ε)f(ε)2=1.

2.2F2step 1.1construct

Let e∈A be an idempotent and put B:=(1−e)A(1−e), with unit 1−e. Then B is an associative R-algebra with unit 1−e and scalar map r↦r(1−e), finitely generated as an R-module, and InB=B∩InA for every n: the inclusion InB⊆B∩InA is clear, and for b∈B∩InA the computation π(b)=b, where π(a):=(1−e)a(1−e) is the R-linear idempotent projection onto B, exhibits b∈π(InA)⊆InB. The projection π satisfies π(InA)⊆InB⊆InA, hence is continuous, so it induces an idempotent endomorphism Π of the completion A≅lim←⁡nA/InA of [F2]; its image is exactly lim←⁡nB/InB with the maps induced by π. Since B→lim←⁡nB/InB agrees with Π on B and Π is the identity on B, the map B→lim←⁡nB/InB is an isomorphism: it is injective by the separatedness of A, and surjective onto the image of Π. Thus B is I-adically complete.

3.1step 2.1algebraconstruct

Put y:=2x−1 and ε:=y2−1=4(x2−x)∈IA. Since ε is a polynomial in y, the element z:=y f(ε) of step 2.1 satisfies z2=y2f(ε)2=(1+ε)f(ε)2=1. Hence e:=12(1+z) satisfies e2=14(1+2z+z2)=e, and e−x=12(z−y)=12y (f(ε)−1)∈A⋅IA⊆IA, because f(ε)−1=∑m≥1cmεm∈IA. Any idempotent xˉ∈A/IA has a representative x∈A with x2−x∈IA, so the preceding construction produces an idempotent e of A with image xˉ: assertion (1) holds.

4.1step 3.1step 2.2algebra∎

Assertion (2) follows by finite iteration. Given orthogonal idempotents xˉ1,…,xˉk in A/IA, choose representatives x1,…,xk; they satisfy xi2−xi∈IA and xixj∈IA for i≠j. Suppose e1,…,ej∈A are pairwise orthogonal idempotents with ei≡xi(modIA) for i≤j, put Ej:=e1+⋯+ej and Bj:=(1−Ej)A(1−Ej), and set Xj:=(1−Ej)xj+1(1−Ej)∈Bj. Expanding, Xj2−Xj=(1−Ej)(xj+12−xj+1−xj+1Ejxj+1)(1−Ej), and both xj+12−xj+1 and xj+1Ejxj+1≡∑i≤jxj+1xixj+1≡0 lie in IA, so Xj2−Xj∈(1−Ej) IA (1−Ej)⊆IBj. As Bj is complete by step 2.2, step 3.1 applied in Bj supplies an idempotent ej+1∈Bj with ej+1≡Xj(modIBj); then ej+1 is orthogonal to e1,…,ej, and ej+1≡Xj≡xj+1(modIA) because (1−Ej) is congruent to 1−∑i≤jxi modulo IA. Starting from j=0, where B0=A and X0=x1, this yields orthogonal idempotents with the required congruences. If xˉ1+⋯+xˉk=1, the last lift may be replaced by ek:=1−e1−⋯−ek−1: it is idempotent, orthogonal to e1,…,ek−1, and congruent to 1−∑i<kxˉi=xˉk modulo IA.

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