- Holomorph (mathematics)
In
mathematics , especially in the area ofalgebra known asgroup theory , the holomorph of a group is a group which simultaneously contains (copies of) the group and its automorphism group. The holomorph provides interesting examples of groups, and allows one to treat group elements and group automorphism in a uniform context.Hol("G") as a semi-direct product
In
group theory , for a group , the holomorph of denoted can be described in two ways. First, if is theautomorphism group of then:where the multiplication is given by: [Eq. 1]Typically, a
semi-direct product is given in the form where and are groups and is a homomorphism and where the multiplication of elements in the semi-direct product is given as:which is well defined, since and therefore .For the holomorph, and is the identity map, as such we suppress writing explicitly in the multiplication given in [Eq. 1] above.
For example,
* thecyclic group of order 3
* where
* with the multiplication given by
* where the exponents of are taken mod 3 and those of mod 2.Observe, for example:and note also that this group is not abelian, as , so that is a
non-abelian group of order 6 which, by basic group theory, must be isomorphic to thesymmetric group .Hol("G") as a permutation group
A group "G" acts naturally on itself by left and right multiplication, each giving rise to a homomorphism from "G" into the
symmetric group on the underlying set of "G". One homomorphism are defined as "λ": "G" → Sym("G"), "λ"("g")("h") = "g"·"h". That is, "g" is mapped to thepermutation obtained by left multiplying each element of "G" by "g". Similarly, a second homomorphism "ρ": "G" → Sym("G") is defined by "ρ"("g")("h") = "h"·"g"−1, where the inverse ensures that "ρ"("g"·"h")("k") = "ρ"("g")("ρ"("h")("k")). These homomorphisms are called the left and rightregular representation s of "G". Each homomorphism is injective, a fact referred to asCayley's theorem .For example, if "G" = "C"3 = {1, "x", "x"2 } is a
cyclic group of order three, then
* "λ"("x")(1) = "x"·1 = "x",
* "λ"("x")("x") = "x"·"x" = "x"2, and
* "λ"("x")("x"2) = "x"·"x"2 = 1,so "λ"("x") takes (1, "x", "x"2) to ("x", "x"2, 1).The image of "λ" is a subgroup of Sym("G") isomorphic to "G", and its
normalizer in Sym("G") is defined to be the holomorph "H" of "G". For each "f" in "H" and "g" in "G", there is an "h" in "G" such that "f"·"λ"("g") = "λ"("h")·"f". If an element "f" of the holomorph fixes the identity of "G", then for "1" in "G", ("f"·"λ"("g"))("1") = ("λ"("h")·"f")("1"), but the left hand side is "f"("g"), and the right side is "h". In other words, if "f" in "H" fixes the identity of "G", then for every "g" in "G", "f"·"λ"("g") = "λ"("f"("g"))·"f". If "g", "k" are elements of "G", and "f" is an element of "H" fixing the identity of "G", then applying this equality twice to "f"·"λ"("g")·"λ"("h") and once to the (equivalent) expression "f"·"λ"("g"·"h") gives that "f"("g")·"f"("h") = "f"("g"·"h"). In other words, every element of "H" that fixes the identity of "G" is in fact anautomorphism of "G". Such an "f" normalizes any "λ"("g"), and the only "λ"("g") that fixes the identity is "λ"(1). Setting "A" to be thestabilizer (group theory) of the identity, the subgroup generated by "A" and "λ"("G") issemidirect product with normal subgroup "λ"("G") and complement "A". Since "λ"("G") is transitive, the subgroup generated by "λ"("G") and the point stabilizer "A" is all of "H", which shows the holomorph as a permutation group is isomorphic to the holomorph as semidirect product.It is useful, but not directly relevant that the centralizer of "λ"("G") in Sym("G") is "ρ"("G"), their intersection is "ρ"(Z("G")) = "λ"(Z("G")), where Z("G") is the center of "G", and that "A" is a common complement to both of these normal subgroups of "H".
Notes
* "ρ"("G") ∩ Aut("G") = 1
* Aut("G") normalizes "ρ"("G") so that canonically "ρ"("G")Aut("G") ≅ "G" ⋊ Aut("G")
* since "λ"("g")"ρ"("g")("h") = "ghg"-1
* "K" ≤ "G" is acharacteristic subgroup if and only if λ(K) ⊴ Hol("G")References
* | year=1959
Wikimedia Foundation. 2010.