uni-atlas (zh)

Function

[!note] Definition Given sets XX and YY, a function from XX to YY is a subset of X×YX \times Y which contains exactly one ordered pair (x,y)(x, y) for each x∈Xx \in X

domR={x∣x∈A,∃y∈B,(x,y)∈R}\text{dom}R = \{x|x \in A, \exists y \in B, (x, y) \in R\} imR=rangeR={y∣y∈B,∃x∈A,(x,y)∈R}\text{im}R = \text{range}R = \{y|y \in B, \exists x \in A, (x, y) \in R\} fldR=domR∪ranR\text{fld}R = \text{dom}R \cup \text{ran}R

[!tip] Mappings Injective: one to one Surjective: onto OR correspondence Bijective: Injective + Surjective

[!question] Function Composition 定义: 如果有两个函数 f:x→yf: x \to y 和 g:Y→Zg:Y \to Z,它们的复合函数记作 g∘fg \circ f ,是从 XX 到 ZZ 的一个新函数 。 If ff and gg are injective, then function composition g∘fg \circ f is also injective. If ff and gg are surjective, then function composition g∘fg \circ f is also surjective.

Inverse Functions

a) Identity Function

Definition: For any set XX, its identity function ιX\iota_X (or idXid_X) is a function from XX to XX, defined as ιX(x)=x\iota_X(x) = x. It’s a “do-nothing” function: what you put in is what you get out.

b) Definition of an Inverse Function

Definition: The inverse of a function f:X→Yf:X \to Y (if it exists) is a function g:Y→Xg:Y \to X that satisfies the following two conditions:

  1. g∘f=ιXg \circ f = \iota_X (i.e., g(f(x))=xg(f(x)) = x for all x∈Xx \in X).
  2. f∘g=ιYf \circ g = \iota_Y (i.e., f(g(y))=yf(g(y)) = y for all y∈Yy \in Y).

Notation: The inverse of ff is usually denoted as f−1f^{-1}. Tips: The inverse function is bijective.

c) Condition for the Existence of an Inverse

Most Important Conclusion: A function f:X→Yf:X \to Y has an inverse if and only if ff is ==bijective== (one-to-one and onto).

References