Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Functional Analysis

232 missions · 139 completed

Missions

Open93Completed139All232
Probability·Captain: marwahaha

Nontrivial Markov Type Forces SuperreflexivityOpen Problem

Motivation

Markov type is a metric inequality for the displacement of reversible chains. The target connects this probabilistic control to the possibility of uniformly convex renorming. The pinned manuscript supplies the research context.

Setting

Chains are finite, stationary and reversible. A map sends their states into a complete real normed space, and the inequality compares n-step and one-step pth displacement moments.

Formalization target

The selected goal is OAI.MarkovSuperreflexivity.hasNontrivialMarkovType_iff_hasEquivalentUCNorm. Its central assertion is

Markov type>1⟺equivalent uniformly convex norm.\mathrm{Markov\ type}>1\quad\Longleftrightarrow\quad\mathrm{equivalent\ uniformly\ convex\ norm}.Markov type>1⟺equivalent uniformly convex norm.

The theorem states that for a real normed space X that is complete (a Banach space), X has nontrivial Markov type if and only if X admits an equivalent uniformly convex norm. Nontrivial Markov type means there exist p>1 and K>0 such that for every finite reversible Markov chain on m states {0,…,m−1}, with stationary probability vector π, nonnegative row-stochastic transition matrix P, and detailed balance π(s)P(s,t)=π(t)P(t,s), every map f from the states to X, and every n≥1, the expected value of ‖f(Z_n)−f(Z_0)‖^p along n-step paths, started from π, is at most K^p·n times the corresponding one-step expectation of ‖f(Z_1)−f(Z_0)‖^p. Having an equivalent uniformly convex norm means there is a seminorm q on X and constants a,b>0 with a‖x‖≤q(x)≤b‖x‖ for all x, such that for every ε in (0,2] there is δ>0 with q((x+y)/2)≤1−δ whenever q(x)≤1, q(y)≤1 and q(x−y)≥ε.

Significance and status

The exact target uses uniformly convex norms with two-sided equivalence constants. It is not phrased as a direct uniformly smooth norm construction. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The inequality is uniform over all finite chains and state maps, while the conclusion is one norm controlling all vectors of the Banach space.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, Nontrivial Markov Type Forces Superreflexivity, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Captain: marwahaha

The cotype–cotype conjecture under the approximation propertyOpen Problem

Motivation

Rademacher cotype measures how vector norms compare with random signed sums. The target relates cotype of a space and its dual to boundedness of the Rademacher projection. The pinned manuscript supplies the research context.

Setting

X is a nonzero real Banach space with the ordinary approximation property: finite-rank operators approximate the identity on each compact set, with no uniform operator-norm bound required.

Formalization target

The selected goal is OAI.Cotype.mainTarget_proved. Its central assertion is

K-convex(X)⟺finite cotype(X)∧finite cotype(X∗).K\text{-convex}(X)\quad\Longleftrightarrow\quad\mathrm{finite\ cotype}(X)\land\mathrm{finite\ cotype}(X^*).K-convex(X)⟺finite cotype(X)∧finite cotype(X∗).

The theorem states that, for every real Banach space X (a complete real normed space) that is nontrivial, the defined proposition MainTarget(X) holds. MainTarget(X) says: if X has the approximation property, then X is K-convex if and only if both X and its dual space of continuous linear functionals X →L[ℝ] ℝ have finite cotype. Here the approximation property means that for every compact set M ⊆ X and every δ > 0 there is a continuous linear operator S : X → X with finite-dimensional range such that ‖Sx − x‖ < δ for all x in M. On the discrete cube {±1}ⁿ (with sign false = +1 and true = −1), the L² norm of f : cube → X is the square root of the average of ‖f(ε)‖² over all ε. The moment of f at coordinate i is the average of ε_i f(ε), and the Rademacher projection of f is the function ε ↦ Σᵢ ε_i times the moment at i. X is K-convex if there is a constant K ≥ 0 such that, for every n and every f on the n-cube, the L² norm of the Rademacher projection of f is at most K times the L² norm of f. X has cotype q, for real q ≥ 2, if there is C ≥ 0 such that, for every n and all vectors x₁, …, xₙ in X, (Σ ‖xᵢ‖^q)^(1/q) ≤ C times the L² norm of ε ↦ Σ ε_i xᵢ. Finite cotype means cotype q for some such q.

Significance and status

The approximation property is a hypothesis inside MainTarget. The statement does not assert the equivalence without it; the cube normalization is the encoded average L² norm. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The two cotype exponents may differ, and ordinary approximation cannot be strengthened silently to bounded approximation.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, The cotype–cotype conjecture under the approximation property, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Captain: marwahaha

Lipschitz Equivalent Separable Banach Spaces Need Not Be Linearly IsomorphicOpen Problem

Motivation

A Banach norm supplies both linear and metric structure. A bi-Lipschitz equivalence controls distances, but the target asks for spaces whose linear structures cannot be identified. The pinned manuscript supplies the research context.

Setting

The two spaces are real, complete and separable. The obstruction uses the space of null sequences with values in the real Hilbert space ℓ².

Formalization target

The selected goal is OAI.LipschitzCounterexample.main. Its central assertion is

421∥s−t∥≤∥Ψ(s)−Ψ(t)∥≤7625∥s−t∥.\frac4{21}\|s-t\|\leq\|\Psi(s)-\Psi(t)\|\leq\frac{76}{25}\|s-t\|.214​∥s−t∥≤∥Ψ(s)−Ψ(t)∥≤2576​∥s−t∥.

The theorem states that the defined proposition MainClaim holds (it is admitted in the source, not proved here). MainClaim asserts that there exist two separable real Banach spaces X and Y, each given as a type with a norm, a real normed-space structure, completeness and separability, together with a bijection Ψ from X onto Y, such that Ψ is a bi-Lipschitz equivalence with explicit constants: for all s and t in X, (4/21)‖s−t‖ ≤ ‖Ψ(s)−Ψ(t)‖ ≤ (76/25)‖s−t‖. Moreover, there is no continuous linear equivalence (linear homeomorphism) between X and Y, so the two spaces are Lipschitz equivalent but not linearly isomorphic. In addition, there is a linear isometric embedding of C0L2 into X, where C0L2 is the space of continuous functions from the natural numbers to the real Hilbert space ℓ² that vanish at infinity. Finally, Y does not contain a linear copy of C0L2, meaning there is no bounded linear map T from C0L2 to Y and constant a>0 with a‖x‖ ≤ ‖T x‖ for every x in C0L2.

Significance and status

The goal includes the explicit distortion bounds, lack of continuous linear equivalence, an isometric copy of c0(ℓ²) in X, and absence of a bounded-below linear copy in Y. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

A global metric bijection must coexist with a linear embedding obstruction, so the counterexample cannot follow merely from nonlinearity of a particular map.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, Lipschitz Equivalent Separable Banach Spaces Need Not Be Linearly Isomorphic, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Captain: marwahaha

The Kirchberg–Rørdam character criterionOpen Problem

Motivation

Tensorial absorption is a structural regularity property of a C*-algebra. A criterion in the central-sequence algebra would detect it through asymptotically commuting elements. The pinned manuscript supplies the research context.

Setting

For a nontrivial separable unital C*-algebra A and a free ultrafilter, the central algebra is the commutant of A's diagonal copy inside its norm ultrapower.

Formalization target

The selected goal is OAI.KirchbergRordam.character_criterion. Its central assertion is

Char(Fω(A))=∅⟺A≅A⊗min⁡Z.\mathrm{Char}(F_\omega(A))=\varnothing\quad\Longleftrightarrow\quad A\cong A\otimes_{\min}\mathcal Z.Char(Fω​(A))=∅⟺A≅A⊗min​Z.

The theorem states that, for a nontrivial separable C*-algebra A (in the base universe Type) and a free ultrafilter ω on the natural numbers, meaning an ultrafilter that refines the cofinite filter, the norm central-sequence algebra of A has no characters if and only if A is isomorphic to its minimal (spatial) C*-tensor product with the Jiang–Su algebra. The norm ultrapower of A is the quotient of the C*-algebra of bounded sequences in A by the ideal of sequences whose norms tend to zero along ω; the central algebra is the closed star-subalgebra of this ultrapower consisting of elements commuting with the diagonal copy of A, the images of constant sequences. The central algebra has no characters means that every star-homomorphism from it to ℂ (a linear, multiplicative, star-preserving map, not required to preserve the unit) is the zero map. The Jiang–Su algebra is the inductive limit C*-algebra of the standard prime-dimension-drop model system. The right-hand side asserts the existence of a star-algebra isomorphism over ℂ from A onto this tensor product. The proof is admitted in the source.

Significance and status

The target is the character criterion for one algebra and one free ultrafilter. The manuscript's infinite tensor-power consequence is not separately attached. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The two directions relate a scalar-valued representation obstruction to an isomorphism with a tensor product, using the precise inductive-limit Jiang–Su model.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, The Kirchberg–Rørdam character criterion, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Mathematical Logic·Captain: marwahaha

A counterexample to Naimark's problem in ZFCOpen Problem

Motivation

Uniqueness of irreducible representations is a strong condition on a C*-algebra. The target asks for a counterexample to the expected compact-operator characterization without added set-theoretic hypotheses. The pinned manuscript supplies the research context.

Setting

Representations are nonzero star homomorphisms on complete complex inner product spaces. Irreducibility is expressed by closed invariant subspaces, and equivalence by an intertwining linear isometry.

Formalization target

The selected goal is OAI.NaimarkZFC.main. Its central assertion is

∃A:simple(A)∧unique irreducible representation(A)∧A≇K(H).\exists A:\quad\mathrm{simple}(A)\land\mathrm{unique\ irreducible\ representation}(A)\land A\not\cong\mathcal K(H).∃A:simple(A)∧unique irreducible representation(A)∧A≅K(H).

The theorem states that, for every universe level choice, there exists a type A carrying a C*-algebra structure (over ℂ) with the following five properties. First, A is simple in the sense that it is nontrivial and its only closed two-sided ideals are {0} and A itself. Second, A is not finite-dimensional as a complex vector space. Third, there is a continuous linear functional τ : A → ℂ that is a faithful tracial state: τ has norm 1, τ(aa) is a nonnegative real number for every a, τ(ab) = τ(ba) for all a and b, and τ(aa) > 0 whenever a ≠ 0. Fourth, A has a unique irreducible representation up to unitary equivalence: whenever π and ρ are nonzero star-homomorphisms (non-unital algebra homomorphisms preserving star) from A into the bounded operators on complete complex inner product spaces H and K, taken in the stated universe levels, and each has no closed invariant subspace other than 0 and the whole space, there is a linear isometric isomorphism U : H → K with U(π(a)x) = ρ(a)(Ux) for all a and x. Fifth, for every complete complex inner product space H in the stated universe, A is not isomorphic to the algebra of compact operators on H, meaning there is no injective star-homomorphism φ : A → B(H) whose range is exactly the set of compact operators on H.

Significance and status

The target explicitly requires simplicity, infinite dimension, a faithful tracial state and failure of all compact-operator isomorphisms in the stated universes. No additional set-theoretic hypothesis appears in its binders. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The construction must combine infinite dimension, a faithful trace and uniqueness across the specified representation universes.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, A counterexample to Naimark's problem in ZFC, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Algebra·Captain: marwahaha

Vanishing of higher bounded Hochschild cohomologyOpen Problem

Motivation

Hochschild cohomology measures whether a cocycle equation admits a primitive. In an operator algebra the boundedness requirement is part of the mathematical problem. The pinned manuscript supplies the research context.

Setting

Cochains are continuous complex multilinear maps into the von Neumann algebra itself, with its natural left and right multiplication actions.

Formalization target

The selected goal is OAI.BoundedHochschild.KadisonRingrose.main_result. Its central assertion is

df=0⟹∃g: dg=f,deg⁡(f)=n+2.df=0\quad\Longrightarrow\quad\exists g:\ dg=f,\qquad\deg(f)=n+2.df=0⟹∃g: dg=f,deg(f)=n+2.

The theorem states that, for a complex von Neumann algebra M (a C*-algebra with a partial order making it star-ordered, equipped with the W*-algebra structure), and any natural number n, every bounded Hochschild cocycle of degree n+2 with values in M is a coboundary. Here a cochain of degree m is a continuous complex m-linear map from M^m to M. The Hochschild differential of a cochain f of degree m, evaluated at (v_0,...,v_m), is v_0 f(v_1,...,v_m) plus the sum over j from 0 to m-1 of (-1)^(j+1) f(v_0,...,v_j v_{j+1},...,v_m), where the j-th and (j+1)-th inputs are multiplied into one, plus (-1)^(m+1) f(v_0,...,v_{m-1}) v_m. The hypothesis is that f has degree n+2 and its differential vanishes at every (n+3)-tuple of elements of M. The conclusion is that there exists a continuous multilinear cochain g of degree n+1 whose differential equals f at every (n+2)-tuple of elements of M.

Significance and status

The goal covers every natural n, hence degrees at least two. It does not include a separately referenced degree-one inner-derivation theorem. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

An algebraic primitive is insufficient: the lower-degree cochain must remain continuous and bounded in the encoded operator-norm sense.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, Vanishing of higher bounded Hochschild cohomology, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Captain: marwahaha

A counterexample to Kaplansky's quasitrace conjecture and failure of tensor-product stable finitenessOpen Problem

Motivation

Quasitraces behave linearly on commutative subalgebras but need not initially be additive on all positive elements. A uniform defect on a fixed pair would separate them from traces. The pinned manuscript supplies the research context.

Setting

The algebra is separable and carries a normalized 2-quasitrace, meaning a quasitrace with the specified extension to two by two matrices. The witnesses are positive contractions.

Formalization target

The selected goal is OAI.Kaplansky.kaplansky_quasitrace_counterexample. Its central assertion is

Re⁡(τ(a+b)−τ(a)−τ(b))≥1/144.\operatorname{Re}(\tau(a+b)-\tau(a)-\tau(b))\geq1/144.Re(τ(a+b)−τ(a)−τ(b))≥1/144.

The theorem (admitted in the source, not proved there) states that there exists a separable C*-algebra A, with its complex C*-algebra structure, for which the following hold. First, A carries a normalized 2-quasitrace. Here a 1-quasitrace is a function τ : A → ℂ such that τ(xx) is a nonnegative complex number for all x; τ(xx) = τ(xx*); τ(h + i k) = τ(h) + i τ(k) for self-adjoint h and k; and the restriction of τ to every norm-closed commutative (non-unital) star-subalgebra over ℂ is ℂ-linear. It is normalized if τ(1) = 1, and it is a 2-quasitrace if it extends to a 1-quasitrace σ on the 2×2 matrices over A (as a C*-matrix algebra) satisfying σ of the matrix with a in the upper-left corner and zeros elsewhere equal to τ(a) for all a. Second, there are positive contractions a and b in A, meaning each is of the form x*x and has norm at most 1, such that every normalized 2-quasitrace τ on A satisfies Re(τ(a+b) − τ(a) − τ(b)) ≥ 1/144. So no such τ is additive on this pair.

Significance and status

The selected goal is the quantitative quasitrace counterexample. The stable-finiteness and tensor-product consequences are retained as a separate published bundle. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The same positive contractions must exhibit the defect for every normalized 2-quasitrace, while at least one such quasitrace exists.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

Additional published targets are included as separate references:

  • OAI.KaplanskyConsequences.stable_finiteness_bundle (Open).

Selected references

  • OpenAI, A counterexample to Kaplansky's quasitrace conjecture and failure of tensor-product stable finiteness, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
4 thms1 active userReviewed
Group Theory·Captain: marwahaha

An explicit obstruction to nuclear norm-ultrapower embeddingsOpen Problem

Motivation

Norm ultrapowers permit approximations along a free ultrafilter. An explicit algebra excluded from every nuclear target ultrapower tests the limits of this embedding mechanism. The pinned manuscript supplies the research context.

Setting

The group is the stated dyadic semidirect product. Its full group C*-algebra is specified by a universal property, and the ultrapower is bounded sequences modulo norm-null sequences along the ultrafilter.

Formalization target

The selected goal is OAI.NuclearUltrapower.main_no_embedding. Its central assertion is

A↪̸Bωfor every nonzero unital nuclear B.A\not\hookrightarrow B^\omega\quad\text{for every nonzero unital nuclear }B.A↪Bωfor every nonzero unital nuclear B.

The theorem states that, working in universe level 0, there exist a nonzero unital complex C*-algebra A and a group homomorphism ι from G into the unitary group of A such that the following hold. Here G is the semidirect product of the additive group of 3-vectors over the dyadic rationals Z[1/2] by SL₃(ℤ) × ℤ, where a matrix acts linearly on the vectors and the integer n acts by multiplication by 2ⁿ. First, (A, ι) is the full group C*-algebra of G: the span of ι(G) is dense in A, and every homomorphism of G into the unitaries of a nonzero unital C*-algebra D extends uniquely to a unital -homomorphism A → D. Second, A is separable as a topological space. Third, for every nonzero unital C-algebra B that is nuclear in the tensor-norm sense (minimal and maximal C*-tensor norms agree on B ⊗ C for every C*-algebra C) and every free ultrafilter ω on ℕ (one containing no finite set), there is no injective unital -homomorphism from A into the norm ultrapower of B, namely bounded B-valued sequences modulo those tending to 0 along ω. Fourth, there exist a nonzero unital C-algebra O and two elements s₀, s₁ of O satisfying the Cuntz relations (each sᵢsᵢ = 1 and s₀s₀ + s₁s₁* = 1), with O universal for these relations, such that for every free ultrafilter ω there is likewise no injective unital *-homomorphism from A into the norm ultrapower of O. The theorem is admitted in the source, not proved.

Significance and status

The goal includes separability, the full group universal property, nonembedding and the Cuntz-algebra corollary in the stated base universe. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

A single source algebra must obstruct all nuclear targets and free ultrafilters. Universal full-group and Cuntz-algebra constructions are part of the target.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, An explicit obstruction to nuclear norm-ultrapower embeddings, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Captain: marwahaha

Bounded recovery for modular spectral averagesOpen Problem

Motivation

Hilbert-space spectral localization does not automatically produce bounded elements of the underlying operator algebra. Bounded recovery asks when positive averaged detection survives that passage. The pinned manuscript supplies the research context.

Setting

A standard modular datum has a cyclic separating vector, spectral calculus and scalar centralizer. Unit vectors lie in shrinking bands around a fixed real spectral parameter.

Formalization target

The selected goal is OAI.BoundedRecovery.bounded_recovery. Its central assertion is

∥vj∥≤C,∥T(vjξ)∥≥η>0,supp⁡D(vjξ)⊂[s−4δnj,s+4δnj].\|v_j\|\leq C,\quad\|T(v_j\xi)\|\geq\eta>0,\quad\operatorname{supp}_D(v_j\xi)\subset[s-4\delta_{n_j},s+4\delta_{n_j}].∥vj​∥≤C,∥T(vj​ξ)∥≥η>0,suppD​(vj​ξ)⊂[s−4δnj​​,s+4δnj​​].

The theorem states that, for a standard modular datum S on a complex Hilbert space H (a von Neumann algebra M with a unit cyclic and separating vector ξ, a nondegenerate real spectral calculus D with unitary group D.unitary t, an antilinear isometric involution J, and a closed Tomita graph of a ↦ (aξ, a*ξ) over a ∈ M equal to the pairs (p, Jq) where p is mapped to q by the half-exponential graph of D) satisfying ScalarCentralizer (every a in M fixed by conjugation with D.unitary t for all real t is a complex multiple of the identity), the following holds. Let ω be an ultrafilter on ℕ that refines the at-infinity filter (ω ≤ atTop), let T be a bounded complex-linear operator on H, let s be real, and let δₙ > 0 tend to 0. Suppose hₙ are unit vectors, each with spectral support in the interval [s − δₙ, s + δₙ] (every bounded continuous function vanishing on that interval annihilates hₙ under the calculus), and suppose the limsup over n of the ω-limit of the symmetric time averages (1/2k)∫{−k}^{k} ‖T(D.unitary t hₙ)‖² dt is strictly positive. Then the recovery conclusion holds: there are a strictly increasing sequence nⱼ, operators vⱼ in M, and constants C and η > 0 such that for every j, ‖vⱼ‖ ≤ C, ‖T(vⱼ ξ)‖ ≥ η, and vⱼξ has spectral support in [s − 4δ{nⱼ}, s + 4δ_{nⱼ}]. The proof is admitted, not supplied.

Significance and status

The hypothesis is positivity of the specified ultrafilter time average and outer limsup. Bicentralizer triviality and further rigidity applications are not separate conclusions of this target. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The recovered vectors must come from uniformly bounded algebra elements while retaining detection and shrinking spectral support along a subsequence.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, Bounded recovery for modular spectral averages, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Captain: marwahaha

Kadison's similarity theorem through uniform derivation estimatesOpen Problem

Motivation

A bounded algebra representation need not visibly preserve adjoints. The similarity problem asks whether one bounded change of Hilbert-space coordinates restores that structure. The pinned manuscript supplies the research context.

Setting

Representations are continuous unital complex algebra homomorphisms into bounded operators on a complete complex inner product space. The conjugating operator must have a bounded inverse.

Formalization target

The selected goal is OAI.KadisonSimilarity.similarityTheorem. Its central assertion is

Sπ(a∗)S−1=(Sπ(a)S−1)∗.S\pi(a^*)S^{-1}=(S\pi(a)S^{-1})^*.Sπ(a∗)S−1=(Sπ(a)S−1)∗.

The theorem states that, for every C*-algebra A in universe u and every complex inner product space K in universe v that is complete (a Hilbert space), every bounded unital representation of A on K is similar to a star representation. Here a bounded unital representation is a continuous ℂ-algebra homomorphism π from A into the algebra of bounded linear operators on K; being an algebra homomorphism of unital algebras, it preserves the identity. Similarity to a star representation means that there is an invertible bounded operator S on K, with bounded inverse, such that for every a in A, S π(a*) S⁻¹ equals the adjoint of S π(a) S⁻¹. Equivalently, the conjugated map a ↦ S π(a) S⁻¹ commutes with the involution. This is the Kadison similarity statement as a defined proposition SimilarityTheorem, and the source declares it as a theorem whose proof is admitted rather than supplied.

Significance and status

Similarity is the selected goal. The two commutator formulations and explicit hyperreflexivity estimate remain distinct references with their own constants and universes. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

One operator S must work simultaneously for every algebra element. Uniform matrix-amplification estimates cannot acquire a dimension-dependent constant.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

Additional published targets are included as separate references:

  • OAI.KadisonSimilarity.universalCommutatorTheorem (Open).
  • OAI.KadisonSimilarity.universalHyperreflexivity (Open).
  • OAI.Kadison.uniform_commutator (Open).

Selected references

  • OpenAI, Kadison's similarity theorem through uniform derivation estimates, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
6 thms1 active userReviewed
Captain: marwahaha

An isomorphism of the free group factorsOpen Problem

Motivation

Group von Neumann algebras encode a free group's regular representation as an operator algebra. Whether the rank remains visible in that algebra is the motivating isomorphism problem. The pinned manuscript supplies the research context.

Setting

The parameter runs over extended nonnegative reals greater than one. Integer ranks use group factors, infinity uses countably many generators, and other parameters use the encoded stabilized corner model.

Formalization target

The selected goal is OAI.FreeGroupFactorMain.Interpolation.allInterpolatedIsomorphic. Its central assertion is

L(Fr)≅L(Fs)(1<r,s≤∞).L(\mathbb F_r)\cong L(\mathbb F_s)\qquad(1<r,s\leq\infty).L(Fr​)≅L(Fs​)(1<r,s≤∞).

The theorem states that for any two extended nonnegative real parameters r and s, both strictly greater than 1 (so either may be infinite), the interpolated factors attached to r and s are isomorphic as C*-algebras with trace and topology, meaning the type of normal tracial equivalences between them is nonempty. The interpolated factor at a parameter is chosen by cases: for r = ∞ it is the group von Neumann algebra of the free group on countably many generators; for r equal to a natural number n it is the group von Neumann algebra of the free group on n generators; otherwise it is the corner pAp of the stabilization of the rank-two free group algebra, cut down by a selected star projection p whose stabilized projection trace is the real number 1/√(r−1), with the trace being the stabilized trace rescaled by the inverse of that value. Each carries its canonical trace or this rescaled trace and an ultraweak-type topology. A NormalTracialEquiv between two such models consists of a ℂ-linear star-algebra isomorphism that preserves the traces and is continuous in both directions for the given topologies.

Significance and status

The goal is a nonempty type of normal tracial equivalences between the precise interpolated models. Statements about fundamental groups are not separate attached targets. The target is currently Open on Prove2Me. The manuscript's mathematical argument and a machine-checked proof of the selected statement are separate deliverables.

Difficulty

The required equivalence must preserve the algebra, involution and trace, and be continuous in both directions for the specified topologies.

Formalization scope

The exact published goal, its hypotheses and its referenced definition blocks specify the requested formalization. The explanatory formula above is a summary; all quantifiers and additional clauses in the linked statement remain required.

The available published material supplies this goal and its necessary definitions. Additional manuscript lemmas are not represented as attached milestones.

Selected references

  • OpenAI, An isomorphism of the free group factors, preprint, 2026. Manuscript.
  • OpenAI, accompanying formal statements, commit adc7f1241b42. Selected goal source.
2 thms1 active userReviewed
Discrete Geometry·Captain: wurtle

Counterexamples to the duality conjecture for metric entropyResearch Paper

Motivation

Covering numbers measure the size of a set at a given scale: N(A,B)N(A,B)N(A,B) is the least number of translates of BBB needed to cover AAA. Their logarithms, the metric entropy, appear across approximation theory, operator theory (entropy numbers of compact operators), probability (Dudley's bound) and learning theory. A basic question in asymptotic geometric analysis is how metric entropy behaves under duality: if KKK is hard to cover by LLL, is the polar body L∘L^\circL∘ equally hard to cover by K∘K^\circK∘? The duality conjecture for metric entropy, originating in Pietsch's 1972 work on operator ideals, predicts that the two quantities agree up to universal constants, independently of the dimension.

Timeline

  • 1972. Pietsch formulates the duality problem for entropy numbers of operators.
  • 1987. König and Milman compare the nnn-th roots of the two covering numbers, which on the logarithmic scale allows an additive error proportional to nnn (doi:10.1007/BFb0078138).
  • 1989. Bourgain, Pajor, Szarek and Tomczak-Jaegermann prove entropy-number comparisons under geometric and regularity assumptions, with rank-dependent losses (doi:10.1007/BFb0090048).
  • 2004. Artstein, Milman and Szarek prove the conjecture when one body is a Euclidean ball (hence an ellipsoid) (doi:10.4007/annals.2004.159.1313); Artstein, Milman, Szarek and Tomczak-Jaegermann prove universal duality for convexified packing and state the dimension-free conjecture as Conjecture 1 (doi:10.1007/s00039-004-0486-3).
  • 2007. E. Milman obtains a comparison for arbitrary symmetric bodies with logarithmic losses in scale and entropy (doi:10.1007/s00020-006-1479-4).
  • 2022. Hu, Peale and Reingold relate dual covering numbers to sample complexity in learning theory (PMLR v167).

The source of this mission is an OpenAI preprint dated September 24, 2026, which disproves the dimension-free conjecture.

Setting

Work in Rn\mathbb R^nRn with the standard pairing ⟨x,y⟩=∑ixiyi\langle x,y\rangle=\sum_i x_iy_i⟨x,y⟩=∑i​xi​yi​. A convex body is a compact convex set with nonempty interior; it is origin-symmetric if K=−KK=-KK=−K. Its polar is

K∘={y∈Rn: ⟨x,y⟩≤1 for all x∈K}.K^\circ=\{y\in\mathbb R^n:\ \langle x,y\rangle\le1\ \text{for all }x\in K\}.K∘={y∈Rn: ⟨x,y⟩≤1 for all x∈K}.

For bounded AAA and a body BBB, the covering number N(A,B)N(A,B)N(A,B) is the least MMM such that A⊆⋃j=1M(cj+B)A\subseteq\bigcup_{j=1}^M(c_j+B)A⊆⋃j=1M​(cj​+B) for some c1,…,cM∈Rnc_1,\dots,c_M\in\mathbb R^nc1​,…,cM​∈Rn (centres need not lie in AAA). Logarithms are natural. Let L=[−1,1]nL=[-1,1]^nL=[−1,1]n be the cube; its polar L∘L^\circL∘ is the cross-polytope.

The duality conjecture asks for absolute constants a,b≥1a,b\ge1a,b≥1 such that, for every nnn and all origin-symmetric convex bodies K,L⊂RnK,L\subset\mathbb R^nK,L⊂Rn,

1blog⁡N(L∘,aK∘) ≤ log⁡N(K,L) ≤ blog⁡N(L∘,a−1K∘).\frac1b\log N(L^\circ,aK^\circ)\ \le\ \log N(K,L)\ \le\ b\log N(L^\circ,a^{-1}K^\circ).b1​logN(L∘,aK∘) ≤ logN(K,L) ≤ blogN(L∘,a−1K∘).

Formalization targets

Goal: Theorem 1.1

For every a,b≥1a,b\ge1a,b≥1 there are n≥1n\ge1n≥1 and an origin-symmetric convex body K⊂RnK\subset\mathbb R^nK⊂Rn such that, with L=[−1,1]nL=[-1,1]^nL=[−1,1]n,

log⁡N(K,L) > b log⁡N(L∘, a−1K∘).\log N(K,L)\ >\ b\,\log N\bigl(L^\circ,\ a^{-1}K^\circ\bigr).logN(K,L) > blogN(L∘, a−1K∘).

The Lean statement OAI.MetricEntropyDuality.exists_entropy_duality_counterexample_with_covers is open on the platform.

Significance

The theorem shows that the upper inequality of the conjecture fails for every proposed pair of constants, so the two-sided conjecture has a negative answer, even when one body is a cube. It also separates ordinary covering entropy from convexified-packing entropy, for which Artstein–Milman–Szarek–Tomczak-Jaegermann proved universal duality (Corollary 5.1 of the source). Dimension-dependent results (König–Milman, E. Milman) remain compatible with the counterexample, which shows that some dependence on dimension or structure is unavoidable.

The result is stated in an OpenAI preprint; it has not been peer reviewed, and no machine-checked proof exists. The counterexample is explicit and finite-dimensional, which makes a full formalization realistic.

Difficulty

The known positive cases (Euclidean balls, ellipsoids, bounded K-convexity) suggest the conjecture is true, and the obvious candidate bodies, products and cubes, satisfy it. A counterexample needs a body whose primal entropy against the cube is large while the polar side is small; the paper reduces this to a finite matrix with entries in [0,1][0,1][0,1] whose rows are pairwise 111-separated in the sup norm while the absolutely convex hull of its columns admits a small uniform approximation list. Producing such matrices requires partition structures over finite fields with uniform control over all row coordinates, and the entropy gap must beat every fixed bbb after the scale change a−1a^{-1}a−1.

Formalization scope

  • Space: RealSpace (Fin n) = Fin n → ℝ with pairing the standard dot product; cube is [−1,1]n[-1,1]^n[−1,1]n; polar K uses ≤1\le1≤1.
  • Covers A B centers means every x∈Ax\in Ax∈A has some centre cjc_jcj​ with x−cj∈Bx-c_j\in Bx−cj​∈B; coveringNumber is the sInf of the admissible MMM. The statement includes Coverable side conditions, which only certify that both infima are over nonempty sets.
  • IsSymmetricConvexBody = compact, convex, x∈K  ⟺  −x∈Kx\in K\iff -x\in Kx∈K⟺−x∈K, nonempty interior.
  • The scale enters as a⁻¹ • polar K; logs are Real.log of natural numbers cast to reals.

A complete development needs support functions and polarity, elementary covering-number bounds, finite-field polynomial zero bounds (Schwartz–Zippel), and the matrix-to-body conversion. The covering-number and polarity layer is reusable for other convex-geometry missions. Contributions formalizing Lemma 2.1 (matrix-to-body conversion), Proposition 3.2 (uniform compression) and Proposition 4.3 (partitions with separated rows) are welcome.

Selected references

  • OpenAI, Counterexamples to the duality conjecture for metric entropy, preprint, September 24, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Counterexamples-to-the-duality-conjecture-for-metric-entropy-September-24-2026/main.pdf
  • S. Artstein, V. Milman, S. J. Szarek, Duality of metric entropy, Ann. of Math., 2004. https://doi.org/10.4007/annals.2004.159.1313
  • S. Artstein, V. Milman, S. Szarek, N. Tomczak-Jaegermann, On convexified packing and entropy duality, Geom. Funct. Anal., 2004. https://doi.org/10.1007/s00039-004-0486-3
  • H. König, V. D. Milman, On the covering numbers of convex bodies, GAFA Seminar, 1987. https://doi.org/10.1007/BFb0078138
  • J. Bourgain, A. Pajor, S. J. Szarek, N. Tomczak-Jaegermann, On the duality problem for entropy numbers of operators, GAFA Seminar, 1989. https://doi.org/10.1007/BFb0090048
  • E. Milman, A remark on two duality relations, Integral Equations Operator Theory, 2007. https://doi.org/10.1007/s00020-006-1479-4
  • J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM, 1980. https://doi.org/10.1145/322217.322225
2 thms1 active userReviewed
Analysis·Captain: wurtle

A positive solution to Tingley’s problemResearch Paper

Motivation: isometries of unit spheres

The Mazur–Ulam theorem (1932) says that every surjective isometry between real normed spaces is affine. The whole space is not always available, though: often only distances between unit vectors are known. Tingley's problem (1987) asks whether the metric of the unit sphere alone already determines the linear structure, that is, whether every surjective isometry between the unit spheres of two real Banach spaces extends to a real-linear isometry of the spaces (Tingley 1987). The question has been studied for almost four decades, mostly class by class: for sequence spaces, LpL^pLp spaces, operator algebras and two-dimensional spaces. Nearly all known positive results depend on the structure of the particular spaces involved.

Timeline

  • 1932 — Mazur and Ulam: surjective isometries between real normed spaces are affine.
  • 1972 — Mankiewicz extends isometries between convex sets with nonempty interior. A unit sphere has empty interior, so this does not apply.
  • 1987 — Tingley poses the problem and shows that surjective isometries between spheres of finite-dimensional spaces preserve antipodal points (Tingley 1987).
  • 1994 — Wang treats spheres of C0(Ω)C_0(\Omega)C0​(Ω)-type spaces (Wang 1994).
  • 2003 — Ding handles ℓp(Γ)\ell^p(\Gamma)ℓp(Γ)-type spaces, p>1p>1p>1, p≠2p\ne 2p=2 (Ding 2003).
  • 2011 — Cheng and Dong formulate the Mazur–Ulam property (sphere isometries from a given space into an arbitrary target extend linearly) (Cheng–Dong 2011).
  • 2012 — Tan proves the Mazur–Ulam property for real Lp(μ)L^p(\mu)Lp(μ), 1<p<∞1<p<\infty1<p<∞, p≠2p\neq 2p=2 (Tan 2012).
  • 2014 — Tanaka: sphere isometries preserve maximal convex subsets of the sphere (Tanaka 2014).
  • 2018 — Fernández-Polo and Peralta (von Neumann algebras, JMAA 2018); Mori (preduals, JMAA 2018).
  • 2020 — Mori and Ozawa: Mazur–Ulam property for unital C∗C^*C∗-algebras and real von Neumann algebras (Studia Math. 2020).
  • 2022 — Banakh: every two-dimensional real Banach space has the Mazur–Ulam property (Banakh 2022).
  • 2025–2026 — Further class results: Schreier spaces (Fakhoury 2025); Haagerup noncommutative LpL_pLp​ and Schatten classes (Huang–Zhu, arXiv:2608.30131; arXiv:2607.11244).
  • 2026 — An OpenAI preprint, A positive solution to Tingley's problem (OpenAI Math Release, September 23, 2026), claims the general affirmative answer for all real Banach spaces. It has not been peer reviewed, and the claim has not been formally verified.

Setting

Let XXX and YYY be real Banach spaces, both nonzero. The unit sphere is SX={x∈X:∥x∥=1}S_X=\{x\in X:\|x\|=1\}SX​={x∈X:∥x∥=1} with the metric inherited from XXX. A map f:SX→SYf:S_X\to S_Yf:SX​→SY​ is an isometry if ∥f(x)−f(y)∥=∥x−y∥\|f(x)-f(y)\|=\|x-y\|∥f(x)−f(y)∥=∥x−y∥ for all x,y∈SXx,y\in S_Xx,y∈SX​, and it is surjective if every point of SYS_YSY​ is attained.

Any linear extension of fff is forced to be the radial extension

T(0)=0,T(x)=∥x∥ f ⁣(x∥x∥)(x≠0).T(0)=0,\qquad T(x)=\|x\|\,f\!\left(\frac{x}{\|x\|}\right)\quad(x\neq 0).T(0)=0,T(x)=∥x∥f(∥x∥x​)(x=0).

In Lean, UnitSphere X is the subtype {x:X∣∥x∥=1}\{x : X \mid \|x\|=1\}{x:X∣∥x∥=1} and normalize x hx is x/∥x∥x/\|x\|x/∥x∥ as an element of it.

Formalization targets

Goal: Tingley's problem (Theorem 1.1)

For nonzero real Banach spaces X,YX,YX,Y and every surjective isometry f:SX→SYf:S_X\to S_Yf:SX​→SY​ there is a surjective real-linear isometry T:X→YT:X\to YT:X→Y such that

T∣SX=f,T(0)=0,T(x)=∥x∥ f ⁣(x∥x∥) (x≠0),T|_{S_X}=f,\qquad T(0)=0,\qquad T(x)=\|x\|\,f\!\left(\tfrac{x}{\|x\|}\right)\ (x\neq0),T∣SX​​=f,T(0)=0,T(x)=∥x∥f(∥x∥x​) (x=0),

and TTT is the only real-linear map X→YX\to YX→Y that agrees with fff on SXS_XSX​. This is the full statement of Theorem 1.1 of the source. The goal is published on the platform with status Open: no machine-checked proof exists yet.

Significance

The result itself. An affirmative answer turns a forty-year class-by-class programme into a single theorem: the metric of the unit sphere of any real Banach space determines the space up to linear isometry. Every space then has the Mazur–Ulam property in the sense of Cheng and Dong, with no separability, reflexivity, smoothness or strict convexity assumptions. For complex Banach spaces viewed as real spaces the conclusion is real-linearity only; complex-linearity is not claimed.

Formalizing it. The claimed proof combines classical tools (supporting functionals, Banach-space ultrapowers, Darbo's fixed-point theorem with the Kuratowski measure of noncompactness, the Mazur–Ulam theorem) with new geometric estimates on aligned chords. A machine-checked proof would certify a result whose proof has not yet been refereed. The Mazur–Ulam theorem itself is already in Mathlib (IsometryEquiv.toRealLinearIsometryEquiv); ultrapowers of Banach spaces and Darbo's theorem are not.

Difficulty

The radial map TTT preserves norms and preserves distances between points of the same radius. What has to be shown is that it preserves distances between points on different spheres, ∥f(x)−qf(y)∥=∥x−qy∥\|f(x)-qf(y)\|=\|x-qy\|∥f(x)−qf(y)∥=∥x−qy∥ for 0<q<10<q<10<q<1, using only distances measured on a single sphere. Once this holds, TTT is a surjective isometry fixing 000 and Mazur–Ulam gives linearity. The obvious attempt (extend the isometry to a neighbourhood, or use convex-set extension theorems such as Mankiewicz's) fails because the sphere has empty interior. Structural arguments (smoothness, facial structure, explicit duals) cover only special classes of spaces. In general, the maximal defect sup⁡∣∥f(x)−qf(y)∥−∥x−qy∥∣\sup|\|f(x)-qf(y)\|-\|x-qy\||sup∣∥f(x)−qf(y)∥−∥x−qy∥∣ need not be attained, and no compactness is available in infinite dimensions.

Formalization scope

  • XXX and YYY are arbitrary types with NormedAddCommGroup, NormedSpace ℝ and CompleteSpace, and Nontrivial (the source's "nonzero"). Universe levels are independent, and no separability or dimension hypothesis is imposed.
  • The sphere is UnitSphere X := {x // ‖x‖ = 1} with the subtype metric; Isometry f and Function.Surjective f are the hypotheses.
  • The conclusion is an existential over X ≃ₗᵢ[ℝ] Y (a bijective real-linear isometry) with the five clauses: agreement on the sphere, T0=0T0=0T0=0, the radial formula, surjectivity, and uniqueness among all X →ₗ[ℝ] Y that agree with fff on the sphere. No hypothesis assumes any distance between different radii, so the statement is not trivialized.
  • Infrastructure a full development needs: Hahn–Banach supporting functionals, Banach-space ultrapowers (or another attainment device), the Kuratowski measure of noncompactness and Darbo's fixed-point theorem, together with Mathlib's Mazur–Ulam theorem. Ultrapowers and Darbo's theorem would be reusable well beyond this mission.

Selected references

  • D. Tingley, Isometries of the unit sphere, Geom. Dedicata 22 (1987), 371–378. https://doi.org/10.1007/BF00147942
  • S. Mazur and S. Ulam, Sur les transformations isométriques d'espaces vectoriels normés, C. R. Acad. Sci. Paris 194 (1932), 946–948.
  • P. Mankiewicz, On extension of isometries in normed linear spaces, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 20 (1972).
  • R. S. Wang, Isometries between the unit spheres of C0(Ω)C_0(\Omega)C0​(Ω) type spaces, Acta Math. Sci. 14 (1994), 82–89. https://doi.org/10.1016/S0252-9602(18)30093-6
  • G. G. Ding, The isometric extension problem in the unit spheres of ℓp(Γ)\ell^p(\Gamma)ℓp(Γ) (p>1)(p>1)(p>1) type spaces, Sci. China Ser. A 46 (2003), 333–338. https://doi.org/10.1360/03ys9035
  • L. Cheng and Y. Dong, On a generalized Mazur–Ulam question, J. Math. Anal. Appl. 377 (2011), 464–470. https://doi.org/10.1016/j.jmaa.2010.11.025
  • D.-N. Tan, Extension of isometries on the unit sphere of LpL^pLp spaces, Acta Math. Sin. (Engl. Ser.) 28 (2012), 1197–1208. https://doi.org/10.1007/s10114-011-0302-6
  • R. Tanaka, A further property of spherical isometries, Bull. Aust. Math. Soc. 90 (2014), 304–310. https://doi.org/10.1017/S0004972714000185
  • F. J. Fernández-Polo and A. M. Peralta, On the extension of isometries between the unit spheres of von Neumann algebras, J. Math. Anal. Appl. 466 (2018), 127–143. https://doi.org/10.1016/j.jmaa.2018.05.062
  • M. Mori, Tingley's problem through the facial structure of operator algebras, J. Math. Anal. Appl. 466 (2018), 1281–1298. https://doi.org/10.1016/j.jmaa.2018.06.050
  • M. Mori and N. Ozawa, Mankiewicz's theorem and the Mazur–Ulam property for C∗C^*C∗-algebras, Studia Math. 250 (2020), 265–281. https://doi.org/10.4064/sm180727-14-11
  • T. Banakh, Every 2-dimensional Banach space has the Mazur–Ulam property, Linear Algebra Appl. 632 (2022), 268–280. https://doi.org/10.1016/j.laa.2021.09.020
  • G. Darbo, Punti uniti in trasformazioni a codominio non compatto, Rend. Sem. Mat. Univ. Padova 24 (1955), 84–92.
  • OpenAI, A positive solution to Tingley's problem, OpenAI Math Release preprint, September 23, 2026 (Theorem 1.1, p. 1). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-positive-solution-to-Tingleys-problem-September-23-2026/paper.pdf
2 thms1 active userReviewed
Captain: wurtle

Relative generation and the generator problem for finite factorsResearch Paper

Motivation

A von Neumann algebra is a unital algebra of bounded operators on a Hilbert space that is closed under adjoints and in the weak operator topology. For a set SSS of operators, W∗(S)W^*(S)W∗(S) denotes the smallest von Neumann algebra containing SSS. The generator problem, going back to Kadison's 1967 list of problems, asks whether every von Neumann algebra with separable predual is singly generated, M=W∗(x)M=W^*(x)M=W∗(x) for a single bounded operator xxx; equivalently, whether two self-adjoint operators always suffice. It is one of the oldest structural questions about von Neumann algebras, and by classical reductions everything comes down to type II1_11​ factors.

Timeline

  • 1962–1969. Pearcy proves single generation for type I algebras (doi:10.2307/2034069); Suzuki and Saitô for hyperfinite algebras (1963, doi:10.2748/tmj/1178243811); Wogen for properly infinite algebras (1969, doi:10.1090/S0002-9904-1969-12157-9); Douglas and Pearcy develop matrix-generation techniques (1969, doi:10.1307/mmj/1029000161).
  • 1972. Behncke treats tensor products of two II1_11​ factors (doi:10.2748/tmj/1178241478).
  • 1974. Willig's direct-integral theorem reduces the general problem to II1_11​ factors (doi:10.2748/tmj/1178241231).
  • 1981. Popa constructs irreducible hyperfinite subfactors (doi:10.1007/BF01389015).
  • 1985–2002. Popa treats factors with Cartan subalgebras (doi:10.7146/math.scand.a-12110); Ge and Popa treat property Γ\GammaΓ factors (1998, doi:10.1215/S0012-7094-98-09405-4); Ge and Shen treat certain property (T) factors (2002, doi:10.1073/pnas.022593699).
  • 2008–2009. Dykema, Sinclair, Smith and White study generator invariants and their amplification formula (arXiv:0706.1953); Shen's generator invariant unifies the positive classes (arXiv:math/0511327).
  • 2012. Sherman shows that finite generation of every countably generated II1_11​ factor would suffice (arXiv:0908.4565).
  • 2021. Popa studies tight decompositions and stable single generation (arXiv:1910.14653).
  • 2025. Gao, Kunnawalkam Elayavalli, Patchell and Tan prove single generation under an internal sequential-commutation hypothesis (arXiv:2404.12380).

The source of this mission is an OpenAI preprint dated September 23, 2026, which claims single generation for every II1_11​ factor with separable predual.

Setting

Let HHH be a complex Hilbert space and M⊆B(H)M\subseteq B(H)M⊆B(H) a unital ∗*∗-subalgebra closed in the weak operator topology. MMM is a factor if its centre is C1\mathbb C1C1; it is finite if every isometry v∈Mv\in Mv∈M (v∗v=1v^*v=1v∗v=1) is unitary; it is diffuse if every nonzero projection has a proper nonzero subprojection. A nonzero finite diffuse factor is a type II1_11​ factor; it carries a unique faithful normal tracial state τ\tauτ, with ∥x∥2=τ(x∗x)1/2\|x\|_2=\tau(x^*x)^{1/2}∥x∥2​=τ(x∗x)1/2. MMM has separable predual if MMM is isometrically the dual of a separable Banach space; this does not require HHH or MMM to be norm-separable.

An inclusion of factors P⊆MP\subseteq MP⊆M is irreducible if P′∩M=C1P'\cap M=\mathbb C1P′∩M=C1. U(M)\mathcal U(M)U(M) denotes the unitary group.

Formalization targets

Milestone: Theorem 1.1 (relative generation)

For an irreducible inclusion P⊂MP\subset MP⊂M of II1_11​ factors with MMM of separable predual,

{u∈U(M): W∗(P,u)=M}  is a dense Gδ in (U(M),∥⋅∥2).\{u\in\mathcal U(M):\ W^*(P,u)=M\}\ \text{ is a dense }G_\delta\text{ in }(\mathcal U(M),\|\cdot\|_2).{u∈U(M): W∗(P,u)=M}  is a dense Gδ​ in (U(M),∥⋅∥2​).

Goal: Theorem 1.2 (single generation)

M a II1 factor with separable predual ⟹ ∃ x∈M:W∗(x)=M.M\ \text{a II}_1\text{ factor with separable predual}\ \Longrightarrow\ \exists\,x\in M:\quad W^*(x)=M.M a II1​ factor with separable predual ⟹ ∃x∈M:W∗(x)=M.

The Lean statement OAI.Generator.single_generation_of_II1_separable_predual is open on the platform.

Significance

Combined with Willig's reduction and the known type I and properly infinite cases, Theorem 1.2 gives single generation of every von Neumann algebra with separable predual, an affirmative answer to the generator problem. The paper also deduces that the generator invariants GGG and GsaG_{\mathrm{sa}}Gsa​ of Dykema–Sinclair–Smith–White vanish for every such factor, and that Voiculescu's free entropy dimensions δ,δ0\delta,\delta_0δ,δ0​ are not invariants of the generated algebra (Corollary 6.1), since L(Fn)L(\mathbb F_n)L(Fn​) has both a free semicircular nnn-tuple and a self-adjoint pair as generators. Theorem 1.1 is of independent interest: it shows that relative generators are generic, not merely existent.

These results are stated in an OpenAI preprint; they have not been peer reviewed, and no machine-checked proofs exist.

Difficulty

Earlier positive results all relied on extra structure (Cartan subalgebras, property Γ\GammaΓ, tensor decompositions, sequential commutation) to build a generator. Without such structure one must show that a unitary uuu generates MMM over PPP, which requires detecting every vector of L2(M)L^2(M)L2(M) through words in PPP and uuu. Perturbing uuu along a long word changes it many times, and operator-norm bounds on the accumulated perturbation grow with the word length; a length-uniform estimate is needed. The Baire-category step also needs the projection onto L2(W∗(P,u))L^2(W^*(P,u))L2(W∗(P,u)) to vary semicontinuously in uuu.

Formalization scope

  • Algebras are concrete StarSubalgebra ℂ (H →L[ℂ] H); WOTClosed uses Mathlib's weak operator topology, and wstar s is the infimum of WOT-closed star-subalgebras containing sss (unital by construction).
  • IsII1Factor = nonzero Hilbert space, WOT-closed, trivial centre, finite (isometries are unitary), diffuse. No trace is assumed.
  • HasSeparablePredual asks for a separable Banach space XXX in the same universe with a conjugate-linear isometric equivalence between its dual and the algebra; this is equivalent to the usual condition.
  • For Theorem 1.1, the trace is part of the conclusion (IsNormalizedTrace: normalized, positive, faithful, tracial, ultraweakly continuous), the topology on unitary large is generated by trace 2-distance balls, and the locus is {u:wstar(P∪{u})=M}\{u: \mathrm{wstar}(P\cup\{u\})=M\}{u:wstar(P∪{u})=M}.

A complete development needs the standard theory of II1_11​ factors (trace, L2(M)L^2(M)L2(M), conditional expectations, ultrapowers), Popa's free independence in ultraproducts and irreducible hyperfinite subfactors, Haagerup's inequality for free groups, and the Baire category theorem on the unitary group. This infrastructure is reusable across operator-algebra missions. Contributions formalizing Proposition 3.2 (perturbation bounds) and Popa's irreducible hyperfinite embedding (Theorem 5.1) are welcome.

Selected references

  • OpenAI, Relative generation and the generator problem for finite factors, preprint, September 23, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Relative-generation-and-the-generator-problem-for-finite-factors-September-23-2026/paper.pdf
  • P. Willig, Generators and direct integral decompositions of W∗W^*W∗-algebras, Tohoku Math. J., 1974. https://doi.org/10.2748/tmj/1178241231
  • D. Sherman, On cardinal invariants and generators for von Neumann algebras, Canad. J. Math., 2012. https://arxiv.org/abs/0908.4565
  • K. Dykema, A. Sinclair, R. Smith, S. White, Generators of II1_11​ factors, Oper. Matrices, 2008. https://arxiv.org/abs/0706.1953
  • L. Ge, S. Popa, On some decomposition properties for factors of type II1_11​, Duke Math. J., 1998. https://doi.org/10.1215/S0012-7094-98-09405-4
  • J. Shen, Type II1_11​ factors with a single generator, J. Operator Theory, 2009. https://arxiv.org/abs/math/0511327
  • S. Popa, Independence properties in subalgebras of ultraproduct II1_11​ factors, J. Funct. Anal., 2014. https://arxiv.org/abs/1308.3982
  • U. Haagerup, An example of a non nuclear C∗C^*C∗-algebra, which has the metric approximation property, Invent. Math., 1979. https://doi.org/10.1007/BF01410082
  • D. Gao, S. Kunnawalkam Elayavalli, G. Patchell, H. Tan, Internal sequential commutation and single generation, IMRN, 2025. https://arxiv.org/abs/2404.12380
4 thms1 active userReviewed
Dynamical Systems·Captain: wurtle

Invariant-projection counterexamples for every irrational rotationResearch Paper

Motivation

The invariant subspace problem asks whether every bounded operator on a separable infinite-dimensional complex Hilbert space has a nontrivial closed invariant subspace. Inside a finite von Neumann algebra there is a sharper, algebra-relative version: given TTT in a type II1\mathrm{II}_1II1​ factor MMM, is there a projection p∈Mp\in Mp∈M with 0<τ(p)<10<\tau(p)<10<τ(p)<1 and (1−p)Tp=0(1-p)Tp=0(1−p)Tp=0, i.e. a nontrivial TTT-invariant subspace whose projection lies in MMM? The Brown measure, built from the Fuglede–Kadison determinant, gives such projections whenever it is not a point mass (Haagerup–Schultz). The open territory is therefore operators whose Brown measure is a point mass, in particular quasinilpotent ones.

Zhu, Fang and Shi (2017) studied the weighted irrational rotations Tf=Uf(V)T_f=Uf(V)Tf​=Uf(V) in the hyperfinite II1\mathrm{II}_1II1​ factor and asked whether TfT_fTf​ must have a nontrivial invariant projection when fff is nonzero almost everywhere, ∣f∣|f|∣f∣ is nonconstant and the determinant of f(V)f(V)f(V) is zero. This mission formalizes a negative answer for every prescribed irrational angle.

Timeline

  • 1952. Fuglede and Kadison introduce the determinant on finite factors (doi:10.2307/1969645).
  • 1986. Brown defines the spectral distribution (Brown measure) of an operator in a II1\mathrm{II}_1II1​ factor.
  • 2004. Dykema and Haagerup construct nontrivial hyperinvariant subspaces for the quasinilpotent DT-operator, whose Brown measure is a point mass (doi:10.1016/S0022-1236(03)00167-8).
  • 2008. Tucci constructs quasinilpotent generators of the hyperfinite factor that do have nontrivial invariant projections (doi:10.1016/j.jfa.2008.03.012).
  • 2009. Haagerup and Schultz attach a hyperinvariant projection to each Borel set, with trace equal to its Brown mass (doi:10.1007/s10240-009-0018-7). Dykema and Schultz identify the Brown measure of weighted rotations as uniform measure on a circle of radius the determinant (arXiv:math/0512197).
  • 2017. Zhu, Fang and Shi give a direct proof of that Brown-measure formula, exhibit continuous weights with one zero and determinant zero, and pose the question above (doi:10.7146/math.scand.a-25625).

The source of this mission is an OpenAI preprint dated September 27, 2026.

Setting

Fix an irrational θ∈(0,1)\theta\in(0,1)θ∈(0,1). Let RθR_\thetaRθ​ be the von Neumann algebra generated by unitaries U,VU,VU,V with VU=e2πiθUVVU=e^{2\pi i\theta}UVVU=e2πiθUV and trace τ(UmVn)=0\tau(U^mV^n)=0τ(UmVn)=0 for (m,n)≠(0,0)(m,n)\ne(0,0)(m,n)=(0,0), τ(1)=1\tau(1)=1τ(1)=1; it is the hyperfinite II1\mathrm{II}_1II1​ factor. Concretely, on H=L2(R/Z;ℓ2(Z))\mathcal H=L^2(\mathbb R/\mathbb Z;\ell^2(\mathbb Z))H=L2(R/Z;ℓ2(Z)), UUU shifts the ℓ2(Z)\ell^2(\mathbb Z)ℓ2(Z) coordinate and VVV multiplies the kkk-th coordinate at xxx by e2πi(x+kθ)e^{2\pi i(x+k\theta)}e2πi(x+kθ). For a continuous f:T→[0,1]f:\mathbb T\to[0,1]f:T→[0,1] set Tf=Uf(V)T_f=Uf(V)Tf​=Uf(V). A projection p∈Rθp\in R_\thetap∈Rθ​ is invariant for TfT_fTf​ if (1−p)Tfp=0(1-p)T_fp=0(1−p)Tf​p=0; it is nontrivial if p≠0,1p\ne0,1p=0,1. The Fuglede–Kadison determinant of f(V)f(V)f(V) is exp⁡∫Tlog⁡f dm\exp\int_{\mathbb T}\log f\,dmexp∫T​logfdm, with mmm the normalized Haar measure.

Formalization targets

Goal: Theorem 1.1 (with Corollary 6.2)

For every irrational θ∈(0,1)\theta\in(0,1)θ∈(0,1) there is a continuous f:T→[0,1]f:\mathbb T\to[0,1]f:T→[0,1] with

f−1(0)={1},∫Tlog⁡f dm=−∞,f^{-1}(0)=\{1\},\qquad \int_{\mathbb T}\log f\,dm=-\infty,f−1(0)={1},∫T​logfdm=−∞,

such that every projection p∈Rθp\in R_\thetap∈Rθ​ with (1−p) Uf(V) p=0(1-p)\,Uf(V)\,p=0(1−p)Uf(V)p=0 equals 000 or 111; moreover Tf≠0T_f\ne0Tf​=0, ∥Tfn∥1/n→0\|T_f^n\|^{1/n}\to0∥Tfn​∥1/n→0, and Δ(Tf)=0\Delta(T_f)=0Δ(Tf​)=0.

Milestones

  • Theorem 1.1 at some angle. The same conclusion for one irrational angle, in the abstract tracial model on ℓ2(Z2)\ell^2(\mathbb Z^2)ℓ2(Z2).
  • Theorem A.1 (product realization). A second model on TN\mathbb T^{\mathbb N}TN: angles θi\theta_iθi​ with ∑θi<∞\sum\theta_i<\infty∑θi​<∞, rationally independent with 111, and f(x)=exp⁡(−∑ci⌊xi+θi⌋)f(x)=\exp(-\sum c_i\lfloor x_i+\theta_i\rfloor)f(x)=exp(−∑ci​⌊xi​+θi​⌋), giving a nonzero quasinilpotent T=Uπ(f)T=U\pi(f)T=Uπ(f) in a II1\mathrm{II}_1II1​ factor with only trivial invariant projections and the stated polar structure.
  • Abstract consequence. Some II1\mathrm{II}_1II1​ factor with separable predual contains a nonzero quasinilpotent operator with no nontrivial invariant projection.

The goal OAI.Invariant233.Results.prescribed_irrational_counterexample is open on the platform.

Significance

Theorem 1.1 answers the Zhu–Fang–Shi question negatively, with the angle fixed in advance and no Diophantine condition. Combined with Dykema's observation that hyperinvariant subspaces of T∈MT\in MT∈M have projections in MMM, it yields (Corollary 1.4) a nonzero quasinilpotent operator on every separable infinite-dimensional Hilbert space with no nontrivial hyperinvariant subspace, so its commutant is a proper, strongly closed, transitive unital algebra. It also shows that, at determinant zero, the Haagerup–Schultz method cannot be supplemented by any invariant projection in the factor for these operators. The conclusion concerns projections in RθR_\thetaRθ​; ordinary invariant subspaces of the Hilbert-space representation are not excluded.

The result is proved in an OpenAI preprint, which has not been peer reviewed. No machine-checked proof exists.

Difficulty

Brown-measure methods give nothing here: at determinant zero the Brown measure is δ0\delta_0δ0​, so Haagerup–Schultz projections are trivial, and point-mass Brown measure does not by itself exclude invariant projections (Dykema–Haagerup, Tucci). One must show directly that a hypothetical invariant projection, viewed as a measurable field of projections, contradicts weighted orthogonality identities along rotation orbits. The weight's logarithmic drops must be rare enough to keep a finite window under control yet strong enough to suppress the infinite tail, and this must work at an arbitrary prescribed angle, which forces large divisible frequencies. Passing from a measurable weight to a continuous one with a single zero requires an intertwining multiplier that may be unbounded.

Formalization scope

  • The circle is AddCircle (1:ℝ) with Haar probability; the zero of fff is at 0∈R/Z0\in\mathbb R/\mathbb Z0∈R/Z, which corresponds to 1∈T1\in\mathbb T1∈T.
  • The Hilbert space is Lp (lp (fun _ : ℤ => ℂ) 2) 2 circleMeasure; Rotation.U is the fibrewise shift and Rotation.V θ multiplies by e2πi(x+kθ)e^{2\pi i(x+k\theta)}e2πi(x+kθ); Rotation.algebra θ is the double commutant of {U,V}\{U,V\}{U,V}.
  • HasOnlyTrivialInvariantProjections M T quantifies over self-adjoint idempotents p∈Mp\in Mp∈M with (1−p)Tp=0(1-p)Tp=0(1−p)Tp=0; no commutation with TTT is required.
  • NormQuasinilpotent T is ∥Tn∥1/n→0\|T^n\|^{1/n}\to0∥Tn∥1/n→0; the determinant is the vector-state Fuglede–Kadison determinant inf⁡ε>0exp⁡12τlog⁡(T∗T+ε)\inf_{\varepsilon>0}\exp\frac12\tau\log(T^*T+\varepsilon)infε>0​exp21​τlog(T∗T+ε), avoiding log⁡0\log0log0.

A complete development needs crossed-product (group-measure-space) von Neumann algebras, measurable fields of projections, the Fuglede–Kadison determinant, and uniform averaging under irrational rotation. Contributions formalizing Theorem 5.2 (the measurable-weight obstruction), Lemma 5.1 (conditional convolution obstruction), Corollary 6.2 (quasinilpotence) and Lemma A.4 (the product algebra is a II1\mathrm{II}_1II1​ factor) are welcome.

Selected references

  • OpenAI, Invariant-projection counterexamples for every irrational rotation, preprint, September 27, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Invariant-projection-counterexamples-for-every-irrational-rotation-September-27-2026/paper.pdf
  • Z. Zhu, J. Fang, R. Shi, On a class of operators in the hyperfinite II1_11​ factor, Math. Scand., 2017. https://doi.org/10.7146/math.scand.a-25625
  • B. Fuglede, R. V. Kadison, Determinant theory in finite factors, Ann. of Math., 1952. https://doi.org/10.2307/1969645
  • U. Haagerup, H. Schultz, Invariant subspaces for operators in a general II1_11​-factor, Publ. Math. IHÉS, 2009. https://doi.org/10.1007/s10240-009-0018-7
  • K. Dykema, H. Schultz, Brown measure and iterates of the Aluthge transform for some operators arising from measurable actions, Trans. Amer. Math. Soc., 2009. https://doi.org/10.1090/S0002-9947-09-04762-X
  • K. Dykema, U. Haagerup, Invariant subspaces of the quasinilpotent DT-operator, J. Funct. Anal., 2004. https://doi.org/10.1016/S0022-1236(03)00167-8
  • G. H. Tucci, Some quasinilpotent generators of the hyperfinite II1_11​ factor, J. Funct. Anal., 2008. https://doi.org/10.1016/j.jfa.2008.03.012
  • K. Dykema, Hyperinvariant subspaces for some B-circular operators, Math. Ann., 2005. https://doi.org/10.1007/s00208-005-0669-8
9 thms1 active userReviewed
Captain: wurtle

Tracial projection methods and uniform property GammaResearch Paper

Motivation

The classification programme for simple nuclear C∗C^*C∗-algebras identifies a class of algebras that are determined by K-theory and traces. Membership in that class is governed by regularity properties: finite nuclear dimension, absorption of the Jiang–Su algebra Z\mathcal ZZ, and strict comparison. Uniform property Γ\GammaΓ, introduced by Castillejos, Evington, Tikuisis, White and Winter, is a central divisibility condition: it asks for projections in a central sequence algebra that cut every trace exactly in half, uniformly across the whole trace space, while preserving trace values against fixed coefficients. Together with strict comparison it is equivalent to Z\mathcal ZZ-stability for simple separable unital nuclear algebras (Castillejos–Evington–Tikuisis–White). Schafhauser, Tikuisis and White asked (Problem XXI of their problem list) whether real rank zero of the uniform tracial ultrapower of the tracial completion already forces uniform property Γ\GammaΓ.

Timeline

  • 1943, 1969, 1970. Murray and von Neumann introduce property Γ\GammaΓ for II1_11​ factors (doi:10.2307/1969107); Dixmier gives its central-projection formulation (doi:10.1007/BF01404306); McDuff studies central sequences and absorption of the hyperfinite factor (doi:10.1112/plms/s3-21.3.443).
  • 1976. Connes classifies injective factors (doi:10.2307/1971057).
  • 1991. Brown and Pedersen introduce real rank zero (doi:10.1016/0022-1236(91)90056-B).
  • 1999. Jiang and Su construct the algebra Z\mathcal ZZ (doi:10.1353/ajm.1999.0012).
  • 2010–2012. Winter and Zacharias define nuclear dimension and the Toms–Winter conjecture is formulated (doi:10.1016/j.aim.2009.12.005); Winter proves finite nuclear dimension implies Z\mathcal ZZ-stability (doi:10.1007/s00222-011-0334-7); Matui and Sato prove strict comparison implies Z\mathcal ZZ-stability with finitely many extremal traces (doi:10.1007/s11511-012-0084-4).
  • 2013. Ozawa introduces uniform tracial completions (J. Math. Sci. Univ. Tokyo).
  • 2021–2022. Castillejos, Evington, Tikuisis, White and Winter introduce uniform property Γ\GammaΓ and prove Z\mathcal ZZ-stability implies finite nuclear dimension (doi:10.1007/s00222-020-01013-1); CETW develop it systematically (doi:10.1093/imrn/rnaa282).
  • 2023. Carrión et al. develop tracially complete C∗C^*C∗-algebras (arXiv:2310.20594).
  • 2025–2026. Schafhauser, Tikuisis and White list Problem XXI (arXiv:2506.10902); Vaccaro, Kessinger–Toms and Fu obtain related implications (arXiv:2604.24682, arXiv:2607.23817, arXiv:2605.21655); Toms constructs a simple separable unital AH algebra without uniform property Γ\GammaΓ (arXiv:2606.12188).

The source of this mission is an OpenAI preprint dated September 23, 2026, which answers Problem XXI affirmatively (and, by separate arguments, also treats the unital Toms–Winter conjecture).

Setting

Let AAA be a unital C∗C^*C∗-algebra with nonempty set T(A)T(A)T(A) of tracial states. The uniform 2-seminorm is

∥a∥2,T(A)=sup⁡τ∈T(A)τ(a∗a)1/2.\|a\|_{2,T(A)}=\sup_{\tau\in T(A)}\tau(a^*a)^{1/2}.∥a∥2,T(A)​=τ∈T(A)sup​τ(a∗a)1/2.

The uniform tracial completion B=A‾T(A)B=\overline A^{T(A)}B=AT(A) consists of bounded sequences in AAA that are Cauchy for ∥⋅∥2,T(A)\|\cdot\|_{2,T(A)}∥⋅∥2,T(A)​, modulo those tending to zero; each τ∈T(A)\tau\in T(A)τ∈T(A) extends to a designated trace τˉ\bar\tauτˉ on BBB. For a free ultrafilter ω\omegaω on N\mathbb NN, the uniform tracial ultrapower BωB^\omegaBω is the algebra of bounded sequences in BBB modulo those whose uniform 2-norm tends to zero along ω\omegaω. Its limit traces are

λ([(bj)])=lim⁡j→ωτˉj(bj),τj∈T(A),\lambda([(b_j)])=\lim_{j\to\omega}\bar\tau_j(b_j),\qquad \tau_j\in T(A),λ([(bj​)])=j→ωlim​τˉj​(bj​),τj​∈T(A),

and Λω\Lambda_\omegaΛω​ denotes the set of these. BBB embeds in BωB^\omegaBω as constant sequences.

A unital C∗C^*C∗-algebra has real rank zero if every self-adjoint element is a norm limit of self-adjoint elements with finite spectrum. AAA is stably finite if every isometry in every matrix algebra over AAA is unitary, and nuclear if its algebraic tensor product with any C∗C^*C∗-algebra carries a unique C∗C^*C∗-norm.

Formalization targets

Goal: Theorem 1.1

Let AAA be unital, separable, simple, infinite-dimensional, nuclear and stably finite with T(A)≠∅T(A)\neq\varnothingT(A)=∅, and let ω\omegaω be a free ultrafilter. If BωB^\omegaBω has real rank zero, then there is a projection p∈Bω∩B′p\in B^\omega\cap B'p∈Bω∩B′ with

λ(px)=12 λ(x)(x∈B, λ∈Λω).\lambda(px)=\tfrac12\,\lambda(x)\qquad(x\in B,\ \lambda\in\Lambda_\omega).λ(px)=21​λ(x)(x∈B, λ∈Λω​).

This is the halving formulation of uniform property Γ\GammaΓ used in Problem XXI. The Lean statement OAI.ComparatorModel.CurrentMain.main is open on the platform.

Significance

The theorem shows that real rank zero at the level of the tracial ultrapower is enough to produce uniform property Γ\GammaΓ, with no restriction on the trace space; the paper also deduces that every trace on BBB is a designated extension (Corollary 1.2). Since uniform property Γ\GammaΓ plus strict comparison gives Z\mathcal ZZ-stability, this links projection structure in tracial ultrapowers to the Toms–Winter regularity theory. The equivalence between the halving formulation and the usual all-mmm formulation is due to Carrión et al.

The result is proved in an OpenAI preprint; it has not been peer reviewed, and no machine-checked proof exists.

Difficulty

Real rank zero supplies many projections in BωB^\omegaBω, but nothing makes them central, and halving must hold simultaneously for every limit trace and every coefficient x∈Bx\in Bx∈B. Divisibility results derived from real rank zero (Vaccaro) give tracially large order-zero maps without centrality; uniform property Γ\GammaΓ needs commutation with all of BBB and exact coefficient identities. Equality of the scalar traces λ(p)\lambda(p)λ(p) alone is not enough. Nuclearity by itself does not suffice either, as Toms' AH example shows, so the real rank zero hypothesis must be used in an essential way.

Formalization scope

  • TracialState A is a positive linear functional with τ(1)=1\tau(1)=1τ(1)=1 and τ(ab)=τ(ba)\tau(ab)=\tau(ba)τ(ab)=τ(ba); the order on AAA is the C∗C^*C∗ order (StarOrderedRing).
  • The uniform tracial completion is the quotient of the star-subalgebra of uniformly 2-Cauchy elements of ℓ∞(N,A)\ell^\infty(\mathbb N,A)ℓ∞(N,A) by uniformly 2-null sequences; the ultrapower is the quotient of ℓ∞(N,B)\ell^\infty(\mathbb N,B)ℓ∞(N,B) by sequences 2-null along U, computed with the designated traces τˉ\bar\tauτˉ.
  • TopologicallySimple, StablyFinite (via CStarMatrix), IsNuclear (subsingleton of C∗C^*C∗-norms on algebraic tensor products, in a fixed universe) and RealRankZero (finite-spectrum self-adjoint approximation) are defined directly.
  • UniformPropertyGammaAt A U asserts a star projection ppp commuting with the image of BBB and halving familyLimitTrace … s for every sequence of traces s : ℕ → TracialState A.
  • MainClaim existentially packages five auxiliary Prop classes (quotient C∗C^*C∗-norm, closure properties of null and Cauchy sequences, existence of ultralimits, and vanishing of limit traces on null sequences). They are true general facts that a proof must establish; they are not assumptions.

A complete development needs ultrapowers and tracial completions of C∗C^*C∗-algebras, nuclearity and completely positive approximation, and real rank zero; all of this is reusable for the other regularity missions of this family. Contributions formalizing Theorem 1.3 (finite-set central splitting) and Corollary 1.2 are welcome.

Selected references

  • OpenAI, Tracial projection methods and uniform property Γ\GammaΓ, preprint, September 23, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Tracial-projection-methods-and-uniform-property-Gamma-September-23-2026/paper.pdf
  • J. Castillejos, S. Evington, A. Tikuisis, S. White, Uniform property Γ\GammaΓ, Int. Math. Res. Not., 2022. https://doi.org/10.1093/imrn/rnaa282
  • J. Castillejos, S. Evington, A. Tikuisis, S. White, W. Winter, Nuclear dimension of simple C∗C^*C∗-algebras, Invent. Math., 2021. https://doi.org/10.1007/s00222-020-01013-1
  • C. Schafhauser, A. Tikuisis, S. White, Nuclear C∗C^*C∗-algebras: 99 problems, 2026. https://arxiv.org/abs/2506.10902
  • J. R. Carrión et al., Tracially Complete C∗C^*C∗-Algebras, 2023. https://arxiv.org/abs/2310.20594
  • L. G. Brown, G. K. Pedersen, C∗C^*C∗-algebras of real rank zero, J. Funct. Anal., 1991. https://doi.org/10.1016/0022-1236(91)90056-B
  • W. Winter, J. Zacharias, The nuclear dimension of C∗C^*C∗-algebras, Adv. Math., 2010. https://doi.org/10.1016/j.aim.2009.12.005
  • H. Matui, Y. Sato, Strict comparison and Z\mathcal ZZ-absorption of nuclear C∗C^*C∗-algebras, Acta Math., 2012. https://doi.org/10.1007/s11511-012-0084-4
  • A. Vaccaro, Stable rank one, tracial local homogeneity and uniform property Γ\GammaΓ, 2026. https://arxiv.org/abs/2604.24682
2 thms1 active userReviewed
Analysis·Captain: wurtle

Universal strong Kadison–Kastler stabilityResearch Paper

Motivation

How rigid is a von Neumann algebra inside B(H)B(H)B(H)? If two algebras M,N⊆B(H)M,N\subseteq B(H)M,N⊆B(H) have unit balls that are uniformly close, must they be the same algebra up to a small change of coordinates? Kadison and Kastler introduced the distance between the unit balls in 1972 (Amer. J. Math. 1972) and asked whether sufficiently close algebras are spatially isomorphic, implemented by a unitary close to the identity. The positive answer for a class of algebras is called (strong) Kadison–Kastler stability. The problem connects perturbation theory, Hochschild cohomology, and Kadison's similarity problem, and it was settled previously only for injective (amenable) algebras, type I algebras, and specific nonamenable examples.

This mission asks for a formal proof of the uniform strong Kadison–Kastler stability theorem stated in an OpenAI preprint dated September 23, 2026 (source): a single tolerance works for all von Neumann algebras on all Hilbert spaces. The preprint has not been peer reviewed and its claims have not been independently verified; on the platform the Lean goal is open.

Background

  • 1972 — Kadison and Kastler introduce the metric and prove stability results for type I algebras (Amer. J. Math. 1972).
  • 1974–1975 — Phillips proves spatial isomorphism for close type I algebras (Pacific J. Math. 1974); Christensen obtains a conjugating unitary near the identity (J. LMS 1975).
  • 1977 — Christensen (Invent. Math. 1977), Johnson (Proc. LMS 1977) and Raeburn–Taylor (JFA 1977) settle the injective case.
  • 1980 — Christensen's theory of near inclusions (Acta Math. 1980).
  • 1982 — Johnson's examples show that for C*-algebras the implementing unitary cannot always be chosen near the identity in a uniform way (Canad. Math. Bull. 1982).
  • 1983 — Haagerup's cyclic similarity estimate (Ann. of Math. 1983).
  • 2010–2012 — Christensen, Sinclair, Smith, White and Winter prove spatial isomorphism for close separable nuclear C*-algebras (PNAS 2010; Acta Math. 2012).
  • 2012–2014 — Cameron, Christensen, Sinclair, Smith, White and Wiggins construct the first nonamenable Kadison–Kastler stable factors, (L∞(X)⋊SLn(Z))⊗ˉR(L^\infty(X)\rtimes SL_n(\mathbb Z))\bar\otimes R(L∞(X)⋊SLn​(Z))⊗ˉ​R for n≥3n\ge3n≥3 (PNAS 2012; Duke 2014).
  • September 2026 — The OpenAI preprint claims uniform stability for all von Neumann algebras (Theorem 1.1, p. 2).

Setting

Let HHH be a complex Hilbert space and B(H)B(H)B(H) the bounded operators with the operator norm. A von Neumann algebra M⊆B(H)M\subseteq B(H)M⊆B(H) is a unital ∗*∗-subalgebra equal to its double commutant (in particular it contains the identity IHI_HIH​). Write M1={x∈M:∥x∥≤1}M_1=\{x\in M:\|x\|\le1\}M1​={x∈M:∥x∥≤1} for its unit ball. The Kadison–Kastler distance is the Hausdorff distance of unit balls,

d(M,N)=max⁡(sup⁡x∈M1inf⁡y∈N1∥x−y∥, sup⁡y∈N1inf⁡x∈M1∥x−y∥).d(M,N)=\max\Bigl(\sup_{x\in M_1}\inf_{y\in N_1}\|x-y\|,\ \sup_{y\in N_1}\inf_{x\in M_1}\|x-y\|\Bigr).d(M,N)=max(x∈M1​sup​y∈N1​inf​∥x−y∥, y∈N1​sup​x∈M1​inf​∥x−y∥).

A unitary u∈B(H)u\in B(H)u∈B(H) conjugates MMM to NNN if uMu∗=NuMu^*=NuMu∗=N.

Formalization targets

Goal: Theorem 1.1 (p. 2)

For every ε>0\varepsilon>0ε>0 there is δ>0\delta>0δ>0 such that for every complex Hilbert space HHH and all von Neumann algebras M,N⊆B(H)M,N\subseteq B(H)M,N⊆B(H) with d(M,N)<δd(M,N)<\deltad(M,N)<δ, there is a unitary u∈B(H)u\in B(H)u∈B(H) with

uMu∗=Nand∥u−IH∥<ε.uMu^*=N\qquad\text{and}\qquad\|u-I_H\|<\varepsilon .uMu∗=Nand∥u−IH​∥<ε.

The tolerance δ\deltaδ depends only on ε\varepsilonε: not on the algebras, their type, their representations, or the size of HHH.

Significance

The result itself. It answers the Kadison–Kastler perturbation question in its strongest uniform form for von Neumann algebras, including all nonamenable and type III cases and non-separable Hilbert spaces. Consequences include that every algebraic or analytic invariant preserved by unitary conjugacy (type, factoriality, property Γ\GammaΓ, Cartan subalgebras) is locally constant in the Kadison–Kastler metric. The analogous C*-algebra statement fails in its uniform-unitary form by Johnson's examples, so the theorem is specific to von Neumann algebras.

Formalizing it. The statement uses only Mathlib's VonNeumannAlgebra, unitary operators and Hausdorff distance, so it is fully expressible today. The proof, however, draws on free probability, tracial ultraproducts, Tomita–Takesaki theory, crossed products, Poisson boundaries and measurable cocycles, most of which are absent from Mathlib. Formalizing even the amenable (injective) case would be a substantial reusable contribution.

Difficulty

Closeness of unit balls supplies nearby elements but no linear or multiplicative correspondence between the algebras, and it gives no control at matrix levels, where perturbation arguments naturally live. For nonamenable algebras the classical route through vanishing Hochschild cohomology is unavailable. The preprint proceeds by cases. For finite factors it proves a uniform bound on all matrix amplifications of commutator maps (Theorem 3.1, p. 11) and corrects nearby unitaries to a measurable cocycle over an amenable boundary action (Section 4). Infinite factors require comparing modular groups through Tomita graphs (Proposition 6.5, p. 41) and aligning the modular action (Proposition 7.1, p. 45) before passing to crossed products (Theorem 8.4, p. 59). General algebras then require aligning centers and passing from separable to arbitrary Hilbert spaces (Section 9) without losing uniformity.

Formalization scope

  • HHH ranges over complex Hilbert spaces (NormedAddCommGroup, InnerProductSpace ℂ, CompleteSpace) in a fixed universe u; δ\deltaδ is chosen before HHH, so the uniformity over Hilbert spaces is part of the statement.
  • VonNeumannAlgebra H is Mathlib's notion; these algebras contain the identity, so "unital with identity IHI_HIH​" is built in.
  • kkDistance M N is Metric.hausdorffDist of the closed unit balls. Both balls contain 000 and are bounded, so the Hausdorff distance is finite and the definition is exactly (1.1).
  • NearConjugacy M N ε asks for a unitary vvv with v M v∗=Nv\,M\,v^*=NvMv∗=N as sets and ∥v−1∥<ε\|v-1\|<\varepsilon∥v−1∥<ε.
  • There is no trivializing reading: the hypotheses are satisfied by M=NM=NM=N, and the conclusion is nontrivial for M≠NM\neq NM=N.

Selected references

  • OpenAI, Universal strong Kadison–Kastler stability, OpenAI Math Release preprint, September 23, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Universal-strong-Kadison-Kastler-stability-September-23-2026/paper.pdf
  • R. V. Kadison, D. Kastler, Perturbations of von Neumann algebras. I. Stability of type, Amer. J. Math. 94 (1972). https://doi.org/10.2307/2373592
  • E. Christensen, Perturbations of type I von Neumann algebras, J. London Math. Soc. (1975). https://doi.org/10.1112/jlms/s2-9.3.395
  • E. Christensen, Perturbation of operator algebras, Invent. Math. 43 (1977). https://doi.org/10.1007/BF01390201
  • B. E. Johnson, Perturbations of Banach algebras, Proc. London Math. Soc. (1977). https://doi.org/10.1112/plms/s3-34.3.439
  • I. Raeburn, J. L. Taylor, Hochschild cohomology and perturbations of Banach algebras, J. Funct. Anal. (1977). https://doi.org/10.1016/0022-1236(77)90072-6
  • E. Christensen, Near inclusions of C-algebras*, Acta Math. 144 (1980). https://doi.org/10.1007/BF02392125
  • B. E. Johnson, A counterexample in the perturbation theory of C-algebras*, Canad. Math. Bull. 25 (1982). https://doi.org/10.4153/CMB-1982-043-4
  • U. Haagerup, Solution of the similarity problem for cyclic representations of C-algebras*, Ann. of Math. 118 (1983). https://doi.org/10.2307/2007028
  • E. Christensen, A. M. Sinclair, R. R. Smith, S. A. White, W. Winter, Perturbations of nuclear C-algebras*, Acta Math. 208 (2012). https://doi.org/10.1007/s11511-012-0075-5
  • J. Cameron, E. Christensen, A. M. Sinclair, R. R. Smith, S. A. White, A. D. Wiggins, Kadison–Kastler stable factors, Duke Math. J. 163 (2014). https://doi.org/10.1215/00127094-2819736
2 thms1 active userReviewed
Mathematical PhysicsProbability·Captain: wurtle

Ground-state condensation in the dilute hard-sphere gasResearch Paper

Motivation

Bose–Einstein condensation (BEC) means that a single one-particle state carries a macroscopic fraction of a many-boson system. It was predicted for the ideal gas by Bose and Einstein (1924–1925) and is observed in dilute atomic gases, but for interacting particles in the thermodynamic limit there was no rigorous proof, even in the ground state. The Penrose–Onsager criterion (Phys. Rev. 1956) identifies condensation with a macroscopic eigenvalue of the one-particle density matrix. Energy asymptotics of the dilute gas are now known to second order, but they do not determine single-orbital occupation, since the one-particle spectral gap closes as the volume grows. Lieb and Yngvason explicitly separated the condensation question from their energy theorem, and Solovej's 2025 survey lists fixed-density ground-state condensation as a major problem in the field (C. R. Physique 2025, Section 5).

This mission asks for a formal proof of ground-state condensation for the dilute three-dimensional hard-sphere Bose gas, as stated in an OpenAI preprint dated September 24, 2026 (source). The preprint has not been peer reviewed and its claims have not been independently verified; on the platform the Lean goal is open.

Background

  • 1924–1925 — Bose and Einstein predict condensation in the ideal Bose gas (Z. Phys. 1924).
  • 1947 — Bogoliubov's theory assumes a macroscopically occupied zero mode.
  • 1956 — Penrose and Onsager's density-matrix criterion for condensation.
  • 1957 — Dyson's bounds on the hard-sphere ground-state energy (Phys. Rev. 1957); Lee, Huang and Yang predict depletion of order ρa3\sqrt{\rho a^3}ρa3​ (Phys. Rev. 1957).
  • 1998 — Lieb and Yngvason prove the leading dilute energy asymptotics 4πρa4\pi\rho a4πρa (PRL 1998).
  • 2002 — Lieb and Seiringer prove BEC for trapped gases in the Gross–Pitaevskii limit (PRL 2002).
  • 2020 — Deuchert and Seiringer: homogeneous Gross–Pitaevskii limit at positive temperature (ARMA 2020).
  • 2021–2026 — Fournais's length scales for BEC (EMS 2021); Fournais–Solovej's Lee–Huang–Yang lower bound including hard cores (Invent. Math. 2023); Basti et al.'s matching upper bound for hard spheres (arXiv:2603.13084); results of Chong–Liang–Nam (JFA 2026) and Junge (arXiv:2603.20776) in joint dilute and large-volume limits.
  • September 2026 — The OpenAI preprint claims condensation at fixed density and fixed exclusion distance (Theorem 1.1, p. 3).

Setting

Let ΛL=(R/LZ)3\Lambda_L=(\mathbb R/L\mathbb Z)^3ΛL​=(R/LZ)3 be the flat torus with torus distance dLd_LdL​. For NNN particles and exclusion distance a>0a>0a>0, the allowed configurations are

ΩN,L,a={X∈ΛLN: dL(xi,xj)>a for i<j}.\Omega_{N,L,a}=\{X\in\Lambda_L^N:\ d_L(x_i,x_j)>a\ \text{for } i<j\}.ΩN,L,a​={X∈ΛLN​: dL​(xi​,xj​)>a for i<j}.

The hard-sphere Hamiltonian is the operator of the Dirichlet form q[f]=∑i=1N∫∣∇if∣2q[f]=\sum_{i=1}^N\int|\nabla_if|^2q[f]=∑i=1N​∫∣∇i​f∣2 on H01(ΩN,L,a)H^1_0(\Omega_{N,L,a})H01​(ΩN,L,a​) restricted to symmetric (bosonic) functions; wave functions vanish on forbidden configurations, and aaa is the scattering length. A ground vector is a normalized bosonic minimizer of qqq. For a normalized bosonic Ψ\PsiΨ, the condensate fraction in the constant orbital φ0=L−3/2\varphi_0=L^{-3/2}φ0​=L−3/2 is

B(Ψ)=⟨φ0,ΓΨ(1)φ0⟩N=1L3∫ΛLN−1∣∫ΛLΨ(x,Y) dx∣2dY∈[0,1],B(\Psi)=\frac{\langle\varphi_0,\Gamma^{(1)}_\Psi\varphi_0\rangle}{N}=\frac1{L^3}\int_{\Lambda_L^{N-1}}\Bigl|\int_{\Lambda_L}\Psi(x,Y)\,dx\Bigr|^2dY\in[0,1],B(Ψ)=N⟨φ0​,ΓΨ(1)​φ0​⟩​=L31​∫ΛLN−1​​​∫ΛL​​Ψ(x,Y)dx​2dY∈[0,1],

and for a density operator it is defined by linearity. The gas parameter is ρa3\rho a^3ρa3 with ρ\rhoρ the density.

Formalization targets

Goal: Theorem 1.1 and Corollary 1.2 (p. 3)

There are absolute constants ε0,c0>0\varepsilon_0,c_0>0ε0​,c0​>0 such that, for all a,ρ>0a,\rho>0a,ρ>0 with ρa3<ε0\rho a^3<\varepsilon_0ρa3<ε0​ and every sequence Nk→∞N_k\to\inftyNk​→∞, Lk→∞L_k\to\inftyLk​→∞ with Nk/Lk3→ρN_k/L_k^3\to\rhoNk​/Lk3​→ρ:

  1. for every choice of (possibly complex) bosonic ground vectors Ψk\Psi_kΨk​,  lim inf⁡kB(Ψk)≥c0\ \liminf_k B(\Psi_k)\ge c_0 liminfk​B(Ψk​)≥c0​;
  2. for every sequence of density operators TkT_kTk​ supported on the bosonic ground spaces, the same bound holds for the occupation of TkT_kTk​ (in particular for the normalized ground-space projections).

The constant c0c_0c0​ does not depend on the gas parameter in this range.

Significance

The result itself. It is a proof of macroscopic condensation in an interacting continuum Bose gas with fixed density and fixed hard core, in the thermodynamic limit, uniformly over all ground states including degenerate ground spaces. Previous rigorous results let the gas parameter tend to zero with the volume, or concerned traps, scaling limits, or positive-temperature settings with different potentials. The theorem gives a positive fraction only; it does not reach the Lee–Huang–Yang depletion law.

Formalizing it. The statement involves Sobolev spaces with Dirichlet conditions on a configuration space of the torus, bosonic symmetry, density operators, and partial traces, none of which are packaged in Mathlib; the Lean development builds them concretely. The proof uses killed Brownian motion, percolation-type path constructions, and second-moment arguments. No machine-checked statement of BEC for an interacting system is known.

Difficulty

Energy estimates alone cannot detect occupation of the constant orbital, because the cost of moving particles out of it is of order L−2L^{-2}L−2 per particle and vanishes in the limit. One must show directly that a typical ground state correlates distant parts of the box. The preprint compares a tagged particle's position in distant cells by moving trajectories along random lattice routes; multiplying local comparison costs along a route loses a factor at every step, so instead it averages over random routes and bounds the second moment of the averaged likelihood, where exact cancellation of normalizers leaves a cost depending only on mutual encounters of two routes (Introduction, pp. 4–5; Section 8). A separate phase argument passes from ∣Ψ∣|\Psi|∣Ψ∣ to complex Ψ\PsiΨ (Lemma 2.3, p. 9).

Formalization scope

  • Configurations are Fin N → Fin 3 → AddCircle L; the allowed set uses the Euclidean torus distance with strict inequality a < dist.
  • The form domain dirichletDomain is the closure, in L2×(L2)3NL^2\times(L^2)^{3N}L2×(L2)3N, of jets of smooth compactly supported test functions with support in the allowed set; energy is the sum of squared L2L^2L2 norms of the partial derivatives. IsGroundVector means: in the domain, bosonic (a.e. permutation invariant), normalized, and of minimal energy among such vectors.
  • occupation is exactly B(Ψ)B(\Psi)B(Ψ); mixedOccupation T is the trace of TTT compressed by the bounded map Ψ↦L−3/2∫Ψ(x,⋅) dx\Psi\mapsto L^{-3/2}\int\Psi(x,\cdot)\,dxΨ↦L−3/2∫Ψ(x,⋅)dx. GroundSupported T says every unit vector in (ker⁡T)⊥(\ker T)^\perp(kerT)⊥ is (the first component of) a ground vector.
  • Density operators are positive bounded operators with trace one, computed in a fixed Hilbert basis.
  • Hypotheses on the sequences are only those of the source; the ground-vector hypothesis is required for every index kkk, which loses nothing since lim inf⁡\liminfliminf depends only on tails.

Selected references

  • OpenAI, Ground-state condensation in the dilute hard-sphere gas, OpenAI Math Release preprint, September 24, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Ground-state-condensation-in-the-dilute-hard-sphere-gas-September-24-2026/paper.pdf
  • O. Penrose, L. Onsager, Bose–Einstein condensation and liquid helium, Phys. Rev. 104 (1956). https://doi.org/10.1103/PhysRev.104.576
  • F. J. Dyson, Ground-state energy of a hard-sphere gas, Phys. Rev. 106 (1957). https://doi.org/10.1103/PhysRev.106.20
  • T. D. Lee, K. Huang, C. N. Yang, Eigenvalues and eigenfunctions of a Bose system of hard spheres and its low-temperature properties, Phys. Rev. 106 (1957). https://doi.org/10.1103/PhysRev.106.1135
  • E. H. Lieb, J. Yngvason, Ground state energy of the low density Bose gas, Phys. Rev. Lett. 80 (1998). https://doi.org/10.1103/PhysRevLett.80.2504
  • E. H. Lieb, R. Seiringer, Proof of Bose–Einstein condensation for dilute trapped gases, Phys. Rev. Lett. 88 (2002). https://doi.org/10.1103/PhysRevLett.88.170409
  • S. Fournais, J. P. Solovej, The energy of dilute Bose gases II: the general case, Invent. Math. (2023). https://doi.org/10.1007/s00222-022-01175-0
  • A. Deuchert, R. Seiringer, Gross–Pitaevskii limit of a homogeneous Bose gas at positive temperature, Arch. Ration. Mech. Anal. (2020). https://doi.org/10.1007/s00205-020-01489-4
  • J. P. Solovej, Mathematical physics of dilute Bose gases, C. R. Physique (2025). https://doi.org/10.5802/crphys.247
  • G. Basti, M. Brooks, S. Cenatiempo, A. Olgiati, B. Schlein, The Lee–Huang–Yang energy for a dilute gas of hard spheres: an upper bound, arXiv:2603.13084 (2026). https://arxiv.org/abs/2603.13084v2
2 thms1 active userReviewed
Dynamical SystemsHarmonic Analysis·Captain: wurtle

A smooth three-torus diffeomorphism with simple Lebesgue spectrumResearch Paper

Motivation: Banach's simple Lebesgue-spectrum problem

A measure-preserving transformation TTT of a probability space acts on square-integrable functions by the Koopman operator UTg=g∘TU_Tg=g\circ TUT​g=g∘T, a unitary operator. Its spectral type (discrete, singular continuous, absolutely continuous) and its multiplicity are basic invariants of ergodic theory. The Lebesgue spectrum is the spectral type of the shift on ℓ2(Z)\ell^2(\mathbb Z)ℓ2(Z), the type of Bernoulli shifts and other strongly chaotic systems, where it occurs with infinite multiplicity. Banach's problem asks whether Lebesgue spectrum can occur with multiplicity one: is there a transformation whose Koopman operator on the orthogonal complement of the constants is unitarily equivalent to multiplication by www on L2(S1)L^2(S^1)L2(S1)? Equivalently, is there a single function whose bilateral orbit under UTU_TUT​ is an orthonormal basis of the mean-zero space? The problem combines spectral theory with the construction of explicit dynamics, and a smooth example would show this spectral behavior is compatible with the regularity of differentiable dynamics.

Timeline

  • 1949 — Rokhlin asks for ergodic automorphisms with simple, or at least finite-multiplicity, Lebesgue spectrum (Uspekhi Mat. Nauk 1949, §4, no. 7).
  • 1960 — Ulam records a real-line form of the question attributed to Banach (A Collection of Mathematical Problems, Interscience, 1960, §6, p. 76).
  • 1970 — Anosov and Katok introduce approximation-by-conjugation constructions of smooth ergodic diffeomorphisms (Trudy MMO 1970).
  • 1978 — Helson and Parry construct cocycles over aperiodic transformations with associated Lebesgue spectrum (Ark. Mat. 1978).
  • 1984 — Mathew and Nadkarni construct a transformation with a Lebesgue component of multiplicity two (Bull. LMS 1984).
  • 1999 — Guenais connects Morse cocycles with flat polynomials and constructs a group action with simple spectrum of mixed type (ETDS 1999).
  • 2001 — Fayad constructs C∞C^\inftyC∞ volume-preserving torus diffeomorphisms with simple (not Lebesgue) spectrum (J. LMS 2001).
  • 2020–2023 — Prikhod'ko constructs a finite-measure flow with simple Lebesgue spectrum (Sb. Math. 2020); Fayad–Forni–Kanigowski (JAMS 2021) and Abdedou–Fayad–Kessi (DCDS 2023) obtain smooth flows with countable Lebesgue multiplicity; el Abdalaoui presents an infinite-measure conservative example (arXiv:1508.06439). None of these gives a probability-preserving map with simple Lebesgue spectrum on the whole mean-zero space.
  • 2026 — The OpenAI preprint A smooth three-torus diffeomorphism with simple Lebesgue spectrum (OpenAI Math Release, September 23, 2026) claims a C∞C^\inftyC∞ volume-preserving diffeomorphism of T3\mathbb T^3T3 with this property. It has not been peer reviewed and its theorem is not formally verified.

Setting

Let T=R/Z\mathbb T=\mathbb R/\mathbb ZT=R/Z and let μ\muμ be normalized Lebesgue (Haar) measure on T3\mathbb T^3T3. A bijection T:T3→T3T:\mathbb T^3\to\mathbb T^3T:T3→T3 is a C∞C^\inftyC∞ diffeomorphism if TTT and T−1T^{-1}T−1 lift locally to C∞C^\inftyC∞ maps of R3\mathbb R^3R3. It is volume preserving if μ(T−1A)=μ(A)\mu(T^{-1}A)=\mu(A)μ(T−1A)=μ(A) for every measurable AAA. Let L02(T3,μ)L^2_0(\mathbb T^3,\mu)L02​(T3,μ) be the closed subspace of complex square-integrable functions with integral zero, and UTg=g∘TU_Tg=g\circ TUT​g=g∘T. Let mmm be Haar measure on the circle and w(z)=e2πizw(z)=e^{2\pi i z}w(z)=e2πiz the first Fourier character.

In Lean (namespace OAI.ThreeTorus), the torus is Fin 3 → UnitAddCircle with the product Haar measure, smoothness is local smooth lifting on Fin 3 → ℝ, L02L^2_0L02​ is the subspace meanZero of Lp ℂ 2 μ, and MainConclusion packages the theorem below.

Formalization targets

Goal: smooth simple Lebesgue spectrum (Theorem 1.1)

There exist a C∞C^\inftyC∞ volume-preserving diffeomorphism TTT of T3\mathbb T^3T3 and a real-valued f∈L02(T3,μ)f\in L^2_0(\mathbb T^3,\mu)f∈L02​(T3,μ) such that

{ f∘Tn:n∈Z } is an orthonormal basis of L02(T3,μ);\{\,f\circ T^n : n\in\mathbb Z\,\}\ \text{is an orthonormal basis of } L^2_0(\mathbb T^3,\mu);{f∘Tn:n∈Z} is an orthonormal basis of L02​(T3,μ);

moreover TTT is ergodic, and there is a unitary W:L02(T3,μ)→L2(S1,m)W:L^2_0(\mathbb T^3,\mu)\to L^2(S^1,m)W:L02​(T3,μ)→L2(S1,m) with

W(g∘T)=w⋅W(g)for all g∈L02.W(g\circ T)=w\cdot W(g)\qquad\text{for all } g\in L^2_0 .W(g∘T)=w⋅W(g)for all g∈L02​.

The goal is published on the platform with status Open.

Significance

The result itself. The theorem answers the probability-preserving form of Banach's problem, with the strongest kind of example: the invariant measure is the standard smooth volume on a compact manifold, the map is C∞C^\inftyC∞, and the conclusion covers the whole mean-zero space, both spectral type and multiplicity. Earlier work produced Lebesgue components, Lebesgue spectrum of higher multiplicity, simple spectrum of other types, flows, or infinite-measure examples; time-ttt maps of simple-Lebesgue flows have infinite multiplicity, so they do not answer the question. The source also derives from it mixing (of all orders, using a separate companion multiple-mixing theorem), zero Kolmogorov–Sinai entropy (via Rokhlin's finite-multiplicity entropy theorem) and vanishing Lyapunov exponents (Corollary 6.1, p. 28).

Formalizing it. The statement exercises Mathlib's LpL^pLp spaces, Haar measure on the additive circle, ergodicity and Fourier characters together. A formal proof would certify a long quantitative construction (successive smooth passages, stationary-phase estimates, Fourier signals) whose convergence must be checked simultaneously in the C∞C^\inftyC∞ topology and in spectral norms.

Difficulty

Smooth constructions by successive conjugation (Anosov–Katok type) naturally produce maps with singular or discrete spectral behavior, because each approximating map is close to a rotation or an integrable twist with pure point or very structured spectrum. Lebesgue spectral type requires the spectral measure of every function to be absolutely continuous with the right density, and simplicity requires a single orbit to span the whole space. Making both hold in the limit, while keeping the limit map C∞C^\inftyC∞, requires controlling spectral densities at every scale and approximating every target function by translates of one fixed vector — the step where generic perturbation arguments give no control.

Formalization scope

  • The torus is Fin 3 → UnitAddCircle with Measure.pi of AddCircle.haarAddCircle; TTT is an Equiv.Perm with Smooth T and Smooth T.symm (local C∞C^\inftyC∞ lifts), and MeasurePreserving T μ μ.
  • L02L^2_0L02​ is the complex subspace of Lp ℂ 2 μ with zero integral; fff is real-valued almost everywhere. The orbit vn=f∘Tnv_n=f\circ T^nvn​=f∘Tn is required to be orthonormal with dense span, i.e. a Hilbert basis indexed by Z\mathbb ZZ.
  • The spectral model is stated with an explicit linear isometric equivalence W : H₀ ≃ₗᵢ[ℂ] CircleH intertwining composition with TTT and multiplication by fourier 1. Ergodicity is Mathlib's Ergodic T μ.
  • Mixing, zero entropy and Lyapunov exponents (Section 6) are not part of the goal.
  • Needed infrastructure: stationary-phase estimates, spectral measures of Koopman operators, smooth volume-preserving changes of coordinates on the torus. Spectral-theory infrastructure for Koopman operators is reusable throughout ergodic theory.

Selected references

  • V. A. Rokhlin, Selected topics from the metric theory of dynamical systems, Uspekhi Mat. Nauk 4 (1949). https://www.mathnet.ru/eng/rm8607
  • S. M. Ulam, A Collection of Mathematical Problems, Interscience Tracts in Pure and Applied Mathematics 8, 1960.
  • D. V. Anosov and A. B. Katok, New examples in smooth ergodic theory. Ergodic diffeomorphisms, Trudy Moskov. Mat. Obshch. 23 (1970). https://www.mathnet.ru/eng/mmo237
  • H. Helson and W. Parry, Cocycles and spectra, Ark. Mat. 16 (1978). https://doi.org/10.1007/BF02385994
  • J. Mathew and M. G. Nadkarni, A measure preserving transformation whose spectrum has Lebesgue component of multiplicity two, Bull. London Math. Soc. 16 (1984). https://doi.org/10.1112/blms/16.4.402
  • M. Guenais, Morse cocycles and simple Lebesgue spectrum, Ergodic Theory Dynam. Systems 19 (1999). https://doi.org/10.1017/S0143385799126579
  • B. R. Fayad, Partially mixing and locally rank one smooth transformations and flows on the torus Td\mathbb T^dTd, d≥3d\ge3d≥3, J. London Math. Soc. 64 (2001). https://doi.org/10.1112/S0024610701002447
  • A. A. Prikhod'ko, On ergodic flows with simple Lebesgue spectrum, Sb. Math. 211 (2020). https://doi.org/10.1070/SM8147
  • B. Fayad, G. Forni and A. Kanigowski, Lebesgue spectrum of countable multiplicity for conservative flows on the torus, J. Amer. Math. Soc. 34 (2021). https://doi.org/10.1090/jams/970
  • OpenAI, A smooth three-torus diffeomorphism with simple Lebesgue spectrum, OpenAI Math Release preprint, September 23, 2026 (Theorem 1.1, p. 1). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-smooth-three-torus-diffeomorphism-with-simple-Lebesgue-spectrum-September-23-2026/paper.pdf
2 thms1 active userReviewed
CombinatoricsTheoretical Computer Science·Captain: wurtle

Edit Distance in l1: Matching Bounds up to Constants in the ExponentResearch Paper

Motivation

Edit distance ED(x,y)\mathrm{ED}(x,y)ED(x,y) is the least number of single-symbol insertions, deletions and substitutions transforming a string xxx into yyy. It is the basic similarity measure for strings, but it is expensive to compute and awkward to index. A standard way around this is to embed strings into ℓ1\ell_1ℓ1​ so that ℓ1\ell_1ℓ1​ distances approximate edit distances; the quality of such a map is its distortion. Low-distortion embeddings give fast approximate nearest-neighbour search and sketching for edit distance, so the best possible distortion has been studied for two decades.

This preprint determines the exponential scale of the optimal distortion: for strings of length at most ddd, it is exp⁡(Θ(log⁡d log⁡log⁡d))\exp(\Theta(\sqrt{\log d\,\log\log d}))exp(Θ(logdloglogd​)), uniformly over finite alphabets.

Background

  • 1966. Levenshtein studies codes correcting insertions, deletions and substitutions.
  • 1974. Wagner and Fischer describe edit scripts through increasing traces (alignments).
  • 1995. Linial, London and Rabinovich develop the geometry of finite metric embeddings into ℓ1\ell_1ℓ1​.
  • 2003. Andoni, Deza, Gupta, Indyk and Raskhodnikova give binary subsets with ℓ1\ell_1ℓ1​ distortion approaching 3/23/23/2.
  • 2006. Khot and Naor prove an Ω(log⁡d/log⁡log⁡d)\Omega(\sqrt{\log d/\log\log d})Ω(logd/loglogd​) lower bound via cuts and Fourier analysis of noisy shifts.
  • 2007. Ostrovsky and Rabani prove the upper bound exp⁡(O(log⁡dlog⁡log⁡d))\exp(O(\sqrt{\log d\log\log d}))exp(O(logdloglogd​)) for binary strings of length ddd.
  • 2009. Krauthgamer and Rabani prove an Ω(log⁡d)\Omega(\log d)Ω(logd) lower bound for binary strings of length ddd.
  • 2026. The OpenAI preprint Edit Distance in ℓ1\ell_1ℓ1​: Matching Bounds up to Constants in the Exponent (dated September 27, 2026) proves a matching lower bound exp⁡(Ω(log⁡dlog⁡log⁡d))\exp(\Omega(\sqrt{\log d\log\log d}))exp(Ω(logdloglogd​)). It has not been peer reviewed; the Lean goal is open on this platform.

Setting

For a finite alphabet Σ\SigmaΣ and d≥1d \ge 1d≥1, let Σ≤d\Sigma^{\le d}Σ≤d be the set of strings of length at most ddd, including the empty string. Edit scripts may pass through strings of any length. Let ℓ1\ell_1ℓ1​ be the space of absolutely summable real sequences. Define

EΣ(d)=inf⁡f:Σ≤d↪ℓ1(max⁡x≠y∥f(x)−f(y)∥1ED(x,y))(max⁡x≠yED(x,y)∥f(x)−f(y)∥1),E_\Sigma(d) = \inf_{f:\Sigma^{\le d}\hookrightarrow \ell_1}\Big(\max_{x\ne y}\frac{\|f(x)-f(y)\|_1}{\mathrm{ED}(x,y)}\Big)\Big(\max_{x\ne y}\frac{\mathrm{ED}(x,y)}{\|f(x)-f(y)\|_1}\Big),EΣ​(d)=f:Σ≤d↪ℓ1​inf​(x=ymax​ED(x,y)∥f(x)−f(y)∥1​​)(x=ymax​∥f(x)−f(y)∥1​ED(x,y)​),

the infimum over injective maps with no restriction on dimension or computability.

In Lean (OAI.EditDistortion), edit x y is the least length of a Script true n x y of unit insertions, deletions and substitutions on List Alpha; L1 = lp (fun _ : ℕ => ℝ) 1; distortion ρ f is the product of the two maximal ratios for an embedding f : X ↪ L1; leastDistortion is the infimum over embeddings; E Alpha d applies this to {x : List Alpha // x.length ≤ d}; exponentScale c d = exp(c·sqrt(log d · log log d)).

Formalization targets

Goal: Theorem 1.1

There are absolute c,C>0c, C > 0c,C>0 and d0d_0d0​ such that for every d≥d0d \ge d_0d≥d0​ and every finite alphabet with ∣Σ∣≥2|\Sigma| \ge 2∣Σ∣≥2,

exp⁡(clog⁡d log⁡log⁡d)≤EΣ(d)≤exp⁡(Clog⁡d log⁡log⁡d).\exp\big(c\sqrt{\log d\,\log\log d}\big) \le E_\Sigma(d) \le \exp\big(C\sqrt{\log d\,\log\log d}\big).exp(clogdloglogd​)≤EΣ​(d)≤exp(Clogdloglogd​).

The lower bound is witnessed by a finite set of binary strings of one common length at most ddd, and the same two bounds hold for sup⁡2≤∣Σ∣<∞EΣ(d)\sup_{2 \le |\Sigma| < \infty} E_\Sigma(d)sup2≤∣Σ∣<∞​EΣ​(d).

Significance

The result. Theorem 1.1 shows that the Ostrovsky–Rabani embedding is optimal up to the constant in the exponent, closing the gap between Ω(log⁡d)\Omega(\log d)Ω(logd) (Krauthgamer–Rabani) and exp⁡(O(log⁡dlog⁡log⁡d))\exp(O(\sqrt{\log d\log\log d}))exp(O(logdloglogd​)). It rules out any ℓ1\ell_1ℓ1​ embedding of edit distance with distortion exp⁡(o(log⁡dlog⁡log⁡d))\exp(o(\sqrt{\log d\log\log d}))exp(o(logdloglogd​)), which limits ℓ1\ell_1ℓ1​-based approaches to approximate edit-distance search.

Formalizing it. No machine-checked proof exists; the source is an unrefereed preprint. The upper bound relies on Ostrovsky and Rabani's fixed-length theorem (Theorem 5.1 in the preprint, taken from the literature) plus reductions proved in the preprint, so a full formalization also requires formalizing the Ostrovsky–Rabani embedding. The lower bound (Sections 2–4) is the new contribution.

Difficulty

Any lower bound must control every alignment of two strings, including matchings that cross the boundaries of the blocks used to build them, because an insertion or deletion shifts an entire suffix. Earlier Fourier-analytic arguments (Khot–Naor) and recursive constructions (Krauthgamer–Rabani) lose too much to reach the log⁡dlog⁡log⁡d\sqrt{\log d\log\log d}logdloglogd​ exponent; reaching it requires a construction whose combinatorial separation and an ℓ1\ell_1ℓ1​ displacement inequality match at that scale.

Formalization scope

  • Strings are List Alpha with Fintype Alpha, 2 ≤ card Alpha; the domain includes the empty string and all lengths up to ddd.
  • Edit distance includes substitutions; edit is an sInf over script lengths, which is attained since scripts always exist.
  • distortion uses sSup over finitely many ratios (the domain is finite), so no default values arise; leastDistortion is sInf over all injective maps into ℓ1(N)\ell_1(\mathbb{N})ℓ1​(N).
  • BinaryWitness c d asks for a finite nonempty set of Boolean lists of common length n≤dn \le dn≤d whose least distortion is at least exponentScale c d; a singleton has least distortion 000, so the witness must be nontrivial.

The statement cannot be met trivially: both bounds are required with constants uniform in the alphabet.

Needed infrastructure: cut decompositions of finite ℓ1\ell_1ℓ1​ metrics, Fourier analysis on finite abelian groups, prime-number estimates (Rosser–Schoenfeld), and the Ostrovsky–Rabani construction. Contributions toward the displacement inequality (Proposition 2.2) or the recursive construction (Proposition 3.1) are welcome.

Selected references

  • OpenAI, Edit Distance in ℓ1\ell_1ℓ1​: Matching Bounds up to Constants in the Exponent, OpenAI Math Release preprint, September 27, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Edit-Distance-in-l1-Matching-Bounds-up-to-Constants-in-the-Exponent-September-27-2026/paper.pdf
  • R. Ostrovsky, Y. Rabani, Low distortion embeddings for edit distance, J. ACM 54(5), Article 23, 2007. https://doi.org/10.1145/1284320.1284322
  • R. Krauthgamer, Y. Rabani, Improved lower bounds for embeddings into L1L_1L1​, SIAM J. Comput. 38(6), 2009.
  • S. Khot, A. Naor, Nonembeddability theorems via Fourier analysis, Math. Ann. 334(4), 2006. https://doi.org/10.1007/s00208-005-0745-0
  • A. Andoni, M. Deza, A. Gupta, P. Indyk, S. Raskhodnikova, Lower bounds for embedding edit distance into normed spaces, SODA 2003.
  • N. Linial, E. London, Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15(2), 1995. https://doi.org/10.1007/BF01200757
  • V. I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Physics Doklady 10(8), 1966.
  • R. A. Wagner, M. J. Fischer, The string-to-string correction problem, J. ACM 21(1), 1974. https://doi.org/10.1145/321796.321811
2 thms1 active userReviewed
Discrete Geometry·Captain: wurtle

The Mahler Conjecture for General Convex BodiesResearch Paper

Motivation

The volume product of a convex body measures how large a body and its polar can simultaneously be. For a body without a distinguished centre, the polar is taken about the point that makes it smallest, the Santaló point, so the product is invariant under all invertible affine maps. The Blaschke–Santaló inequality identifies ellipsoids as the maximizers. Mahler's conjecture for general convex bodies asks for the minimizers and predicts simplices, with minimum value (n+1)n+1/(n!)2(n+1)^{n+1}/(n!)^2(n+1)n+1/(n!)2. The question arose from Mahler's work on polarity and the geometry of numbers, and it is the sharp form of the Bourgain–Milman reverse Santaló inequality.

This mission asks for a formal proof of the general Mahler conjecture with its equality case, as stated in an OpenAI preprint dated September 22, 2026 (source). The preprint has not been peer reviewed and its claims have not been independently verified; on the platform the Lean goal is open.

Timeline

  • 1938–1939 — Mahler proves the planar inequality among polygons with triangles as equality cases (Ein Minimalproblem für konvexe Polygone, Mathematica (Zutphen) B, 1938) and formulates the higher-dimensional problem (Časopis 1939).
  • 1949 — Santaló's affine invariant and the centre now named after him (Portugaliae Math., 1949).
  • 1987 — Bourgain and Milman prove an inverse Santaló inequality with an exponential constant (Invent. Math. 1987).
  • 1991 — Meyer completes the planar case for arbitrary convex bodies: triangles are exactly the minimizers (Monatsh. Math. 1991).
  • 2006 — Meyer and Reisner use shadow systems to prove the sharp inequality for polytopes with at most n+3n+3n+3 vertices (Mathematika 2006).
  • 2008–2012 — Kuperberg's explicit lower bounds via Gauss linking integrals (GAFA 2008); Nazarov's complex-analytic proof of Bourgain–Milman (GAFA seminar 2012).
  • 2011 — Kim and Reisner prove strict local minimality at every simplex (Mathematika 2011).
  • 2018 — Klartag's cone/Laplace-transform formulation of Mahler volumes (Adv. Math. 2018).
  • 2024 — Mastrantonis and Rubinstein extend Nazarov's method to nonsymmetric bodies (arXiv:2206.06188).
  • 2026 — Chen, Li, Xi and Xu prove the three-dimensional general case with tetrahedra as minimizers (arXiv:2605.09334).
  • September 2026 — The OpenAI preprint claims the general conjecture in every dimension (Theorem 1.1, p. 1).

Setting

A convex body K⊂RnK\subset\mathbb R^nK⊂Rn is a compact convex set with nonempty interior; ∣⋅∣|\cdot|∣⋅∣ is Lebesgue measure and ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle⟨⋅,⋅⟩ the Euclidean inner product. For an interior point zzz, the polar of KKK about zzz is

(K−z)∘={y∈Rn: ⟨y,x−z⟩≤1 for all x∈K},(K-z)^\circ=\{y\in\mathbb R^n:\ \langle y,x-z\rangle\le1\ \text{for all }x\in K\},(K−z)∘={y∈Rn: ⟨y,x−z⟩≤1 for all x∈K},

and the volume product is

P(K)=inf⁡z∈int⁡K∣K∣ ∣(K−z)∘∣.P(K)=\inf_{z\in\operatorname{int}K}|K|\,|(K-z)^\circ|.P(K)=z∈intKinf​∣K∣∣(K−z)∘∣.

The infimum is attained at the unique Santaló point s(K)s(K)s(K). A simplex is the convex hull of n+1n+1n+1 affinely independent points.

Formalization targets

Goal: the general Mahler conjecture (Theorem 1.1, p. 1)

For every n≥1n\ge1n≥1 and every convex body K⊂RnK\subset\mathbb R^nK⊂Rn,

P(K) ≥ (n+1)n+1(n!)2,P(K)\ \ge\ \frac{(n+1)^{n+1}}{(n!)^2},P(K) ≥ (n!)2(n+1)n+1​,

with equality if and only if KKK is a simplex.

Significance

The result itself. It is the exact form of a problem open since the 1930s and previously settled only in dimensions 222 and 333 and for polytopes with few vertices. Because the infimum over centres is taken, it gives the same lower bound for ∣K∣∣(K−z)∘∣|K||(K-z)^\circ|∣K∣∣(K−z)∘∣ at every interior point zzz. Via the known geometric-to-functional implication, the preprint derives the sharp functional Mahler inequality for log-concave functions and an entropy–transport inequality (Corollary 1.2, p. 4; Corollary 8.1, p. 41). The symmetric conjecture, with the larger constant 4n/n!4^n/n!4n/n!, is a different statement treated in a companion preprint.

Formalizing it. The proof combines convex cones and their Laplace transforms, Gaussian Sobolev calculus, Moreau's decomposition, matrix divided differences, and certified one-variable inequalities. A formal proof would provide checked versions of these tools and of the Santaló point's existence and uniqueness. No machine-checked proof of the conjecture in any dimension n≥2n\ge2n≥2 is known.

Difficulty

Symmetrization does not apply, the volume product is not convex along natural deformations except in restricted families (shadow systems), and local minimality at simplices says nothing about distant bodies. In the preprint's route the main obstacle (Introduction, pp. 2–3) is that the Jacobian matrices Pz=DΠC(Z+ξz)P_z=D\Pi_C(Z+\xi_z)Pz​=DΠC​(Z+ξz​) of the Gaussian-averaged cone projections neither commute nor increase in zzz: bounding them separately loses both the sharp constant and the equality case. Controlling them jointly requires comparing the whole family with spectral thresholds of a linear Gaussian matrix (Sections 5–7), and equality must then force the cone to split into half-lines.

Formalization scope

  • Bodies are subsets of EuclideanSpace ℝ (Fin n) with IsCompact, Convex ℝ and nonempty interior, and n≥1n\ge1n≥1.
  • polarAt K z is the polar about zzz; volumeProduct K is the sInf over interior K of (volume K).toReal * (volume (polarAt K z)).toReal. For an interior zzz the polar is bounded, so toReal reads the true volume; the index set is nonempty because the interior is.
  • The goal is a conjunction: the inequality, and volumeProduct K = (n+1)^(n+1)/(n!)^2 iff K = convexHull ℝ (range v) for some affinely independent v : Fin (n+1) → _.
  • The Santaló point is not named in Lean; using the infimum over interior points is equivalent to evaluating at s(K)s(K)s(K) because the infimum is attained there (Section 2 of the preprint).

Welcome contributions: polar bodies and their volumes in Mathlib, the Santaló point, Laplace transforms of convex cones, and Gaussian integration by parts.

Selected references

  • OpenAI, The Mahler Conjecture for General Convex Bodies, OpenAI Math Release preprint, September 22, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-Mahler-Conjecture-for-General-Convex-Bodies-September-22-2026/paper.pdf
  • OpenAI, The symmetric Mahler conjecture and its equality cases, OpenAI Math Release preprint, September 22, 2026. https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-symmetric-Mahler-conjecture-and-its-equality-cases-September-22-2026/paper.pdf
  • K. Mahler, Ein Übertragungsprinzip für konvexe Körper, Časopis Pěst. Mat. Fys. 68 (1939). https://doi.org/10.21136/CPMF.1939.109441
  • M. Meyer, Convex bodies with minimal volume product in R2\mathbb R^2R2, Monatsh. Math. (1991). https://doi.org/10.1007/BF01351770
  • J. Bourgain, V. Milman, New volume ratio properties for convex symmetric bodies in Rn\mathbb R^nRn, Invent. Math. (1987). https://doi.org/10.1007/BF01388911
  • G. Kuperberg, From the Mahler conjecture to Gauss linking integrals, GAFA (2008). https://doi.org/10.1007/s00039-008-0669-4
  • M. Meyer, S. Reisner, Shadow systems and volumes of polar convex bodies, Mathematika (2006). https://doi.org/10.1112/S0025579300000061
  • J. Kim, S. Reisner, Local minimality of the volume-product at the simplex, Mathematika (2011). https://doi.org/10.1112/S0025579310001555
  • B. Klartag, Isotropic constants and Mahler volumes, Adv. Math. (2018). https://doi.org/10.1016/j.aim.2018.03.009
  • V. Mastrantonis, Y. A. Rubinstein, The Nazarov proof of the non-symmetric Bourgain–Milman inequality, Indiana Univ. Math. J. (2024). https://arxiv.org/abs/2206.06188
  • S. Chen, Y. Li, D. Xi, Z. Xu, The Mahler Conjecture in Three Dimensions, preprint (2026). https://arxiv.org/abs/2605.09334v3
2 thms1 active userReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Affine Processes on Positive Semidefinite Matrices I: Every Affine Process on the PSD Cone Is Regular and Feller, with Generator (2.12) Given by an Admissible Parameter SetResearch Paper

Motivation

Matrix-valued affine processes on the cone of positive semidefinite matrices are used in finance as models of stochastic covariance: multi-asset option pricing with stochastic volatility and correlation, and fixed-income models with stochastically correlated risk factors and default intensities. The best-known example is the Wishart process of Bru (1991). What makes these models tractable is that the Laplace transform of the state is exponential-affine in the initial state, with exponents that solve ordinary differential equations of Riccati type.

Cuchiero, Filipović, Mayerhofer and Teichmann (2011) give the mathematical foundation: a complete characterization of stochastically continuous affine processes on Sd+S_d^+Sd+​ through an admissible parameter set. Their Theorem 2.4 has two halves. This mission formalizes the first, necessity, half: every affine process on Sd+S_d^+Sd+​ is regular and Feller, and its generator and Riccati equations are given by an admissible parameter set.

Timeline. Duffie, Filipović and Schachermayer (2003) characterized regular affine processes on the canonical state space R+m×Rn\mathbb R_+^m \times \mathbb R^nR+m​×Rn, assuming regularity. Keller-Ressel, Schachermayer and Teichmann showed that on that state space stochastic continuity already implies regularity. The 2011 paper carries both the characterization and the regularity result over to Sd+S_d^+Sd+​, a non-polyhedral cone with a curved boundary, on which the drift must satisfy the new condition b⪰(d−1)αb \succeq (d-1)\alphab⪰(d−1)α.

Setting

Let SdS_dSd​ be the space of real symmetric d×dd\times dd×d matrices with scalar product ⟨x,y⟩=Tr(xy)\langle x,y\rangle = \mathrm{Tr}(xy)⟨x,y⟩=Tr(xy) and norm ∥x∥=⟨x,x⟩1/2\|x\| = \langle x,x\rangle^{1/2}∥x∥=⟨x,x⟩1/2. Let Sd+S_d^+Sd+​ be the cone of positive semidefinite matrices and Sd++S_d^{++}Sd++​ its interior, and write x⪯yx \preceq yx⪯y when y−x∈Sd+y - x \in S_d^+y−x∈Sd+​.

A time-homogeneous Markov process XXX on Sd+S_d^+Sd+​ is described by sub-stochastic transition kernels pt(x,dξ)p_t(x,d\xi)pt​(x,dξ), t≥0t\ge 0t≥0. Mass that is lost goes to a cemetery state Δ\DeltaΔ. The kernels satisfy the Chapman–Kolmogorov equations, and the semigroup is Ptf(x)=∫f(ξ) pt(x,dξ)P_tf(x) = \int f(\xi)\,p_t(x,d\xi)Pt​f(x)=∫f(ξ)pt​(x,dξ). The process is affine (Definition 2.1) if it is stochastically continuous, i.e. ps(x,⋅)→pt(x,⋅)p_s(x,\cdot) \to p_t(x,\cdot)ps​(x,⋅)→pt​(x,⋅) weakly as s→ts \to ts→t, and if there are φ:R+×Sd+→R+\varphi : \mathbb R_+ \times S_d^+ \to \mathbb R_+φ:R+​×Sd+​→R+​ and ψ:R+×Sd+→Sd+\psi : \mathbb R_+\times S_d^+ \to S_d^+ψ:R+​×Sd+​→Sd+​ with

∫Sd+e−⟨u,ξ⟩ pt(x,dξ)=e−φ(t,u)−⟨ψ(t,u),x⟩,t≥0, u,x∈Sd+.\int_{S_d^+} e^{-\langle u,\xi\rangle}\,p_t(x,d\xi) = e^{-\varphi(t,u) - \langle\psi(t,u),x\rangle}, \qquad t\ge0,\ u,x\in S_d^+.∫Sd+​​e−⟨u,ξ⟩pt​(x,dξ)=e−φ(t,u)−⟨ψ(t,u),x⟩,t≥0, u,x∈Sd+​.

It is regular (Definition 2.2) if F(u)=∂tφ(t,u)∣t=0+F(u) = \partial_t\varphi(t,u)|_{t=0+}F(u)=∂t​φ(t,u)∣t=0+​ and R(u)=∂tψ(t,u)∣t=0+R(u) = \partial_t\psi(t,u)|_{t=0+}R(u)=∂t​ψ(t,u)∣t=0+​ exist and are continuous at u=0u=0u=0.

An admissible parameter set (α,b,βij,c,γ,m,μ)(\alpha, b, \beta^{ij}, c, \gamma, m, \mu)(α,b,βij,c,γ,m,μ), associated with a bounded continuous truncation function χ\chiχ (equal to the identity near 000), consists of:

  • a diffusion coefficient α∈Sd+\alpha \in S_d^+α∈Sd+​ and a constant drift b⪰(d−1)αb \succeq (d-1)\alphab⪰(d−1)α;
  • killing rates c≥0c \ge 0c≥0 and γ∈Sd+\gamma \in S_d^+γ∈Sd+​;
  • a jump measure mmm with ∫(∥ξ∥∧1) m(dξ)<∞\int(\|\xi\|\wedge1)\,m(d\xi)<\infty∫(∥ξ∥∧1)m(dξ)<∞;
  • a matrix μ\muμ of finite signed measures with μ(E)∈Sd+\mu(E) \in S_d^+μ(E)∈Sd+​, defining M(x,dξ)=⟨x,μ(dξ)⟩/(∥ξ∥2∧1)M(x,d\xi) = \langle x,\mu(d\xi)\rangle/(\|\xi\|^2\wedge1)M(x,dξ)=⟨x,μ(dξ)⟩/(∥ξ∥2∧1);
  • a linear drift B(x)=∑i,jβijxijB(x) = \sum_{i,j}\beta^{ij}x_{ij}B(x)=∑i,j​βijxij​.

These are subject to the boundary conditions (2.9) and (2.11) for x,u∈Sd+x,u \in S_d^+x,u∈Sd+​ with ⟨x,u⟩=0\langle x,u\rangle = 0⟨x,u⟩=0. The space S+\mathcal S_+S+​ consists of restrictions to Sd+S_d^+Sd+​ of rapidly decreasing smooth functions on SdS_dSd​.

Formalization targets

Goal: Theorem 2.4, first part

If XXX is affine on Sd+S_d^+Sd+​, then XXX is regular and Feller, S+\mathcal S_+S+​ lies in the domain of its generator A\mathcal AA on C0(Sd+)C_0(S_d^+)C0​(Sd+​), and there is an admissible parameter set such that for f∈S+f \in \mathcal S_+f∈S+​

Af(x)=12∑Aijkl(x) ∂ij∂klf(x)+∑(bij+Bij(x)) ∂ijf(x)−(c+⟨γ,x⟩)f(x)+∫(f(x+ξ)−f(x)) m(dξ)+∫(f(x+ξ)−f(x)−⟨χ(ξ),∇f(x)⟩) M(x,dξ),\mathcal Af(x) = \tfrac12\sum A_{ijkl}(x)\,\partial_{ij}\partial_{kl}f(x) + \sum (b_{ij}+B_{ij}(x))\,\partial_{ij}f(x) - (c+\langle\gamma,x\rangle)f(x) + \int (f(x+\xi)-f(x))\,m(d\xi) + \int \big(f(x+\xi)-f(x)-\langle\chi(\xi),\nabla f(x)\rangle\big)\,M(x,d\xi),Af(x)=21​∑Aijkl​(x)∂ij​∂kl​f(x)+∑(bij​+Bij​(x))∂ij​f(x)−(c+⟨γ,x⟩)f(x)+∫(f(x+ξ)−f(x))m(dξ)+∫(f(x+ξ)−f(x)−⟨χ(ξ),∇f(x)⟩)M(x,dξ),

with Aijkl(x)=xikαjl+xilαjk+xjkαil+xjlαikA_{ijkl}(x) = x_{ik}\alpha_{jl}+x_{il}\alpha_{jk}+x_{jk}\alpha_{il}+x_{jl}\alpha_{ik}Aijkl​(x)=xik​αjl​+xil​αjk​+xjk​αil​+xjl​αik​. In addition, φ,ψ\varphi,\psiφ,ψ solve ∂tφ=F(ψ)\partial_t\varphi = F(\psi)∂t​φ=F(ψ), φ(0,u)=0\varphi(0,u)=0φ(0,u)=0, ∂tψ=R(ψ)\partial_t\psi = R(\psi)∂t​ψ=R(ψ), ψ(0,u)=u\psi(0,u) = uψ(0,u)=u, with

F(u)=⟨b,u⟩+c−∫(e−⟨u,ξ⟩−1) m(dξ),R(u)=−2uαu+B⊤(u)+γ−∫e−⟨u,ξ⟩−1+⟨χ(ξ),u⟩∥ξ∥2∧1 μ(dξ).F(u) = \langle b,u\rangle + c - \int (e^{-\langle u,\xi\rangle}-1)\,m(d\xi),\qquad R(u) = -2u\alpha u + B^\top(u) + \gamma - \int \frac{e^{-\langle u,\xi\rangle}-1+\langle\chi(\xi),u\rangle}{\|\xi\|^2\wedge1}\,\mu(d\xi).F(u)=⟨b,u⟩+c−∫(e−⟨u,ξ⟩−1)m(dξ),R(u)=−2uαu+B⊤(u)+γ−∫∥ξ∥2∧1e−⟨u,ξ⟩−1+⟨χ(ξ),u⟩​μ(dξ).

Milestones, in attack order

  1. Lemma 3.1 and Lemma 3.3: order-preserving, continuous, analytic semiflows map Sd++S_d^{++}Sd++​ into Sd++S_d^{++}Sd++​.
  2. Lemma 3.2: semiflow identities, monotonicity, continuity and analyticity of φ,ψ\varphi,\psiφ,ψ.
  3. Proposition 3.4: Feller and regular.
  4. Lemmas 4.1 and 4.4: zero divisors in the cone, and linear extension of additive maps.
  5. Proposition 4.9: F,RF,RF,R have the form (2.16)–(2.17) with b∈Sd+b\in S_d^+b∈Sd+​.
  6. Lemma B.2 and Theorem B.3: exponentials lie in S+\mathcal S_+S+​ and span a dense subspace.
  7. Proposition 4.12: the generator formula (2.12) on S+\mathcal S_+S+​.
  8. Lemma 4.17 and Proposition 4.18: derivatives of det⁡\detdet at diagonal matrices, and the drift condition b⪰(d−1)αb\succeq(d-1)\alphab⪰(d−1)α.

Significance

The result. Theorem 2.4 reduces the study of affine processes on Sd+S_d^+Sd+​ to finitely many parameters. Any such process, a priori specified only through its Laplace transform, has the Lévy–Khintchine-type generator (2.12), its Laplace exponents solve the Riccati system, and its parameters obey the admissibility conditions. The drift condition b⪰(d−1)αb\succeq(d-1)\alphab⪰(d−1)α is the matrix analogue of the Feller condition, and for d≥2d\ge2d≥2 it excludes affine diffusions on Sd+S_d^+Sd+​ with zero constant drift. The Feller property yields càdlàg versions, and the generator formula is the starting point for the semimartingale description and for the converse existence result.

Formalizing it. The theorem is proved in the paper, and this mission produces a machine-checked version of the necessity direction. Along the way it builds reusable infrastructure: a Lean model of Markov transition families on a cone, Feller semigroups on C0C_0C0​ of a closed cone, generators on Schwartz-type test spaces with the symmetric-matrix derivative convention, and the positive semidefinite cone's order and boundary facts. No machine-checked proof of this theorem, or of its R+m×Rn\mathbb R_+^m\times\mathbb R^nR+m​×Rn predecessor, is known to exist.

Difficulty

The definition assumes only stochastic continuity and the exponential-affine form of the Laplace transform; differentiability in time is not given. Obtaining regularity, and hence the Riccati equations, needs the positivity statement of Lemma 3.3. Its proof uses analyticity in uuu and the boundary geometry of Sd+S_d^+Sd+​. Identifying FFF and RRR requires Lévy–Khintchine representations on cones and on SdS_dSd​, and a convergence theorem for Laplace transforms. The admissibility conditions on the boundary come from support considerations at each boundary point. The drift condition (2.4) is not captured by the conditions read off from Laplace exponents at boundary points along single directions; it is a genuinely matrix-valued constraint coupling bbb and α\alphaα. Extending the generator formula from exponentials to all of S+\mathcal S_+S+​ needs a density result in a Fréchet topology and the closedness of the generator.

Formalization scope

  • Matrices are Fin d → Fin d → ℝ, with ⟨x,y⟩=∑xijyji\langle x,y\rangle=\sum x_{ij}y_{ji}⟨x,y⟩=∑xij​yji​ and ∥x∥=⟨x,x⟩1/2\|x\|=\langle x,x\rangle^{1/2}∥x∥=⟨x,x⟩1/2. Mathlib's positive semidefiniteness, which includes symmetry over R\mathbb RR, defines Sd+S_d^+Sd+​. The state space is the subtype Sd+S_d^+Sd+​ with its subspace topology and Borel σ\sigmaσ-algebra.
  • Transition families are Mathlib kernels indexed by t∈Rt\in\mathbb Rt∈R and constrained only for t≥0t\ge0t≥0. Sub-stochasticity encodes the cemetery. Stochastic continuity is convergence of integrals of bounded continuous functions as s→ts\to ts→t within [0,∞)[0,\infty)[0,∞).
  • The exponents φ,ψ\varphi,\psiφ,ψ are functions on R×Md\mathbb R\times M_dR×Md​, used at t≥0t\ge0t≥0 and positive semidefinite arguments. Analyticity on Sd++S_d^{++}Sd++​ is analyticity of y↦ψ(t,(y+y⊤)/2)y\mapsto\psi(t,(y+y^\top)/2)y↦ψ(t,(y+y⊤)/2) on an open subset of MdM_dMd​.
  • The matrix measure μ\muμ is encoded as H dνH\,d\nuHdν with ν\nuν finite and HHH positive semidefinite and integrable. This loses nothing, since ν=∑iμii\nu = \sum_i\mu_{ii}ν=∑i​μii​ dominates every μij\mu_{ij}μij​.
  • S+\mathcal S_+S+​ is the set of restrictions of Schwartz functions on MdM_dMd​. Partial derivatives ∂/∂xij\partial/\partial x_{ij}∂/∂xij​ of functions on SdS_dSd​ are taken in the direction 12(Eij+Eji)\tfrac12(E^{ij}+E^{ji})21​(Eij+Eji), per §1.2 of the paper. Lemma 4.17 alone uses raw entry derivatives of det⁡\detdet on MdM_dMd​, as its proof does.
  • The Feller property uses the platform definition EthierKurtz.IsStronglyContinuousContractionSemigroup on C0(Sd+)C_0(S_d^+)C0​(Sd+​). "f∈D(A)f\in D(\mathcal A)f∈D(A) and Af=g\mathcal Af=gAf=g" is uniform convergence of (Ptf−f)/t(P_tf-f)/t(Pt​f−f)/t to ggg on Sd+S_d^+Sd+​.
  • Lean assigns the value 000 to the integral of a non-integrable function. Wherever a statement concludes a formula containing an integral, it therefore also concludes integrability of the integrand, so the formula cannot hold through this default value. Regularity and the Feller property are conclusions, never hypotheses, of the goal. The drift condition (2.4) is part of admissibility in the goal; Propositions 4.9, 4.12 and 4.18 use admissibility without (2.4) and b∈Sd+b\in S_d^+b∈Sd+​, as in the paper.
  • Contributions are welcome on any milestone. The matrix lemmas (3.1, 3.3, 4.1, 4.4, 4.17) are self-contained, and Lemma B.2 and Theorem B.3 concern only Schwartz functions.

Selected references

  • C. Cuchiero, D. Filipović, E. Mayerhofer, J. Teichmann, Affine processes on positive semidefinite matrices, Ann. Appl. Probab. 21 (2011) 397–463; cited as arXiv:0910.0137v3. https://arxiv.org/abs/0910.0137
  • D. Duffie, D. Filipović, W. Schachermayer, Affine processes and applications in finance, Ann. Appl. Probab. 13 (2003) 984–1053. https://doi.org/10.1214/aoap/1060202833
  • M. Keller-Ressel, W. Schachermayer, J. Teichmann, Affine processes are regular, Probab. Theory Related Fields 151 (2011) 591–611. https://arxiv.org/abs/0906.3392
  • M.-F. Bru, Wishart processes, J. Theoret. Probab. 4 (1991) 725–751. https://doi.org/10.1007/BF01259552
18 thms1 active userReviewed
Control TheoryNumerical AnalysisOptimization·Captain: mikedeng1

The Primal-Dual Active Set Strategy as a Semismooth Newton Method V: Local Superlinear Convergence in L² under a Norm GapResearch Paper

Motivation

Optimal control problems with pointwise bounds on the control, such as

min⁡u12∥y−z∥L22+β2∥u∥L22subject to −Δy=u in Ω, y=0 on ∂Ω, u≤ψ,\min_u \tfrac12\|y - z\|_{L^2}^2 + \tfrac{\beta}{2}\|u\|_{L^2}^2 \quad\text{subject to } -\Delta y = u \text{ in } \Omega,\ y = 0 \text{ on } \partial\Omega,\ u \le \psi,umin​21​∥y−z∥L22​+2β​∥u∥L22​subject to −Δy=u in Ω, y=0 on ∂Ω, u≤ψ,

reduce, after eliminating the state, to a quadratic program in L2(Ω)L^2(\Omega)L2(Ω) with a pointwise upper bound. The primal-dual active set strategy solves such problems by guessing the set where the bound is active, solving one linear system on that guess, and updating the guess from the new primal and dual values. It is used routinely in PDE-constrained optimization because each iteration costs one linear solve and, in practice, very few iterations are needed.

Hintermüller, Ito and Kunisch (SIAM J. Optim. 13 (2002) 865–888; authors' version hal-01660511) showed that this strategy is a semismooth Newton method for a nonsmooth reformulation of the optimality system, built on the notion of slant differentiability of Chen, Nashed and Qi (SIAM J. Numer. Anal. 38 (2000) 1200–1216). In finite dimension this gives local superlinear convergence (missions I–IV of this series). This mission concerns the paper's function-space result, Theorem 4.1: in L2(Ω)L^2(\Omega)L2(Ω), under a norm gap on the operator, the method still converges locally superlinearly. Ulbrich (SIAM J. Optim. 13 (2003) 805–841) developed a related semismooth Newton theory for superposition operators in function spaces, which also requires a norm gap.

Setting

Let (Ω,μ)(\Omega, \mu)(Ω,μ) be a finite measure space (the paper takes a bounded domain Ω⊂Rn\Omega \subset \mathbb{R}^nΩ⊂Rn with Lebesgue measure) and Lp=Lp(Ω)L^p = L^p(\Omega)Lp=Lp(Ω) the real Lebesgue spaces, with inner product (⋅,⋅)(\cdot,\cdot)(⋅,⋅) on L2L^2L2. The paper writes AAA for an operator and calligraphic A\mathcal{A}A, I\mathcal{I}I for active and inactive sets.

Slant differentiability (Definition 1). For Banach spaces XXX, ZZZ, a map F:X→ZF : X \to ZF:X→Z is slantly differentiable in an open set UUU if there is G:U→L(X,Z)G : U \to \mathcal{L}(X, Z)G:U→L(X,Z), a slanting function, with

lim⁡h→01∥h∥ ∥F(x+h)−F(x)−G(x+h)h∥=0(x∈U).(A)\lim_{h\to 0}\frac{1}{\|h\|}\,\|F(x+h) - F(x) - G(x+h)h\| = 0 \qquad (x \in U). \tag{A}h→0lim​∥h∥1​∥F(x+h)−F(x)−G(x+h)h∥=0(x∈U).(A)

For δ∈R\delta \in \mathbb{R}δ∈R, the candidate slanting function of the pointwise max is Gm(y)(x)=1G_m(y)(x) = 1Gm​(y)(x)=1 if y(x)>0y(x) > 0y(x)>0, 000 if y(x)<0y(x) < 0y(x)<0, δ\deltaδ if y(x)=0y(x) = 0y(x)=0 (4.1).

The problem. Given f,ψ∈L2f, \psi \in L^2f,ψ∈L2 and a self-adjoint A∈L(L2)A \in \mathcal{L}(L^2)A∈L(L2) with

(Ay,y)≥γ∥y∥2(γ>0),(H1)(Ay, y) \ge \gamma\|y\|^2 \quad (\gamma > 0), \tag{H1}(Ay,y)≥γ∥y∥2(γ>0),(H1)

minimize 12(y,Ay)−(f,y)\tfrac12(y, Ay) - (f, y)21​(y,Ay)−(f,y) subject to y≤ψy \le \psiy≤ψ. The solution y∗y^*y∗ and its multiplier λ∗\lambda^*λ∗ are the unique solution of

Ay∗+λ∗=f,λ∗−max⁡(0,λ∗+c(y∗−ψ))=0 a.e.,(4.2)Ay^* + \lambda^* = f, \qquad \lambda^* - \max(0, \lambda^* + c(y^* - \psi)) = 0 \ \text{a.e.}, \tag{4.2}Ay∗+λ∗=f,λ∗−max(0,λ∗+c(y∗−ψ))=0 a.e.,(4.2)

for any fixed c>0c > 0c>0. The norm gap hypothesis is

A=C+βI,C∈L(L2,Lq),β>0,q>2.(H2)A = C + \beta I, \qquad C \in \mathcal{L}(L^2, L^q),\quad \beta > 0,\quad q > 2. \tag{H2}A=C+βI,C∈L(L2,Lq),β>0,q>2.(H2)

The algorithm. From (y0,λ0)∈L2×L2(y^0, \lambda^0) \in L^2 \times L^2(y0,λ0)∈L2×L2, set Ak={x:λk(x)+c(yk(x)−ψ(x))>0}\mathcal{A}_k = \{x : \lambda^k(x) + c(y^k(x) - \psi(x)) > 0\}Ak​={x:λk(x)+c(yk(x)−ψ(x))>0}, Ik=Ω∖Ak\mathcal{I}_k = \Omega\setminus\mathcal{A}_kIk​=Ω∖Ak​, and solve

Ayk+1+λk+1=f,yk+1=ψ on Ak,λk+1=0 on Ik.Ay^{k+1} + \lambda^{k+1} = f, \qquad y^{k+1} = \psi \text{ on } \mathcal{A}_k, \qquad \lambda^{k+1} = 0 \text{ on } \mathcal{I}_k.Ayk+1+λk+1=f,yk+1=ψ on Ak​,λk+1=0 on Ik​.

A sequence obeying this rule for every kkk is a run. Superlinear convergence of xk→x∗x^k \to x^*xk→x∗ means xk→x∗x^k \to x^*xk→x∗ and, for every η>0\eta > 0η>0, eventually ∥xk+1−x∗∥≤η∥xk−x∗∥\|x^{k+1} - x^*\| \le \eta\|x^k - x^*\|∥xk+1−x∗∥≤η∥xk−x∗∥.

Formalization targets

Goal: Theorem 4.1 (p. 15)

The page reads: "Assume that (H1), (H2) hold and that ψ and f are in L^q(Ω). Then the primal-dual active set strategy or, equivalently, the semismooth Newton method converge superlinearly if ‖y⁰ − y*‖ is sufficiently small and λ⁰ = β(y⁰ − ψ)." The formalized goal is the statement the proof establishes: with c=βc = \betac=β, there is ρ>0\rho > 0ρ>0 such that every run with

∥y0−y∗∥L2<ρ,λ0=f−Ay0\|y^0 - y^*\|_{L^2} < \rho, \qquad \lambda^0 = f - Ay^0∥y0−y∗∥L2​<ρ,λ0=f−Ay0

converges superlinearly to (y∗,λ∗)(y^*, \lambda^*)(y∗,λ∗) in L2×L2L^2 \times L^2L2×L2. The initialization differs from the printed one; see Formalization scope.

Milestones

  1. Theorem 1.1 (Chen–Nashed–Qi): slant differentiability near a zero x∗x^*x∗ with uniformly bounded G(x)−1G(x)^{-1}G(x)−1 gives local superlinear convergence of xk+1=xk−G(xk)−1F(xk)x^{k+1} = x^k - G(x^k)^{-1}F(x^k)xk+1=xk−G(xk)−1F(xk).
  2. Proposition 4.1(ii): for 1≤p<q≤∞1 \le p < q \le \infty1≤p<q≤∞, max⁡(0,⋅):Lq→Lp\max(0,\cdot) : L^q \to L^pmax(0,⋅):Lq→Lp is slantly differentiable with slanting function GmG_mGm​.
  3. (4.9)–(4.10): for c=βc = \betac=β, (4.2) is equivalent to βy∗−βψ+max⁡(0,Cy∗−f+βψ)=0\beta y^* - \beta\psi + \max(0, Cy^* - f + \beta\psi) = 0βy∗−βψ+max(0,Cy∗−f+βψ)=0 and λ∗=f−Cy∗−βy∗\lambda^* = f - Cy^* - \beta y^*λ∗=f−Cy∗−βy∗.
  4. Equivalence of the algorithms: along a run with c=βc = \betac=β and λ0=f−Ay0\lambda^0 = f - Ay^0λ0=f−Ay0, λk+β(yk−ψ)=f−Cyk−βψ\lambda^k + \beta(y^k - \psi) = f - Cy^k - \beta\psiλk+β(yk−ψ)=f−Cyk−βψ for all kkk, so the active sets are those of the reduced algorithm.
  5. Slant differentiability of the reduced map F(y)=βy−βψ+max⁡(0,Cy−f+βψ)F(y) = \beta y - \beta\psi + \max(0, Cy - f + \beta\psi)F(y)=βy−βψ+max(0,Cy−f+βψ) on L2L^2L2, with GF(y+h)=βI+Gm(Cy−f+βψ+Ch)CG_F(y+h) = \beta I + G_m(Cy - f + \beta\psi + Ch)CGF​(y+h)=βI+Gm​(Cy−f+βψ+Ch)C, δ=1\delta = 1δ=1.
  6. Bounded inverses: GF(z)G_F(z)GF​(z) is invertible on L2L^2L2, with ∥GF(z)−1∥\|G_F(z)^{-1}\|∥GF​(z)−1∥ bounded uniformly in zzz.

Two companion items accompany the goal: existence of a run from every y0y^0y0, and Proposition 4.1(i), the paper's counterexamples showing that GmG_mGm​ fails to be a slanting function from LpL^pLp to LpL^pLp.

Significance

Theorem 4.1 is the infinite-dimensional justification of a method used throughout control-constrained optimal control: it shows that the method converges locally superlinearly for the continuous problem itself, not only for each discretization. Example 1 of the paper shows that distributed control of the Poisson equation, and boundary control with Sobolev embeddings, satisfy (H2). Proposition 4.1 isolates the structural reason: the pointwise max is a Newton-differentiable map only between spaces with a norm gap.

None of these results is known to be machine-checked. A complete development would provide slant differentiability in Banach spaces, the Chen–Nashed–Qi local convergence theorem, the norm-gap differentiability of max⁡(0,⋅)\max(0,\cdot)max(0,⋅) between Lebesgue spaces, and invertibility of block operators on L2L^2L2 of a measurable partition. Each of these is reusable for other semismooth Newton analyses in function space.

Difficulty

The obvious argument fails at the max. In finite dimension, max⁡(0,⋅)\max(0,\cdot)max(0,⋅) is slantly differentiable with GmG_mGm​ because a small perturbation does not change the sign of any nonzero component. In L2L^2L2, a perturbation hhh of small norm can flip the sign of yyy on a set of positive measure, and on that set the error max⁡(0,y+h)−max⁡(0,y)−Gm(y+h)h\max(0, y+h) - \max(0, y) - G_m(y+h)hmax(0,y+h)−max(0,y)−Gm​(y+h)h is as large as ∣y∣|y|∣y∣. Proposition 4.1(i) shows that this error is not o(∥h∥Lp)o(\|h\|_{L^p})o(∥h∥Lp​) in LpL^pLp for any ppp. Superlinear convergence in L2L^2L2 therefore needs the argument of the max to be controlled in a stronger norm than the error is measured in, which is what (H2) and f,ψ∈Lqf, \psi \in L^qf,ψ∈Lq provide. A second difficulty is that the two-variable algorithm is not literally a Newton method for a map of yyy alone; it must be identified with the reduced algorithm, and that identification depends on the initialization.

Formalization scope

  • Spaces. LpL^pLp is Mathlib's Lp ℝ p μ on an arbitrary finite measure space; q∈(2,∞]q \in (2, \infty]q∈(2,∞] is an extended real with 2 < q. The paper's bounded Lipschitz domain is replaced by a finite measure space: the proofs use only ∣Ω∣<∞|\Omega| < \infty∣Ω∣<∞, and Mathlib has no notion of Lipschitz boundary.
  • Pointwise statements on LpL^pLp classes are almost everywhere statements about representatives. (H2) is stated as Ay=Cy+βyAy = Cy + \beta yAy=Cy+βy a.e. for every y∈L2y \in L^2y∈L2, which avoids building the inclusion Lq⊆L2L^q \subseteq L^2Lq⊆L2.
  • Hypotheses kept: self-adjointness of AAA, (H1) with explicit γ>0\gamma > 0γ>0, (H2) with β>0\beta > 0β>0 and q>2q > 2q>2, f,ψ∈Lqf, \psi \in L^qf,ψ∈Lq. The solution (y∗,λ∗)(y^*, \lambda^*)(y∗,λ∗) of (4.2) is a hypothesis; it exists and is unique under (H1), as the paper states on p. 12.
  • The initialization. The printed λ0=β(y0−ψ)\lambda^0 = \beta(y^0 - \psi)λ0=β(y0−ψ) does not support the proof, which uses "λ0+β(y0−ψ)=f−Cy0−βψ\lambda^0 + \beta(y^0 - \psi) = f - Cy^0 - \beta\psiλ0+β(y0−ψ)=f−Cy0−βψ" and c=βc = \betac=β. That identity holds exactly for λ0=f−Ay0\lambda^0 = f - Ay^0λ0=f−Ay0. The goal uses λ0=f−Ay0\lambda^0 = f - Ay^0λ0=f−Ay0 and c=βc = \betac=β. With the printed initialization the first active set is {y0>ψ}\{y^0 > \psi\}{y0>ψ}, and for y0y^0y0 slightly below y∗y^*y∗ the first iterate solves the unconstrained problem, which can be far from y∗y^*y∗.
  • Superlinear convergence is stated for the pair (yk,λk)(y^k, \lambda^k)(yk,λk) in the product norm max⁡(∥y∥,∥λ∥)\max(\|y\|, \|\lambda\|)max(∥y∥,∥λ∥), without dividing by ∥xk−x∗∥\|x^k - x^*\|∥xk−x∗∥, so finite termination qualifies. "Sufficiently small" is an ∃ρ>0\exists\rho > 0∃ρ>0 chosen before the run, on ∥y0−y∗∥\|y^0 - y^*\|∥y0−y∗∥ only.
  • No trivialization. The goal mentions neither the reduced algorithm, nor GFG_FGF​, nor Proposition 4.1; the norm gap q>2q > 2q>2 is not weakened to C∈L(L2)C \in \mathcal{L}(L^2)C∈L(L2), under which Proposition 4.1(i) shows that GmG_mGm​ need not be a slanting function; and the companion run_exists shows that the runs the goal quantifies over exist.
  • Definitions (PDASNewton.FunSpace.Setting): slanting functions, superlinear convergence, GmG_mGm​, property (A) for max⁡(0,⋅):Lq→Lp\max(0,\cdot) : L^q \to L^pmax(0,⋅):Lq→Lp, system (4.2), one step and runs of the algorithm. These duplicate the finite-dimensional definitions of the other missions of the series in a separate namespace.

Proofs of any milestone are welcome, as are reusable lemmas on Lebesgue spaces (Hölder on sets of small measure, multiplication operators, Lax–Milgram on L2L^2L2 of a measurable subset).

Selected references

  • M. Hintermüller, K. Ito, K. Kunisch, The primal-dual active set strategy as a semismooth Newton method, SIAM J. Optim. 13(3) (2002) 865–888. https://doi.org/10.1137/S1052623401383558 ; authors' version https://hal.science/hal-01660511
  • X. Chen, Z. Nashed, L. Qi, Smoothing methods and semismooth methods for nondifferentiable operator equations, SIAM J. Numer. Anal. 38 (2000) 1200–1216. https://doi.org/10.1137/S0036142999356719
  • M. Ulbrich, Semismooth Newton methods for operator equations in function spaces, SIAM J. Optim. 13 (2003) 805–841. https://doi.org/10.1137/S1052623400371569
  • L. Qi, J. Sun, A nonsmooth version of Newton's method, Math. Programming 58 (1993) 353–367. https://doi.org/10.1007/BF01581275
9 thms1 active userReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Duality and Stability in Extremum Problems Involving Convex Functions 2: The Dual Supremum Equals the Lower Limit of the Perturbed Infimum, sup (P*) = lim inf_{z→0} inf (P(z))Research Paper

Motivation

A convex minimization problem comes with a dual maximization problem, and the dual value never exceeds the primal value. When the two values differ, a duality gap occurs. Dual bounds, Lagrangian relaxations and optimality certificates are then weaker than hoped. Conditions that rule the gap out are constraint qualifications such as Slater's condition and Rockafellar's notion of a stably set problem. Such conditions say when the gap vanishes, but not what the dual value is when it does not.

R. T. Rockafellar's 1967 paper answers that question for the Fenchel-type pair of problems built from a convex function, a concave function and a continuous linear map between infinite-dimensional spaces. Its Theorem 6 (§6, "Weak duality theorems", pp. 179–180) "explains the exact way in which inf (P) and sup (P*) can fail to be equal", by expressing the dual value through the primal problem alone: the dual supremum is the lower limit of the optimal values of slightly perturbed primal problems. This perturbational view of duality was later developed in Rockafellar's Conjugate Duality and Optimization (1974). It underlies the modern treatment of value functions in convex optimization.

Setting

Two real vector spaces EEE and E∗E^*E∗ are topologically paired when each carries a locally convex Hausdorff topology, they are in duality under a bilinear form ⟨x,x∗⟩\langle x,x^*\rangle⟨x,x∗⟩ that is continuous in each variable, and every continuous linear functional on either space is the pairing with exactly one element of the other. Let (E,E∗)(E,E^*)(E,E∗) and (F,F∗)(F,F^*)(F,F∗) be two such pairs. Let A:E→FA:E\to FA:E→F be continuous linear and A∗:F∗→E∗A^*:F^*\to E^*A∗:F∗→E∗ its adjoint, the continuous linear map with ⟨Ax,y∗⟩=⟨x,A∗y∗⟩\langle Ax,y^*\rangle=\langle x,A^*y^*\rangle⟨Ax,y∗⟩=⟨x,A∗y∗⟩.

A function f:E→[−∞,+∞]f:E\to[-\infty,+\infty]f:E→[−∞,+∞] is convex when its epigraph {(x,μ)∣μ∈R, μ≥f(x)}\{(x,\mu)\mid\mu\in\mathbb R,\ \mu\ge f(x)\}{(x,μ)∣μ∈R, μ≥f(x)} is convex in E×RE\times\mathbb RE×R. It is proper when it never takes −∞-\infty−∞ and is finite somewhere. A function ggg is proper concave when −g-g−g is convex, ggg never takes +∞+\infty+∞, and ggg is finite somewhere. The standing hypotheses are that fff is lower semicontinuous proper convex on EEE and ggg is upper semicontinuous proper concave on FFF. Their conjugates are

f∗(x∗)=sup⁡x{⟨x,x∗⟩−f(x)},g∗(y∗)=inf⁡y{⟨y,y∗⟩−g(y)}.f^*(x^*)=\sup_{x}\{\langle x,x^*\rangle-f(x)\},\qquad g^*(y^*)=\inf_{y}\{\langle y,y^*\rangle-g(y)\}.f∗(x∗)=xsup​{⟨x,x∗⟩−f(x)},g∗(y∗)=yinf​{⟨y,y∗⟩−g(y)}.

The primal problem (P) is to minimize f(x)−g(Ax)f(x)-g(Ax)f(x)−g(Ax) over x∈Ex\in Ex∈E. The dual problem (P*) is to maximize g∗(y∗)−f∗(A∗y∗)g^*(y^*)-f^*(A^*y^*)g∗(y∗)−f∗(A∗y∗) over y∗∈F∗y^*\in F^*y∗∈F∗. For z∈Fz\in Fz∈F the perturbed problem (P(zzz)) is to minimize f(x)−g(Ax−z)f(x)-g(Ax-z)f(x)−g(Ax−z). Its value defines the perturbation function

h(z)=inf⁡(P(z))=inf⁡x∈E{f(x)−g(Ax−z)},h(0)=inf⁡(P).h(z)=\inf(\mathrm P(z))=\inf_{x\in E}\{f(x)-g(Ax-z)\},\qquad h(0)=\inf(\mathrm P).h(z)=inf(P(z))=x∈Einf​{f(x)−g(Ax−z)},h(0)=inf(P).

The lower semicontinuous hull of hhh is hˉ(y)=lim inf⁡z→yh(z)\bar h(y)=\liminf_{z\to y}h(z)hˉ(y)=liminfz→y​h(z), where z=yz=yz=y is allowed, so that hˉ≤h\bar h\le hhˉ≤h. All infima and suprema are taken in [−∞,+∞][-\infty,+\infty][−∞,+∞].

Formalization targets

Goal: Theorem 6

sup⁡(P∗)=lim inf⁡z→0 [inf⁡(P(z))],\sup(\mathrm P^*)=\liminf_{z\to 0}\,[\inf(\mathrm P(z))],sup(P∗)=z→0liminf​[inf(P(z))],

valid except in the trivial case where the left side is −∞-\infty−∞ and the right side is +∞+\infty+∞. No consistency, constraint qualification or attainment is assumed, and neither side need be finite. The exception is exactly the stated conjunction. A version assuming (P) consistent would be weaker, since an inconsistent (P), with h(0)=+∞h(0)=+\inftyh(0)=+∞, may still have a finite lower limit.

Milestones: the four claims of the proof (p. 180)

  1. hˉ\bar hhˉ is a lower semicontinuous convex function on FFF.
  2. For every y∗∈F∗y^*\in F^*y∗∈F∗, with hˉ∗(y∗)=sup⁡y{⟨y,y∗⟩−hˉ(y)}\bar h^*(y^*)=\sup_y\{\langle y,y^*\rangle-\bar h(y)\}hˉ∗(y∗)=supy​{⟨y,y∗⟩−hˉ(y)},
−hˉ∗(y∗)=inf⁡y{hˉ(y)−⟨y,y∗⟩}=inf⁡z{h(z)−⟨z,y∗⟩}=g∗(y∗)−f∗(A∗y∗).-\bar h^*(y^*)=\inf_y\{\bar h(y)-\langle y,y^*\rangle\}=\inf_z\{h(z)-\langle z,y^*\rangle\}=g^*(y^*)-f^*(A^*y^*).−hˉ∗(y∗)=yinf​{hˉ(y)−⟨y,y∗⟩}=zinf​{h(z)−⟨z,y∗⟩}=g∗(y∗)−f∗(A∗y∗).
  1. (6.2): if hˉ\bar hhˉ is proper, then hˉ(0)=sup⁡y∗{⟨0,y∗⟩−hˉ∗(y∗)}\bar h(0)=\sup_{y^*}\{\langle 0,y^*\rangle-\bar h^*(y^*)\}hˉ(0)=supy∗​{⟨0,y∗⟩−hˉ∗(y∗)}.
  2. If hˉ\bar hhˉ is not proper, the maximand g∗(y∗)−f∗(A∗y∗)g^*(y^*)-f^*(A^*y^*)g∗(y∗)−f∗(A∗y∗) of (P*) is identically −∞-\infty−∞.

The paper's Lemma 2 (convexity of hhh) is used by the first claim. It is a milestone of the companion mission on Theorem 3 of the same paper and is not restated here.

Significance

Theorem 6 reduces every question about the dual value to a question about the primal value function near the origin. Strong duality inf⁡(P)=sup⁡(P∗)\inf(\mathrm P)=\sup(\mathrm P^*)inf(P)=sup(P∗) holds exactly when hhh is lower semicontinuous at 000 (outside the trivial case). A duality gap is exactly a downward jump of hhh at 000. The dual of (P*) obeys the same formula, which the paper uses to derive Theorem 7 on normal problems. An integer-lattice analogue appears in discrete convex analysis (Murota, Theorem 8.53, whose duality relation is already stated on Prove2Me as DiscreteConvex.ConjugacyDualityD.general_duality_relations). That statement has no topology and is not the same theorem.

The result is classical and its proof is published. As far as the platform's index shows, no machine-checked statement of it exists in the paper's generality, nor a statement of extended-real biconjugation on general paired locally convex spaces. The value of the mission is a formal proof in the paper's setting: arbitrary topologically paired spaces, extended-real-valued functions, and both the proper and the improper case of the hull. The biconjugation milestone (6.2) and the hull lemma are reusable for other perturbational duality results.

Difficulty

The obvious argument compares h(0)h(0)h(0) with the dual objective directly. It cannot give the theorem, because hhh may jump at 000, and the dual objective does not detect the value of hhh at a single point: the target is a lower limit, not a value. In infinite dimensions, conjugacy recovers a function only when it is lower semicontinuous and convex for a topology compatible with the pairing, so the statement depends on the full compatibility of the pairing on FFF, not on a norm. The usual statements of biconjugation cover proper functions only, whereas here the lower limit may take both values ±∞\pm\infty±∞, and both cases of the theorem must be covered. Finally, extended-real arithmetic must be tracked so that the dual objective, defined from f∗f^*f∗, g∗g^*g∗ and A∗A^*A∗, is matched in every infinite case.

Formalization scope

Values lie in EReal. Infima and suprema are complete-lattice ⨅ and ⨆, so an empty or unbounded family gives ±∞\pm\infty±∞ as in the paper. The lower limit is Filter.liminf h (nhds y) over the full neighbourhood filter: a punctured limit would change the theorem. Convexity is epigraph convexity in E×RE\times\mathbb RE×R, and properness is the paper's two-sided condition. A topological pairing is a structure holding a bilinear map, separate continuity, and existence and uniqueness of representing elements in both directions. No norm, inner product or finite dimension is assumed. The adjoint A∗A^*A∗ is continuous linear data satisfying the adjoint identity. The conjugates f∗f^*f∗, g∗g^*g∗ are defined by the paper's formulas from fff, ggg, so their regularity is a consequence, not a hypothesis. Properness of fff and ggg excludes the form (+∞)−(+∞)(+\infty)-(+\infty)(+∞)−(+∞) from f(x)−g(Ax−z)f(x)-g(Ax-z)f(x)−g(Ax−z) and from g∗(y∗)−f∗(A∗y∗)g^*(y^*)-f^*(A^*y^*)g∗(y∗)−f∗(A∗y∗). No statement is repaired relative to the page.

The dual value is the supremum of the maximand built from f∗f^*f∗, g∗g^*g∗ and A∗A^*A∗ as on p. 172. Defining sup⁡(P∗)\sup(\mathrm P^*)sup(P∗) through hˉ\bar hhˉ (for instance as the biconjugate of hˉ\bar hhˉ at 000) would make Theorem 6 true by definition and is ruled out.

A complete development needs extended-real conjugates on paired spaces, the lower semicontinuous hull and the closure of a convex epigraph, and Fenchel–Moreau for proper lower semicontinuous convex functions on a locally convex space. All of these are reusable beyond this mission. Proofs of the milestones, and lemmas toward Fenchel–Moreau in this generality, are welcome contributions.

Selected references

  • R. T. Rockafellar, Duality and Stability in Extremum Problems Involving Convex Functions, Pacific J. Math. 21 (1967), 167–187. https://doi.org/10.2140/pjm.1967.21.167
  • W. Fenchel, On conjugate convex functions, Canad. J. Math. 1 (1949), 73–77. https://doi.org/10.4153/CJM-1949-007-x
  • A. Brøndsted, Conjugate convex functions in topological vector spaces, Mat.-Fys. Medd. Dansk. Vid. Selsk. 34 (1964) (reference [2] of the paper; no DOI).
  • J.-J. Moreau, Fonctions convexes en dualité, multigraph, Séminaires de Mathématique, Faculté des Sciences, Université de Montpellier, 1962 (reference [12] of the paper; no DOI).
  • R. T. Rockafellar, Conjugate Duality and Optimization, CBMS-NSF Regional Conference Series in Applied Mathematics 16, SIAM, 1974. https://doi.org/10.1137/1.9781611970524
  • K. Murota, Discrete Convex Analysis, SIAM, 2003, Theorem 8.53. https://doi.org/10.1137/1.9780898718508
8 thms1 active userReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Duality and Stability in Extremum Problems Involving Convex Functions 1: A Convex Program Is Stably Set If and Only If Its Infimum Equals the Attained Maximum of the Dual, inf (P) = max (P*)Research Paper

Motivation

In convex optimization, a dual problem supplies a bound on what a primal minimization problem can achieve. The bound can be useful even when no minimizer is known, but an equality of the primal and dual values says more: it certifies that the bound is exact. In applications, one also wants a dual variable that actually attains the bound, since that variable can act as a multiplier or a sensitivity certificate. Rockafellar's 1967 paper asks when such an attained equality follows from the behavior of the primal value under small changes to the problem Rockafellar 1967.

The paper works with locally convex spaces paired with their continuous duals, rather than limiting the question to finite-dimensional vectors or normed spaces. In this setting, ordinary finite-dimensional constraint qualifications need not describe the relevant behavior. Theorem 3 gives a criterion in terms of the perturbation function itself. It also states the corresponding criterion with the primal and dual roles reversed Rockafellar 1967, §5.

Setting

Let EEE and E′E'E′ be real locally convex Hausdorff spaces in topological duality, with pairing ⟨x,x′⟩E\langle x,x'\rangle_E⟨x,x′⟩E​. Let FFF and F′F'F′ be another such pair. Each pairing represents every continuous linear functional on either member uniquely by a point of the other member. Let A:E→FA:E\to FA:E→F be continuous linear, and let its continuous adjoint A∗:F′→E′A^*:F'\to E'A∗:F′→E′ satisfy ⟨Ax,y′⟩F=⟨x,A∗y′⟩E\langle Ax,y'\rangle_F=\langle x,A^*y'\rangle_E⟨Ax,y′⟩F​=⟨x,A∗y′⟩E​.

The primal data are a lower semicontinuous proper convex function f:E→[−∞,+∞]f:E\to[-\infty,+\infty]f:E→[−∞,+∞] and an upper semicontinuous proper concave function g:F→[−∞,+∞]g:F\to[-\infty,+\infty]g:F→[−∞,+∞]. Here proper means that fff never takes −∞-\infty−∞ and is finite somewhere, while ggg never takes +∞+\infty+∞ and is finite somewhere. Convexity means convexity of the real epigraph, and concavity means convexity of −g-g−g. Their conjugates are f∗(x′)=sup⁡x(⟨x,x′⟩E−f(x))f^*(x')=\sup_x(\langle x,x'\rangle_E-f(x))f∗(x′)=supx​(⟨x,x′⟩E​−f(x)) and g∗(y′)=inf⁡y(⟨y,y′⟩F−g(y))g^*(y')=\inf_y(\langle y,y'\rangle_F-g(y))g∗(y′)=infy​(⟨y,y′⟩F​−g(y)) Rockafellar 1967, §2.

The primal problem (P)(P)(P) minimizes f(x)−g(Ax)f(x)-g(Ax)f(x)−g(Ax) over EEE. Its dual (P∗)(P^*)(P∗) maximizes g∗(y′)−f∗(A∗y′)g^*(y')-f^*(A^*y')g∗(y′)−f∗(A∗y′) over F′F'F′. A translation z∈Fz\in Fz∈F changes the primal objective to f(x)−g(Ax−z)f(x)-g(Ax-z)f(x)−g(Ax−z), giving

h(z)=inf⁡x∈E{f(x)−g(Ax−z)},h(0)=inf⁡(P).h(z)=\inf_{x\in E}\{f(x)-g(Ax-z)\},\qquad h(0)=\inf(P).h(z)=x∈Einf​{f(x)−g(Ax−z)},h(0)=inf(P).

The primal problem is stably set when it is consistent, meaning h(0)<+∞h(0)<+\inftyh(0)<+∞, and when directional rates of change of hhh at zero cannot be arbitrarily negative in every neighborhood of zero. The instability test is made only when h(0)h(0)h(0) is finite. Consequently h(0)=−∞h(0)=-\inftyh(0)=−∞ counts as stable, as the paper explicitly observes Rockafellar 1967, §4–5. The dual stability condition is the same definition applied to the dual's minimization form (P′)(P')(P′), with perturbations in E′E'E′.

Formalization targets

The goal is both directions of Theorem 3, including the dual statement:

(P) stably set⟺inf⁡(P)=max⁡(P∗),(P)\text{ stably set}\quad\Longleftrightarrow\quad \inf(P)=\max(P^*),(P) stably set⟺inf(P)=max(P∗), min⁡(P)=sup⁡(P∗)⟺(P∗) stably set.\min(P)=\sup(P^*)\quad\Longleftrightarrow\quad (P^*)\text{ stably set}.min(P)=sup(P∗)⟺(P∗) stably set.

The symbols max⁡\maxmax and min⁡\minmin assert that the stated value is attained. A statement equating only an infimum and a supremum would omit part of the theorem. The mission's milestones are the convexity of hhh (Lemma 2), the equivalence between stability and a nonempty subdifferential ∂h(0)\partial h(0)∂h(0), the criterion linking a subgradient to inequality (5.1), and weak duality (Lemma 1). Each is a claim stated in the paper's proof or as a numbered lemma Rockafellar 1967, pp. 174, 178–179.

Significance

The theorem turns a local property of the optimal-value function into an exact, attained duality statement. A dual optimum has operational meaning: its point y′∈F′y'\in F'y′∈F′ is a continuous linear response to perturbations z∈Fz\in Fz∈F, expressed through ⟨z,y′⟩F\langle z,y'\rangle_F⟨z,y′⟩F​. The converse says that attained exact duality already forces the same stability property. The dual half adds a symmetric criterion for attainment of the primal minimum Rockafellar 1967, Theorem 3.

The 1967 result is proved in the cited paper; this mission asks for its Lean formalization. A complete development would give reusable definitions for paired locally convex spaces, extended-real conjugates, epigraph convexity, and perturbation-based stability. The milestone statements expose the intermediate mathematical claims separately, so later formalizations can use the parts they need without importing the entire theorem.

Difficulty

Weak duality by itself gives only an inequality. It does not supply a dual point achieving the primal infimum, and equality of two extended-real lattice values does not establish attainment. The central issue is that a perturbation function can have a finite value at zero yet fall at arbitrarily steep rates in nearby directions; then no continuous linear support at zero need exist. Infinite primal values bring two additional cases: inconsistency when h(0)=+∞h(0)=+\inftyh(0)=+∞, and the paper's stable case when h(0)=−∞h(0)=-\inftyh(0)=−∞. The dual half requires the topology on E′E'E′ because the translated dual problem is perturbed there Rockafellar 1967, §§4–5.

Formalization scope

The Lean representation uses EReal for all objective and conjugate values; its complete lattice gives the paper's ±∞\pm\infty±∞ values for unbounded or empty extrema. Spaces are arbitrary locally convex Hausdorff real topological vector spaces equipped with a pairing that identifies each space with the continuous linear dual of the other. The adjoint is continuous linear data constrained by the pairing identity. Properness rules out endpoint arithmetic of the form +∞−(+∞)+\infty-(+\infty)+∞−(+∞) in the primal and dual objectives. The conjugates are defined from fff and ggg; their regularity is not assumed separately.

Stability is encoded using the positive one-sided lower limit of directional difference quotients, which equals the paper's limit for convex hhh. It requires consistency and excludes arbitrarily negative rates in every neighborhood. It is not defined by ∂h(0)≠∅\partial h(0)\ne\varnothing∂h(0)=∅: that equivalence is an independent milestone. Attained extrema are represented by greatest and least elements of the ranges of the objective functions, rather than by equality of lattice values alone. The formalization includes both halves of Theorem 3 and all four listed milestones. Contributions toward general convex analysis on paired spaces and toward the extended-real endpoint cases are useful beyond this mission.

Selected references

  • R. T. Rockafellar, Duality and Stability in Extremum Problems Involving Convex Functions, Pacific Journal of Mathematics 21 (1967), 167–187. DOI: 10.2140/pjm.1967.21.167.
7 thms1 active userReviewed
PreviousPage 3 of 4Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me