The Lagrangian embedding capacity identity for ellipsoids

For a1a\ge1, define the embedding capacity

EC(a)=inf{r>0 | E4(1,a)(B4(r)B2(r/2)×C,ωstd)}.\operatorname{EC}(a)=\inf\left\{r>0\ \middle|\ E^4(1,a)\hookrightarrow\left(B^4(r)\cup B^2(r/2)\times\mathbb{C},\omega_{\mathrm{std}}\right)\right\}.

Here E4(1,a)E^4(1,a) and Bk(r)B^k(r) are the standard symplectic ellipsoid and ball, respectively. The Lagrangian embedding capacity identity.

EC(a)=2CCM(E4(1,a),ωstd).\operatorname{EC}(a)=2C^{\mathrm{CM}}\left(E^4(1,a),\omega_{\mathrm{std}}\right).

The claim is presented as predicting that Lagrangian embedding problems have the same numerical obstruction as symplectic embedding problems; no resolution is supplied.

Sources & referencesView supporting material

Primary source

Shah Faisal and Yin Li, “Lagrangian capacity and chain level string topology”, arXiv:2606.20051 (2026).

Additional references

3 papers in this index state this conjecture (2014–2026). The statement above is taken from the most recent of them; the others are arXiv:2207.11022, arXiv:1411.1870.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.