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.

Collapse with projective associated graded pieces splits the finite filtration noncanonically

Statement

If an R-module H has a finite increasing filtration whose associated-graded pieces are projective, then H is noncanonically isomorphic, as a filtered module, to the finite direct sum of those pieces with its partial-sum filtration. In particular a collapsed convergent spectral sequence whose target filtration is finite and whose graded target pieces are projective has a splitting of its target filtration. This establishes existence of a splitting, not a canonical choice.

Facts & Assumptions

[F1]

Projective modules and the lifting property lifts maps from a projective module across a surjective module homomorphism.

[F2]

Exhaustive separated bounded and finite filtration supplies finite zero/full endpoints.

[F3]

Weak convergence of a spectral sequence identifies limiting terms with the graded target pieces; it does not identify the unfiltered target with them.

[F4]

Abelian-group model for spectral-sequence computations supplies the integer group, finite biproducts and coordinate operations used in the noncanonicity witness.

Proof

Given: FaH=0, FbH=H for integers a<b, and projective Gp=FpH/Fp−1H for a<p≤b.

1.1F1

The quotient map qp:FpH→Gp is surjective. Apply [F1] with the identity of Gp to obtain a linear section sp:Gp→FpH, with qpsp=1. Then ϕp:Fp−1H⊕Gp→FpH, (x,y)↦x+sp(y), is linear. If its value is zero, applying qp gives y=0 and then x=0. For any z∈FpH, take y=qpz; the remainder z−sp(y) lies in ker⁡qp=Fp−1H, so z is in its image. Thus ϕp is an isomorphism restricting to the given inclusion on the first summand.

2.1F2step 1.1

Starting from FaH=0, apply step 1.1 successively at the finitely many indices a+1,…,b. This gives H≅⨁a<p≤bGp and sends each partial sum through p onto FpH. The inverse is therefore filtered too. Only finitely many sections are selected, by finite induction, so no arbitrary-index choice or AC is needed. Zero pieces require only the zero section; the zero module and a single nonzero stage are included. Bounds below a and above b add zero graded pieces and do not change the conclusion.

3.1F3step 2.1

Under the spectral-sequence hypothesis, the target filtration is finite by assumption, and the supplied abutment isomorphisms in [F3] identify its projective limiting terms with the modules Gp. Step 2.1 then applies degree by degree. No claim that collapse alone forces finiteness, projectivity or a determination of the extension was used.

4.1F1F4step 1.1∎

Noncanonicity occurs already for H=Z⊕Z with filtration 0⊂Z⊕0⊂H. Both graded pieces are projective: given a surjection of abelian groups and a map from Z, lift the image of 1 to one element and extend by integer multiples. The quotient onto the second coordinate has distinct sections s0(y)=(0,y) and s1(y)=(y,y). The automorphism T(x,y)=(x+y,y) preserves the filtration and induces the identity on both graded pieces, but takes s0 to s1. More strongly, every section has s(1)=(t,1) for an integer t, and T(s(1))=(t+1,1)≠s(1). Thus no section can be invariant under all automorphisms of the given filtered data; a canonical splitting does not follow. This uses only the elementary integer-module operations, not AC.

Depends on

Used by

Dependency tree · two levels

15 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