Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-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.

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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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