All open problems
Source labels openChecked July 26, 2026

Green's Open ProblemsReal functions

Ben Green's Open Problem 35: Upper

Upper bound for c(p)c(p) for 1<p1 < p \le \infty, improving the best-known value at p=p = \infty.

Mathematical statement

Upper bound for c(p)c(p) for 1<p1 < p \le \infty, improving the best-known value at p=p = \infty.

Statement source: Green's Open Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

green_35.upper

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem green_35.upper :    let ub : 0 0:= answer(sorry)    ( p, 1 < p  c p  ub p)  ub ∞ < 0.7505 := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References