By @josebrox

613b16a / docs/results_20261117_v66.md

Raw
# Local detector factors and elliptic point-role restrictions

The complete construction records remain in [the current table](../data/results_20261117_v65.json): 25 general variables, 11 under ordinary abc, quartics in 195 and 68 variables respectively, and a fully specified quartic in 229 variables at `N=15`. All counts include the input and retain the arithmetic premises stated in their papers. No 21- or 9-variable definition is established by the results below.

## Local factors for the general quartics

The [five-factor theorem](../papers/quartic/revised_detector_factors_20261117_v66.tex) uses squared reciprocal-abscissa tests in a revised detector. For every negative odd contact-weight valuation `v(q)=-mu`, the factors have distinct minimum term valuations. The inherited trace and pole equations then give

```math
v(C_2,C_3,C_4,G)>21\mu/8,\qquad
v(C_1)>3\mu/8,\qquad v(I)>7\mu/16.
```

Every finite reciprocal valuation is even; its strict lower bound is `mu/4`, `3mu/4` or `5mu/4`, depending on the assigned term. Thus all reciprocal depths are at least two, the three deep comparisons and Lucas residual have depth at least three, and the remaining comparisons have depth at least one. Zero tests are allowed.

At a prepared simple contact the successful factor product has residue one, the opposite inverse product has residue zero or one, and the actual reciprocal trace has residue one or two. Fixed-place limits retain the required depths at 2, 3 and 17. Every prepared real character has positive factors. These statements concern the actual detector and preserve the relevant arithmetic requirements. A smaller complete quadratic compilation remains open.

## Root-index and group-word restrictions

The [point-role theorem](../negative_results/papers/integer_labels/point_role_restrictions_20261117_v66.tex) starts from the exact general-source consequences

```math
n=216X^4+450459,\qquad
t^2-a(a-2)tb+(a-2)^2b^2=1,\qquad
\log|t|>|a|-3,
```

with `b!=0` and the scalar divisibility `p^3 | a-1` at every fresh simple scalar contact. For any fixed nonzero quadratic relation among `(n,a,t,b)`, a nonzero resultant bounds `|t|` polynomially in `|a|+|n|`. A finite collection of scalar primes excludes all identically zero specializations; an additional arbitrarily large contact prime gives the contradiction. Consequently every fixed finite menu of such quadratic relations omits infinitely many positive inputs in every fixed input progression.

On exact multiplication witnesses, two independent fixed group-word equations have the form `h B_i+A_i=0`. Eliminating `h` gives a quadratic root relation. The identically zero determinant cases reduce to an affine relation or a fixed reference point, both already excluded. This also handles fixed finite menus of independent pairs and does not depend on the original order of choosing the indices. It does not exclude different numerator-index families satisfying only the local comparison congruences.

The same paper proves individual scalar-reference and cross-root obstructions. It also establishes the shifted Lucas congruence

```math
j=6(a-2)r,\qquad h=\frac{U_j(a)}{(a-1)(a-2)},\qquad
b=(a-1)h,\qquad h\equiv-4r\pmod{a-1}.
```

This supplies the single relation `U_S=Z+H` and compatible finite congruences prescribed in advance. Completeness still requires simultaneous realization of the actual roots, trace scales, comparison primes, their reduction orders and the coupled real returns. No smaller defining-polynomial count is inferred from the congruence.

## Verification and references

Run `python -B scripts/verify_v66.py`. The [local-factor certificate](../computation/quartic/local_detector_factors_v66/certificate.json) checks the complete residue period, exact strict thresholds and selected-contact bounds. The [point-role certificate](../negative_results/computation/point_roles_v66/certificate.json) checks the universal conic and resultant identities, all degree-drop strata, scalar-contact squarefreeness, fixed-prime reductions and 282 exact Lucas specializations using two independent evaluations.

The papers prove the infinite statements. The finite checks do not certify the external arithmetic foundations or the remaining realization problems. [Metadata](../data/criteria_20261117_v66.json), [the integration receipt](../data/audits/integration_20261117_v66.json) and [the rendering receipt](../data/audits/tex_build_20261117_v66.json) state the scope. The [primary-source literature notes](literature_20261115.md) and [BibTeX entries](../data/literature_20261115.bib) include Sun's current version and the number-field height references.