【离散数学】 SEU - 11 - 2021/04/07 - Functions and Cardinality of Sets

最新推荐文章于 2021-06-09 11:26:12 发布

Teddy van Jerry

最新推荐文章于 2021-06-09 11:26:12 发布

阅读量256

点赞数

分类专栏：【离散数学】文章标签：离散数学数学 Mathematics

本文链接：https://blog.csdn.net/weixin_50012998/article/details/115478662

版权

【离散数学】专栏收录该内容

43 篇文章 6 订阅

订阅专栏

Discrete Mathematics and its Applications (8th Edition)
2021/04/07 - Functions and Cardinality of Sets

2 Basic Structures: Sets, Functions, Sequences, Sums, and Matrices

2.3 Functions

2.3.2 One-to-One and Onto Functions

Injection

A function f is said to be one-to-one, or an injection, if and only if $f (a) = f (b)$ implies that $a = b$ for all a and b in the domain of $f$ . A function is said to be injective if it is one-to-one.

Surjection

A function $f$ from $A$ to $B$ is called onto, or a surjection, if and only if for every element $\in B$ there is an element $\in A$ with $f (a) = b$ . A function $f$ is called surjective if it is onto.

Bijection

The function f is a one-to-one correspondence, or a bijection, if it is both one-to-one and onto. We also say that such a function is bijective.

Example: If $f:A\rightarrow A$ is injective, then it mist be surjective, so it is also bijective. True or False? Why?
Solution: If $A$ is a finite set, it is obviously true. However, if it is infinite, then it is false.

To show

Suppose that $\rightarrow B$ .
To show that $f$ is injective: Show that if $f (x) = f (y)$ for arbitrary $\in A$ , then $x = y$ .
To show that $f$ is not injective: Find particular elements $\in A$ such that $\ne y$ and $f (x) = f (y)$ .
To show that $f$ is surjective: Consider an arbitrary element $\in B$ and find an element $\in A$ such that $f (x) = y$ .
To show that $f$ is not surjective: Find a particular $\in B$ such that $\ne y$ for all $\in A$ .

2.3.3 Inverse Functions and Compositions of Functions

Inverse Functions

Let $f$ be a one-to-one correspondence from the set $A$ to the set $B$ . The inverse function of $f$ is the function that assigns to an element $b$ belonging to $B$ the unique element a in $A$ such that $f (a) = b$ . The inverse function of f is denoted by $f^{−1}$ . Hence, $f^{−1}(b) = a$ when $f (a) = b$ .

Compositions of Functions

Let $g$ be a function from the set $A$ to the set $B$ and let $f$ be a function from the set $B$ to the set $C$ . The composition of the functions $f$ and $g$ , denoted for all $\in A$ by $f\circ g$ , is the function from $A$ to $C$ defined by $(f\circ g)(a)=f(g(a))$

2.3.5 Some Important Functions

floor and ceiling function

2.5 Cardinality of Sets

The sets $A$ and $B$ have the same cardinality if and only if there is a one-to-one correspondence from $A$ to $B$ . When $A$ and $B$ have the same cardinality, we write $∣ A ∣ = ∣ B ∣$ .

A set that is either finite or has the same cardinality as the set of positive integers is called countable. A set that is not countable is called uncountable. When an infinite set $S$ is countable, we denote the cardinality of $S$ by $\aleph_0$ (where $\aleph$ is aleph, the first letter of the Hebrew alphabet). We write $\aleph_0$ and say that $S$ has cardinality “aleph null.”