Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge 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 compact smooth manifold has a finite good-cover nerve model

Statement

Assume AC. Let F be a compact finite-dimensional Hausdorff second-countable smooth manifold without boundary and equip it with a Riemannian metric. An open set is strongly geodesically convex if every ordered pair of its points is joined by a unique affinely parametrized globally length-minimizing geodesic whose image stays in the set and whose connector depends smoothly on the endpoints. There are finitely many such open sets U1,…,UN covering F, every nonempty finite intersection of which is strongly geodesically convex. Let K be the finite simplicial complex whose nonempty faces are the index sets σ⊆{1,…,N} for which Uσ=⋂i∈σUi is nonempty. Then its usual geometric realization ∣K∣ is homotopy equivalent to F. For F=∅, take N=0 and K=∅.

Facts & Assumptions

Given: AC, a compact smooth Riemannian manifold F, and the product topology on its finite simplicial complexes.

[A1]

Full AC includes the countable-choice hypothesis of the convex-neighborhood and smooth partition-of-unity suppliers. The Axiom of Choice

[F1]

Every point has a strongly geodesically convex open neighborhood, every nonempty finite intersection of such neighborhoods is strongly geodesically convex, and the unique globally minimizing geodesic depends smoothly on its endpoints. Existence of geodesically convex neighborhoods

[F2]

Every open cover of a smooth manifold has a smooth partition of unity subordinate to it. Smooth partitions of unity exist on manifolds

Proof

Given: The data in the statement.

1.1A1F1givenconstruct

The neighborhoods in [F1] cover F; compactness gives a finite subcover U1,…,UN. Each nonempty finite intersection remains strongly geodesically convex by [F1]. The nerve K has finitely many vertices and faces, so it is a finite simplicial complex. If F=∅, the empty cover and empty realization give the stated boundary case.

2.1A1F2step 1.1construct

Choose a smooth partition of unity ϕ1,…,ϕN subordinate to the finite cover by [F2]. Define f:F→∣K∣ by f(x)=∑iϕi(x)vi, where vi is the ith vertex. The active indices {i:ϕi(x)>0} all satisfy x∈supp⁡ϕi⊆Ui, so they form a simplex of K; hence the formula lands in ∣K∣. Finite sums of continuous coordinates make f continuous.

2.2A1F1step 1.1construct

Let sd⁡K be the barycentric subdivision and h:∣sd⁡K∣→∣K∣ its canonical homeomorphism, sending the vertex indexed by a face σ to the barycenter of σ. For each nonempty face σ, choose xσ∈Uσ; there are only finitely many such choices. Define g:∣sd⁡K∣→F on vertices by g(σ)=xσ. Inductively, a simplex of sd⁡K is a chain σ0⊊⋯⊊σm. Its face opposite σ0 has already been mapped into Uσ1⊆Uσ0; cone that face to xσ0 along the unique minimizing geodesics in Uσ0. This extension maps the entire chain simplex into Uσ0. Deleting σ0 gives the already assigned opposite face; deleting any other vertex restricts the same coning formula to the corresponding face. Thus all face definitions agree, and finite simplex-by-simplex pasting makes g continuous.

3.1F1step 2.1step 2.2construct

For each x∈F, the support of f(x) is a face σ whose every Ui contains x. Every chain simplex containing h−1f(x) has a smallest face σ0⊆σ, so x∈Uσ0; step 2.2 also gives gh−1f(x)∈Uσ0. The open set P=⋃i(Ui×Ui) contains every pair (x,gh−1f(x)). On each Ui×Ui, the unique minimizing connector is continuous by [F1]; connectors from different members agree on overlaps because they are globally unique. They therefore define a continuous connector on P. Applying it to x and gh−1f(x) gives a homotopy gh−1f≃id⁡F.

4.1F1step 2.1step 2.2step 3.1inductionconstruct∎

For a face σ0 of K, let Cσ0 be the subcomplex of faces η such that η∪σ0 is a face. It contracts to the barycenter of σ0: for any point in a simplex η of Cσ0, the straight segment to that barycenter lies in the simplex η∪σ0. On a chain simplex with smallest face σ0, the subdivision homeomorphism h lands in Cσ0; step 2.2 puts g in Uσ0, so every active vertex of fg forms a face jointly with σ0, and fg also lands in Cσ0. A face of the chain simplex has either the same smallest face or a larger one, whose carrier is contained in Cσ0. Induct over the finite simplices of sd⁡K: the two endpoint maps and the already constructed boundary homotopy define a map from the boundary of each prism into its contractible carrier Cσ0; coning that boundary map to the carrier's barycenter extends the homotopy over the prism, relative to its boundary. The finite extensions paste continuously and give fg≃h. Together with step 3.1, this shows gh−1 is a homotopy inverse for f: the two composites are homotopic to id⁡F and id⁡∣K∣, respectively.

Depends on

Dependency tree · 2 levels

Sources