Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)
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 continuous function on [0,1]⊆R extended to all of R, both by Tietze and by hand

Example

Let A:=[0,1]⊆R, closed, and f:A→R, f(x):=x2, continuous. R is normal (In a metric space any two separated sets have disjoint open neighbourhoods, so every metrizable space is completely normal). Assuming dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), Under dependent choice, a continuous real-valued map on a closed subspace of a normal space extends to the whole space, and a map into an open interval extends into that same open interval guarantees a continuous F:R→R with F∣A=f, without supplying a formula. The following formula gives such an extension without dependent choice:

F(x)  :=  (max⁡{0, min⁡{1, x}})2.

Facts & Assumptions

Given: A=[0,1], f(x)=x2, and F(x)=(max⁡{0,min⁡{1,x}})2.

[L1]

Verification

technique · direct
1.1givenL1

F is continuous, being the square of x↦max⁡{0,min⁡{1,x}}, itself continuous by [L1]; the square is a product of that function with itself, continuous by [L1].

1.2givenalgebra

For x∈[0,1]: min⁡{1,x}=x and max⁡{0,x}=x, since 0≤x≤1; so F(x)=x2=f(x).

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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