Documentation

SE.Individuation.Structural.Commitments

Persistence Connection: Successful Presentations #

SE.Individuation.Structural.Commitments

At a setting, the carrier is the subtype of successful presentations. With

this module proves, using Persistence's commitment calculus:

Hypotheses used: nonemptiness of successful supports, and the same-or-distinct dichotomy (for uniqueness and for unequal implies disjoint). The coincidence of D with the separated pairs depends on exclusivity through the dichotomy.

This is a soundness construction and establishes mathematical correctness only. One criterion determines both P and D, so consistency does not independently validate the criterion against practice.

Persistence's calculus is stated for carriers in Type, so this module specializes atoms and presentations to universe 0.

def SE.Individuation.Structural.Setting.samePairs {A Presentation : Type} (s : Setting A Presentation) :
{ p : Presentation // s.Succeeds p } → { p : Presentation // s.Succeeds p } → Prop

Same-unit judgments on successful presentations.

Equations
Instances For
    def SE.Individuation.Structural.Setting.distinctPairs {A Presentation : Type} (s : Setting A Presentation) :
    { p : Presentation // s.Succeeds p } → { p : Presentation // s.Succeeds p } → Prop

    Distinct-unit judgments on successful presentations.

    Equations
    Instances For
      def SE.Individuation.Structural.Setting.supportEquality {A Presentation : Type} (s : Setting A Presentation) :
      { p : Presentation // s.Succeeds p } → { p : Presentation // s.Succeeds p } → Prop

      Support equality on successful presentations.

      Equations
      Instances For
        def SE.Individuation.Structural.Setting.supportObservation {A Presentation : Type} (s : Setting A Presentation) :
        { p : Presentation // s.Succeeds p } → MathlibMini.Set A

        The support observation map on successful presentations.

        Equations
        Instances For

          Equality of support is an equivalence relation.

          Support equality is Persistence-admissible for same-unit and distinct-unit judgments.

          The same-unit and distinct-unit commitments are consistent.

          theorem SE.Individuation.Structural.Setting.supportEquality_unique {A Presentation : Type} (s : Setting A Presentation) {E : { p : Presentation // s.Succeeds p } → { p : Presentation // s.Succeeds p } → Prop} (hE : Persistence.Admissible s.samePairs s.distinctPairs E) (x y : { p : Presentation // s.Succeeds p }) :
          E x y ↔ s.supportEquality x y

          Support equality is the only admissible relation. Uses the same-or-distinct dichotomy.

          theorem SE.Individuation.Structural.Setting.no_undetermined {A Presentation : Type} (s : Setting A Presentation) (x y : { p : Presentation // s.Succeeds p }) :

          No pair of successful presentations is undetermined under these exact commitments.

          theorem SE.Individuation.Structural.Setting.distinctPairs_iff_separated {A Presentation : Type} (s : Setting A Presentation) (x y : { p : Presentation // s.Succeeds p }) :

          The distinct-unit commitments coincide with the pairs separated by the support observation map.