Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05 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.

A nonnatural choice of connecting maps does not form a delta functor

Statement refuted

A family of additive functors together with arbitrary exact connecting maps is automatically a homological delta functor.

Facts & Assumptions

Given: The ordinary homology delta functor on complexes and one short exact sequence whose connecting morphism is nonzero.

[L1]

A homological delta functor requires both exactness and naturality of the connecting maps (Homological delta functor).

[L2]

Homology of complexes is a genuine homological delta functor (Homology of complexes satisfies the delta-functor naturality and exactness laws).

[L3]

There is a concrete short exact sequence of complexes with nonzero connecting morphism (A degreewise split sequence with nonzero connecting map).

Counterexample

1.1

Start with the homology delta functor from [L2]. Keep every functor Hn unchanged and keep every connecting map unchanged except on one chosen short exact sequence with nonzero connector from [L3], where replace by . Each individual long exact sequence remains exact.

L2L3givenconstruct
2.1

Choose a distinct isomorphic copy of the cone sequence in [L3], and alter the connector on only the original sequence. The chosen isomorphism of short exact sequences induces isomorphisms on the two homology groups. Before the alteration, naturality identifies the two routes around the connecting square with the same map ±1:ZZ. After changing exactly one connector to its negative, the two routes are opposite maps ±1 and 1, which are unequal over Z. Hence this naturality square fails, and [L1] shows that the altered family is not a homological delta functor.

L1L2L3step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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