OpenFrontiers
← Back to the index
OP-6962Status unassessedNumber theory

Weak form of Hall's conjecture

TheoremDB P8934 · Candidate awaiting source review

Inferred from the community field; finer classification has not been reviewed.

Source candidate · not reviewedAs of 2026-09-08Source & evidence ↓

Problem statement

Let ε>0\varepsilon > 0 be a real number. A pair of real numbers (C,e)(C, e) with C>0C > 0 is said to satisfy the Hall inequality if for all integers xx and yy with y2≠x3y^2 \neq x^3,

∣y2−x3∣>C⋅∣x∣e.|y^2 - x^3| > C \cdot |x|^e.

The Hall conjecture with exponent ee holds if there exists C>0C > 0 such that (C,e)(C, e) satisfies the Hall inequality. Prove that for every ε>0\varepsilon > 0, the Hall conjecture with exponent 12−ε\frac{1}{2} - \varepsilon holds.

Lean 4

No Lean submitted

Formal statement

Lean 4
theorem weak_hall_conjecture (ε : ℝ) (hε : ε > 0) : HallConjectureExp (2⁻¹ - ε)

On-site verification needs an executable Lean target. None is attached yet.

A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.

Proofs & verification

No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Open. No signed Lean verification is attached to this problem or its selected resolution.

This record is in the source backlog; its novelty and unresolved status have not passed source review.

References
  1. [1]TheoremDB P8934 link
  2. [2]Source formal statement (not locally verified) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.