# Hilbert Book Model Project/Relational Structures

HansVanLeunen respectfully asks that people use the discussion page, their talk page or email them, rather than contribute to this page at this time. This page might be under construction, controversial, used currently as part of a brick and mortar class by a teacher, or document an ongoing research project. Please RESPECT their wishes by not editing this page.

# Relational structures

Relational structures are sets that restrict the types of their internal relations. Mathematics applies "lattice" as the type name of a category of relational structures.

### Lattices

A lattice is a set of elements ${\displaystyle a,b,c,....}$ that is closed for the connections ${\displaystyle \cap }$ and ${\displaystyle \cup }$.

These connections obey

• The set is partially ordered.
• This means that with each pair of elements ${\displaystyle a,b}$ belongs an element ${\displaystyle c}$, such that ${\displaystyle a\subset c}$ and ${\displaystyle b\subset c}$.
• The set is a ${\displaystyle \cap }$ half lattice.
• This means that with each pair of elements ${\displaystyle a,b}$ an element ${\displaystyle c}$ exists, such that ${\displaystyle c=a\cap b}$.
• The set is a ${\displaystyle \cup }$ half lattice.
• This means that with each pair of elements ${\displaystyle a,b}$ an element ${\displaystyle c}$ exists, such that ${\displaystyle c=a\cup b}$.
• The set is a lattice.
• This means that the set is both a ${\displaystyle \cap }$ half lattice and a ${\displaystyle \cup }$ half lattice.

The following relations hold in a lattice

${\displaystyle a\cap b=b\cap a}$

(1)

${\displaystyle (a\cap b)\cap c=a\cap (b\cap c)}$

(2)

${\displaystyle a\cap (a\cup b)=a}$

(3)

${\displaystyle a\cup b=b\cup a}$

(4)

${\displaystyle (a\cup b)\cup c=a\cup (b\cup c)}$

(5)

${\displaystyle a\cup (a\cap b)=a}$

(6)

The lattice has a partial order inclusion ${\displaystyle \subset }$:

${\displaystyle a\subset b\Leftrightarrow a\cap b=a}$

(7)

A complementary lattice contains two elements ${\displaystyle n}$ and ${\displaystyle e}$ with each element ${\displaystyle a}$ a complementary element ${\displaystyle a^{'}}$ such that:

${\displaystyle a\cap a^{'}=n}$

(8)

${\displaystyle a\cap n=n}$

(9)

${\displaystyle a\cap e=a}$

(10)

${\displaystyle a\cup a^{'}=e}$

(11)

${\displaystyle a\cup e=e}$

(12)

${\displaystyle a\cup n=a}$

(13)

An orthocomplemented lattice contains two elements ${\displaystyle n}$ and ${\displaystyle e}$ and with each element ${\displaystyle a}$ an element ${\displaystyle a^{''}}$ such that:

${\displaystyle a\cup a^{''}=e}$

(14)

${\displaystyle a\cap a^{''}=n}$

(15)

${\displaystyle (a^{''})^{''}=a}$

(16)

${\displaystyle a\subset b\Leftrightarrow b^{''}\subset a^{''}}$

(17)

${\displaystyle e}$ is the unity element; ${\displaystyle n}$ is the null element of the lattice

A distributive lattice supports the distributive laws:

${\displaystyle a\cap (b\cup c)=(a\cap b)\cup (a\cap c)}$

(18)

${\displaystyle a\cup (b\cap c)=(a\cup b)\cap (a\cup c)}$

(19)

A modular lattice supports:

${\displaystyle (a\cap b)\cup (a\cap c)=a\cap (b\cup (a\cap c))}$

(20)

A weak modular lattice supports instead:

There exists an element ${\displaystyle d}$ such that

${\displaystyle a\subset c\Leftrightarrow (a\cup b)\cap c=a\cup (b\cap c)\cup (d\cap c)}$

(21)

where ${\displaystyle d}$ obeys:

${\displaystyle (a\cup b)\cap d=d}$

(22)

${\displaystyle a\cap d=n}$

(23)

${\displaystyle b\cap d=n}$

(24)

${\displaystyle (a\subset g)}$ and ${\displaystyle (b\subset g)\Leftrightarrow d\subset g}$

(25)

In an atomic lattice holds

${\displaystyle \exists _{(p\epsilon S)}\forall _{(x\in L)}\{x\subset p\Rightarrow x=n\}}$

(26)

${\displaystyle \forall _{(a\in L)}\forall _{(x\in L)}\{(a or ${\displaystyle x=a\cap p)\}}$

(27)

p is an atom

### Well known lattices

Classical logic has the structure of an orthocomplemented distributive modular and atomic lattice.

Quantum logic has the structure of an orthocomplemented weakly modular and atomic lattice. It is also called an orthomodular lattice.

Both lattices are atomic lattices.A complete set of atoms spans the complete lattice.

The orthomodular lattice finds a realization in the set of closed subspaces of a separable Hilbert space. The lattice structure of this set is isomorphic to the orthomodular lattice.

The set of rays that are spanned by the members of an orthonormal base of the Hilbert space form a full set of atoms of the orthomodular lattice.

#### The modular configuration lattice

The set of closed subspaces of the Hilbert space is an orthomodular lattice. The underlying vector space contains a set of rays, which each represent an elementary module, These rays span a subspace whose closed subspaces represent a modular configuration lattice. The atoms of this lattice represent elementary modules.

All modules own a private mechanism that provides the locations of the elementary modules that the module contains. The mechanism applies a stochastic process that owns a characteristic function. This characteristic function equals the superposition of the characteristic functions of the processes that supply the locations for the individual elementarymodules that constitute the module.

In the Hilbert space, some of the rays in the scanning subspace represent the elementary modules. These rays are mutually orthogonal. At each instant, a private mechanism provides elementary modules with a new location.

In the creator's view tubes that zigzag with the progression value, contain the locations of a corresponding elementary module.