Hubbry Logo
AutomorphismAutomorphismMain
Open search
Automorphism
Community hub
Automorphism
logo
8 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Automorphism
Automorphism
from Wikipedia
An automorphism of the Klein four-group shown as a mapping between two Cayley graphs, a permutation in cycle notation, and a mapping between two Cayley tables.

In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms of an object forms a group, called the automorphism group. It is, loosely speaking, the symmetry group of the object.

Definition

[edit]

In an algebraic structure such as a group, a ring, or vector space, an automorphism is simply a bijective homomorphism of an object into itself. (The definition of a homomorphism depends on the type of algebraic structure; see, for example, group homomorphism, ring homomorphism, and linear operator.)

More generally, for an object in some category, an automorphism is a morphism of the object to itself that has an inverse morphism; that is, a morphism is an automorphism if there is a morphism such that where is the identity morphism of X. For algebraic structures, the two definitions are equivalent; in this case, the identity morphism is simply the identity function, and is often called the trivial automorphism.

Automorphism group

[edit]

The automorphisms of an object X form a group under composition of morphisms, which is called the automorphism group of X. This results straightforwardly from the definition of a category.

The automorphism group of an object X in a category C is often denoted AutC(X), or simply Aut(X) if the category is clear from context.

Examples

[edit]
  • In set theory, an arbitrary permutation of the elements of a set X is an automorphism. The automorphism group of X is also called the symmetric group on X.
  • In elementary arithmetic, the set of integers, , considered as a group under addition, has a unique nontrivial automorphism: negation. Considered as a ring, however, it has only the trivial automorphism. Generally speaking, negation is an automorphism of any abelian group, but not of a ring or field.
  • A group automorphism is a group isomorphism from a group to itself. Informally, it is a permutation of the group elements such that the structure remains unchanged. For every group G there is a natural group homomorphism G → Aut(G) whose image is the group Inn(G) of inner automorphisms and whose kernel is the center of G. Thus, if G has trivial center it can be embedded into its own automorphism group.[1]
  • In linear algebra, an endomorphism of a vector space V is a linear operator VV. An automorphism is an invertible linear operator on V. When the vector space is finite-dimensional, the automorphism group of V is the same as the general linear group, GL(V). (The algebraic structure of all endomorphisms of V is itself an algebra over the same base field as V, whose invertible elements precisely consist of GL(V).)
  • A field automorphism is a bijective ring homomorphism from a field to itself.
    • The field of the rational numbers has no other automorphism than the identity, since an automorphism must fix the additive identity 0 and the multiplicative identity 1; the sum of a finite number of 1 must be fixed, as well as the additive inverses of these sums (that is, the automorphism fixes all integers); finally, since every rational number is the quotient of two integers, all rational numbers must be fixed by any automorphism.
    • The field of the real numbers has no automorphisms other than the identity. Indeed, the rational numbers must be fixed by every automorphism, per above; an automorphism must preserve inequalities since is equivalent to and the latter property is preserved by every automorphism; finally every real number must be fixed since it is the least upper bound of a sequence of rational numbers.
    • The field of the complex numbers has a unique nontrivial automorphism that fixes the real numbers. It is the complex conjugation, which maps to The axiom of choice implies the existence of uncountably many automorphisms that do not fix the real numbers.[2][3]
    • The study of automorphisms of algebraic field extensions is the starting point and the main object of Galois theory.
  • The automorphism group of the quaternions () as a ring are the inner automorphisms, by the Skolem–Noether theorem: maps of the form abab−1.[4] This group is isomorphic to SO(3), the group of rotations in 3-dimensional space.
  • The automorphism group of the octonions () is the exceptional Lie group G2.
  • In graph theory an automorphism of a graph is a permutation of the nodes that preserves edges and non-edges. In particular, if two nodes are joined by an edge, so are their images under the permutation.
  • In geometry, an automorphism may be called a motion of the space. Specialized terminology is also used:

History

[edit]

One of the earliest group automorphisms (automorphism of a group, not simply a group of automorphisms of points) was given by the Irish mathematician William Rowan Hamilton in 1856, in his icosian calculus, where he discovered an order two automorphism,[5] writing:

so that is a new fifth root of unity, connected with the former fifth root by relations of perfect reciprocity.

Inner and outer automorphisms

[edit]

In some categories—notably groups, rings, and Lie algebras—it is possible to separate automorphisms into two types, called "inner" and "outer" automorphisms.

In the case of groups, the inner automorphisms are the conjugations by the elements of the group itself. For each element a of a group G, conjugation by a is the operation φa : GG given by φa(g) = aga−1 (or a−1ga; usage varies). One can easily check that conjugation by a is a group automorphism. The inner automorphisms form a normal subgroup of Aut(G), denoted by Inn(G); this is called Goursat's lemma.

The other automorphisms are called outer automorphisms. The quotient group Aut(G) / Inn(G) is usually denoted by Out(G); the non-trivial elements are the cosets that contain the outer automorphisms.

The same definition holds in any unital ring or algebra where a is any invertible element. For Lie algebras the definition is slightly different.

See also

[edit]

References

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In mathematics, an automorphism is an isomorphism of a mathematical structure onto itself, derived from the Greek words auto ("self") and morphosis ("to form" or "shape"), representing a symmetry that preserves all the structure's properties. The collection of all such automorphisms for a given structure forms a group under function composition, called the automorphism group, which encodes the structure's symmetries and is fundamental in studying its properties. Automorphisms arise across various branches of mathematics, particularly in and . In group theory, an automorphism of a group GG is a bijective from GG to itself; for the Zn\mathbb{Z}_n of order nn, the Aut(Zn)\operatorname{Aut}(\mathbb{Z}_n) is isomorphic to the of units nn, U(n)U(n), consisting of integers coprime to nn. For the V4V_4, Aut(V4)\operatorname{Aut}(V_4) has six elements and is isomorphic to the S3S_3. In ring theory and field theory, an automorphism is a bijective from the structure to itself that preserves addition and multiplication; for example, the field of rational numbers Q\mathbb{Q} has only the trivial automorphism (the identity map). In , an automorphism of a graph H=(V,E)H = (V, E) is a bijective map ϕ:VV\phi: V \to V such that vertices xx and yy are adjacent ϕ(x)\phi(x) and ϕ(y)\phi(y) are adjacent, preserving the graph's adjacency relations. The automorphism group of the on four vertices is the S4S_4, reflecting all possible relabelings of its vertices. Automorphisms also appear in , such as conformal self-maps of the , and their study reveals deep connections between algebraic structures and their invariant properties.

Definition and Basics

Formal Definition

In abstract algebra and related fields, the foundational concepts leading to automorphisms are homomorphisms and isomorphisms. A is a map between two mathematical structures of the same type that preserves the operations and relations defined on those structures. An is a bijective homomorphism, meaning it is both injective and surjective, thereby establishing a one-to-one correspondence that maintains the structural properties. An is an from a to itself, representing a of the object that preserves all its intrinsic operations and relations. More formally, for a SS equipped with operations or relations (such as a , or graph), an automorphism ϕ:SS\phi: S \to S is a bijective function satisfying the preservation conditions specific to the structure. For instance, in a multiplicative structure, ϕ(ab)=ϕ(a)ϕ(b)\phi(ab) = \phi(a)\phi(b) for all a,bSa, b \in S; analogous conditions hold for additive structures, where ϕ(a+b)=ϕ(a)+ϕ(b)\phi(a + b) = \phi(a) + \phi(b), or relational ones, where ϕ\phi maps relations to corresponding relations. The collection of all automorphisms of a structure SS, under the operation of , forms a group known as the , denoted Aut(S)\operatorname{Aut}(S). This group arises because the identity is an automorphism, composition of automorphisms yields another automorphism, and every automorphism has an inverse that is also an automorphism.

Relation to Isomorphisms

An automorphism of a is a special case of an where the mapping is from the structure to itself, preserving all relevant operations and relations in a bijective manner. This self-mapping ensures that the 's properties are maintained bidirectionally, distinguishing it from general isomorphisms between distinct structures. In contrast to endomorphisms, which are structure-preserving mappings from a structure to itself but not necessarily bijective, automorphisms are precisely the invertible endomorphisms. The invertibility requirement guarantees that the mapping can be reversed while still preserving the structure, making automorphisms the bijective subset of endomorphisms. If ϕ\phi is an automorphism of a structure, then its inverse ϕ1\phi^{-1} is also an automorphism, as the inverse of an isomorphism is itself an isomorphism, and applying it to the same structure maintains bijectivity and preservation properties. This closure under inversion is a fundamental aspect that allows the collection of automorphisms to form a group under composition. Automorphisms fundamentally capture the symmetries inherent in a , representing all ways to transform the object while leaving its essential properties unchanged. These symmetries provide insight into the object's intrinsic , often revealing equivalences that simplify or .

Automorphism Groups

Structure and Properties

The \Aut(S)\Aut(S) of an SS consists of all automorphisms of SS, with the group operation defined by composition of functions. This set forms a group because the identity mapping on SS serves as the , as it preserves all operations and relations of SS. Composition is closed: if ϕ\phi and ψ\psi are automorphisms, then ϕψ\phi \circ \psi is also an automorphism, since it bijectively maps SS to itself while preserving structure. Additionally, every automorphism ϕ\phi has an inverse ϕ1\phi^{-1}, which is itself an automorphism, ensuring the group axioms are satisfied. \Aut(S)\Aut(S) embeds as a of the \Sym(S)\Sym(S) on the underlying set of SS, where the comprises all of SS under composition. This arises because every automorphism is a , and the test confirms the inclusion: \Aut(S)\Aut(S) is nonempty, closed under the operation, and closed under inverses. For a finite SS with S=n|S| = n, implies that the order of \Aut(S)\Aut(S) divides n!n!, the order of \Sym(S)\Sym(S). In the infinite case, \Aut(S)\Aut(S) may be infinite, exhibiting potentially more intricate topological or cardinal properties not present in finite scenarios. Key properties of \Aut(S)\Aut(S) include its center Z(\Aut(S))Z(\Aut(S)), the subgroup of automorphisms that commute with every element of \Aut(S)\Aut(S) under composition, which captures "central symmetries" of the structure. Normal subgroups of \Aut(S)\Aut(S) play a central role in its quotient structure; notably, the inner automorphism subgroup forms a normal subgroup. These properties distinguish \Aut(S)\Aut(S) as a rich algebraic object, with finite cases often yielding computable structures while infinite cases require advanced tools from or .

Inner Automorphism Subgroup

In group theory, an of a group GG is an automorphism induced by conjugation by an element of GG. Specifically, for each gGg \in G, the map ϕg:GG\phi_g: G \to G defined by ϕg(x)=gxg1\phi_g(x) = g x g^{-1} for all xGx \in G is an automorphism of GG. This follows from the properties of conjugation preserving the group operation: ϕg(xy)=g(xy)g1=(gxg1)(gyg1)=ϕg(x)ϕg(y)\phi_g(x y) = g (x y) g^{-1} = (g x g^{-1}) (g y g^{-1}) = \phi_g(x) \phi_g(y). The collection of all inner automorphisms forms a of the \Aut(G)\Aut(G), denoted \Inn(G)={ϕggG}\Inn(G) = \{ \phi_g \mid g \in G \}. The map ψ:G\Aut(G)\psi: G \to \Aut(G) given by ψ(g)=ϕg\psi(g) = \phi_g is a , as composition satisfies ϕgϕh=ϕgh\phi_g \circ \phi_h = \phi_{g h} for all g,hGg, h \in G. The kernel of ψ\psi is precisely Z(G)={zGzx=xz xG}Z(G) = \{ z \in G \mid z x = x z \ \forall x \in G \}, since ϕz=idG\phi_z = \mathrm{id}_G if and only if zz commutes with every element of GG. By the first isomorphism theorem, this yields \Inn(G)G/Z(G)\Inn(G) \cong G / Z(G). The subgroup \Inn(G)\Inn(G) is normal in \Aut(G)\Aut(G). To see this, consider any α\Aut(G)\alpha \in \Aut(G) and ϕg\Inn(G)\phi_g \in \Inn(G); then αϕgα1=ϕα(g)\alpha \circ \phi_g \circ \alpha^{-1} = \phi_{\alpha(g)}, which is again an inner automorphism, confirming that \Inn(G)\Inn(G) is invariant under conjugation by elements of \Aut(G)\Aut(G). This normality highlights the central role of inner automorphisms within the full .

Examples in Structures

In Groups

In group theory, automorphisms preserve the group operation and structure, and concrete examples illustrate their role in various group classes. For cyclic groups, consider the finite cyclic group Zn\mathbb{Z}_n of order nn, generated by 1 under addition modulo nn. Any automorphism ϕ\phi is determined by ϕ(1)=k\phi(1) = k, where kk is coprime to nn to ensure ϕ\phi is bijective, as the order of kk must be nn. Thus, the automorphism group Aut(Zn)\operatorname{Aut}(\mathbb{Z}_n) is isomorphic to (Z/nZ)×(\mathbb{Z}/n\mathbb{Z})^\times, the multiplicative group of units modulo nn, which consists of integers from 1 to n1n-1 coprime to nn. For n=pn = p a prime, (Z/pZ)×(\mathbb{Z}/p\mathbb{Z})^\times has order p1p-1 and is cyclic, generated by a primitive root modulo pp. Symmetric groups provide another key example. The SnS_n on nn letters, consisting of all permutations of {1,2,,n}\{1, 2, \dots, n\}, has Aut(Sn)\operatorname{Aut}(S_n) isomorphic to SnS_n itself for n6n \neq 6, meaning all automorphisms are inner, arising from conjugation by elements of SnS_n. In this case, inner automorphisms via conjugation permute the transpositions while preserving the group's structure. However, for n=6n=6, Aut(S6)\operatorname{Aut}(S_6) is larger than S6S_6, admitting outer automorphisms that do not arise from conjugation. For abelian groups, particularly free abelian groups, automorphisms correspond to linear transformations. The free abelian group Zk\mathbb{Z}^k of rank kk, additively generated by the standard basis {e1,,ek}\{e_1, \dots, e_k\}, has Aut(Zk)\operatorname{Aut}(\mathbb{Z}^k) isomorphic to the general linear group GL(k,Z)\mathrm{GL}(k, \mathbb{Z}), the group of k×kk \times k invertible matrices over Z\mathbb{Z} with determinant ±1\pm 1. Each such matrix defines an automorphism by sending the basis to new generators that form a Z\mathbb{Z}-basis for Zk\mathbb{Z}^k. A specific finite abelian example is the Klein four-group V4Z2×Z2={0,a,b,a+b}V_4 \cong \mathbb{Z}_2 \times \mathbb{Z}_2 = \{0, a, b, a+b\} under addition modulo 2, where the three non-identity elements have order 2. Here, Aut(V4)S3\operatorname{Aut}(V_4) \cong S_3, as automorphisms permute these three elements arbitrarily while fixing the identity, reflecting the symmetric action on indistinguishable order-2 elements.

In Rings and Fields

An automorphism of a ring RR is a bijective ring homomorphism ϕ:RR\phi: R \to R that preserves both addition and multiplication, as well as the multiplicative identity 1R1_R. These maps are more constrained than group automorphisms because they must respect two operations simultaneously. For example, in the ring of integers Z\mathbb{Z}, any automorphism must send the generator 1 to itself, and thus fix all multiples of 1, making Aut(Z)\operatorname{Aut}(\mathbb{Z}) trivial and consisting solely of the identity. In field theory, automorphisms similarly preserve addition and multiplication but are defined relative to a base field. For a field extension K/FK/F, a field automorphism of KK fixing FF pointwise must fix the prime subfield of FF elementwise, as it is generated by the multiplicative identity. When K/FK/F is a Galois extension, the Galois group Gal(K/F)\operatorname{Gal}(K/F) coincides exactly with the automorphism group Aut(K/F)\operatorname{Aut}(K/F). Specific examples illustrate the restrictiveness of field automorphisms. The automorphism group Aut(Q)\operatorname{Aut}(\mathbb{Q}) of the rational numbers is trivial, as any automorphism fixes Z\mathbb{Z} (generated by 1) and thus all quotients. Similarly, Aut(R)\operatorname{Aut}(\mathbb{R}) is trivial; any automorphism preserves squares (hence positivity) and the order structure, fixing Q\mathbb{Q} densely and extending uniquely to all reals. In contrast, the only continuous field automorphism of C\mathbb{C} (over Q\mathbb{Q}) is complex conjugation (besides the identity), though the full automorphism group is vastly larger, of cardinality 2202^{2^{\aleph_0}}. Complex conjugation is given by z=abi\overline{z} = a - bi for z=a+biz = a + bi. For rings over a field kk, the Autk(k)\operatorname{Aut}_k(k) consists of the affine transformations xax+bx \mapsto ax + b with ak×a \in k^\times and bkb \in k, forming the affine group Aff1(k)k×k\operatorname{Aff}_1(k) \cong k^\times \ltimes k. This structure arises because any automorphism is uniquely determined by the image of xx, which must be a linear to preserve the ring's grading and irreducibility properties.

Advanced Concepts

Outer Automorphisms

The outer automorphism group of a SS, denoted Out(S)\mathrm{Out}(S), is defined as the Out(S)=Aut(S)/Inn(S)\mathrm{Out}(S) = \mathrm{Aut}(S) / \mathrm{Inn}(S), where Aut(S)\mathrm{Aut}(S) is the full of SS and Inn(S)\mathrm{Inn}(S) is its consisting of s. The elements of Out(S)\mathrm{Out}(S) are the cosets of Inn(S)\mathrm{Inn}(S) in Aut(S)\mathrm{Aut}(S), each corresponding to an of automorphisms that agree up to composition with an inner automorphism. This construction captures the automorphisms of SS modulo those induced by conjugation by elements of SS itself. The group Out(S)\mathrm{Out}(S) quantifies the "non-conjugacy" symmetries of SS, representing those automorphisms that cannot be obtained via internal conjugation and thus reflect external or exceptional symmetries of the . It may be trivial—for instance, when every automorphism is inner—or non-trivial, and its can range from abelian to non-abelian, depending on SS. For many groups, Out(S)\mathrm{Out}(S) is finite and solvable, highlighting the limited extent of such external symmetries in algebraic . A prominent example occurs with the S6S_6, where Out(S6)Z2\mathrm{Out}(S_6) \cong \mathbb{Z}_2. This arises because S6S_6 admits exactly one outer automorphism up to composition with inner automorphisms, yielding Aut(S6)=2S6=[1440](/page/1440)|\mathrm{Aut}(S_6)| = 2 \cdot |S_6| = [1440](/page/1440), in contrast to other s SnS_n (for n6n \neq 6) which have trivial outer automorphism groups. The exceptional nature of S6S_6 stems from its duality with the Sp(4,2)\mathrm{Sp}(4,2), enabling this unique non-inner . For finite groups GG, the outer automorphism group Out(G)\mathrm{Out}(G) relates to the M(G)M(G) in the study of covering groups, particularly for perfect groups where the automorphism group of the Schur cover G~\tilde{G} involves extensions incorporating both Out(G)\mathrm{Out}(G) and actions on M(G)M(G). Computations for finite simple groups of Lie type illustrate this interplay, as the structures of Out(G)\mathrm{Out}(G) and M(G)M(G) together determine the full automorphism tower and covering extensions.

Applications in Geometry and Graphs

In geometry, automorphisms preserve the underlying structure of spaces, with isometries of forming a key example; these include rotations, reflections, translations, and glide reflections that maintain distances and orientations. The of the , viewed as an , is the affine group, comprising all invertible affine transformations that map the space to itself bijectively while preserving and ratios of distances along lines. Crystallographic groups extend these ideas to discrete symmetries in and physics, acting as subgroups of the of that preserve a lattice structure, such as atomic arrangements in . In three dimensions, there are 230 such groups, obtained by combining the 14 Bravais lattices with the 32 crystallographic point groups, which classify the possible symmetry operations compatible with translational periodicity and underpin phenomena like diffraction patterns in . In , automorphisms are bijections on the vertex set that preserve adjacency, effectively capturing the symmetries of the graph's edge structure. For the KnK_n on nn vertices, where every pair of vertices is adjacent, the Aut(Kn)\mathrm{Aut}(K_n) is isomorphic to the SnS_n, as any of vertices maintains the full connectivity. A notable example is the , a 3-regular graph with 10 vertices and 15 edges, whose automorphism group has order 120 and is isomorphic to S5S_5, reflecting its high degree of symmetry despite being non-Hamiltonian. Outer automorphisms of graph automorphism groups can model exceptional symmetries in combinatorial structures, such as those arising from exotic embeddings that extend standard permutation actions beyond inner conjugations.

Historical Development

Origins in Geometry

The concept of automorphisms originated in the study of geometric symmetries, where self-mappings of figures preserve distances, angles, and incidence relations. In ancient Greek mathematics, particularly in Euclid's Elements (circa 300 BCE), congruences were established through the method of superposition, which implicitly treats rotations and reflections as rigid transformations mapping one figure onto another while maintaining their properties. For instance, Proposition I.4 demonstrates that if two triangles have two sides and the included angle equal, then the triangles are congruent by superposing one upon the other, aligning corresponding parts so that vertices coincide, thereby proving equality of the bases and remaining angles. This approach, rooted in practical constructions, prefigures automorphisms as structure-preserving maps, with rotations around a point and reflections over a line serving as basic examples of such symmetries in plane geometry. During the 18th and early 19th centuries, geometric investigations increasingly emphasized transformations that preserve specific properties, laying groundwork for group-theoretic interpretations without yet formalizing abstract groups. Mathematicians like and advanced , focusing on collineations—transformations preserving incidence between points and lines—as invariant under perspective projections. , in 1827, classified geometric configurations by properties invariant under certain transformation classes, such as similarities and affinities, effectively describing early notions of symmetry groups acting on space. Jakob Steiner's in 1832 further highlighted these transformations in studying conic sections and polygons, treating them as operations that reorder elements while conserving relational structures. A pivotal advancement came with Felix Klein's 1872 Erlangen program, which systematically classified geometries according to their associated groups of automorphisms—transformations preserving the fundamental incidence relations of the space. In his inaugural address at the University of Erlangen, Klein proposed viewing a geometry as the study of invariants under a "principal group" of collineations for , or metric-preserving motions for , thereby unifying diverse branches like affine and hyperbolic geometries under group actions. For example, is characterized by the group of rigid motions (rotations, translations, reflections) that leave distances invariant, while relies on broader collineations preserving only point-line incidences. Klein's framework emphasized automorphisms as the "Hauptgruppe" defining geometric properties through their invariance, marking a transition from transformations to organized studies. These geometric developments predate the abstract theory of groups, with early actions manifesting as collections of transformations composing under composition and inversion, applied to figures like polygons and curves to reveal symmetries. By the mid-19th century, such actions on geometric objects, as in the of regular polyhedra via rotational symmetries, anticipated modern algebraic generalizations of automorphisms.

Developments in Abstract Algebra

In the early , the study of automorphisms gained prominence in group theory through the foundational work of William Burnside. His 1897 book Theory of Groups of Finite Order, revised in 1911, systematically explored the structure of finite groups, including the role of automorphisms in determining isomorphisms and the holomorph of a group as the of the group with its . This framework highlighted automorphisms as essential for classifying groups and understanding their symmetries, influencing subsequent developments in . A key advancement came from in 1911, who identified the first known non-trivial outer automorphism in the S6S_6, demonstrating that the of S6S_6 is larger than its group by a factor of 2. Schur's discovery, detailed in his analysis of group representations, revealed an exceptional case where conjugacy classes are not preserved under all automorphisms, challenging the expectation that symmetric groups beyond S2S_2 are complete. This work extended the understanding of outer automorphisms beyond inner ones, paving the way for deeper investigations into group structures in the 1920s. The integration of automorphisms into , originating with Évariste Galois's ideas in the 1830s, was formalized in the , emphasizing the as the of the . Emil Artin's 1944 lectures, published as , presented the subject through field automorphisms and their fixed fields, establishing the fundamental theorem as a between subfields and subgroups without relying on solvability first. This approach solidified automorphisms as central to solvability criteria, bridging field theory with group automorphisms and influencing ring and field extensions. Post-World War II, automorphisms played a crucial role in , particularly in modular representations and . Richard Brauer's extensions of Frobenius's work in the 1940s and 1950s on , including the development of block theory and decomposition numbers, aided the , where group automorphisms are essential. By the 1960s, the exceptional outer automorphism of S6S_6, discovered by Schur, continued to be analyzed in the context of , confirming its impact on irreducible characters and contributing to the ongoing classification efforts. From the onward, category-theoretic perspectives extended the algebraic view of automorphisms, treating them as endomorphisms in categories of algebraic structures. Alexander Grothendieck's applications in , such as topos theory and schemes, framed automorphism groups abstractly, limited to algebraic contexts like sheaves and motives. This shift emphasized universal properties over explicit computations, influencing modern while remaining grounded in group, ring, and field theories.

References

  1. https://proofwiki.org/wiki/Automorphism_Group_is_Subgroup_of_Symmetric_Group
  2. https://groupprops.subwiki.org/wiki/Inner_automorphism
Add your contribution
Related Hubs
User Avatar
No comments yet.