Alphabeta Math
Pipeline-generated
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.

Von Neumann closure, standard vectors and modular analytic tools — Examples

1 · Prerequisites

2 · Summary

The example separates two representations of the same finite matrix algebra. In its defining representation every nonzero vector is cyclic, while a nonzero projection kills each vector, so none is separating. In the Hilbert–Schmidt left representation, a faithful density matrix supplies a unit cyclic-separating vector through its positive square root. The example proves both statements directly and identifies the resulting vector functional with the density-matrix trace functional.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

None yet.

5 · Examples, experiments and counterexamples

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Defining and Hilbert–Schmidt representations of M_n

Statement

Assume the Axiom of Choice. Let n>1, let H=Cn with its standard inner product linear in the first argument, and let M=B(H)=Mn(C) act on H in its defining representation. Every nonzero vector in H is cyclic for M, but no vector in H is separating for M.

Now let ρ∈M be a faithful density matrix, meaning ρ=ρ∗, ⟨ρv,v⟩>0 for every nonzero v∈H, and Tr⁡(ρ)=1. Let K=Mn(C) with the Hilbert–Schmidt inner product ⟨X,Y⟩2:=Tr⁡(Y∗X), and represent M on K by left multiplication LaX:=aX. Then {La:a∈M} is a concrete von Neumann algebra on K, and Ω:=ρ1/2 is a unit cyclic and separating vector for this representation. Its vector functional is ⟨LaΩ,Ω⟩2=Tr⁡(ρa)(a∈M).

Facts & Assumptions

Given: Choice, n>1, H=Cn, M=Mn(C), a faithful density matrix ρ, and the finite matrix and Hilbert-space conventions.

[A1]

The Axiom of Choice is the declared hypothesis for the concrete von Neumann algebra interface (The Axiom of Choice, Concrete von Neumann algebra and faithful vector).

[F1]

The inner product is linear in its first argument, and Hilbert adjoints satisfy ⟨Aξ,η⟩=⟨ξ,A∗η⟩ (Real and complex inner-product spaces and their induced length, Hilbert-adjoint identities).

[F2]

Finite Hermitian matrices have orthonormal eigenbases; positive square roots and their inverses exist for positive-definite matrices, and finite matrix trace is basis-independent and cyclic (Finite matrix spectral and state calculus, The basis-independent trace of an endomorphism of a finite-dimensional vector space).

[F3]

Relative to the standard orthonormal basis of Cn, every n×n matrix is Hilbert–Schmidt, with squared Hilbert–Schmidt norm ∑j∥Xej∥2=Tr⁡(X∗X) (Hilbert–Schmidt operator and Hilbert–Schmidt norm, Hilbert space).

[F4]

A concrete von Neumann algebra is a unital star subalgebra equal to its double commutant; cyclic means dense orbit and separating means trivial operator kernel on the vector (Concrete von Neumann algebra and faithful vector).

Proof

technique · direct finite-dimensional construction

Given: [A1], [F1]–[F6], and the matrices in the Statement.

1.1A1F4F5givenalgebra

Let (ej)j=1n be the standard orthonormal basis. If T∈M′, then commuting with each coordinate projection Pj forces Tej=λjej. Commuting with each matrix unit Eij gives λi=λj, hence T=λI. Conversely scalar matrices commute with every element of M. Thus M′=CI and M′′=(CI)′=B(H)=M, so M is concrete.

1.2F1F4givenconstruct

Fix ξ≠0. For any η∈H, define aηz:=⟨z,ξ⟩η/∥ξ∥2. This is a linear matrix operator and aηξ=η, so Mξ=H and ξ is cyclic. If ξ≠0, the orthogonal projection onto ξ⊥ is nonzero since n>1, and it annihilates ξ. If ξ=0, the identity is nonzero and annihilates ξ. Hence no vector is separating for M.

1.3F2F3givenconstruct

Direct matrix-unit calculation gives ⟨Eij,Ekl⟩2=δikδjl, so the units are an orthonormal basis of K. For X=(xij), ∥X∥22=∑i,j∣xij∣2, proving positive definiteness. If (Xm) is Cauchy, then each entry is Cauchy because ∣xij(m)−xij(k)∣≤∥Xm−Xk∥2. Their finitely many limits form a matrix X, and the finite sum formula gives ∥Xm−X∥2→0. Thus K is complete and hence a Hilbert space; [F3] makes every matrix Hilbert–Schmidt.

2.1A1F1F4F5F6step 1.3givenalgebra

For a,b∈M, the coordinate formulas are (aX)ij=∑kaikxkj and (Xb)ij=∑kxikbkj. Finite Cauchy–Schwarz, summed over i,j, gives ∥aX∥22≤(∑i,k∣aik∣2)∥X∥22 and ∥Xb∥22≤∥X∥22(∑k,j∣bkj∣2). Thus La,Rb∈B(K) by [F5] and [F6]. Also LaLb=Lab, LI=IK, and ⟨LaX,Y⟩2=Tr⁡(Y∗aX)=⟨X,La∗Y⟩2, so La∗=La∗. Since LaI=a, the map a↦La is injective. If S∈{La:a∈M}′ and b=S(I), then every X=LX(I) satisfies S(X)=S(LXI)=LXS(I)=Xb; hence S=Rb. Conversely every right multiplication commutes with every left multiplication. If T∈{Rb:b∈M}′ and a=T(I), then every X=RX(I) satisfies T(X)=RXT(I)=aX, so T=La; the converse commutation also holds. Therefore {La:a∈M}′′={La:a∈M}, proving that the left representation is concrete.

3.1F2F4step 1.3step 2.1algebra

By [F2], ρ1/2 is invertible and ∥Ω∥22=Tr⁡(ρ)=1. For every X∈K, a=Xρ−1/2 satisfies LaΩ=X, so MΩ=K and Ω is cyclic. If LaΩ=0, then aρ1/2=0; right multiplication by ρ−1/2 gives a=0, so Ω is separating. Finally, ⟨LaΩ,Ω⟩2=Tr⁡(ρ1/2aρ1/2)=Tr⁡(ρa) by cyclicity of finite matrix trace [F2].

4.1step 1.1step 1.2step 1.3step 2.1step 3.1∎

Steps 1.1–1.2 establish the defining-representation assertions; steps 1.3, 2.1, and 3.1 construct the Hilbert–Schmidt left representation and verify its faithful cyclic-separating vector. The two representations act on different Hilbert spaces.

Sources