By @josebrox

613b16a / docs/results_20261117_v73.md

Raw
# A quartic in 194 rational coordinates

The [194-coordinate theorem](../papers/quartic/quartic194_20261117_v73.tex) constructs an integer quartic whose rational input projection is exactly the integers for every sufficiently large fixed parameter, under its explicitly retained arithmetic premises. The count includes the input. The sufficient numerical parameter remains ineffective.

## Exact polynomial specification

Both presentations have 194 coordinates, 168 primitive integral quadratic residuals, total degree four and integer content one. They have the same rational zero set. The fixed coefficient parameter is `C = 149^N` and is not quantified.

| Presentation | Monomials | Exact coefficient height | Coefficient crossover |
| --- | ---: | --- | ---: |
| Primitive reference basis | 2,765 | `max(K, 128*149^(4N))` | `N = 4` |
| Fewer-monomial reference basis | 2,621 | `max(L, 128*149^(4N))` | `N = 7` |

```text
K = 126616122944180358034867798936
L = 484991541504995159662206970923766531374664106904986910720
```

These formulas and support counts hold for every integer `N ≥ 1`. The crossover values concern coefficients and do not specify a sufficient defining parameter. The primitive basis has smaller height for `N = 1,…,6`; both heights agree for `N ≥ 7`.

The [computation package](../computation/quartic/cleared_comparisons194_v73) supplies every coefficient of the two quadratic systems and their fully expanded quartic families as integer coefficient lists with powers of the fixed parameter. It also supplies all coordinate names, the complete Laurent transformation, the literal unit equations and the constant reference-row change.

## Arithmetic construction

Three numerator pairs use a translated point chart whose reciprocal abscissas are coordinates and whose difference abscissa is a quadratic expression. Four cross products replace alternate formal-parameter ratios. The input test is the numerator `N = S − beta*s_1`. A homogeneous Lucas circuit recovers the third and fourth primary ratios only where the local proof needs them.

At every consumed prime, the factor valuations have distinct residue classes, so the pole obstruction forces all required reciprocal and comparison tests to be positive at one conjugate valuation slot. The reciprocal tests then make the local ratio denominators nonzero. The recovered comparisons have depth at least three, the Lucas residual has depth at least three, and the input comparison has depth at least two. The global proof retains the original weaker input divisibility and its established height estimates.

For integer witnesses, the two formal depths must be synchronized. The retained prime-pattern separation allows extra prime-power congruences on the reference index without changing its annihilation, fixed-place or real conditions. Raising only the smaller depth gives equal depths at each selected contact. This is enough for the actual factors and actual pole inputs at their selected contact depth one. The argument does not assume that both adjacent reference indices can be made arbitrarily divisible by a prime.

The proof includes zero numerator ordinates and finite two-torsion differences. A vanishing denominator precludes a consumed prime; the resulting radical-one case is covered by the unchanged height argument. The scalar difference remains nontorsion through its retained primary and scalar quotient equations.

The six literal unit equations force all eight stored contact units to be nonzero before any Laurent inverse is taken. Thus the compiled system has an exact input-preserving inverse to the physical source. The two constant reference bases have the same rational zero set, and a sum of rational squares vanishes precisely when all its rows vanish.

## Verification

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

The version gate regenerates both families and compares every coefficient file byte for byte. An independent checker reconstructs 81 new physical component rows and 81 retained source rows, verifies all six unit equations and expands the 168 squares independently. Separate checks verify all 804 support terms, the exact factor allocation, the full valuation residue periods, the universal chart and Lucas identities, and the coefficient inequalities for every allowed parameter.

The coefficient of the input's fourth power is one. Every coordinate occurs. The only coefficient polynomial with coefficients of different signs is `289*(C^2 − 2)`, which is nonzero for every `C = 149^N`, `N ≥ 1`. Exact shifted-polynomial inequalities certify the stated maximum coefficients beyond the two crossovers.

The [review](../computation/quartic/cleared_comparisons194_v73/independent_review.md) records the mathematical and algebraic scope. The [TeX build receipt](../data/audits/tex_build_20261117_v73.json) records the document checks. The prime-pattern, pole-realization and height foundations remain explicitly retained; the finite computation does not certify them recursively.

## Remaining variable targets

The complete unrestricted-degree counts remain 25 under the retained premises and 11 under ordinary abc. Their degree bounds are 4,924,857,429,000,192 and 232,094,337, respectively. The corresponding 21- and 9-coordinate actual-trace sources still require global rational realization. The new quartic does not establish that missing realization.

The fully specified quartic remains the [229-coordinate polynomial](results_20261117_v68.md), with `N=15`, coefficient height `149^30` and 74,007 bytes in fully expanded plain text. The complete ordinary-abc quartic remains at [68 coordinates](results_20261117_v65.md).