Pith. sign in
theorem

erdos132_from_current_constructive_residual

proved
show as:
module
IndisputableMonolith.Mathematics.DistanceShellMultiplicity
domain
Mathematics
line
5666 · github
papers citing
none yet

plain-language theorem explainer

A constructive residual package (Conway thrackle endpoint-charge certificate plus convex-layer screening) implies the ordered-pair form of Erdős #132: every large enough finite planar set has two distinct sparse distance shells. Discrete geometers on the thrackle/multiplicity line would cite this reduction. The proof is a short term application that turns the endpoint-charge certificate into a Conway support bound and feeds both halves into the live Conway-plus-screening bridge.

Claim. Assume a Conway thrackle endpoint-charge certificate and a convex-layer screening bridge. Then Erdős problem #132 holds in ordered-pair normalization: for all sufficiently large $n$, every finite planar set $A$ with $|A|=n$ admits two distinct distances $r\neq s$ that are both sparse shells of $A$.

background

This module is the Recognition Science physicalization of Erdős problem #132. Classically a distance value is a shell in the pairwise Euclidean spectrum; here it is a two-body recognition-energy shell whose multiplicity is shell occupancy. The development works with ordered pairs for Lean simplicity: for a positive distance, ordered multiplicity is exactly twice the unordered multiplicity, so the classical threshold $\le n$ becomes $\le 2n$.

The target proposition asserts that eventually every $n$-point planar set has two distinct sparse shells. The hypothesis is the constructive current residual: the conjunction of a Conway thrackle endpoint-charge certificate with a convex-layer screening bridge. Companion commentary records that small and star Conway cases are already closed by finite bookkeeping, so only the large non-star Conway counting step remains on that side of the residual.

proof idea

Term-mode one-step reduction. From the first conjunct of the residual (the endpoint-charge certificate), apply the conversion lemma that produces a Conway support bound. Pass that bound together with the second conjunct (convex-layer screening) into the live bridge theorem that already concludes the ordered Erdős #132 statement from ordered Conway support plus convex-layer screening. No further case analysis is performed here.

why it matters

Closes the constructive residual path for the RS reading of Erdős #132: once endpoint charge and convex-layer screening are in hand, the ordered two-sparse-shells claim follows. In the framework, shell multiplicity is recognition-energy occupancy on planar two-body configurations, so the classical sparse-shell dichotomy becomes a statement about distinct low-occupancy energy shells. No downstream consumers are wired yet; the declaration is a terminal packaging theorem for the current live residual rather than an intermediate lemma in a longer chain. It sits beside the stronger shell-flux target (divergence of the number of sparse shells) without discharging that stronger claim.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.