Professional Documents
Culture Documents
Discrete Maths Theorem Sheet PDF-1
Discrete Maths Theorem Sheet PDF-1
Science
Theorem Sheet
0 ≡ associative* [(X ≡ (Y ≡ Z)) ≡ ((X ≡ Y) ≡ Z)]
1 ≡ symmetric* [X ≡ Y ≡ Y ≡ X ]
2 ≡ identity* [X ≡ true ≡ X ]
3 ≡ reflexive [X ≡ X ]
4 true [true]
5 ∨ symmetric* [X ∨ Y ≡ Y ∨ X ]
6 ∨ associative* [X ∨ (Y ∨ Z) ≡ (X ∨ Y) ∨ Z ]
7 ∨ idempotent* [X ∨ X ≡ X ]
8 ∨/≡* [X ∨ (Y ≡ Z) ≡ X ∨ Y ≡ X ∨ Z ]
9 ∨/∨ [X ∨ (Y ∨ Z) ≡ (X ∨ Y) ∨ (X ∨ Z)]
10 ∨ zero [X ∨ true ≡ true]
11 Golden Rule* [X ∧ Y ≡ X ≡ Y ≡ X ∨ Y ]
12 ∧ symmetric [X ∧ Y ≡ Y ∧ X ]
13 ∧ associative [X ∧ (Y ∧ Z) ≡ (X ∧ Y) ∧ Z ]
14 ∧ idempotent [X ∧ X ≡ X ]
15 ∧ identity [X ∧ true ≡ X ]
16 absorption.0 [X ∧ (X ∨ Y) ≡ X ]
17 absorption.1 [X ∨ (X ∧ Y) ≡ X ]
18 ∨/∧ [X ∨ (Y ∧ Z) ≡ (X ∨ Y) ∧ (X ∨ Z)]
19 ∧/∨ [X ∧ (Y ∨ Z) ≡ (X ∧ Y) ∨ (X ∧ Z)]
20 ∧ over ≡ [X ∧ (Y ≡ Z) ≡ X ∧ Y ≡ X ∧ Z ≡ X ]
21 ∧/≡≡ [X ∧ (Y ≡ Z ≡ W) ≡ X ∧ Y ≡ X ∧ Z ≡ X ∧ W ]
22 strong MP [X ∧ (X ≡ Y) ≡ X ∧ Y ]
23 replacement [(X ≡ Y) ∧ (W ≡ X) ≡ (X ≡ Y) ∧ (W ≡ Y)]
24 ⇒ definition* [X ⇒ Y ≡ X ∨ Y ≡ Y ]
25 ⇒ reflexive [X ⇒ X ]
26 ⇒ true [X ⇒ true]
27 ⇒∨ [X ⇒ X ∨ Y ]
28 ∧⇒ [X ∧ Y ⇒ X ]
29 shunting [X ∧ Y ⇒ Z ≡ X ⇒ (Y ⇒ Z)]
30 ⇒ to ∧≡ [X ⇒ Y ≡ X ∧ Y ≡ X ]
31 ⇒ over ≡ [X ⇒ (Y ≡ Z) ≡ X ∧ Y ≡ X ∧ Z ]
32 ⇐ definition* [X ⇐ Y ≡ X ∧ Y ≡ Y ]
33 ⇐⇒ [X ⇐ Y ≡ Y ⇒ X ]
- (1) ⎣ x ⎦ ≤ x
- (2) n ≤ ⎣ n ⎦
- (3) ⎣ n ⎦ ≤ n
- (4) n = ⎣ n ⎦
- (5) ⎣ x ⎦ < n ≡ x < n
- (6) x < ⎣ x ⎦ + 1
- (7) ⎣ x ⎦ ≤ x ∧ x < ⎣ x ⎦ + 1
- (8) ⎣ x ⎦ ≤ ⎣ y ⎦ ⇐ x ≤ y
- (9) ⎣ x ⎦ = n ≡ n ≤ x ∧ x < n + 1
- (10) ⎣ x ⎦ = n ≡ x – 1 < n ∧ n ≤ x
- (11) ⎣ x + n ⎦ = ⎣ x ⎦ + n
- (13) x ≤ ⎡ x ⎤
- (14) ⎡ n ⎤ ≤ n
- (15) n ≤ ⎡ n ⎤
- (16) n = ⎡ n ⎤
- (17) n < ⎡ x ⎤ ≡ n < x
- (18) ⎡ x ⎤ - 1 < x
- (19) ⎡ x ⎤ - 1 < x ∧ x ≤ ⎡ x ⎤
- (20) ⎡ x ⎤ ≤ ⎡ y ⎤ ⇐ x ≤ y
- (21) ⎡ x ⎤ = n ≡ n -1 < x ∧ x ≤ n
- (22) ⎡ x ⎤ = n ≡ x ≤ n ∧ n < x + 1
- (23) ⎡ x + n⎤ = ⎡ x ⎤ + n
Lattice Theory
* (0) 〈∀ x : : x ⊑ x 〉
- (1) 〈∀ x,y : : x ⊑ y ∧ y ⊑ x ⇐ x = y 〉
* (2) 〈∀ x,y : : x ⊑ y ∧ y ⊑ x ⇒ x = y 〉
- (3) 〈∀ x,y : : x ⊑ y ∧ y ⊑ x ≡ x = y 〉
- (4) 〈∀ z : : z ⊑ x ⇒ z ⊑ y 〉 ⇒ x ⊑ y
- (5) 〈∀ z : : y ⊑ z ⇒ x ⊑ z 〉 ⇒ x ⊑ y
- (6) 〈∀ z : : z ⊑ x ≡ z ⊑ y 〉 ⇒ x = y
- (7) 〈∀ z : : x ⊑ z ≡ y ⊑ z 〉 ⇒ x = y
- (8) 〈∀ z : : w ⊑ z ≡ x ⊑ z ∧ y ⊑ z 〉
- (9) 〈∀ x,y : : 〈∃ w : : 〈∀ z : : w ⊑ z ≡ x ⊑ z ∧ y ⊑ z 〉〉〉
We introduce this unique w as a function of x, y writing it as ↑ , pronounced “up”.
* (10) x ↑ y ⊑ z ≡ x ⊑ z ∧ y ⊑ z
- (11) x ↑ x
- (12) x ↑ y = y ↑ x
- (13) (x ↑ y) ↑ z = x ↑ ( y ↑ z )
- (14) x ⊑ x ↑ y ∧ y ⊑ x ↑ y
- (15) x ↑ y ⊑ y ≡ x ⊑ y
- (16) x ↑ y = y ≡ x ⊑ y
- (17) x ⊑ y ∧ y ⊑ z ⇒ x ⊑ z
- (18) x ↑ ( y ↑ z ) = (x ↑ y) ↑ ( x ↑ z )
- (19) 〈∀ z : : z ⊑ w ≡ z ⊑ x ∧ z ⊑ y 〉
- (20) 〈∀ x,y : : 〈∃ w : : 〈∀ z : : z ⊑ w ≡ z ⊑ x ∧ z ⊑ y 〉〉〉
We introduce this unique w as a function of x, y writing it as ↓ , pronounced “down”.
* (21) z ⊑ x ↓ y ≡ z ⊑ x ∧ z ⊑ y
- (22) x ↓ x = x
- (23) x ↓ y = y ↓ x
- (24) x ↓ (y ↓ z) = (x ↓ y) ↓ z)
- (25) x ↓ y ⊑ x ∧ x ↓ y ⊑ y
- (26) x ⊑ x ↓ y ≡ x ⊑ y
- (27) x = x ↓ y ≡ x ⊑ y
- (28) x ↓ ( y ↓ z ) = (x ↓ y) ↓ ( x ↓ z )
- (29) x = x ↓ ( x ↑ y )
- (30) x = x ↑ ( x ↓ y )
Max/Min calculus.
In the Max/Min calculus, ↑ is interpreted as the Max operator and ↓ is the Min
operator.
The domain over which these are defined are numbers and we have some additional
postulates and theorems.
* (31) z ≤ x ↓ y ≡ z ≤ x ∧ z ≤ y
- (32) x ↓ y < z ≡ x < z ∨ y < z
* (33) x ↑ y ≤ z ≡ x ≤ z ∧ y ≤ z
- (34) z < x ↑ y ≡ z < x ∨ z < y
- (35) n + (x ↑ y) = (n + x) ↑ (n + y)
- (36) n + (x ↓ y) = (n + x) ↓ (n + y)
- (37) 0 < n ⇒ n * (x ↑ y) = (n * x) ↑ (n * y)
- (38) n < 0 ⇒ n * (x ↑ y) = (n * x) ↓ (n * y)
- (39) 0 < n ⇒ n * (x ↓ y) = (n * x) ↓ (n * y)
- (40) n < 0 ⇒ n * (x ↓ y) = (n * x) ↑ (n * y)
- (41) (x ↑ y) ↓ ( x ↓ y ) = x ↓ y
- (42) (x ↑ y) ↑ ( x ↓ y ) = x ↑ y
- (43) x ↓ ( y ↑ z ) = (x ↓ y) ↑ ( x ↓ z )
- (44) x ↑ ( y ↓ z ) = (x ↑ y) ↓ ( x ↑ z )