Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Bounded mean-zero scores generate the unrestricted tangent space

Example

Assume the library's Axiom-of-Choice density convention in A dominated differentiable-in-quadratic-mean submodel and Countable Choice for The mean-zero L² space is a Hilbert space. Let P be any probability law and take the unrestricted dominated model M={Q:Q≪P}. Its allowed paths are all one-sided DQM paths through P with common dominator P. Every bounded mean-zero s∈L02(P) is such a path score, and the tangent space is all of L02(P). All densities constructed below are explicit, so the example's proof makes no density-selection choice.

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice, a probability measure P, and a bounded measurable representative s with Ps=0.

[A1]

The Axiom of Choice permits selecting from an arbitrary family of nonempty sets (The Axiom of Choice).

[A2]

Countable Choice permits selecting from a countable family of nonempty sets (The Axiom of Countable Choice (ACω)).

[F1]

A DQM path with common dominator P has root-density expansion pt=1+(t/2)s+oL2(P)(t) (A dominated differentiable-in-quadratic-mean submodel).

[F2]

Every DQM score is in L02(P) (A DQM score has mean zero and is unique).

[F3]

L02(P) is the mean-zero subspace of the quotient L2(P) (Mean-zero square-integrable functions).

[F4]

The tangent space is the L2(P)-norm closure of the finite linear span of allowed scores (Closed tangent space).

[F5]

Dominated convergence applies to pointwise-convergent functions dominated by an integrable function (Dominated convergence).

[F6]

On a probability space, ∣Pg∣≤∥g∥2 for g∈L2(P) by Cauchy–Schwarz against 1 (Cauchy-Schwarz inequality for L2).

[F7]

Under Countable Choice, L02(P) is closed in L2(P) (The mean-zero L² space is a Hilbert space).

[F8]

The Lebesgue integral is linear on L1 (The Lebesgue integral is linear on L1(μ)).

Verification

technique · Construct normalized square-root perturbations, then use centered truncations
1.1F2F3F7A2

Every allowed score is in L02(P) by [F2]; because L02(P) is closed in L2(P) by [F7] under [A2], its closed tangent space is contained in L02(P).

1.2givenF3algebra

Let M=sup⁡x∈X∣s(x)∣<∞ for the bounded representative in Given, and choose 0<ϵ<(1+M)−1. For 0≤t<ϵ, let at=1+ts/2, ct=P(at2)=1+t2Ps2/4, and pt=at2/ct. The bound on t makes at≥0; ct>0 and Ppt=1, so pt is a probability density with respect to P.

1.3F3F5F6F8algebra

Let f∈L02(P) and choose a measurable representative. Define um=(−m)∨(f∧m). Then ∣um−f∣2≤f21{∣f∣>m}, whose right side tends pointwise to zero and is dominated by the integrable f2. By [F5], ∥um−f∥2→0. Put sm=um−Pum; it is bounded and Psm=0 by [F8] and P1=1. Also [F6] and [F8] give ∣Pum∣=∣P(um−f)∣≤∥um−f∥2. Therefore ∥sm−f∥2≤2∥um−f∥2→0.

2.1step 1.2F1A1algebra

Since ∥at∥2=ct, ∥pt−1−(t/2)s∥2=∥at/ct−at∥2=∣1−ct∣=O(t2)=o(t). The density family is explicit, so it fits [A1]'s general convention without any selection. Thus Pt=ptP is an allowed DQM path with score s, and every bounded mean-zero score lies in the tangent set.

3.1F4step 1.1step 2.1step 1.3∎

Each sm is a tangent score by step 2.1, and the sequence converges to the arbitrary f∈L02(P) by step 1.3. Hence the tangent space contains L02(P) by [F4]; step 1.1 gives the reverse inclusion. Thus the tangent space is exactly L02(P).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

37 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.