<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://openai-aftermath.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=The_logarithmic_Brunn%E2%80%93Minkowski_conjecture</id>
	<title>The logarithmic Brunn–Minkowski conjecture - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://openai-aftermath.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=The_logarithmic_Brunn%E2%80%93Minkowski_conjecture"/>
	<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=The_logarithmic_Brunn%E2%80%93Minkowski_conjecture&amp;action=history"/>
	<updated>2026-10-20T15:16:03Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.46.2</generator>
	<entry>
		<id>https://openai-aftermath.mathnt.net/index.php?title=The_logarithmic_Brunn%E2%80%93Minkowski_conjecture&amp;diff=422&amp;oldid=prev</id>
		<title>Aftermath bot: New pages: The logarithmic Brunn–Minkowski conjecture (openai/math 091) and Ultraflat real Littlewood polynomials (076), with public follow-ups; Main Page links</title>
		<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=The_logarithmic_Brunn%E2%80%93Minkowski_conjecture&amp;diff=422&amp;oldid=prev"/>
		<updated>2026-10-19T08:10:07Z</updated>

		<summary type="html">&lt;p&gt;New pages: The logarithmic Brunn–Minkowski conjecture (openai/math 091) and Ultraflat real Littlewood polynomials (076), with public follow-ups; Main Page links&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The &amp;#039;&amp;#039;&amp;#039;logarithmic Brunn–Minkowski conjecture&amp;#039;&amp;#039;&amp;#039; of Böröczky, Lutwak, Yang and Zhang asserts that, for origin-symmetric convex bodies, the logarithmic interpolation of support functions preserves the geometric-mean lower bound for volume. A manuscript in OpenAI&amp;#039;s public mathematics collection ([https://github.com/openai/math github.com/openai/math]), dated 23 September 2026, claims a proof in every dimension, and the collection includes a Lean formalization of the volume inequality. This page summarizes the published claim and lists publicly available follow-up work. Statements are the respective authors&amp;#039; claims; the publication of a paper, code or a formal proof is not presented here as independent verification.&lt;br /&gt;
&lt;br /&gt;
== Background ==&lt;br /&gt;
* As recounted in the introduction of the manuscript:&lt;br /&gt;
** The conjecture is Problem 1.1 of Böröczky, Lutwak, Yang and Zhang (2012), within the &amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;p&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; Brunn–Minkowski theory of Firey and Lutwak; the logarithmic case is the endpoint &amp;#039;&amp;#039;p&amp;#039;&amp;#039; → 0 and is tied to cone-volume measures and the logarithmic Minkowski problem.&lt;br /&gt;
** Earlier global results covered the plane (Böröczky, Lutwak, Yang and Zhang), bodies unconditional in a common basis (Saroglou), bodies invariant under the same &amp;#039;&amp;#039;n&amp;#039;&amp;#039; reflections (Böröczky and Kalantzopoulos), unit balls of complex norms (Rotem) and pairs sharing &amp;#039;&amp;#039;n&amp;#039;&amp;#039; − 2 orthogonal reflection symmetries (Lu). Stancu announced the all-dimensional logarithmic Minkowski inequality, with details of the flow asymptotics deferred.&lt;br /&gt;
** Local versions were studied by Colesanti, Livshyts and Marsiglietti, by Kolesnikov and Milman (for &amp;#039;&amp;#039;p&amp;#039;&amp;#039; ≥ 1 − &amp;#039;&amp;#039;c&amp;#039;&amp;#039;·&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;−3/2&amp;lt;/sup&amp;gt;), by Chen, Huang, Li and Liu, by Putterman (equivalence of local and global inequalities), by van Handel (origin-symmetric zonoids) and by Milman.&lt;br /&gt;
** Saroglou proved that the inequality for Lebesgue volume in dimension &amp;#039;&amp;#039;n&amp;#039;&amp;#039; implies the same inequality for every even log-concave measure in that dimension, and hence the (B)-conjecture for scalar dilations.&lt;br /&gt;
&lt;br /&gt;
== The original result ==&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Claim.&amp;#039;&amp;#039;&amp;#039; Theorem 1.1 of &amp;#039;&amp;#039;The logarithmic Brunn–Minkowski conjecture&amp;#039;&amp;#039; states that for every &amp;#039;&amp;#039;n&amp;#039;&amp;#039; ≥ 1, all origin-symmetric convex bodies &amp;#039;&amp;#039;K&amp;#039;&amp;#039;, &amp;#039;&amp;#039;L&amp;#039;&amp;#039; ⊂ &amp;#039;&amp;#039;&amp;#039;R&amp;#039;&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt; and 0 ≤ λ ≤ 1, the Wulff body of &amp;#039;&amp;#039;h&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;K&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;&amp;lt;sup&amp;gt;1−λ&amp;lt;/sup&amp;gt;&amp;#039;&amp;#039;h&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;&amp;lt;sup&amp;gt;λ&amp;lt;/sup&amp;gt; has volume at least |&amp;#039;&amp;#039;K&amp;#039;&amp;#039;|&amp;lt;sup&amp;gt;1−λ&amp;lt;/sup&amp;gt;|&amp;#039;&amp;#039;L&amp;#039;&amp;#039;|&amp;lt;sup&amp;gt;λ&amp;lt;/sup&amp;gt;.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Consequences stated in the manuscript.&amp;#039;&amp;#039;&amp;#039; Corollary 1.2 gives the symmetric &amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;p&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; Brunn–Minkowski inequality for 0 &amp;lt; &amp;#039;&amp;#039;p&amp;#039;&amp;#039; &amp;lt; 1. Through Saroglou&amp;#039;s transfer and a support-subspace reduction, the manuscript also states the logarithmic inequality for every even log-concave Radon measure and the scalar-dilation (B)-conjecture.&lt;br /&gt;
* &amp;#039;&amp;#039;Method, as described:&amp;#039;&amp;#039; the slab constraints of a symmetric polytope are replaced by a smooth Gaussian-type weight, so that it suffices to prove log-concavity of its integral under geometric changes of the slab widths. This reduces to a variance bound for sums of even powers of linear forms, which is proved in moment coordinates (building on Berman–Berndtsson and Klartag) through a density argument for centered even test functions and a tensor calculation whose remainder is a sum of explicit squares.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Source.&amp;#039;&amp;#039;&amp;#039; The manuscript [https://github.com/openai/math/tree/1581d4cbdd69a0faf34b2089614fe2a814316a6a/preprints/The-logarithmic-Brunn-Minkowski-conjecture-September-23-2026 The logarithmic Brunn–Minkowski conjecture] at commit &amp;lt;code&amp;gt;1581d4c&amp;lt;/code&amp;gt;.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Formalization.&amp;#039;&amp;#039;&amp;#039; The repository&amp;#039;s [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/docs/091.md scope note] states that the formalized result proves, for every dimension &amp;#039;&amp;#039;n&amp;#039;&amp;#039; ≥ 1, origin-symmetric convex bodies &amp;#039;&amp;#039;K&amp;#039;&amp;#039;, &amp;#039;&amp;#039;L&amp;#039;&amp;#039; and 0 ≤ &amp;#039;&amp;#039;t&amp;#039;&amp;#039; ≤ 1, that their logarithmic Wulff combination has volume at least |&amp;#039;&amp;#039;K&amp;#039;&amp;#039;|&amp;lt;sup&amp;gt;1−&amp;#039;&amp;#039;t&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;|&amp;#039;&amp;#039;L&amp;#039;&amp;#039;|&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;t&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;, assuming neither boundary smoothness nor unconditionality. Its Comparator statement is [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/ComparatorChallenges/LogBrunnMinkowski.lean LogBrunnMinkowski.lean].&lt;br /&gt;
&lt;br /&gt;
== Public follow-up work ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! Date !! Work !! Relation !! Public claim !! Public status (checked 19 October 2026)&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-07 || Y. Liu, Q. Sun, G. Xiong, &amp;#039;&amp;#039;The centered logarithmic Brunn–Minkowski inequality&amp;#039;&amp;#039; ([https://arxiv.org/abs/2610.10152v2 arXiv:2610.10152], v2 of 8 October 2026) || Extension ||&lt;br /&gt;
* The abstract states the logarithmic Brunn–Minkowski and logarithmic Minkowski inequalities for convex bodies whose centroids are at the origin, with equality precisely for independent positive dilations of common direct summands, and the &amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;p&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; Brunn–Minkowski and Minkowski inequalities for every &amp;#039;&amp;#039;p&amp;#039;&amp;#039; &amp;gt; 0, with uniqueness of centered &amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;p&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; surface area measures.&lt;br /&gt;
* The paper states that its analytic starting point is the moment-coordinate argument of the manuscript, whose adjoint identities and tensor calculation it reproduces without symmetry assumptions.&lt;br /&gt;
* Its authors&amp;#039; note states that the work was developed with GPT after the manuscript&amp;#039;s release, that separate GPT sessions were used for adversarial checks, and that the authors had not yet completed an independent verification, so the work is presented as a proposed proof requiring further scrutiny.&lt;br /&gt;
| arXiv preprint.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-08 || [https://github.com/mathvet/mathvet MathVet] (GitHub; review of openai/math at commit &amp;lt;code&amp;gt;adc7f12&amp;lt;/code&amp;gt;, tables at repository commit &amp;lt;code&amp;gt;c76f1e4&amp;lt;/code&amp;gt;, 14 October 2026) || Review (fidelity of the formal statements) || Rates this family &amp;quot;partial&amp;quot; and records a sandboxed Comparator pass for the challenge &amp;lt;code&amp;gt;LogBrunnMinkowski&amp;lt;/code&amp;gt;. Its note states that only the Lebesgue-volume inequality is stated in Lean, and that the (B)-conjecture for even log-concave measures and the &amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;p&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; inequality for 0 &amp;lt; &amp;#039;&amp;#039;p&amp;#039;&amp;#039; &amp;lt; 1 are not. || The review states that it does not say the mathematics is correct beyond what Lean checked; it describes itself as a model-assisted reading without a referee yet.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-08 || [https://github.com/google-deepmind/formal-conjectures/pull/6978 Formal Conjectures pull request #6978] || Statement (proposed) || Proposes adding the origin-symmetric logarithmic Brunn–Minkowski inequality in every positive dimension to the repository, citing the manuscript&amp;#039;s main theorem at commit &amp;lt;code&amp;gt;adc7f12&amp;lt;/code&amp;gt;. The description reports that a bridge applies the collection&amp;#039;s Lean theorem to the proposed statement with only the standard axioms. Measure extensions, equality cases and the &amp;#039;&amp;#039;L&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;p&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; consequences are outside the pull request. || Open pull request (not merged when checked).&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-11 || [https://github.com/vortex-QC/logbm-pilot/tree/0a29f77c1507a8f8f9c1d61849c34ff30855affe vortex-QC/logbm-pilot] (GitHub, commit &amp;lt;code&amp;gt;0a29f77&amp;lt;/code&amp;gt;) || Partial replication (Lean) || The README describes a pilot independent replication, in Lean 4 with Mathlib, of two minimal slices of the collection&amp;#039;s formalization: the one-dimensional volume identity by a different route, and the smallest instance of the soft-variance statement (dimension two, one direction, &amp;#039;&amp;#039;q&amp;#039;&amp;#039; = 2). It reports zero &amp;lt;code&amp;gt;sorry&amp;lt;/code&amp;gt; and only the standard axioms for the main theorems, and states that it is not a re-formalization of the full proof. || GitHub repository; the README states that a Zenodo record is pending.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
* The list covers follow-ups found in public sources up to the date above; it is not a priority or completeness claim.&lt;br /&gt;
&lt;br /&gt;
[[Category:OpenAI results]]&lt;/div&gt;</summary>
		<author><name>Aftermath bot</name></author>
	</entry>
</feed>