Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

A compact manifold's twisted singular chains admit a one-vertex reduction without choice

Statement

Let M be a compact connected Hausdorff manifold, o∈M, and R a unital ring. One can construct paths γx from o to every x∈M, with γo constant, by fixed rules from one finite atlas and finitely many connecting paths. Let R be a right-R local system with a supplied identification Ro=R and transport given by left multiplication by units, with monodromy image H≤R×. Its twisted singular complex has an explicit chain decomposition C∗(M;R)=C∗′⊕Q∗ after a change of free bases, where C0′=R, C∗′ is free, and Q∗ is contractible with its only nonzero differential an identity from degree one to degree zero. Moreover im⁡(d1′)=∑h∈H(h−1)R. The decomposition and its dual cochain homotopy equivalences require no choice principle. In particular this image is principal if H is cyclic, if it equals R, or if every right ideal of R is principal.

Facts & Assumptions

Given: The compact connected manifold, point, coefficient system, and base fiber identification.

[F1]

A right-R local system here means a functor from the fundamental groupoid to unital right-R modules with right-linear transport isomorphisms. Forgetting the right action gives an abelian-group local system; the intrinsic first-vertex construction of Singular and cellular local chain complexes applies with commutative base ring Z. The additional arbitrary-ring linearity and square-zero calculation are supplied directly in step 1.1 below.

Proof

1.1F1givenconstructalgebra

For a singular simplex σ:[v0,…,vn]→M, put its coefficient in Rσ(v0) and take the direct sum of those right modules over all singular simplices. For n≥1 define d(cσ)=T01(c) σ[1,…,n]+∑i=1n(−1)ic σ[0,…,i^,…,n], and let the degree-zero differential be zero. Every face map is right-linear because transport is, so this defines right-R linear differentials without assuming that R is commutative. To check d2=0, pair the two terms deleting vertices i<j. Their signs are (−1)i+j−1 and (−1)i+j. If i>0, both coefficients are c. If i=0<1<j, both coefficients are T01(c). If (i,j)=(0,1), the coefficients are T12T01(c) and T02(c), which agree because the two-edge path is endpoint-fixed homotopic to the direct edge in the simplex and transport is a groupoid functor. Thus every pair cancels. This includes degenerate simplices and degree one, where the next differential is zero. These are the underlying abelian local chains of [F1], now equipped with their verified right-R structure.

1.2givenconstructalgebra

Choose a finite cover by coordinate balls U1,…,Um with charts onto convex Euclidean balls, including a ball centered at o. This uses compactness and only a finite selection. Their intersection graph is connected: otherwise the unions belonging to different graph components would be disjoint nonempty open sets partitioning connected M. For each edge choose one point in the intersection, a finite selection; join it to each chart center by its straight coordinate segment. Choose a spanning tree by the finite index order and concatenate these segments to get paths from o to every chart center. For x∈M, take the least-index chart containing it and follow its center path by the straight segment to x; at o use the constant path. Denote this explicitly prescribed path by γx. This defines paths for all points from one finite list of charts and edge points, rather than selecting an infinite family of paths.

2.1F1step 1.2constructalgebra

Transport the supplied basis 1∈Ro along γx to obtain a basis at each x. Thus [F1] makes every Cj the free right R-module on its actual singular j-simplices. Write ex for the degree-zero basis and eσ for the degree-one basis of a path σ:x→y. The degree-one boundary is d1eσ=eygσ−ex, where gσ∈H is the transition unit obtained by transporting first along γx, then along σ, and back along γy. For x≠o, the path γx is itself one singular one-simplex; denote its basis element by px. These basis elements are distinct because their terminal points are distinct, and d1px=ex−eo. Put po=0.

3.1step 2.1constructalgebra

Change the degree-zero basis to eo and bx=ex−eo for x≠o. This is invertible even with infinitely many vertices: the inverse is ex=bx+eo, and every vector has finite support. Retain the degree-one basis elements px. For every other one-simplex σ:x→y, replace its basis element by qσ=eσ−pygσ+px. This is another invertible basis change, with inverse eσ=qσ+pygσ−px. Direct substitution gives d1qσ=eo(gσ−1), whereas d1px=bx.

4.1step 3.1constructalgebra

Let Q1 be free on the px, Q0 free on the bx, and Qj=0 in other degrees, with differential px↦bx. Let C1′ be free on the remaining qσ, C0′=Reo, and Cj′=Cj for j≥2. The differential of a degree-two chain has zero px coefficient for every x: applying d1 would otherwise give a nonzero corresponding bx coefficient, contrary to d1d2=0 proved in step 1.1. Thus d2 lands in C1′, and higher differentials already stay in C′. This proves the claimed direct sum of complexes. Its contractible summand has the explicit homotopy bx↦px, zero on all other degrees. Dualizing this actual homotopy gives the cochain equivalences for any coefficient module; no exactness assertion about an infinite product or choice of primitives is needed.

5.1F1step 2.1step 3.1step 4.1constructalgebra

The image of d1′ is the right ideal generated by the elements gσ−1. All transition units belong to H, so this ideal is contained in ∑h∈H(h−1)R. Conversely every h∈H is realized by transport along a based loop at o. That loop is one singular one-simplex and is not one of the removed px, whose endpoints differ. Its reduced boundary is eo(h−1). Thus every generator of the displayed ideal occurs, and equality follows.

6.1step 1.2step 3.1step 4.1step 5.1algebra∎

If H=⟨t⟩ is cyclic, tk−1 is a right multiple of t−1 for every integer k: use the finite geometric sum for k>0, zero for k=0, and t−k−1=−t−k(tk−1) for negative powers. Since powers of t commute with t−1, this last expression is also a right multiple. The ideal is therefore (t−1)R, including H={1} with zero ideal. The other two sufficient conditions for principality are literal. All basis changes and homotopies were explicit finite-support formulas, and the only initial choices were finite. This proves the stated choice scope.

Depends on

Used by

Dependency tree · two levels

5 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