Weak Group Theory: A Theory of External Symmetry and the Morphogenesis of Mathematical Objects

# Weak Group Theory: 

### I. The Foundational Problem: From Internal to External Symmetry

Classical mathematics has long been dominated by the study of **internal symmetry**—the transformations that preserve a given mathematical object. Galois theory studies permutations of roots that preserve algebraic relations over a base field. Differential Galois theory studies automorphisms of solution spaces that preserve the differential structure. Representation theory studies homomorphisms from a group into the automorphism group of a vector space. In every case, the central object is $$ \mathrm{Aut}(X) $$: the group of structure-preserving transformations of $$ X $$.

This paradigm has been extraordinarily successful. Yet it has also created a systematic blind spot: **what happens when we transform not the object itself, but its presentation?**

Consider a polynomial $$ f(x) = a_0 + a_1 x + \cdots + a_n x^n $$. Classical Galois theory permutes its roots while holding the coefficients fixed. But what if we permute the coefficients themselves—reassigning the numerical values $$ a_i $$ to different powers $$ x^i $$—while keeping both the coefficient multiset and the monomial basis fixed? This operation generally produces a **new polynomial** $$ f^\sigma(x) $$, with different roots, different Galois group, and different analytic properties.

This simple observation—which was noted, in passing, by Galois, Klein, and Poincaré—was never developed into a general theory. The reasons are historical and conceptual: the mathematical community was focused on solving equations and classifying structures, not on studying how structures change under external re-assignment. Moreover, the operation was dismissed as "trivial" because it did not preserve the object.

This work argues that this dismissal was premature. The operation of permuting coefficients while holding positions fixed is not a triviality; it is the first example of a **weak action**, and it generates a rich theory of **external symmetry**—a theory that is dual to classical group theory, not subordinate to it.

---

### II. The Core Innovation: Weak Actions and External Symmetry

Let $$ X $$ be a mathematical object presented as a pairing between:

- **Atoms**: a multiset of coefficient-like data $$ \{c_1, \ldots, c_n\} $$;
- **Slots**: a set of positions, exponents, basis elements, or structural locations $$ \{s_1, \ldots, s_N\} $$;
- **A pairing relation** $$ R \subseteq \mathrm{Atoms} \times \mathrm{Slots} $$ that determines how the atoms are placed into the slots to realize the object.

A **weak action** is a permutation of the atoms (or, more generally, of the entire pairing space) while holding the slots fixed. This is **not** a permutation of the object's internal structure; it is a permutation of the object's **presentation data**.

The fundamental distinction is:

| Classical Group Theory (Internal Symmetry) | Weak Group Theory (External Symmetry) |
| :--- | :--- |
| Studies $$ \mathrm{Aut}(X) $$: transformations that **preserve** $$ X $$ | Studies the orbit $$ \{X^\sigma\} $$: transformations that **generate** new objects from $$ X $$ |
| Acts on the object itself | Acts on the **pairing** between atoms and slots |
| Conserves structure | Conserves atoms, changes pairing |
| Classification of symmetries | Classification of **morphogenesis** (how objects arise from assemblies) |

This duality is the philosophical cornerstone of the entire five-volume work.

---

### III. Volume I: Phenomenology of Weak Coefficient Actions

**Position in the Architecture**: Data layer—the concrete instances that motivate the abstract theory.

Volume I establishes the basic phenomenon across multiple mathematical domains, demonstrating that weak actions are not an isolated curiosity but a ubiquitous operation.

#### 1. Power Series (Part I)

For $$ f(x) = \sum_{n=0}^\infty a_n x^n $$, a permutation $$ \sigma \in \mathfrak S_{\mathbb N} $$ defines:

$$
f^\sigma(x) = \sum_{n=0}^\infty a_{\sigma(n)} x^n.
$$

The radius of convergence is not invariant:

$$
R(f^\sigma) = \left( \limsup_{n\to\infty} |a_{\sigma(n)}|^{1/n} \right)^{-1}.
$$

Finite-support permutations preserve the radius and change the value at $$ x_0 \in \mathbb Q $$ by a finite rational correction:

$$
f^\sigma(x_0) = f(x_0) + r_\sigma, \quad r_\sigma \in \mathbb Q.
$$

This yields the **Finite-Support Arithmetic Theorem**: irrationality and transcendence are preserved under finite weak actions.

**Proof Sketch**: If $$ \sigma $$ has finite support, choose $$ N $$ such that $$ \sigma(n) = n $$ for all $$ n > N $$. Then:

$$
\begin{aligned}
f^\sigma(x_0) - f(x_0) &= \sum_{n=0}^{N} a_{\sigma(n)} x_0^n - \sum_{n=0}^{N} a_n x_0^n \\
&= \sum_{n=0}^{N} (a_{\sigma(n)} - a_n) x_0^n \in \mathbb Q.
\end{aligned}
$$

Thus $$ f^\sigma(x_0) = f(x_0) + r_\sigma $$ with $$ r_\sigma \in \mathbb Q $$. If $$ f(x_0) $$ is irrational (respectively transcendental) and $$ r_\sigma \in \mathbb Q $$, then $$ f^\sigma(x_0) $$ is also irrational (respectively transcendental).

#### 2. Exponential Family

For $$ t \in \mathbb Q \setminus \{0\} $$, the exponential seed is:

$$
e^t = \sum_{n=0}^{\infty} \frac{t^n}{n!}.
$$

For a finite-support permutation $$ \sigma $$:

$$
E_\sigma(t) = \sum_{n=0}^{\infty} \frac{t^n}{\sigma(n)!} = e^t + r_\sigma, \quad r_\sigma \in \mathbb Q.
$$

Thus $$ E_\sigma(t) $$ is transcendental for every finite-support $$ \sigma $$.

#### 3. Polynomial Equations (Part II)

For $$ f(x) = x^n + a_{n-1}x^{n-1} + \cdots + a_0 $$, coefficient permutations produce:

$$
f^\sigma(x) = x^n + a_{\sigma(n-1)}x^{n-1} + \cdots + a_{\sigma(0)}.
$$

The discriminant transforms:

$$
\Delta(f^\sigma) = \Delta(a_{\sigma(0)}, \ldots, a_{\sigma(n-1)}).
$$

Galois groups are not invariant; a solvable equation can become non-solvable under weak action, and vice versa. For example, the polynomial $$ x^3 + 2x^2 + 3x + 4 $$ has Galois group $$ \mathfrak S_3 $$, while its coefficient permutation $$ (a_0, a_1, a_2) \mapsto (2, 4, 3) $$ yields $$ x^3 + 3x^2 + 4x + 2 = (x+1)(x^2+2x+2) $$, which is reducible over $$ \mathbb Q $$.

#### 4. Differential Operators (Part III)

For $$ L = \partial^n + a_{n-1}\partial^{n-1} + \cdots + a_0 $$, weak actions permute the coefficient functions. The differential Galois group changes. The Airy operator $$ \partial^2 - t $$ has Galois group $$ SL_2(\mathbb C) $$; its weak transpose:

$$
L^\tau = \partial^2 - t\partial
$$

satisfies $$ L^\tau(y) = 0 \Rightarrow y' = C e^{t^2/2} $$, so $$ y = C \int e^{t^2/2} dt + D $$, which is solvable by quadratures. Thus a non-solvable equation becomes solvable under weak action.

#### 5. Modular Forms and L-Functions (Part VI)

For a modular form $$ f(q) = \sum_{n=0}^{\infty} a_n q^n $$, a weak action permutes the Fourier coefficients:

$$
f^\sigma(q) = \sum_{n=0}^{\infty} a_{\sigma(n)} q^n.
$$

Hecke multiplicativity is generally destroyed. For coprime $$ m, n $$:

$$
a_{mn} = a_m a_n \quad \text{(Hecke relation)}.
$$

After permutation, this becomes:

$$
a_{\sigma(mn)} = a_{\sigma(m)} a_{\sigma(n)},
$$

which generally fails. Finite-support permutations preserve meromorphic continuation by adding a finite Dirichlet polynomial.

#### 6. Arithmetic Geometry (Part VII)

For a smooth projective variety $$ X/\mathbb F_q $$, the Frobenius polynomial in degree $$ i $$ is:

$$
P_i(X,T) = \det(1 - \operatorname{Frob}_q T \mid H^i_{\mathrm{\acute et}}(X_{\overline{\mathbb F}_q}, \mathbb Q_\ell)) = 1 + c_{i,1}T + \cdots + c_{i,b_i}T^{b_i}.
$$

A weak action permutes the coefficients:

$$
P_i^\sigma(X,T) = 1 + c_{i,\sigma(1)}T + \cdots + c_{i,\sigma(b_i)}T^{b_i}.
$$

The Weil root-weight condition requires that the reciprocal roots have complex absolute value $$ q^{i/2} $$. This is not preserved. For $$ q=2 $$, the polynomial:

$$
P(T) = 1 + T + 2T^2
$$

has roots of absolute value $$ 2^{-1/2} $$. Its coefficient-swapped version:

$$
P^\sigma(T) = 1 + 2T + T^2 = (1+T)^2
$$

has roots of absolute value $$ 1 $$. Thus the Weil condition is destroyed.

**Conclusion of Volume I**: Weak actions are omnipresent in mathematics, and their systematic study is long overdue.

---

### IV. Volume II: Geometry of Weak Orbits

**Position in the Architecture**: Spatial layer—elevating individual weak transforms to global geometric objects.

If weak actions generate orbits of objects, then the natural next step is to study these orbits **geometrically**.

#### 1. Aggregate Polynomials

Given a weak orbit $$ \{f^\sigma(x)\}_{\sigma \in G} $$, define the aggregate polynomial:

$$
F(x) = \prod_{\sigma \in G} f^\sigma(x).
$$

This aggregate polynomial is invariant under the weak group: for every $$ \tau \in G $$:

$$
F^\tau(x) = \prod_{\sigma \in G} f^{\tau\sigma}(x) = \prod_{\rho \in G} f^\rho(x) = F(x).
$$

Its coefficients are symmetric polynomials in the original coefficients.

#### 2. Aggregate Solution Schemes

The zero set of $$ F(x) $$ is the union of the root sets of all orbit polynomials. Vieta's theorem applied to $$ F $$ gives the **Macro-Vieta Theorem**: the elementary symmetric functions of the aggregate root multiset are weak invariants.

If $$ F(x) = x^N + C_{N-1}x^{N-1} + \cdots + C_0 $$, then each $$ C_j $$ is a polynomial in the original coefficients $$ a_0, \ldots, a_{n-1} $$ invariant under the weak group:

$$
C_j(a_{\sigma(0)}, \ldots, a_{\sigma(n-1)}) = C_j(a_0, \ldots, a_{n-1}).
$$

By the fundamental theorem of symmetric polynomials:

$$
C_j \in \mathbb Q[e_1(a), \ldots, e_n(a)],
$$

where $$ e_i(a) $$ are the elementary symmetric functions of the coefficient multiset.

#### 3. Aggregate Differential Operators

For linear differential operators, aggregation is the **least common left multiple (lclm)**:

$$
L_{\mathrm{agg}} = \operatorname{lclm}\{L^\sigma : \sigma \in G\}.
$$

Its solution space is the span of the solution spaces of all orbit operators:

$$
\mathcal S(L_{\mathrm{agg}}) = \operatorname{span}_{\mathbb C} \bigcup_{\sigma \in G} \mathcal S(L^\sigma).
$$

The labelled aggregate solution space is:

$$
\mathcal S_{\mathrm{lab}} = \bigoplus_{\sigma \in G} \mathcal S(L^\sigma),
$$

which has dimension $$ n|G| $$, while the internal aggregate may have smaller dimension if solutions overlap.

#### 4. Aggregate L-Functions

For Dirichlet series, aggregation is **Dirichlet convolution**. For $$ L(s) = \sum_{n=1}^{\infty} a_n n^{-s} $$:

$$
L_{\mathrm{agg}}(s) = \prod_{\sigma \in G} L^\sigma(s) = \sum_{n=1}^{\infty} A_n n^{-s},
$$

where:

$$
A_n = \sum_{d_1d_2\cdots d_{|G|}=n} a_{\sigma_1(d_1)} a_{\sigma_2(d_2)} \cdots a_{\sigma_{|G|}(d_{|G|})}.
$$

#### 5. Discriminant Arrangements

The weak discriminant arrangement:

$$
\Delta_{\mathrm{weak}} = \bigcup_{\sigma \in G} \Delta(f^\sigma)
$$

is a union of hypersurfaces, invariant under the weak group. It records all ways in which some orbit member becomes singular.

For the quadratic case $$ f(x) = x^2 + a_1 x + a_0 $$:

$$
\Delta(f) = a_1^2 - 4a_0,
$$
$$
\Delta(f^\tau) = a_0^2 - 4a_1.
$$

Thus:

$$
\Delta_{\mathrm{weak}} = \{a_1^2 = 4a_0\} \cup \{a_0^2 = 4a_1\}.
$$

#### 6. Moduli and Quotients

The coarse quotient $$ \mathbb A^n / \mathfrak S_n $$ classifies coefficient multisets. The quotient stack:

$$
[\mathbb A^n / \mathfrak S_n]
$$

remembers stabilizers and is the correct object for weak moduli theory.

**Conclusion of Volume II**: Aggregation turns external symmetry into internal geometry. The weak orbit becomes a single geometric object whose symmetries encode the original external action.

---

### V. Volume III: The Categorical Engine—Conservation and Expansion

**Position in the Architecture**: Functorial layer—abstracting the operations of Volume II into a general categorical framework.

Volume II constructed aggregates case-by-case. Volume III extracts the **general mechanism**.

#### 1. Conservation Functors

Let $$ X $$ be a presented object with weak group $$ G $$. The conservation functor $$ \operatorname{Cons} $$ forms the aggregate:

$$
\operatorname{Cons}(X) = \coprod_{\sigma \in G} X^\sigma.
$$

This is a coproduct in the relevant category. The weak action becomes an internal automorphism:

$$
g \cdot \operatorname{Cons}(X) \cong \operatorname{Cons}(X).
$$

The effective weak group embeds into $$ \operatorname{Aut}(\operatorname{Cons}(X)) $$. Under independence hypotheses, this is a wreath product:

$$
\operatorname{Aut}(\operatorname{Cons}(X)) \cong \operatorname{Aut}(X) \wr G.
$$

**Proof of Conservation**: For each $$ g \in G $$, the map $$ X^\sigma \mapsto X^{g\sigma} $$ permutes the summands of the coproduct. By the universal property of the coproduct, this family of maps induces an automorphism of $$ \operatorname{Cons}(X) $$. Composition of such automorphisms corresponds to multiplication in $$ G $$, giving a homomorphism $$ G \to \operatorname{Aut}(\operatorname{Cons}(X)) $$.

#### 2. Expansion Functors

Let $$ \mathcal E $$ be an operation system on atoms (rational operations, algebraic closure, differential closure, etc.). The expansion functor $$ \operatorname{Exp} $$ adjoins the results of these operations:

$$
\operatorname{Exp}(\Gamma) = \mathcal E(\Gamma).
$$

For rational operations, if $$ \Gamma $$ is a set of elements in a field:

$$
\operatorname{Exp}(\Gamma) = \Gamma \cup \left\{ \frac{a+b}{c} : a,b,c \in \Gamma, c \neq 0 \right\} \cup \left\{ a+b, a-b, ab : a,b \in \Gamma \right\}.
$$

#### 3. The Conservation-Expansion Tower

Alternating conservation and expansion produces:

$$
X_0 \to \operatorname{Cons}(X_0) \to X_1 \to \operatorname{Cons}(X_1) \to \cdots
$$

where $$ X_{k+1} = \operatorname{Exp}(\operatorname{Cons}(X_k)) $$.

The primitive set at level $$ k $$ is denoted $$ \Gamma_k $$, and:

$$
\Gamma_{k+1} = \mathcal E \left( \bigcup_{\sigma \in G} \sigma \Gamma_k \right).
$$

#### 4. The Limit and the Trend

The colimit of the tower:

$$
X^{(\infty)} = \varinjlim_k X_k
$$

is the **complete expansion** of $$ X $$. The **trend** is the entire filtered tower—the history of how the limit was reached.

Two objects with isomorphic complete fields may have non-isomorphic trends. For example, the fields $$ K(x) $$ and $$ K(x^2) $$ are isomorphic as abstract fields, but their exponent lattices are $$ \mathbb Z $$ and $$ 2\mathbb Z $$ respectively, yielding different trends.

The **trend** is formally defined as the isomorphism class of the filtered system:

$$
\Gamma_0 \subseteq \Gamma_1 \subseteq \Gamma_2 \subseteq \cdots \subseteq \Gamma_\infty.
$$

#### 5. The Algebraic Complexity Profile

Define:

$$
\chi_C(k) = \operatorname{trdeg}_K K(\Gamma_k \cap K(C_\infty)).
$$

This measures how much of the coefficient field is generated by the $$ k $$-th layer. The sequence $$ \chi_C(k) $$ is nondecreasing and bounded above by:

$$
\operatorname{trdeg}_K K(C_\infty).
$$

If $$ \operatorname{trdeg}_K K(C_\infty) $$ is finite, the sequence stabilizes.

**Conclusion of Volume III**: The tower generates a **new invariant**—the trend—which records the generation history of the object, not merely its final form.

---

### VI. Volume IV: Migration and Algebraic Simplification

**Position in the Architecture**: Algorithmic layer—the concrete dynamics within a weak orbit.

Given a solution of one member of a weak orbit, how do we obtain the solutions of all other members?

#### 1. The Migration Problem

Let $$ f(x) $$ have known roots $$ \alpha_1, \ldots, \alpha_n $$. Vieta's theorem gives coefficients:

$$
a_i = (-1)^{n-i} e_{n-i}(\alpha),
$$

where $$ e_k $$ is the $$ k $$-th elementary symmetric function. For a coefficient permutation $$ \sigma $$, we obtain $$ f^\sigma(x) $$. Its roots $$ \beta $$ satisfy:

$$
V(\beta) = p_\sigma(V(\alpha)),
$$

where $$ V $$ is the Vieta map from ordered roots to coefficients, and $$ p_\sigma $$ is the coefficient permutation acting on the coefficient vector.

#### 2. The Migration Correspondence

Define:

$$
M_\sigma = \mathrm{Root}_n \times_{\mathrm{Coeff}_n, \, p_\sigma \circ V} \mathrm{Root}_n.
$$

This fiber product consists of pairs $$ (\alpha, \beta) $$ such that:

$$
V(\beta) = p_\sigma(V(\alpha)).
$$

Explicitly:

$$
M_\sigma = \{ (\alpha, \beta) \in \mathbb A^n \times \mathbb A^n : V(\beta) = p_\sigma(V(\alpha)) \}.
$$

This is a **finite algebraic correspondence**—a computable relation between the roots of weakly permuted polynomials.

#### 3. Explicit Formula for Quadratic Case

For $$ f(x) = x^2 + a_1 x + a_0 $$, with roots $$ \alpha_1, \alpha_2 $$:

$$
a_1 = -(\alpha_1 + \alpha_2), \quad a_0 = \alpha_1 \alpha_2.
$$

After coefficient transposition, the new polynomial is:

$$
f^\tau(x) = x^2 + a_0 x + a_1 = x^2 + \alpha_1\alpha_2 x - (\alpha_1 + \alpha_2).
$$

Its roots $$ \beta_1, \beta_2 $$ satisfy:

$$
\beta_1 + \beta_2 = -\alpha_1\alpha_2, \quad \beta_1\beta_2 = -(\alpha_1 + \alpha_2).
$$

Solving:

$$
\beta_{1,2} = \frac{-\alpha_1 \alpha_2 \pm \sqrt{\alpha_1^2 \alpha_2^2 + 4(\alpha_1 + \alpha_2)}}{2}.
$$

This is the **explicit migration formula** for quadratic equations.

#### 4. Weak Simplification Algorithm

Given $$ f $$, search its weak orbit for a representative with desirable properties: reducibility, lower height, smaller Galois group, better conditioning.

**Algorithm**:
1. Compute representatives of $$ \mathfrak S_n / \operatorname{Stab}(a) $$.
2. For each representative $$ \sigma $$, form $$ f_a^\sigma $$.
3. Apply cheap filters: zero pattern, rational-root tests, modular factorization.
4. Apply expensive tests only to survivors: exact factorization, Galois-group algorithms.
5. Choose the representative minimizing a complexity score.
6. Solve the chosen representative.
7. Migrate back via the inverse correspondence.

#### 5. Limits of Migration

Migration does not abolish Galois obstructions. If $$ f^\sigma $$ has non-solvable Galois group over $$ K(\alpha) $$, the roots $$ \beta $$ cannot be expressed by radicals. Migration provides an **algebraic correspondence**, not a radical formula.

**Theorem**: A weak migration or simplification argument proves a statement about the original representative only if it supplies:
1. A finite orbit representative.
2. A verified property of that representative.
3. A migration correspondence back to the original representative.
4. A certificate that the correspondence preserves the asserted information.

Without the certificate, the argument is only a search procedure.

#### 6. Aggregate Migration

The aggregate solution space:

$$
\mathcal Z(\widehat M) = \coprod_{\sigma} \mathcal S(M^\sigma)
$$

carries the full weak action as a permutation of its components. This globalizes migration to the entire orbit.

**Conclusion of Volume IV**: Migration is the concrete dynamics of weak group theory. It shows that solving one member of a weak orbit yields, via Vieta's theorem, a computable pathway to all other members.

---

### VII. Volume V: Generalized Weak Groups—The Axiomatic Completion

**Position in the Architecture**: Axiomatic layer—the general theory of external symmetry.

Volume V generalizes the entire framework beyond coefficient permutations to **arbitrary decomposable objects**.

#### 1. Decomposable Objects

A generalized decomposable object is a tuple:

$$
\mathcal M = (S_1, \ldots, S_k; R; \rho),
$$

where:
- $$ S_i $$ are component sets (atoms, positions, labels, etc.);
- $$ R \subseteq S_1 \times \cdots \times S_k $$ is an admissible relation (pairing);
- $$ \rho $$ is a realization map sending $$ R $$ to an object in a target category.

#### 2. Generalized Weak Groups

The ambient permutation group is:

$$
\mathfrak P = \mathfrak S_{S_1} \times \cdots \times \mathfrak S_{S_k}.
$$

The generalized weak group is:

$$
\mathcal W = \{ g \in \mathfrak P : g \text{ preserves admissibility} \}.
$$

For a marked relation $$ R_0 $$, the stabilizer is:

$$
\operatorname{Stab}_{\mathcal W}(R_0) = \{ g \in \mathcal W : gR_0 = R_0 \}.
$$

Classical group theory (automorphisms) is the one-component case: when $$ k=1 $$ and only structure-preserving permutations are considered.

#### 3. Generalized Aggregation

For a weak orbit $$ \{ \rho(gR) \}_{g \in \mathcal W} $$, the aggregate is:

$$
\widehat{\mathcal M} = \coprod_{g \in \mathcal W} \rho(gR).
$$

The **Generalized Conservation Theorem** states that $$ \mathcal W $$ acts on $$ \widehat{\mathcal M} $$ by automorphisms.

**Proof**: For $$ g \in \mathcal W $$, the map $$ R' \mapsto gR' $$ permutes the summands of the coproduct. By the universal property of the coproduct, this induces an automorphism of $$ \widehat{\mathcal M} $$. Composition corresponds to multiplication in $$ \mathcal W $$, giving a homomorphism $$ \mathcal W \to \operatorname{Aut}(\widehat{\mathcal M}) $$.

#### 4. Generalized Migration

For a solution functor $$ \mathcal S $$, a migratable locus is one where reconstruction maps are invertible. The **Generalized Migration Theorem** states:

$$
\Phi_{\sigma, R} = V_{\sigma R}^{-1} \circ \sigma \circ V_R : \mathcal S(M_R) \to \mathcal S(M_{\sigma R}),
$$

where $$ V_R $$ is the reconstruction map from the solution object back to the pairing.

#### 5. Expansion Order Classification

- **Zero order**: no productive expansion (pure combinatorial pairing). The aggregate is the coproduct of the initial realization diagram.
- **Finite order**: expansion stabilizes after finitely many steps (saturated layer). There exists $$ n $$ such that $$ \Gamma_n = \Gamma_{n+1} $$.
- **Infinite order**: expansion never stabilizes (genuine filtered colimit). The tower is strictly increasing: $$ \Gamma_m \subsetneq \Gamma_{m+1} $$ for all $$ m $$.

**Theorem (Expansion Order Trichotomy)**: For an extensive monotone expansion tower, exactly one of the following occurs:
1. Zero order: no productive expansion is part of the structure.
2. Finite order: there exists a least $$ n $$ such that $$ \Gamma_n = \Gamma_{n+1} $$.
3. Infinite order: $$ \Gamma_m \subsetneq \Gamma_{m+1} $$ for every $$ m $$.

#### 6. Applications

- **Graph isomorphism**: Two graphs on vertex set $$ V $$ are isomorphic if and only if their edge sets lie in the same $$ \mathfrak S_V $$-orbit in $$ \mathcal P\binom{V}{2} $$.

- **Matrix similarity**: The characteristic polynomial is a weak invariant, but not complete. Similarity requires Jordan form or rational canonical form.

- **Latin squares**: Isotopy classes are orbits under $$ \mathfrak S_R \times \mathfrak S_C \times \mathfrak S_S $$ acting on ternary relations.

#### 7. Burnside Counting

For a finite weak group $$ W $$ acting on a finite pairing space $$ X $$:

$$
|X/W| = \frac{1}{|W|} \sum_{w \in W} |X^w|.
$$

The fixed-point set $$ X^w $$ consists of relations fixed by $$ w $$. For binary relations:

$$
|X^{(\sigma,\tau)}| = 2^{c(\sigma,\tau)},
$$

where $$ c(\sigma,\tau) $$ is the number of orbits of the product action on $$ S_1 \times S_2 $$.

#### 8. Philosophical Conclusion

Volume V establishes **Generalized Weak Group Theory** as the dual of classical group theory:

| Classical Group Theory | Generalized Weak Group Theory |
| :--- | :--- |
| Studies $$ \mathrm{Aut}(X) $$ | Studies the assembly of $$ X $$ from atoms |
| Internal symmetry | External symmetry |
| Classification of structures | Classification of presentations |
| Structure preservation | Structure generation (morphogenesis) |

**Final Theorem**: Let $$ \mathcal M $$ be a decomposable presentation with weak group $$ \mathcal W $$, aggregate construction $$ \operatorname{Agg} $$, expansion operator $$ \mathcal E $$, and solution functor $$ \mathcal S $$. Any theorem about generalized weak symmetry must specify which of the following domains it uses:
1. The presentation groupoid $$ [\mathcal P / \mathcal W] $$
2. The realized object $$ \rho(R) $$
3. The aggregate object $$ \operatorname{Agg}(\mathcal M) $$
4. A finite expansion layer
5. The filtered expansion colimit
6. A migration correspondence for $$ \mathcal S $$

An invariant or solution statement is valid only on the domain where its defining hypotheses are verified.

---

### VIII. Central Theorems of the Five-Volume Work

| Volume | Central Theorem | Mathematical Content |
| :--- | :--- | :--- |
| I | Finite-Support Arithmetic Theorem | Irrationality and transcendence preserved under finite coefficient permutations |
| II | Aggregate Conservation Theorem | Aggregate objects internalize weak symmetry |
| II | Macro-Vieta Theorem | Coefficients of aggregate polynomial are symmetric in original coefficients |
| III | Conservation-Expansion Tower Theorem | Alternating tower generates trends as new invariants |
| IV | Migration Correspondence Theorem | Solutions migrate across weak orbits via Vieta reconstruction |
| V | Generalized Conservation Theorem | Weak groups act on aggregates in any decomposable category |
| V | Generalized Migration Theorem | Solutions migrate if reconstruction maps are invertible |
| V | Expansion Order Trichotomy | Expansion is zero, finite, or infinite; classification relative to operation system |

---

### IX. Open Problems and Future Directions

The theory concludes with a program of open problems:

1. **Explicit infinite-support Diophantine estimates**: For which infinite coefficient permutations can we prove irrationality or transcendence of weak values?

2. **Trend invariants**: Develop complete invariants for conservation-expansion towers (e.g., expansion entropy, defect cohomology).

3. **Derived weak group theory**: Construct homotopy-coherent versions of conservation and expansion on $$ \infty $$-categories.

4. **Positive characteristic**: Frobenius-compatible weak actions.

5. **Automorphism groups of aggregates**: Classify when the aggregate automorphism group is exactly the wreath product and when hidden automorphisms appear.

6. **Computational applications**: Implement weak simplification algorithms for polynomial solving and differential equation solving.

7. **Conditional attack on $$ \pi+e $$**: Develop the program outlined in Volume IV, Part III, by constructing explicit infinite permutations with controlled Diophantine estimates.

8. **Arithmetic geometry**: Characterize weak orbits that preserve motivic compatibility.

9. **Langlands program**: Formulate weak automorphic representations and their $$ L $$-functions.

10. **Formalization**: Implement the core theory in a proof assistant.

---

### X. Final Philosophical Synthesis

Weak Group Theory is not a technique for solving equations more efficiently. It is a new way of understanding how mathematical objects are generated from their constituent data.

Classical group theory tells us what an object is by studying what preserves it. Weak group theory tells us how an object came to be by studying how its presentation can be reassembled.

The two theories are dual:

- **Internal symmetry** answers: "What transformations leave this object unchanged?"
- **External symmetry** answers: "What objects can be generated from the same raw materials, and how are they related?"

This duality is encoded in the five-volume structure:

1. **Phenomena** (Volume I): External symmetry exists in every mathematical domain.
2. **Geometry** (Volume II): External symmetry generates geometric orbits and aggregate spaces.
3. **Functors** (Volume III): External symmetry is governed by conservation and expansion towers.
4. **Migration** (Volume IV): External symmetry induces computable correspondences between solutions.
5. **Axiomatics** (Volume V): External symmetry becomes a complete theory, the dual of classical group theory.

The work demonstrates that external symmetry is not a pathology or a curiosity. It is a fundamental mathematical structure, as rich and as deep as the internal symmetry that has dominated mathematics for two centuries. Weak Group Theory is the systematic study of this structure—the theory of how mathematics is built from its parts.

---

### Keywords (Comprehensive List)

Weak Group Theory, External Symmetry, Internal Symmetry, Coefficient Permutation, Weak Action, Aggregation, Conservation Functor, Expansion Functor, Conservation-Expansion Tower, Trend, Migration, Vieta Theorem, Macro-Vieta Theorem, Generalized Weak Group, Decomposable Object, Pairing Space, Aggregate Polynomial, Aggregate Differential Operator, Aggregate L-Function, Discriminant Arrangement, Wreath Product, Galois Profile, Differential Galois Group, Modular Forms, Automorphic Forms, L-Functions, Arithmetic Geometry, Frobenius Polynomials, Hodge Structure, Motives, Derived Algebraic Geometry, Infinity-Categories, Algebraic K-Theory, Noncommutative Geometry, Quantum Groups, Hopf Algebras, Tensor Categories, Graph Isomorphism, Matrix Similarity, Combinatorial Designs, Latin Squares, Irrationality, Transcendence, $$ \pi+e $$, Finite-Support Permutation, Infinite-Support Permutation, Morphogenesis of Mathematical Objects.