Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Serre classes are stable under finite filtrations

Statement

Let C be a Serre class. If an abelian group A has a finite increasing filtration 0=F1AF0AFmA=A and every quotient griA=FiA/Fi1A belongs to C, then AC.

More generally, let f:AB preserve finite filtrations with common zero and total endpoints. If every induced map gri(f):griAgriB is a C-isomorphism, then f is a C-isomorphism. Both assertions are choice-free.

Facts & Assumptions

Given: The finite filtrations, the Serre class, and, in the second clause, the filtered homomorphism in the statement.

[F1]

Serre classes, Serre rings, ideals, and modulo-C morphisms gives subgroup, quotient, and extension closure and defines a C-isomorphism by its kernel and cokernel.

[F2]

The Snake Lemma for modules gives the exact sequence of kernels and cokernels associated to a map of short exact sequences.

Proof

technique · finite induction through consecutive short exact sequences
1.1

The group F1A=0 lies in C. If Fi1AC, the filtration gives a short exact sequence 0Fi1AFiAgriA0. The two end groups lie in C, so extension closure in [F1] gives FiAC. Finite induction from i=0 through i=m yields A=FmAC.

F1
1.2

Write fi:FiAFiB. For each i, the filtered map gives a commutative diagram whose rows are 0Fi1AFiAgriA0 and the analogous sequence for B. Apply [F2]. If fi1 and gri(f) are C-isomorphisms, all four of their kernel and cokernel groups lie in C. Exactness of the snake sequence expresses kerfi and cokerfi as extensions of subquotients of those four groups. By [F1], both belong to C; hence fi is a C-isomorphism.

F1F2
2.1

The initial map f1:00 has zero kernel and cokernel. Starting there and applying step 1.2 finitely many times proves that fm=f is a C-isomorphism. No simultaneous selection of lifts is made: the snake maps are homomorphisms supplied by [F2], and the argument only takes finitely many canonical kernels, images, quotients, and extensions.

F1F2step 1.2
3.1

If m=1, then A=B=0 and both conclusions are immediate. Repeated filtration terms contribute zero graded pieces. A one-step filtration is exactly the defining extension closure, and a one-piece filtered map is the defining kernel-cokernel condition. Zero graded maps and zero source or target groups are included. The induction checks its initial and terminal endpoints, and step 1.2 checks both the kernel and cokernel sides of the snake sequence. Degenerate filtrations are handled by repeated terms. No AC is used and neither assertion is a biconditional.

F1F2step 1.1step 1.2step 2.1

Source notes

Miller, Lecture 30, printed p. 106, states finite-filtration closure immediately after Lemma 30.6. The filtered-morphism refinement is the snake-lemma argument written out above.

Depends on

Used by

Dependency tree · two levels

7 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