claimroutineinferred_dep
Quartic and quadratic-sum problems have degree 0'
Reduces H10(Q) many-one to quartic and sum-of-squares problems, degree
finishes the restricted-degree statements
Claim·§7 Turing degree and a quartic normal form·inside corDegree 0' for rational solvability and quartic forms
Statement (paper)
Let denote the list problem in (ii) and the problem in (i). Sending to the list , and then expanding the squared sum , gives computable many-one reductions , where the expanded polynomial has integral coefficients and total degree at most four. Since both and are computably enumerable, both have Turing degree .
In plain English
Mapping to the list and then to the expanded polynomial gives computable many-one reductions , with the expanded polynomial integral of total degree at most four. Since and are computably enumerable, both have Turing degree .
Why it's here
This finishes the parent theorem for (i) and (ii). The circuit normalization claim supplies the equivalence between a zero of and a zero of . Both restricted problems then many-one reduce from , which has degree by the earlier claim, and they are computably enumerable, so each is bounded above by and also has degree .
Classified routine:
Direct bookkeeping consequence of the circuit normalization claim and the degree-0' claim for H10(Q): the standard sum-of-squares trick combines quadratic equations into one quartic, and any c.e. set that a 0'-complete set many-one reduces to has degree 0'.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §7 Turing degree and a quartic normal form
- Page
- —
- Label
—- Line
sections/07-consequences.tex:87
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Many-one reductions to restricted problems give degree 0'" rests on claim-thm-degree-normal-form-2
- infoinferred_depoutline: "Many-one reductions to restricted problems give degree 0'" rests on claim-thm-degree-normal-form-3