Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-06 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.

Mayer–Vietoris connecting class

Definition

Fix an abelian group G, an open cover X=UV, and n1. For a cover-small n-cycle z=u+v with uCn(U;G) and vCn(V;G), define δ[z]:=[u]=[v]Hn1(UV;G). This is the connecting-class convention compatible with i(c)=(c,c).

Indeed, z=0 implies u=v. As a chain lying in both subcomplexes, this is a chain on UV, and 2u=0 makes it a cycle. For n=1 this uses the ordinary zero boundary on 0-chains; if the overlap is empty the chain is zero.

The well-definedness obligation is discharged by Well-definedness of the Mayer–Vietoris connector . Explicitly, replacing (u,v) by another decomposition changes u by an overlap chain and hence u by an overlap boundary. If zz=(a+b) in the small complex, where a lies in U and b in V, then uua is an overlap chain and its boundary is uu. The cover-small homology identification used in Mayer–Vietoris sequence in singular homology therefore makes this a class depending only on [z]Hn(X;G). Lifting z to (u,v) gives boundary (u,u)=i(u), so the sign agrees with that sequence.

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