How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Equinumerous sets, and
Definition
Let and be sets (Injection, surjection, bijection for the terminology).
- and are equinumerous, written , if there exists a bijection .
- is dominated by , written , if there exists an injection .
- abbreviates: and not .
Remarks
-
behaves like an equivalence relation. It is reflexive ( is a bijection), symmetric (the inverse of a bijection is a bijection) and transitive (a composition of bijections is a bijection). The careful statement is that these three properties hold for all sets, and that restricted to any set of sets is an equivalence relation on that set. It is not a relation on "the set of all sets", which does not exist; the reflexivity, symmetry and transitivity statements are schemas about arbitrary sets, which is all any argument below uses.
-
is reflexive and transitive, for the same reasons, and implies both and . The converse, that and together give , is a theorem and not a triviality: it is The Schröder-Bernstein theorem, and it is proved without any use of choice.
-
Subsets. implies , since the inclusion map is injective. The reverse fails badly for infinite sets: the successor map is a bijection , being injective and never zero (The von Neumann naturals form a Peano system) and hitting every nonzero natural (Every nonzero natural number is a successor), so and a proper subset can be equinumerous with the whole.
-
is the library's substitute for "has the same number of elements", stated without introducing cardinal numbers. Everything on this page is phrased with , and alone, so no theory of cardinals is presupposed.
Depends on
Used by
- Absorption: for cardinals κ, λ with κ infinite and λ ≤ κ, κ ⊕ λ = κ, and κ ⊗ λ = κ when λ ≠ 0 Corollary
- Assuming the Axiom of Choice: κ < κ^cf(κ) for every infinite cardinal κ, and cf(2^κ) > κ; in particular cf(2^ℵ₀) > ℵ₀ Corollary
- If V has a spanning set with n elements, then every linearly independent subset of V is finite with at most n elements; in particular V has no linearly independent subset equinumerous with ℕ Corollary
- Infinite Ramsey holds for every set equipped with an injection from ℕ Corollary
- lvertP(A)| = 2^| A| for finite A Corollary
- ℚ is F_σ, meager and not G_δ, while the irrationals are G_δ, residual and not F_σ Corollary
- The clauses at 0, at a successor and at a limit determine exactly one operation α ↦ ℵ_α, in ZF, and — assuming the Axiom of Choice — exactly one operation α ↦ ℶ_α; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and α ≤ ℵ_α Corollary
- The irrationals are uncountable Corollary
- 2ℤ has index 2 in ℤ and is nevertheless equinumerous with ℤ Counterexample
- If 1 were admitted as a prime, uniqueness would fail: 6 = 2 · 3 = 1 · 2 · 3 = 1 · 1 · 2 · 3, lists of different lengths that no permutation matches Counterexample
- In the indiscrete topology every sequence converges to every point, and in the cofinite topology on an infinite set an injective sequence converges to every point Counterexample
- Inside the space of eventually zero families, the linear subspace spanned by { eᵢ : i ≥ 1 } is proper and has a basis equinumerous with a basis of the whole space, so "equal dimension forces equality" fails without finite dimension Counterexample
- ℝ is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions Counterexample
- The standard unit families { eᵢ : i ∈ ℕ } are linearly independent in F^ℕ but do not span it: the constant family 1_F is not a finite linear combination of them Counterexample
- Three distinct lines U₀, U₁, U₂ in F² have dim_F(U₀+U₁+U₂) = 2 while the inclusion-exclusion analogue of the dimension formula predicts 3, so the two-subspace formula does not extend Counterexample
- Two sets of the same finite cardinality between which the bijection is not unique Counterexample
- Cardinal sum κ ⊕ λ, product κ ⊗ λ and exponentiation κ^λ, and why they are written apart from the ordinal operations Definition
- Finite colourings of k-element subsets, monochromatic sets, and the arrow notations N→(s,t)² and N→(r)ᵏ_c Definition
- Finite-dimensional vector space, and its dimension dim_F V; infinite-dimensional means having no finite basis Definition
- Finite, countably infinite, countable, uncountable Definition
- First countable space: a countable neighbourhood base at every point Definition
- The cardinality | A| of a finite set Definition
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies Definition
- The multinomial coefficient binomnk₀,…,kₘ₋₁ as the number of ordered partitions of an n-set into blocks of prescribed sizes Definition
- The order |G| of a finite group and the order ord(g) of an element, with ord(g) = ∞ when no positive power of g is the identity Definition
- The set [A]ᵏ of k-element subsets and the binomial coefficient binomnk := | [n]ᵏ| Definition
- The sum ∑_i ∈ S aᵢ over a finite index set, and its product form Definition
- A bounded nondecreasing f : ℝ → ℝ whose set of discontinuities is exactly ℚ, obtained from the prescribed-jump construction applied to one fixed enumeration of the rationals Example
- An ordinal α with ℵ_α = α, built as the supremum of the tower ℵ₀, ℵ_ℵ₀, ℵ_ℵ_ℵ₀, …, and its cofinality is ℵ₀ Example
- Assuming countable choice, a strictly increasing ω-sequence of countable ordinals has a countable supremum, which is a countable limit ordinal below ω₁; the instance supₙ ω·(n+1) = ω² needs no choice Example
- Assuming countable choice, cf(ℵ_ω₁) = ℵ₁, so singular does not mean of countable cofinality Example
- Assuming the Axiom of Choice: ℵ₀^ℵ₀ = 2^ℵ₀ and | ℝ^ℝ | = 2^2^ℵ₀, computed from the exponent laws and Hessenberg Example
- Assuming the Axiom of Choice: ℶ₀ = ℵ₀, ℶ₁ = 2^ℵ₀ = | ℝ |, ℶ₂ = | P(ℝ) |, and ℶ_ω has cofinality ℵ₀ Example
- cf(ℵ_ω) = ℵ₀, computed from the cofinal map n ↦ ℵₙ Example
- For n ≥ 1 the congruence classes modulo n form an abelian group (ℤ/n, +) of order n, generated by the class of 1 Example
- Froda's countable bound is attained: a bounded nondecreasing function on ℝ discontinuous exactly at the points 1 - 1/(k+1) for k ∈ ℕ, an infinite discontinuity set inside a bounded interval Example
- ℚ is covered by open intervals of total length ε, for every ε > 0 Example
- ℝ ≈ P(ℕ) in ZF, by the Cantor set for one injection and by the cuts {q ∈ ℚ : q < x} for the other; so | ℝ | = 2^ℵ₀ under the Axiom of Choice Example
- ℝ as a vector space over ℚ has a basis, and every such basis is infinite; the existence proof exhibits none Example
- Sym({1,2,3}) has exactly six elements, is non-abelian, and its elements have orders 1, 2 and 3 Example
…and 66 more results.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 10 results over 6 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- J. K. Hunter, An Introduction to Real Analysis (standard reference, not scraped)
- J. Lebl, Basic Analysis: Introduction to Real Analysis, basic set theory (standard reference, not scraped)
- Equinumerosity (Wikipedia) (standard reference, not scraped)
- Countable set (Wikipedia) (standard reference, not scraped)