Work

Condensation Failure D: tame Geometric Interfaces — What Pila–Wilkie Can and Cannot Give

Year: 2026
Type: preprint
Abstract: o-minimal geometry supplies a finitizing machine for the rational point counting problem: it compresses rational points of bounded height onto finitely manyalgebraic arcs, but the compression itself constitutes no decision on the existenceof points. This paper is organized around a row-by-row correspondence table ofthree things that can be given and three that cannot, each “can” paired with a“cannot” under the same parameters and carrying a counterexample or an absencestatement. The table is supported by two self-sufficient ledgers and two machinecheck side evidences. Self-sufficient ledger one is the dyadic valuation ledger forthe curve y = 2x on [0,1], whose rational points are exactly (0,1) and (1,2): ifk/n is reduced with n ≥ 2 and 1 ≤ k ≤ n−1 and 2k/n were rational, one derivesn·v2(a) = k while k is not a multiple of n, a contradiction. Self-sufficient ledger twois the sine identity ledger for y = xsin(πx), which carries all integer points (n,0)and so draws the boundary between “few” and “none”; the floating-point residualsof the first twelve integer points are registered under both the sine-factor caliberand the function-value caliber (upper bounds 4.9 × 10−15 and 5.4 × 10−14 respectively). Machine-check side evidence one is the hypotenuse-caliber enumeration ofprimitive Pythagorean triples on the circle x2 + y2 = 1: 47 triples for c ≤ 300 and158 for c ≤ 1000, whose linear growth reading, set against the constant two pointsof the transcendental arc, forms the minimal contrast of special-subvariety re-entry.Machine-check side evidence two is the cell grid sampling ledger: 41 × 41 = 1681balances, and the three points on the curve are grid-alignment artifacts admittedinto no decision. Following the Appendix E template, three void ledgers are registered: the total grid count 1600 → 1681, the counting caliber corrected from legsto hypotenuse (54/179 → 47/158), and the residual caliber re-registered from asingle caliber to a dual caliber. This paper does not touch the burden of proof ofthe Pila–Wilkie theorem, does not read sparsification as a decision, and does notupgrade the control of the transcendental part to a Diophantine closure. At theinterface level it registers a three-level stratification (mathematical, machine, governance) together with a machine-check level; six substitution prohibitions gatherthe accidents in which the ledgers of one level stand in for those of another; anda three-question test (parameters, registration, certificate) supplies the legality criterion for using the machine. The paper closes with four seals: a height bound isrequired before the machine may be started; “few” on the list must not be readas “none”; a geometric list is not an existence certificate; and ledgers of differentlevels do not substitute for one another.
Language: English
Open Access status: green
OpenAlex ID: W7236630174
Cites:
Cited by:
Related to: 9