Finding some explicit formula for $(ab)^n$ in any $a,b$ in a finite $p$-group.












3












$begingroup$



If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.



Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.




Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$



Thanks in advance.






abstract-algebra group-theory finite-groups p-groups







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    do you mean something like $(ab)^n=a^nb^n$ ?
    $endgroup$
    – Chinnapparaj R
    Dec 18 '18 at 9:29






  • 1




    $begingroup$
    I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
    $endgroup$
    – A.Messab
    Dec 18 '18 at 10:09






  • 3




    $begingroup$
    @A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
    $endgroup$
    – user1729
    Dec 18 '18 at 11:48






  • 2




    $begingroup$
    @user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
    $endgroup$
    – Tobias Kildetoft
    Dec 18 '18 at 11:57






  • 2




    $begingroup$
    @hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
    $endgroup$
    – Derek Holt
    Dec 21 '18 at 19:41
















3












$begingroup$



If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.



Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.




Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$



Thanks in advance.






abstract-algebra group-theory finite-groups p-groups







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    do you mean something like $(ab)^n=a^nb^n$ ?
    $endgroup$
    – Chinnapparaj R
    Dec 18 '18 at 9:29






  • 1




    $begingroup$
    I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
    $endgroup$
    – A.Messab
    Dec 18 '18 at 10:09






  • 3




    $begingroup$
    @A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
    $endgroup$
    – user1729
    Dec 18 '18 at 11:48






  • 2




    $begingroup$
    @user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
    $endgroup$
    – Tobias Kildetoft
    Dec 18 '18 at 11:57






  • 2




    $begingroup$
    @hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
    $endgroup$
    – Derek Holt
    Dec 21 '18 at 19:41














3












3








3


1



$begingroup$



If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.



Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.




Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$



Thanks in advance.






abstract-algebra group-theory finite-groups p-groups







share|cite|improve this question











$endgroup$





If $G$ is a finite $p-$group, let $a$ and $b$ any two elements from $G$.



Is there any formula for $(ab)^n$ involving $a^nb^n$ for any natural number $n$? That is, some formula like $(ab)^n = a^nb^nf(a,b)$ for some function of $a$ and $b$.




Please not those "modulo" some subgroups formulas! Like $$
(ab)^n equiv a^nb^n pmod{H},
$$
where $H leq G$



Thanks in advance.






abstract-algebra group-theory finite-groups p-groups




abstract-algebra group-theory finite-groups p-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 21 '18 at 17:56









Shaun

9,789113684




9,789113684










asked Dec 18 '18 at 9:27









A.MessabA.Messab

527




527








  • 1




    $begingroup$
    do you mean something like $(ab)^n=a^nb^n$ ?
    $endgroup$
    – Chinnapparaj R
    Dec 18 '18 at 9:29






  • 1




    $begingroup$
    I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
    $endgroup$
    – A.Messab
    Dec 18 '18 at 10:09






  • 3




    $begingroup$
    @A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
    $endgroup$
    – user1729
    Dec 18 '18 at 11:48






  • 2




    $begingroup$
    @user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
    $endgroup$
    – Tobias Kildetoft
    Dec 18 '18 at 11:57






  • 2




    $begingroup$
    @hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
    $endgroup$
    – Derek Holt
    Dec 21 '18 at 19:41














  • 1




    $begingroup$
    do you mean something like $(ab)^n=a^nb^n$ ?
    $endgroup$
    – Chinnapparaj R
    Dec 18 '18 at 9:29






  • 1




    $begingroup$
    I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
    $endgroup$
    – A.Messab
    Dec 18 '18 at 10:09






  • 3




    $begingroup$
    @A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
    $endgroup$
    – user1729
    Dec 18 '18 at 11:48






  • 2




    $begingroup$
    @user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
    $endgroup$
    – Tobias Kildetoft
    Dec 18 '18 at 11:57






  • 2




    $begingroup$
    @hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
    $endgroup$
    – Derek Holt
    Dec 21 '18 at 19:41








1




1




$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29




$begingroup$
do you mean something like $(ab)^n=a^nb^n$ ?
$endgroup$
– Chinnapparaj R
Dec 18 '18 at 9:29




1




1




$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09




$begingroup$
I know this is not true for all cases, I mean some thing $a^nb^nf(a,b)$
$endgroup$
– A.Messab
Dec 18 '18 at 10:09




3




3




$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48




$begingroup$
@A.Messab It is difficult to work out what you want. In $p$-groups, and more generally nilpotent groups, the formulaes usually involve commutators. For example, if $G$ is nilpotent of class at most two then the identity $(xy)^m=x^my^m[y, x]^{mchoose2}$ holds. Which is really pretty. You can generalise this to groups of higher class, but the cost here is more commutators.
$endgroup$
– user1729
Dec 18 '18 at 11:48




2




2




$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57




$begingroup$
@user1729 There is a general formula due to Hall and Petrescu (I don't have the book by Hall on hand to see if that is the one). It is referred to as the Hall-Petrescu formula in Berkovich's book on $p$-groups.
$endgroup$
– Tobias Kildetoft
Dec 18 '18 at 11:57




2




2




$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41




$begingroup$
@hardmath well I thought the answer was just no, but that does not mean that the question is unclear! The general Hall-Petrescu formula is probably unhelpful because it involves unknown elements $c_i$.
$endgroup$
– Derek Holt
Dec 21 '18 at 19:41










1 Answer
1






active

oldest

votes


















2












$begingroup$

There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.



Some example formuals are:




  1. If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.


  2. If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).



You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).



*or formulae, if you want to be correct but also sound slightly pretentious :-)






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks this is so helpful
    $endgroup$
    – A.Messab
    Jan 12 at 1:06











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044944%2ffinding-some-explicit-formula-for-abn-in-any-a-b-in-a-finite-p-group%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









2












$begingroup$

There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.



Some example formuals are:




  1. If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.


  2. If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).



You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).



*or formulae, if you want to be correct but also sound slightly pretentious :-)






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks this is so helpful
    $endgroup$
    – A.Messab
    Jan 12 at 1:06
















2












$begingroup$

There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.



Some example formuals are:




  1. If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.


  2. If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).



You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).



*or formulae, if you want to be correct but also sound slightly pretentious :-)






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Thanks this is so helpful
    $endgroup$
    – A.Messab
    Jan 12 at 1:06














2












2








2





$begingroup$

There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.



Some example formuals are:




  1. If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.


  2. If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).



You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).



*or formulae, if you want to be correct but also sound slightly pretentious :-)






share|cite|improve this answer









$endgroup$



There are some formulas* and they involve (often unknown) commutators. Sometimes there are particularly nice formulas, but they hold in $p$-groups and for things of the form $(ab)^{p^n}$, so they do not hold for arbitrary powers.



Some example formuals are:




  1. If $G$ is nilpotent of class at most two then the identity $$(xy)^m=x^my^m[y,x]^{mchoose2}$$ holds. Which is really pretty. You can generalise this, via the Hall-Petresco formula, to groups of higher class, but the cost here is more commutators.


  2. If $G$ is any group then we have the Hall-Petresco formula, as mentioned in the comments: $$x^my^m=(xy)^mc_2^{mchoose {2}}c_3^{mchoose {3}}cdots c_{m-1}^{mchoose {m-1}}c_m.$$ Here each $c_i$ is contained in the $i^{th}$ subgroup of the decending central series for the group $G$. See Section 12.3 of M. Hall (1959), The theory of groups, Macmillan, MR 0103215. This book also contains some useful formulas for regular $p$-groups. Note that it is Philip Hall after whome the formula is named, while Marshall Hall wrote a book (and did other stuff too!).



You can find other formulas in the first section of the book C. Leedham-Green, S. McKay (2002) The Structure of Groups of Prime Power Order, Oxford University Press, and also in the book Y. Berkovich (2008) Groups of Prime Power Order Volume 1 (Appendix 1 of this book proves the Hall-Petresco formula).



*or formulae, if you want to be correct but also sound slightly pretentious :-)







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 24 '18 at 10:54









user1729user1729

17.5k64193




17.5k64193












  • $begingroup$
    Thanks this is so helpful
    $endgroup$
    – A.Messab
    Jan 12 at 1:06


















  • $begingroup$
    Thanks this is so helpful
    $endgroup$
    – A.Messab
    Jan 12 at 1:06
















$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06




$begingroup$
Thanks this is so helpful
$endgroup$
– A.Messab
Jan 12 at 1:06


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044944%2ffinding-some-explicit-formula-for-abn-in-any-a-b-in-a-finite-p-group%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Plaza Victoria

Image
Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l...
Read more

Puebla de Zaragoza

Image
Para otros usos de este término, véase Puebla (desambiguación). Heroica Puebla de Zaragoza Localidad De arriba a abajo de izquierda a derecha: Estrella de Puebla, Volcán Popocatépetl, Catedral de Puebla, Monumento a Ignacio Zaragoza, Estadio Cuauhtémoc, Angelópolis y Vista panorámica de la ciudad. Escudo Otros nombres: El relicario de América/ La ciudad de los Ángeles/ La Angelópolis Lema: Muy noble y muy leal ciudad de Puebla de los Ángeles Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en México Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en Puebla Mapa interactivo Coordenadas 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Coordenadas: 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Idioma oficial Español Entidad Localidad  • País   México  • Estado Puebla  • Municipio Puebla Presidente municipal Claudia Rivera Vivanc...
Read more

Musa

Image
Para el género de plantas, véase Musa (planta). Apolo y la Nueve Musas En la mitología griega, las musas (en griego antiguo μοῦσαι « mousai» ) son, según los escritores más antiguos, las divinidades inspiradoras de las Artes: cada una de ellas está relacionada con ramas artísticas y del conocimiento. Son hijas de Zeus y de Mnemósine, compañeras del séquito de Apolo, dios olímpico de la música y patrón de las bellas artes, quien tuvo romances con cada una de ellas, dejando descendientes. Bajaban a la tierra a susurrar ideas e inspirar a aquellos mortales que las invocaran. En la época más arcaica eran las ninfas inspiradoras de las fuentes, en las cuales eran adoradas. Finalmente, alrededor de los siglos VIII-VII a. C. [ 1 ] ​ prevaleció en todo el territorio de la Hélade la adoración de las nueve Musas, que son Calíope, Clío, Erato, Euterpe, Melpómene, Polimnia, Talía, Terpsícore y Urania. El culto a las musas era originalmente de Tracia y Beocia, y fueron de vital impo...
Read more