By @josebrox

613b16a / docs/results_20261117_v75.md

Raw
# Even valuations, seven contacts and exact physical lifting

The complete defining counts remain **25** under the retained arithmetic premises and **11** under ordinary rational abc with those premises. The new even-valuation argument improves their degree upper bounds. The reconstructed **193-variable quartic** remains unchanged; its complete proof and exact expanded tables are in the [v74 guide](results_20261117_v74.md).

| Complete family | Previous degree bound | New degree bound | Support bound |
|---|---:|---:|---:|
| General, 25 total variables | 4,924,857,429,000,192 | **4,863,007,848,923,136** | strictly below `2^1192` |
| Ordinary abc, 11 total variables | 232,094,337 | **230,932,097** | strictly below `2^264` |

These are bounds for exact finite integer-circuit specifications, not claimed exact degrees of expanded polynomials. Both families have integer content one. Their sufficient fixed parameters remain ineffective: the stored `L=3` and `B=3` members are algebraic fixtures, not certified defining members.

The [result records](../data/results_20261117_v75.json) distinguish these complete families from the [research criteria](../data/criteria_20261117_v75.json). **Neither a complete 21-variable definition nor a complete 9-variable definition is proved.** The new lifting and curve calculations retain the actual elliptic functions; they do not replace the missing global realization theorem.

## 1. The even-valuation lemma

The curve is

```math
E:y^2=x^3-Dx,\qquad D=11-6\sqrt2,\qquad N(D)=49.
```

At an integer-valued valuation with `v(D)=0`, a nonzero abscissa has even valuation. If `m=v(x)>0`, then `2v(y)=m`. If `m<0`, then `2v(y)=3m`. The case `m=0` is immediate. This covers every guarded affine point, including the full auxiliary domain, without assuming that its abscissa is a global square.

Outside the retained exceptional primes 2 and 7, it applies to all reciprocal-abscissa tests and their conjugates. No new exceptional prime is introduced.

### The derivative source

For the first four tests, replace the old balancing by

```math
D_i=\frac{C_i}{1+uC_i}\quad(1\le i\le4).
```

The two comparison tests retain `C_i^2/(1+u*C_i^2)`. If `nu=v(u)` is odd and `m=v(C_i)` is even, then `nu+m` cannot vanish and

```math
v(D_i)=m-\min(0,\nu+m)=\max(m,-\nu).
```

This preserves the positive-odd extraction and automatically controls new negative odd valuations of the physical weight. The implementation uses direct inverse-abscissa formulas, while the native checker evaluates the distinct displayed rational expression. The original denominator and norm guards are equivalent on the retained domain.

The complete witness construction still uses its original `2E(K)` subfamily inside the enlarged auxiliary domain. Its points and differences have positive abscissae at every prepared real character. Thus all required real and whole-character guards survive. The finite algebra retains rank 128, 32 recorded guards and 38 norm factors; the revised circuit has 1,865 arithmetic nodes.

- [Complete proof](../papers/conditional_few_variables/even_valuation_detector_20261117_v75.tex).
- [Source, specification and independent checks](../computation/few_variables/even_valuation11_v75).
- [Separate mathematical review](../computation/few_variables/even_valuation11_v75/independent_review.md).

### The general source

The first ten field tests are reciprocal abscissae. Their factors can use `C_i` in place of `C_i^2`, while every other field test, scalar factor, weight, pole block and guard is retained. At an odd weight valuation `alpha`, the revised factor still has distinct summand valuations. Successful extraction gives the stronger inequality

```math
v(C_i)>\alpha/2\qquad(1\le i\le10),
```

which implies the former `alpha/4` bound. At selected contacts, the reciprocal tests have valuation at least two and the new factors remain one modulo the successful place. The opposite-slot and fixed-place arguments, and the original whole-character real witnesses, transfer.

The revised circuit has 6,039 arithmetic nodes, 101 recorded guards and 128 norm factors. Its rank remains 1,048,576. The computed encoder degree bound is

```math
1048576(4637555553+170132+1)=4863007848923136.
```

The numerical bound concerns the compiled unnormalized native-pole family. The same parity change also preserves the normalized actual-trace source's soundness in 21 coordinates; it supplies no simultaneous rational squares.

- [Complete proof](../papers/few_variables25/even_valuation25_20261117_v75.tex).
- [Source, specification and independent checks](../computation/few_variables/even_valuation25_v75).
- [Separate mathematical review](../computation/few_variables/even_valuation25_v75/independent_review.md).

## 2. Seven contacts with a larger scale

The derivative construction can use the shifts

```text
{-7,-6,-4,1,3,5,8}
```

with `a=M^8`, signed height argument `t=M^16-z^2`, and

```math
F(a,z)=\prod_c((a+c)^2-z^2),\qquad u=-\frac{14F}{F_a}.
```

The derivative is taken before specializing the scale. The shifts are distinct and nonzero, sum to zero, and have no opposite pair. Their differences and nonzero pair sums introduce no prime outside the existing exceptional set. Fourteen selected prime positions replace eighteen. The physical weight has degree seven in the squared slope, with denominator degree six.

The retained one-variable abc height theorem and signed-power bound give the strictly positive margin

```math
\frac{97}{200}-\frac{501}{2995}
 \left(\frac{201}{100}+\frac{1001}{1994}\right)
 =\frac{38695561}{597203000}>0.
```

All extraction, fixed-place preparation, selected-contact and real whole-character arguments transfer. The complete 11-variable degree bound is 357,309,057 with the original balancing, or 356,146,817 with the even-valuation balancing. Both exceed the nine-contact record above. Their purpose is to reduce the physical lifting degree.

The [seven-contact proof](../papers/conditional_few_variables/seven_contact_detector_20261117_v74.tex), [exact source](../computation/few_variables/seven_contact11_v74), and [independent review](../computation/few_variables/seven_contact11_v74/independent_review.md) include the argument and all guards. The nine-coordinate version remains sound, with global actual-trace realization still required for completeness.

## 3. Actual halfpoint covers of genus twelve

The full auxiliary domain admits the exact fixture

```math
X=1,\quad B=3,\quad A=P,\quad H=U=P/2=(1+\sqrt2,2\sqrt2).
```

The six actual tests are `c,c,conjugate(c),conjugate(c),0,0`, where `c=sqrt(2)-1`. This is a calculation at actual elliptic points, not an independently chosen trace.

For the even-valuation balancing put

```math
\begin{aligned}
D(u)&=u^2(1-2u-u^2)^2,\\
R(u)&=D(u)+2u^3+4u^2+6u+1,\\
\Pi(u)&=4D(u)^4(1+u)^2+2uR(u)^2(R(u)^2-D(u)^2).
\end{aligned}
```

The detector identities are `W=(R/D)^2` and `V=2D^2/R^2`. After clearing a square denominator, the actual trace test becomes `Y0^2=Pi(u)`. The polynomial has degree 26 and is squarefree, hence the weight curve has genus 12.

The original balancing gives a different genus-12 polynomial, with `D=u^2(u^2+6u+1)^2` and `R=D+2u^3+12u^2+34u+1`. For each physical contact map, the checkers reconstruct the primitive integer numerator and denominator independently and form the homogeneous composition exactly.

| Actual fixture | Weight genus | Squared-slope genus | Twisted squared-slope genus | Physical-slope genus |
|---|---:|---:|---:|---:|
| Seven contacts, original balancing | 12 | 90 | 91 | 181 |
| Seven contacts, even balancing | 12 | 90 | 91 | 181 |
| Nine contacts, even balancing | 12 | 116 | 117 | 233 |

Degree-preserving reductions and explicit Bezout identities modulo 53 prove the required squarefreeness. These are **squarefreeness certificates**, not the lost interrupted test case's modulo-53 nonlifting certificate.

A rational weight point must still solve the degree-seven or degree-nine physical equation, yield a rational-square squared slope, and pass every original, whole-character and preparation guard. No admissible rational point or physical lift is asserted by these calculations. The boundary points at zero or infinity do not supply guarded witnesses.

- [Original balancing coefficients and independent reconstruction](../computation/pole_parameters/halfpoint_trace_v74).
- [Even balancing coefficients and both physical maps](../computation/pole_parameters/even_halfpoint_trace_v75).

## 4. A common slope from the coupled physical weights

Fix the general source's nonzero rational scalar `rho` and positive rational scale `a`. With its ten positive rational contacts and `P(t)` their monic product, the physical pair is

```math
u_0(\lambda)=\rho\frac{P(\lambda)}{(\lambda+1)^{10}},\qquad
u_1(\lambda)=\rho\frac{P(a\lambda-4)}{(a\lambda+2)^{10}}.
```

The [coupled-weight theorem](../papers/pole_parameters/coupled_weight_lifting_20261117_v74.tex) proves

```math
\mathbf Q(u_0,u_1)=\mathbf Q(\lambda)
=\mathbf Q\left(\frac{u_0}{(1+u_0)^2},\frac{u_1}{(1+u_1)^2}\right).
```

For distinct poles, a nontrivial common composition would be a power map in a coordinate sending the two poles to zero and infinity. The positive rational contact set rules out every power of degree greater than one. At the coincident scale `a=2`, an exact derivative-coprimality certificate proves the same conclusion. The normalized result uses the reciprocal quadratic branches and the incompatibility of a single pole of order ten with ten simple zeros under a fractional linear transformation.

For a proposed rational pair `(v0,v1)`, take the polynomial gcd of

```math
\rho P(t)-v_0(t+1)^{10},\qquad
\rho P(at-4)-v_1(at+2)^{10}.
```

A linear gcd gives the unique finite rational lift, subject to the original poles. A constant gcd rejects the pair. A higher-degree exceptional gcd requires rational-root testing; birationality does not by itself resolve every special fiber. The normalized pair has an equally exact degree-at-most-20 test, or can be lifted through at most four reciprocal branch pairs.

The [exact package](../computation/pole_parameters/general21_recovery_v74) includes independent modular Bezout verification, positive lift fixtures and mismatched-pair rejection. Its example scalar and scale are algebraic tests, not prepared elliptic witnesses. The physical scalar is fixed by the input and coefficient parameter, and `a=1+rho*T^2` is determined by the root points; neither is an extra free coordinate.

## 5. Reproduction and remaining scope

From the repository root run:

```sh
python -B scripts/verify_v75.py
python -B scripts/verify_v74.py
python -B scripts/verify_v72.py
python -B scripts/verify_v71.py
python -B scripts/verify.py --full
```

The new gate rebuilds all six packages in an isolated tree, reruns the separate mathematical and coefficient checkers, and compares their saved JSON files byte-for-byte. It also binds the four rendered manuscripts and independent reviews. The previous 25- and 11-variable records remain under `superseded_constructions`; their historical gates still verify their original full records.

The 21-variable target still needs simultaneous rational square realization at both actual detector traces. The 9-variable target still needs a guarded rational square at its actual trace, together with a rational physical slope, for every sufficiently large positive integer at one fixed sufficient coefficient shift. Local preparation, rationality of a free conic, a rational weight point, and a generic lifting theorem are not that global existence statement.

The inherited arithmetic foundations have not acquired a complete independent audit in this release. The interrupted modulo-53 lift fixture was not recovered and is not used as evidence. All present finite computational claims have their own reproducible certificates.