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 real-valued optimum is not a fractional Grover iteration
Statement refuted
The real-valued optimizer is always a legal number of standard Grover-iterate queries.
Witness
Take and . Then , so , which is not an integer. Standard Grover circuits apply an integer number of iterates. The exact continuous formula at gives , while the legal integer choices and each give success probability .
Facts & Assumptions
Given: , one marked item, and the standard Grover iterate.
Exact success probability after an integer number of Grover iterates: for integer , .
Principal inverse sine and inverse cosine: is the inverse of sine on .
Signs, monotonicity intervals, and ranges of sine and cosine: sine and cosine have their usual signs on .
The addition formulas for sine and cosine: sine and cosine obey their addition formulas.
Square roots exist: a unique with ; the positives are : nonnegative square roots are unique.
Refutation
Put , , and . Since by [F4], [F3] gives . By [F7] and [F5], , so . Since , we have . Then [F7] and [F5] give , so [F9] gives . Thus by [F2], and .
The legal standard query counts are integers, so is not executable. Applying the integer formula [F1] gives and , whereas substituting the noninteger into the trigonometric expression would give . The continuous expression therefore does not describe an allowed standard Grover circuit at this input.
Depends on
- Known-count Grover search by exact integer maximization
- Pi as twice the smallest positive zero of cosine
- Principal inverse sine and inverse cosine
- Cosine has a smallest positive zero, lying strictly between zero and two
- Double-angle and quadratic power-reduction identities
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Exact success probability after an integer number of Grover iterates
- Quarter-turn values and shifts by pi/2 and pi
- The addition formulas for sine and cosine
- The derivatives of sine and cosine are cosine and minus sine
- Signs, monotonicity intervals, and ranges of sine and cosine
Used by
Nothing in the library uses this result yet.
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
- Ronald de Wolf, Quantum Computing: Lecture Notes, §7.2 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, §19.1 (standard reference, not scraped)