Mathematical logic and foundations Proof
Proof that a composition of surjections is surjective
Builds on Surjective functionFunction composition
Proof
We check the definition of surjectivity directly.
- Let and be surjective functions.
- Let . Since is surjective, there is with .
- Since is surjective, there is with .
- By the definition of composition and steps 2 and 3, .
- So each equals for some . Hence is surjective.
Idea
To hit a target , first find a point that sends to . Then find a point that sends to . That is sent to by .
Reading path
To understand this page from the ground up, read these 17 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Codomain definition
- Function composition definition
- Surjective function definition
- Proof that a composition of surjections is surjective proof
Where this leads
106 pages build on this one.
- Stars and bars
- Recurrence for Bell numbers
- Dyck words are counted by Catalan numbers
- K5 and K3,3 are not planar
- Formula for the number of derangements
- Fermat's theorem on sums of two squares
- Dirichlet's approximation theorem
- Sum of two squares theorem
- Number of compositions
- Number of edges of a complete graph
- Composition of surjections is surjective
- Number of functions between finite sets
- Number of k-element subsets
- Generalized pigeonhole principle
- Recurrence for Stirling numbers of the second kind
- Recurrence for Stirling numbers of the first kind
- Number of subsets of a finite set
- Number of permutations
- Primitive root theorem
- A finite integral domain is a field
- Existence of nontrivial solutions of Pell's equation
- A subgroup whose index is the smallest prime divisor of the order is normal
- Inclusion–exclusion principle
- Infinite pigeonhole principle
- Bertrand's ballot theorem
- Multiplicativity of the totient function
- Bijection principle
- Pigeonhole principle
- Solutions of Pell's equation are powers of the fundamental solution
- Kuratowski's theorem
- Sperner's theorem
- Fundamental solution of Pell's equation
- Reduction modulo p test for irreducibility
- Lagrange's four-square theorem
- Cayley's formula
- Closed formula for Catalan numbers
- Z/pZ is a field for p prime
- Theorem on friends and strangers
- Order of the symmetric group
- Recurrence for derangements
- The group of units of Z/pZ is cyclic
- Irreducibility of the cyclotomic polynomials over the rationals
- Erdős–Szekeres theorem
- Order of the alternating group
- Rule of product
- A prime is a Gaussian prime if and only if it is 3 modulo 4
- Number of injections
- Euler's partition theorem
- Gauss–Wantzel theorem
- Binary trees are counted by Catalan numbers
- Proof of the number of edges of a complete graph
- Proof of the primitive root theorem
- Proof of the recurrence for Stirling numbers of the second kind
- Proof of the Erdős–Szekeres theorem by the pigeonhole principle
- Proof of the sum of two squares theorem
- Proof of Sperner's theorem by Lubell's chain counting
- Proof of the number of k-element subsets by induction
- Proof of the formula for the number of derangements by inclusion–exclusion
- Proof of Fermat's theorem on sums of two squares by Thue's lemma
- Proof of Cayley's formula by Prüfer sequences
- Proof that K5 and K3,3 are not planar
- Proof of the order of the symmetric group
- Proof of the order of the alternating group
- Proof of the closed formula for Catalan numbers by the reflection principle
- Proof of the number of subsets of a finite set by indicator functions
- Proof that a finite integral domain is a field
- Dyck language
- Cyclotomic field
- Proof of the rule of product
- Proof of the number of compositions by partial sums
- Proof that a subgroup whose index is the smallest prime divisor of the order is normal
- Proof of the number of functions between finite sets
- Proof that Dyck words are counted by Catalan numbers, by first return decomposition
- Proof of the pigeonhole principle
- Proof of the number of injections
- Coxeter's integral octonions
- Proof that the solutions of Pell's equation are powers of the fundamental solution
- Proof of the existence of nontrivial solutions of Pell's equation by Dirichlet approximation
- Proof of Euler's partition theorem by Glaisher's bijection
- Proof that a prime is a Gaussian prime if and only if it is 3 modulo 4
- Proof of Bertrand's ballot theorem by reflection
- Proof of the recurrence for derangements by the image of the last point
- Proof that the group of units of Z/pZ is cyclic by counting elements of each order
- Proof of Lagrange's four-square theorem by descent
- Proof of the irreducibility of the cyclotomic polynomials by reduction modulo primes
- Kronecker's approximation theorem
- Proof of the multiplicativity of the totient function
- Proof of the inclusion–exclusion principle by counting each element
- Proof of stars and bars by a bijection with subsets
- Proof of the recurrence for Bell numbers by the block of the last element
- Number of functions that avoid a given set of values
- Proof of Dirichlet's approximation theorem by the pigeonhole principle
- Hurwitz quaternions
- Proof of the theorem on friends and strangers
- 24-cell
- Proof of the number of permutations by counting injections
- Chomsky–Schützenberger representation theorem
- Proof of the recurrence for Stirling numbers of the first kind
- No-three-in-line problem
- Proof of the Gauss–Wantzel theorem
- Proof of the bijection principle
- Number of strings of distinct letters
- Proof of the reduction modulo p test for irreducibility
- Proof that binary trees are counted by Catalan numbers
- Inclusion–exclusion formula for elements with none of the properties
- Limiting proportion of derangements
Further reading
About this page
| Tag | EJ4E3PW68H |
|---|---|
| URI | m2://EJ4E3PW68H |
| Kind | proof |
| Writing | W0 stub |
| MSC | 03E20 |
| Proves | Composition of surjections is surjective |
| Uses | Surjective function, Function composition |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.