Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-01 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The preconnecting arrow on cycles

Definition

Let 0AiBpC0 be a short exact sequence of complexes in an abelian category, and fix nZ. Apply Snake lemma under the weaker Stacks hypotheses to the quotient-kernel diagram of The cycle-boundary diagram associated to a short exact sequence of complexes. The kernel of its right vertical map is canonically Hn(C)=Zn(C)/Bn(C), and the cokernel of its left vertical map is canonically Hn1(A)=Zn1(A)/Bn1(A). Thus the snake construction supplies a canonical morphism δnsnake:Hn(C)Hn1(A).

Let qn:Zn(C)Hn(C) be the homology quotient from Homology object of a chain complex. The preconnecting arrow on cycles is the categorical composite ~n:=δnsnakeqn:Zn(C)Hn1(A).

In a module category, applying this morphism to an element gives the usual lift-and-boundary recipe. The definition above uses only kernels, cokernels, and the canonical snake morphism, so it is valid in every abelian category.

Depends on

Used by

Dependency tree · two levels

16 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