Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-11
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.

Finite colourings of kk-element subsets, monochromatic sets, and the arrow notations N(s,t)2N\to(s,t)^2 and N(r)ckN\to(r)^k_c

Definition

For a set XX and a positive natural number kk, write [X]k[X]^k for the set of all kk-element subsets of XX, where finite cardinality is understood as in The cardinality A\lvert A\rvert of a finite set. A cc-colouring of [X]k[X]^k is a function d:[X]kCd:[X]^k\to C into a set CC with cc elements. A set HXH\subseteq X is monochromatic when dd is constant on [H]k[H]^k. These notions are unchanged when XX is replaced by an equinumerous set (Equinumerous sets, ABA \approx B and ABA \preceq B).

For positive naturals N,s,tN,s,t, the asymmetric arrow

N(s,t)2N\to(s,t)^2

means that every red-blue colouring of the pairs from any NN-element set has either a red ss-element set or a blue tt-element set. Equivalently, the red pairs form a complete graph on some ss vertices or the blue pairs form a complete graph on some tt vertices. Thus a red-blue colouring witnesses N(s,t)2N\to(s,t)^2 when it contains a red ss-set or a blue tt-set.

For positive naturals N,r,k,cN,r,k,c, the uniform arrow

N(r)ckN\to(r)^k_c

means that every cc-colouring of the kk-element subsets of an NN-element set has a monochromatic rr-element set. Natural-number parameters use The natural numbers N\mathbb{N} (von Neumann); in particular, all four parameters in this notation are explicitly positive.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 30 results over 14 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