Documentation

SE.Persistence.Relation.Equivalence

Identity Equivalence #

SE.Persistence.Relation.Equivalence

The identity relation ~_P of a classification: the equivalence relation generated by the steps of preserving transformations.

It depends on a classification only through its preserving set, so forgetting applicability (Classification.coarse) does not change it.

On the free dynamics it is characterized exactly: a transformation's private pair is identity-related precisely when the transformation preserves.

The identity relation ~_P.

Equations
Instances For

    ~_P is an equivalence relation.

    theorem SE.Persistence.Classification.survives_identityRel {T C : Type} {c : Classification T} {d : Dynamics T C} {x y : C} (h : c.Survives d x y) :
    c.identityRel d x y

    Survival implies identity.

    theorem SE.Persistence.Classification.identityRel_mono {T C : Type} {c c' : Classification T} (d : Dynamics T C) (h : ∀ (t : T), c.IsPrs t → c'.IsPrs t) {x y : C} (hg : c.identityRel d x y) :
    c'.identityRel d x y

    A larger preserving set generates a larger identity relation.

    theorem SE.Persistence.Classification.identityRel_eq_of_prs_iff {T C : Type} {c c' : Classification T} (d : Dynamics T C) (h : ∀ (t : T), c.IsPrs t ↔ c'.IsPrs t) :

    Equal preserving sets give equal identity relations on every dynamics.

    theorem SE.Persistence.Classification.identityRel_eq_of_coarse_eq {T C : Type} {c c' : Classification T} (d : Dynamics T C) (h : ∀ (t : T), c.coarse t = c'.coarse t) :

    Classifications with the same coarse matrix have the same identity relation on every dynamics. Forgetting applicability does not change ~_P.

    On the free dynamics, ~_P relates a transformation's private pair exactly when the transformation preserves.