Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)verified 2026-07-26 (claude-opus-5)
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, ABA \approx B and ABA \preceq B

Definition

Let AA and BB be sets (Injection, surjection, bijection for the terminology).

  • AA and BB are equinumerous, written ABA \approx B, if there exists a bijection f:ABf : A \to B.
  • AA is dominated by BB, written ABA \preceq B, if there exists an injection f:ABf : A \to B.
  • ABA \prec B abbreviates: ABA \preceq B and not ABA \approx B.

Remarks

  • \approx behaves like an equivalence relation. It is reflexive (idA\mathrm{id}_A 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 \approx 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.

  • \preceq is reflexive and transitive, for the same reasons, and ABA \approx B implies both ABA \preceq B and BAB \preceq A. The converse, that ABA \preceq B and BAB \preceq A together give ABA \approx B, is a theorem and not a triviality: it is The Schröder-Bernstein theorem, and it is proved without any use of choice.

  • Subsets. ABA \subseteq B implies ABA \preceq B, since the inclusion map is injective. The reverse fails badly for infinite sets: the successor map σ\sigma is a bijection NN{0}\mathbb{N} \to \mathbb{N} \setminus \{0\}, 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 NN{0}\mathbb{N} \approx \mathbb{N} \setminus \{0\} and a proper subset can be equinumerous with the whole.

  • \approx is the library's substitute for "has the same number of elements", stated without introducing cardinal numbers. Everything on this page is phrased with \approx, \preceq and \prec alone, so no theory of cardinals is presupposed.

Depends on

Used by

…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