| 1. Domain | 1.1 Scope of the Domain | Boundaries | The range of phenomena the science includes and excludes. | Studies sets equipped with a single associative binary operation with identity and inverses. Includes abstract groups, symmetry groups, permutation groups, matrix groups, quotient groups, group actions, and homomorphisms. Excludes non-associative algebraic systems unless viewed via group-like abstractions. |
| | Scale | The spatial, temporal, or organizational level at which the science operates (e.g., quantum, cellular, social, cosmic). | Operates at structural, algebraic, and combinatorial scales: finite groups, infinite groups, local vs. global structure, discrete symmetry operations, continuous Lie groups, and geometric/algebraic actions. |
| 1.2 Ontological Commitments | Entities | The kinds of things assumed to exist within the domain (particles, organisms, agents, fields, etc.). | Group elements, identity element, inverses, group operations, subgroups, cosets, quotient groups, homomorphisms, automorphisms, group actions, generators, relations, conjugacy classes. |
| | Properties | The fundamental attributes these entities possess (mass, charge, genotype, preference, etc.). | Associativity, identity, invertibility, closure, order of element, group order, normality, commutativity (in Abelian groups), conjugation properties, homomorphic images/kernels, orbit and stabilizer properties. |
| | Categories | The basic ontological types used to classify domain elements (substances, processes, relations, structures). | Finite groups, infinite groups, Abelian groups, non-Abelian groups, cyclic groups, permutation groups, matrix groups, Lie groups, free groups, simple groups, solvable groups, nilpotent groups, direct and semidirect products. |
| 1.3 State-Variables | Variables | The measurable or definable properties that describe system conditions. | Current group element or tuple, generating set, subgroup chosen, action domain, representation matrix, structure constants, order of elements, conjugacy class index, kernel/image of a homomorphism. |
| | Parameterization | How variables encode and represent the system’s state. | Encoded by generators and relations (presentations), multiplication tables, permutation notation, matrix representations, Lie algebra parameters, Cayley graphs, or group actions on sets/spaces. |
| 1.4 Admissible Idealizations | Simplifications | Conceptual reductions used to make the domain tractable (point masses, rational agents, perfect gases). | Treating groups via generators/relations rather than full structure; using abstract groups instead of concrete realizations; idealizing infinite groups via finitely presented approximations; ignoring topological or analytic structure when focusing purely algebraically. |
| | Validity Conditions | The limits and contexts in which idealizations hold or break down. | Breakdown occurs when analytic/topological properties are essential (Lie groups, p-adic groups); when finite presentations fail to capture infinite complexity; when ignoring torsion, topology, or geometry invalidates structural theorems. |
| 1.5 Domain Assumptions | Structural Assumptions | Background ontological stances such as determinism, continuity, randomness, discreteness. | Group axioms universally hold; homomorphisms preserve structure; subgroup/quotient relations are well-defined; conjugation respects structural relations; group actions encode symmetry faithfully; presentations meaningfully describe abstract structure. |
| | Implicit Commitments | Unstated but necessary assumptions that shape the field’s conceptual structure. | Assumes associativity always holds exactly; assumes invertibility exists for all elements; assumes algebraic structure determines symmetry behavior; assumes generating sets and relations sufficiently capture structural properties. |
| 1.6 Internal Coherence Requirements | Consistency | The demand that domain concepts do not contradict one another. | Group axioms must not conflict; subgroup and quotient constructions must preserve the axioms; presentations must not contradict associativity; homomorphisms must preserve identity/inverses; structural theorems (e.g., isomorphism theorems) must remain coherent. |
| | Compatibility | The requirement that entities, variables, and assumptions fit together into a unified descriptive framework. | Requires harmony among group operation, subgroup structure, quotient formation, group actions, representation frameworks, and categorical properties (functoriality, universal constructions). |
| 2. Evidence Layer | 2.1 Observable Phenomena | Observables | The aspects of the domain that can produce detectable signals accessible to measurement. | Multiplication behavior of elements; subgroup inclusions; coset decompositions; conjugacy patterns; element orders; orbit–stabilizer behavior under group actions; kernel/image under homomorphisms; eigenvalue structures for matrix groups. |
| | Detection Limits | The boundaries of what can be resolved or sensed by current instruments or methods. | Limited by size and complexity of groups (e.g., very large finite groups); inability to enumerate infinite groups; impossibility of fully classifying all groups of large order; computational limits in detecting normality, solvability, or simplicity for large structures. |
| 2.2 Measurement Systems | Units | Standardized quantifications (meters, seconds, volts, decibels, dollars, etc.) necessary for consistent comparison. | Group order; element order; index of subgroup; dimension (for Lie groups); number of generators; length of relation words; degree of permutation representation; matrix size in linear representations. |
| | Instruments | Devices and tools (microscopes, spectrometers, sensors, surveys, detectors) used to produce measurements. | Cayley table analyzers; permutation group algorithms; matrix representation systems; computational algebra systems (GAP, Magma); automorphism-group calculators; homomorphism finders; orbit–stabilizer computation tools. |
| 2.3 Operational Definitions | Definitions | Terms defined by specific measurement procedures, ensuring empirical clarity. | Subgroup defined via closure under group operation; normality defined via conjugation invariance; homomorphism defined via operation preservation; group action defined via structure-preserving map; element order defined via minimal exponent returning identity. |
| | Procedures | The explicit steps required to perform a measurement in a reproducible way. | Computing Cayley tables; testing closure; checking conjugacy; constructing subgroup lattices; computing kernels/images; calculating orbits and stabilizers; computing generators; performing matrix multiplications for representations. |
| 2.4 Data Acquisition | Protocols | Formal processes for gathering data under controlled or standardized conditions. | Standardized enumeration of small groups; structured classification protocols for finite groups; controlled generation of presentations; canonical reduction of relations; systematic orbit–stabilizer computations; use of normal-form algorithms for matrix groups. |
| | Sampling | Rules determining which subset of the domain is measured and how representative it is. | Sampling groups by order; selecting representative subgroups; sampling conjugacy classes; testing random generating sets; selecting permutation or matrix representations; sampling word relations in finitely presented groups. |
| 2.5 Data Character & Format | Data Types | The form raw evidence takes (time series, spectra, images, counts, qualitative records). | Cayley tables; generator/relator lists; subgroup lattices; permutation-cycle structures; matrix representations; orbit partitions; conjugacy class partitions; character tables (when applicable). |
| | Resolution | The granularity or precision with which data is captured. | Determined by granularity of generators/relations, fineness of subgroup-lattice computation, precision of matrix entries, detail in permutation decompositions, and completeness of Cayley table information. |
| 2.6 Reliability & Calibration | Calibration | Adjustment procedures ensuring instruments produce accurate results. | Checking associativity across samples; verifying closure and inverses; validating normality conditions; cross-checking computational results across different algebra systems; ensuring consistency of matrix and permutation representations. |
| | Error Characterization | Identification and quantification of noise, uncertainty, bias, and measurement error. | Miscomputed products; incorrect conjugacy tests; mistaken subgroup identification; faulty generator sets; numeric instability in matrix computations; mistaken orbit computations; inaccuracies in character tables. |
| 3. Structural Layer | 3.1 Patterns & Regularities | Laws / Relations | Stable, repeatable patterns governing how observables behave across conditions. | Group operation is associative; inverses behave predictably; subgroup relations follow lattice laws; conjugacy relations stratify structural behavior; group actions satisfy orbit–stabilizer relations; homomorphisms obey kernel/image structure; isomorphism theorems govern factorization. |
| | Invariants | Quantities or properties that remain constant under transformations (symmetries, conservation laws). | Group order; element order; conjugacy class sizes; index of subgroups; normality; commutator structure; invariance under isomorphism; center and derived subgroup; invariants of group actions (orbit size, stabilizer size). |
| 3.2 Causal Architecture | Mechanisms | Underlying processes or structures that produce the observed regularities. | Conjugation generating symmetry transformations; subgroup generation mechanisms via closure; homomorphic collapse via kernel; factorization via quotienting; group actions producing orbits; commutators generating non-Abelian structure; semidirect product mechanisms forming composite groups. |
| | Pathways | Organized sequences of interactions forming a causal chain or network. | Element → subgroup generated → normality check → quotient construction; generator set → relation reduction → group presentation; action → orbit/stabilizer → structural classification; morphism → kernel/image → isomorphism theorem applications. |
| 3.3 Theoretical Vocabulary | Concepts | Core terms that encode the domain’s structure (force, gene, equilibrium, field). | Group, identity, inverse, subgroup, coset, normal subgroup, quotient group, homomorphism, automorphism, conjugation, commutator, group action, orbit, stabilizer, generator, presentation. |
| | Classifications | Taxonomies, categories, or typologies that organize entities and relations. | Abelian vs. non-Abelian; finite vs. infinite; cyclic, dihedral, symmetric, alternating; simple groups; solvable and nilpotent groups; Lie groups; free groups; direct and semidirect products; torsion vs. torsion-free groups. |
| 3.4 Formal Representations | Equations | Mathematical constructs expressing laws, relations, or mechanisms. | Group axioms: (a·b)·c = a·(b·c), e·a = a, a⁻¹·a = e; conjugation equation: g⁻¹ag; homomorphism property: φ(ab) = φ(a)φ(b); orbit–stabilizer equation: |
| | Models | Structured representations—mathematical, computational, or conceptual—used to predict and explain phenomena. | Cayley tables; permutations representing group elements; matrices for linear groups; Cayley graphs; group presentations (generators/relations); Lie group manifolds; automorphism groups; character tables (in representation contexts). |
| 3.5 Idealized Structures | Simplified Models | Purposeful abstractions that capture essential dynamics while omitting irrelevant detail. | Finitely presented groups; small-order groups; groups generated by two elements; Abelian approximations; ignoring topological structure for abstract groups; simplified presentations in computational settings. |
| | Limit Conditions | Regimes where specific models or approximations hold (classical vs. quantum, linear vs. nonlinear). | Simplifications fail for infinite, non-finitely presented groups; Lie groups require topology/analysis; character theory needs finiteness; combinatorial models fail for continuous groups; presentation may not capture deep structure in highly non-Abelian groups. |
| 3.6 Integrative Frameworks | Unifying Theories | Higher-order structures that connect disparate laws or mechanisms under a coherent whole. | Isomorphism theorems; classification of finite simple groups; group actions as a unifying language; representation theory linking groups to linear algebra; Lie theory connecting groups to differential geometry; universal properties in category theory. |
| | Interdisciplinary Links | Points where the theory connects to adjacent sciences or larger explanatory systems. | Physics (symmetry, conservation laws); geometry (isometries, transformation groups); combinatorics (permutations, counting orbits); number theory (Galois groups); topology (fundamental groups); computer science (automata groups, cryptography). |
| 4. Method Layer | 4.1 Inquiry Design | Experimental Design | Structured plans for manipulating variables to test causal claims. | Manipulating generating sets, altering group presentations, varying action domains, modifying homomorphisms, testing subgroup and normality conditions, introducing or removing relations, and exploring structural changes through quotient formation or direct/semidirect products. |
| | Observational Design | Systematic approaches for gathering non-manipulated data (surveys, field studies, natural experiments). | Observing natural subgroup formation, conjugation patterns, orbit–stabilizer behavior, kernel and image behavior under given homomorphisms, matrix-group dynamics, or permutation-group behavior without structural modification. |
| 4.2 Testing & Validation | Hypothesis Testing | Procedures for evaluating whether evidence supports or contradicts specific claims. | Testing normality via conjugation; verifying homomorphisms preserve operations; checking whether a proposed subgroup is closed; testing solvability or nilpotency via derived or central series; validating isomorphisms; testing group action transitivity. |
| | Replication | The requirement that results be independently reproducible under similar conditions. | Recomputing conjugacy classes; re-running subgroup generation; replicating group-action orbit decompositions; recomputing kernels and images under different computational tools; verifying normal forms of matrix or permutation representations. |
| 4.3 Inference & Evaluation | Statistical Inference | Rules for drawing conclusions from noisy or incomplete data. | Analyzing distribution of element orders; evaluating random generating sets; assessing frequency of normal subgroups across sampled groups; comparing orbit sizes; studying empirical patterns of conjugacy or representation behavior. |
| | Model Comparison | Criteria (fit, simplicity, predictive accuracy, robustness) used to evaluate competing models. | Comparing different presentations of the same group; comparing permutation vs. matrix representations; contrasting finite groups of the same order; comparing solvable vs. simple groups; evaluating the effectiveness of computational models (Cayley tables, generators/relations). |
| 4.4 Error Management | Error Analysis | Identification and quantification of random and systematic errors. | Detecting incorrect products, miscomputed conjugates, faulty subgroup identification, incorrect generators, misapplied homomorphisms, numerical instability in matrix computations, or wrong orbit partitions. |
| | Bias Control | Methods for minimizing subjective, instrumental, or procedural biases. | Avoiding biased generator choices; preventing selective inspection of “nice” subgroups; ensuring unbiased sampling of elements or conjugacy classes; avoiding reliance on one representation when comparing structural properties. |
| 4.5 Adjudication & Revision | Peer Scrutiny | Collective evaluation of claims through critique, review, and debate. | Verifying subgroup proofs; reviewing homomorphism correctness; auditing isomorphism claims; checking derived and central-series computations; evaluating classification claims; cross-checking character tables or representation decompositions. |
| | Theory Revision | Procedures for modifying, replacing, or discarding models based on new evidence. | Revising presentations, updating generating sets, correcting subgroup classifications, refining action definitions, modifying structural hypotheses, or integrating new results from classification and representation theory. |
| 4.6 Integrity Conditions | Transparency | Requirements to disclose methods, data, assumptions, and limitations. | Fully disclosing group presentations, computational methods, generation procedures, subgroup-testing logic, representation choices, and assumptions underlying structural claims. |
| | Ethical Standards | Norms ensuring responsible conduct in experimentation, data handling, and publication. | Honest reporting of computational and theoretical results; avoiding hidden assumptions; ensuring reproducibility of group computations; acknowledging limits of classification; properly attributing results in group-theoretic analysis. |