By @josebrox
# A reconstructed 193-variable quartic The [complete manuscript](../papers/quartic/quartic193_20261117_v74.tex) and [exact polynomial package](../computation/quartic/seven_units193_v74) give a quartic family with **193 total variables, including the input**, under exactly the retained arithmetic premises of the published v73 construction. Both main presentations are sums of **167 primitive integral quadratic squares**, have degree exactly four and integer content one, and involve every coordinate. The interrupted 193-variable working files were unavailable. This result is reconstructed from the published v73 source at commit `ba18b9ffcf166856b4f2f921d560bb6497eec1ab`; it does not claim byte-for-byte recovery of the lost checkpoint. ## Exact polynomial data Put `C=149^N`, where `N>=1` is a fixed integer coefficient parameter. The two main expanded tables are: | Presentation | Coordinate monomials | Parameter-separated terms | Exact height | |---|---:|---:|---| | [Primitive reference basis](../computation/quartic/seven_units193_v74/compact/polynomial-family.json) | 2,770 | 2,775 | `max(K,149^(2N+2))` | | [Fewer monomials](../computation/quartic/seven_units193_v74/compact_fewer_monomials/polynomial-family.json) | 2,626 | 2,631 | `max(L,149^(2N+2))` | ```text K = 126616122944180358034867798936 L = 484991541504995159662206970923766531374664106904986910720 ``` The coefficient crossovers occur at `N=6` and `N=13`, respectively. **These are not sufficient defining thresholds.** Under the source premises every sufficiently large fixed `N` defines the integers, but no sufficient numerical value is known. The separately specified 229-variable polynomial remains the effective construction. The parameter-separated expansion records coefficients times `C^j` and a coordinate monomial. After fixing `N`, coefficients with the same coordinate monomial are combined. Every stated coordinate-monomial count is exact for all `N>=1`; the only coefficient with summands of opposite signs is `289*(C^2-2)`, which never vanishes in this range. ## The reduction from 194 to 193 The old unit coordinate storing `1/u` is redundant. Retain ```text u, v, 1/v, 1/(u*v^2), 1/v^3, u/v, 1/(u*v). ``` Five quadratic equations define these seven values uniquely from nonzero `u,v`. In particular, `v*(1/v)=1` forces the first inverse to be nonzero, and `u*(1/(u*v))=1/v` then forces `u` to be nonzero. The omitted value is recovered as `v*(1/(u*v))`. There is no added boundary component at a zero denominator. The new Laurent certificate rescales the other 186 storage coordinates by specified integer powers of `u,v`, fixing the input. Its 804 support checks put every term in degree at most two. An independent transfer checker compares **all 162 physical component equations** with v73, in each reference basis; they are identical. All scalar, elliptic, contact, trace and pole equations and all factor assignments are retained. This is an exact bijection of complete rational zero sets. The arithmetic soundness and completeness proof therefore transfers, with the same sufficient parameter threshold and no additional arithmetic hypothesis. The full manuscript reproduces that proof, including synchronized formal depths and zero-ordinate strata. ## The improved coefficient bound In final coordinate numbering, substitute `old X_i=new X_i/C` at exactly ```text 44,45,46,47,52,53,54,55,56,57,99,100. ``` Divide each row by its smallest parameter power. All resulting quadratic rows have integer coefficients and parameter degree at most one. Their sum of squares has parameter degree two, reducing the former height term `128*C^4` to `22201*C^2=149^(2N+2)`. The exact proof applies for every real `C>=149`. Write `J=K` for the first basis and `J=L` for the second. The largest constant coefficient is `J`; the largest pure quadratic coefficient is `22201`. The largest pure linear coefficient is `384444691473074`, whose square is at most `22201*J`. Four remaining coefficients are `A+C^2` with `22201*A<=22200*J`; the last is `289*C^2-578`. The first of the four positive constants `A` differs between the bases, as recorded in the manuscript and independent review. These inequalities bound every coefficient by the stated maximum, and pure coefficients attain it. The independent checker also verifies a finite-and-tail certificate using integer binomial coefficients. ## Verification and scope Run from the repository root: ```sh python -B scripts/verify_v74.py python -B scripts/verify_v73.py python -B scripts/verify.py --full ``` The new gate rebuilds the tables in a temporary directory and compares them byte-for-byte. It verifies both physical equation reconstructions, both parameter rescalings, all expanded coefficients, support, exact heights, unit guards, coordinate counts, source bindings and the manuscript build receipt. A [separate mathematical review](../computation/quartic/seven_units193_v74/independent_review.md) checks the entire unit zero set, the invertible transfers, the compact row pullbacks and coefficient expansions. The older v73 gate continues checking its complete original record, now retained under `superseded_constructions`; none of its arithmetic or coefficient checks is removed. These certificates verify the stated finite computations and exact algebraic transfers. They do not independently reprove the retained elliptic, modular-height, prime-pattern or pole-realization inputs. A sufficient numerical parameter and the global **21/9 rational-realization targets remain unproved**.