Weak Commutativity Condition (WCC)
- The Weak Commutativity Condition (WCC) is a group construction imposing only diagonal commutator relations between a group and its isomorphic copy, preserving key structural properties.
- It leverages subgroups like L(H), D(H), and R(H) to analyze and retain polycyclic, nilpotent, and finite characteristics in algebraic frameworks.
- WCC integrates with non-abelian tensor squares and crossed modules, extending its impact on homological invariants and computational group theory.
The Weak Commutativity Condition (WCC) delineates a spectrum of algebraic and categorical constructions where certain minimal or diagonal commutator relations are enforced, as opposed to global commutativity. The paradigm is typified by the construction of the weak-commutativity group associated to a group and an isomorphic copy , requiring only that each commutes with in the ambient group , not across all pairs of elements. This condition has deep ramifications for group theory, homological algebra, Lie theory, and computational group theory.
1. Fundamental Definition and Construction
Let be a group and let be an isomorphism onto a second copy. The weak commutativity group is defined as
with . The only mixed relations enforced are that each commutes with its image . No further commutations are imposed between arbitrary elements of and . The construction is motivated by the desire to analyze the effect of minimal commutator constraints and to investigate the class of groups and functorial constructions preserved under such "diagonal" commutativity.
The operator preserves certain established properties:
- Finite implies finite
- Soluble of derived length gives of derived length at most
- Finitely generated nilpotent of class yields nilpotent of class at most $2c$
Key normal subgroups are utilized:
- , with and
- , with ,
These subgroups commute, and further extension analytic diagrams involving and play a role in structural analysis.
2. Preservation of Polycyclic and Polycyclic-by-Finite Structure
The principal theorem establishes:
- If is polycyclic, then is polycyclic
- If is polycyclic-by-finite, then is polycyclic-by-finite
The proof consists of several structural steps:
- Identification and analysis of subgroups , , , and , showing , , , and is abelian.
- Construction of an explicit epimorphism , where and is finitely generated for polycyclic-by-finite .
- Application of the Schur–Huppert theorem ensuring that extensions of polycyclic-by-finite groups by finitely generated abelian central subgroups remain polycyclic-by-finite; thus, is in the class, and so is .
| Property of | Corresponding Property of |
|---|---|
| polycyclic | polycyclic |
| polycyclic-by-finite | polycyclic-by-finite |
This result robustifies the preservation paradigm for with respect to polycyclic classes, adding to the already-known retention of finiteness, solubility, and nilpotency.
3. Connections to Non-Abelian Tensor Squares and Crossed Modules
The construction of facilitates new results for related functorial group constructions:
- The Brown–Loday non-abelian tensor square is defined by explicit generators and relations
- Rocco's crossed-product group
- The subgroup is isomorphic to
- There is a quotient map with kernel
The consequence is that if is polycyclic-by-finite, so are and , extending prior results for purely polycyclic to these broader classes.
4. Subgroup and Homological Structure
The subgroup landscape for is intricate:
- , , , form a lattice of normal subgroups
- The quotient is abelian and, for polycyclic-by-finite , finitely generated (as is )
- These subgroups relate to classic homological invariants, such as the Schur multiplier, and underpin the extension structure , with appropriately determined by and
This architecture enables the transference of structure theorems dependent upon the preservation of finiteness or polynomial-type constraints in group cohomology, crucial for understanding non-abelian tensor products and the construction of central extensions.
5. Implications for Computational and Algorithmic Group Theory
The construction's compatibility with polycyclic and polycyclic-by-finite groups is significant for computational group theory:
- Polycyclic-by-finite groups admit effective polycyclic presentations with concrete algorithmic descriptions for group operations.
- Implementations (e.g., in GAP) can thus manipulate presentations of and when is polycyclic, enabling effective computation of relations, normal subgroups, and extension data.
- The preservation of finiteness and polycyclic-by-finite structure ensures that various algorithmic procedures, including those for isomorphism, membership, and coset enumeration, remain feasible in the weakly commuting context.
6. Broader Significance and Research Directions
The weak commutativity operator can be viewed as a universal diagonal embedding of into an enlargement enforcing only the minimal commutation relations for all . The identification of conditions under which , , and their various extensions remain in preferred group-theoretic classes (finite, solvable, nilpotent, polycyclic-by-finite) influences the paper of
- The interplay between group presentations, homological invariants (Schur multipliers), and crossed extensions
- The generalization of functorial constructions in the context of group cohomology and non-abelian homological algebra
- The explicit computational realization of non-abelian tensor squares and their applications in representation theory and related fields
The results in this context complete the “preservation under weak commutativity” paradigm by adding polycyclic and polycyclic-by-finite properties to the list, consolidating the status of and associated constructions as computationally tractable and structurally robust for polycyclic inputs (Lima et al., 2014).
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days free