Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Limit tuple at infinite rank from local approximation

Proved
OAI.FreeGroupFactorMain.InfiniteGeneration.generating_haar_tuple

by wurtle · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

free-group-factorsoai-math

Throughout, L(G)L(G)L(G) is the group von Neumann algebra of a discrete group GGG acting on ℓ2(G)\ell^2(G)ℓ2(G), with canonical trace τ(x)=⟨xδe,δe⟩\tau(x)=\langle x\delta_e,\delta_e\rangleτ(x)=⟨xδe​,δe​⟩, left-regular unitaries λ(g)\lambda(g)λ(g), and ∥x∥2=∥xδe∥ℓ2\|x\|_2=\|x\delta_e\|_{\ell^2}∥x∥2​=∥xδe​∥ℓ2​. Let Index=Fin 3⊔N⊔{∗}\mathrm{Index}=\mathrm{Fin}\,3\sqcup\mathbb N\sqcup\{*\}Index=Fin3⊔N⊔{∗} and M=L(F(Index))M=L(\mathbb F(\mathrm{Index}))M=L(F(Index)). Let Ai=λ(i)A_i=\lambda(i)Ai​=λ(i) for i∈Fin 3i\in\mathrm{Fin}\,3i∈Fin3 be the initial tuple, and for q∈N⊔{∗}q\in\mathbb N\sqcup\{*\}q∈N⊔{∗} let Eq=λ(q)E_q=\lambda(q)Eq​=λ(q) be the extra generators. The orbit is the set of tuples (Φ(Ai))i(\Phi(A_i))_i(Φ(Ai​))i​ for τ\tauτ-preserving ∗*∗-automorphisms Φ\PhiΦ of MMM. Tuples carry the metric dist(V,U)=max⁡i∥Vi−Ui∥\mathrm{dist}(V,U)=\max_i\|V_i-U_i\|dist(V,U)=maxi​∥Vi​−Ui​∥ in the operator norm. Assume that for every UUU in the orbit, δ,ε>0\delta,\varepsilon>0δ,ε>0 and g∈F(Index)g\in\mathbb F(\mathrm{Index})g∈F(Index) there are VVV in the orbit with dist(V,U)<δ\mathrm{dist}(V,U)<\deltadist(V,U)<δ and a finitely supported ppp on F3\mathbb F_3F3​ with ∥∑hp(h)Vh−λ(g)∥2<ε\|\sum_hp(h)V_h-\lambda(g)\|_2<\varepsilon∥∑h​p(h)Vh​−λ(g)∥2​<ε. Then there is a triple UUU of unitaries in MMM with τ(Ug)=0\tau(U_g)=0τ(Ug​)=0 for every nonidentity g∈F3g\in\mathbb F_3g∈F3​ and

span‾{Ugδe:g∈F3}=ℓ2(F(Index)).\overline{\mathrm{span}}\{U_g\delta_e:g\in\mathbb F_3\}=\ell^2(\mathbb F(\mathrm{Index})).span​{Ug​δe​:g∈F3​}=ℓ2(F(Index)).

This is the limit step for the infinite-rank factor. Lean proves it by a Baire-type lemma rather than by the explicit iteration of Section 5 of the paper, which treats finite rank.

Formalization Note The statement is verbatim from OpenAI's Lean development, with the listed Definitions imported in place of the upstream modules; the definitions are supporting code for this statement.

Preamble
import Mathlib
import Definitions.Def_FreeGroupFactorProof18

namespace OAI

noncomputable section

universe uA uG uι

open Set Metric Filter
open scoped NNReal Topology BigOperators ContDiff ENNReal

attribute [local instance] Classical.propDecidable

namespace FreeGroupFactorMain.Generation

end FreeGroupFactorMain.Generation

namespace FreeGroupFactorMain.InfiniteGeneration
open Generation

end FreeGroupFactorMain.InfiniteGeneration

namespace FreeGroupFactorMain.Generation
variable {G : Type uG} [Group G] {ι : Type uι}

end FreeGroupFactorMain.Generation

namespace FreeGroupFactorMain.InfiniteGeneration
open Generation

 

Formal statement
theorem generating_haar_tuple
    (hlocal : ∀ U ∈ orbit, ∀ δ : ℝ, 0 < δ → ∀ g : Group, ∀ ε : ℝ, 0 < ε →
      ∃ V ∈ orbit, dist V U < δ ∧ ∃ p : FreeGroup (Fin 3) →₀ ℂ,
        dist (groupL2 (poly V p)) (lp.single 2 g (1 : ℂ)) < ε) :
    ∃ U : Tuple,
      (∀ g : FreeGroup (Fin 3), canonicalTrace (word U g) = if g = 1 then 1 else 0) ∧
      ⊤ ≤ (Submodule.span ℂ (Set.range (fun g => groupL2 (word U g)))).topologicalClosure := by
  sorry

end FreeGroupFactorMain.InfiniteGeneration
end
end OAI
Source
OpenAI, An isomorphism of the free group factors, September 23, 2026, https://github.com/openai/math (paper: preprints/An-isomorphism-of-the-free-group-factors-September-23-2026/An-isomorphism-of-the-free-group-factors-September-23-2026.pdf; Lean: lean/OAI/Analysis/FreeGroupFactor and lean/OAI/Analysis/InterpolatedFactors, Apache License 2.0); Lean declaration `OAI.FreeGroupFactorMain.InfiniteGeneration.generating_haar_tuple`, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Analysis/FreeGroupFactor/InfiniteGeneration.lean#L431

View graph

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