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.
Hom of homology is not the definition of singular cohomology
Statement
For a topological space X, real singular cohomology is defined by where and . This definition is choice-free. Evaluation on cycles defines a natural real-linear map Under AC this map is an isomorphism, by a theorem about functional extensions, not by the definition of singular cohomology. This distinction does not assert a counterexample to real-coefficient evaluation under AC.
Facts & Assumptions
Given: The objects and separate axiom branches of the statement.
The real singular chain complex is unaugmented, with , zero negative groups, and (Real singular chain complex).
Cochains are real-linear functionals, with differential , and their cohomology is the displayed kernel/image quotient (Real singular cochain complex, Real singular cohomology).
For a real chain complex, evaluation on cycles is well-defined and natural without choice; under AC it is an isomorphism by extension of functionals on cycles and boundaries (Dualizing real chain complexes requires an exactness argument, positive branch; The Axiom of Choice).
Proof
By [F1], , and hence for every cochain one has . Thus the image in [F2] is a vector subspace of the kernel and the quotient exists. Both kernel and image are specified sets, and forming their quotient makes no selection of representatives. This verifies the choice-free definition.
If is a cocycle and a cycle, set . Replacing by changes this value by . Replacing by changes it by . Addition and scalar multiplication commute with evaluation, so it defines the claimed linear map on the two quotients. For a continuous map , postcomposition on simplices commutes with each face, and hence with the signed boundary. Its chain map therefore satisfies , which is the naturality identity on classes. Neither construction uses AC.
Assume AC for this step. Apply the positive branch of [F3] to the real complex [F1]. Concretely, any functional on pulls back to the cycles and extends to ; the extension vanishes on boundaries, so gives a cocycle mapping to that functional. If a cocycle vanishes on cycles, the rule is well-defined on the boundary subspace in degree and extends to , giving after that extension. These are exactly the surjectivity and injectivity arguments in [F3]; both use its AC extension clause. Conversely every coboundary vanishes on cycles by step 1.2. Thus evaluation is the asserted natural isomorphism. It is not an alternative definition, and no global family of cochain representatives was chosen.
If , all chain and cochain groups are zero and evaluation is the unique isomorphism between zero spaces in every degree. If is a point, there is one simplex in every nonnegative degree and is multiplication by for : it is the identity in positive even degrees and zero in odd degrees, with . Therefore and for ; dually and for . Evaluation in degree zero sends the constant scalar cochain a to the functional , an isomorphism without choice. In negative degrees both sides vanish. For general X at degree zero there is no incoming coboundary, so the injectivity argument uses no negative-degree extension. Constant and repeated simplices are retained in these unnormalized complexes; the representative computations in step 1.2 apply to them as written.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)