A map on C ∪ {x}, with x not in C, is the same as a map on C together with a value at x; and the injections into D taking the value b at x correspond, by restriction, to the injections from C into D without b.
In the setting of Finite Combinatorics: Notation, let , and be sets and a set with , and put .
Maps. The map
is a bijection.
Injections. For every , restriction to ,
is a bijection.
Loading…
No relations recorded yet.