Equivalence Relations

Def: R ⊆ S x S is an equivalence
relation
Reflexive

Symmetric

Transitive
 R between strings of {a,b,c} which
length is between 3 and 5
X R y and Y R z => X R Z
XRY=
X[0] = Y[0] and x[1]=y[1] and x[2]=y[2] 1. X R Y hypothesis
2. Y R X hypothesis
3. X[0] = Y[0] and x[1]=y[1] and x[2]=y[2] def R (1)
4. Y[0] = Z[0] and Y[1]=Z[1] and Y[2]=yZ[2] def R (2)
Reflexive: X RY 5. X[0] = Y[0] Simp (3)
6. Y[0] = Z[0] Simp (4)
XRX ≡ X[0] = X[0] and x[1]=X[1] and x[2]=x[2] def R 7. X[0]=Z[0] Transitivity = (5,6)
true and true and true identity 8. X[1] = Y[1] Simp (3)
true identity and 9. Y[1] = Z[1] Simp (4)
Symmetric x Ry => y Rx 10. X[1]=Z[1] Transitivity = (8,9)
1. X R y hypothesis 11. X[2] = Y[2] Simp (3)
2. X[0] = Y[0] and x[1]=y[1] and x[2]=y[2] def R 12. Y[2] = Z[2] Simp (4)
3. Y[0] = X[0] and Y[1]=X[1] and Y[2]=X[2] = is symmetric 13. X[2]=Z[2] Transitivity = (11,12)
4. Y R X def R (3) 14. z[0] = z[0] and z[1]=z[1] and z[2]=z[2] comp(7,10,13)
15. XR Z def R (14)
Equivalence classes
[abc]R = {abc}∪ {abcx : x ∈ {a,bc}} ∪ {abcxy : x ∈ {a,bc}, y ∈ {a,bc} }
[abb]R = {abb}∪ {abcx : x ∈ {a,bc}} ∪ {abcxy : x ∈ {a,bc}, y ∈ {a,bc} }
 R between natural numbers
xRy ≡ x%3 = y%3 xRx ≡ x%3 = x%3 def R
1. Reflexive xRx ≡ true id
2. Symmetric xRy -> yRx
3. Transitive xRy and yRz-> xRz 1. xRy hyp
1. xRy hypothesis
2. X%3 = Y%3 def R (1)
2. Y Rz hypothesis 3. Y%3 = X%3 symmetry = (2)
3. X%3 = y%3 def R (1)
4. Y%3 = z%3 def R (2) 4. yRx def R (3)
5. X%3 = Z%3 trans = (3,4)
6. xRz def R (5)
Equivalence Classes
[0]R = {x in Nat| x R 0} {0,3,6,9,12,15,18,21…
[1]R = {x in Nat| x R 1} {1,4,7,10,13,16,19,22…
[2]R = {x in Nat| x R 2} {2,5,8,11,14,17,20,23
[0]R∪ [1]R ∪[2]R = nat
[x]R∩ [y]R =∅ if x≠y
R ⊆ Z+ x Z +
∃s∈nat ∃t∈ nat(0 < s < a and a = t b + s)
∃s∈nat ∃t∈ nat(0 < s < a and a = t a + s)

Irreflexive we have to show not aRa

Not ∃s∈nat ∃t∈ nat(0 < s < a and a = t a + s)

a = ta+s
a-ta =s
a(1-t) = s
We have to show, we cannot find t and s.

Since s>=0 then t cannot be > 1 because (1-t) < 0 and a*(1-t) would be negative an s is not negative
So, t would have to be 1 or 0
If its 1 then a*0 =s 0=s which contradicts s>0
If its 0 then a(1-0) =s, a=s, which contradicts s<a
Therefore, we cannot find s and t
R ⊆ Z + x Z+
∃s∈nat ∃t∈ nat(0 < s < a and a = tb + s)
Asymmetric
aRb -> not bRa
1. aRb hypothesis
2. ∃s∈nat ∃t∈ nat(0 < s < a and a = tb + s) deff R (1)
3. 0 < s<a and a =tb+s existential instantiation
4. 0<s1<b and and b=t1a+s1 assume there are s1 and t2
5. 0<s1<b and and b=t1(tb+s)+s1 arith (4)
6. 0<s1<b and and b=t1tb+st1+s1 arith (5)
7. 0 <s1 <b and b - t1tb = st1+s1 arith(7)
8. 0 <s1 <b and b (1- t 1t) = st1+s1 arith (4)

This is impossible t1*t would have to be <= 1 for if it we > ` the left had side would be negative
If t1*t is equal to 1 its because t1=1 and t=1
b * 0 = s+s1 . This is impossible

T1*t = 0 this happens if t1=0 or t=0

 Sim ⊆ℙ*(ℤ)x ℙ*(ℤ)
S Sim T ≡ S∩T≠∅
Reflexive?
S∩S≠∅?
∅ ∩ ∅= ∅
S∩S = S IDEMP
!= ∅
S ∩S != ∅
Therefore not (∅ sim ∅)
Symmetric ?
S Sim T -> T sim S
S sim T ≡ S∩T≠∅ (def)
≡ T∩S≠∅ ∩- commutativity
≡ T sim S
Sim ⊆ℙ(ℤ)x ℙ(ℤ)
S Sim T ≡ S∩T≠∅
Transitive?
S Sim T and T Sim V -> S Sim V?
S = {1,2,3}
T= {2,3,4,5}
V={4,5,6,7}
R ⊆People x People
A R B A is B’S cousin?
????
A R B and B R C -> A R C???
R⊆ZxZ
xRy ≡ ∃s( (y-x)=5*s)
12 R 2 (2-12)=5*-2
5 R 15 (15-5) = 5*2
Reflexive: xRx
(x-x)=5*s
1. (x-x)=5*0 arithemetic
2. ∃s( (x-x)=5*s) ∃ generalization (1)
3 X R X def R (2)
R⊆ZxZ
xRy ≡ ∃s( (y-x)=5*s)
12 R 2 (2-12)=5*-2
5 R 15 (15-5) = 5*2
Symmetric: xRy -> yRx
1. xRy hypothesis
2. ∃s( (y-x)=5*s) def R (1)
3. y-x = 5*s ∃ inst (2)
4. x-y = 5*(-s) multiply by -1
5. ∃s( (x-y)=5*s) ∃ generalization (4)
6. yRx def R (5)
R⊆ZxZ
xRy ≡ ∃s( (y-x)=5*s)
12 R 22 and 22 R 17 -> 12 R 17
Transitive: xRy ∧ y R z-> xRz
1. xRy hypothesis
2. ∃s( (y-x)=5*s) def R (1)
3. y-x = 5*s ∃ inst (2)
4. yRz hypothesisxRy hypothesis
5. ∃s( (z-y)=5*s) def R (1)
6. y-x = 5*s inst (2)
7. z-y = 5*t ∃ inst (2)
8. (y-x)+(z-y)= 5*s+5*t add(3,6)
9. z-x = 5*(s+t) arithmetic (7)
10. ∃k( (z-x)=5*k) ∃ -generaization (9)
11. X R z def R (10)
Partial Order
f

Reflexive, transitive, antisymmetruc

x ≤x
x ≤ y ∧ y ≤ x -> x=y
x ≤ y ∧ y ≤ z -> x ≤ z
Reflexivity
X ≤ Y = ∃a (a≥0 ∧ X+a=Y)
X≤X
1. 0≥0 ∧ X+0=X ARTHMETIC
2. ∃a (a≥0 ∧ X+a=X) ∃-generalization (1)
3. X≤X def ≤ (2)
Antisymmetric
1. X≤ Y
2. Y≤ X
3. ∃a (a≥0 ∧ X+a=Y) def (1)
4. ∃a (a≥0 ∧ Y+a= X) def (2)
5. a ≥0 ∧ X+a=Y ∃-instantiation (3)
6. b ≥0 ∧ Y+b=X ∃-instantiation (4)
7. a ≥0 simp (5)
8. b ≥0 simp (6)
9. X+a=Y simp (5)
10. Y+b=X simp (6)
11. Y+b+a = Y replace (10.9)
12. b+a= 0 arithmetic 11
13. b=0 ∧ a=0 (12,7,8)
14. B=0 simp (13)
15. Y+0 – X
16. Y=X
Transitive X≤Y ∧ Y≤Z -> X≤Z
1. X≤ Y
2. Y≤ Z
3. ∃a (a≥0 ∧ X+a=Y) def (1)
4. ∃a (a≥0 ∧ Y+a= Z) def (2)
5. a ≥0 ∧ X+a=Y ∃-instantiation (3)
6. b ≥0 ∧ Y+b=Z ∃-instantiation (4)
7. a ≥0 simp (5)
8. b ≥0 simp (6)
9. X+a=Y simp (5)
10. Y+b=Z simp (6)
11. X+a+b = Z replace (9.10)
12. b+a≥0 arithmetic (7,8)
13. b+a≥0 ∧ X+a+b = Z comp (11,12)
14. ∃a (a≥0 ∧ X+a=Z) ∃-generalization (13)
15. X ≤ Z def (14)
Partial Order
f

Reflexive, transitive, antisymmetruc

S ⊆S
S ⊆ T ∧ T ⊆ S -> S=T
S ⊆ T ∧ T ⊆ W -> S⊆ W
Reflexiva: S ⊆S ≡ true

S ⊆S ≡ x ∈ S -> x ∈ S def ⊆
≡ true P->P ≡ true
Antisimétrico: S ⊆T ∧ T ⊆S -> T=S
true
S ⊆T ∧ T ⊆S ≡ T =S def =
Transitivo: S ⊆T ∧ T ⊆W -> S ⊆W
1. S ⊆T hipotesis
2. T ⊆W hipótesis
3. ∀x(x ∈ S -> x ∈T) def ⊆ (1)
4. ∀x(x ∈ T -> x ∈W) def ⊆ (2)
5. ∀x(x ∈ S -> x ∈W) Transitivity (3,4)
6. S ⊆W def ⊆ (5)
R ⊆ℤ x ℤ
X R Y si Existe z talque X = z * Y
10 R 5
5R5
20 R 40
Esta relación es reflexiva?
X R X?
X R X si existe un z tal que X = z * X?
Es simétrica?
XRY -> YRX ?
3R9
9 R 3?

3 R3 y 3R3
X R Y y Y R X -> X=Y
???
-4 R 4 4 R -4
pero -4 != 4
TRansitiva
1. X R Y hipotesis
2. Y R Z hipotesis
3. ∃w(X = w*Y) def R (1)
4. ∃w(Y = w*Z)def R (2)
5. X = w Y inst ∃ (3)
6. Y = u Z inst ∃ (4)
7. X = w u Z reemplazo (6,5)
8. ∃w(X = w*Z) generalizacion ∃ (7) w es un entero.