Mathematics Projection Multiplicity Method Certificate Gives Polynomial Gain

The projection certificate

Projection multiplicity is a method for attacking extremal problems, questions that ask how large a set can be before some relation forces a limit. The classical example is the Erdős unit-distance problem: how many pairs of points in the plane can be exactly one unit apart? The method works by lifting the visible problem onto a richer carrier, a larger space with extra structure, and then projecting the results back down. The point is that a high-rank carrier can hold many distinct events that all project to the same low-dimensional answer, so counting visible objects alone underestimates what is possible.

The machine-checked library of formal theorems records the abstract shape of this lift-return proof. A classical extremal problem is defined by its visible objects, a relation between them, a size function, and an event count. A lift adds a carrier space, a projection map back to the visible objects, a carrier relation, and an energy function. A finite window in the carrier then certifies that carrier events project to valid visible events and that the projected event count beats linear growth by a fixed exponent δ. The formal theorem certificate_gives_polynomial_gain states that any certificate satisfying these conditions yields a polynomial gain: there exists a positive δ such that the event count grows at least as fast as the visible size raised to the power 1+δ.

This is a structural result, not a proof of any particular extremal bound. The theorem does not establish the Erdős unit-distance problem itself, nor does it provide the OpenAI/Sawin proof of it. What it does is name the method so future classical problems can be checked for the same failure mode: visible-dimensional counting can be beaten when a high-rank carrier has many distinct events that project to the same low-dimensional invariant. The framework models this as a candidate structure with four tests: a hidden carrier exists, the visible relation is a projection, fibers can grow, and the carrier geometry stays controlled. A problem passes all four before a full attack is worth starting.

The practical consequence is a diagnostic rule. When a classical extremal problem seems stuck, the framework suggests asking whether its relation can be expressed as the projection of a richer carrier relation, and whether the event count is controlled by fiber multiplicity rather than by visible dimension alone. That question is now a formal object with a proved payoff condition, so a mathematician can check a problem against the certificate shape and know in advance whether the method can deliver a polynomial gain.

/-- The formal output of the method: the lifted carrier gives a visible
polynomial gain. -/
theorem certificate_gives_polynomial_gain
    (C : ProjectionMultiplicityCertificate.{u, v}) :
    ∃ δ : ℝ, 0 < δ ∧ BeatsLinearBy C.visibleSize C.eventCount δ :=
  ⟨C.delta, C.delta_pos, C.polynomial_gain⟩

/-- The formal output of the method: the lifted carrier gives a visible
polynomial gain. -/
theorem certificate_gives_polynomial_gain
    (C : ProjectionMultiplicityCertificate.{u, v}) :
    ∃ δ : ℝ, 0 < δ ∧ BeatsLinearBy C.visibleSize C.eventCount δ :=
  ⟨C.delta, C.delta_pos, C.polynomial_gain⟩

/-- A classical extremal problem consists of visible objects, a relation whose
instances are counted, and two numerical readouts: visible size and event count. -/
structure ClassicalExtremalProblem where
  Visible : Type u
  relation : Visible → Visible → Prop
  size : Finset Visible → ℝ
  eventCount : Finset (Visible × Visible) → ℝ

/-- Diagnostic predicate for the rule we missed.  A problem should be checked
for projection multiplicity when its visible relation can be expressed as the
projection of a carrier relation and the event count is controlled by fiber
multiplicity rather than by visible dimension alone. -/
structure ProjectionMultiplicityCandidate where
  has_hidden_carrier : Prop
  visible_relation_is_projected : Prop
  fibers_can_grow : Prop
  carrier_geometry_stays_controlled : Prop

What this page does not claim

The theorem does not prove any specific bound for the Erdős unit-distance problem. The theorem does not formalize the OpenAI/Sawin proof of the Erdős unit-distance problem. The candidate tests are necessary conditions, not sufficient ones for a successful attack.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Mathematics/ProjectionMultiplicityMethod.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: