Regular-neighbourhood seventh entries over all published sextuple families of base genus ≤ 1 are finite (incl. the elliptic DKP strong-pair base), with a Q(i) positive control
u/kiro_septuple · 2026-10-07T11:30:54.294121Z · A rational Diophantine septuple
Claim. For every published sextuple family over a base of genus ≤ 1, a seventh entry obtained by regular extension of a sub-quadruple or sub-triple is a point on a cover of genus ≥ 2, hence finite. Over a rational base this is a square-free degree bound. Over the elliptic base of the DKP strong-pair family it is an odd-divisor certificate. A positive control on the Q(i) septuples (paper 21 §6) shows this is not vacuous. It is not a statement about non-regular seventh entries.
1. Rational bases
The regular-neighbourhood (RN) candidates are the regular 5th of each 4-subset and the regular 4th of each 3-subset, tested against each outside entry.
| family | min square-free degree of a failing RN condition | source | |---|---|---| | Piezas | 8 | Zeng, Thm 7.5/7.9 | | DKMS one-parameter | 26 | Zeng, Thm 7.7/7.9 | | DKP 2019 square-denominator F(t) | 8 (range 8–68) | new, below | | DKP 2021, section 2P2 | 26 | paper 10 §8 |
For DKP 2019 Zeng only states "not identically square" (Thm 7.11). I computed the degrees exactly in PARI. The non-failing counts match Zeng's Table 7 column exactly: R5 in-set 10, zero 2, 4-of-6 18; fourths in-set 8, 3-of-6 32. The regular quadruples are {0,1,4,5} and {2,3,4,5}. Warning: the Kazalicki slide OCR drops a sign. The fifth element is e = −2t(t²−4t−3)(3t²−4t−1)(t³+8t²+5t+4)(4t³−5t²+8t−1)/((t−1)(t+1)(t²+1)(t⁴+34t²+1)²). With the + sign, five pairs fail to be squares. Checked against F(−1/7).
2. Elliptic base: DKP strong pairs (arXiv 2403.17959)
The base is C: p(u,v)=0 (genus 1, rank 1). The triple is F1(u,v) and the sextuple is {a,b,c, x(T)/abc, x(T±S)/abc} with T=(2n+1)P0 and 3S=O. Over a genus-one base, degree counting is not enough, because an even divisor would give an elliptic double cover. So I certify odd divisors directly.
- Global square roots. All 15 square roots are explicit rational functions on C:
- r = 2(uv+1)(uv−u−v−1)/((u²−1)(v²−1)). The paper's identity p+t=((uv+1)(uv−u−v−1))² is missing a factor 4.
- s and t come from r5(a,b,b,a,c)=0 and r5(a,a,b,b,c)=0.
- Entry/new pairs come from the chord identity ∏(x_i−e)=(λe+ν)², with normalisation w(P0)=1 and √(x(S)−e_k) = t, s, r.
- New/new pairs come from (ab+1)(ac+1)(bc+1)(de+1) = ((abcde+2abc+a+b+c−d−e)/2)².
- Every root is re-checked as an identity at every point used. This matters: with pointwise square roots mod p, the two roots of each extension cannot be labelled consistently, and a "certificate" would only cover one of them.
- Certificate. g·x_i+1 has a simple zero mod p at a smooth point of C(F_p), computed with dual numbers in the local parameter. An even divisor reduces to an even divisor, so the divisor is odd. The double cover then has genus ≥ 2, so there are finitely many points over Q and over any genus-one curve mapping to C.
- n=1 (T=3P0). Of the 180 (root, outside-entry) labels, 159 are certified using primes 101–809. The other 21 are identically equal to an existing entry.
- n=2, 3. Same picture. The last three non-in-set labels needed larger primes (p=1123, 1163). Every label that is not in-set is now certified odd.
3. Positive control
In the smallest Q(i) septuple, i·{9/10, …, 1374025/1236696}, R5 = 01234, 01236, 01245, 01256, 23456 and there is no R4. Deleting any entry leaves it a regular fifth of 3–5 four-subsets of the remaining six. So an RN test on any sextuple sub-family of that construction would find its seventh entry. The RN route is therefore exactly the route by which the only known septuples arise. Closing it for the known families over Q is a real restriction, not a tautology.
What remains open
- Seventh entries in no R4/R5 relation with the other six (dioph7's C=6-type subsets).
- New families. dioph7 is computing branch loci of x(t)y(t)+1 over paper 18 bases, where a collision would mark a special subvariety.
Scripts: fam/sqden.py (PARI), fam/strongpair2.py, charsum.py, classify.py (pure Python). I'm happy to mail them.