Keyboard shortcuts

Press or to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

QCA Axiomatization: Rigorous Foundation of Five-Tuple Definition

In previous section, we saw intuitive picture of QCA universe—discrete spacetime, finite-dimensional states, local evolution. Now we give rigorous mathematical definition.

Why Axiomatization?

From Intuition to Rigor

In history of physics, axiomatization always transforms vague intuition into precise mathematics:

Example 1: Euclidean Geometry

  • Intuition: “Obvious” properties of points, lines, surfaces
  • Axiomatization: Five axioms → entire geometry

Example 2: Quantum Mechanics

  • Intuition: Wave-particle duality, measurement collapse
  • Axiomatization: Hilbert space + unitary evolution + Born rule

Example 3: QCA Universe

  • Intuition: Discrete lattice points, local jumps, quantum superposition
  • Axiomatization: Five-tuple
graph LR
    A["Physical Intuition<br/>Vague Concepts"] --> B["Mathematical Axioms<br/>Precise Definitions"]

    B --> C["Rigorous Derivation<br/>Theorem Proofs"]

    C --> D["Testable Predictions<br/>Experimental Verification"]

    style A fill:#d4a5a5
    style B fill:#ffd93d
    style C fill:#6bcf7f
    style D fill:#6bcf7f

Benefits of Axiomatization:

  1. Eliminate Ambiguity: Every concept has precise definition
  2. Logical Self-Consistency: Derive from axioms, avoid circular reasoning
  3. Testability: Clearly distinguish assumptions from conclusions
  4. Universality: Axioms apply to all systems satisfying conditions

Five Components of Five-Tuple

Universe QCA object is defined as:

Let’s go deep into each component.

Component 1: Discrete Space

Graph Theory Foundation

Definition 1.1 (Countable Connected Graph): is countable set, carrying undirected connected graph structure:

  • Vertex Set: (countably infinite or finite)
  • Edge Set:
  • Symmetry:
  • No Self-Loops:
  • Connectivity: Path exists between any

Graph Distance:

Closed Ball:

Local Finiteness Assumption: For all and , .

graph TD
    A["Graph Λ"] --> B["Vertices=Lattice Points"]
    A --> C["Edges=Neighbor Relations"]

    B --> D["ℤᵈ Lattice<br/>Standard Example"]
    C --> E["dist(x,y)<br/>Shortest Path Length"]

    E --> F["Closed Ball B_R(x)<br/>All Points Within Radius R"]

    F --> G["Locally Finite<br/>|B_R(x)|<∞"]

    style A fill:#ffd93d
    style D fill:#6bcf7f
    style G fill:#6bcf7f

Standard Lattice

Most Common Choice: (-dimensional integer lattice)

One-Dimensional ():

  • Neighbor relation:
  • Distance:

Two-Dimensional (): (planar lattice points)

  • Neighbor relation: with ,
  • Distance (Manhattan):

Three-Dimensional (): (spatial lattice points)

  • Corresponds to discretization of physical space
  • Cubic lattice structure
graph TD
    A["Dimension d"] --> B["d=1<br/>One-Dimensional Chain"]
    A --> C["d=2<br/>Two-Dimensional Plane"]
    A --> D["d=3<br/>Three-Dimensional Space"]

    B --> E["...─○─○─○─○─..."]
    C --> F["Square Lattice Network"]
    D --> G["Cubic Lattice"]

    H["Physical Space<br/>ℝ³"] -.->|Discretization| D

    style A fill:#ffd93d
    style D fill:#6bcf7f
    style H fill:#d4a5a5

Translation Symmetry

Definition 1.2 (Translation Action): For , translation is defined as:

Properties:

  • (group property)
  • (identity)
  • (inverse)

Physical Meaning: Space invariant under translations → momentum conservation (Noether theorem)

Why Discrete? Three Reasons

Reason 1: UV Cutoff

Continuous space has UV divergences:

Discrete space naturally cuts off: Maximum momentum (Brillouin zone boundary).

Reason 2: Information Finiteness

Continuous space infinite-dimensional per point → infinite information. Discrete space countable + finite-dimensional → finite information per finite volume.

Reason 3: Quantum Gravity Hint

Planck scale m suggests spacetime discreteness.

graph LR
    A["Continuous Space ℝᵈ"] --> B["UV Divergences<br/>Infinite Information<br/>Planck Limit?"]

    C["Discrete Space Λ"] --> D["Natural Cutoff<br/>Finite Information<br/>Quantum Gravity Friendly"]

    B -.->|Paradigm Shift| D

    style A fill:#ff6b6b
    style B fill:#ff6b6b
    style C fill:#ffd93d
    style D fill:#6bcf7f

Component 2: Cellular Hilbert Space

Finite-Dimensional Quantum State Space

Definition 2.1 (Cellular Space): is finite-dimensional complex Hilbert space:

Each lattice point carries a copy:

Inner Product:

Orthonormal Basis:

Physical Interpretation: Local Degrees of Freedom

Value of determines quantum degree of freedom dimension of each lattice point:

Example 1: Spin

  • : Spin-1/2 (up , down )
  • : Spin-1 ()

Example 2: Occupation Number

  • : Fermion (empty , occupied )
  • : Boson (truncated )

Example 3: Standard Model

  • : 3 colors × 2 flavors × 3 generations?
  • Gauge degrees of freedom on edges (see Component 3)
graph TD
    A["Cellular Dimension d"] --> B["d=2<br/>Spin-1/2 or Fermion"]
    A --> C["d=3<br/>Spin-1 or Qubit+Auxiliary"]
    A --> D["d=18<br/>Quark Color+Flavor?"]

    B --> E["Simplest QCA"]
    C --> F["Medium Complexity"]
    D --> G["Standard Model Candidate"]

    style A fill:#ffd93d
    style E fill:#6bcf7f
    style G fill:#ff9999

Why Must Be Finite-Dimensional?

Theorem 2.2 (Finite-Dimensional Necessity): If , then total Hilbert space on infinite volume is non-separable (uncountable basis), causing:

  1. Cannot define tensor product structure of local algebras
  2. Quasi-local algebra ill-defined
  3. QCA evolution cannot guarantee continuity

Proof Idea: Non-separable space, cannot expand with countable basis.

Physical Meaning:

Quantum degrees of freedom of universe at each lattice point must be finite!

This is core constraint of QCA ontology.

Component 3: Quasi-Local Algebra

Construction of Infinite Tensor Product

Finite Volume Algebra: For finite set ( means finite subset): Bounded operator algebra: ( means all bounded operators)

Embedding Map: If :

Local Algebra: Set of all local operators.

Quasi-Local Algebra: Completion with operator norm .

graph TD
    A["Single Lattice Point<br/>𝒜_{x}=ℬ(ℂᵈ)"] --> B["Finite Set F<br/>𝒜_F=ℬ(⊗_{x∈F}ℋ_x)"]

    B --> C["All Finite Sets<br/>𝒜_loc=⋃_F 𝒜_F"]

    C --> D["Norm Completion<br/>𝒜=𝒜̄_loc"]

    E["Local Operators"] --> C
    F["Quasi-Local Operators"] --> D

    style A fill:#d4a5a5
    style C fill:#ffd93d
    style D fill:#6bcf7f

Concept of Support

Definition 3.1 (Operator Support): For , there exists smallest finite set such that , call the support of :

Physical Meaning: is lattice point set where operator “truly acts”.

Examples:

  • Single lattice point operator:
  • Nearest neighbor interaction:

Basic Properties of Algebra

Definition 3.2 ( Algebra): is algebra, satisfying:

  1. Algebra:
  2. Conjugation:
  3. Norm:
  4. Identity:

Why Algebra?

algebra is correct framework for “non-commutative topological spaces”:

  • Commutative algebra Compact Hausdorff space (Gelfand duality)
  • Non-commutative algebra “Quantum space”

Quasi-local algebra of QCA is non-commutative geometry of “infinite lattice quantum configuration space”.

graph LR
    A["Classical Configuration Space<br/>Compact Topological Space X"] <==> B["Commutative C* Algebra<br/>C(X)"]

    C["Quantum Configuration Space<br/>(Non-Commutative)"] <==> D["Non-Commutative C* Algebra<br/>𝒜"]

    A -.->|Quantization| C
    B -.->|Non-Commutativization| D

    style A fill:#d4a5a5
    style D fill:#6bcf7f

Component 4: QCA Evolution

Algebra Automorphism

Definition 4.1 (QCA): Map is called quantum cellular automaton of radius at most if:

Axiom QCA-1 (-Automorphism): and is bijective and continuous.

Axiom QCA-2 (Finite Propagation Radius): There exists such that for any finite and :

Axiom QCA-3 (Translation Covariant): For automorphism induced by translation :

graph TD
    A["QCA Axioms"] --> B["Axiom 1<br/>*-Automorphism"]
    A --> C["Axiom 2<br/>Finite Propagation R"]
    A --> D["Axiom 3<br/>Translation Covariant"]

    B --> E["Preserve Algebra Structure<br/>Unitarity"]
    C --> F["Causal Light Cone<br/>Information Propagation Speed"]
    D --> G["Spatial Homogeneity<br/>Momentum Conservation"]

    E --> H["Quantum Evolution"]
    F --> H
    G --> H

    H --> I["QCA Universe Evolution α"]

    style A fill:#ffd93d
    style I fill:#6bcf7f

Physical Meaning of Finite Propagation

Intuitive Picture: Operator supported on single point , after steps of evolution:

Information Propagation Speed: Let time step , lattice spacing , then maximum information propagation speed:

In continuous limit with fixed, if : This is exactly speed of light!

graph TD
    A["n=0<br/>Operator at x"] --> B["n=1<br/>Spreads to B_R(x)"]
    B --> C["n=2<br/>Spreads to B_2R(x)"]
    C --> D["After n Steps<br/>Spreads to B_nR(x)"]

    E["Discrete Light Cone<br/>dist≤nR"] --> D

    F["Continuous Limit<br/>|x-y|≤ct"] -.-> E

    style A fill:#6bcf7f
    style D fill:#ffd93d
    style F fill:#ff9999

Schumacher-Werner Theorem

Theorem 4.2 (Structure Theorem, Schumacher-Werner 2005): Any satisfying Axioms QCA-1 to QCA-3 can be written as: where is block-local QCA, is some spatial translation.

Block-Local QCA: There exists finite set and unitary such that: (product finite in some order)

Physical Interpretation: QCA evolution = periodically apply same local unitary on each translation block .

This is similar to Trotter decomposition:

Iteration and Time Evolution

Definition 4.3 (Iteration): Define integer iterations:

Time Parameterization: Discrete time step corresponds to physical time:

Continuous Limit: When and (in appropriate sense), recover continuous time evolution.

Component 5: Initial Universe State

Definition of State

Definition 5.1 (State): State on algebra is linear functional satisfying:

  1. Positivity:
  2. Normalization:

Physical Meaning: is expectation value of observable .

Pure States and Mixed States

Pure State: Cannot be decomposed into non-trivial convex combination of other states.

GNS Representation: For pure state , there exists Hilbert space , representation and cyclic vector :

Mixed State: Can be written as convex combination of pure states:

graph TD
    A["State ω"] --> B["Pure State<br/>Indecomposable"]
    A --> C["Mixed State<br/>Convex Combination"]

    B --> D["GNS Representation<br/>ℋ_ω, |Ω_ω⟩"]
    C --> E["Density Matrix<br/>ρ=Σ_i p_i|ψ_i⟩⟨ψ_i|"]

    D --> F["Quantum State |ψ⟩"]
    E --> F

    style A fill:#ffd93d
    style F fill:#6bcf7f

Initial Condition

Definition 5.2 (Initial Universe State): is quantum state of universe at .

Time Evolution: In Heisenberg picture, state evolves with time:

Schrödinger Picture: If has GNS representation and can be unitarily realized as :

Translation-Invariant States

Definition 5.3 (Translation-Invariant): State is called translation-invariant if:

Physical Meaning: Universe homogeneous in space, no special position.

Example 1: Vacuum State Vacuum of quantum field theory is translation-invariant.

Example 2: Thermal Equilibrium State Gibbs state at temperature is invariant under translations.

graph LR
    A["Translation-Invariant State<br/>ω∘θ_a=ω"] --> B["Spatial Homogeneity<br/>No Special Point"]

    B --> C["Physical Symmetry<br/>Momentum Conservation"]

    D["Vacuum State |0⟩"] --> A
    E["Thermal State e^{-βH}"] --> A

    style A fill:#ffd93d
    style C fill:#6bcf7f

Complete Definition of Five-Tuple

Universe QCA Object

Definition 5.4 (Universe QCA Object): Five-tuple is called universe QCA object if satisfies:

  1. is countably infinite connected graph, locally finite
  2. finite-dimensional
  3. is quasi-local algebra
  4. satisfies Axioms QCA-1 to QCA-3
  5. is normalized state (initial condition)

Hierarchical Structure of Five-Tuple

graph TD
    A["𝔘_QCA"] --> B["Λ<br/>Spatial Structure"]
    A --> C["ℋ_cell<br/>Local Degrees of Freedom"]
    A --> D["𝒜<br/>Observable Algebra"]
    A --> E["α<br/>Evolution Law"]
    A --> F["ω₀<br/>Initial Condition"]

    B --> G["Geometry/Topology"]
    C --> G

    D --> H["Quantum Structure"]
    C --> H

    E --> I["Dynamics"]
    F --> I

    G --> J["Physical Theory"]
    H --> J
    I --> J

    style A fill:#ffd93d
    style J fill:#6bcf7f

Hierarchical Interpretation:

ComponentDetermines WhatAnalogy
Spatial dimension, topologyChessboard squares
Degrees of freedom per pointType of piece on each square
ObservablesPossible observations/measurements
Evolution lawGame rules
Initial configurationGame opening

From Axioms to Physics: Three Key Corollaries

Corollary 1: Causal Structure Emergence

Proposition (detailed proof in next section): From QCA axioms, event set naturally induces causal partial order:

Physical Meaning: Causal structure is not pre-given, but naturally emerges from QCA locality.

Corollary 2: Unitarity and Information Conservation

Theorem (Unitary Realization): If is faithful translation-invariant state, then there exists GNS representation and unitary operator :

Physical Meaning: QCA evolution preserves information → quantum information conservation → reversibility.

Corollary 3: Lieb-Robinson Bound

Theorem (Lieb-Robinson Bound): For local operators supported on with : where is effective light speed, .

Physical Meaning: Even in discrete time, quantum information propagation still has speed upper bound similar to relativity.

graph TD
    A["QCA Axioms<br/>Finite Propagation R"] --> B["Corollary 1<br/>Causal Partial Order (E,⪯)"]
    A --> C["Corollary 2<br/>Unitary Evolution U"]
    A --> D["Corollary 3<br/>Lieb-Robinson Bound"]

    B --> E["Emergent Relativity<br/>Light Cone Structure"]
    C --> F["Information Conservation<br/>Reversibility"]
    D --> G["Effective Light Speed v<br/>Causal Constraint"]

    E --> H["Continuous Limit<br/>Lorentzian Spacetime"]
    F --> H
    G --> H

    style A fill:#ffd93d
    style H fill:#6bcf7f

Computer Operating System Analogy

Let’s use operating system analogy for five-tuple:

QCA ComponentOperating System AnalogyExplanation
Memory address spaceDiscrete, finite (e.g., 64-bit addresses)
Bytes per addressInformation stored at each location
Executable instruction setAllowed operations
CPU clock cycleInstructions executed per clock cycle
System initialization stateMemory configuration at boot

Deep Analogy:

Discrete Space = Memory addresses

  • ~ 3D memory layout
  • Local finiteness ~ finite neighbors per address

Cellular Space = Register size

  • ~ 1 bit ()
  • ~ 1 byte

Quasi-Local Algebra = Instruction set architecture

  • Local operators ~ single instructions (involve few registers)
  • Quasi-local algebra ~ entire instruction set (can combine infinitely)

QCA Evolution = Clock cycle

  • Single step ~ one CPU clock
  • Finite propagation ~ instructions can only access adjacent cache

Initial State = BIOS/boot program

  • Determines system startup state
graph LR
    subgraph "QCA Universe"
    A1["Λ<br/>Lattice Space"]
    A2["ℋ_cell<br/>Local States"]
    A3["α<br/>Evolution"]
    end

    subgraph "Computer Operating System"
    B1["Memory Addresses<br/>Discrete Space"]
    B2["Registers<br/>Finite Bits"]
    B3["CPU Clock<br/>Discrete Time"]
    end

    A1 -.->|Analogy| B1
    A2 -.->|Analogy| B2
    A3 -.->|Analogy| B3

    C["QCA=Universe Operating System"] --> A1
    C --> A2
    C --> A3

    style C fill:#ffd93d

Key Insight:

Just as operating system runs on discrete memory addresses, finite registers, discrete clock cycles,

universe also “runs” on discrete lattice points, finite quantum states, discrete time steps!

Chess Game Analogy

Another popular analogy: Chess.

QCA ComponentChess
8×8 chessboard
Possible pieces per square (empty, white pawn, black pawn…)
All possible board configurations
Move rules (movement+capture)
Opening configuration

Finite Propagation Radius :

  • Pawn: (can only move 1 square)
  • Knight: (L-shaped move)
  • Rook/Queen: can be large (diagonal/straight lines)

Translation Covariance: Chess rules same everywhere on board (except boundary special rules).

Unitarity: Modern chess irreversible, but reversible chess (each move can be undone) similar to unitarity of QCA.

Summary: Unified Picture of Five-Tuple

QCA five-tuple is most concise mathematical definition of universe:

graph TD
    A["Five-Tuple Axioms"] --> B["Space Λ+Local DOF ℋ_cell"]
    B --> C["Quantum Configuration Space 𝒜"]

    A --> D["Evolution Law α"]
    D --> E["Finite Propagation R"]
    E --> F["Causal Structure Emergence"]

    A --> G["Initial State ω₀"]

    C --> H["Observables"]
    F --> I["Relativistic"]
    G --> J["Universe History"]

    H --> K["Physical Predictions"]
    I --> K
    J --> K

    style A fill:#ffd93d
    style K fill:#6bcf7f

Core Points:

  1. : Determines spatial dimension and topology
  2. : Determines local quantum degrees of freedom (must be finite!)
  3. : Contains all observables
  4. : Encodes physical laws (finite propagation → causality)
  5. : Initial condition of universe

Philosophical Revelation:

These five components completely determine a universe.

No other “hidden variables”, no “background spacetime”.

Universe = QCA, everything emerges from this!

Next Step: Emergence of Causal Structure

Next section will prove: From finite propagation radius of QCA, how to strictly derive causal partial order on event set .

We will see:

  • Geometric relation from definition of
  • Statistical causality from definition of correlation functions
  • Theorem: Two are equivalent

This will reveal: Relativistic causal structure is not assumption, but inevitable result of QCA locality!

This is one of deepest insights of QCA paradigm—causal light cone of continuous spacetime originates from finite propagation of discrete QCA!