2023-05-12 13:05:31 +00:00
|
|
|
|
import Mathlib.Data.Set.Basic
|
2023-04-11 12:46:59 +00:00
|
|
|
|
|
2023-05-23 21:38:33 +00:00
|
|
|
|
import Common.Logic.Basic
|
|
|
|
|
|
2023-05-12 13:05:31 +00:00
|
|
|
|
/-! # Common.Set.Basic
|
2023-05-04 22:37:54 +00:00
|
|
|
|
|
2023-05-15 14:00:01 +00:00
|
|
|
|
Additional theorems and definitions useful in the context of `Set`s.
|
2023-05-04 22:37:54 +00:00
|
|
|
|
-/
|
|
|
|
|
|
2023-05-12 13:05:31 +00:00
|
|
|
|
namespace Set
|
2023-04-11 12:46:59 +00:00
|
|
|
|
|
2023-05-22 00:32:59 +00:00
|
|
|
|
/-! ## Minkowski Sum -/
|
|
|
|
|
|
2023-05-12 13:05:31 +00:00
|
|
|
|
/-
|
2023-05-22 00:32:59 +00:00
|
|
|
|
The Minkowski sum of two `Set`s `s` and `t` is the set
|
2023-04-11 12:46:59 +00:00
|
|
|
|
`s + t = { a + b : a ∈ s, b ∈ t }`.
|
|
|
|
|
-/
|
2023-05-12 17:08:18 +00:00
|
|
|
|
def minkowskiSum {α : Type u} [Add α] (s t : Set α) :=
|
2023-04-11 12:46:59 +00:00
|
|
|
|
{ x | ∃ a ∈ s, ∃ b ∈ t, x = a + b }
|
|
|
|
|
|
2023-04-13 19:58:38 +00:00
|
|
|
|
/--
|
2023-05-22 00:32:59 +00:00
|
|
|
|
The sum of two `Set`s is nonempty **iff** the summands are nonempty.
|
2023-04-13 19:58:38 +00:00
|
|
|
|
-/
|
2023-05-12 13:05:31 +00:00
|
|
|
|
theorem nonempty_minkowski_sum_iff_nonempty_add_nonempty {α : Type u} [Add α]
|
|
|
|
|
{s t : Set α}
|
2023-05-12 17:08:18 +00:00
|
|
|
|
: (minkowskiSum s t).Nonempty ↔ s.Nonempty ∧ t.Nonempty := by
|
2023-04-13 19:58:38 +00:00
|
|
|
|
apply Iff.intro
|
|
|
|
|
· intro h
|
|
|
|
|
have ⟨x, hx⟩ := h
|
|
|
|
|
have ⟨a, ⟨ha, ⟨b, ⟨hb, _⟩⟩⟩⟩ := hx
|
|
|
|
|
apply And.intro
|
|
|
|
|
· exact ⟨a, ha⟩
|
|
|
|
|
· exact ⟨b, hb⟩
|
|
|
|
|
· intro ⟨⟨a, ha⟩, ⟨b, hb⟩⟩
|
|
|
|
|
exact ⟨a + b, ⟨a, ⟨ha, ⟨b, ⟨hb, rfl⟩⟩⟩⟩⟩
|
|
|
|
|
|
2023-05-22 00:32:59 +00:00
|
|
|
|
/-! ## Characteristic Function -/
|
|
|
|
|
|
2023-05-12 13:05:31 +00:00
|
|
|
|
/--
|
2023-05-22 00:32:59 +00:00
|
|
|
|
The characteristic function of a `Set` `S`.
|
2023-05-12 13:05:31 +00:00
|
|
|
|
|
|
|
|
|
It returns `1` if the specified input belongs to `S` and `0` otherwise.
|
|
|
|
|
-/
|
2023-05-12 19:17:34 +00:00
|
|
|
|
def characteristic (S : Set α) (x : α) [Decidable (x ∈ S)] : Nat :=
|
2023-05-12 13:05:31 +00:00
|
|
|
|
if x ∈ S then 1 else 0
|
|
|
|
|
|
2023-06-07 02:16:06 +00:00
|
|
|
|
/-! ## Equality -/
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
If `{x, y} = {x}` then `x = y`.
|
|
|
|
|
-/
|
|
|
|
|
theorem pair_eq_singleton_mem_imp_eq_self {x y : α}
|
|
|
|
|
(h : {x, y} = ({x} : Set α)) : y = x := by
|
|
|
|
|
rw [Set.ext_iff] at h
|
|
|
|
|
have := h y
|
|
|
|
|
simp at this
|
|
|
|
|
exact this
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
If `{x, y} = {z}` then `x = y = z`.
|
|
|
|
|
-/
|
|
|
|
|
theorem pair_eq_singleton_mem_imp_eq_all {x y z : α}
|
|
|
|
|
(h : {x, y} = ({z} : Set α)) : x = z ∧ y = z := by
|
|
|
|
|
have h' := h
|
|
|
|
|
rw [Set.ext_iff] at h'
|
|
|
|
|
have hz := h' z
|
|
|
|
|
simp at hz
|
|
|
|
|
apply Or.elim hz
|
|
|
|
|
· intro hzx
|
|
|
|
|
rw [← hzx] at h
|
|
|
|
|
have := pair_eq_singleton_mem_imp_eq_self h
|
|
|
|
|
exact ⟨hzx.symm, this⟩
|
|
|
|
|
· intro hzy
|
|
|
|
|
rw [← hzy, Set.pair_comm] at h
|
|
|
|
|
have := pair_eq_singleton_mem_imp_eq_self h
|
|
|
|
|
exact ⟨this, hzy.symm⟩
|
|
|
|
|
|
2023-05-22 00:32:59 +00:00
|
|
|
|
/-! ## Subsets -/
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
Every `Set` is a subset of itself.
|
|
|
|
|
-/
|
|
|
|
|
theorem subset_self (S : Set α) : S ⊆ S := by
|
|
|
|
|
intro _ hs
|
|
|
|
|
exact hs
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
If `Set` `A` is a subset of `Set` `B`, then `A ∪ B = B`.
|
|
|
|
|
-/
|
|
|
|
|
theorem left_subset_union_eq_self {A B : Set α} (h : A ⊆ B)
|
|
|
|
|
: A ∪ B = B := by
|
|
|
|
|
rw [Set.ext_iff]
|
|
|
|
|
intro x
|
|
|
|
|
apply Iff.intro
|
|
|
|
|
· intro hU
|
|
|
|
|
apply Or.elim hU
|
|
|
|
|
· intro hA
|
|
|
|
|
exact h hA
|
|
|
|
|
· simp
|
|
|
|
|
· intro hB
|
|
|
|
|
exact Or.inr hB
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
If `Set` `B` is a subset of `Set` `A`, then `A ∪ B = B`.
|
|
|
|
|
-/
|
|
|
|
|
theorem right_subset_union_eq_self {A B : Set α} (h : B ⊆ A)
|
|
|
|
|
: A ∪ B = A := by
|
|
|
|
|
rw [Set.union_comm]
|
|
|
|
|
exact left_subset_union_eq_self h
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
If `x` and `y` are members of `Set` `A`, it follows `{x, y}` is a subset of `A`.
|
|
|
|
|
-/
|
|
|
|
|
theorem mem_mem_imp_pair_subset {x y : α}
|
|
|
|
|
(hx : x ∈ A) (hy : y ∈ A) : ({x, y} : Set α) ⊆ A := by
|
|
|
|
|
intro a ha
|
|
|
|
|
apply Or.elim ha
|
|
|
|
|
· intro hx'
|
|
|
|
|
rwa [hx']
|
|
|
|
|
· intro hy'
|
|
|
|
|
rwa [hy']
|
|
|
|
|
|
2023-06-04 23:34:42 +00:00
|
|
|
|
/-! ## Powerset -/
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
Every `Set` is a member of its own powerset.
|
|
|
|
|
-/
|
|
|
|
|
theorem self_mem_powerset_self {A : Set α}
|
|
|
|
|
: A ∈ 𝒫 A := subset_self A
|
|
|
|
|
|
2023-05-23 21:38:33 +00:00
|
|
|
|
/-! ## Symmetric Difference -/
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
`x` is a member of the `symmDiff` of `A` and `B` **iff** `x ∈ A ∧ x ∉ B` or
|
|
|
|
|
`x ∉ A ∧ x ∈ B`.
|
|
|
|
|
-/
|
|
|
|
|
theorem mem_symm_diff_iff_exclusive_mem {A B : Set α}
|
|
|
|
|
: x ∈ (A ∆ B) ↔ (x ∈ A ∧ x ∉ B) ∨ (x ∉ A ∧ x ∈ B) := by
|
|
|
|
|
unfold symmDiff
|
|
|
|
|
apply Iff.intro
|
|
|
|
|
· intro hx
|
|
|
|
|
simp at hx
|
|
|
|
|
conv => arg 2; rw [and_comm]
|
|
|
|
|
exact hx
|
|
|
|
|
· intro hx
|
|
|
|
|
simp
|
|
|
|
|
conv => arg 2; rw [and_comm]
|
|
|
|
|
exact hx
|
|
|
|
|
|
|
|
|
|
/--
|
|
|
|
|
`x` is not a member of the `symmDiff` of `A` and `B` **iff** `x ∈ A ∩ B` or
|
|
|
|
|
`x ∉ A ∪ B`.
|
|
|
|
|
|
|
|
|
|
This is the contraposition of `mem_symm_diff_iff_exclusive_mem`.
|
|
|
|
|
-/
|
|
|
|
|
theorem not_mem_symm_diff_inter_or_not_union {A B : Set α}
|
|
|
|
|
: x ∉ (A ∆ B) ↔ (x ∈ A ∩ B) ∨ (x ∉ A ∪ B) := by
|
2023-06-04 23:34:42 +00:00
|
|
|
|
show ¬(x ∈ A ∧ ¬x ∈ B ∨ x ∈ B ∧ ¬x ∈ A) ↔ x ∈ A ∧ x ∈ B ∨ ¬(x ∈ A ∨ x ∈ B)
|
2023-05-23 21:38:33 +00:00
|
|
|
|
rw [
|
|
|
|
|
not_or_de_morgan,
|
|
|
|
|
not_and_de_morgan, not_and_de_morgan,
|
|
|
|
|
not_not, not_not,
|
|
|
|
|
not_or_de_morgan
|
|
|
|
|
]
|
|
|
|
|
apply Iff.intro
|
2023-06-04 23:34:42 +00:00
|
|
|
|
· intro nx
|
|
|
|
|
apply Or.elim nx.left
|
2023-05-23 21:38:33 +00:00
|
|
|
|
· intro nA
|
2023-06-04 23:34:42 +00:00
|
|
|
|
exact Or.elim nx.right (Or.inr ⟨nA, ·⟩) (absurd · nA)
|
2023-05-23 21:38:33 +00:00
|
|
|
|
· intro hB
|
2023-06-04 23:34:42 +00:00
|
|
|
|
exact Or.elim nx.right (absurd hB ·) (Or.inl ⟨·, hB⟩)
|
2023-05-23 21:38:33 +00:00
|
|
|
|
· intro hx
|
|
|
|
|
apply Or.elim hx
|
|
|
|
|
· intro hy
|
|
|
|
|
exact ⟨Or.inr hy.right, Or.inr hy.left⟩
|
|
|
|
|
· intro hy
|
|
|
|
|
exact ⟨Or.inl hy.left, Or.inl hy.right⟩
|
|
|
|
|
|
2023-05-12 13:05:31 +00:00
|
|
|
|
end Set
|