Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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.

A family with infinitely many objects of size 2 is not a combinatorial class

Counterexample

Let A:={a0,a1,a2,} and define aj:=2 for every jN. Then the level A2 is infinite, so A is not a combinatorial class.

Facts & Assumptions

Given: A combinatorial class is required to have finite size-n levels for every n (Combinatorial classes, counting sequences and ordinary generating functions).

Verification

technique · direct
1.1

The size-2 level of the displayed family is A2={a0,a1,a2,}, which is infinite.

given
2.1

This violates the defining finiteness condition on levels, so the family is not a combinatorial class.

step 1.1given

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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.