TheoremBase

Counting: Intervals, Empty Sets and Singletons, Injective Images, Subsets, Unions and Products

The interval {m,...,n} has (n+1)−m elements; only the empty set has no elements and a singleton has one; injective maps preserve the number of elements and arbitrary maps do not increase it; a proper subset has fewer elements; the numbers of elements of a union and an intersection add up to those of the two sets; and a product has the product number of elements.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let finite sets be as in Finite Sets §finite, #\# as in The Number of Elements of a Finite Set §cardinality, and intervals and [n][n] as in Intervals of Natural Numbers §interval and Intervals of Natural Numbers §segment. Intervals, ∅\emptyset and singletons are finite, and so are subsets, unions, products and images of finite sets, by Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice §naturals, Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice §small, Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice §subset, Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice §union and Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice §image. Let AA and BB be finite sets and m,n∈N0m,n\in\mathbb{N}_{0}.

#[n]=n\#[n]=n, and if m≤n+1m\le n+1, then #{m,…,n}=(n+1)−m\#\{m,\dots,n\}=(n+1)-m, the difference in N0\mathbb{N}_{0}.

#A=0\#A=0 if and only if A=∅A=\emptyset, and #{x}=1\#\{x\}=1 for every set xx.

For every map f:A→Cf:A\to C to a set CC, #f(A)≤#A\#f(A)\le\#A, with equality if ff is injective.

If B⊆AB\subseteq A, then #B≤#A\#B\le\#A, and #B=#A\#B=\#A only if B=AB=A.

#(A∪B)+#(A∩B)=#A+#B\#(A\cup B)+\#(A\cap B)=\#A+\#B; in particular #(A∪B)=#A+#B\#(A\cup B)=\#A+\#B if AA and BB are disjoint.

#(A×B)=#A⋅#B\#(A\times B)=\#A\cdot\#B.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…