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

Known-amplitude success bound

Statement

For 0<a<1, let θ∈(0,π/2) satisfy sin⁡2θ=a, and let k be the maximizer selected by Known-amplitude amplification with integer rounding. Its success probability is at least max⁡{a,1−a}. The a=0 branch returns fail, and the a=1 branch succeeds with probability 1.

Facts & Assumptions

Given: The known-amplitude procedure and its finite range 0≤k≤⌈1/a⌉.

[F1]

Known-amplitude amplification with integer rounding: k maximizes sin⁡2((2k+1)θ) over the stated finite range; k=0 is included.

[F2]

Exact success probability after amplitude amplification: k standard iterations have good probability sin⁡2((2k+1)θ).

[F4]

Sine and cosine are 1-Lipschitz on R: ∣sin⁡x−sin⁡y∣≤∣x−y∣, in particular sin⁡θ≤θ for θ≥0.

[F5]

Signs, monotonicity intervals, and ranges of sine and cosine: sine is strictly increasing on [0,π/2].

Proof

1.1givenF1F2algebra

If 1/2≤a<1, the candidate k=0 belongs to the finite search range and has success probability sin⁡2θ=a=max⁡{a,1−a} by [F2]. The maximizing k therefore has at least this probability.

1.2givenF3F5F6choosealgebra

Suppose 0<a<1/2. Let s=sin⁡(π/4)=cos⁡(π/4)>0, where positivity follows from strict increase in [F5]. By [F6], 1=sin⁡(π/2)=2s2, so s=1/2. Since sin⁡θ=a<1/2=s, [F5] gives 0<θ<π/4. Put r=π/(4θ)−1/2>0, and choose a nearest nonnegative integer k0 to r, breaking ties toward the smaller integer. Then ∣k0−r∣≤1/2, so ∣(2k0+1)θ−π/2∣≤θ. The addition and Pythagorean identities [F3] give sin⁡2((2k0+1)θ)≥cos⁡2θ=1−a.

2.1givenF1F2F4F7step 1.2algebra∎

Since sin⁡θ=a, [F4] gives θ≥a. Hence k0≤r+1/2=π/(4θ)≤π/(4a)<1/a by [F7], so k0≤⌈1/a⌉. Thus k0 lies in the algorithm's finite range, and [F1]–[F2] show that its selected maximizer has probability at least 1−a=max⁡{a,1−a}. The explicit zero and unit-weight branches give the stated endpoint behavior.

Depends on

Used by

Dependency tree · two levels

51 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