Alphabeta Math
Pipeline-generated
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.

✓ 5 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Homological Gaussian Elimination — Examples

1 · Prerequisites

2 · Summary

These examples compute the algebra of the page and mark the boundaries of its hypotheses. The first two take the rank-one matrix (1111) and cancel its lower-right identity: the Schur complement must be a−bφ−1c, since the minus sign gives the reduced differential 0 with one-dimensional kernel and cokernel matching those of the original differential, while a plus sign would produce multiplication by 2 and erase both homology objects. The second of them records the basis changes L,R explicitly and shows that the transformed neighbouring arrows (1;0) and (1,0) leave the reduced segment k→1k→0k→1k.

The third example works in the Clark–Morrison–Walker Lemma A.2 shape A→B⊕C→D1⊕D2⊕E→F⊕G→H with adjacent invertible entries ψ and φ: cancelling them in either order leaves the same complex A→C→D2→F→H with middle arrows γ−xψ−1β and μ−λφ−1ν, and the composite retract data of the finite-iteration formula in each order. The two counterexamples then delimit the hypotheses: the two-term complex 0→Z→2Z→0 has a noninvertible differential entry, so it cannot be cancelled — its homology Z/2 in the upper degree would be erased and the complex is not contractible — and transfer along a chosen retract is only functorial up to homotopy, since off-diagonal maps between the two identical contractible summands in the displayed example transfer to zero individually but their composite transfers to the identity.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passaudited 2026-09-27Open item page →

A unit pivot forces the minus Schur sign

Example

Work over Q and let X0=Q2,X1=Q2,d0=(1111),d1=0,Xj=0 (j∉{0,1}). This is a two-term cochain complex, since d1d0=0. Decompose X0=A⊕U and X1=B⊕V with A,B the first coordinates and U,V the second coordinates, so that the four blocks of d0 are a=b=c=φ=1 and the lower-right entry of d0 is the identity, an invertible pivot.

The example compares the two candidate signs in the Schur complement a∓bφ−1c: the correct minus sign gives the reduced differential 1−1⋅1−1⋅1=0 on Q→Q, whose kernel and cokernel are both one-dimensional and agree with those of d0, while the plus sign gives multiplication by 2, whose kernel and cokernel both vanish.

Facts & Assumptions

Given: The two-term complex X∙ displayed above with the coordinate decomposition at degree 0, and the candidate reduction Xˉ∙ at the pivot φ=1.

[L1]

With L=(1−bφ−101) and R=(10−φ−1c1) one has Ld0R=diag⁡(a−bφ−1c,φ), R−1(p;q)=(p;0), (r s)L−1=(r 0) and dˉp=0=rdˉ; the candidate reduction is a cochain complex (Triangular basis changes diagonalize an invertible differential block).

[L2]

The candidate reduction keeps Xj for j∉{0,1}, replaces X0 by A and X1 by B, and its differentials at degrees −1,0,1 are p, a−bφ−1c and r where d−1=(p;q) and d1=(r s) (An invertible cochain differential block and its candidate reduction).

[L3]

Over an abelian category the reduction is homotopy equivalent to X∙ by a strong deformation retract, and the induced maps on homology objects of the reindexed chain complexes are inverse isomorphisms; in particular isomorphic homology objects in every degree (Gaussian cancellation preserves homotopy type and abelian-category homology).

[L4]

The homology object Hn of a chain complex is the cokernel of the boundary-to-cycle map Bn(C)→Zn(C); for a two-term complex the homology at the source is the kernel of its outgoing differential, and at the target it is the cokernel of its incoming differential (Homology object of a chain complex).

Verification

1.1

The lower-left 2×2 block of d0 is (1111) in the rows B,V and columns A,U, so a=b=c=φ=1 and the pivot is the lower-right identity, invertible with φ−1=1.

L2algebra
1.2

The Schur complement is a−bφ−1c=1−1⋅1−1⋅1=0, so by [L1] the reduction has differential dˉ0=0:Q→Q; its neighbouring arrows are dˉ−1=p=0 and dˉ1=r=0, because d−1=0 and d1=0 have no components into or out of the discarded summands. Hence Xˉ∙ is Q→0Q in degrees 0,1.

L1L2algebra
1.3

Under the reindexing Cn=X−n the two-term complex becomes the chain complex Q→d0Q concentrated in degrees 0,−1, so by [L4] its homology is H0=ker⁡d0 and H−1=coker⁡d0, corresponding to cochain degrees 0 and 1. For the reduction these are ker⁡(0)=Q and coker⁡(0)=Q; for X∙ they are ker⁡d0=Q(1,−1)≅Q, since (1111)(xy)=(x+yx+y), and coker⁡d0=Q2/Q(1,1)≅Q. The two complexes therefore have isomorphic one-dimensional homology, as [L3] requires.

L1L3L4algebra
2.1

With the plus sign, the candidate differential would be a+bφ−1c=1+1=2, the map Q→2Q with ker⁡(2)=0 and coker⁡(2)=Q/2Q=0; its homology would vanish in both degrees, whereas X∙ has one-dimensional homology in both degrees and is homotopy equivalent to its reduction by [L3]. The plus sign is therefore impossible, and the example exhibits the minus sign in the Schur complement. ∎

L3step 1.2step 1.3algebra
ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Neighboring differentials transform with the pivot basis changes

Example

Let k be any field and consider the cochain segment X0=k→d0=(1−1)X1=k2→d1=(1111)X2=k2→d2=(1 −1)X3=k,Xj=0 (j∉{0,1,2,3}). Both neighbouring composites vanish, d1d0=(0,0) and d2d1=(0,0), so this is a cochain complex. Cancel the lower-right identity in degree 1, i.e. use the coordinate decomposition X1=A⊕U, X2=B⊕V with A,B the first coordinates and U,V the second coordinates; then a=b=c=φ=1 and φ is invertible.

The example computes the basis changes of Triangular basis changes diagonalize an invertible differential block explicitly and shows that the transformed neighbouring arrows are (1;0) and (1,0), with diagonalized pivot diag⁡(0,1), so the reduced segment is k→1k→0k→1k.

Facts & Assumptions

Given: The cochain segment X∙ displayed above with the coordinate decomposition in degrees 1,2, the pivot φ=1, the neighbouring components d0=(p;q) and d2=(r s), and the morphisms L,R,L−1,R−1 of the lemma.

[L1]

For the decomposition at degree n=1 one has L=(1−bφ−101), L−1=(1bφ−101), R=(10−φ−1c1), R−1=(10φ−1c1), and Ld1R=diag⁡(a−bφ−1c,φ), R−1(p;q)=(p;0), (r s)L−1=(r 0) (Triangular basis changes diagonalize an invertible differential block).

[L2]

The reduced complex keeps X0 and X3, replaces X1 by A and X2 by B, and has differentials dˉ0=p, dˉ1=a−bφ−1c, dˉ2=r (An invertible cochain differential block and its candidate reduction).

Verification

1.1

The vanishing composites: d1d0=(1111)(1−1)=(00) and d2d1=(1 −1)(1111)=(0 0), so X∙ is a cochain complex; the blocks of d1 are a=b=c=φ=1 because its lower-right entry is the identity, and the neighbour components are d0=(p;q)=(1;−1) and d2=(r s)=(1 −1).

L2algebra
1.2

The basis changes are L=(1−101) with inverse L−1=(1101), and R=(10−11) with inverse R−1=(1011), all with entries in k and determinant 1.

L1algebra
2.1

The transformed incoming arrow is R−1(p;q)=(1011)(1−1)=(10); the transformed outgoing arrow is (r s)L−1=(1 −1)(1101)=(1 0).

L1step 1.1step 1.2algebra
2.2

The diagonalized middle differential is Ld1R: first d1R=(1111)(10−11)=(0101), then L(0101)=(1−101)(0101)=(0001)=diag⁡(a−bφ−1c,φ) with a−bφ−1c=1−1=0.

L1step 1.2algebra
3.1

By [L2] the reduced complex has X0=k, X1=A=k, X2=B=k, X3=k with differentials dˉ0=p=1, dˉ1=a−bφ−1c=0 and dˉ2=r=1, that is the reduced segment k→1k→0k→1k; its composites are 0⋅1=0 and 1⋅0=0, so it is a cochain complex, as the lemma guarantees. In the transformed coordinates the discarded components are exactly φ−1cp+q=1−1=0 of the incoming arrow and rbφ−1+s=1−1=0 of the outgoing arrow, which is why the second entries of the transformed arrows vanish; the entries along the retained summands, namely p=1 and r=1, pass to the reduction unchanged. ∎

L1L2step 2.1step 2.2algebra
ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Two adjacent noncomposable Gaussian pivots in either finite order

Example

Let X∙ be a cochain complex with objects X0=A,X1=B⊕C,X2=D1⊕D2⊕E,X3=F⊕G,X4=H,Xj=0 (j∉{0,1,2,3,4}), differentials d0=(p;q), d1=(ψβxγyδ) (rows D1,D2,E, columns B,C), d2=(zμλwνφ) (rows F,G, columns D1,D2,E) and d3=(r s), with ψ:B→D1 and φ:E→G isomorphisms and with d1d0=0, d2d1=0 and d3d2=0; this is the Lemma A.2 shape of Clark–Morrison–Walker. The two pivots ψ and φ are adjacent but not composable, so the cancellation order is a genuine choice, and the example computes the reduction in each order.

Facts & Assumptions

Given: The cochain complex X∙ displayed above, with the invertible entries ψ:B→D1 of d1 and φ:E→G of d2, and the two cancellation orders: cancel ψ first and then φ in the reduced complex, or cancel φ first and then ψ.

[L1]

At a pivot φ of a block (abcφ) in a decomposition Xn=A′⊕U, Xn+1=B′⊕V, the candidate reduction keeps Xj for j∉{n,n+1} and the components of the neighbouring differentials along the retained summands A′ and B′, and replaces the differential by the Schur complement a−bφ−1c (An invertible cochain differential block and its candidate reduction, Triangular basis changes diagonalize an invertible differential block).

[L2]

Each single cancellation in its current complex gives cochain maps p,ı and a degree-(−1) homotopy h with pı=1, 1−ıp=dh+hd, ph=0, hı=0, h2=0 (Explicit strong deformation retract from Gaussian cancellation).

[L3]

A finite sequence of cancellations with invertible current pivots composes: the composite data is p=p2p1, ı=ı1ı2, h=h1+ı1h2p1 and satisfies the same five identities, and reductions obtained from different valid choices are homotopy equivalent (Finite iteration of current invertible-block cancellations).

Verification

1.1

Complex check. The composite d2d1 has (i,j)-entry the sum over D1,D2,E of the products of entries of d2 and d1, and each of the three displayed matrix identities d1d0=0, d2d1=0, d3d2=0 is exactly the hypothesis that consecutive differentials of X∙ vanish; the remaining composites are zero because X−1=X5=0.

L1algebra
1.2

Cancelling ψ first. Write X1=C⊕B and X2=(D2⊕E)⊕D1, so that the pivot block of d1 is ψ:B→D1, with a=(γ;δ):C→D2⊕E, b=(x;y):B→D2⊕E and c=β:C→D1. The Schur complement of the pivot is a−bψ−1c=(γ−xψ−1β; δ−yψ−1β):C→D2⊕E; the incoming arrow of the reduction is the C-component q of d0, and the outgoing arrow is the restriction of d2 to the rows D2,E, namely (μλνφ), in which the pivot φ:E→G still appears unchanged.

L1L2algebra
1.3

Cancelling φ first. In the decomposition X2=(D1⊕D2)⊕(E) and X3=(F)⊕(G), the pivot φ:E→G has complement blocks z,μ (row F) and w,ν, so the Schur complement is the arrow D1⊕D2→F with entries z−λφ−1w and μ−λφ−1ν; the incoming arrow is the restriction of d1 to the rows D1,D2, namely (ψβxγ), and the outgoing arrow is r:F→H. Cancelling ψ second gives the middle differential γ−xψ−1β on C→D2, the incoming arrow q and the outgoing arrow r.

L1L2algebra
2.1

Cancelling φ second. In the complex of step 1.2 the pivot φ:E→G sits in the block of (μλνφ) with retained summands D2 of the degree-2 object and F of the degree-3 object, so the new middle differential is the Schur complement μ−λφ−1ν:D2→F, while the incoming arrow loses its E-component and becomes γ−xψ−1β:C→D2; the outgoing arrow is r:F→H.

L1step 1.2algebra
3.1

Order comparison. By steps 1.2 and 2.1, cancelling ψ then φ leaves the cochain complex A→qC→γ−xψ−1βD2→μ−λφ−1νF→rH; by step 1.3, cancelling φ then ψ leaves the same objects and the same four arrows. In each order the composite of the single-cancellation data is by [L3] the strong deformation retract data p=p2p1, ı=ı1ı2, h=h1+ı1h2p1 of X∙ onto that reduction, satisfying pı=1, 1−ıp=dh+hd, ph=0, hı=0 and h2=0; [L3] also gives that the two reductions are homotopy equivalent.

L3step 2.1step 1.3algebra
4.1

A concrete instance over Q. Take every entry of d1 equal to 1, so ψ=β=x=γ=y=δ=1; take d2=(11−21−21), d0=(1;−1) and d3=(0 0). Then d1d0=(1−1;1−1;1−1)=0, d2d1=(1+1−21+1−21−2+11−2+1)=0 and d3d2=(0 0), so X∙ is a complex. The two reduced middle arrows are γ−xψ−1β=1−1=0 and μ−λφ−1ν=1−(−2)(1)−1(−2)=1−4=−3, and the end arrows are q=−1 and r=0; both orders give the reduced complex Q→−1Q→0Q→−3Q→0Q, whose composites 0⋅(−1)=0 and (−3)⋅0=0 vanish. ∎

L1L3step 3.1algebra
CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passaudited 2026-09-27Open item page →

The isolated differential 2 on the integers cannot be cancelled

Statement refuted

In the two-term complex 0→Z→2Z→0, the nonzero differential entry 2 can serve as a Gaussian pivot: the two terms can be cancelled and replaced by the zero complex, which is homotopy equivalent to the original complex.

Facts & Assumptions

Given: The two-term cochain complex X∙ in the category of abelian groups with Xn=Z, Xn+1=Z, differential dn=⋅2, and Xj=0 for j∉{n,n+1}; and the claim that the two terms of X∙ can be cancelled, so that X∙ is homotopy equivalent to the zero complex.

[L1]

A pivot is required to be an isomorphism, with a two-sided inverse φ−1; the Schur complement a−bφ−1c is defined through that inverse (An invertible cochain differential block and its candidate reduction).

[L2]

The splitting theorem produces a homotopy equivalence between a complex and its reduction only when the pivot block of the decomposition is invertible; its contractible summand has differential the pivot itself (Gaussian elimination splits a contractible two-term complex).

[L3]

A complex is contractible when there is a family h with 1Cn=dn−1hn+hn+1dn for all n; a complex is homotopy equivalent to the zero complex exactly when it is contractible (Complexes, homotopies and contractibility in an additive category).

[L4]

The homology object of a chain complex is the cokernel of the boundary-to-cycle map Bm→Zm supplied by the factorization of the boundary inclusion through the cycle inclusion (Cycle and boundary subobjects of a complex, The boundary subobject factors through the cycle subobject, Homology object of a chain complex).

Counterexample

1.1

The entry 2 has no inverse in the category of abelian groups. If u:Z→Z satisfied 2u=1 or u⋅2=1, then evaluating at 1 gives 2u(1)=1 with u(1)∈Z, which is impossible because 1 is odd; equivalently Z has no element m with 2m=1. Since 2 is not invertible, it is not a pivot in the sense of [L1], and the Schur complement a−bφ−1c of the block (φ)=(2) is not defined on its own.

L1algebra
1.2

The complex nonetheless has nonzero homology. Reindexing by Cm:=X−m gives the chain complex Z→2Z concentrated in degrees −n and −n−1. There Z−n−1=ker⁡(d−n−1=0)=Z and B−n−1=im⁡(d−n)=im⁡(2)=2Z, so the boundary-to-cycle map is the inclusion 2Z↪Z and, by [L4], H−n−1≅Z/2Z≠0; this is the homology in cochain degree n+1 of X∙.

L4algebra
2.1

The complex is not contractible. If it were, [L3] would give a homomorphism hn+1:Z→Z with 1Xn=dn−1hn+hn+1dn=0+hn+1⋅2 in degree n, because dn−1=0 and dn=⋅2; evaluating at 1 would produce an integer hn+1(1) with 2hn+1(1)=1, which is impossible by step 1.1. Hence X∙ is not homotopy equivalent to the zero complex, and deleting both terms would not be a homotopy equivalence.

L3step 1.1algebra
3.1

Consequently the pivot hypothesis of [L1] and [L2] is genuinely needed: the deleted terms carry the nonzero homology object H−n−1≅Z/2Z of step 1.2, which the zero complex does not have, and no two-sided inverse of 2 exists in Z. The claim refuted is therefore false; the theorem's conclusion is not available here because its hypothesis fails. ∎

L2step 1.2step 2.1algebra
CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Gaussian transfer is not strictly functorial on arbitrary cochain maps

Statement refuted

Transfer of cochain maps along a Gaussian reduction is strictly functorial: for every pair of composable cochain maps f,g and every chosen retract data, (gf)‾=gˉfˉ.

Facts & Assumptions

Given: A field k, the two-term cochain complex Y∙ with Y0=Y1=k, d0=1, d1=0 and Yj=0 otherwise, a second copy K∙ of it, the biproduct X∙=Y∙⊕K∙, and the projection p, inclusion ı and homotopy h displayed below.

[L1]

For chosen retract data the transfer of a cochain map f is fˉ=pYfıX, the identity transfers strictly, and (gf)‾−gˉfˉ=dk+kd with k=pZghYfıX; hence transfer is functorial on homotopy classes but is not asserted to be strictly functorial (Transferred maps are functorial up to homotopy, with strict naturality limits).

[L2]

Cochain maps are the morphisms commuting with the differentials; a biproduct of complexes has the differentials acting componentwise and its projection and inclusion as cochain maps; a homotopy s satisfies f−g=ds+sd, and a complex is contractible when 1=dh+hd for a suitable h (Complexes, homotopies and contractibility in an additive category).

Counterexample

1.1

Retract data for X∙ onto Y∙. Write elements of Xj=k⊕k as pairs with the first coordinate in Yj and the second in Kj, and let ı=(10), p=(1 0) in both degrees, with h1=(0001), h0=0 and h2=0. Then pı=1k and 1−ıp=(0001). Here d0=1k2 and d1=0: in degree 1, d0h1+h2d1=1k2h1+0=(0001), and in degree 0, d−1h0+h1d0=0+h11k2=(0001). Thus 1−ıp=dh+hd, and the displayed data is a strong deformation retract of X∙ onto Y∙.

L2algebra
1.2

Two cochain maps. In both nonzero degrees set f=(0010) and g=(0100). At the only nonzero differential d0=1k2, f1=f0 and g1=g0, so f1d0=d0f0 and g1d0=d0g0; at d1=0 the cochain-map equations hold trivially. Thus f and g are cochain maps. Here f sends the Y-coordinate isomorphically onto the K-coordinate and kills the K-coordinate, while g sends the K-coordinate isomorphically onto the Y-coordinate and kills the Y-coordinate.

L2algebra
2.1

The individual transfers vanish. Since ı=(10), one has fı=(01) and gı=0; applying p=(1 0) gives fˉ=pfı=0 and gˉ=pgı=0 as cochain maps Y∙→Y∙.

L1step 1.2algebra
3.1

The transfer of the composite does not vanish. Since gf=(0100)(0010)=(1000)=ıp, one has (gf)‾=p(gf)ı=pıpı=pı=1Y∙, the identity cochain map of Y∙, which is nonzero. Hence (gf)‾−gˉfˉ=1Y∙≠0, so transfer is not strictly functorial on cochain maps, and the statement refuted is false.

L1step 1.2step 2.1algebra
4.1

The failure is consistent with the proposition. The complex Y∙ is contractible, with contracting homotopy hˉ1=1k and hˉ0=hˉ2=0, because in degree 0 one has d−1hˉ0+hˉ1d0=1k and in degree 1 one has d0hˉ1+hˉ2d1=1k. Consequently every endomorphism u of Y∙, in particular the discrepancy (gf)‾−gˉfˉ of step 3.1, is null-homotopic: from 1Y∙−0=dhˉ+hˉd and ud=du one obtains u=u(dhˉ+hˉd)=d(uhˉ)+(uhˉ)d, so u≃0 with homotopy uhˉ. This is exactly the up-to-homotopy functoriality asserted by [L1], so the counterexample refutes strictness only, not the homotopy-class statement. ∎

L1L2step 3.1algebra

Sources