Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 geodesically convex cover has the homotopy type of its nerve

Statement

Assume full AC. Let M be a Hausdorff second-countable smooth manifold with a Riemannian metric, and let U={Ui}i∈I be an open cover whose members are strongly geodesically convex in the convention of Existence of geodesically convex neighborhoods. Let N(U) be the abstract simplicial complex whose finite nonempty subsets σ⊂I are simplices exactly when Uσ:=⋂i∈σUi is nonempty. Then the geometric realization ∣N(U)∣ is homotopy equivalent to M. Writing Hsimp∗(N;F2) for the cohomology of the simplicial cochain complex, the natural comparison identifies it with H∗(M;F2).

Facts & Assumptions

Given: Full AC, the smooth Riemannian manifold M, the cover U, and its nerve.

[F1]

Every nonempty finite intersection of strongly geodesically convex open sets is strongly geodesically convex and hence contracts to any chosen point by its unique minimizing geodesics (Existence of geodesically convex neighborhoods).

[F2]

A smooth partition of unity subordinate to any open cover exists on a Hausdorff second-countable smooth manifold; its supports are locally finite and each support lies in its assigned cover member (Smooth partitions of unity exist on manifolds, Smooth partitions of unity subordinate to an open cover).

[F3]

The nerve is an abstract simplicial complex and its geometric realization has the weak topology with respect to its closed simplices (An abstract simplicial complex, The geometric realization of an abstract simplicial complex).

[F5]

Simplicial homology agrees naturally with singular homology of the geometric realization, and the cohomological universal-coefficient short exact sequence is natural for free integral chain complexes (Simplicial and singular homology agree, The universal coefficient theorem for cohomology over a PID).

[A1]

Full AC supplies the simultaneous choices of one point and one contraction for the set of nonempty finite intersections (The Axiom of Choice).

[F6]

Homotopies on an ordinary product with the interval are equivalent to continuous maps into the compact-open interval mapping space; quotient descent commutes with this interval product (Interval exponential law and quotient homotopies).

Proof

Given: The stated cover and a subordinate locally finite partition (ϕi)i∈I from [F2].

1.1A1F2F3construct

Define f:M→∣N∣ by f(x)=∑iϕi(x)i. Its finite support consists of cover members containing x, so it spans a nerve simplex. The map is continuous for the weak realization topology: near a point only finitely many supports occur, and after shrinking the neighborhood every remaining assigned Ui contains it. Thus the local map lands continuously in one finite simplex. Empty cover members contribute no vertex and may be omitted.

1.2F3constructalgebra

Define the barycentric subdivision N′ whose vertices are nonempty simplices σ of N and whose simplices are strict finite chains σ0⊂⋯⊂σk. The map h:∣N′∣→∣N∣ sends the vertex σ to its barycenter. It is a homeomorphism by an explicit simplexwise inverse: if a point has distinct positive coordinate levels λ1>⋯>λr>0, put σj={i:ti≥λj} and λr+1=0. Its expression is ∑j∣σj∣(λj−λj+1)bσj. These nonnegative weights sum to one and recover each coordinate. When levels coincide the intervening weight becomes zero, and on a face zero coordinates disappear; hence the inverse is continuous on each closed simplex and for the weak topologies in [F3].

2.1A1F1F3step 1.2construct

Using [A1], choose xσ∈Uσ for every nonempty simplex. Construct g:∣N′∣→M on a chain simplex recursively. Its vertex σ maps to xσ. For σ0⊂⋯⊂σk, cone the already defined opposite face to xσ0 using the unique minimizing geodesics in Uσ0. The opposite face lies in Uσ1⊂Uσ0 by induction. The cone agrees with the constructions on all other faces because deleting a vertex leaves the same ordered coning formula. It is continuous at the cone point by compactness of each face image and smooth dependence of the convex geodesics in [F1]. The resulting map has image in Uσ0 on this chain simplex and is globally continuous by the weak topology.

3.1F1step 1.1step 1.2step 2.1construct

For x∈M, each simplex in the chain representing h−1f(x) is a face of the support simplex of f(x). Thus both x and gh−1f(x) lie in the same Uσ0. Join them by its unique minimizing geodesic. This gives a homotopy gh−1f≃id⁡M. It is continuous even when the chain changes: on every convex-pair neighborhood geodesics depend continuously on both endpoints, and the local formulas agree on overlaps by uniqueness of the minimizing geodesic. No CW topology on a thick nerve is assumed.

4.1A1F3F6step 1.1step 1.2step 2.1step 3.1construct

We construct the other inverse homotopy by carriers. For the chain simplex with smallest face σ0, let Cσ0 be the subcomplex of nerve simplices τ for which τ∪σ0 is a simplex. It contracts to bσ0 by straight barycentric interpolation. The map h lies in this carrier, since its support is contained in the largest chain face; fg lies there because g lands in Uσ0 and all members in the support of f(g(−)) contain that same point. A face of a chain either has the same smallest simplex or a larger one; its carrier is therefore contained in Cσ0. Induct over chain-simplex dimension to homotope fg to h within these carriers. On a closed k-simplex, the two endpoint maps and the already fixed boundary homotopy define a map from the boundary of its prism into the contractible carrier. Extend across the prism by coning that boundary map with the displayed contraction. This extends the homotopy relative to all previously defined faces. For continuity, transpose each characteristic-prism map into the compact-open interval mapping space by [F6]. The maps agree on faces, so the weak topology of [F3] gives a continuous global transpose; untransposing by [F6] gives the required homotopy on the ordinary product with the interval. Consequently fgh−1≃id⁡∣N∣. Together with step 3.1 this proves M≃∣N∣ by actual inverse maps.

5.1F2F3F5step 4.1algebra

Simplicial and singular integral chains are free. Their natural comparison is a homology isomorphism by [F5]. Applying the natural cohomological universal-coefficient short exact sequences gives isomorphisms on the Ext and Hom terms, hence on cohomology by the elementary exact-sequence diagram argument. Therefore Hsimp∗(N;F2)≅Hsing∗(∣N∣;F2). The homotopy equivalence of step 4.1 identifies this with Hsing∗(M;F2). Two subordinate partitions give homotopic maps f by convex interpolation: their combined support at x consists entirely of sets containing x. For a refinement, the composed nerve map and the original partition map have the same property and are homotopic by the same interpolation. Thus the cohomology comparison is independent of those choices and natural under refinement; the choices of g merely supply its inverse.

6.1A1F1F2F3step 1.1step 2.1step 4.1step 5.1∎

If M is empty, the nerve has no nonempty simplex and both realizations/maps are empty. A singleton simplex is handled by its chosen point and the same geodesic contraction. Infinite covers cause no compact-image assumption on a thick realization: continuity follows simplexwise and local finiteness of the partition, and the homotopy is built on actual CW prisms. Full AC supplies the choices in [A1] and [F2]; no extra choice strength is introduced.

Depends on

Used by

Dependency tree · two levels

59 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