Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Boolean sublattices and prefix chains

Abstract

Finite Boolean sublattices are represented by subsets or by bitmasks.

Definition 1.1 (Nonempty sublattices).

Formalization. D5/S3/Combinatorics/ErdosUlam/SublatticeDefs.IsSublattice (✓ std3).

Source. Repository-derived.

Commentary.

A sublattice is a nonempty finite family closed under union and intersection.

Definition 1.2 (Constant colour).

Formalization. D5/S3/Combinatorics/ErdosUlam/SublatticeDefs.Monochromatic (✓ std3).

Source. Repository-derived.

Commentary.

All members of a monochromatic family have one common Boolean colour.

Theorem 1.3 (Cardinality of a prefix).

Proof. Machine-checked in Lean as D5/S3/Combinatorics/ErdosUlam/SublatticeDefs.prefix_card (✓ std3). ∎

Source. Repository-derived.

Commentary.

The prefix of rank r consists of the first r elements when r is at most n. Prefixes are nested by rank. Bitmask decoding sends bitwise union and intersection to the corresponding subset operations.

References