Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Lower-central generators, residue coordinates and weighted length

Definition

Let G be finitely generated nilpotent with γc+1=1. Choose, in each finitely generated abelian factor γi/γi+1, an ordered cyclic decomposition, and lift its generators to elements uijγi. Infinite cyclic factors use exponents aijZ; a finite cyclic factor of order dij>1 uses aij{0,,dij1}. All factors exist by Finite generation of lower-central factors and Integer abelian structure and rank by finite reduction. Order products by increasing i, then increasing j. Assign uij weight i.

For a normalized tuple a, its integer weighted coordinate length is the least integer R0 such that aijRi on every infinite factor and R1 whenever a residue coordinate is nonzero. The zero tuple has length zero. For real R1 let Q(R) consist of all ordered products with aijRi on infinite factors and every allowed finite residue. The number of infinite coordinates in layer i is ri of Bass–Guivarc’h dimension and nilpotent Hirsch length. Unique parametrization of group elements is justified by Finite lower-central coordinate systems with torsion accounted for .

For any finite labelled alphabet whose weight-i letters represent elements of γi, a word has weighted word counts (N1,,Nc) if it has Ni letters of assigned weight i; inverse letters retain that weight. These are counts before normalization, distinct from coordinate exponents and from the minimal ordinary word length of Word length of a group element with respect to a generating set. Identity letters may be deleted. An lcs generating alphabet means its letters of weights at least i generate γi.

Integral coordinates from a central cyclic refinement and mixed lower-central coordinates are different constructions. Even in a torsion-free group, finite cyclic lower-central factors must keep their residue coordinates. For a group with torsion, use G/T(G) before invoking a torsion-free integral model; keep finite kernel representatives when lifting back.

Source notes

Druţu–Kapovich, Geometric Group Theory (837-page edition), Definitions 14.18–14.19 and Proposition 14.25, printed pp.504–505,510–511. Revised Definitions 14.18–14.19 provide lcs alphabets and weighted word counts. The mixed tuple conventions match Proposition 14.25.

Depends on

Used by

Dependency tree · two levels

18 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