def
definition
Indistinguishable
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.RecogGeom.Indistinguishable on GitHub at line 33.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
chartOnQuotient_well_defined -
chart_respects_equiv -
RecognitionChart -
IsOrderCompatible -
order_descends_to_quotient -
composite_comm_indistinguishable -
composite_indistinguishable_iff -
composite_refines_left -
composite_refines_right -
IsRecognitionConnected -
isRecognitionConnected_resolutionCell -
isRecognitionConnected_singleton -
locally_regular_cell_connected -
isSeparating_iff -
separating_quotient_bijective -
convergence_implies_identity -
IsFinerThan' -
monotone_separation_of_refinement -
NonCollapseCondition -
nonCollapse_monotone_automatic -
RefinementConverges -
composition_refines -
diff_magnitude_dist -
discrete_indist_iff_eq -
magnitude_distinguishes_3_5 -
magnitude_indist_3_neg3 -
magnitude_indistinguishable -
neg_indist -
neg_pos_dist -
plus_minus_indist -
sign_distinguishes_3_neg3 -
sign_indist_3_5 -
sign_indistinguishable -
zero_pos_dist -
pillar2_information_monotonicity -
indistinguishable_equivalence -
indistinguishableSetoid -
indistinguishable_status -
mem_resolutionCell_self -
resolutionCell_eq_fiber
formal source
30/-- Two configurations are indistinguishable under a recognizer if they
31 produce the same event. This is the fundamental equivalence relation
32 of recognition geometry. -/
33def Indistinguishable {C E : Type*} (r : Recognizer C E) (c₁ c₂ : C) : Prop :=
34 r.R c₁ = r.R c₂
35
36/-- Notation: c₁ ~[r] c₂ means c₁ and c₂ are indistinguishable under r -/
37notation:50 c₁ " ~[" r "] " c₂ => Indistinguishable r c₁ c₂
38
39/-! ## Equivalence Relation Properties -/
40
41variable {C E : Type*} (r : Recognizer C E)
42
43/-- Indistinguishability is reflexive -/
44theorem Indistinguishable.refl (c : C) : c ~[r] c := rfl
45
46/-- Indistinguishability is symmetric -/
47theorem Indistinguishable.symm' {c₁ c₂ : C} (h : c₁ ~[r] c₂) : c₂ ~[r] c₁ :=
48 Eq.symm h
49
50/-- Indistinguishability is transitive -/
51theorem Indistinguishable.trans {c₁ c₂ c₃ : C}
52 (h₁ : c₁ ~[r] c₂) (h₂ : c₂ ~[r] c₃) : c₁ ~[r] c₃ :=
53 Eq.trans h₁ h₂
54
55/-- Indistinguishability is an equivalence relation -/
56theorem indistinguishable_equivalence : Equivalence (Indistinguishable r) where
57 refl := Indistinguishable.refl r
58 symm := Indistinguishable.symm' r
59 trans := Indistinguishable.trans r
60
61/-- The indistinguishability setoid -/
62def indistinguishableSetoid : Setoid C where
63 r := Indistinguishable r