Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 2026-09-12
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.

Relative smoothing fixes the endpoints of a path

Example

Assume ACω. A continuous path f:[0,1]→N in a smooth manifold without boundary, with f(0)=p and f(1)=q, is homotopic relative to both endpoints to a strict smooth singular path. For the explicit cusp path f(t)=∣t−1/2∣ in R, one endpoint-fixed smoothing is the constant path g(t)=1/2.

Facts & Assumptions

Given: The continuous path in the boundaryless target and its two endpoint values.

[F1]

Boundaryless relative simplex smoothing preserves prescribed compatible face homotopies with their exact time parameter, using countable choice (Relative smoothing of a continuous simplex along its faces).

[F2]

Countable choice is the axiom used here (The Axiom of Countable Choice (ACω)).

Proof

1.1givenF1F2

Regard [0,1] as Δ1. Its two faces are the separate points 0 and 1. Prescribe their smooth zero-simplices with values p,q and the constant homotopies H0(0,s)=p, H1(1,s)=q. The faces have empty intersection, so compatibility is vacuous. Under [F2], [F1] supplies a strict smooth path g and a continuous homotopy H satisfying H(0,s)=p and H(1,s)=q for every s, as required.

2.1F1step 1.1

The neighbourhood hypothesis behind [F1] is concrete in this dimension: disjoint small affine neighbourhoods of the two endpoint faces carry the constant smooth maps p and q. The relative-smoothing proof first changes the continuous path, keeping the endpoints fixed, to agree with such a smooth neighbourhood extension near the endpoint union; only then does it apply relative Whitney approximation. Thus no claim is made that mere equality of endpoint values already means smoothness near those endpoints.

3.1F1F2step 1.1algebra∎

In the explicit real example define H(t,s)=(1−s)∣t−1/2∣+s/2. This is continuous, equals f at s=0, equals the constant smooth path g at s=1, and has H(0,s)=H(1,s)=(1−s)/2+s/2=1/2 at every time. Its middle value is H(1/2,s)=s/2, exhibiting the actual change of the path. If the original path is smooth, [F1] also permits the constant homotopy with g=f, including constant paths and a one-point target. An empty target admits no path. The general assertion inherits only countable choice; the displayed real formula needs none.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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