complete Heyting algebra


A Heyting algebra that is also a complete latticeMathworldPlanetmath is called a complete Heyting algebra. In the following, we give a latticeMathworldPlanetmath characterizationMathworldPlanetmath of complete Heyting algebras without the relative pseudocomplementation operator →.

Proposition 1.

Let H be a complete Heyting algebra, then

x→y=⋁{z∣z∧x≤y}

for any x,y∈H, and

x∧⋁A=⋁(x∧A),

where x∧A:={x∧y∣y∈A}, for any x∈H, and any subset A of H.

Proof.

We first prove the identityPlanetmathPlanetmath x∧⋁A=⋁(x∧A). For any y∈H, we have x∧⋁A≤y iff ⋁A≤x→y iff a≤x→y for all a∈A iff x∧a≤y for all a∈A iff ⋁(x∧A)≤y, hence x∧⋁A=⋁(x∧A).

Next, we show x→y=⋁{z∣z∧x≤y}. For any a∈H, we have a≤x→y iff a∧x≤y iff a∈{z∣z∧x≤y} iff a≤⋁{z∣z∧x≤y}. ∎

The converseMathworldPlanetmath of the above is also true.

Proposition 2.

Let H be a complete lattice such that

x∧⋁A=⋁(x∧A),

where x∧A:={x∧y∣y∈A}, for any x∈H, and any subset A of H. Then for any x,y∈H, defining

x→y:=⋁{z∣z∧x≤y}

turns H into a complete Heyting algebra.

Proof.

We want to show that a≤x→y iff a∧x≤y for any a∈H: a≤x→y iff a≤⋁{z∣z∧x≤y}. So x∧a≤x∧⋁{z∣z∧x≤y}=⋁{x∧z∣z∧x≤y}≤⋁{y}=y ∎

From this, one readily concludes that any finite distributive latticeMathworldPlanetmath is Heyting.

Remark. Since any complete lattice is bounded, a completePlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath Brouwerian lattice is a complete Heyting algebra. A complete Heyting algebra is also called a frame.

Title complete Heyting algebra
Canonical name CompleteHeytingAlgebra
Date of creation 2013-03-22 19:31:42
Last modified on 2013-03-22 19:31:42
Owner CWoo (3771)
Last modified by CWoo (3771)
Numerical id 10
Author CWoo (3771)
Entry type Definition
Classification msc 03G10
Classification msc 06D20
Related topic Locale