Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Degree reasons force stabilization in a bounded region

Statement

A bounded spectral sequence stabilizes at each bidegree. In particular first- and third-quadrant spectral sequences stabilize pointwise. If the initial support is globally finite, there is a uniform collapse page.

Here regular means eventual vanishing of the outgoing differential at each position, and coregular means eventual vanishing of the incoming differential. These conditions are respectively equivalent to eventual stationarity of the nested cycle and boundary subobjects in the initial page. In the homological convention, bounded below means each diagonal has support bounded below in its first coordinate; bounded above means support bounded above. Boundedness is equivalent to having both bounds. Bounded below implies regular; bounded above implies coregular. The cohomological versions follow by reversing both coordinates, so their named support directions are reversed.

Facts & Assumptions

Given: A homological spectral sequence, with the support bounds specified in each clause; its cohomological translation reverses both coordinates.

[F1]

Stabilization means eventual vanishing of both incident differentials; later terms are successive subquotients of the initial page (Spectral sequence stabilization at a bidegree).

Proof

technique · direct
1.1F1

A zero term remains zero after every transition, because a kernel subobject and an image quotient of the zero object are zero. Fix (p,q), n=p+q. Let Sn−1 and Sn+1 be the finite sets of first coordinates of nonzero initial terms on the two adjacent diagonals. The outgoing target has first coordinate p-r on diagonal n-1; the incoming source has first coordinate p+r on diagonal n+1.

1.2F1

In the recursive representation of [F1], Zr+1 is the inverse image of ker⁡dr under the epic quotient from Zr, and Br+1 is the inverse image of the incoming image. If the outgoing differential is zero, its kernel is the whole page and Zr+1=Zr. Conversely that equality and epic cancellation force the outgoing differential to be zero. If the incoming differential is zero, its image is zero and Br+1=Br. Conversely this equality forces its image to be zero, and therefore the differential to be zero. Applying each equivalence for every r≥R proves both eventual-stationarity equivalences, in both directions.

2.1F1step 1.1

Choose an integer R≥r₀ greater than each integer in the finite set {p−a:a∈Sn−1}∪{a−p:a∈Sn+1}. If this set is empty take R=r₀. For r≥R neither endpoint can be initially nonzero, and step 1.1 makes it zero on page r. Thus both maps vanish, proving stabilization by [F1].

2.2F1step 1.1

On a fixed diagonal, finite support has an upper and lower integer bound (the empty support admits any bounds). Conversely the integers between two fixed bounds are a finite list, so support with both bounds is finite. For fixed (p,q) a lower bound a on diagonal n−1 makes the outgoing endpoint p−r vanish for r>p−a. An upper bound b on diagonal n+1 makes the incoming endpoint p+r vanish for r>b−p. Zero terms persist by step 1.1, proving regularity and coregularity respectively. The substitution (p,q)↦(−p,−q) changes the outgoing degree to (r,1−r) and reverses the support inequalities, proving the cohomological versions.

3.1step 1.1step 2.1∎

In the first quadrant, a diagonal has 0≤p≤n and is empty if n<0; in the third quadrant it has n≤p≤0 and is empty if n>0. Both are finite, so step 2.1 applies. With globally finite support, apply step 2.1 to its finitely many positions and take the maximum of those bounds and r₀. Outside that support every term is zero. Thus every differential vanishes from that uniform page onward. Empty global support uses r₀.

Source notes

Weibel, Chapter 5, §5.2 pp.122–125 and Definitions 5.4.2–4 pp.132–133; Sharifi, §4.1 pp.87–89 and Definition 4.2.1 p.90.

Regular/coregular conventions and equivalences: Stacks §12.24, Definition 12.24.7 and Lemma 12.24.8, translated to increasing homological coordinates; all implications are proved above.

Depends on

Dependency tree · 2 levels

Sources