composition (function composition)
let
define
Define proposition, parameter
- injective := . Notation
- surjective := . Notation
- bijective := injective and surjective. Notation . At this time, there exists an inverse mapping
cardinal
_(tag)
- . or there exists a bijection
- . or there exists an injection
- . or there exists a surjection
-
Symmetry of injection and surjection
or there exists a surjection <==> there exists an injection
cardinal-always-comparable
_(tag) Trichotomy of element number order or order is always #link(<order-comparable>)[comparable]
finite
_(tag) := . also let
finite <==>
is a finite set ==> ( is injective or surjective <==> is bijective)
Example is an infinite set, is injective and not surjective, so not bijective
- countably infinite :=
-
uncountable
_(tag) uncountable := -
countable
_(tag) countable := i.e. finite or countably infinite
Operations that preserve countability. let , is countable. The following sets are countable
- union: ,
- product: ,
range
_(tag) . alias image of , ,
codomain
_(tag) . alias range ๅผๅ
let
image
_(tag) Image like
let
inverse-image
_(tag) Inverse image
==>
Inverse image maintains , e.g.
Image only maintains , for others
cardinal-increase
_(tag) (cf. #link(<cardinal>)[]
)
is not surjective <==>
find so that
to always have a element in set that not in set , we can define
Partition . Directly or according to the inverse image of the image set of the mapping ,
quotient
_(tag) quotient := or