By @josebrox

613b16a / docs/results_20261117_v71.md

Raw
# Full auxiliary elliptic points

The [complete eleven-variable family](../papers/conditional_few_variables/full_auxiliary11_20261117_v71.tex) has degree at most **232,094,337**, integer content one and fewer than `2²⁶⁴` monomials. It assumes ordinary rational abc and the group, formal-comparison, prime-pattern, trace-height and intrinsic-pole inputs retained by the derivative construction. The fixed odd shift must be sufficiently large; its sufficient threshold is ineffective.

The root point remains in `2E(K)`. The two auxiliary points range over all guarded affine points of `E(K)`, using cubic point radicands. Their indices relative to the retained generator lie in half-integers. At every consumed odd prime these indices are integral locally, and the adjacent reference indices still differ by one. The formal comparison therefore recovers the same integral root index.

For completeness, the square-abscissa auxiliary charts map into the cubic charts by `h = g²`, `j = gk`. The nonzero abscissa makes this a bijection of all geometric point characters at each former witness. It preserves every point, quotient and detector value. Thus the earlier complete integer witnesses and all character guards remain available.

## Exact specification

The [computation package](../computation/few_variables/full_auxiliary11_v71) contains the family builder, independent verifier, dependency hashes and complete integer circuit. Its stored `B=3` member is an algebraic fixture, not a certified defining member.

| Quantity | Certified value |
| --- | ---: |
| Total variables, including input | 11 |
| Total degree upper bound | 232,094,337 |
| Finite algebra rank | 128 |
| Integer arithmetic nodes | 1,990 |
| Recorded native guards | 32 |
| Retained subalgebra norm factors | 38 |
| Coefficient L1 norm bound at B = 3 | `2^487256960` |

The coefficient norm bound is computed separately for each fixed parameter. The degree and support bounds are uniform. No fully expanded polynomial with hundreds of millions of possible degrees is claimed to be stored; the integer circuit and finite determinant specify every coefficient.

## Nine-variable arithmetic target

The same auxiliary enlargement preserves soundness of the nine-coordinate actual-trace source. It retains its root, derivative contact equation, square condition and all guards, while permitting half-integral auxiliary indices. Completeness still requires rational realization of the actual square equation for every sufficiently large positive integer at one fixed defining shift. The eleven-variable completeness proof uses the two intrinsic pole parameters and does not prove this additional assertion.

The established variable counts remain 25 and 11 for unrestricted degree, 195 and 68 for quartics, and 229 for the fully specified quartic. The targets 21 and 9 and the general number-field detector remain unresolved.

## Verification

Run from the repository root:

```sh
python -B scripts/verify_v71.py --report /tmp/v71-verification.json
python -B scripts/verify.py --full --receipt /tmp/v71-legacy-verification.json
```

The version gate regenerates the integer circuit and specification byte for byte, then independently checks the multiplication table, primitive characteristic polynomial and discriminant, cubic point identity, coefficient estimates, guard and subalgebra supports, degree bounds and final-root allowance. Chord-and-tangent calculations verify 384 geometric character evaluations on actual half-index auxiliary points. These checks do not independently prove the imported arithmetic foundations.

The [mathematical review](../computation/few_variables/full_auxiliary11_v71/independent_review.md) records the local proof and completeness audit. The [build receipt](../data/audits/tex_build_20261117_v71.json) records two clean TeX passes and inspection of all four rendered pages. Earlier numerical certificates remain reproducibility dependencies; the main README displays the current defining bounds.