Product centers, charge lattices, and quotient descent
A central quotient is specified by an embedded subgroup, not only by an abstract name such as . In a product group, a central transformation in one factor can be canceled by transformations in the others. Checking each factor separately therefore loses physically relevant global forms.
Open the product gauge-group workbench. This method applies to
with finite-dimensional continuous complex matter representations. The circle has period . This is a compact covering group for the proposed quotient; it is not the universal cover, because the circle already has fundamental group .
1. The input is a character of the full center
Section titled “1. The input is a character of the full center”Write a multiplet as
Here means the one-dimensional circle representation . If the highest weight of the th factor has Dynkin labels , its center charge is
Choose . A central element is represented by
Its action is the scalar operator
The center formula is the type- specialization of the weight/root-lattice description in Conrad’s center notes, pp. 1–2. Tensoring the factor representations multiplies the central phases, giving the displayed sum.
For a finite subgroup ,
It is enough to test a generating set. The implementation additionally evaluates every enumerated element of , checking that the two tests agree.
2. Why the embedding matters
Section titled “2. Why the embedding matters”Consider with matter . The central action of is . The diagonal element acts trivially, while either individual center generator acts nontrivially.
Thus the diagonal quotient is compatible with this multiplet even though quotienting either factor separately is obstructed. In the workbench the diagonal generator has center exponents and zero circle phase. Its coordinates remain in the result and export.
The abstract invariant factors of summarize its group structure. They do not replace these coordinates. Even two subgroups with the same order and invariant factors can define different representation constraints or topology.
3. Computing the entire common central kernel
Section titled “3. Computing the entire common central kernel”The matter-invariant center is
This is a central kernel. It is not necessarily the full kernel of the matter action: if every multiplet is trivial on a nonabelian factor, that entire factor acts trivially, not merely its center. The workbench keeps the stated covering group fixed and reports the central calculation.
If at least one field has nonzero circle charge, choose a row with . For any fixed finite-center tuple , its equation permits precisely circle phases:
Each candidate is tested against every remaining row. Conversely, any element of satisfies the chosen row and therefore appears among these candidates. This proves completeness of the finite search.
A common denominator , where , suffices. Every phase test becomes integer divisibility. There is no floating-point evaluation of roots of unity and no numerical tolerance around one. Choosing a field with minimal nonzero reduces the search without changing the answer.
If all charges vanish, the circle is unconstrained:
where is obtained by checking the finite-center tuples. An empty matter list has this behavior too. The result explicitly marks a one-dimensional kernel; it does not present a finite sample of circle phases as the whole kernel. The finite component reported in this case is the direct factor .
Repeated copies of an existing representation impose the same central constraint. They can nevertheless matter for other physics, including anomalies and coupling multiplicities.
4. Finite abelian structure and quotient selection
Section titled “4. Finite abelian structure and quotient selection”For a finite enumerated subgroup, the engine finds its abstract invariant-factor form
One way to recover these factors is to count the elements annihilated by powers of each prime. If the -primary factors are , then
Successive differences count the factors with . Combining the prime-power factors gives the invariant factors. The implementation checks that their product equals the enumerated order. It also constructs an embedded generating set and verifies that the generators recover the complete kernel.
When is finite and cyclic, its subgroups are uniquely determined by their orders, so the workbench lists every compatible quotient and a generator for its embedding. For a noncyclic or continuous kernel, it instead asks for the actual finite subgroup through its generators. It does not confuse a divisor list with a classification of all embedded subgroups.
The selected is generated independently from the user’s coordinates, whether or not the matter descends. An obstructed choice remains a valid group construction and is reported with the offending fields and their exact phases.
5. The fundamental group: keep the original circle
Section titled “5. The fundamental group: keep the original circle”The universal cover of is
Let be the inverse image of in . Then . The group is discrete abelian and contains the integer winding lattice of the original circle.
Its projection to is an infinite cyclic lattice. Its torsion subgroup is exactly
because a finite-order element in the real covering direction must have coordinate zero. A finitely generated abelian group with this torsion and one free generator is therefore
This is an abstract splitting; the engine does not select a canonical free generator. It reports the invariant factors of and the order of the circle projection of . The underlying covering-space exact sequence is developed in Conrad’s fundamental-group notes, pp. 1–2.
For example,
Both quotient subgroups are abstractly . The first group is ; the second is . Replacing by would be wrong in both cases, because the starting group is not simply connected.
6. Supported domain and reproducibility
Section titled “6. Supported domain and reproducibility”The current exact implementation supports one or two factors with , one compact circle, at most 16 multiplets, Dynkin labels from 0 to 12, and integer charges . At most three generators specify , with circle phases whose input denominators are at most 60. A selected subgroup that would exceed 4,096 elements produces an explicit resource-limit error, without a partial mathematical result.
A nonzero matter charge bounds the common-kernel search by
Exact type- Weyl products determine each factor dimension; the multiplet dimension is their product. The JSON export preserves the factor sizes, complete highest weights, integer charges, embedded generators, exact rational phases, result, sources, and product-su-u1-center-v1 convention.
This calculation establishes group-representation compatibility and the topology of the selected connected group. Magnetic and dyonic line choices, theta data, anomaly cancellation, spacetime structure, symmetry breaking, and vacuum dynamics require further input. For why global form alone need not finish the specification of a quantum gauge theory, see Aharony–Seiberg–Tachikawa, §1.1 and §2.
The Standard Model guide works through a cyclic kernel and its four quotients. The block-branching reference explains how a subgroup embedding determines correlated nonabelian and circle charges.
First public edition · mathematical baseline 6.0.0. Source curation and automated validation are distinct from independent expert review.
About · Contributors · Review status · Suggest a correction · Data and reproducibility · Articles CC BY 4.0 · Code MIT