Moment preservation with inactive free generators
ProvedOAI.FreeGroupFactorMain.FiniteActive.momentsThroughout, is the group von Neumann algebra of a discrete group acting on , with canonical trace , left-regular unitaries , and . Let be finite, arbitrary, and let with . Let be finitely supported with self-adjoint, let () be finitely supported real functions on , and let solve with , where is the evaluation of the word in the tuple . Let be the tuple consisting of on and the original on . Then for all and all , the evaluation of in has trace if and otherwise.
This extends the moment invariance of the paper's Lemma 3.4 to an ambient free group with additional generators on which the flow does not act.
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.
import Mathlib
import Definitions.Def_FreeGroupFactorProof18
namespace OAI
noncomputable section
universe uA uι uκ
open Set Metric Filter
open scoped NNReal Topology BigOperators ContDiff ENNReal
attribute [local instance] Classical.propDecidable
open scoped ContDiff BigOperators ENNReal
namespace FreeGroupFactorMain
end FreeGroupFactorMain
namespace FreeGroupFactorMain.UnitaryEvaluation
variable {A : Type uA} [CStarAlgebra A] {ι : Type uι}
end FreeGroupFactorMain.UnitaryEvaluation
namespace FreeGroupFactorMain
open scoped ContDiff
open UnitaryEvaluation
end FreeGroupFactorMain
namespace FreeGroupFactorMain.UnitaryEvaluation
open scoped ContDiff
variable {A : Type uA} [CStarAlgebra A] {ι : Type uι} {κ : Type uκ}
end FreeGroupFactorMain.UnitaryEvaluation
namespace FreeGroupFactorMain.FiniteActive
open UnitaryEvaluation
open scoped ContDiff
variable {ι : Type uι} {κ : Type uκ}
theorem moments [Fintype ι] [DecidableEq ι] [DecidableEq κ]
(h : ι → FreeGroup ι →₀ ℝ) (l : ℤ →₀ ℂ)
(hS : IsSelfAdjoint (laurentValue
(generatorUnitary (none : Option (ι ⊕ κ))) l))
(X : ℝ → ι → Ambient ι κ) (hU : ∀ t i, X t i ∈ unitary (Ambient ι κ))
(hX₀ : X 0 = fun i => groupUnitary (FreeGroup.of (some (Sum.inl i))))
(hX : ∀ t, HasDerivAt X (PolynomialFlow.field
(laurentValue (generatorUnitary (none : Option (ι ⊕ κ))) l) h (X t)) t) :
∀ t (g : FreeGroup (Option (ι ⊕ κ))), canonicalTrace (wordHom
(extendUnitary (fun j => ⟨tuple (X t) j,tuple_unitary (X t) (hU t) j⟩)
(generatorUnitary none)) g) = if g = 1 then 1 else 0 := by
sorry
end FreeGroupFactorMain.FiniteActive
end
end OAI