Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 d≥0 and let A∈R[x] be even, of degree at most 2d, and nonnegative on [−1,1]. Then there are B,C∈R[x] such that A(x)=B(x)2+(1−x2)C(x)2, where deg⁡B≤d, deg⁡C≤d−1, B has parity d, and C has parity d−1. The zero polynomial is both even and odd and satisfies every degree bound.

Facts & Assumptions

Given: An integer d≥0 and an even real polynomial A with deg⁡A≤2d and A(x)≥0 on [−1,1].

[F1]

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.

[F2]

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.

[F3]

Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root: every nonconstant complex polynomial has a complex root.

[F4]

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.

[F5]

Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}: every nonnegative real number has a unique nonnegative real square root.

[F6]

A nonreal root of a real polynomial comes with its complex conjugate: a nonreal root of a real polynomial occurs with its complex conjugate.

[F7]

Real and imaginary parts, complex conjugation, and modulus: complex conjugation fixes real numbers, conjugates products, and zz‾=∣z∣2.

[F9]

The reals form a field and The reals form a totally ordered field: R is a field with a compatible total order, so real polynomial division and sign comparisons are defined.

Proof

1.1F1F2F3F4F8

If A=0, choose B=C=0. Otherwise evenness makes deg⁡A=2n for some 0≤n≤d. By [F3], [F8], and repeated use of [F4], factor A over C into its finite multiset of roots with multiplicity.

1.2F1F2F4F6F7F9given

The root multiset, with multiplicities, is invariant under ζ↦−ζ because substituting −x preserves the order of a zero, and under conjugation as follows: if A=(x−ζ)mH with H(ζ)≠0, conjugating the entire coefficient factorization gives A=(x−ζ‾)mH‾ and H‾(ζ‾)=H(ζ)‾≠0. 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 s with 0<∣s∣<1 has even multiplicity: write A(x)=(x−s)mh(x) with h(s)≠0. Division by x−s gives h(x)−h(s)=(x−s)k(x) for a polynomial k. On a bounded interval around s, k is bounded (each of its finitely many monomials is bounded); choosing the interval small enough makes ∣h(x)−h(s)∣<∣h(s)∣, so h has the sign of h(s) there by [F9]. If m were odd, (x−s)mh(x) would then have opposite signs on the two sides of s, contrary to A≥0.

1.3F5F7

Pair the roots into the following classes, choosing one representative from each symmetric class. A zero root of multiplicity 2r contributes xr. A real pair ±s with 0<s<1 and multiplicity m at each root contributes (x2−s2)m/2; this is a polynomial because m is even. A real pair ±s with s≥1 and multiplicity m contributes Rs(x)m, where Rs(x)=s2−1 x+is1−x2 and RsRs∗=s2−x2. A pure-imaginary pair ±ib with b>0 and multiplicity m contributes Ib(x)m, where Ib(x)=b2+1 x+ib1−x2 and IbIb∗=x2+b2.

1.4F5F6F7F8F9algebra

A nonreal quadruple ±a±ib with a,b>0 and common multiplicity m contributes Qa,b(x)m. Put u=a2+b2 and v=2(a2+1)b2+(a2−1)2+b4, and set c=u+v. Since v≥∣a2−1∣, the two cases a2≤1 and a2≥1 give c≥1, so all displayed square roots are real by [F5]. Define Qa,b(x)=cx2−u+ic2−1 x1−x2. For x∈[−1,1], its quartic norm is Qa,b(x)Qa,b(x)‾=∣Qa,b(x)∣2≥0; because the quartic roots are the nonreal numbers ±a±ib, it is strictly positive on the real interval. Direct expansion gives Qa,bQa,b∗=x4+2(b2−a2)x2+(a2+b2)2, the product of the four linear root factors.

2.1F3F4F5F8F9step 1.1step 1.3step 1.4given

Let G(x) be the product of the nonnegative real factors associated with these root classes: x2r for zero roots, (x2−s2)m for interior real pairs, (s2−x2)m for exterior real pairs, (x2+b2)m for pure-imaginary pairs, and the quartics from step 1.4. Then A=κG for a nonzero real constant κ, because both sides have the same roots with the same multiplicities and the same degree. Enumerate reduced rationals in (−1,1) by increasing positive denominator and then increasing numerator, and take the first x0 outside the finite root set; this search terminates because a nonzero polynomial has finitely many roots by step 1.1. There A(x0)>0 by the nonnegativity hypothesis and A(x0)≠0, and G(x0)>0 by its displayed factors, so κ=A(x0)/G(x0)>0 by [F9]. Let K=κ by [F5].

3.1F1F4F7step 1.3step 1.4step 2.1

Multiply the corresponding root-class factors defined above to form W(x)=K∏R(x), retaining the interior and zero factors as real factors. Repeated use of (B+i1−x2C)(D+i1−x2E)=(BD−(1−x2)CE)+i1−x2(BE+CD) shows that W=B+i1−x2C for real polynomials B,C. Their factor identities give WW∗=A for every x∈[−1,1]. Both WW∗=B2+(1−x2)C2 and A 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.

4.1step 3.1algebra

In each root class, the real part and the coefficient of i1−x2 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 deg⁡A=2n, the degrees of the factors give deg⁡B≤n and deg⁡C≤n−1: every imaginary term contains at least one factor whose imaginary coefficient has degree at least one below that factor's real degree. When n=d, the pair has a unique parity profile b determined by its nonzero component: B has parity b if B≠0, and otherwise C has parity 1−b. If b≠d, then B has degree at most d−1, while C, whose parity is d, has degree at most d−2; both terms of B2+(1−x2)C2 would then have degree at most 2d−2, contradicting deg⁡A=2d. Thus b=d and the required parities hold.

5.1F5step 3.1step 4.1algebra∎

If n<d, let b be the parity profile from step 4.1. If b≠d, multiply W by x+i1−x2. Its conjugate product is x2+(1−x2)=1, and the multiplication rule changes the profile from b to 1−b. It raises the degrees by at most one, so the new bounds are deg⁡B≤n+1≤d and deg⁡C≤n≤d−1. If b=d, no adjustment is needed. This also covers B=0 or C=0, since the profile is read from the nonzero component. Thus the resulting B,C meet the required bounds and parities, completing the identity.

Depends on

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