Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

One-step approximation of the extra generator

Proved
OAI.FreeGroupFactorMain.one_step

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 n≥3n\ge3n≥3, ε>0\varepsilon>0ε>0, Γ=F(Fin n⊔{∗})\Gamma=\mathbb F(\mathrm{Fin}\,n\sqcup\{*\})Γ=F(Finn⊔{∗}). There are a τ\tauτ-preserving ultraweakly continuous ∗*∗-automorphism α\alphaα of L(Γ)L(\Gamma)L(Γ) and a word w∈Fnw\in\mathbb F_nw∈Fn​ such that

∥α(λ(j))−λ(j)∥<ε(j∈Fin n),∥α(λ(w))−λ(∗)∥2<ε.\|\alpha(\lambda(j))-\lambda(j)\|<\varepsilon\quad(j\in\mathrm{Fin}\,n),\qquad \|\alpha(\lambda(w))-\lambda(*)\|_2<\varepsilon.∥α(λ(j))−λ(j)∥<ε(j∈Finn),∥α(λ(w))−λ(∗)∥2​<ε.

This is the form used in Lean of Proposition 5.1 of the paper, with the second estimate in ∥⋅∥2\|\cdot\|_2∥⋅∥2​.

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

namespace FreeGroupFactorMain.Generation
variable {A : Type uA} [CStarAlgebra A] {ι : Type uι}

variable {G : Type uG} [Group G]

end FreeGroupFactorMain.Generation

namespace FreeGroupFactorMain
open UnitaryEvaluation

Formal statement
theorem one_step (n : ℕ) (hn : 3 ≤ n) {ε : ℝ} (hε : 0 < ε) :
    ∃ α : groupVonNeumann (FreeGroup (Option (Fin n))) ≃⋆ₐ[ℂ] groupVonNeumann (FreeGroup (Option (Fin n))),
      (∀ T, canonicalTrace (α T) = canonicalTrace T) ∧
      @Continuous _ _ (groupUltraweakTopology (FreeGroup (Option (Fin n))))
        (groupUltraweakTopology (FreeGroup (Option (Fin n)))) α ∧
      ∃ w : FreeGroup (Fin n),
        (∀ j : Fin n, ‖α (groupUnitary (FreeGroup.of (some j))) - groupUnitary (FreeGroup.of (some j))‖ < ε) ∧
        twoNorm (α (groupUnitary (FreeGroup.map Option.some w)) - groupUnitary (FreeGroup.of none)) < ε := by
  sorry

end FreeGroupFactorMain
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.one_step`, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Analysis/FreeGroupFactor/LocalAutomorphism.lean#L257

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