Symmetry¶
Core Idea¶
(1) Symmetry is invariance under a specified group of transformations: a system is symmetric with respect to an action when applying the action leaves the system unchanged in a specified sense (identical, equivalent, isomorphic, or indistinguishable-for-the-operations-of-interest); the defining commitment is not the loose "looks balanced" but the precise algebraic claim that a stated transformation, applied to the object, yields the same object back. (2) The distinctive focus is on transformation-group invariance as a first-class algebraic object, distinguished from "balance" or "regularity" (visual impressions without a named transformation), from invariance-in-general (see invariance #9; invariance is the preserved property, symmetry is the group that preserves it — the two are reciprocal), from repetition (pattern-copying without the group-theoretic closure under composition), and from the absence of structure (a perfectly symmetric system can be extremely structured — the structure is distributed so it looks the same from many viewpoints). (3) Every symmetry claim therefore specifies (i) the system whose invariance is being claimed, (ii) the transformation (or family of transformations) under which invariance holds, and (iii) the sense in which "unchanged" is meant, with the transformations themselves closing under composition, inversion, and identity to form a group[1]. (4) The deeper abstraction is that the group structure — closure, identity, inverses — is what makes symmetry more than a list of coincidences: once a set of transformations closes as a group, it inherits the full algebraic apparatus of group theory (subgroups, cosets, orbits, quotients, representations), and this apparatus is what generates the characteristic dividends of symmetry reasoning — conservation laws via Noether's theorem[2], geometric classification via Klein's Erlangen program[3], chemical-and-crystalline classification via point-and-space groups, combinatorial enumeration via Burnside-Pólya counting, and the systematic reduction of search spaces in optimization and simulation; the same group-theoretic machinery transfers across every domain in which symmetry appears, which is why symmetry is the load-bearing organizational abstraction of twentieth-century physics, mathematics, and structural chemistry.
How would you explain it like I'm…
Looks the same after changing it
Sameness under a change
Invariance under transformation
Structural Signature¶
The operation presumes (a) an identifiable system whose invariance is being claimed, (b) a specifiable set of transformations acting on the system, and © a reasoning context in which the group-level algebraic properties (not just individual transformations) are the target of inference. A symmetry structure has six defining components:
- A specified system — the invariance target: there is an object, structure, equation, pattern, or configuration whose invariance is being claimed. The system may be physical (a molecule, a crystal, a field configuration), mathematical (an equation, a combinatorial object), or abstract (a data structure, a logical formula).
- A specified transformation (or family) — the action commitment: one or more operations are named — reflection across an axis, rotation by an angle, permutation of elements, translation in space or time, change of coordinates, gauge transformation, relabeling. The naming is load-bearing: without an explicit transformation, "symmetric" is rhetoric.
- Invariance under the transformation — the preservation commitment: applying the transformation maps the system to itself in the relevant sense — same object, same equation, same distribution, same structure up to the equivalence being respected. The sense of "same" must be specified (literal identity, equivalence, isomorphism, indistinguishability).
- Group structure — the algebraic closure commitment: the transformations compose (transformation followed by transformation is itself a transformation of the same kind), include an identity (doing nothing), and include inverses (undo each transformation). This closure under composition is what makes symmetries more than a list — they form an algebra, and the algebra is what licenses transfer.
- Domain of the transformation — the scope commitment: the transformations act on a specified underlying domain (space, coordinates, components, time, the elements of a set). The domain bounds the claim; a symmetry on a restricted domain is a different symmetry from the same operation on an extended domain.
- Discrete or continuous character — the group-topology commitment: symmetry groups can be finite and discrete (reflections, rotations by 60°, permutations of N items) or continuous (rotations by any angle, translations by any vector, gauge transformations). The continuous case admits Lie-group machinery[4] and is the setting for Noether's theorem; the discrete case is the setting for Galois theory and crystallography.
Structural distinctions include: the group's size (finite vs infinite); the group's topology (discrete vs continuous / Lie); the symmetry's exactness (exact vs approximate / broken); the symmetry's scope (global vs local/gauge); and the relationship between symmetry and physical observability (spontaneously broken symmetries remain latent in the dynamics but not in the ground state). The distinguishing structural commitment is the combination of named-transformation invariance with closed group structure — other structures that share one commitment without the other (monoids without inverses, groupoids without global composition, transformations that don't close) are departures along specific axes.
What It Is Not¶
- Not balance or regularity — a "balanced" composition or a regular pattern may be symmetric, but symmetry is the precise algebraic claim of invariance under a group, not the visual impression of order. A façade can look balanced without being symmetric under any specific reflection; a pattern can be regular (periodic) without being symmetric under group operations beyond translation.
- Not mere repetition — repeating a motif is not symmetric unless the repetition corresponds to an invariance under a translation (or other transformation) of the pattern. Wallpaper groups formalize exactly when repetition constitutes a symmetry; most of the seventeen wallpaper groups include rotations and reflections in addition to translations.
- Not invariance in general — see
invariance#9. Invariance is the broader concept: any quantity that does not change under some process. Symmetry is the subset of invariance where the transformations form a group. This is the principal tight-pair relationship in this cluster: symmetry is the transformation group; invariance is what the group preserves. Every symmetry has invariants (Noether's theorem[2] makes this explicit for continuous symmetries: each continuous symmetry corresponds to a conserved quantity); every invariant belongs to some symmetry (the group that preserves it, possibly trivial). They are reciprocal first-class abstractions, not synonyms. - Not the absence of structure — a perfectly symmetric system can be extremely structured; the structure is just distributed so the system looks the same from many viewpoints. The void has no symmetry to speak of.
- Not identity — two configurations that are mapped to each other by a symmetry are equivalent-for-the-purpose, not literally identical — the left and right wings of a butterfly are distinct objects that play symmetric roles.
- Not duality in the structural sense — a duality (see
duality#17) is an involutive correspondence between two classes of object; a symmetry is a group action on a single class. The relationship is secondary: an involutive duality (applying-twice-returns-original) is a Z/2 symmetry, and the fixed points of the involution are the "self-dual" elements. But most dualities have richer structure than Z/2, and most symmetries are not dualities. - Common misclassification — calling something symmetric because it looks symmetric in the loose sense, without naming the transformation under which invariance is supposed to hold. "The organization is symmetric" is vacuous until one says under what operation: under exchange of two roles? Under permutation of team members? Under rotation of responsibility? Each claim has different consequences.
Broad Use¶
Symmetry is the foundational vocabulary of twentieth-century physics and mathematics. Group theory emerged from Galois's[1] early-nineteenth-century work on the solvability of polynomial equations — Galois showed that a polynomial is solvable by radicals iff its associated permutation group (the Galois group) is a solvable group, reducing a question about equations to a structural question about groups. Klein's 1872 Erlangen program[3] reformulated geometry as the study of properties invariant under a specified transformation group (Euclidean geometry = properties invariant under the Euclidean group; affine, projective, conformal, and other geometries correspond to larger groups), showing that geometry is organized by symmetry rather than by metric or construction. Noether's 1918 theorem[2] established the deepest connection between symmetry and physics: every continuous symmetry of a Lagrangian corresponds to a conserved quantity, with time-translation symmetry giving energy conservation, space-translation giving momentum conservation, and rotation giving angular momentum conservation.
In physics, gauge symmetries are the organizing principle of the Standard Model: U(1) gauge symmetry generates electromagnetism, SU(2) × U(1) generates the electroweak interaction (with spontaneous symmetry breaking producing the Higgs mechanism), and SU(3) generates the strong interaction (quantum chromodynamics). The pattern — gauge symmetry requires a gauge field, which mediates a force — is so generative that "what is the gauge group?" is the canonical opening question for any proposed field theory. In chemistry and materials science, molecular point groups (C_n, D_n, T, O, I and their variants) and crystallographic space groups[5][6] classify molecules and crystals; selection rules in spectroscopy (which transitions are allowed vs forbidden) follow from symmetry arguments via character-table computations. In biology, bilateral, radial, and spherical body plans encode developmental and evolutionary history, and molecular symmetries (chirality, point groups of protein subunits) govern function.
In combinatorics, Burnside's lemma and Pólya's enumeration theorem[7] count configurations up to symmetry — essential in chemistry (counting distinct isomers), cryptography, and combinatorial design. In cryptography, symmetric-key encryption uses the same key for encryption and decryption, an instance of invariance-under-inversion; modern cipher design relies on explicit avoidance of unintended symmetries in the S-boxes and round functions. In art, architecture, and design, reflective, rotational, and translational symmetries as principles of composition, visual balance, and decorative pattern date to antiquity; the seventeen wallpaper groups classify all possible periodic two-dimensional patterns, and the 230 crystallographic space groups classify three-dimensional ones. In computer science, symmetry-based model-checking quotients the state space of a system under permutation or automorphism symmetries, reducing verification cost; in machine learning, permutation-invariant architectures (Deep Sets) and group-equivariant architectures (G-CNNs) bake symmetry into the hypothesis class.
Clarity¶
Symmetry clarifies by turning "this system has a certain structure" into a precise claim: this system is invariant under these operations. That precision allows inferences (properties that survive the transformation must be computable from the quotient structure) and comparisons (two systems sharing a symmetry group share a substantial family of properties). The clarifying force is that symmetry, unlike the looser "balance" or "regularity," names a commitment that can be verified, falsified, or quantitatively loosened — a crystallographer can compute whether a proposed space group is consistent with a diffraction pattern, an algebraist can compute whether a proposed group of transformations closes, a physicist can test whether a proposed symmetry is exact or approximate by measuring the predicted conservation law's precision. A further clarifying move is the orbit-and-stabilizer decomposition: once a group acts on a system, the system decomposes into orbits (sets of configurations mapped to each other by the group) and stabilizers (subgroups that fix each configuration), which organizes the system's complexity at the level of symmetry classes rather than individual configurations.
Manages Complexity¶
Symmetry manages complexity by quotienting: a system with a symmetry group G can be reduced to its orbit space (the quotient of the system by G), which is almost always simpler than the original system. One wing of the butterfly plus the reflection is simpler than two independently specified wings; one fundamental domain of a crystal plus the space group is simpler than a full crystal structure. Reasoning modulo the symmetry — properties that are symmetry-invariant can be analyzed without considering every configuration, only equivalence classes (orbits) — cuts search spaces by the order of the group (or more, when orbit sizes vary). In optimization, simulation, and enumeration, symmetries quotient out redundant configurations that would otherwise be explored separately (symmetry-breaking constraints in constraint satisfaction, symmetry exploitation in molecular dynamics, orbit counting in combinatorial enumeration). Continuous symmetries generate conservation laws via Noether's theorem[2] — the conserved quantity structures the entire dynamics regardless of the specific forces, which is why energy conservation is more fundamental than any specific force law. Symmetry licenses transfer: two systems with the same symmetry group inherit much of each other's analysis regardless of their substantive content — the representation theory of the group applies to both, the selection rules in spectroscopy apply to both, the orbit structure applies to both. The complexity-management cost is the information loss induced by quotienting: a symmetry-respecting analysis cannot see features that the symmetry collapses; if those features matter, the symmetry must be broken or explicitly extended with symmetry-breaking terms.
Abstract Reasoning¶
Symmetry embodies a deep principle about structure: the appropriate level of description is often the level at which the symmetry manifests, and the dynamics of the system follow from the group structure rather than from the details it quotients. This is most vivid in physics, where Noether's theorem[2] shows that conservation laws follow from continuous symmetries of the Lagrangian — energy conservation is a consequence of time-translation symmetry, not an independent physical fact — and the entire Standard Model is specified by its gauge group (SU(3) × SU(2) × U(1)) and the matter fields' representations under that group. It is also vivid in mathematics: Klein's Erlangen program[3] showed that each geometry is characterized by its symmetry group (Euclidean, affine, projective, conformal, Möbius, etc.), and the different geometries' theorems are theorems about invariants under their respective groups. The representation theory of groups (the study of how groups act linearly on vector spaces) extends this further — every group has a decomposition into irreducible representations, and many physical and mathematical systems decompose naturally along the irreducibles of their symmetry group (spherical harmonics for SO(3), plane waves for the translation group, character tables for finite groups). The symmetry-breaking dual is equally important: the interesting structure of a system is often revealed only when its symmetry is broken. Phase transitions (ferromagnetic ordering breaks rotation symmetry), bifurcations (a symmetric fixed point loses stability and a pair of asymmetric fixed points emerges), cosmological symmetry breaking in the early universe — all involve moving from a highly symmetric state to a state with a strict subgroup of the original symmetry. Anderson-Higgs-style spontaneous symmetry breaking[8][9] in particle physics is the archetype: the vacuum state breaks a symmetry that the Lagrangian retains, and the broken symmetry leaves fingerprints (Goldstone bosons, mass generation) that are diagnostic of the breaking pattern.
Knowledge Transfer¶
Mathematics (group theory, Galois theory) → system: algebraic structure / equation → transformation: permutation / automorphism → invariance: structural preservation → group: permutation group / automorphism group / Galois group → operations: coset decomposition, orbit-stabilizer theorem, representation theory Physics (classical mechanics, field theory) → system: Lagrangian / configuration space / field → transformation: rotation / translation / gauge / Lorentz transformation → invariance: action preservation → group: Lie group (Galilei, Poincaré, SU(N)) → operations: Noether-theorem application, symmetry-breaking analysis Chemistry (molecular and crystalline) → system: molecular structure / crystal → transformation: rotation / reflection / inversion / translation → invariance: structural identity → group: point group / space group → operations: character-table computation, selection-rule derivation, spectroscopy Biology (morphology and molecular biology) → system: body plan / protein subunit / molecular structure → transformation: bilateral reflection / n-fold rotation → invariance: anatomical / structural identity → group: symmetry group of the body plan or subunit → operations: phylogenetic comparison, functional-implication derivation Combinatorics (enumeration under symmetry) → system: set of configurations / graphs / colorings → transformation: relabeling / rotation / reflection → invariance: "same up to symmetry" → group: permutation group → operations: Burnside-Pólya counting, orbit-counting theorem Cryptography (symmetric-key ciphers) → system: cipher / keyed permutation → transformation: key-application / inverse-key-application → invariance: plaintext recovery under encrypt-decrypt composition → group: Z/2 (involutive) or larger → operations: S-box design, round-function design, avoidance of unintended symmetries Computer science (model checking, data structures) → system: state space / configuration → transformation: automorphism / permutation of identical components → invariance: behavioral equivalence → group: automorphism group of the system → operations: symmetry reduction, canonical-form computation Machine learning (equivariant architectures) → system: input space + model → transformation: translation / rotation / permutation / group action → invariance: output-preservation or output-equivariance → group: problem-specific symmetry group (SO(3), S_n, ...) → operations: G-CNN construction, permutation-invariant pooling, equivariant layer design Art, architecture, design → system: composition / pattern → transformation: reflection / rotation / translation → invariance: compositional identity → group: wallpaper group / frieze group / rosette group → operations: pattern classification, generative design Everyday reasoning → system: situation / arrangement → transformation: role-swap / relabeling / mirror-flip → invariance: functional equivalence → group: often implicit, usually Z/2 or cyclic → operations: "could this argument apply to the other side?" check; fairness reasoning
The shared structure across these contexts is the four-part specification (system / transformation / invariance / group) plus the algebraic-operation toolkit (orbits, stabilizers, quotients, representations, conservation laws). The distinctions lie in the group's size and topology (finite vs Lie vs infinite-discrete), in the transformation's physical interpretation (geometric, permutation, gauge, role-swap), and in the tolerance for approximate symmetry (exact in pure mathematics, approximate in nature, often aspirational in organizational design). A crystallographer classifying a mineral, a physicist identifying a conservation law, a combinatorialist counting isomers, and a software engineer exploiting invariance to dedupe a configuration space are doing the same structural work: name the system, name the transformations under which invariance is claimed, verify that the transformations compose as a group, and then use the group to compress or reason about the system. The algebraic infrastructure — orbits, stabilizers, quotients, representations — travels unchanged; what differs is the substantive content of the system and the physical or conceptual interpretation of the group elements.
Example¶
Formal / abstract — The regular hexagon and its dihedral symmetry group¶
The regular hexagon H in the plane is invariant under the dihedral group D_6, which has 12 elements: six rotations (by 0°, 60°, 120°, 180°, 240°, 300°) and six reflections (across each of the three diameters through opposite vertices and each of the three diameters through opposite edge-midpoints). This example exhibits every feature of the six-component structural signature: the system is the hexagon H as a subset of the plane (component 1); the transformations are the 12 isometries that map H to itself (component 2); invariance is preservation of H as a point-set under each transformation (component 3); D_6 closes under composition (rotation by 60° composed with rotation by 120° gives rotation by 180°), contains the identity (rotation by 0°), and contains inverses (rotation by 60° and rotation by 300° are mutual inverses) (component 4); the transformations act on the plane (component 5); and D_6 is a finite discrete group of order 12, not a continuous Lie group (component 6).
The group structure yields rich downstream reasoning. D_6 has subgroups (the cyclic rotation group C_6 of order 6, the Klein four-group, various smaller cyclic and dihedral subgroups); its orbit structure partitions the 6 vertices into a single orbit under C_6 but into two orbits under smaller subgroups; its representations decompose vector-valued quantities on the hexagon into irreducible components (used in chemistry when the hexagon is a benzene-like molecular structure — the π-molecular-orbital decomposition of benzene is exactly the decomposition of the 6-dimensional orbital space into irreducible representations of D_6). Burnside's lemma and Pólya enumeration[7] compute the number of distinct hexagon-colorings up to D_6 symmetry — essential in counting distinct substituted benzenes.
Mapped back to the six-component structural signature: hexagon in the plane (component 1); 12 isometries (component 2); preservation of the point-set (component 3); closure, identity, inverses verified (component 4); action on ℝ² (component 5); finite discrete group of order 12, the dihedral group D_6 (component 6). The example also illustrates what happens when symmetry is broken: adding a label to one vertex reduces the symmetry from D_6 to a proper subgroup (C_1 trivial if the label is unique; a reflection subgroup if the labeling has a residual symmetry). The broken-symmetry state is more informative than the symmetric state — it can distinguish the labeled vertex from the others — at the cost of the reasoning shortcuts D_6 provided.
Applied / industry — Symmetry reduction in SAT-solver model checking¶
(Illustrative example; specific industrial SAT-solver performance claims are indicative rather than drawn from any particular vendor's benchmark suite.)
Modern SAT solvers and hardware model checkers exploit symmetry reduction to cut verification cost on circuits and protocols with interchangeable components. Consider a hardware model of a 16-processor cache-coherence protocol: at the level of the specification, the 16 processors are structurally identical — any permutation of their identities yields an equivalent state from the protocol's perspective. The state space of the naive model has size roughly 16! × S_local^16 (where S_local is each processor's local state count), but the equivalent state space modulo the symmetric group S_16 is smaller by a factor of up to 16! ≈ 2 × 10^13.
A symmetry-reducing model checker computes the automorphism group of the circuit's structural graph (here S_16 acting by relabeling processors), defines a canonical representative of each orbit (typically by lexicographic smallest-vertex-labeling within the orbit), and explores only canonical representatives during state-space search. For a typical cache-coherence verification run — 16 processors, a 4-state local protocol per processor, 8 cache lines — the naive state space has approximately 4.5 × 10^22 states; the symmetry-reduced state space has approximately 2 × 10^9 states (a reduction factor of ~10^13 from the group order 16! with partial orbit-size variance). The verification runtime drops from "infeasible" (weeks on a compute cluster) to "overnight on a single workstation."
The example exhibits the industrial version of the same structural machinery that governs the hexagon example. The system is the state space of the cache-coherence model (component 1); the transformation is processor permutation (component 2); the invariance is that permuted states are protocol-equivalent (a permuted "safe" state is still safe, a permuted "deadlock" state is still a deadlock) (component 3); S_16 is a group (component 4); the action is on the state-space graph's vertex set (component 5); S_16 is a finite discrete group of order 16! (component 6). The group-theoretic machinery — canonical-form computation via backtracking with vertex-invariant pruning, orbit-representative enumeration, stabilizer computation for partial-symmetry cases — transfers unchanged from pure group theory to the verification-tool context.
Symmetry reduction's failure modes are diagnostic of the underlying theory. If the specification secretly distinguishes processors (e.g., processor 0 has different firmware), the claimed S_16 symmetry is broken, and the reduction returns incorrect results by collapsing genuinely-distinct states; industrial tools surface this via symmetry-breaking constraints and user-supplied assertions that certain processors are distinguished. If the state-space graph's automorphism computation is itself intractable (the graph-automorphism problem is in quasi-polynomial time but not known to be polynomial[10]), the symmetry reduction itself becomes a bottleneck; practical tools use partial-automorphism heuristics and accept sub-optimal (but still valid) reductions.
Mapped back to the six-component structural signature: cache-coherence state space (component 1); processor-permutation operations (component 2); protocol-equivalence under permutation (component 3); S_16 closure, identity, inverses all hold structurally (component 4); action on the state-space graph (component 5); finite discrete group S_16 of order 16! ≈ 2 × 10^13 (component 6). The example illustrates that symmetry-reduction dividends are proportional to the group order — which is why industrial tools work hardest to identify the largest valid automorphism group, and why real systems often include explicit symmetry-breaking for components that are "nearly identical" (asymmetric processors, priority schemes, asymmetric topology).
(Illustrative example; specific industrial SAT-solver performance claims are indicative rather than drawn from any particular vendor's benchmark suite.)
Structural Tensions and Failure Modes¶
-
T1: Exact vs Approximate Symmetry.
- Structural tension: Symmetries in mathematics are exact; symmetries in nature, design, or organization are usually approximate. Treating approximate symmetry as exact gives clean analysis at the cost of missing the effects of the symmetry's imperfection — treating exact symmetry as approximate loses the sharp inferences the group structure provides.
- Common failure mode: Applying symmetry-based reasoning (conservation laws, orbit counting) to a system whose symmetry is only approximate, then being surprised by systematic errors that track the symmetry's departure from exactness. In particle physics, isospin symmetry (approximate SU(2) between up and down quarks) gives useful but imperfect predictions; treating it as exact misses the mass splittings that reveal the approximation.
-
T2: Symmetry vs Symmetry Breaking.
- Structural tension: High symmetry is often diagnostic of a featureless or "boring" state; the interesting structure frequently appears when the symmetry breaks — a phase transition, a bifurcation, a choice. Broken symmetries[8] carry information that the symmetric state does not. This tension is the source of "spontaneous symmetry breaking" as a foundational concept in condensed-matter and particle physics.
- Common failure mode: Assuming that symmetry is the end of analysis rather than the starting point — missing the mechanism, parameter, or perturbation whose role is to break the symmetry and so produce the structure actually observed. The inverse mistake is also common: imposing artificial symmetries on a naturally asymmetric system (e.g., over-constraining a regression model to be symmetric when the data demand asymmetry).
-
T3: Global vs Local Symmetry.
- Structural tension: A system can be symmetric globally while its parts are not, or symmetric locally (at every point) while the global configuration is not. In physics, the distinction between global and local (gauge) symmetries drives the structure of fundamental theories — gauge symmetries require a compensating gauge field and generate the Standard Model's forces; in organizations, uniform policies (global) differ from locally-applied norms.
- Common failure mode: Claiming a symmetry at the wrong scale — a global symmetry claim contradicted by local variation, or a local symmetry claim that fails to integrate into a global invariance. In field theory, attempting to gauge a global symmetry without introducing the gauge field produces inconsistent equations.
-
T4: Symmetry vs Information Content.
- Structural tension: High symmetry reduces the information needed to describe a system but also limits what the system can encode — a perfectly symmetric configuration can store only as much information as its quotient. Any distinction within a symmetric structure requires breaking the symmetry somewhere.
- Common failure mode: Preserving a symmetry past the point where a distinction needs to be made, leaving the system unable to represent the feature that matters; or, conversely, breaking symmetry more than necessary and losing the analytic leverage the symmetry provided. In machine learning, a permutation-invariant architecture applied to data where the order matters will fail to capture the order-dependent feature.
-
T5: Symmetry Discovery vs Symmetry Imposition.
- Structural tension: Symmetry can be discovered (the system already has it, and identifying the symmetry reveals structure previously hidden) or imposed (the symmetry is assumed for tractability, and the system is analyzed modulo the assumption). Discovery is inferential and falsifiable; imposition is methodological and carries a failure mode (the imposed symmetry may be incorrect).
- Common failure mode: Imposing a symmetry for computational convenience (permutation-invariance in a data architecture, rotation-invariance in image analysis) without verifying that the system actually has the symmetry, and then being surprised when the analysis misses symmetry-breaking features (ordered sequences misread as bags, chiral structures misread as achiral). The reverse failure is also common: discovering a genuine symmetry and then refusing to exploit it for fear of over-commitment.
Structural–Framed Character¶
Symmetry sits at the structural end of the structural–framed spectrum: it is a pure relational pattern, the same in any domain where it appears, and nothing about its meaning depends on a particular field's vocabulary or assumptions.
It is defined entirely by structure — invariance under a group of transformations — with no reference to human practices, no built-in evaluative weight, and no home-discipline vocabulary that has to come along when it is used. Recognizing symmetry in a face, a molecule, or a piece of music is just that: noticing a pattern that is already there, not importing a perspective. On every diagnostic that separates the two ends of the spectrum, it reads structural.
Substrate Independence¶
Symmetry is about as substrate-independent as a prime can be — composite 5 / 5 on the substrate-independence scale. Its signature is purely formal and algebraic — invariance under transformation — so it carries no trace of any home medium and applies wherever there is something to transform. The catalog shows it spanning group actions in mathematics, conservation laws via Noether's theorem in physics, visual balance in aesthetics, logical equivalence in philosophy, and even balanced organizational structures. With its abstraction, breadth, and transfer evidence all maxed out, it stands among the catalog's canonical 5s.
- Composite substrate independence — 5 / 5
- Domain breadth — 5 / 5
- Structural abstraction — 5 / 5
- Transfer evidence — 5 / 5
Relationships to Other Abstractions¶
Current abstraction Symmetry Prime
Paired with (1) — interdefinable complement
-
Symmetry is paired with Asymmetry Prime
Symmetry and asymmetry are interdefinable structural complements — each is precisely what the other is not under a stated transformation.Symmetry and asymmetry are interdefinable complements: symmetry is invariance under a named transformation group (the swap-test passes), while asymmetry is the failure of invariance under the same swap (the swap-test fails). Neither is prior; each is the structural negation of the other relative to a specified operation, and the diagnostic for one is the diagnostic for the other inverted. The framing depends on naming the transformation; once named, the two faces — preserved vs. not preserved — exhaust the possibilities. Symmetry is defined as follows: Invariance under transformation. Asymmetry is defined as follows: Directed imbalance in a relation whose two sides are not interchangeable under swap. Each identity supplies a contrast or condition needed to state the other. Making either endpoint foundationally prior would discard that co-definition, so the relation is mutual and remains outside the acyclic directed topology.
Children (100) — more specific cases that build on this
-
3-transposition group Domain-specific is a kind of Symmetry
The proposed strict upward parent is
prime:symmetry.The candidate literally instantiates prime:symmetry; its finite_group_theory constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while 3-transposition group adds domain-specific constraints. The entry does not collapse into that parent because A group generated by a conjugacy class of involutions such that the product of any two generators has order at most three It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of 3-transposition group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:symmetry. No live DAG mutation is authorized. -
3D4 Domain-specific is a kind of Symmetry
The proposed strict upward parent is
prime:symmetry.prime:symmetry is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Steinberg triality group 3D4 adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the base field and cubic extension or finite-field parameter, split D4 realization, triality and field automorphisms, fixed-point or descent convention, simply connected or adjoint form, center and simplicity qualifications and notation convention are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Steinberg triality group 3D4. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:symmetry. No live DAG mutation is authorized. -
3D rotation group Domain-specific is a kind of Symmetry
The proposed strict upward parent is
prime:symmetry.The candidate literally instantiates prime:symmetry; its geometry_and_mechanics constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while 3D rotation group adds domain-specific constraints. The entry does not collapse into that parent because The Lie group SO(3) of orientation-preserving linear isometries of three-dimensional Euclidean space, represented by orthogonal matrices of determinant one It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of 3D rotation group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge toprime:symmetry. No live DAG mutation is authorized.
- Accidental symmetry Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Accidental symmetry adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by field content, scale, operator basis and cutoff, retained terms, transformation, radiative stability, symmetry-violating operators, suppression, anomaly status, and breakdown scale are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Accidental symmetry. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- All fourths tuning Domain-specific is a kind of Symmetry
**Symmetry** (`prime:symmetry`).Uniform string intervals make pitch shapes invariant under vertical translation.
- Anticommutative property Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The property specifies transformation under argument-swap symmetry; sign reversal supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Anticommutative property adds domain-specific constraints. The entry does not collapse into that parent because sign-reversing symmetry of a binary operation It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Anticommutative property. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Antiunitary operator Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Antiunitary operator adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the complex Hilbert spaces, inner-product convention, conjugate linearity, bijectivity, conjugated inner-product identity, norm preservation, inverse and square, basis representation, phase ambiguity, and symmetry interpretation are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Antiunitary operator. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Asymmetric graph Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its graph_theory constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Asymmetric graph adds domain-specific constraints. The entry does not collapse into that parent because A graph whose automorphism group is trivial, so no nonidentity permutation of vertices preserves adjacency It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Asymmetric graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Balanced set Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Balanced set adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by for every point x in the set and scalar a with absolute value at most one, ax remains in the set under the stated field and vector-space conventions It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Balanced set. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Biquadratic field Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Biquadratic field adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the two radicands represent independent nontrivial rational square classes and the resulting extension has degree four and V4 Galois group It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Biquadratic field. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Biregular graph Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Biregular graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the graph and chosen bipartition, absence or treatment of isolated vertices, side degrees x and y, verification of uniformity and the edge-count identity are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Biregular graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Burnside's lemma Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Burnside's lemma adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the finite group and finite acted-on set, action law, orbit equivalence, fixed-point set for each group element, averaging denominator, finiteness assumptions and resulting orbit count are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Burnside's lemma. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Capped Octahedral Molecular Geometry Domain-specific is a kind of Symmetry
**Symmetry** is the strict parent because the ideal C3v reference defines position equivalences and the baseline against which distortions are read.Classification and Representation are related but secondary: the concept's identifying content is the symmetry-organized seven-position geometry. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Circulant matrix Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Cyclic shift symmetry determines the matrix and its Fourier modes; structured algebra supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Circulant matrix adds domain-specific constraints. The entry does not collapse into that parent because matrix structure generated by the cyclic group, yielding Fourier diagonalization and fast convolution algorithms It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Circulant matrix. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Commutator Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its algebra constraints supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Commutator adds domain-specific constraints. The entry does not collapse into that parent because An algebraic expression that measures failure of two elements or operators to commute, such as aba⁻¹b⁻¹ in a group or ab−ba in a ring It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Commutator. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Current algebra Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Current algebra encodes local symmetry generators; function-valued Lie structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Current algebra adds domain-specific constraints. The entry does not collapse into that parent because localization of finite-dimensional symmetry into infinitely many current modes It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Current algebra. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Diagonal subgroup Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Diagonal subgroup adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the group G, finite power and diagonal homomorphism are fixed and the subset contains exactly the constant-coordinate tuples with componentwise group operations It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Diagonal subgroup. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Double affine braid group Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The group encodes generalized braid and Weyl symmetries; double lattice structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Double affine braid group adds domain-specific constraints. The entry does not collapse into that parent because two-affine-direction braid symmetry underlying double affine Hecke algebra It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Double affine braid group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Edge Tessellation Domain-specific is a kind of Symmetry
**Symmetry — proposed parent.** The tile set is invariant under the group generated by reflections in tile-edge lines.The transformations are explicit, invertible, closed under composition, and act transitively on tiles. Edge Tessellation is a strict geometric instantiation of invariance under transformation. **Partition — related.** A tessellation partitions the plane into interiors together with their boundary incidence. Partition captures exhaustive, nonoverlapping division but does not supply metric polygons, edge adjacency, congruence, or reflection closure. It is true of every tessellation and therefore less discriminating as the minimal parent. **Segmentation and Boundary Drawing — related but not parent.** The tiling draws boundaries through a continuous plane, but the live prime emphasizes imposed classification meaning and threshold placement. Edge Tessellation is a mathematical coverage structure whose boundary lines are constrained by isometry rather than semantic category design. **Closure — related.** The tile set is closed under specified edge reflections. Generic closure omits the group action and geometric coverage.
- Exchange matrix Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Exchange matrix adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the dimension and indexing convention are fixed, each row and column contains one antidiagonal one, and J squared equals the identity It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Exchange matrix. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Exchangeable random variables Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Exchangeable random variables adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the sequence length and state space, joint law, finite-permutation action, invariance equation, conditional or extendibility assumptions, and distinction from iid and partial exchangeability are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Exchangeable random variables. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Fixed points of isometry groups in Euclidean space Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Fixed points of isometry groups in Euclidean space adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the Euclidean space and isometry group, group action, individual fixed-point equations, intersection over all group elements, proof of empty-or-affine form, dimension, bounded-orbit or compact-group conditions and distinction among centroid center of mass and inversion center are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Fixed points of isometry groups in Euclidean space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Galois Theory Domain-specific is a kind of Symmetry
**Symmetry** is the strict parent because Galois Theory identifies the full group of field transformations preserving the base and makes that group the carrier of inference.Duality and correspondence are important patterns, but the accepted Symmetry node explicitly includes discrete transformation groups and Galois-theoretic inference. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Gamas's theorem Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Gamas's theorem adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by partition and Young diagram convention, tensor factors, base field assumptions, irreducible symmetrizer, column sizes, and independent-set partition criterion are consistent It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Gamas's theorem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Hermitian function Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Hermitian function adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the domain is closed under negation, the complex-conjugation and Fourier conventions are explicit, the equality holds pointwise or almost everywhere, and multidimensional inversion and exceptional points are handled It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Hermitian function. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Homogeneous Graph Domain-specific is a kind of Symmetry
**Symmetry** is the proposed immediate parent.Invariance, Local–Global Principle, and Equivalence are related primes. Dense Graph, Cubic Graph, Rado Graph, and Graph Automorphism are domain-specific neighbors. The prospective queue contains one strict edge to `prime:symmetry`. No live DAG mutation is authorized.
- Indiscernibles Domain-specific is a kind of Symmetry
**Symmetry** is the strict parent because replacing one admissibly indexed finite tuple by another leaves every selected formula's truth value invariant.The exact transformation family—order-preserving substitutions or arbitrary permutations for a set—and the sense of sameness—type equality over parameters—are explicitly fixed. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Inertia stack Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Inertia stack adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the base category and topology, original stack or groupoid, object-automorphism pairs, conjugating morphisms, diagonal fiber product, representability or finiteness assumptions, components, and quotient convention are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Inertia stack. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Isometry group Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The group collects all transformations leaving metric relations invariant; exact distance preservation supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Isometry group adds domain-specific constraints. The entry does not collapse into that parent because complete exact metric-symmetry group of a space, with discrete or Lie structure when additional hypotheses apply It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Isometry group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- K-noid Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while K-noid adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the integer k and punctured Riemann surface, Weierstrass data, immersion convention, period-closing and completeness conditions, zero mean curvature, catenoidal ends, symmetry and embeddedness status are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of K-noid. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Killing spinor Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Killing spinors encode infinitesimal geometric or supersymmetric invariance in spinorial form; curvature and Clifford structure supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Killing spinor adds domain-specific constraints. The entry does not collapse into that parent because the spinorial analogue of a Killing symmetry, including its curvature integrability and supersymmetry-preservation roles It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Killing spinor. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Klein configuration Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Klein configuration adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the projective field and coordinate convention, sixty point and plane labels, fifteen lines per incidence element, permutation rule, coordinate realization, incidence verification and symmetry group are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Klein configuration. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Line group Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Line groups organize transformations preserving an axially periodic structure; crystallography supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Line group adds domain-specific constraints. The entry does not collapse into that parent because space symmetry specialized to one-dimensional translational periodicity It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Line group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Medial magma Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its universal_algebra constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Medial magma adds domain-specific constraints. The entry does not collapse into that parent because A magma whose binary operation satisfies (ab)(cd)=(ac)(bd) for all four elements It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Medial magma. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Mirror nuclei Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Mirror nuclei adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the two nuclides and common mass number A, proton and neutron numbers Z1 N1 Z2 N2, exchange equalities Z1=N2 and N1=Z2, isobar relation, isospin and strong-interaction charge symmetry, corresponding energy levels spin and parity, Coulomb displacement and other symmetry-breaking effects and comparison with isobaric analog states are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Mirror nuclei. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- N = 2 superconformal algebra Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while N = 2 superconformal algebra adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the two-dimensional chiral setting, base field, even generators L J and central c, odd generators and mode lattice, graded brackets and normalizations, Ramond or Neveu-Schwarz sector, representation and spectral-flow convention are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of N = 2 superconformal algebra. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Nilmanifold Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Nilmanifold adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the Lie group and nilpotency class, closed subgroup or lattice, left or right quotient convention, smooth and compactness assumptions, transitive action, metric invariance, and distinction from infranilmanifolds are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Nilmanifold. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Octahedral symmetry Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its finite_symmetry_groups restrictions supply the domain-specific residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Octahedral symmetry adds domain-specific constraints. The entry does not collapse into that parent because The finite symmetry group of a regular octahedron, equivalently a cube, comprising 24 rotations and 48 full isometries when reflections are included It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Octahedral symmetry. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Orientifold Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The construction forms a quotient by a declared discrete symmetry including orientation reversal; string consistency supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Orientifold adds domain-specific constraints. The entry does not collapse into that parent because orientation-reversing string quotient rather than an ordinary target-space orbifold It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Orientifold. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Otonality and utonality Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The pair uses an overtone-undertone dual symmetry of rational pitch sets; Partch's tonality system supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Otonality and utonality adds domain-specific constraints. The entry does not collapse into that parent because dual overtone and undertone organization central to Partch's harmonic theory It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Otonality and utonality. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Palindromic Sequence Domain-specific is a kind of Symmetry
**Symmetry.** This is the proposed strict DAG parent.The system is the nucleotide string, the transformation is reverse complementation, and sameness is exact symbol identity. The order-two action `{identity, RC}` leaves the sequence unchanged.
- Pentagonal Planar Molecular Geometry Domain-specific is a kind of Symmetry
The minimal prospective placement is a composition/instantiation relation to live `prime:symmetry`.The ideal molecular framework instantiates \(D_{5h}\) fivefold symmetry, while the node adds chemical coordination, coplanarity, lone-pair occupancy, evidence, and distortion tolerances. Composition avoids claiming that a molecule shape is a subtype of the general symmetry relation. Crystal Lattice is the frozen semantic top at 0.745739 but is false coverage: periodic solid-state translation is not a local five-coordinate molecular arrangement. Configuration Drift and Fractal Geometry are also unrelated despite geometric vocabulary.
- Phase space crystal Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Phase space crystal adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by correlation or eigenstate structure has genuine discrete phase-space periodicity under the declared effective dynamics It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Phase space crystal. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Poincaré group Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry supplies the nearest cross-domain structural operation, while Poincaré group retains a constitutive identity specific to relativistic physics. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Poincaré group adds domain-specific constraints. The entry does not collapse into that parent because It excludes general coordinate transformations and curved-spacetime isometries, and the full group, proper orthochronous subgroup, and universal cover must be distinguished. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Poincaré group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Point reflection Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its geometry constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Point reflection adds domain-specific constraints. The entry does not collapse into that parent because An affine transformation that sends each point x to 2c−x about a fixed center c, preserving distances and reversing every displacement vector It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Point reflection. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Principal homogeneous space Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Principal homogeneous space adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the group action is both free and transitive in the declared algebraic, topological, or sheaf-theoretic setting It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Principal homogeneous space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Prismatic surface Domain-specific is a kind of Symmetry
Prismatic surface instantiates Symmetry because translation through any distance along the fixed generator direction preserves the complete surface, while the polygonal directrix specifies the domain-bound realization.The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Pseudoreflection Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Pseudoreflection adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the field and characteristic, finite-dimensional vector space, invertible linear map, nonidentity and finite order, fixed hyperplane and codimension, eigenvalues and root-of-unity condition and reflection terminology are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Pseudoreflection. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Quaternionic representation Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Quaternionic representation adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by group, field, representation, antilinear operator, equivariance, J-squared convention, irreducibility, and indicator criterion are fixed consistently It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Quaternionic representation. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- R-symmetry Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.R-symmetry is literally a symmetry—an automorphism preserving algebraic relations—with the nontrivial supercharge action supplying its DS residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while R-symmetry adds domain-specific constraints. The entry does not collapse into that parent because an algebra-automorphism symmetry whose defining action is on supercharges rather than only on matter fields, with ordinary, extended, continuous, discrete, and superconformal variants It also declines prime:symmetry_breaking: breaking is a possible status or consequence of an R-symmetry, not its defining superclass. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Real analytic Eisenstein series Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Real analytic Eisenstein series adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the normalization, coprimality convention, half-plane variable, complex parameter and convergence region, modular action, Laplacian sign, and continuation convention are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Real analytic Eisenstein series. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Real element Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and stated invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Real element adds domain-specific constraints. The entry does not collapse into that parent because the autonomous group theory identity defined by x and x^-1 occupy the same conjugacy class under the exact group, with the stronger involution condition stated separately It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Real element. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Reciprocity law Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Reciprocity exchanges arithmetic roles while preserving a corrected splitting relation; algebraic-number-field structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Reciprocity law adds domain-specific constraints. The entry does not collapse into that parent because local-prime splitting classification governed by a global arithmetic reciprocity relation It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Reciprocity law. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Reflection principle (Wiener process) Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The theorem literally uses invariance of Brownian increments under sign reversal to pair path events; the first-hitting-time construction and Wiener law supply the domain-specific residual. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because the stopping-time-conditioned reflection symmetry of Brownian paths and its barrier-event bijection, rather than reflection geometry generally or the Markov property alone A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Reynolds operator Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The operator literally extracts the component fixed by a symmetry action; averaging rules and application-specific convergence supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Reynolds operator adds domain-specific constraints. The entry does not collapse into that parent because an averaging projection whose range is defined by invariance under a declared action It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Reynolds operator. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Rhombus Domain-specific is a kind of Symmetry
**Symmetry** is the proposed strict structural parent.Every Euclidean rhombus is invariant under reflection in each diagonal and under their composite half-turn; the square subclass adds further transformations. The review-only DAG edge is `composition / instantiates / strict` from Rhombus to Symmetry. **Constraint** is related because four equalities reduce the general quadrilateral parameter space. **Classification** organizes the inclusive hierarchy and makes Square inherit Rhombus properties. **Invariance** captures preservation under rigid motions and similarities. **Boundary** captures the closed four-segment perimeter. These are useful explanations but not additional minimal parents. If Quadrilateral or Parallelogram later becomes a live domain-specific target, it may be the more local taxonomic parent. Until then, Symmetry is the strongest exact live structural genus and the only proposed edge.
- Rod group Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Rod group adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the periodic axis, lattice repeat, ambient three-dimensional isometries, point group, origin and orientation convention, and standard group symbol are fixed It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Rod group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Root System Domain-specific is a kind of Symmetry
**Symmetry** is the proposed immediate parent.Invariance, Generation, Decomposition, and Classification are related primes. Crystal Lattice and group-representation abstractions are domain-specific neighbors. The prospective queue contains one strict edge to `prime:symmetry`. No live DAG mutation is authorized.
- Sastry Automorphism Domain-specific is a kind of Symmetry
**Symmetry** is the proposed immediate parent.Automorphism, Constraint Satisfaction, Embedding, Classification, Exceptional Case, and Parameterization are related. Automorphism Group collects all self-symmetries of one object; it does not cover this constrained subclass. The prospective queue contains one strict edge to `prime:symmetry`. No live DAG mutation is authorized.
- Seismic anisotropy Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The phenomenon is characterized through which rotations preserve or change material response; elastic-wave and geological interpretation supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Seismic anisotropy adds domain-specific constraints. The entry does not collapse into that parent because direction-dependent seismic response tied to elastic tensors and diagnostic Earth fabrics rather than mere spatial variation It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Seismic anisotropy. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Self-complementary graph Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Self-complementary graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the graph is simple under a declared finite or infinite convention, the complement uses the same vertices, an explicit isomorphism or existence proof exchanges adjacency and nonadjacency, and order constraints are satisfied It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Self-complementary graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Semi-symmetric graph Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry supplies the nearest cross-domain structural operation, while Semi-symmetric graph retains a constitutive identity specific to graph theory. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Semi-symmetric graph adds domain-specific constraints. The entry does not collapse into that parent because The term is not synonymous with half-transitive directed behavior, and disconnected or nonregular conventions should be stated. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Semi-symmetric graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Siegel upper half-space Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The domain is a homogeneous symmetric space under a symplectic group action; positive complex-matrix geometry supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Siegel upper half-space adds domain-specific constraints. The entry does not collapse into that parent because higher-degree upper-half-space geometry linking positive complex structures, symplectic symmetry and Siegel modular forms It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Siegel upper half-space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- SO(8) Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while SO(8) adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the real or complex field, quadratic form, determinant-one condition, topology or algebraic-group convention, covering relation, center, and representation labels are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of SO(8). This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Spin tensor Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The spin current arises from continuous rotational or Lorentz symmetry through Noether structure; intrinsic angular momentum supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Spin tensor adds domain-specific constraints. The entry does not collapse into that parent because covariant local intrinsic-angular-momentum current and its coupling to stress-energy asymmetry It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Spin tensor. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Stanley symmetric function Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its algebraic_combinatorics constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Stanley symmetric function adds domain-specific constraints. The entry does not collapse into that parent because A symmetric function indexed by a permutation and generated from its reduced words, encoding reduced-decomposition and Schubert-polynomial combinatorics It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Stanley symmetric function. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Star polyhedron Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Star polyhedron adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the figure satisfies the declared star-polyhedron definition and its face and intersection convention is stated It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Star polyhedron. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Strongly regular graph Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its algebraic_graph_theory constraints supply the domain-specific residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Strongly regular graph adds domain-specific constraints. The entry does not collapse into that parent because A regular graph with fixed numbers of common neighbors for every adjacent pair and for every nonadjacent pair, summarized by parameters (v,k,lambda,mu) It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Strongly regular graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Sunburst Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and stated invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Sunburst adds domain-specific constraints. The entry does not collapse into that parent because the autonomous decorative arts identity defined by multiple rays share and visibly diverge from one center under a deliberate solar convention It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Sunburst. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Symmetric polynomial Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry supplies the nearest cross-domain structural operation, while Symmetric polynomial retains a constitutive identity specific to algebra. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Symmetric polynomial adds domain-specific constraints. The entry does not collapse into that parent because A polynomial can have visually repeated terms without full permutation invariance, and symmetric functions in infinitely many variables require a related but distinct stable framework. It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Symmetric polynomial. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Symmetrically continuous function Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Symmetrically continuous function adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the two-sided symmetric difference tends to zero at the declared point under the stated domain convention It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Symmetrically continuous function. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Symmetrization Domain-specific is a kind of Symmetry
**Symmetry** is the proposed immediate parent.Averaging, Projection, Invariance, Equivalence Class, and Information Loss are related. Geometric Transformation is a different family of actions. The prospective queue contains one strict edge to `prime:symmetry`. No live DAG mutation is authorized.
- Tetrahedral molecular geometry Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source-domain carrier and recognition invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Tetrahedral molecular geometry adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the central atom and four bonded substituents, coordination and electron-domain distinction, three-dimensional connectivity, bond angles and distortions, point group and chirality status and evidence from structure determination are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Tetrahedral molecular geometry. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Tomita–Takesaki theory Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Tomita–Takesaki theory adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by von Neumann algebra, standard representation or faithful weight, domain and closure of Tomita operator, polar decomposition, commutant identity, and modular-flow convention are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Tomita–Takesaki theory. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Torus action Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Torus action adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by torus type, action morphism, space category, effectiveness, stabilizers, weights, fixed loci, quotient convention, and any Hamiltonian or algebraic hypotheses are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Torus action. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Translation plane Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source domain and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Translation plane adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity determined by the projective plane and incidence axioms, distinguished translation line, center and axis conventions, elations and their group, transitivity domain, affine-plane deletion, translation group action, finite order, coordinatizing quasifield or spread, dualization and derivation, and Desarguesian comparison are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Translation plane. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Translational symmetry Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The candidate literally instantiates prime:symmetry; its symmetry_and_physics constraints provide the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Translational symmetry adds domain-specific constraints. The entry does not collapse into that parent because Invariance of an object, field, law or equation under every translation in a stated continuous group or under translations in a discrete lattice It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Translational symmetry. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Triangle group Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.The group captures symmetries generated by reflections of a fundamental triangle; constant-curvature tiling supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Triangle group adds domain-specific constraints. The entry does not collapse into that parent because three-mirror Coxeter symmetry determined by triangle angles It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Triangle group. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Uniform polyhedron Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Uniformity is vertex-transitive geometric symmetry; regular-face structure supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Uniform polyhedron adds domain-specific constraints. The entry does not collapse into that parent because vertex-uniform regular-faced polyhedral class broader than regular and Archimedean solids It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Uniform polyhedron. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Weakly symmetric space Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime while the source-domain carrier and invariant supply the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Weakly symmetric space adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the complete Riemannian manifold, isometry group and transitive action, point-exchange property, isotropy subgroup, involutivity distinction, homogeneous-space representation and any Gelfand-pair or classification claim are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Weakly symmetric space. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Witting polytope Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Regularity of the Witting polytope is literally invariance and flag transitivity under its complex-reflection group; the fixed complex coordinates, incidences, counts, cells, and duality supply the autonomous object residual. The edge is proposal-only and points to a frozen prior-baseline Prime. The entry does not collapse into the parent because one exact regular complex incidence-and-symmetry object, not an arbitrary 240-vertex polytope, the real 4_21 polytope, the Witting configuration alone, or the honeycomb whose facets and vertex figures are Witting polytopes A thematic neighbor is declined whenever it does not literally subsume that rule. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Wyckoff positions Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.Wyckoff classes are determined by orbits and stabilizers under space-group symmetry; crystallography supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Wyckoff positions adds domain-specific constraints. The entry does not collapse into that parent because space-group orbit classification used to encode crystallographic sites It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Wyckoff positions. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Zero-symmetric graph Domain-specific is a kind of Symmetry
The proposed strict upward parent is `prime:symmetry`.prime:symmetry is the nearest broader Prime; the source-domain invariant supplies the autonomous residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Zero-symmetric graph adds domain-specific constraints. The entry does not collapse into that parent because the domain-specific identity fixed by the finite connected graph, degree three, automorphism group, free and transitive vertex action, uniqueness of vertex-mapping automorphisms, edge orbits and isomorphism conventions are explicit It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Zero-symmetric graph. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge. The prospective workspace queue contains one strict upward edge to `prime:symmetry`. No live DAG mutation is authorized.
- Anisotropy Prime is a kind of Symmetry
The accepted reference-grade review places Anisotropy under Symmetry because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.Make a property or response depend on direction, orientation, or axis in the carrier, so rotating the same probe changes the measured relation. The parent is defined more broadly: Invariance under transformation.
- Associativity Prime is a kind of Symmetry
Associativity is a kind of symmetry: the regrouping transformation leaves the result of a binary operation unchanged.Associativity says that (a o b) o c equals a o (b o c) for all elements, so the result is unchanged under the transformation that regroups the parenthesization. That is the precise algebraic claim of symmetry: invariance under a specified group of transformations, here the regrouping action on operand strings. Associativity specializes symmetry by fixing the operation as a binary combiner and the preserved feature as the value of finite combinations independent of grouping.
- Commutativity Prime is a kind of Symmetry
Commutativity is a specialization of symmetry in which the transformation group permutes the operands of a binary operation.Commutativity is a specialization of symmetry in which the symmetry group is the swap of operands and the operation is left invariant under that swap: a circ b equals b circ a for all operands. It inherits the general symmetry commitment that a system is invariant under a specified group action, and specializes by fixing the group to the two-element permutation of operands of a binary operation. When this swap symmetry holds, sequencing collapses one dimension and unlocks reordering, parallelization, and algebraic manipulations unavailable in non-commutative settings.
- Equivalence Principle Prime is a kind of Symmetry
The equivalence principle is a specific kind of symmetry, the local indistinguishability of gravitational and inertial acceleration.The equivalence principle is a specialization of symmetry. The general pattern is invariance under a specified group of transformations, with the algebraic commitment that the transformation leaves the system unchanged in a specified sense. The equivalence principle instantiates this with the transformation being the choice between an accelerated frame and a free-fall frame in a gravitational field: physics in a sufficiently small region is indistinguishable across the two. The local invariance under frame change is the symmetry; Einstein elevated it to the founding principle of general relativity by deriving spacetime curvature from this exact symmetry requirement.
- Equivariance Prime is a kind of Symmetry
Equivariance is a specialization of symmetry that requires the map to commute with the group action rather than be fixed by it.Equivariance is a specialization of symmetry. Specifically, it instantiates the transformation-group structure by tying two group actions -- one on the input, one on the output -- through a map satisfying f(g.x) = g.f(x). Like every symmetry claim, it specifies a group of transformations and how the system responds; equivariance is the subclass where the response is to transform-in-lockstep rather than to remain fixed (which would be invariance). The map respects the symmetry without being annihilated by it.
- Gauge Invariance / Gauge Symmetry Prime is a kind of Symmetry
Gauge invariance is a specific kind of symmetry where the invariance is under a group of local transformations of unobservable internal degrees of freedom.Gauge invariance is a specialization of symmetry. The general pattern is invariance of a system under a specified group of transformations: applying the action leaves the system unchanged in a specified sense. Gauge invariance instantiates this with the transformation group acting locally on unobservable internal degrees of freedom (phase, color index, reparameterization), so physical observables correspond to equivalence classes under the action. The structural commitment is precisely symmetry's algebraic claim, with the particular feature that the group action is local and the invariant content is the gauge-equivalence class.
- Inversion Prime is a kind of Symmetry
Inversion is a specific kind of symmetry, reversing a relation or sequence while preserving some underlying equivalence.Inversion is a specialization of symmetry. The general pattern is invariance under a specified group of transformations, with the algebraic commitment that the transformation leaves a stated feature unchanged. Inversion instantiates this with the transformation being reversal (of a relation, sequence, or dependency chain), and the preserved feature being some underlying element or equivalence (composition with the inverse returns the identity). Jacobi's invert-always-invert heuristic exploits the fact that the inversion transformation belongs to the symmetry group of the structure, so working in the inverted regime is mathematically equivalent for many purposes.
- Scale Invariance Prime is a kind of Symmetry
Scale Invariance is a kind of symmetry: structure is preserved under the rescaling transformation x -> lambda x.Scale invariance is the property that a system, structure, or distribution is unchanged under dilation x -> lambda x, reflecting the absence of a characteristic scale. That is precisely a symmetry claim: invariance of a named feature under a specified group of transformations, here the multiplicative group of rescalings. Scale invariance specializes symmetry by fixing the relevant group as rescaling and the preserved feature as the system's statistical or geometric structure across length, time, or energy scales.
- Momentum Domain-specific is part of Symmetry
Momentum contains translational symmetry as the Noether ground that makes its total conserved in a closed system.Momentum is the generator associated with spatial translation, and its conservation holds exactly when the laws are invariant under a shift of position. Remove translational symmetry and p can remain a defined quantity, but the defining conservation guarantee and missing-carrier diagnostic no longer follow.
- Perfect Competition Domain-specific is part of Symmetry
Perfect Competition contains within-role permutation symmetry: swapping any two atomistic sellers or buyers leaves prices, information, and feasible trades unchanged.No participant has identity-specific power or information, and homogeneous units make sources interchangeable. That invariance is what lets the market replace individual actors with aggregate supply and demand.
- Tensor representation Domain-specific presupposes Symmetry
**Symmetry** (`prime:symmetry`).Permutation symmetries and group invariance select tensor constituents. These are prose placement proposals only. They create no `dag_edges`; endpoint, redundancy, and cycle checks are recorded separately in the bundle's placement memo.
- Conjugate Variables Prime presupposes Symmetry
Conjugate variables presupposes symmetry because the canonical transformation mediating between the two complementary descriptions is a symmetry of the underlying physics.Conjugate variables couple two complementary descriptions of a system via a canonical transformation or integral transform that preserves the essential physics while exchanging which features are local. This presupposes symmetry: invariance under a specified group of transformations, with the algebraic commitment that the stated transformation leaves the system unchanged in a specified sense. The canonical transformation is precisely such a structure-preserving group action on phase space; the Fourier kernel is a unitary transformation preserving total content. Without symmetry's transformation-group framework, the equivalence between conjugate descriptions has no algebraic substrate.
- Noether's Theorem Prime presupposes Symmetry
Noether's theorem presupposes a continuous symmetry of the action from which it derives a conserved current.A continuous symmetry of the action is an explicit input to Noether's theorem. The theorem adds the correspondence to a conservation law; it is not itself a kind of symmetry. Its existing least-action prerequisite is retained as a separate parent.
- Symmetry Breaking Prime presupposes Symmetry
Symmetry breaking presupposes symmetry because the phenomenon is precisely the gap between symmetric governing laws and an asymmetric state.Symmetry breaking presupposes symmetry because the phenomenon is defined as a system whose governing laws possess a symmetry yet whose actual state does not share it. Without symmetry's prior identification of the transformation group under which the laws are invariant, there is nothing to break: the broken-versus-unbroken distinction requires the symmetric reference, and the degenerate ground states among which the system selects are symmetry-related by the very group whose action is broken at the state level.
- Impartiality Prime is a decomposition of Symmetry
Impartiality is the specific shape symmetry takes when the transformation group is permutation of party identities applied to treatment.Impartiality is a structurally-particularized instance of symmetry, where the transformation group is the permutation of party identities and the object held invariant is the treatment, judgment, or allocation. Once a line is drawn between relevant features and irrelevant identity features, impartiality asserts that swapping the identities of the parties leaves the outcome unchanged. The general algebraic pattern of invariance-under-a-named-group takes on its ethical-political form here, with identity as the action and like-treatment as the invariant.
- Reciprocity Prime is a decomposition of Symmetry
Reciprocity is the specific shape symmetry takes when actions in an ongoing relationship are returned in kind across parties.Reciprocity is the specific shape symmetry takes when the invariance is between actions and their returns within a social relationship: help is met with help, harm with harm, contribution with contribution. It is a structurally-particularized instance of transformation-group invariance, where the transformation is the role-swap between giver and receiver and the property preserved is the kind or magnitude of the action. The added commitment is that the symmetry is enforced across time through expectations and norms rather than as an instantaneous geometric balance, and that violations carry social consequences ranging from withdrawal to retaliation.
- Rule of Law Prime is a decomposition of Symmetry
Rule of law is the specific shape symmetry takes when the transformation group is permutation of legal subjects and the invariant is rule-treatment.Rule of law is the specific shape symmetry takes when the system is a legal order and the transformation group is permutation across legal subjects (and the rule-maker themselves). The defining commitment that the same rule yields the same treatment independent of identity, rank, or power is exactly invariance under the swap-of-persons transformation -- the symmetry of equal application. The reflexive self-binding of rule-generating elements extends the symmetry to include the legislator and enforcer within the same group, making the order symmetric under the broadest permutation of legal agents. After the law_governance frame is stripped away, the retained structural roles are those of Symmetry: Invariance under transformation. Rule of Law adds the local frame and commitments expressed in its identity: No element of a system is exempt from its governing rules, including the element that generates or enforces them. The parent pattern remains recognizable without that vocabulary, while the child is the framed realization of it. That preservation test establishes decomposition rather than taxonomic subsumption.
Neighborhood in Abstraction Space¶
Symmetry sits among the more crowded primes in the catalog (8th percentile for distinctiveness): several abstractions describe nearly the same structure, so a description that fits it will tend to fit its neighbors too — transporting it usually means disambiguating within this family rather than landing on it exactly.
Family — Foundational Mathematical Structures (23 primes)
Nearest neighbors
- Invariance — 0.87
- Symmetric Response to Asymmetric State — 0.75
- Relation — 0.75
- Duality — 0.74
- Scale — 0.74
Computed from structural-signature embeddings · 2026-09-10
Not to Be Confused With¶
Symmetry must be distinguished from Symmetry Breaking, its closest structural neighbor (similarity 0.765), yet they refer to opposite operations on the same formal structure. Symmetry is invariance under a specified group of transformations—the persistence of structure across a family of operations. Symmetry Breaking is the phenomenon where a system governed by symmetric laws nonetheless selects an asymmetric ground state or trajectories that violate the symmetry. A ferromagnet above its critical temperature has rotational symmetry (the Hamiltonian is invariant under spatial rotations, and there is no preferred magnetic direction), but below the critical temperature, the same Hamiltonian still has rotational symmetry while the ground state does not (the spins align in one direction, spontaneously breaking the symmetry). The law is symmetric; the physical realization is not. This is fundamentally different from Symmetry itself, which describes which transformations preserve the system. Symmetry specifies what stays the same; symmetry breaking specifies what is relinquished in the evolution to a lower-energy state. The two are complementary moves: identifying symmetry clarifies what structure is preserved, while identifying where symmetry breaks reveals which aspects of the system are free to choose. A physicist analyzing a phase transition starts with Symmetry (the high-temperature symmetric phase has a particular group), then asks what Symmetry Breaking occurs (which subgroup survives in the low-temperature phase), and the answer to the second question is diagnostic of the physics (the pattern of symmetry breaking predicts which order parameter emerges, which excitations persist, which selection rules hold). In organizational design, a hierarchically flat team has formal role-based symmetry (all team members are equally authorized to make decisions within their function), but the team may spontaneously break this symmetry by deferring to one member as an informal leader. The formal structure is Symmetric; the actual behavior exhibits Symmetry Breaking.
Symmetry is also distinct from Invariance, though the relationship is intimate and reciprocal. Invariance is the broader concept: any quantity or property that does not change under some process or transformation. Symmetry is the subset of invariance where the transformations form a group — closure under composition, identity, and inverses. Every symmetry has associated invariants (Noether's theorem makes this explicit for continuous symmetries: time-translation symmetry has energy conservation, spatial-translation symmetry has momentum conservation), and every invariant belongs to some symmetry group (the group that preserves it, even if that group is trivial). The distinction is: invariance is the property of "remaining unchanged"; symmetry is the group structure that produces the invariance. When a physicist says a system has "rotational symmetry," they mean the group SO(3) of rotations leaves it unchanged. The invariant is "unchanged under rotation"; the symmetry is the group SO(3). Confusing them leads to imprecision: saying "the system is invariant" without specifying under what transformations omits the group structure that does the organizing work. A perfect sphere is invariant under SO(3) rotations, an ellipsoid under SO(2) rotations around its long axis, and a cube under the dihedral group D_6 rotations and reflections — three different invariances, three different symmetries, each with different consequences. If one stops at "invariant" without naming the group, the analysis loses the specificity needed to derive consequences (selection rules, conservation laws, orbit counts).
Symmetry is not equivalent to Gauge Invariance or Gauge Symmetry, though gauge invariance is a type of symmetry that operates locally. Symmetry in general is invariance under a global or local transformation group. Gauge invariance is the principle that physical laws and their observable consequences remain invariant when a field transformation is applied locally (at every point in space and time) rather than globally (uniformly across the entire system). In electromagnetism, global phase-shift symmetry (U(1) global) means you can rotate the phase of all electron-field values by the same amount everywhere and the physics stays the same; gauge invariance (U(1) local) means you can do this rotation differently at every point and the physics still stays the same provided you introduce a compensating gauge field (the electromagnetic field). Gauge symmetry is more restrictive than global symmetry because it requires compensation; it is also more generative because the compensating field is the force field. The Standard Model is built by starting with gauge symmetries (SU(3) for color, SU(2) × U(1) for weak and electromagnetic) and deriving the particles and forces as the gauge fields required to maintain local invariance. Gauge invariance is a specific type of symmetry (local, requiring compensation), not a alternative concept; it is a subspecies of the Symmetry prime, not a neighbor. In the taxonomy, gauge invariance lives inside symmetry, not beside it.
Symmetry is also not Scale Invariance, though scale invariance is another specific type of symmetry. Scale invariance (or conformal invariance) is invariance under scaling transformations — multiplying all distances by a constant factor — which appears in critical phenomena (at phase transitions, systems often become scale-invariant; the correlation length diverges, and the system looks the same at all scales), in certain conformal field theories, and in some combinatorial and biological contexts. Scale invariance is a specific transformation group (the group of scaling dilations, often extended to conformal transformations that include translations and rotations as well). While scale invariance is a type of symmetry — it is invariance under a particular group of transformations — the label "Scale Invariance" often refers to a specific mathematical structure (power-law behavior, self-similar form) that has become its own research tradition. The distinction is one of focus and tradition: Symmetry is the general principle (invariance under group transformations), while Scale Invariance is a particular important instance that has developed its own conceptual vocabulary and diagnostic methods (critical exponents, renormalization, universality classes).
Solution Archetypes¶
Solution archetypes in the catalog that build on this prime — directly (this prime is a source ingredient) or as a related prime.
Built directly on this prime (6)
- Directed Asymmetry Mapping and Calibration: When two sides of a relation are not interchangeable, make the direction and dimensions of imbalance explicit before choosing symmetric treatment, side-specific treatment, compensation, or containment.▸ Mechanisms (12)
- Asymmetry Dimension Scorecard — Rates a relation's imbalance dimension by dimension — control, information, exit, exposure — so a vague 'they hold the power' becomes a scored, side-by-side profile.
- Asymmetry Exception Register — A standing log of every asymmetry the system has chosen to keep — each entry carrying its justification, its owner, and its expiry — so no differential treatment survives unexamined.
- Asymmetry Sunset Review — A scheduled re-examination that forces every standing asymmetry to re-earn its warrant or be retired — closing the door on 'temporary' differences that quietly became permanent.
- Burden–Benefit Balance Sheet — Tallies who bears the costs and who reaps the gains of an asymmetric relation, side by side, and marks the line past which the exchange stops being reciprocal.
- Compensating Control Selection — Given an asymmetry worth keeping, selects the offsetting controls — disclosure, cooling-off, independent advice, caps — that blunt its harms without erasing the difference itself.
- Countervailing Review Panel — A standing body of independent and affected voices that reviews decisions where one side controls the premises — supplying the countervailing perspective a one-sided channel structurally lacks.
- Directed Relation Matrix — Lays the two sides of each relation on a grid and records which way influence, dependence, and control actually run — turning a vague 'they're unequal' into an oriented map.
- Direction-Sensitive Metric Dashboard — Tracks a matched pair of metrics — one per side of the relation — and watches the gap between them, so a drift toward one side is caught while it is still small.
- False Symmetry Review — A standing review that hunts for rules which treat unequal sides identically, and tests whether that even-handedness quietly loads the cost onto the weaker side.
- Relevant Asymmetry Test — Asks whether a real difference between the two sides is actually relevant to the treatment in question — the gate that separates a warranted asymmetry from bare prejudice or arbitrary privilege.
- Role-Specific Policy Table — Writes down, role by role, what each side of the relation must do, may do, and is owed — so unequal treatment is explicit, addressable, and paired with the controls that offset it.
- Side-Swap Test — Swaps the two sides of a relation and asks whether the arrangement still reads as acceptable — the fastest way to expose an asymmetry that only survives because no one pictures it reversed.
- Reflexive Rule-Binding Governance: Keep authority inside the rule system by making every actor, enforcer, exception, and rule-change path subject to stated rules.▸ Mechanisms (10)
- Amendment and Notice Protocol — Forces every change to a rule through a fixed, published pathway with advance notice, so rules cannot be quietly rewritten mid-case or applied backward.
- Emergency Powers Sunset Clause — Grants extraordinary authority only with a built-in expiry date, so an emergency power dies automatically unless it is openly re-authorized.
- Equality Before Rules Test — Probes whether the same rule produces the same outcome across identity, rank, and status — including for the powerful — by comparing matched cases that differ only in who the actor is.
- Independent Review Board or Court — Stands up a body structurally separate from the rule-maker that can hear challenges, judge the authority against its own rules, and issue a binding ruling the authority cannot itself overturn.
- Policy-as-Code Guardrail — Compiles the rules into an automated check that every action must pass at execution time, so even privileged operators and self-modifying processes cannot act outside the rule without a signed, logged exception.
- Public Rule Registry — Maintains a single authoritative, openly readable catalog of the operative rules and exactly who they govern, so the rule in force is knowable in advance rather than held privately by the enforcer.
- Recusal and Conflict Screening — Checks each decision-maker for a personal stake in the matter before they act, and removes the conflicted one from the decision, so the enforcer is held to the same impartiality standard they impose on others.
- Rule Application Audit Log — Records, for every action taken, which specific rule authorized it and who invoked it — including the actions of the powerful — leaving a reviewable trace that no decision was rule-free.
- Supremacy Clause — Declares, in the founding rule itself, that the rules outrank and bind every entity inside a named domain — expressly including the rule-makers and enforcers — so no actor holds standing authority above them.
- Waiver Register — Keeps a standing, public ledger of every exception, waiver, and override granted against the rules — who got it, on what authority, and for how long — so deviations are visible and countable rather than quiet favors.
- Representation-Invariant Reasoning: Identify equivalent descriptions, isolate what remains invariant, choose convenient representatives without mistaking them for reality, and verify that conclusions survive legitimate changes of gauge, coordinates, basis, encoding, or frame.▸ Mechanisms (10)
- Canonical Representative Selection — Chooses one repeatable representative when a global regular canonical form genuinely exists.
- Coordinate or Basis Transformation — Translates quantities and relations between coordinate systems, frames, bases, or encodings.
- Cross-Representation Regression Suite — Runs the same cases through multiple encodings or implementations and compares invariant outputs over time.
- Gauge-Fixing Condition — Adds a disciplined representative-selection condition that removes specified redundant freedom without changing invariant content.
- Invariance Property Test — Checks that declared observables or decisions remain unchanged under admissible transformations.
- Invariant Observable Report — Publishes protected outputs separately from gauge-dependent intermediate values and conventions.
- Patchwise Atlas and Transition Map — Uses multiple local representatives and verified overlap transformations where one global gauge is singular or unavailable.
- Quotient-Space Construction — Represents the state space as equivalence classes rather than as every redundant description.
- Redundant-Variable Elimination — Removes non-identifiable directions after their transformation relationship and recovery path are established.
- Reference-Frame Sweep — Repeats analysis across selected frames or gauges to expose arbitrary-choice dependence.
- Symmetry Breaking for Differentiation: Deliberately break equivalence among similar options so roles, structure, or direction can emerge.▸ Mechanisms (8)
- Lead Role Selection — Ends diffusion of responsibility by naming a single accountable owner among equals, kept legitimate and revocable.
- Namespace Allocation — Carves a shared name-space into distinct, non-colliding slots so equivalent labels can coexist under unique identifiers.
- Random Assignment Lottery — Differentiates genuinely interchangeable options by an auditable random draw, so the break is fair precisely because no criterion favors anyone.
- Role Assignment Workshop — Turns interchangeable actors into a complementary set of bounded roles through a facilitated session that records boundaries, authority, and handoffs.
- Rotation or Sunset Review — Keeps a justified asymmetry from hardening into permanent privilege by rotating or sunsetting it on a schedule.
- Standard Selection Decision — Collapses several equivalent candidate standards into one canonical choice everyone adopts.
- Territory or Domain Allocation — Partitions an overlapping space into distinct owned territories so each actor has a clear, non-colliding domain.
- Tie-Breaking Rule — Resolves a deadlock among equivalent options by applying a pre-declared, deterministic criterion so a decision can proceed.
- Symmetry-Based Fairness: Treat equivalent cases equivalently unless a relevant asymmetry justifies different treatment.▸ Mechanisms (7)
- Anti-Discrimination Check — Holds a case fixed and flips only a protected characteristic — race, sex, religion, disability, age — to see whether treatment moves; a targeted symmetry test for the markers the law and ethics forbid from counting.
- Classification Fairness Review — Measures how a classification's errors — false inclusions and false exclusions — distribute across affected groups, exposing the burden and invisibility a formally neutral boundary can still produce.
- Consistency Audit — Measures decisions already made across reviewers, units, and time to surface unexplained variation — treatment that shifted when only the decider or the date changed, not the case.
- Equal-Treatment Checklist — A fixed set of questions a reviewer works through on every case — what treatment must stay invariant, what difference would justify departing, and what to record — so the same discipline lands on each decision as it is made.
- Exception Register — A living ledger of every approved waiver — with owner, rationale, compensating control, and expiry — so deviations stay visible and time-bound instead of quietly becoming the norm.
- Policy Symmetry Test — Interrogates a rule as written or as coded — would it hand equivalent cases different treatment when only an irrelevant feature changes? — to catch asymmetry and smuggled values in the policy itself, before a single case is decided.
- Precedent Analysis — Lines a current case up against specific prior decided cases and asks whether it is relevantly like them — so a decision rests on 'we handled the last one this way and nothing relevant has changed,' or an explicit, defensible distinction.
- Symmetry-Commuting Transformation Design: Design a mapping so meaningful transformations of the input are mirrored by corresponding transformations of the output rather than erased, amplified, or changed inconsistently.▸ Mechanisms (8)
- Commutative Diagram Review — Draws the two composition paths — transform-then-map and map-then-transform — as a diagram whose closure is the equivariance claim, surfaced before a line of code is written.
- Coordinate-Frame Consistency Check — Verifies that when the reference frame moves, geometric outputs transform by the same rigid motion — so a pose or velocity means the same thing in every frame.
- Data-Augmentation Equivariance Probe — Feeds randomly transformed inputs sampled across the valid transformation range and measures the statistical distribution of how far outputs drift from the correspondingly transformed baseline.
- Equivariance Tolerance Matrix — Tabulates, per transformation, the required exactness class and numeric tolerance so each symmetry gets a declared standard rather than an implicit one.
- Permutation Equivariance Audit — Checks that reordering or relabeling the input elements permutes the per-element outputs correspondingly while leaving genuinely order-independent results untouched.
- Schema and Label Relabeling Harness — Renames schemas, columns, and identifiers on the input and confirms every downstream output, log, and dashboard is rewritten by the same relabeling and otherwise unchanged.
- Symmetry Exception Register — Records the transformations where symmetry should deliberately break, with the boundary that triggers the exception, the reason, and the authority that approved it.
- Transformation-Pair Test Suite — Turns the commutation claim into repeatable, executable tests that compare the output of a transformed input against the correspondingly transformed baseline output, case by case.
Also a related prime in 14 archetypes
- Composable Relation Modeling: Model a domain by objects, typed arrows, and valid compositions so structure-preserving pathways can be reasoned about independently of object internals.
- Constraint Propagation and Decoupling: When constraints bind a problem into an unwieldy whole, propagate their implications first, then solve only the reduced and justified subproblems that remain.
- Equivalence Class Consolidation: Treat superficially different entities as equivalent when they share the relevant structure or function, reducing duplication and inconsistent handling.
- Geometric Primitives Vocabulary Constraint: Limit the available formal vocabulary to a small alphabet of primitive units, then create expressive range by composing, repeating, scaling, aligning, and transforming those units rather than adding new decorative forms.
- Hamiltonian Mechanics and Canonical Transformations: Transform a dynamic problem into a better paired-variable coordinate frame while preserving the structure that makes the original problem true.
- Independent Generating Set Design: Define the space and combination rules, then choose the smallest independent set of generators that covers it completely and yields stable, unique, transformable coordinates.
- Ornament-Function Integration and Structural Expression: Make ornament earn its place by carrying function, revealing structure, guiding use, or expressing the system’s logic.
- Overlap Exclusion Design: Declare which collections must not share members, then make that absence of overlap testable, maintained, and safe to rely on.
- Resummation and Nonperturbative Extrapolation: When a useful local expansion stops behaving like an ordinary convergent approximation, diagnose its information content, transform it into a more revealing representation, and validate any continuation before trusting it.
- Reversible Operation Structure Design: Design the admissible operations of a system as a closed, associative, identity-bearing, invertible structure so composition and reversal stay reliable.
Notes¶
This prime is the second element of the symmetry ↔ invariance Noether tight-pair (the "group" side of the pair). See invariance #9 for the reciprocal first-class abstraction (the "preserved quantity" side): every symmetry has invariants, every invariant belongs to some symmetry, and Noether's theorem[2] makes the correspondence explicit for continuous symmetries. The tight-pair is fully reciprocated across both primes' What It Is Not sections.
Secondary tight-pair relationship: symmetry ↔ duality (#17). An involutive duality (a pairing that returns the original when applied twice) is a Z/2 symmetry, and the fixed points of the involution are the "self-dual" elements. This is a weaker structural connection than the symmetry↔invariance pair — most dualities have richer structure than Z/2, and most symmetries are not dualities — but it is documented in both primes' What It Is Not sections.
Tertiary: symmetry ↔ symmetry_breaking (related prime, not in DP-03). Symmetry-breaking is the inverse move — the disappearance of a symmetry that reveals structure the symmetric state suppressed. A future DP batch that revises symmetry_breaking should reciprocate the tight-pair articulation on that side.
Origin-domain: v1 had mathematics primary with physics, art_aesthetics, and philosophy as alternates. V2 preserves this. The primary origin remains mathematics because the formal group-theoretic development (Galois, Lie, Klein, Weyl, Noether) is the canonical locus, even though the concept predates the formal theory.
Review flag origin_predates_discipline: symmetry as a concept long predates group theory — it appears in antiquity in art, architecture, and natural philosophy — but the modern structural abstraction (invariance under a group of transformations) is a nineteenth-century mathematical development. The flag is preserved.
References¶
[1] Galois, Évariste. "Mémoire sur les conditions de résolubilité des équations par radicaux." Unpublished 1831 memoir; posthumously published by Joseph Liouville in Journal de mathématiques pures et appliquées 11 (1846): 381–444. Established that a polynomial is solvable by radicals iff its associated permutation group (the Galois group) is solvable. Modern treatment: Edwards, Galois Theory (Springer, 1984); Stewart, Galois Theory, 4th ed. (CRC, 2015). registry ↩a ↩b
[2] Noether, Emmy. "Invariante Variationsprobleme." Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse (1918): 235–257. Established that every continuous symmetry of a Lagrangian corresponds to a conserved quantity. English translation: Tavel, M. A. "Invariant Variation Problems." Transport Theory and Statistical Physics 1, no. 3 (1971): 186–207. Definitive historical-mathematical treatment: Kosmann-Schwarzbach, The Noether Theorems (Springer, 2011). (Cross-linked to FACT-175 in symmetry.md and duality.md). registry ↩a ↩b ↩c ↩d ↩e ↩f
[3] Klein, Felix. "Vergleichende Betrachtungen über neuere geometrische Forschungen." Erlangen inaugural address, 1872 (Erlangen: Deichert, 1872). English translation: "A Comparative Review of Recent Researches in Geometry." Bulletin of the New York Mathematical Society 2 (1893): 215–249. Reformulated geometry as the study of properties invariant under a specified transformation group (Erlangen program). Historical reception: Hawkins, Emergence of the Theory of Lie Groups (Springer, 2000), ch. 3. (Cross-linked to FACT-174 in symmetry.md). registry ↩a ↩b ↩c
[4] Weyl, Hermann. Symmetry. Princeton: Princeton University Press, 1952. Canonical expository treatment covering discrete and continuous symmetries. Technical Lie-group treatment: Weyl, Gruppentheorie und Quantenmechanik (Leipzig: Hirzel, 1931); English translation The Theory of Groups and Quantum Mechanics (Dover, 1950). registry ↩
[5] Fedorov, E. S. "Симметрія правильныхъ системъ фигуръ" [Symmetry of Regular Systems of Figures]. Zapiski Imperatorskogo S.-Peterburgskogo Mineralogicheskogo Obshchestva [Proceedings of the Imperial St. Petersburg Mineralogical Society], ser. 2, 28 (1891): 1–146. Independent enumeration of the 230 three-dimensional crystallographic space groups. Consolidated treatment: Burckhardt, Die Bewegungsgruppen der Kristallographie (Birkhäuser, 1966); Senechal, Quasicrystals and Geometry (Cambridge UP, 1995). registry ↩
[6] Schoenflies, Arthur. Krystallsysteme und Krystallstructur. Leipzig: Teubner, 1891. Lie-group-theoretic enumeration of the 230 space groups, independent of and contemporaneous with Fedorov 1891. Modern tables: Hahn, Theo, ed. International Tables for Crystallography, Vol. A: Space-Group Symmetry, 5th ed. (Springer, 2002). registry ↩
[7] Pólya, George. "Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen." Acta Mathematica 68 (1937): 145–254. Enumeration theorem counting configurations up to symmetry. Precedence: Redfield, J. H. "The Theory of Group-Reduced Distributions." American Journal of Mathematics 49 (1927): 433–455 (some modern sources use "Redfield–Pólya"). English combined edition: Pólya and Read, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds (Springer, 1987). registry ↩a ↩b
[8] Anderson, P. W. (1963). "Plasmons, Gauge Invariance, and Mass." Physical Review, 130(1), 439-442. Connection between gauge invariance, Goldstone bosons, and mass acquisition; precursor to understanding Higgs mechanism in field-theoretic context. registry ↩a ↩b
[9] Higgs, Peter W. "Broken Symmetries and the Masses of Gauge Bosons." Physical Review Letters 13, no. 16 (1964): 508–509. See also Higgs, "Broken Symmetries, Massless Particles and Gauge Fields." Physics Letters 12, no. 2 (1964): 132–133. Independent contemporaneous papers: Englert and Brout, Physical Review Letters 13, no. 9 (1964): 321–323; Guralnik, Hagen, and Kibble, Physical Review Letters 13, no. 20 (1964): 585–587. 2013 Nobel Prize in Physics: Englert and Higgs. registry ↩
[10] Babai, László. "Graph Isomorphism in Quasipolynomial Time." Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC 2016), pp. 684–697; preprint arXiv:1512.03547 (December 2015; revised 2017 after correction of an error identified January 2017). Established quasi-polynomial-time algorithm for graph isomorphism; polynomial-time remains open as of 2025. registry ↩