Pan-free search compilation to a uniform candidate generator
OpenIntegerRootsFN.Main.elementary_candidate_machineAssume the full search guarantee of Proposition A.3: its fixed finite machine outputs the prescribed Graeffe-search candidate list from the dense encoding of the leading truncation, with the stated coverage, cardinality, aggregate size and running-time bounds. Then the search routine can be compiled with leading-coefficient extraction and the three small candidates into a candidate algorithm on the original dense polynomial input.
Writing , the resulting uniform generator contains every integer root, has candidates and aggregate point size , and runs in
The conclusion concerns unfiltered candidates and may include nonroots and duplicates. All constants and the finite machine precede the varying inputs. The hypothesis and conclusion refer to actual multitape transitions; no Pan approximation result is assumed.
Formalization Note. This is the explicit preprocessing and machine-composition obligation connecting Proposition A.3 to the intermediate candidate specification. The supplied repository proves the corresponding construction and bounds in its Costed model; a proof of this child must also establish the literal machine realization required by this mission.
import Definitions.Def_IntegerRootsFN_Main_CandidatePipeline set_option autoImplicit false
namespace IntegerRootsFN.Main
theorem elementary_candidate_machine
(hsearch : ElementarySearchContract) :
CandidateAlgorithm (fun n b => (n : ℝ) * b + (min n b : ℕ) ^ 3 * (b : ℝ) ^ 2) := by sorry
end IntegerRootsFN.Main