The Transitive Permutation Group
The transitive permutation group is the 9th transitive subgroup of the symmetric group (acting on 8 points) in the database of transitive groups. It is known to be isomorphic to the direct product of the dihedral group of order 8 and the cyclic group of order 2 ().
Model A
In Model A, we have a set of 8 functions (labelled points) and a set
of 8 information metabolism elements (IMEs) occupying . The group which comprises the classical intertype relations acts on functions transitively by permuting them in specific ways depending on the action applied (i.e. the relationship that acts on Model A by permuting its set of functions). For instance, the kindred relationship exchanges functions 2 and 4, but also functions 6 and 8. Therefore, we can denote this as . An order 4 relationship like the supervisee shifts functions 1-4 as well as functions 5-8, cyclically, which can be expressed as .
can be described as the group generated by certain permutations such as , , and . That is, , , etc. From these generators, it follows directly that this permutation group is isomorphic to , that acts on 8 points, and hence Model A realises the transitive permutation group .
The Transitive Permutation Group
The transitive permutation group is the 2nd transitive subgroup of the symmetric group (acting on 8 points) in the database of transitive groups. It is known to be isomorphic to the direct product of the cyclic groups of orders 2 and 4 (, respectively).
Model G
In Model G, we have a set of 8 functions (labelled points) and a set
of 16 monadic (signed) elements, half of which occupy , depending on whether a type is Process or Result. The set of functions is acted on by the index-2 subgroup of that describes Process/Result, for which we’ll denote , and is isomorphic to . acts on functions in specific ways depending on the action applied, for a particular type .
Like with , can be described by certain permutations such as for order 4 relationships and for order 2 relationships. From these generators, it follows directly that this permutation group is isomorphic to , that acts on 8 points, and hence Model G realises the transitive permutation group , when restricted to a single orbit.
Since Model-G does not model all elements of the full socion for a type , the construction of Model G layouts for both process and result types, for which we’ll denote and , respectively, are needed to represent all information in the Socion. Thus, Model-G can be formally understood as with acting on , the selector dichotomy (Process/Result) acting on and no group action mixing the two.
Alternate Interpretations of Model A (Systems of Injections)
The set is sometimes substituted for the set , and consequently the acting group on Model A is no longer , but an index-2 subgroup of it. For example, in the School of Classical Socionics (SCS), the set of functions is acted on by (Process/Result), so in this sense Models A and G are isomorphic (both groups). However, in the School of System Socionics (SSS), the set of functions is acted on by the Asking/Declaring subgroup, which is isomorphic to (the dihedral group of order 8). In this sense, Model A can be can be decomposed into the two orbits of , one of which can be described as the transitive permutation group , which is a subgroup of and is isomorphic to .
Finally, the ‘Presence Cube’ model demonstrates the constructed vector space on Model A. has size so we can construct a dichotomy system on it. There are only two order 8 subgroups of , which are isomorphic to the vector space , namely Democratic/Aristocratic and Irrational/Rational, denoted and . Of the two, only acts transitively on (e.g. Ne can occur in any position in a Democratic type), and the actions of on are faithful to . In this sense, this construction of Model A can be can be decomposed into the two orbits of , one of which can be described as the transitive permutation group , which is a subgroup of and is isomorphic to .
Technical note: Systems of injections (charge models with only 8 functions) are best viewed as orbit models. Any compatible index-2 subgroup acts transitively on a single orbit of size 8 (hence an label applies). The full charge construction is an intransitive -set with two orbits; it is not itself an object unless extended by a sheet-swapping element, yielding a transitive action.
What counts as an acceptable system of injections?
An acceptable system of injections on Model A must arise from an index-2 subgroup of corresponding to a supralocal dichotomy. These include Democratic/Aristocratic, Asking/Declaring, Process/Result, and Positivist/Negativist.
The reason for this restriction is structural. Each information element admits a decomposition into its associated monadic elements in , and any admissible injection must preserve this correspondence. Equivalently, for every function in , either the unsplit element or exactly one of its associated monadic refinements must be present, uniformly across all types.
Index-2 subgroups not associated with supralocal dichotomies (these are the general dichotomies, which when intersected define the ‘Temperament’ tetrachotomy) fail to satisfy this condition, as they induce splittings that cannot be reconciled with the monadic decomposition of elements in . Consequently, no other index-2 subgroup of satisfies the uniform monadic-refinement constraint above.
Function Dichotomies
Classical
Model A
Model G
Gulenko-Newman
Model A
Model G
The Conceptual Contrast between Model A and Model G
Model A is a surjective coset model: functions correspond to cosets of the ‘kindreds’ subgroup of , hence 8 IMEs. However, Model G is an injective refinement model: functions receive monadic elements via selector-controlled injections.
The Orbit-Stabiliser Theorem
Let be a group which acts on a finite set .
Let .
Let denote the orbit of .
Let denote the stabiliser of by .
Let denote the index of in .
Then:
Systems of Injections
Let act intransitively on a finite set containing 16 points with two different orbits, which are the cosets of an index-2 subgroup , and thus the orbit size is . A set of mapped functions is denoted where and are the cosets of . Since an information element decomposes into two monadic elements, which are cosets of the kindred subgroup , the stabiliser subgroup when is the Base Function of Model A will also be the subgroup , and this applies to all accepting functions as applying the kindred operator would fix the functions 1, 3, 5, and 7, and applying the lookalike operator would fix functions 2, 4, 6 and 8, and only changing the charge of the element in systems of injections. So, for producing functions, the stabiliser subgroup is . because . So for odd positions, the stabiliser is conjugate to , whereas for even positions, the stabiliser is conjugate to .
References / Further Reading
- https://sedecology.com/math
- A Representation-Theoretic Framework for Intertype Relations in Socionics
- https://people.maths.bris.ac.uk/~matyd/GroupNames/T31.html
- https://sedecology.blogspot.com/2020/07/the-presence-cube.html
- https://varlawend.blogspot.com/2023/06/encyclopedia-of-model-g-and-model.html