Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge 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.

Bernoulli mean as a good-state probability

Example

Let X∈{0,1} have Pr⁡(X=1)=p and use g(X)=X on the range [0,1]. Suppose a coherent sampler for this law and its explicitly costed inverse/controlled operations are supplied.

Facts & Assumptions

Given: The Bernoulli law, the observable g(x)=x, and a coherent sampler that prepares its finite law.

[F1]

Finite expectation-estimation task: μ=∑xpxg(x).

[F2]

Coherent finite sampler and observable value: the specified finite unitary preparation is an explicit input, with inverse, controlled, and rotation costs declared.

[F3]

Measurement law of a coherent sampler: measuring the sample register returns x with probability px.

[F4]

Amplitude-estimation expectation estimator uses the affine value q(x)=(g(x)−a)/(b−a) and a good flag.

[F5]

Quantum bounded-expectation guarantee and query cost gives its success and query guarantee.

Verification

1.1givenF1F3F4algebra

Here μ=(1−p)⋅0+p⋅1=p by [F1] and the two-point law [F3]. The range is [a,b]=[0,1], so [F4] gives q(x)=x.

2.1F3F4step 1.1algebra

Conditional on sample x, the controlled rotation places good probability x. Averaging over the sample law, the total good probability is (1−p)⋅0+p⋅1=p=μ.

3.1givenF2F5step 2.1∎

Thus the QA13 amplitude estimator is estimating the Bernoulli mean itself; [F5] yields additive error ε with confidence 1−δ in either declared access mode. In repeated controlled-Q access it uses O(ε−1(1+ln⁡(1/δ))) controlled sampler/reflection rounds; in supplied controlled-power access its power queries retain their separately declared prices. The circuit costs remain those declared by the supplied sampler.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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