Set Theory/Review

Need help creating math symbols?

Definitions

Subset

A \subseteq B

  • \{x \mid x\in A \hbox{  then  } x\in B \}

Subset means for all x, if x is in A then x is also in B.

↑Jump back a section

Cartesian Product

A \times B

  • A \times B = \{ x \mid x = \langle a, b \rangle \hbox{ for some } a \in A \hbox{ and some } b \in B \}

or

  •  \{ \langle a, b \rangle \mid a \in A \hbox{ and } b \in B \}
↑Jump back a section

Relation

A set of ordered pairs

Domain

\{x \mid \hbox{ for some } y, \langle x, y \rangle \in R\}

Range

\{y \mid \hbox{ for some } x, \langle x, y \rangle \in R\}

Field

\hbox{dom(} R\hbox{)} \cup \hbox{ran(}R\hbox{)}

↑Jump back a section

Equivalence Relations

  • Reflexive: A binary relation R on A is reflexive iff for all a in A, <a, a> in R
  • Symmetric: A rel R is symmetric iff for all a, b if <a, b> in R then R
  • Transitive: A relation R is transitive iff for all a, b, and c if <a, b> in R and in R then <a, c> in R
↑Jump back a section

Partial Ordering

  • Transitive and,
  • Irreflexive: for all a, <a, a> not in R

Trichotomy

Exactly one of the following holds

  • x < y
  • x = y
  • y < x

Proof Strategies

If, then

Prove if x then y

Suppose x
...
...
so, y
↑Jump back a section

If and only If

Prove x iff y

suppose x
...
...
so, y
suppose y
...
...
so, x
↑Jump back a section

Equality

Prove x = y

show x subset y
and
show y subset x
↑Jump back a section

Non-Equality

Prove x != y

x = {has p}
y = {has p}
a in x, but a not in y
↑Jump back a section
Last modified on 2 May 2009, at 15:48