The complete Boolean closure #
The elements of a complete Boolean algebra generated from a set X by complements and arbitrary
suprema, defined inductively like MeasurableSpace.GenerateMeasurable, which is the countable
version. BooleanSubalgebra.closure is the finitary version, and the two agree on a finite
set.
In a power set the closure has a pointwise description: p is generated by X exactly when
membership in p is a function of the pattern of membership in
X.
GenerateCompleteBoolean X x: the element x is generated from X by complements and
arbitrary suprema.
- basic {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {x : B} (hx : x ∈ X) : GenerateCompleteBoolean X x
- compl {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {x : B} (hx : GenerateCompleteBoolean X x) : GenerateCompleteBoolean X xᶜ
- sSup {B : Type u_1} [CompleteBooleanAlgebra B] {X S : Set B} (hS : ∀ x ∈ S, GenerateCompleteBoolean X x) : GenerateCompleteBoolean X (sSup S)
Instances For
The closure lies in every set containing X that is closed under complements and arbitrary
suprema.
The complete closure of a finite set is the finitary one, being finite. Only the forward direction needs the set to be finite.
Power sets #
Functions into a power set are the power set of the product.
Equations
- One or more equations did not get rendered due to their size.
Instances For
In a power set the complete Boolean closure of X consists of the sets membership in which is
a function of the pattern of membership in X. It is stated for an algebra isomorphic to a power
set, so as to apply to curried functions.