1
Suppose that
Describe each of the following sets.
(a) (b)
📚 The CoCalc Library - books, templates and other resources
Important: to view this notebook properly you will need to execute the cell above, which assumes you have an Internet connection. It should already be selected, or place your cursor anywhere above to select. Then press the "Run" button in the menu bar above (the right-pointing arrowhead), or press Shift-Enter on your keyboard.
ParseError: KaTeX parse error: \newcommand{\lt} attempting to redefine \lt; use \renewcommand
Suppose that
Describe each of the following sets.
(a) (b)
If and list all of the elements in each of the following sets.
(a) (d)
Find an example of two nonempty sets and for which is true.
Prove and
Prove and
Prove
If then either or Thus, and Hence, Therefore, Conversely, if then and Thus, or is in both and So and therefore Hence,
Prove
Prove if and only if
Prove
Prove
Prove
Prove
Prove
Prove
Prove
Prove
Which of the following relations define a mapping? In each case, supply a reason why is or is not a mapping.
(a) Not a map since is undefined; (b) this is a map; (c) not a map, since but (d) this is a map.
Determine which of the following functions are one-to-one and which are onto. If the function is not onto, determine its range.
defined by
defined by
defined by
defined by
(a) is one-to-one but not onto. (c) is neither one-to-one nor onto.
Let and be invertible mappings; that is, mappings such that and exist. Show that
Define a function that is one-to-one but not onto.
Define a function that is onto but not one-to-one.
(a)
Prove the relation defined on by if is an equivalence relation.
Let and be maps.
If and are both one-to-one functions, show that is one-to-one.
If is onto, show that is onto.
If is one-to-one, show that is one-to-one.
If is one-to-one and is onto, show that is one-to-one.
If is onto and is one-to-one, show that is onto.
(a) Let Then Thus, and so is one-to-one. (b) Let then for some Since is onto.
Define a function on the real numbers by
What are the domain and range of What is the inverse of Compute and
Let be a map with and
Prove
Prove Give an example in which equality fails.
Prove where
Prove
Prove
(a) Let Then there exists an such that Hence, or Therefore, Consequently, Conversely, if then or Hence, there exists an in or such that Thus, there exists an such that Therefore, and
Determine whether or not the following relations are equivalence relations on the given set. If the relation is an equivalence relation, describe the partition given by it. If the relation is not an equivalence relation, state why it fails to be one.
in if
in if
in if
in if
(a) The relation fails to be symmetric. (b) The relation is not reflexive, since 0 is not equivalent to itself. (c) The relation is not transitive.
Define a relation on by stating that if and only if Show that is reflexive and transitive but not symmetric.
Show that an matrix gives rise to a well-defined map from to
Find the error in the following argument by providing a counterexample. “The reflexive property is redundant in the axioms for an equivalence relation. If then by the symmetric property. Using the transitive property, we can deduce that ”
Let and define if
Define a relation on by letting if there exists a nonzero real number such that Prove that defines an equivalence relation on What are the corresponding equivalence classes? This equivalence relation defines the projective line, denoted by which is very important in geometry.