Alphabeta Math
CorollaryStatement: AI-generatedProof: AI-generatedprecheck passaudited 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.

Infinite Ramsey holds for every set equipped with an injection from N

Statement

Let X be a set equipped with an injection j:N→X. For every positive k, every finite colouring of [X]k has an infinite monochromatic subset contained in j[N]. The terms injection, equinumerous and monochromatic are those of Injection, surjection, bijection, Equinumerous sets, A≈B and A⪯B and Finite colourings of k-element subsets, monochromatic sets, and the arrow notations N→(s,t)2 and N→(r)ck.

Facts & Assumptions

Given: An injection j:N→X and a finite colouring c:[X]k→C.

[L1]

Every finite colouring of [N]k has an infinite monochromatic set, in ZF (Infinite Ramsey theorem on N: every finite colouring of [N]k has an infinite monochromatic set, in ZF).

[F1]

f is injective (one-to-one) if f(x)=f(y) implies x=y (Injection, surjection, bijection).

Proof

technique · direct
1.1

Define a colouring of [N]k by A↦c(j[A]). Injectivity in [F1] makes j[A] a k-element set, so [L1] gives an infinite homogeneous H⊆N.

L1F1
2.1

By [F1], the restriction j∣H is a bijection from H to j[H], so j[H] is infinite. The pullback definition shows every k-subset of j[H] has the same c-colour.

step 1.1F1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.