Welcome guest
You're not logged in.
280 users online, thereof 0 logged in

Set-theoretic Prerequisites Needed For Combinatorics

In this part, we will recap some basic results from set theory, which are necessary to really understand combinatorics. First of all, please check if you are already acquainted with the following results:

These basics are important for combinatorics because almost all combinatorial results can be derived from them.

| | | | created: 2014-02-21 08:02:00 | modified: 2019-09-07 12:33:46 | by: bookofproofs

1.Definition: Indicator (Characteristic) Function, Carrier

2.Explanation: Connection Between the Power Set and Functions Mapping Sets into a Set with Two Elements

3.Proposition: Fundamental Counting Principle

4.Explanation: Connection Between the Cartesian Product and Functions Mapping Finite Sets into a Non-empty Set

5.Explanation: Indicator Function and Complete Induction

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:


Bibliography (further reading)