Blog Archive

Monday, June 26, 2023

Lattice and Boolean Algebra over vector space (1)

Consider a vector space V, all the subspaces of V with ⊆ can be a lattice, denoted as LV

Observe that A∩B is the greatest lower bound, and A+B is the least upper bound.

Remark. A+B:={a+b|a∈A,b∈B}

And we have

A⊆B iff A+B=B, A⊆B iff A∩B=A

Thus the absorb law holds. A∩(A+B)=A,A+(A∩B)=A

And easy to check that for ∩,+, close, associative law, and commutative law holds

0 is the infLV, V is the supLV, and 0∩A=0,V+A=V

Thus LV is a Lattice.

And if we consider an inner product space (V,⟨−,−⟩) and the lattice LV

We can define orthogonal complement as complement or duality

Because

†.0⊥=V,V⊥=0,A∩A⊥=0,A+A⊥=V

†.A⊆B⇔A⊥⊇B⊥

†.(A⊥)⊥=A

Thus we have De Morgen Law

(A∩B)⊥=A⊥+B⊥

(A+B)⊥=A⊥∩B⊥

Because ⊥:(LV,⊆)→(LV,⊇) is a partial order isomorphism

And partial order isomorphism preserves the greatest lower bound and least upper bound

In general, for ′ have a≤b⇔a′≥b′,(a′)′=a, We will have De Morgan Law

(a∨≤b)′=a′∨≥b′=a′∧≤b′...

But the distributive law does not hold; therefore it can not be a Boolean Algebra.

But, if we consider the standard orthogonal basis of (V,⟨−,−⟩)

S={e1,e2,e3,...,en−1,en},

We know that (P(S),∪,∩,∅,S,c) is an Boolean Algebra,

And Span:P(S)↪LV is a Boolean homomorphism

That is the imSpan⊆LV is a Boolean Algebra

Span(A∩B)=Span(A)∩Span(B)

Span(A∪B)=Span(A)+Span(B)

Span(∅)=0 (Recall another definition of Span(S):= ⋂S⊆ViVi )

Span(S)=V

Span(Ac)=A⊥

Then we can define Boolean Ring over imSpan

AΔB=(A+B)∩(A∩B)⊥

Another interesting thing is, in Ab, we have the second isomorphism theorem

HK/H≅K/H∩K

This shows an interesting property of the glb and lub

If we consider in VectF, then we will have dim⁡(H+K)−dim⁡H=dim⁡K−dim⁡(H∩K)

That is, dim⁡(H+K)+dim⁡(H∩K)=dim⁡H+dim⁡K

 

1 comment:

Popular Posts