Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (gpt-5.6-terra)audited 2026-08-27
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.

Labelled classes, labelled product, and the constructions SEQ, SET, CYC, and boxed product

Definition

A labelled class A assigns to each finite label set L a finite set A[L] of A-structures carried by L, together with transport along bijections of label sets. Write

an:=A[[n]],

so the exponential generating function of A is A(x)=n0anxn/n!.

If A and B are labelled classes, their labelled product AB on a label set L consists of triples (S,α,β) where SL, αA[S], and βB[LS]. Thus the labels are split into two disjoint parts, one carrying the A-object and the other the B-object.

For a labelled class A:

  • SEQ(A) is the class of finite ordered lists of pairwise disjoint A-objects whose label sets partition the ambient label set;
  • SET(A) is the class of finite unordered sets of pairwise disjoint A-objects whose label sets partition the ambient label set;
  • CYC(A) is the class of finite cyclic arrangements of pairwise disjoint A-objects whose label sets partition the ambient label set; and
  • the boxed product AB is the subclass of AB in which the smallest label belongs to the A-part.

All four constructions keep the source convention that labels are distinct and their union is the ambient finite label set.

As with the ordinary sequence construction, these formal labelled constructions need not define labelled classes in the finiteness sense when A[] is nonempty. The translation theorem below therefore imposes the zero-constant-coefficient hypothesis exactly where it is needed.

Depends on

Used by

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.

Sources