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.
Singular Cochains Mayer Vietoris and Smooth Singular Comparison — Examples
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- Binary Operations, Monoids, Groups and Subgroups
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hereditary and Productive Behaviour of the Separation Axioms
- Homotopy and Homotopy Equivalence
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Singular Chains and Singular Homology
- Singular Cochains Mayer Vietoris and Smooth Singular Comparison
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Products of Modules
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Whitney Embedding Tubular Neighbourhoods and Approximation
2 · Summary
The calculations compare subdivision depths within one finite chain, evaluate a canonical overlap cochain extension, and construct smooth affine simplices in a coordinate ball with an actual common extension neighbourhood. The Takagi path supplies a continuous simplex with no finite derivative anywhere, including its endpoints.
Endpoint-relative path smoothing is illustrated by an explicit homotopy, and the point calculation retains all unnormalized degenerate simplices and computes the alternating differentials. The final remark distinguishes the kernel/image definition of real singular cohomology from its natural evaluation isomorphism under AC.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A finite chain needing different subdivision depths on its simplices
Example
For the cover , of , the finite real chain with and has simplices of different least subdivision depths: zero for and one for .
Facts & Assumptions
Given: These two paths and this ordered cover.
Smooth subdivision consists of affine domain pieces (Barycentric subdivision and prism preserve smooth singular chains).
In dimension one the subdivision cone gives the two oriented halves (Barycentric subdivision operator).
Proof
The image of is , so it is already small. The image of is in neither nor , since and . Thus its least depth is positive. Both paths extend smoothly to all real parameters.
The cone convention [F2] gives , where and . Their images are respectively and . Thus is small and the least depth of is exactly one. Since both halves of the constant path are the same constant path, . Consequently is small.
This exhibits different least depths within a finite chain, while the common bound one works for the entire chain. The two terms of are distinct basis maps, so the nonsmall does not cancel before subdivision. Zero coefficients or the empty chain would have no such obligation. Endpoint inclusions above are strict relative to the cover thresholds, and the degenerate constant path has been computed rather than discarded. No choice is used.
Canonical zero extension of an overlap cochain
Example
Take and in , with overlap vertex and -only vertex . The overlap zero-cochain with value two at and zero at every other vertex has canonical extension satisfying .
Facts & Assumptions
Given: The intervals, vertices and basis values above, extended linearly on finite overlap chains.
Canonical zero extension retains overlap basis values and vanishes on every other simplex in (Canonical extension by zero of a singular cochain on a simplex basis).
Proof
We have , so lies in the overlap and lies in . By [F1], and . Linearity therefore gives .
Restriction back to the overlap equals on every vertex: it has value two at and zero elsewhere, hence agrees on every finite chain. More generally, for any specified overlap cochain and finite chain in , the value is exactly . An empty retained index set gives zero and one retained term gives its coefficient times its value. This is a degreewise extension, not an assertion that extension commutes with coboundary. No basis or representatives are chosen.
Smooth singular simplices in a coordinate ball
Example
Let be a smooth chart with a convex open ball in , and take finitely many . Then is a smooth singular -simplex. Repeated vertices are permitted.
Facts & Assumptions
Given: The chart, the specified vertices, and the affine hyperplane containing .
A smooth simplex requires a smooth target-valued extension on an open neighbourhood in (Smooth singular simplex).
Proof
The affine map , , is smooth. Convexity implies . Therefore is open in and contains the entire simplex. The smooth map is the extension required by [F1]. This constructs one common neighbourhood directly.
To make the uniform margin explicit, is compact. If , the continuous function attains a maximum on . Put . Any point within distance of lies in by the triangle inequality. Hence is a single open neighbourhood of the closed simplex on which the same extension is defined. For example, with and vertices , the path is , whose extension remains in for .
For this gives the constant extension on the one-point affine space. For repeated or coincident vertices the affine formula is still smooth and may be constant; no independence is needed. The construction includes all faces and endpoints because contains the closed simplex. Empty balls cannot carry the given vertex tuple; in dimension zero the ball is a point and the same formula is constant. Only a supplied finite tuple is used, so no AC is required.
A continuous nowhere differentiable singular one simplex
Statement refuted
Every continuous real-valued singular one-simplex is differentiable at some interior parameter, and hence continuity alone could suffice for smoothness.
Example
The Takagi path , , is continuous and has no finite derivative anywhere, including one-sided endpoint derivatives.
Facts & Assumptions
Given: The real line as target and the displayed explicit series.
A smooth singular simplex has a smooth extension on an affine neighbourhood (Smooth singular simplex).
The Takagi series converges uniformly and is nowhere finitely differentiable on its closed interval (The Takagi series converges uniformly to a continuous nowhere differentiable function).
The tent function is with (The tent function and the Takagi series ).
Proof
Each term is nonnegative and at most by [F3]. Thus the sum is well-defined and . By [F2] it is continuous, so it is a singular one-simplex. Direct substitution gives and , because every term with vanishes there. The path is therefore nonconstant despite its equal endpoints.
To spell out the differentiability obstruction supplied by [F2], take the nested adjacent dyadic interval of length containing the parameter, using the interval to the right at a dyadic point and the interval to the left at . All summands of index at least vanish at its endpoints. Each earlier summand is affine there with slope . The secant slope of is . Nested intervals preserve the earlier slopes, so consecutive secant slopes differ by one in absolute value and cannot converge to a finite value. If a finite derivative existed, the two endpoint quotients would tend to it, and their convex combination, this secant slope, would also tend to it. At a dyadic point or endpoint the appropriate one-sided quotient gives the same contradiction. This verifies exactly the finite-derivative assertion needed here.
A smooth extension in [F1] would give a finite derivative at every interior parameter, contradicting step 2.1. Thus this example meets the stronger nowhere-differentiable requirement, not only failure at one cusp. There is no empty-domain case for a singular one-simplex. A point target would yield a constant smooth map and is not this witness. No infinite selections are used: the series and dyadic intervals are specified arithmetically.
Relative smoothing fixes the endpoints of a path
Example
Assume . A continuous path in a smooth manifold without boundary, with and , is homotopic relative to both endpoints to a strict smooth singular path. For the explicit cusp path in , one endpoint-fixed smoothing is the constant path .
Facts & Assumptions
Given: The continuous path in the boundaryless target and its two endpoint values.
Boundaryless relative simplex smoothing preserves prescribed compatible face homotopies with their exact time parameter, using countable choice (Relative smoothing of a continuous simplex along its faces).
Countable choice is the axiom used here (The Axiom of Countable Choice ()).
Proof
Regard as . Its two faces are the separate points and . Prescribe their smooth zero-simplices with values and the constant homotopies , . The faces have empty intersection, so compatibility is vacuous. Under [F2], [F1] supplies a strict smooth path and a continuous homotopy satisfying and for every , as required.
The neighbourhood hypothesis behind [F1] is concrete in this dimension: disjoint small affine neighbourhoods of the two endpoint faces carry the constant smooth maps and . The relative-smoothing proof first changes the continuous path, keeping the endpoints fixed, to agree with such a smooth neighbourhood extension near the endpoint union; only then does it apply relative Whitney approximation. Thus no claim is made that mere equality of endpoint values already means smoothness near those endpoints.
In the explicit real example define . This is continuous, equals at , equals the constant smooth path at , and has at every time. Its middle value is , exhibiting the actual change of the path. If the original path is smooth, [F1] also permits the constant homotopy with , including constant paths and a one-point target. An empty target admits no path. The general assertion inherits only countable choice; the displayed real formula needs none.
Singular cohomology of a point from the cochain complex
Example
For the one-point space , the unnormalized real singular cochain complex is in degrees starting at zero. Thus and for .
Facts & Assumptions
Given: The specified one-point space.
Real singular cohomology is kernel modulo image of the signed-boundary dual differential (Real singular cohomology).
Proof
There is exactly one simplex in each nonnegative degree, so and its real dual is by evaluation on . For all faces equal , hence . Pairing consecutive signs gives scalar zero for odd and one for even . The degree-zero boundary is zero by convention.
Thus is zero for even and identity for odd . In degree zero, kernel is and the image from degree minus one is zero. In positive even degree, kernel is and the previous differential is identity, so the quotient is zero. In odd degree, kernel is zero and the previous image is zero, again giving zero. Negative cochain groups and cohomology are zero. This proves all claimed values by the actual quotient definition.
All higher point simplices are degenerate but were retained; discarding them without changing complexes would not be the calculation above. In particular the sole edge has boundary and the sole triangle has boundary . The zero vector is the unique class in every positive group. For comparison the empty space has no basis simplices, hence zero in all cochain and cohomology degrees. These canonical identifications use no choice.
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.