Set Theory and Functions: Definitions and Properties, Exams of Biology

Definitions and explanations of key concepts in set theory and functions, including onto functions, one-to-one functions, direct and inverse images, reflexive, symmetric, and transitive relations, equivalence relations, equivalence classes, congruent modulo n, partitions, binary relations induced by a partition, cardinality, cartesian product, quotient, countable and uncountable sets. It serves as a concise reference for understanding fundamental mathematical principles and their applications. This material is suitable for students studying discrete mathematics or introductory set theory, offering clear definitions and properties essential for problem-solving and theoretical understanding. A useful resource for exam preparation and quick review of core concepts in mathematics, particularly in the areas of set theory and relations.

Typology: Exams

2024/2025

Available from 07/09/2025

tutor-lee-1
tutor-lee-1 🇺🇸

4.3

(3)

11K documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 199 - Final Exam with verified
solutions 2024
Onto Function
F is onto if and only if for all y that is an element Y, there exists an element x
in X such that f(x) = y.
One-to-One Function
A function from the set X to the set Y is one-to-one provided that if f(x1) =
f(x2), then x1 = x2.
Direct Image
Let f: X--> Y and AX. The direct image of A, under f, is the set f(A) = {yY |
there exists aA s.t. f(A) = Y}.
Inverse Image
Let f: X-->Y and VY. The inverse image of V under f is the set: f^-1(V)={aX |
f(a)V}.
Reflexive
R is reflexive if and only if for all aX, aRa
Symmetric
R is symmetric if and only if for all a, bX, if aRb, then bRa.
Transitive
R is transitive if and only if for all a, b, and c that are elements of X, if aRb and
bRc, then aRc.
Equivalence Relation
R is an equivalence relation if and only if R is reflexive, symmetric, and
transitive.
Equivalence Class
pf3

Partial preview of the text

Download Set Theory and Functions: Definitions and Properties and more Exams Biology in PDF only on Docsity!

Math 199 - Final Exam with verified

solutions 2024

Onto Function F is onto if and only if for all y that is an element Y, there exists an element x in X such that f(x) = y. One-to-One Function A function from the set X to the set Y is one-to-one provided that if f(x1) = f(x2), then x1 = x2. Direct Image Let f: X--> Y and A⊆X. The direct image of A, under f, is the set f(A) = {y∈Y | there exists a∈A s.t. f(A) = Y}. Inverse Image Let f: X-->Y and V⊆Y. The inverse image of V under f is the set: f^-1(V)={a∈X | f(a)∈V}. Reflexive R is reflexive if and only if for all a∈X, aRa Symmetric R is symmetric if and only if for all a, b∈X, if aRb, then bRa. Transitive R is transitive if and only if for all a, b, and c that are elements of X, if aRb and bRc, then aRc. Equivalence Relation R is an equivalence relation if and only if R is reflexive, symmetric, and transitive. Equivalence Class

Let ~ be an equivalence relation on set X and a∈X. The equivalence class of a is the set [a] = {x∈X | x ~ a}. Congruent Modulo n Let n be an element of N and x,y be elements of Z. We say that x is congruent to y modulo n. Provided that there exists an element t in Z such that x-y = nt. Partition Let X be a set and P be a subset of the power set of X. Then P is a partition provided that: (1) the empty set is not an element of P, (2) for all elements a in the set X, there exists a set A that is an element of P such that a is an element of A, (3) for all A and B that are elements of P, if A does not equal B, then the intersection of A and B equals the empty set Binary Relation Induced by a Partition Let X be a set and P be a partition of X. The binary relation induced by P is the subset ~p of X cross X given by: ~p = {(x,y) thats an element of X cross X | there exists an A that is an element of the partition such that x is an element of A and y is an element of A} Cardinality Let A and B be sets. We say A and B have the same cardinality provided that there exists a bijection f: A-->B Cartesian Product Let A and B be sets. The Cartesian product of A and B is A cross B = {(x,y) | x is an element of A and y is an element of B} Quotient Let ~ be an equivalence relation on X. The quotient of X by ~ is the set X/~ = {[a] | a is an element of X} Countable A set is countable iff it is finite or countably infinite - if its elements can be liters in an infinite sequence with possible repetitions Infinitely Countable