Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedPipeline-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.

Every continuous singular simplex is smooth

Statement refuted

Every continuous singular simplex in a smooth manifold is a smooth singular simplex.

Facts & Assumptions

Given: The target is the boundaryless manifold R.

[F1]

Smooth singular simplices extend smoothly to an open affine neighbourhood of their whole closed domain (Smooth singular simplex).

Proof

1.1

The path σ(t)=t1/2 on [0,1]=Δ1 is continuous, since s1/2t1/2st. At its interior point 1/2 the right difference quotients are one and the left difference quotients are minus one. Therefore it is not differentiable there.

givenalgebra
2.1

Any extension in [F1] would restrict to a differentiable function on an interval around 1/2 agreeing with σ. Its derivative would have to equal both limits from step 1.1, an impossibility. Thus this is a continuous singular one-simplex which is not smooth.

F1step 1.1
3.1

Its endpoints both equal 1/2, but it is nonconstant, so endpoint agreement does not fix the interior defect. All zero-simplices and constant simplices in this target are smooth by constant extension; the empty target has no witness. The explicit formula uses no choice and requires no boundary-target convention.

F1step 1.1step 2.1

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