Documentation

Cslib.Foundations.RelationAlgebra.Representation

Representable relation algebras #

One of the primary notions of interest in the study of relation algebras is the notion of representation by a relation algebra of concrete relations.

Recall Stone's representation for Boolean algebras which (at a low level of generality) states that every Boolean algebra has an isomorphism into a particuliar "field of sets". Tarski's hope was that an analogous property would hold for abstract relation algebras, with the isomorphism desired being into a relation algebra of concrete relations. This turns out to be false, with the clasification and conditions for the representation of a relation algebra thus being a matter of much interest.

Relations over a type α. This definition exists because we need to prevent some instances from from Mathlib being included.

Equations
Instances For
    @[instance_reducible]
    Equations
    • One or more equations did not get rendered due to their size.
    @[instance_reducible]
    Equations
    @[instance_reducible]
    Equations
    @[instance_reducible]
    Equations
    • One or more equations did not get rendered due to their size.
    structure Cslib.RelationAlgebra.Representation (α : Type u) [RelationAlgebra α] (ι : Type v) (β : ι → Type w) :
    Type (max (max u v) w)

    A representation of a relation algebra is an injective morphism into a product of relations.

    Instances For

      A relation algebra is representable if a Representation exists.

      Equations
      Instances For