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 , let satisfy , and let be the maximizer selected by Known-amplitude amplification with integer rounding. Its success probability is at least . The branch returns fail, and the branch succeeds with probability .
Facts & Assumptions
Given: The known-amplitude procedure and its finite range .
Known-amplitude amplification with integer rounding: maximizes over the stated finite range; is included.
Exact success probability after amplitude amplification: standard iterations have good probability .
The addition formulas for complex trigonometric and hyperbolic functions and Parity and the Pythagorean identity for sine and cosine: the angle-addition and identities hold.
Sine and cosine are -Lipschitz on : , in particular for .
Signs, monotonicity intervals, and ranges of sine and cosine: sine is strictly increasing on .
Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions, Double-angle and quadratic power-reduction identities, Quarter-turn values and shifts by pi/2 and pi, and Square roots exist: a unique with ; the positives are : , , and positive square roots are unique.
Proof
If , the candidate belongs to the finite search range and has success probability by [F2]. The maximizing therefore has at least this probability.
Suppose . Let , where positivity follows from strict increase in [F5]. By [F6], , so . Since , [F5] gives . Put , and choose a nearest nonnegative integer to , breaking ties toward the smaller integer. Then , so . The addition and Pythagorean identities [F3] give .
Since , [F4] gives . Hence by [F7], so . Thus lies in the algorithm's finite range, and [F1]–[F2] show that its selected maximizer has probability at least . The explicit zero and unit-weight branches give the stated endpoint behavior.
Depends on
- Known-amplitude amplification with integer rounding
- Exact success probability after amplitude amplification
- Complex sine, cosine, hyperbolic sine, and hyperbolic cosine from the complex exponential
- The addition formulas for complex trigonometric and hyperbolic functions
- Parity and the Pythagorean identity for sine and cosine
- Pi as twice the smallest positive zero of cosine
- Quarter-turn values and shifts by pi/2 and pi
- The derivatives of sine and cosine are cosine and minus sine
- Cosine has a smallest positive zero, lying strictly between zero and two
- The addition formulas for sine and cosine
- Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
- Double-angle and quadratic power-reduction identities
- Signs, monotonicity intervals, and ranges of sine and cosine
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Sine and cosine are $1$-Lipschitz on $\mathbb{R}$
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
- Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, Quantum Amplitude Amplification and Estimation (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)