Documentation

Linglib.Core.Order.GenerateCompleteBoolean

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.

inductive GenerateCompleteBoolean {B : Type u_1} [CompleteBooleanAlgebra B] (X : Set B) :
B → Prop

GenerateCompleteBoolean X x: the element x is generated from X by complements and arbitrary suprema.

Instances For
    theorem GenerateCompleteBoolean.iSup {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {ι : Sort u_2} {f : ι → B} (hf : ∀ (i : ι), GenerateCompleteBoolean X (f i)) :
    GenerateCompleteBoolean X (⨆ (i : ι), f i)
    theorem GenerateCompleteBoolean.iInf {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {ι : Sort u_2} {f : ι → B} (hf : ∀ (i : ι), GenerateCompleteBoolean X (f i)) :
    GenerateCompleteBoolean X (⨅ (i : ι), f i)
    theorem GenerateCompleteBoolean.sup {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {x y : B} (hx : GenerateCompleteBoolean X x) (hy : GenerateCompleteBoolean X y) :
    theorem GenerateCompleteBoolean.inf {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {x y : B} (hx : GenerateCompleteBoolean X x) (hy : GenerateCompleteBoolean X y) :
    theorem GenerateCompleteBoolean.mem_of_closed {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {x : B} {C : Set B} (hc : ∀ x ∈ C, xᶜ ∈ C) (hs : ∀ S ⊆ C, sSup S ∈ C) (hX : X ⊆ C) (h : GenerateCompleteBoolean X x) :
    x ∈ C

    The closure lies in every set containing X that is closed under complements and arbitrary suprema.

    theorem generateCompleteBoolean_iff_mem_closure {B : Type u_1} [CompleteBooleanAlgebra B] {X : Set B} {x : B} (hX : X.Finite) :
    GenerateCompleteBoolean X x ↔ x ∈ BooleanSubalgebra.closure X

    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 #

    def Set.curryOrderIso (X : Type u_2) (Y : Type u_3) :
    (X → Set Y) ≃o Set (X × Y)

    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
      theorem generateCompleteBoolean_iff_factorsThrough {B : Type u_1} [CompleteBooleanAlgebra B] {W : Type u_2} {X : Set B} {d : B} (e : B ≃o Set W) :
      GenerateCompleteBoolean X d ↔ Function.FactorsThrough (fun (x : W) => x ∈ e d) fun (w : W) (x : ↑X) => w ∈ e ↑x

      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.