math / data /lean /OAI /Algebra /Universal /GraphDecidability.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.11 kB
import OAI.Algebra.Universal.GraphCriterion
import Mathlib.Data.Fintype.Powerset
namespace OAI
/-!
# Decidability of fixed-size graph witnesses
Connectivity is characterized by containment in every Boolean equivalence relation containing
the marked edges. On a finite carrier this gives an executable decision procedure, and hence
a decision procedure for the existence of a graph witness at each fixed size. The size of a
witness in `HasGraphWitness` is not bounded by these results.
-/
namespace FiniteCongruence
/-- A Boolean relation is closed if it is an equivalence containing every marked edge. -/
def ClosedMarking {Lat Carrier : Type} [LE Lat] (color : Carrier β†’ Carrier β†’ Lat)
(seeds : Finset (Carrier Γ— Carrier)) (rel : Carrier β†’ Carrier β†’ Bool) : Prop :=
(βˆ€ point, rel point point = true) ∧
(βˆ€ left right, rel left right = true β†’ rel right left = true) ∧
(βˆ€ left middle right, rel left middle = true β†’ rel middle right = true β†’ rel left right = true) ∧
(βˆ€ left right, Marked color seeds left right β†’ rel left right = true)
/-- Connectivity is the intersection of the Boolean equivalence relations containing all
marked edges. This characterization uses classical logic but allows finite enumeration. -/
theorem connected_iff_closedMarkings {Lat Carrier : Type} [LE Lat]
(color : Carrier β†’ Carrier β†’ Lat) (seeds : Finset (Carrier Γ— Carrier)) (left right : Carrier) :
Connected color seeds left right ↔
βˆ€ rel : Carrier β†’ Carrier β†’ Bool, ClosedMarking color seeds rel β†’ rel left right = true := by
constructor
Β· intro connected rel closed
induction connected with
| rel first second marked => exact closed.2.2.2 first second marked
| refl point => exact closed.1 point
| symm first second _ inductionHyp => exact closed.2.1 first second inductionHyp
| trans first middle last _ _ firstHyp secondHyp =>
exact closed.2.2.1 first middle last firstHyp secondHyp
Β· classical
intro contained
let rel : Carrier β†’ Carrier β†’ Bool := fun first second =>
decide (Connected color seeds first second)
have closed : ClosedMarking color seeds rel := by
refine ⟨?_, ?_, ?_, ?_⟩
Β· intro point
exact decide_eq_true (Relation.EqvGen.refl point)
Β· intro first second related
exact decide_eq_true (Relation.EqvGen.symm first second (of_decide_eq_true related))
Β· intro first middle last firstRelated secondRelated
exact decide_eq_true (Relation.EqvGen.trans first middle last
(of_decide_eq_true firstRelated) (of_decide_eq_true secondRelated))
Β· intro first second marked
exact decide_eq_true (Relation.EqvGen.rel first second marked)
exact of_decide_eq_true (contained rel closed)
instance decidableAdmissible {Lat Carrier : Type} [LE Lat] [DecidableLE Lat] [Fintype Carrier]
(color : Carrier β†’ Carrier β†’ Lat) (placement : Carrier β†’ Carrier) :
Decidable (Admissible color placement) :=
inferInstanceAs (Decidable
(βˆ€ left right, color (placement left) (placement right) ≀ color left right))
instance decidableMarked {Lat Carrier : Type} [LE Lat] [DecidableLE Lat]
[Fintype Carrier] [DecidableEq Carrier] (color : Carrier β†’ Carrier β†’ Lat)
(seeds : Finset (Carrier Γ— Carrier)) (left right : Carrier) :
Decidable (Marked color seeds left right) :=
inferInstanceAs (Decidable
(βˆƒ placement : Carrier β†’ Carrier, Admissible color placement ∧
βˆƒ edge ∈ seeds, placement edge.1 = left ∧ placement edge.2 = right))
instance decidableClosedMarking {Lat Carrier : Type} [LE Lat] [DecidableLE Lat]
[Fintype Carrier] [DecidableEq Carrier] (color : Carrier β†’ Carrier β†’ Lat)
(seeds : Finset (Carrier Γ— Carrier)) (rel : Carrier β†’ Carrier β†’ Bool) :
Decidable (ClosedMarking color seeds rel) :=
inferInstanceAs (Decidable
((βˆ€ point, rel point point = true) ∧
(βˆ€ left right, rel left right = true β†’ rel right left = true) ∧
(βˆ€ left middle right, rel left middle = true β†’ rel middle right = true β†’ rel left right = true) ∧
(βˆ€ left right, Marked color seeds left right β†’ rel left right = true)))
instance decidableConnected {Lat Carrier : Type} [LE Lat] [DecidableLE Lat]
[Fintype Carrier] [DecidableEq Carrier] (color : Carrier β†’ Carrier β†’ Lat)
(seeds : Finset (Carrier Γ— Carrier)) (left right : Carrier) :
Decidable (Connected color seeds left right) :=
decidable_of_iff
(βˆ€ rel : Carrier β†’ Carrier β†’ Bool, ClosedMarking color seeds rel β†’ rel left right = true)
(connected_iff_closedMarkings color seeds left right).symm
/-- An executable fixed-size test, with no classical choice in its computational content. -/
def graphWitnessDecidable (Lat Carrier : Type) [Fintype Lat] [Lattice Lat] [OrderBot Lat]
[DecidableEq Lat] [DecidableLE Lat] [Fintype Carrier] [DecidableEq Carrier]
(color : Carrier β†’ Carrier β†’ Lat) : Decidable (IsGraphWitness color) :=
inferInstanceAs (Decidable
((βˆ€ left right, color left right = color right left) ∧
(βˆ€ left right, color left right = βŠ₯ ↔ left = right) ∧
(βˆ€ left right middle, color left right ≀ color left middle βŠ” color middle right) ∧
(βˆ€ lower upper : Lat, Β¬ lower ≀ upper β†’
βˆƒ left right, color left right ≀ lower ∧ Β¬ color left right ≀ upper) ∧
(βˆ€ seeds : Finset (Carrier Γ— Carrier), seeds.Nonempty β†’ βˆ€ left right,
color left right ≀ seeds.sup (fun edge => color edge.1 edge.2) β†’
Connected color seeds left right)))
/-- Existence of a colored-graph witness at a fixed candidate size is decidable. -/
def graphSizeDecidable (Lat : Type) [Fintype Lat] [Lattice Lat] [OrderBot Lat]
[DecidableEq Lat] [DecidableLE Lat] (size : β„•) :
Decidable (0 < size ∧ βˆƒ color : Fin size β†’ Fin size β†’ Lat, IsGraphWitness color) := by
letI : DecidablePred (fun color : Fin size β†’ Fin size β†’ Lat => IsGraphWitness color) :=
graphWitnessDecidable Lat (Fin size)
infer_instance
end FiniteCongruence
end OAI