Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Unknown-amplitude search has no false positives and halts almost surely

Statement

For 0<a<1, let sin⁡2θ=a. For every integer M≥1, the second fresh sample with j uniform on {1,…,M} has good-outcome probability pM=1M∑j=1Msin⁡2((2j+1)θ)=12−12M∑j=1Mcos⁡((4j+2)θ)≥12−12M∣sin⁡(2θ)∣. For every a>0, the procedure Unknown-amplitude randomized search returns a good output with probability 1. If a=0, it never returns a good output and does not halt.

Facts & Assumptions

Given: The fresh-register schedule, the good/bad measurement, and the verification rule in the algorithm.

[F1]

Unknown-amplitude randomized search: every round begins with a direct fresh sample, and its second fresh sample uses a uniform j∈{1,…,Mℓ}; only verified good outputs are returned.

[F2]

Exact success probability after amplitude amplification: conditional on the second sample using j iterates, its good probability is sin⁡2((2j+1)θ).

[F3]

Projective measurement outcome weights are probabilities: the good/bad projective instrument assigns the good branch its Born probability.

[F4]

Conditional state for a projective measurement: a positive-probability good branch has a conditional state supported in the good projection.

[F5]

The addition formulas for complex trigonometric and hyperbolic functions: cos⁡(x+y)=cos⁡xcos⁡y−sin⁡xsin⁡y; ∣cos⁡x∣≤1 follows from Parity and the Pythagorean identity for sine and cosine.

Proof

1.1givenF2F5F6algebra

Assume 0<a<1, and let 0<θ<π/2 satisfy sin⁡2θ=a. The identity sin⁡2x=(1−cos⁡(2x))/2 gives pM=1M∑j=1Msin⁡2((2j+1)θ)=12−12M∑j=1Mcos⁡((4j+2)θ). The cosine sum is the real part of ei6θ∑r=0M−1ei4rθ. By [F6], this finite geometric sum has modulus ∣1−ei4Mθ∣∣1−ei4θ∣=∣sin⁡(2Mθ)∣∣sin⁡(2θ)∣≤1∣sin⁡(2θ)∣. Taking real parts therefore gives pM≥12−12M∣sin⁡(2θ)∣.

2.1givenF1F2step 1.1algebra

If 0<a<3/4, then sin⁡(2θ)=2a(1−a)≥a. Since Mℓ→∞, some finite round has Mℓ≥2/a, after which [F1]–[F2] give a conditional per-round success probability at least pMℓ≥1/4. If a≥3/4, the direct sample in each round succeeds with probability at least 3/4. Thus in either case there is a finite round after which every fresh round has conditional success probability bounded below by a fixed positive constant.

3.1givenF1F3F4step 2.1algebra

Registers and randomness are fresh each round, so after r rounds beyond the finite threshold in step 2.1, the probability of still not returning is at most (3/4)r in the first case and (1/4)r in the second. Both tend to zero. Since every output is returned only after the good instrument outcome (and verification when required), no bad output is returned; on every positive-probability good branch [F4] supplies its conditional state.

4.1givenF1F3algebra∎

If a=0, every fresh preparation has zero projection onto ran⁡Πgood, so each good outcome has probability zero by [F3]. The procedure therefore never returns and runs forever, as specified in [F1].

Depends on

Used by

Dependency tree · two levels

68 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