/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilBrennan's Conjecture
Reference:
[OAI26a] OpenAI, Brennan's conjecture and sharp inverse-square integral means. OpenAI Math Release preprint (2026). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Brennans-conjecture-and-sharp-inverse-square-integral-means-September-24-2026/paper.pdf
@[expose] public sectionnamespace BrennanConjectureopen Complex Filter MeasureTheory Set Topologydef unitDisk : Set ℂ := {z | ‖z‖ < 1}The standard class $\mathcal{S}$ of normalised univalent functions on $\mathbb{D}$.
structure IsUnivalentNormalized (f : ℂ → ℂ) : Prop where
analyticOn : AnalyticOn ℂ f unitDisk
injOn : InjOn f unitDisk
map_zero : f 0 = 0
deriv_zero : deriv f 0 = 1$\beta_f(\tau) := \limsup_{r \to 1^-} \frac{\log \int_{-\pi}^{\pi} |f'(re^{i\theta})|^\tau , d\theta}{|\log(1-r)|}$
noncomputable def integralMeansSpectrum (f : ℂ → ℂ) (τ : ℝ) : ℝ :=
limsup
(fun r => Real.log (∫ θ in Ioc (-Real.pi) Real.pi,
‖deriv f (r • exp (Complex.I * θ))‖ ^ τ) /
|Real.log (1 - r)|)
(𝓝[Iio 1] (1 : ℝ))noncomputable def universalSpectrum (τ : ℝ) : ℝ :=
sSup {β | ∃ f : ℂ → ℂ, IsUnivalentNormalized f ∧ β = integralMeansSpectrum f τ}noncomputable def universalSpectrumBounded (τ : ℝ) : ℝ :=
sSup {β | ∃ f : ℂ → ℂ, IsUnivalentNormalized f ∧
Bornology.IsBounded (f '' unitDisk) ∧ β = integralMeansSpectrum f τ}@[category API, AMS 30]
theorem universalSpectrumBounded_le (τ : ℝ) :
universalSpectrumBounded τ ≤ universalSpectrum τ := τ:ℝ⊢ universalSpectrumBounded τ ≤ universalSpectrum τ
τ:ℝ⊢ BddAbove {β | ∃ f, IsUnivalentNormalized f ∧ β = integralMeansSpectrum f τ}τ:ℝ⊢ {β | ∃ f, IsUnivalentNormalized f ∧ Bornology.IsBounded (f '' unitDisk) ∧ β = integralMeansSpectrum f τ}.Nonemptyτ:ℝ⊢ {β | ∃ f, IsUnivalentNormalized f ∧ Bornology.IsBounded (f '' unitDisk) ∧ β = integralMeansSpectrum f τ} ⊆
{β | ∃ f, IsUnivalentNormalized f ∧ β = integralMeansSpectrum f τ}
τ:ℝ⊢ BddAbove {β | ∃ f, IsUnivalentNormalized f ∧ β = integralMeansSpectrum f τ} All goals completed! 🐙
τ:ℝ⊢ {β | ∃ f, IsUnivalentNormalized f ∧ Bornology.IsBounded (f '' unitDisk) ∧ β = integralMeansSpectrum f τ}.Nonempty All goals completed! 🐙
τ:ℝ⊢ {β | ∃ f, IsUnivalentNormalized f ∧ Bornology.IsBounded (f '' unitDisk) ∧ β = integralMeansSpectrum f τ} ⊆
{β | ∃ f, IsUnivalentNormalized f ∧ β = integralMeansSpectrum f τ} τ:ℝf:ℂ → ℂhf:IsUnivalentNormalized fleft✝:Bornology.IsBounded (f '' unitDisk)⊢ integralMeansSpectrum f τ ∈ {β | ∃ f, IsUnivalentNormalized f ∧ β = integralMeansSpectrum f τ}; All goals completed! 🐙τ:ℝhsub:Tendsto (fun r ↦ 1 - r) (𝓝[<] 1) (𝓝[>] 0)⊢ integralMeansSpectrum id τ = 0
have habs : Tendsto (fun r : ℝ => |Real.log (1 - r)|) (𝓝[Iio 1] (1 : ℝ)) atTop :=
tendsto_abs_atBot_atTop.comp (Real.tendsto_log_nhdsGT_zero.comp hsub) τ:ℝhsub:Tendsto (fun r ↦ 1 - r) (𝓝[<] 1) (𝓝[>] 0)habs:Tendsto (fun r ↦ |Real.log (1 - r)|) (𝓝[<] 1) atTop⊢ integralMeansSpectrum id τ = 0
simp [integralMeansSpectrum, (tendsto_const_nhds.div_atTop habs).limsup_eq] All goals completed! 🐙Brennan's conjecture, part 1: $B(-2) = 1$.
This was proved by an internal OpenAI model in September 2026 [OAI26a]; see the linked Lean proof.
@[category research solved, AMS 30, formal_proof using lean4 at
"https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Analysis/IntegralMeans/Main.lean#L10"]
theorem brennan_universalSpectrum :
universalSpectrum (-2) = 1 := by ⊢ universalSpectrum (-2) = 1
sorry All goals completed! 🐙Brennan's conjecture, part 2: $B_b(-2) = 1$.
@[category research open, AMS 30]
theorem brennan_universalSpectrumBounded :
universalSpectrumBounded (-2) = 1 := by ⊢ universalSpectrumBounded (-2) = 1
sorry All goals completed! 🐙Brennan's conjecture, part 3: $B(-2) = B_b(-2)$.
@[category API, AMS 30]
theorem brennan_spectra_eq :
universalSpectrum (-2) = universalSpectrumBounded (-2) := by ⊢ universalSpectrum (-2) = universalSpectrumBounded (-2)
rw [brennan_universalSpectrum, ⊢ 1 = universalSpectrumBounded (-2) All goals completed! 🐙 brennan_universalSpectrumBounded ⊢ 1 = 1 All goals completed! 🐙] All goals completed! 🐙Brennan's conjecture: $B(-2) = B_b(-2) = 1$.
@[category API, AMS 30]
theorem brennan :
universalSpectrum (-2) = 1 ∧ universalSpectrumBounded (-2) = 1 :=
⟨brennan_universalSpectrum, brennan_universalSpectrumBounded⟩end BrennanConjecture