Assume and take . The free Gaussian integral gives , and the normalized free Gaussian measure has covariance . Expanding only the interaction exponential gives the asymptotic expansion
In this zero-dimensional scalar field theory, the path integral has become an ordinary integral, but its combinatorics are precisely those of sextic scalar field theory.
The free generating functional is . Differentiating it proves Wick theorem: odd moments vanish, while each even moment is the sum over pairings of its factors. Each Wick contraction contributes , so
Thus the Feynman rules are a quantum field theory propagator for each internal line and a factor for each six-valent interaction vertex. The factorials and remove vertex and half-edge labels; the remaining weight is , where is the Feynman-diagram symmetry factor, the order of the automorphism group of the resulting diagram, including its half-edge symmetries. A tadpole diagram has an additional interchange symmetry of the two ends of its loop.
There is one empty Vacuum Feynman diagram, contributing . At one interaction vertex, the six half-edges form three loops. Its Feynman-diagram symmetry factor is , so its contribution is .
At two interaction vertices let count the lines joining them. Each interaction vertex has self-loops, so can only be . These four possibilities exhaust all Vacuum Feynman diagrams at this order. Their Feynman-diagram symmetry factors are
Here the leading exchanges the two interaction vertices, permutes the joining lines, and the remaining factors permute and reverse the self-loops. The graph is disconnected and must be included in ; only a connected generating functional would discard it.
Figure 1. . The empty diagram, the one-interaction vertex diagram, and the four two-interaction vertex diagrams, with their Feynman-diagram symmetry factors. Details.
Consequently,
Indeed , independently agreeing with from Wick theorem.
This is an asymptotic expansion, rather than a convergent perturbation series: the coefficient of contains and grows too rapidly for a nonzero radius of convergence. For any fixed truncation order, the Taylor expansion remainder bound for on , followed by the finite Gaussian moment integral, proves the stated remainder estimate. For negative real the original integral diverges.
A group action of on is a map such that and . The orbit and stabilizer of are
For a finite group, the map
is a well-defined bijection from the left cosets of to . Each coset has elements, so the orbit-stabilizer theorem is
The Cauchy theorem for groups says that if a prime number divides , then has an element of order . To prove it, let
The first entries determine the last, so , which is divisible by . The cyclic group acts on by cyclically rotating the entries; rotation preserves the product condition because
Every orbit has size one or . The fixed points are exactly the tuples with . Their number is therefore divisible by . Since the identity gives one fixed point, there is another, and its entry has order .
Now let . Cauchy's theorem gives a subgroup of order . Let act by the conjugation action on the set of subgroups of order . It fixes . If it also fixed , then would normalize ; since , the product would be a subgroup of order , which is impossible. Every other -orbit in therefore has size , so
Distinct members of share only the identity and each contributes ten nonidentity elements. Hence , forcing . Thus is a normal subgroup.
Conjugation now defines a group homomorphism
Because , its automorphism group has order . By the Lagrange theorem, the image has order dividing both and , so the image is trivial and lies in the center of . Cauchy's theorem also supplies of order . If generates , then and commute and has order . Therefore
A group homomorphism preserves multiplication, . A group isomorphism is a bijective homomorphism. An isomorphism from a group to itself is a group automorphism.
The automorphism group contains the identity map. Composition is associative, and if are automorphisms, ; composition is also bijective. For and , , proving the inverse bijection is a homomorphism. These facts establish all group axioms.
A finite cyclic group is with of order . The map is well defined modulo , bijective onto the roots of unity, and preserves multiplication. It identifies with the multiplicative group of th roots of unity.
For prime , Lagrange's theorem leaves only subgroup orders one and : there is no nontrivial proper subgroup. The trivial subgroup is nevertheless proper when , so that qualification is necessary in the printed claim. The characterization of groups with no proper nontrivial subgroups makes the distinction explicit.
For composite , choose a prime divisor and take , of orders and . They are distinct proper subgroups, with nontrivial. If the question intended two nontrivial proper subgroups, that demand is not always possible: a cyclic group of order has only the one of order . The subgroups and quotients of a cyclic group are controlled by its divisors. The order-one group is a separate trivial case, with no proper subgroups.
For the interacting vacuum state defined perturbatively by the same Feynman i-epsilon prescription, the normalized time-ordered product is
Each functional derivative inserts , accounting for . The denominator implements cancellation of vacuum bubbles, while disconnected pieces carrying external insertions still contribute. The lower limit in the printed product is a typographical error; the product here runs from 1 to .
At order in the cubic scalar field interaction term, the expansion of the generating functional supplies . The counts permutations of indistinguishable integrated interaction vertices, and counts permutations of the three field slots at each interaction vertex. Applying the Wick theorem pairs fields into Feynman propagators. Several pairings produce the same Feynman diagram; their number multiplies the expansion coefficient. For fixed labelled external points, the net combinatorial weight is
Here is the order of the graph's automorphism group when the external labels are fixed, with permutations of identical parallel lines and reversal of a self-loop included as applicable. This is the Feynman-diagram symmetry factor convention in which a Feynman diagram is divided by . Each cubic interaction vertex then contributes , each line contributes , and each internal vertex is integrated over its position. External labelled points are not divided by .
For the given group homomorphism , the external semidirect product has underlying Cartesian product and operation
The notation denotes the automorphism group of . Closure follows because is an automorphism of . To check associativity, calculate both bracketings:
They agree because . The identity is , using , and the two-sided inverse is
Indeed multiplication in either order gives the identity, using . This verifies the group axioms.
For the specified group presentation, take and . The rule defines an automorphism because is coprime to . Furthermore , so defines the required group homomorphism . In the resulting semidirect product , the canonical generators satisfy
Consequently the group presentation defines a surjective group homomorphism , sending to and to . The underlying Cartesian product gives , whereas part (a) gives . Surjectivity forces equality, so the map is an isomorphism:
This also proves that the normal forms in part (a) are distinct and that has element order exactly .
Use the fact that is a normal subgroup to move a factor of past a factor of . For and ,
while
The identity element belongs to . Hence is a subgroup, by the subgroup test. This proves the product of a subgroup with a normal subgroup construction; need not be a normal subgroup.
For each , conjugation maps to itself and respects its multiplication. The inverse of is , so both are group automorphisms of .
The printed formula requires a composition convention. For the printed , ordinary function composition gives
Indeed, . Thus the displayed assignment is a group antihomomorphism with the usual multiplication in the automorphism group. It is a group homomorphism if the automorphisms are written as right operators and multiplied in the corresponding reverse order; this is precisely why right conjugation reverses composition.
With the usual left function composition, the corresponding group homomorphism is instead
Direct expansion gives . This states the intended conjugation action without silently reversing the order in the printed formula.
Primary matrix centralizer formula Created 2026-10-14 Updated 2026-11-05
For with irreducible of degree d and partition , its automorphism group has order . The endomorphism algebra has dimension ; its semisimple quotient is , and units are precisely lifts of units in that quotient.
Representation variety of an associative algebra Created 2026-10-06 Updated 2026-11-05
For a finitely generated associative algebra, choose matrices for its generators and impose its polynomial relations. This defines an affine variety. With prescribed orthogonal idempotents , require their images to be the standard projections on . The resulting variety is , acted on by . Without a chosen idempotent decomposition, the usual variety is . Its orbits are module isomorphism classes, and their stabilizers are automorphism groups.
For a normal subgroup of , each is a group automorphism of . Its inverse is , but the dependence on is a group antihomomorphism under ordinary function composition, because . The assignment instead is a group homomorphism to the automorphism group. Equivalently the first convention is a right group action, while the second is a left group action.
Tarski monster groups are two-generated and simple Created 2026-10-14 Updated 2026-11-05
For a Tarski monster group, any nonidentity element generates a proper subgroup of order . Adjoining an element outside that subgroup generates the whole group. A proper nontrivial normal subgroup would have order ; conjugation into its finite automorphism group forces it to be central. Combining it with another order- cyclic subgroup would then give a proper subgroup of order , a contradiction.
// Target: algebra.bigb