For a nilpotent group, the nilpotency class (or nilpotent class) is the smallest positive integer c such that the (c+1)-st term of the lower central series is trivial, equivalently the least c for which all iterated commutators of length c+1 vanish.

Principle

Measure how many successive layers of commutators are required to reach the trivial subgroup; the class quantifies the group's 'distance' from being abelian (class 1) by counting nontrivial commutator depths.

Demonstration

The discrete Heisenberg group (upper-triangular 3×3 integer matrices with ones on the diagonal) has nilpotency class 2 because commutators lie in the center and further commutators vanish; p-groups of class c provide explicit finite examples where iterated commutators of weight c+1 are trivial.

Misapplication

Confusing nilpotency class with derived length or solvability length — a small class does not directly imply a particular derived series length — or applying the class notion to non-nilpotent groups where the lower central series never reaches the trivial subgroup.

Consequence

Knowing the nilpotency class yields structural consequences: nontrivial center, polynomial-like behaviour of commutators, constraints on lower central series and central series, and simplifications in representations and cohomology computations.

Reversal

Inverting the concept focuses on groups with infinite nilpotency class (non-nilpotent): instead of a finite step to triviality one studies persistent commutator complexity, which characterizes groups with richer non-abelian structure and no finite nilpotent stratification.

Boundary

Defined only for nilpotent groups where a finite class exists; for groups that are not nilpotent the class is conventionally infinite; analogous notions exist for Lie algebras and filtered objects but require appropriate commutator or bracket interpretations.

Semantic Tension

Tension appears between nilpotency class and solvability derived length: both measure non-abelianness by iterated operations but use different series (lower central vs derived), so they can give qualitatively different hierarchies for the same group.

Synthesis

Nilpotency class encapsulates how many layers of iterated commutators are needed to annihilate a group's non-abelian behavior: it is the minimal integer c with trivial (c+1)-st lower central term, providing a discrete stratification from abelian (class 1) upward and guiding structural and cohomological analysis.