Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

The positive square-root branch is smooth

Statement

For q>0, let s(q) be the unique positive root specified in Explicit rational and real power regimes. Then s:(0,∞)→(0,∞) is smooth and s′(q)=1/(2s(q)).

Facts & Assumptions

Given: The positive-root function s on the open interval (0,∞).

[F1]

Explicit rational and real power regimes supplies existence and uniqueness of the positive root.

[F2]

Choice-free smooth inverse function theorem in Euclidean space applies to a smooth map on an open Euclidean set at a point with invertible derivative, and produces a smooth local inverse.

Proof

1.1givenF1F3algebra

Define P:(0,∞)→R by P(t)=t2. By [F3], P is smooth with P′(t)=2t. Fix q>0 and put t=s(q)>0. Then P(t)=q and the one-dimensional derivative is invertible because 2t≠0.

2.1F1F2step 1.1construct

By [F2], there are open neighborhoods V⊆(0,∞) of t and W of q on which P∣V has a smooth inverse h. Shrink W inside (0,∞). For y∈W, h(y)>0 and h(y)2=y, so uniqueness in [F1] implies h(y)=s(y). Thus s agrees with a smooth function near every point of its domain and is smooth.

3.1F1F3step 2.1algebra∎

Differentiate s(q)2=q using [F3] to obtain 2s(q)s′(q)=1. Since s(q)>0, division gives the stated derivative. The domain excludes the zero endpoint; no smooth extension through zero is claimed. The local inverses agree by uniqueness, without any choice of a family of inverses.

Depends on

Dependency tree · 2 levels

Sources