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.

Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type

Definition

Let XX be a finite set and let σSym(X)\sigma\in\operatorname{Sym}(X), with cycle notation and composition as in The symmetric group Sym(X)\operatorname{Sym}(X): the bijections of a set XX under composition.

The support and fixed-point set of σ\sigma are

supp(σ):={xX:σ(x)x},Fix(σ):={xX:σ(x)=x}.\operatorname{supp}(\sigma):=\{x\in X:\sigma(x)\ne x\},\qquad \operatorname{Fix}(\sigma):=\{x\in X:\sigma(x)=x\}.

A cycle (a0a1ak1)(a_0\,a_1\,\ldots\,a_{k-1}) has length kk and support {a0,,ak1}\{a_0,\ldots,a_{k-1}\}. Two cycles are disjoint when their supports are disjoint. A disjoint-cycle decomposition of σ\sigma is an expression for σ\sigma as a product of pairwise disjoint cycles of length at least 22. One-cycles are omitted, and the empty product is the identity permutation.

When X=n|X|=n, the cycle type of σ\sigma is the list of natural numbers c1(σ),,cn(σ)c_1(\sigma),\ldots,c_n(\sigma), where ck(σ)c_k(\sigma) is the number of kk-element orbits of the action generated by σ\sigma. Thus c1(σ)c_1(\sigma) is the number of fixed points. Equivalently, the cycle type records the lengths of all cycles after each fixed point is inserted as a one-cycle.

Depends on

Used by

Dependency tree · next 3 levels

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