Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Finite and complete filtered isomorphism lifting

Statement

Let f:AB preserve increasing filtrations and induce isomorphisms FpA/Fp1AFpB/Fp1B for every integer p. If both filtrations are finite in an abelian category, f is an isomorphism of filtered objects. The same conclusion holds for exhaustive, separated, complete filtrations of modules over a fixed ring. In particular its inverse preserves each filtration piece. Neither conclusion needs AC or a splitting; the complete case needs no finite filtration bound.

Facts & Assumptions

[F1]

Spectral sequence subquotient and local lifting calculus supplies finite quotient comparisons, epic local lifting and descent in an abelian category.

[F2]

Strong convergence of a spectral sequence specifies completeness by the compatible quotient inverse limit, and exhaustiveness and separatedness separately. Here these are hypotheses on the filtered objects, without requiring a spectral sequence.

Proof

Given: f with the stated graded isomorphisms.

1.1

Consider a commutative diagram of short exact sequences 0UXV0 and 0UXV0, whose maps on U and V are isomorphisms. If a morphism into X is killed by the middle map, its image in V is killed by the isomorphism to V, hence zero. It factors through U, where the isomorphism to U and the monic inclusion force it to be zero. Thus the middle map is monic. To lift a morphism into X, first project to V, use the inverse on V, and lift into X after epic pullback. Its difference from the prescribed map lies in U, so use the inverse on U to correct the lift. Thus the middle map is epic by epic cancellation. A monic epic in an abelian category is invertible by its coimage-image factorization. The local lifts and their cancellation have precisely the meaning of [F1]; no global representatives are chosen.

F1
1.2

Under the complete module hypotheses, completeness identifies FpA with limk<pFpA/FkA. Indeed a compatible tuple in these subquotients is a tuple in A/FkA for k<p. Its component at p and at larger indices is zero, since each tuple entry has a representative in FpA. This extends it uniquely to a compatible tuple in the full quotient system. Completeness supplies a unique aA with those residues, and its zero residue at p says aFpA. Conversely an element of FpA gives that tuple, and its uniqueness follows from separatedness (also from the injective completion map). The formulas preserve addition and scalar multiplication. The same argument applies to B.

F2
2.1

For finite filtrations take common integer bounds a<b such that both Fa pieces are zero and both Fb pieces are the whole objects. At a the restriction of f is an isomorphism of zero objects. Apply step 1.1 to the sequences 0Fp1FpFp/Fp10 for a<pb. Finite induction proves every restriction FpAFpB invertible, including f at b. Below a and above b the restrictions are respectively the zero and whole-object maps. Their inverses are the restrictions of f1 by uniqueness, so the inverse is filtered. Empty graded pieces and repeated filtration terms cause no change to the argument.

F1step 1.1
3.1

Now assume the complete module hypotheses. For any fixed k<p, filter FpA/FkA and FpB/FkB by the images of the intermediate Fj for kjp. The successive quotients are the original graded pieces by the nested-quotient comparison. The finite argument therefore gives an isomorphism fp,k:FpA/FkAFpB/FkB. For k<k its quotient-transition squares commute; applying inverses on both sides proves the inverse squares commute as well.

F1step 2.1
4.1

The compatible inverse maps in step 3.1 send a compatible tuple on the B side to one on the A side. By step 1.2 they give an inverse to f:FpAFpB for every p. This constructs the inverse without selecting representatives: all residue inverses and their limits are unique. Every bB lies in some FpB by exhaustiveness and therefore has a preimage in FpA. Every kernel element in A lies in some FpA and is zero by injectivity there. Thus f is bijective and linear, and its inverse sends FpB into FpA. The zero module and any one-step finite filtration satisfy the same formulas. Infinite index sets enter only through unique compatible tuples, so no AC is used.

F2step 3.1step 1.2

Depends on

Used by

Dependency tree · two levels

4 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