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 nonnegative even polynomial has a bounded parity complement
Statement
Let and let be even, of degree at most , and nonnegative on . Then there are such that where , , has parity , and has parity . The zero polynomial is both even and odd and satisfies every degree bound.
Facts & Assumptions
Given: An integer and an even real polynomial with and on .
The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution: a polynomial is a finitely supported coefficient sequence, and multiplication is coefficient convolution.
Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree: a nonzero polynomial has degree equal to the largest exponent with nonzero coefficient; the zero polynomial has no degree.
Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root: every nonconstant complex polynomial has a complex root.
Division algorithm for polynomials over a field: division by a nonzero polynomial over a field gives a unique quotient and a remainder that is zero or has degree strictly below the divisor.
Square roots exist: a unique with ; the positives are : every nonnegative real number has a unique nonnegative real square root.
A nonreal root of a real polynomial comes with its complex conjugate: a nonreal root of a real polynomial occurs with its complex conjugate.
Real and imaginary parts, complex conjugation, and modulus: complex conjugation fixes real numbers, conjugates products, and .
is a field, every element is uniquely , and every nonzero element has inverse : the complex numbers form a field containing , with the displayed coordinate arithmetic.
The reals form a field and The reals form a totally ordered field: is a field with a compatible total order, so real polynomial division and sign comparisons are defined.
Proof
If , choose . Otherwise evenness makes for some . By [F3], [F8], and repeated use of [F4], factor over into its finite multiset of roots with multiplicity.
The root multiset, with multiplicities, is invariant under because substituting preserves the order of a zero, and under conjugation as follows: if with , conjugating the entire coefficient factorization gives and . Hence conjugate roots have exactly equal multiplicities, strengthening the root existence in [F6]. The multiplicity at zero is even because every nonzero coefficient of an even polynomial has even exponent. Every real root with has even multiplicity: write with . Division by gives for a polynomial . On a bounded interval around , is bounded (each of its finitely many monomials is bounded); choosing the interval small enough makes , so has the sign of there by [F9]. If were odd, would then have opposite signs on the two sides of , contrary to .
Pair the roots into the following classes, choosing one representative from each symmetric class. A zero root of multiplicity contributes . A real pair with and multiplicity at each root contributes ; this is a polynomial because is even. A real pair with and multiplicity contributes , where and . A pure-imaginary pair with and multiplicity contributes , where and .
A nonreal quadruple with and common multiplicity contributes . Put and , and set . Since , the two cases and give , so all displayed square roots are real by [F5]. Define . For , its quartic norm is ; because the quartic roots are the nonreal numbers , it is strictly positive on the real interval. Direct expansion gives , the product of the four linear root factors.
Let be the product of the nonnegative real factors associated with these root classes: for zero roots, for interior real pairs, for exterior real pairs, for pure-imaginary pairs, and the quartics from step 1.4. Then for a nonzero real constant , because both sides have the same roots with the same multiplicities and the same degree. Enumerate reduced rationals in by increasing positive denominator and then increasing numerator, and take the first outside the finite root set; this search terminates because a nonzero polynomial has finitely many roots by step 1.1. There by the nonnegativity hypothesis and , and by its displayed factors, so by [F9]. Let by [F5].
Multiply the corresponding root-class factors defined above to form , retaining the interior and zero factors as real factors. Repeated use of shows that for real polynomials . Their factor identities give for every . Both and are polynomials; their difference vanishes at infinitely many real points, so it is the zero polynomial, since a nonzero polynomial has at most its degree many roots by repeated division by linear factors.
In each root class, the real part and the coefficient of have opposite parities; a real zero or interior factor has only a real part. The multiplication rule in step 3.1 preserves this parity relation. If , the degrees of the factors give and : every imaginary term contains at least one factor whose imaginary coefficient has degree at least one below that factor's real degree. When , the pair has a unique parity profile determined by its nonzero component: has parity if , and otherwise has parity . If , then has degree at most , while , whose parity is , has degree at most ; both terms of would then have degree at most , contradicting . Thus and the required parities hold.
If , let be the parity profile from step 4.1. If , multiply by . Its conjugate product is , and the multiplication rule changes the profile from to . It raises the degrees by at most one, so the new bounds are and . If , no adjustment is needed. This also covers or , since the profile is read from the nonzero component. Thus the resulting meet the required bounds and parities, completing the identity.
Depends on
- Admissible polynomial pair for Hermitian-reflection QSP
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
- Real and imaginary parts, complex conjugation, and modulus
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Division algorithm for polynomials over a field
- Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root
- A nonreal root of a real polynomial comes with its complex conjugate
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
- The real numbers
- The reals form a field
- The reals form a totally ordered field
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
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 29 (standard reference, not scraped)