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.
Bounded integer-grid values control excursions by the derivative
Statement
Let be an integer and let be a real polynomial. On , set If for every integer , then
Facts & Assumptions
Given: An integer , a real polynomial , and the grid bounds for .
Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials and For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term: a real polynomial is a finite coefficient list evaluated by powers, and its real function is differentiable everywhere with derivative a polynomial function.
Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function: every polynomial function is continuous, and so is the absolute value of a continuous function.
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value: a continuous real function on the nonempty compact interval attains its maximum and minimum.
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a function is continuous on a closed interval and differentiable in its interior, its endpoint difference equals its derivative at an interior point times the interval length.
Proof
By [F1]–[F3], both and are continuous on the compact interval . Thus there exist with , , and . In particular and .
For any , some grid integer satisfies (choose a nearest integer, with an endpoint grid point at either boundary). Applying [F4] on the interval between and when they differ gives ; equality of the points gives the same inequality directly.
If , then . It remains to consider .
Apply step 1.2 at a maximizer and a minimizer . The grid bounds give and , so . Rearranging yields .
Depends on
- Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials
- For a natural $n \ge 1$ the function $x \mapsto x^{n}$ is differentiable everywhere with derivative $\iota(n)\,x^{\,n-1}$; for $n = 0$ it is the constant $1$, with derivative $0$; for a natural $n \ge 1$ the function $x \mapsto x^{-n}$ is differentiable at every $x \ne 0$ with derivative $-\iota(n)\,x^{-n-1}$; consequently every polynomial function is differentiable at every real, with the derivative computed term by term
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- Extreme value theorem: a continuous real function on a nonempty compact subset of $\mathbb{R}$ attains a greatest and a least value
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
Used by
Dependency tree · two levels
38 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (2025), §21.6 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §11.2 (standard reference, not scraped)