Operator Algebra Structures in Discrete Order Geometry (DOG)

Author: Zhang Suhang

(Luoyang, Henan)

---

Abstract

Discrete Order Geometry (DOG) takes finite discrete lattices, order nesting, and local correlation as its ontology. This paper establishes operator algebra structures within DOG. It defines DOG order operators, the order operator algebra, order involution, and the order trace; proves that DOG order operators form an algebra under composition; that order self-adjoint operators form a real vector space; that order unitary operators form a group; and that under a regular continuum limit, the DOG order operator algebra converges to an operator algebra on a Hilbert space. The conclusion is: the DOG operator algebra is the algebraicization of discrete order structures, and the continuous operator algebra is a special case of it under the regular limit.

Keywords: Discrete Order Geometry; DOG; operator algebra; order operator; order involution; continuum limit

---

1 Introduction

Discrete Order Geometry (DOG) takes a finite discrete lattice point set, order nesting, and local correlation as its underlying ontology. Previous work has established the lattice structure, matrix representation, group structure, combinatorial foundations, and topological structure of DOG. This paper further establishes the operator algebra structure of DOG.

In DOG, operators do not come from external presuppositions, but from the order structure itself:

· The lattice point state space defines the domain of action of operators;

· The order relation defines the locality of operators;

· The neighborhood structure defines the coupling range of operators;

· The order automorphism group defines the equivariance of operators.

Objectives of this paper:

1. Define DOG order operators;

2. Define the DOG order operator algebra;

3. Define order involution and the order trace;

4. Establish the relationship between the order operator algebra and the order group;

5. Explain that the continuous operator algebra is a special case of the DOG operator algebra under the regular limit.

---

2 DOG Order State Space

2.1 Lattice Point State Space

Let the DOG lattice point set be:

\mathcal{L}=\{p,q,r,\dots\}

For each lattice point p, define the local state space:

\mathcal{S}_p

The overall order state space is:

\mathcal{V}_{\mathrm{DOG}}=\bigoplus_{p\in\mathcal{L}}\mathcal{S}_p

If \mathcal{S}_p=\mathbb{C}, then:

\mathcal{V}_{\mathrm{DOG}}\cong\mathbb{C}^{|\mathcal{L}|}

2.2 Order Basis

For each lattice point p, take the basis vector:

e_p

Then any order state can be written as:

\Psi=\sum_{p\in\mathcal{L}}\psi_p e_p

---

3 DOG Order Operators

3.1 Definition of Order Operators

Define a DOG order operator as a linear map:

\hat A:\mathcal{V}_{\mathrm{DOG}}\to\mathcal{V}_{\mathrm{DOG}}

In the order basis, \hat A is represented by the matrix (A_{pq}):

\hat A e_q=\sum_{p\in\mathcal{L}}A_{pq}e_p

3.2 Local Order Operators

If \hat A satisfies:

A_{pq}=0,\qquad q\notin N(p)

then \hat A is called a local order operator.

A local order operator couples only lattice points within the neighborhood, consistent with the local correlation property of DOG.

3.3 Composition of Order Operators

The composition of two order operators \hat A,\hat B is defined as:

(\hat A\hat B)e_q=\hat A(\hat B e_q)

which corresponds to matrix multiplication in the order basis:

(\hat A\hat B)_{pq}=\sum_{r\in\mathcal{L}}A_{pr}B_{rq}

---

4 DOG Order Operator Algebra

4.1 Definition of the Algebra

Define the DOG order operator algebra as:

\mathcal{A}_{\mathrm{DOG}}=\{\hat A:\mathcal{V}_{\mathrm{DOG}}\to\mathcal{V}_{\mathrm{DOG}}\mid \hat A\text{ is an order operator}\}

4.2 Algebraic Structure Theorem

Theorem 1: \mathcal{A}_{\mathrm{DOG}} forms an associative algebra under operator addition, scalar multiplication, and composition.

Proof:

1. Closure under addition: if \hat A,\hat B\in\mathcal{A}_{\mathrm{DOG}}, then \hat A+\hat B\in\mathcal{A}_{\mathrm{DOG}};

2. Closure under scalar multiplication: if \hat A\in\mathcal{A}_{\mathrm{DOG}}, \lambda\in\mathbb{C}, then \lambda\hat A\in\mathcal{A}_{\mathrm{DOG}};

3. Closure under composition: if \hat A,\hat B\in\mathcal{A}_{\mathrm{DOG}}, then \hat A\hat B\in\mathcal{A}_{\mathrm{DOG}};

4. Associativity: operator composition satisfies the associative law;

5. Distributivity: operator composition satisfies the distributive law with respect to addition.

Hence \mathcal{A}_{\mathrm{DOG}} forms an associative algebra.

4.3 Local Order Operator Algebra

Define the local order operator algebra as:

\mathcal{A}_{\mathrm{loc}}=\{\hat A\in\mathcal{A}_{\mathrm{DOG}}\mid \hat A\text{ is a local order operator}\}

\mathcal{A}_{\mathrm{loc}} is a subalgebra of \mathcal{A}_{\mathrm{DOG}}.

4.4 Matrix Representation of Order Operators

In the order basis, there exists an algebra isomorphism:

\mathcal{A}_{\mathrm{DOG}}\cong M_N(\mathbb{C})

where N=|\mathcal{L}|.

---

5 Order Involution and Order Trace

5.1 Order Involution

Define the DOG order involution as an operator:

\hat A^\dagger:\mathcal{V}_{\mathrm{DOG}}\to\mathcal{V}_{\mathrm{DOG}}

satisfying:

\langle \hat A^\dagger\Psi|\Phi\rangle_{\mathrm{DOG}}

=

\langle \Psi|\hat A\Phi\rangle_{\mathrm{DOG}}

In the order basis, \hat A^\dagger corresponds to the conjugate transpose matrix:

(A^\dagger)_{pq}=\overline{A_{qp}}

5.2 Order Self-Adjoint Operators

If \hat A^\dagger=\hat A, then \hat A is called an order self-adjoint operator.

Theorem 2: Order self-adjoint operators form a real vector space.

Proof: If \hat A,\hat B are self-adjoint, then \hat A+\hat B is self-adjoint; if \lambda\in\mathbb{R}, then \lambda\hat A is self-adjoint. Hence self-adjoint operators form a real vector space.

5.3 Order Unitary Operators

If:

\hat U^\dagger\hat U=\hat U\hat U^\dagger=\hat I

then \hat U is called an order unitary operator.

Theorem 3: Order unitary operators form a group.

Proof: The composition of unitary operators is still unitary, the identity operator is unitary, and the inverse of a unitary operator is still unitary. Hence they form a group.

5.4 Order Trace

Define the DOG order trace as:

\operatorname{Tr}_{\mathrm{DOG}}(\hat A)=\sum_{p\in\mathcal{L}}A_{pp}

The order trace satisfies:

1. Linearity: \operatorname{Tr}(\lambda\hat A+\mu\hat B)=\lambda\operatorname{Tr}(\hat A)+\mu\operatorname{Tr}(\hat B);

2. Cyclicity: \operatorname{Tr}(\hat A\hat B)=\operatorname{Tr}(\hat B\hat A).

---

6 Order Operators and the Order Group

6.1 Action of the Order Group

The DOG order group:

G_{\mathrm{DOG}}=\operatorname{Aut}(\mathcal{G})

acts on \mathcal{V}_{\mathrm{DOG}}:

\hat U_\varphi:\mathcal{V}_{\mathrm{DOG}}\to\mathcal{V}_{\mathrm{DOG}}

defined as:

\hat U_\varphi e_p=e_{\varphi(p)}

6.2 Equivariant Order Operators

If an order operator \hat A satisfies:

\hat U_\varphi\hat A=\hat A\hat U_\varphi,\qquad \forall\varphi\in G_{\mathrm{DOG}}

then \hat A is called a G_{\mathrm{DOG}}-equivariant order operator.

6.3 Equivariant Operator Algebra

Define the equivariant order operator algebra as:

\mathcal{A}_{\mathrm{DOG}}^{G}=\{\hat A\in\mathcal{A}_{\mathrm{DOG}}\mid \hat U_\varphi\hat A=\hat A\hat U_\varphi,\;\forall\varphi\in G_{\mathrm{DOG}}\}

Theorem 4: \mathcal{A}_{\mathrm{DOG}}^{G} is a subalgebra of \mathcal{A}_{\mathrm{DOG}}.

Proof: The addition, scalar multiplication, and composition of equivariant operators remain equivariant, hence they form a subalgebra.

6.4 Group Algebra and the Order Group

Define the DOG group algebra as:

\mathbb{C}[G_{\mathrm{DOG}}]

that is, finite linear combinations of G_{\mathrm{DOG}}.

The group algebra acts on the order state space:

\mathbb{C}[G_{\mathrm{DOG}}]\times\mathcal{V}_{\mathrm{DOG}}\to\mathcal{V}_{\mathrm{DOG}}

---

7 Spectrum of Order Operators

7.1 Order Spectrum

For an order operator \hat A, define its order spectrum as:

\sigma(\hat A)=\{\lambda\in\mathbb{C}\mid \hat A-\lambda\hat I\text{ is not invertible}\}

7.2 Spectrum of Self-Adjoint Operators

Theorem 5: The spectrum of an order self-adjoint operator is real.

Proof: A self-adjoint operator in a finite-dimensional space corresponds to a self-adjoint matrix, and the eigenvalues of a self-adjoint matrix are real.

7.3 Spectrum of Unitary Operators

Theorem 6: The spectrum of an order unitary operator lies on the unit circle.

Proof: A unitary operator in a finite-dimensional space corresponds to a unitary matrix, and the eigenvalues of a unitary matrix have modulus 1.

7.4 Spectrum and Order Structure

Theorem 7: The dimension of the null space of the order Laplacian matrix equals the number of connected components of the DOG lattice.

Proof: This follows directly from the matrix representation and graph-theoretic results.

---

8 Order Operator Algebra Under the Continuum Limit

8.1 Regular Limit Conditions

Define the regular limit conditions from the DOG operator algebra to the continuous operator algebra:

1. The number of lattice points tends to infinity, while the macroscopic scale remains finite;

2. Lattice point densification: \Delta x\to0;

3. Order weights tend to a continuous measure;

4. Order operator kernels converge to continuous kernels;

5. The order state space is completed under the order inner product.

8.2 Convergence Theorem

Theorem 8: Under the regular limit conditions, the DOG order operator algebra \mathcal{A}_{\mathrm{DOG}} converges to the operator algebra \mathcal{A}(\mathcal{H}) on a Hilbert space.

Proof:

1. The order state space converges to a Hilbert space \mathcal{H} under completion;

2. Order operators correspond to matrices in the order basis, and the matrix elements converge to continuous kernels;

3. The addition, scalar multiplication, and composition of order operators are preserved in the limit;

4. The order involution converges to the adjoint on the Hilbert space;

5. The order trace converges to the continuous trace.

Hence \mathcal{A}_{\mathrm{DOG}} converges to \mathcal{A}(\mathcal{H}).

8.3 The Continuous Operator Algebra as a Special Case

By Theorem 8, the continuous operator algebra is a special case of the DOG order operator algebra under the regular limit.

The DOG operator algebra does not presuppose a continuous structure; continuity is a limiting result.

---

9 Examples

9.1 One-Dimensional Chain

\mathcal{L}=\mathbb{Z}_N,\qquad N(p)=\{p-1,p,p+1\}

Local order operators correspond to tridiagonal matrices.

The order operator algebra is M_N(\mathbb{C}).

9.2 Three-Element Local Lattice

N(p)=\{a,b,c\},\qquad a\preceq c,\qquad b\preceq c

The order group \mathbb{Z}_2 fixing c acts on the state space.

Equivariant order operators satisfy the symmetry of exchanging a,b.

9.3 Disconnected DOG Lattice

If \mathcal{L} is divided into two connected components, then:

\mathcal{A}_{\mathrm{DOG}}\cong \mathcal{A}_1\oplus\mathcal{A}_2

that is, the direct sum of the operator algebras of the two components.

9.4 Continuum Limit

Under the regular limit, the order operator algebra of a one-dimensional chain converges to the operator algebra on L^2(\mathbb{R}), including:

· Position operator;

· Momentum operator;

· Hamiltonian operator.

---

10 Conclusion

This paper establishes the operator algebra structure within DOG:

1. DOG order operators are defined on the order state space;

2. Order operators form an associative algebra \mathcal{A}_{\mathrm{DOG}} under addition, scalar multiplication, and composition;

3. Local order operators form a subalgebra \mathcal{A}_{\mathrm{loc}};

4. Order involution, order self-adjoint operators, and order unitary operators are defined by the order inner product;

5. Order self-adjoint operators form a real vector space, and order unitary operators form a group;

6. The order group acts on the state space, and equivariant order operators form an equivariant subalgebra;

7. The spectrum of order self-adjoint operators is real, and the spectrum of order unitary operators lies on the unit circle;

8. Under the regular limit conditions, the DOG order operator algebra converges to an operator algebra on a Hilbert space.

The continuous operator algebra is a special case of the DOG order operator algebra under the regular limit, rather than a presupposed foundation.

---

References

Omitted