Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-11-04 (gpt-6.1-sol)
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.

Natural integral good-cover Cech to singular comparison

Statement

Assume full AC. Let X be a topological space, let U=(Ui)i∈I be an open cover indexed by a linearly ordered set, and let G be an abelian group. Write G‾ for the sheaf of locally constant G-valued functions, with G discrete. There is a canonical homomorphism ΨX,U,Gq:Hˇq(U;G‾)⟶Hsingq(X;G)(q≥0). If every nonempty finite intersection of members of U is contractible, this homomorphism is an isomorphism in every degree. It is natural in homomorphisms of coefficient groups and in continuous maps with compatible cover functions: if f:Y→X is continuous, V=(Vj)j∈J is an ordered open cover of Y, and c:J→I satisfies f(Vj)⊆Uc(j), then f∗ΨX,U,Gq=ΨY,V,Gq Hq(f,c)∗, where (f,c)∗ is the usual alternating Cech pullback using c and restriction of locally constant functions along f. In particular this includes refinement functions, which need not preserve order, and open restrictions. For two contractible-intersection covers, the resulting refinement homomorphism on cohomology is independent of the refinement function. For contractible-intersection covers and an arbitrary continuous map f, even when no cover function is supplied, the canonical pullback between the fixed-cover cohomology groups is defined by ΨY,V,G−1f∗ΨX,U,G; these maps are functorial and agree with the usual Cech cover-map pullbacks whenever such a cover map is supplied. In degree zero, Ψ0 sends a compatible family of locally constant functions to the same function on the points of X.

The cohomology conventions are the ordered Cech differential with alternating deletion and the singular coboundary dφ=φ∂, without an extra degree sign. Cochains are arbitrary functions on the singular simplex set, not finitely supported functions. For a nonempty contractible space the one-member cover in particular gives Hsing0(X;G)=G and Hsingq(X;G)=0 for q>0. In particular, for G=Z this supplies natural integral comparison isomorphisms for every good cover of a finite-dimensional Hausdorff second-countable smooth manifold. No realification, universal-coefficient theorem, dualization of a mere homology isomorphism, or field-coefficient hypothesis is used. An arbitrary restricted cover (Ui∩O) of an open subset need not have contractible intersections: the naturality square still holds for it, while an isomorphism is asserted only for covers satisfying the stated intersection condition.

Facts & Assumptions

Given: Full AC, X,U,G as stated. All chains below have integer coefficients. The cochain group with values in G means Hom⁡Z(−,G), and all chain groups in negative degrees are zero. Empty intersections contribute zero cochains. In an alternating family, a repeated cover index has value zero; permuting distinct indices multiplies its value by the permutation sign. This identifies alternating families with the stated increasing-tuple Cech convention by sorting.

[F1]

Ordered Čech cochain complex of a cover, Fixed-cover Čech cohomology and Refinement map of ordered open covers supply the ordered and alternating deletion formulas, with cover functions allowed to repeat or reorder indices.

[F2]

Cover-small singular chains gives A∗=C∗U(X;Z), the free subgroup on simplices whose image lies in one cover member. The complete integral construction in The cover-small inclusion is a chain homotopy equivalence supplies maps r:C∗(X;Z)→A∗ and D:C∗(X;Z)→C∗+1(X;Z) with rι=1 and 1−ιr=∂D+D∂, where ι is inclusion. That supplier constructs them by image-preserving barycentric subdivision and a dimension-recursive finite subdivision depth; it is a chain homotopy equivalence, not only a homology isomorphism.

[F3]

Singular cochain complex with coefficients and Singular cohomology with coefficients give the positive-precomposition coboundary and all-degree quotient convention. The singular chain homotopy formula gives the integral signed prism identity for a supplied continuous homotopy, including degree zero.

[A1]

The Axiom of Choice is used to choose one admissible cover index for each cover-small simplex in each degree, and one contraction and point for each nonempty finite cover intersection. The comparison maps themselves will be defined using canonical maps and inverses on cohomology; they do not depend on those choices.

Proof

1.1givenF2F3algebra

Put Aq=Hom⁡Z(Aq,G) and Cq=Hom⁡Z(Cq(X;Z),G). Restriction ρ=ι∗:C∗→A∗ is a cochain homotopy equivalence. Indeed r∗ is a cochain map, ρr∗=1, and r∗ρ−1=−dD∗−D∗d, where (D∗φ)(a)=φ(Da). These equations follow by precomposing [F2]'s integral chain identities and use precisely the positive convention [F3]. Thus Hq(ρ) is invertible for every abelian G, without assuming that Hom⁡(−,G) preserves arbitrary quasi-isomorphisms. This restriction map is canonical, although the homotopy inverse used to prove it is an isomorphism need not be.

1.2F1F2F3A1algebra

For p,q≥0 define Kp,q=∏i0<⋯<ipCq(Ui0∩⋯∩Uip;G). Use alternating extension in the cover indices. Let δh be alternating deletion followed by restriction and let dv be the singular coboundary on each intersection. Both square to zero and commute, because restriction of a cochain commutes with precomposition by the singular boundary. The total complex is Tot⁡nK=⨁p+q=nKp,q, with total differential dT=δh+(−1)pdv on bidegree (p,q); the sum has finitely many bidegrees for each n. Define a:A∗→Tot⁡K by restricting a small cochain to each Ui, placing it in K0,∗. Its horizontal differential is zero on overlaps, and its vertical differential is the singular one, so it is a cochain map. Augment each horizontal row by Aq in column p=−1. Given a small simplex σ, let Iσ={i:im⁡σ⊂Ui} and choose i(σ)∈Iσ using [A1]. On a component evaluated at a singular simplex with image in Ui0∩⋯∩Uip−1, set (hc)i0⋯ip−1(σ)=ci(σ),i0,…,ip−1(σ). For p=0 this means (hc)(σ)=ci(σ)(σ)∈Aq. Alternating deletion gives δhh+hδh=1 on the augmented row: the deletion of the newly prepended index gives c and the other deletion terms cancel in pairs with opposite signs. Repetitions give zero in exactly the alternating convention. Thus every augmented row is split exact. No commutation between h and dv is asserted or needed.

1.3F1F3A1algebra

Let Bp=Cp(U;G‾). Define w:B∗→Tot⁡K in bidegree (p,0) by evaluating the locally constant function on each singular vertex in its intersection. A locally constant function is constant along a path, so its singular coboundary on every singular edge is zero. Thus w commutes with the total differential and is a cochain map for any open cover. Now assume every nonempty finite intersection UJ is contractible. A supplied contraction, its point inclusion and the constant map give integral chain maps whose composites are chain homotopic to the identity by the signed prism formula [F3]. Dualizing these homotopies into G shows that C∗(UJ;G) has the cohomology of the singular cochain complex of a point. That point complex has G in each degree, with coboundary zero in even degrees and the identity in odd degrees: its degree-q boundary sum is ∑j=0q+1(−1)j. Hence its cohomology is G in degree zero and zero in positive degrees. Since a nonempty contractible space is path connected, evaluation of a locally constant function is precisely its degree-zero cocycle identification. Consequently each column augmented by Bp at q=−1 is exact; for products over intersections, choose all contractions simultaneously by [A1], or solve each cocycle component with their prism homotopies. This proves product exactness without a field or finite-cover hypothesis.

2.1step 1.2algebra

This augmented row exactness proves that a is a quasi-isomorphism by a finite elimination, as follows. Add column p=−1 with entries Aq, horizontal map the augmentation a, and vertical part −d in the total differential; the resulting total complex is the cochain mapping cone of a, with its degree-n group Tot⁡nK⊕An+1 and differential (z,u)↦(dTz+au,−du). Let z be a cocycle of this augmented total complex. It has finitely many bidegrees p+q=n, p≥−1,q≥0. Take its largest occupied p. In the cocycle equation at (p+1,q), no vertical term from column p+1 is present, so δhzp,q=0. If p≥0, augmented row exactness gives yp−1,q with δhyp−1,q=zp,q. Subtracting dTy removes that component and introduces only one component with smaller p. Iterating terminates at column −1; there, injectivity of the row augmentation makes a horizontally closed component zero. Hence every cocycle is a coboundary, also in degree −1, and the cone is acyclic. Equivalently a induces isomorphisms: this equivalence can be seen directly from the cone equations, since an a-image that is a coboundary gives a cone cocycle, and a cocycle of the target lifts modulo a cone boundary. Therefore H(a) is invertible in every degree.

2.2step 1.3algebra

Exactness of the augmented columns proves that w is a quasi-isomorphism by the other finite elimination. Place Bp in bidegree (p,−1), use its Cech differential horizontally and its evaluation augmentation vertically, and retain dT=δh+(−1)pdv. This augmented total complex is the cone of w after multiplying its bottom-row coordinate in column p by (−1)p; under that identification its differential is (z,u)↦(dTz+wu,−δhu). For a cocycle, choose the largest occupied q. In the equation at (p,q+1), no horizontal contribution from row q+1 is present, so dvzp,q=0. Column exactness supplies a preimage in (p,q−1) if q≥0; multiply it by (−1)p before subtracting its total differential. This removes the component and introduces only a component with smaller q. The process terminates at q=−1, where injectivity of the evaluation augmentation makes the final component zero. There are finitely many bidegrees on each total diagonal, so no convergence, completion or spectral-sequence limiting argument occurs. Thus the cone is acyclic and H(w) is an isomorphism.

3.1step 1.1step 2.1step 2.2algebra

Define, for every ordered open cover, ΨX,U,Gq=Hq(ρ)−1 Hq(a)−1 Hq(w). Steps 1.1 and 2.1 give the two inverse maps in this formula for any cover. Step 2.2 says that H(w) is also invertible for a contractible-intersection cover, proving the asserted isomorphism. All three maps ρ,a,w were defined without choices; the cover-index selections and intersection contractions only proved their required properties. In degree zero, a Cech cocycle consists of compatible locally constant functions, hence glues to a function on X. Evaluating at vertices describes both aρ of that function and w of its compatible family. The formula for Ψ0 therefore gives that same function, with no sign change. For X=∅ all groups are zero, and the conclusion still holds. The one-member cover of a nonempty contractible space has Cech cohomology G in degree zero and zero otherwise, proving the stated singular-cohomology consequence.

4.1F1F3step 3.1algebra

For the pair (f,c) in the Statement, postcomposition sends a V-small singular simplex in Y to a U-small simplex in X, and commutes with all singular face maps. Precomposition therefore defines pullback maps on the full and small cochain complexes, commuting with ρ. On the double complex use ((f,c)∗k)j0⋯jp(σ)=kc(j0),…,c(jp)(f∘σ). Every map is defined on the required intersection because f(Vj)⊂Uc(j). Repeated indices are assigned zero and arbitrary reordering uses its sign. Alternating deletion shows this map commutes with δh term by term; postcomposition commuting with faces shows it commutes with dv. It also commutes with a and w, since both sides restrict/evaluate the same cochain or locally constant function on the same simplex. These three commuting squares, after taking cohomology and inverting H(ρ) and H(a), give exactly the stated naturality equality. Applying the same construction to a homomorphism G→G′ gives coefficient naturality. In particular the inclusion Z→R is the literal coefficient change on singular and Cech cochains, not a tensor-duality identification.

5.1step 3.1step 4.1algebra∎

A refinement is the case f=id⁡; if both covers have contractible intersections, naturality gives H(c♯)=ΨV−1ΨU, independently of the refinement function. Taking f:O↪X and the cover (Ui∩O) gives the open-restriction square without requiring that the restricted cover be good. For a supplied contractible-intersection cover of O mapping to U, the same formula gives the square between comparison isomorphisms. For arbitrary good-cover presentations of X,Y and an arbitrary continuous f:Y→X, define their cohomology pullback to be ΨY,V,G−1f∗ΨX,U,G. The identity and composition laws follow by cancelling adjacent comparison inverses and using the identity and composition laws for singular cochain pullback. The cover-map equality of step 4.1 shows that this agrees with the usual Cech pullback whenever an index map exists. It also makes identity maps between any two good-cover presentations canonical and transitive. Thus arbitrary open restriction or smooth pullback is available between any supplied good-cover presentations, without assuming that restricted intersections remain contractible or that a common good refinement has been supplied. Thus the theorem supplies the integral natural good-cover comparison interface under its exact cochain conventions, while making no false assertion that open restriction preserves good covers.

Remarks

The proof is entirely integral before applying Hom⁡Z(−,G). In particular it retains torsion. It establishes no geometric differential-character comparison, Deligne cup product, anomaly physics, or charge completeness beyond this precise comparison premise. Those separate consumer hypotheses remain as stated.

Depends on

Dependency tree · 2 levels

Sources