Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Upper-strip KMS condition for von Neumann algebras

Definition

Assume the Axiom of Choice. Let M≠{0} be a concrete von Neumann algebra on a complex Hilbert space. Use the predual M∗=Q of Trace-class quotient predual and normal functionals; its elements are the normal linear functionals, and the induced topology σ(M,Q) is the ultraweak topology. A normal state on M is a bounded complex-linear functional ω:M→C with ω(I)=1, ω(a)≥0 for every positive a∈M, and ω ⁣(sup⁡iai)=sup⁡iω(ai) for every increasing net (ai) of positive elements with 0≤ai≤CI for a common finite C and supremum taken in M. An automorphism of M is normal when it preserves the suprema of all such bounded increasing positive nets. A point-ultraweakly continuous one-parameter automorphism group is a family (αt)t∈R of bijective unital complex-linear maps M→M preserving multiplication and adjoints, with α0=id⁡M, αsαt=αs+t, and t↦φ(αt(x)) continuous for every x∈M and every normal linear functional φ∈Q. For dimensionless t and dimensionless β>0, the normal state ω satisfies the upper-strip (α,β) KMS condition when, for every A,B∈M, there is a bounded scalar function FA,B on Sβ={z∈C:0≤Im⁡z≤β} that is continuous on Sβ, holomorphic in its interior, and satisfies FA,B(t)=ω(Aαt(B)),FA,B(t+iβ)=ω(αt(B)A)(t∈R).

Depends on

Dependency tree · 2 levels

Sources