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 be a Serre class. If an abelian group has a finite increasing filtration and every quotient belongs to , then .
More generally, let preserve finite filtrations with common zero and total endpoints. If every induced map is a -isomorphism, then is a -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.
Serre classes, Serre rings, ideals, and modulo-C morphisms gives subgroup, quotient, and extension closure and defines a -isomorphism by its kernel and cokernel.
The Snake Lemma for modules gives the exact sequence of kernels and cokernels associated to a map of short exact sequences.
Proof
The group lies in . If , the filtration gives a short exact sequence The two end groups lie in , so extension closure in [F1] gives . Finite induction from through yields .
Write . For each , the filtered map gives a commutative diagram whose rows are and the analogous sequence for . Apply [F2]. If and are -isomorphisms, all four of their kernel and cokernel groups lie in . Exactness of the snake sequence expresses and as extensions of subquotients of those four groups. By [F1], both belong to ; hence is a -isomorphism.
The initial map has zero kernel and cokernel. Starting there and applying step 1.2 finitely many times proves that is a -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.
If , then 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.
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
- Miller, MIT 18.906 notes, finite filtrations modulo a Serre class (standard reference, not scraped)