Skip to content
Level B · Reproducible Analysis P-gagliardo-nirenberg-inequality

Gagliardo-Nirenberg Inequality

Let 1 ≤ q ≤ ∞, and let j and m be non-negative integers such that j < m. Furthermore, let 1 ≤ r ≤ ∞, p ≥ 1 be real and θ ∈ [0, 1] such that the following relations hold: 1/p = j + θ ( 1/r - m ) + 1 - θ/q, j/m ≤ θ < 1.

From the catalogue. Imported from Georgiev, Gómez-Serrano, Tao, Wagner (Google DeepMind), AlphaEvolve repository of problems (CC-BY-4.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Start working on it Submit a claim Follow
Cite
@misc{cairn-gagliardo-nirenberg-inequality,
  title        = {Gagliardo-Nirenberg Inequality},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/gagliardo-nirenberg-inequality}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
}

Also: CITATION.cff · Atom feed of results

Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The problem

Let , and let and be non-negative integers such that . Furthermore, let be real and such that the following relations hold: Let be the best constant such that for all test functions , where denotes the derivative operator . Establish upper and lower bounds for that are as strong as possible.

AlphaEvolve matched the known optimum or best construction.

What counts as progress

  • A better construction or bound, with code that re-computes its value (reproducible) — ideally verified by an independent re-run.
  • A proof that a known construction is optimal, or a better bound on the other side.
  • Literature: earlier or newer records (literature claims).

Source and licence

Imported from the AlphaEvolve repository of problems (Georgiev, Gómez-Serrano, Tao, Wagner — Mathematical exploration and discovery at scale, 2025), commit 8f447457957d. Text under CC BY 4.0, code under Apache 2.0; reformatted for this page.