Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge 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.

Rank bookkeeping for a long exact sequence of finite-dimensional vector spaces

Statement

Let F be a field (Field) and let ⋯→Ak→αkBk→βkCk→γkAk−1→⋯ be a long exact sequence of F-vector spaces (Exact sequence and short exact sequence in an abelian category), indexed by the integers. Assume that Ak and Ck are finite-dimensional over F for every k (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis) and vanish for k<0 and for all k>N, where N is a fixed integer. Then the spaces Bk are also finite-dimensional and vanish for k<0 and k>N, and there is a unique polynomial Q(t)=∑k=0Nqktk∈Z[t] with qk≥0 for every k such that PA(t)+PC(t)=PB(t)+(1+t)Q(t), where PA(t)=∑k(dim⁡FAk)tk and similarly for B,C. Explicitly qk=dim⁡Fker⁡αk, so that for every k ∑i=0k(−1)k−i(dim⁡FAi+dim⁡FCi−dim⁡FBi)=qk≥0, and in particular dim⁡FBk≤dim⁡FAk+dim⁡FCk for every k.

Facts & Assumptions

Given: A field F, an integer N, a long exact sequence as displayed with Ak,Ck finite-dimensional for all k and zero for k<0 and k>N, and the notation ak:=dim⁡Fker⁡αk≥0.

[F1]

A sequence of morphisms is exact when at every interior node the image of the incoming map equals the kernel of the outgoing map (Exact sequence and short exact sequence in an abelian category).

[L1]

For a linear map T:V→W with V finite-dimensional, dim⁡FV=nullity⁡T+rank⁡T=dim⁡Fker⁡T+dim⁡Fim⁡T (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T, Rank and nullity of a linear map with finite-dimensional domain, Kernel and image of a linear map).

[L2]

If U is a linear subspace of a finite-dimensional space V, then U is finite-dimensional with dim⁡FU≤dim⁡FV (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[L3]

If U,W are finite-dimensional linear subspaces of a vector space, then dim⁡F(U+W)+dim⁡F(U∩W)=dim⁡FU+dim⁡FW (The dimension formula: for finite-dimensional linear subspaces U and W of V, the subspaces U+W and U∩W are finite-dimensional and dim⁡F(U+W)+dim⁡F(U∩W)=dim⁡FU+dim⁡FW).

[F2]

Z[x] is the set of finitely supported functions N→Z, with pointwise addition and convolution product; two polynomials are equal exactly when all coefficients agree, and x is the sequence with coefficient 1 at index 1 (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution).

[F3]

(Z,+,⋅,0,1) is a commutative ring with multiplicative identity (The integers form a commutative ring).

Proof

technique · rank bookkeeping
1.1F1L1L2given

If N<0, the vanishing hypotheses force every Ak,Ck to be zero, and exactness forces every Bk to be zero; all formulas then hold with Q=0. Henceforth assume N≥0. Exactness gives im⁡αk=ker⁡βk, im⁡βk=ker⁡γk, and im⁡γk=ker⁡αk−1. Put rk:=dim⁡Fim⁡αk and sk:=dim⁡Fker⁡γk; these are finite by [L1] and [L2], since Ak,Ck are finite-dimensional. The maps retain the names αk,βk,γk.

2.1L1step 1.1

Rank-nullity for αk:Ak→Bk and γk:Ck→Ak−1 gives dim⁡FAk=ak+rk and dim⁡FCk=sk+ak−1.

3.1L1L2L3step 1.1step 2.1choose

Choose a finite basis y1,…,ym of im⁡βk=ker⁡γk and lifts xi∈Bk with βk(xi)=yi. Then Bk=ker⁡βk+span⁡(x1,…,xm): subtract the corresponding linear combination of the lifts from any element. The kernel has dimension rk by exactness and step 2.1, so this sum is finite-dimensional by [L3]. Rank-nullity now applies to βk and gives dim⁡FBk=rk+sk. Only finitely many lifts are chosen.

4.1F1step 2.1step 3.1algebra

The three dimension identities give dim⁡FAk+dim⁡FCk−dim⁡FBk=ak+ak−1≥0. In particular the weak inequality holds. Outside 0≤k≤N, exactness and Ak=Ck=0 force Bk=0. Also aN=0, since exactness identifies ker⁡αN with the image of the zero space CN+1.

5.1F2F3step 4.1algebra

Set Q(t)=∑k=0Naktk. With ak=0 outside this range, the coefficient of (1+t)Q in degree k is ak+ak−1; at degree N+1 it vanishes because aN=0. Thus step 4.1 and coefficient comparison give PA+PC=PB+(1+t)Q. Its coefficients are nonnegative integers.

6.1step 4.1step 5.1algebra

Telescoping gives ∑i=0k(−1)k−i(ai+ai−1)=ak, since a−1=0. This proves the partial-sum formula and identifies qk=ak. For negative k read the sum as empty and set qk=0.

7.1F2F3algebra∎

Finally, uniqueness of Q: if (1+t)Q=0 with Q=∑kqktk∈Z[t], then by [F2] the coefficients satisfy q0=0 and qk=−qk−1 for every k≥1, so all qk=0 and Q=0; hence two polynomials with (1+t)Q=(1+t)Q′ agree.

Remarks

  • The vanishing convention. The hypothesis that the sequence vanishes in degrees k<0 is the one used by the Morse applications, where the graded pieces are homology groups in nonnegative degrees; it is exactly what makes the alternating partial sums land on the coefficient qk of Q without a leftover boundary term from below. The finite-range hypothesis gives the finite sums and the degree bound N.
  • Field versus ring coefficients. The proof uses rank-nullity, which needs a field; over a general ring the numerical inequality can fail. This is the algebraic source of the coefficient-field dependence recorded on the examples page.

Depends on

Used by

Dependency tree · two levels

60 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