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.

A regular Bernoulli submodel and its score

Example

Under the Axiom-of-Choice density convention of A dominated differentiable-in-quadratic-mean submodel, let p∈(0,1) and choose 0<δ<min⁡(p,1−p). On {0,1} with the full power-set sigma-algebra and counting measure, let Pt{1}=p+t and Pt{0}=1−p−t for ∣t∣<δ. This two-sided regular path, restricted to t≥0, is DQM at zero with score

s(1)=1p,s(0)=−11−p,

which has Ps=0 and Ps2=1/[p(1−p)]. The densities with respect to counting measure are displayed explicitly, so the finite-path calculation makes no choice of versions.

Facts & Assumptions

Given: The Axiom of Choice, p∈(0,1), and 0<δ<min⁡(p,1−p).

[A1]

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

[F1]

A common-dominated path is DQM when its square-root densities have an L2 first-order expansion with coefficient s/2 (A dominated differentiable-in-quadratic-mean submodel).

[F2]

The score is an equivalence class in L2(P) and DQM scores have mean zero (A DQM score has mean zero and is unique).

[F3]

A probability measure is nonnegative and has total mass one (Probability measures and probability spaces).

[F4]

The full power set is a sigma-algebra, and a measurable space is a set with a specified sigma-algebra (Sigma-algebras, Measurable spaces and measurable sets).

[F5]

Counting measure assigns a finite set its cardinality; on the two-point sample space its total mass is two (Counting measure on an arbitrary set).

[F6]

The counting set function is a measure, and a finite measure is sigma-finite by the one-set cover (Counting measure is a measure, Finite, sigma-finite, and semifinite measures).

[F7]

For every x>0, the square-root function is differentiable with derivative 1/(2x) (Continuity and derivatives of positive-base real powers).

Verification

technique · Expand the two square-root masses on the finite sample space
1.1givenF3F4F5F6algebra

Every subset of {0,1} and its complement lie in the full power set, and every countable union of such subsets is still a subset; thus the power set is a sigma-algebra by [F4], and with this sigma-algebra the sample set is a measurable space by [F4]. Counting measure on this two-point set is a measure of total mass two by [F5, F6], hence sigma-finite by the constant sequence of covers En={0,1} in [F6]. Its only null set is empty, so each Pt is absolutely continuous with respect to it. The choice of δ ensures p+t>0 and 1−p−t>0 throughout ∣t∣<δ; the displayed masses sum to one, so each Pt is a probability measure.

2.1step 1.1F1F7A1algebra

Since p,1−p>0, [F7] and the definition of derivative give p+t=p+t/(2p)+o(t) and 1−p−t=1−p−t/(21−p)+o(t). These are exactly the two coordinates of p+(t/2)sp+o(t) for the stated s; because counting-measure L2 on two points is the Euclidean norm, the combined remainder is o(t). The density versions are explicit, so the calculation uses [A1]'s convention without a selection. Thus the path is DQM with this score by [F1].

3.1F2algebra∎

Direct calculation gives Ps=p(1/p)+(1−p)(−1/(1−p))=0 and Ps2=p/p2+(1−p)/(1−p)2=1/[p(1−p)]<∞. Hence the score is in L02(P) and has the stated variance.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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