Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)
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.

Smooth singular simplex

Definition

Let M be a smooth manifold, possibly with boundary. For k0, put Ak={(t0,,tk)Rk+1:iti=1}. A smooth singular k-simplex in M is a map σ:ΔkM for which there are an open set OAk containing Δk and a smooth map σˉ:OM with σˉΔk=σ. The simplex and its face maps are The standard topological simplex and its affine face maps. Smoothness into a boundary target is that of Smooth maps between manifolds with boundary.

The extension takes values in M on all of O, including points outside the simplex. Merely extending its chart coordinates to a Euclidean space with values outside M does not suffice. Nor is separate smoothness of the face restrictions the definition. For a boundaryless target this is the usual neighbourhood-extension convention.

Write Sk(M) for this set of maps; the extension itself is not additional simplex data. Every such map is continuous. At k=0, A0=Δ0 is a point, so every point of M is a smooth zero-simplex. Constant maps are smooth in every degree, including maps to a boundary point, and degenerate parametrizations are allowed. The empty manifold has no simplices. No simultaneous choice of extensions is part of this definition.

Depends on

Used by

Dependency tree · two levels

4 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