Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Smooth singular simplices in a coordinate ball

Example

Let ψ:W→B be a smooth chart with B a convex open ball in Rn, and take finitely many v0,…,vk∈B. Then σ(λ)=ψ−1(∑i=0kλivi) is a smooth singular k-simplex. Repeated vertices are permitted.

Facts & Assumptions

Given: The chart, the specified vertices, and the affine hyperplane Ak={λ:∑iλi=1} containing Δk.

[F1]

A smooth simplex requires a smooth target-valued extension on an open neighbourhood in Ak (Smooth singular simplex).

Proof

1.1givenF1

The affine map L:Ak→Rn, L(λ)=∑iλivi, is smooth. Convexity implies L(Δk)⊂B. Therefore O=L−1(B) is open in Ak and contains the entire simplex. The smooth map ψ−1∘L:O→W⊂M is the extension required by [F1]. This constructs one common neighbourhood directly.

2.1givenF1step 1.1algebra

To make the uniform margin explicit, K=L(Δk) is compact. If B=B(b,R), the continuous function y↦∥y−b∥ attains a maximum r<R on K. Put ε=(R−r)/2>0. Any point within distance ε of K lies in B by the triangle inequality. Hence L−1({y:dist⁡(y,K)<ε}) is a single open neighbourhood of the closed simplex on which the same extension is defined. For example, with B=(−2,2) and vertices −1,1, the path is σ(t)=2t−1, whose extension remains in B for −1/2<t<3/2.

3.1F1step 1.1step 2.1∎

For k=0 this gives the constant extension on the one-point affine space. For repeated or coincident vertices the affine formula is still smooth and may be constant; no independence is needed. The construction includes all faces and endpoints because O contains the closed simplex. Empty balls cannot carry the given vertex tuple; in dimension zero the ball is a point and the same formula is constant. Only a supplied finite tuple is used, so no AC is required.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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