The Ladder of Isomorphism G: Syntactic Isomorphism —Structure Preservation in Symbol Substitution

This paper reinterprets the theoretical status of grammatical rules. The tradi
tional view regards grammar as a licensing list of legitimate symbol combinations;
this paper argues that grammar is essentially the automorphism group of a symbol
system under substitution operations. By reconstructing the grammar of a formal
language as a structure-preserving map on the category of symbols, it is proved
that a well-formed string is exactly an element whose orbit under automorphisms
is closed, whereas an ill-formed string corresponds to an element that breaks the
isomorphic structure. To overcome the fundamental mathematical obstacle that
production rules are generally irreversible, this paper constructs a historical ex
tension category that embeds the irreversible production system into a reversible
groupoid, and strictly defines the automorphism group together with a forgetful
projection operator on this extension. The necessary and sufficient condition for
grammatical well-formedness is thus rigorously expressed as the preservation of the
generative structure of the system under substitution operations within the group
completed framework. For hierarchical grammar systems, it is further shown that
higher-level grammars must be history-preserving extensions of lower-level ones,
and the transitivity of hierarchical accumulation is guaranteed by projection com
patibility. This framework elevates grammar from an empirical rule compilation
to a mathematical object with an axiomatic foundation, providing a unified struc
turalist ground for formal language theory.