Chapter 2 - Basic Structures: Sets, Functions, Sequences, Sums, and Matrices Flashcards
Excludes: 2.6 - Matrices
set
a collection of elements
element, a member of a set
an object in a set
roster method
a method that describes a set by listing its elements
set builder notation
the notation that describes a set by stating a property an element must have to be a member
∅ (empty set, null set)
the set with no members
S = T (set equality)
S and T have the same elements
S ⊆ T (S is a subset of T)
every element of D is also an element of T
S ⊂ T (S is a proper subset of T)
S is a subset of T and S ≠ T
A ∪ B (the union of A and B)
the set containing those elements that are in at least one of A and B
A ∩ B (the intersection of A and B)
the set containing those elements that are in both A and B
A — B (the difference of A and B)
the set containing those elements that are in A but not in B
A ⊕ B (the symmetric difference of A and B)
the set containing those elements in exactly one of A and B
function from A to B
an assignment of exactly one element of B to each element of A
domain of ƒ
the set A, where ƒ is a function from A to B
codomain of ƒ
the set B, where ƒ is a function from A to B
empty string
a string of length zero
Universal Statement
True for all elements in the set (for all)
Conditional statement
If one thing is true then some other thing also has to be true (p—>q)
Existential statement
At least one thing is true (or)