Proof of Prüfer Group Non-Existence

  • Thread starter Thread starter charlamov
  • Start date Start date
  • Tags Tags
    Presentation
charlamov
Messages
11
Reaction score
0
proove that
< x0 , x1 , . . . | [xi , xj ] = 1, i, j, ∈ N_0 ; x0^p = 1 ; (xi) ^ (p ^ i) = x0 , i ∈ N > is not presentation of Prüfer group
 
Mathematics news on Phys.org
charlamov said:
proove that
< x0 , x1 , . . . | [xi , xj ] = 1, i, j, ∈ N_0 ; x0^p = 1 ; (xi) ^ (p ^ i) = x0 , i ∈ N > is not presentation of Prüfer group


Please do learn quickly how to type in LaTeX in this site: https://www.physicsforums.com/showthread.php?t=546968

I'll try to edit your post (and, perhaps, address it):

Prove (please, of course), that \langle x_0,x_1,...\,\,|\,\,[x_i,x_j]=1\,,\,i,j\in\mathbb{N}\,,\,x_0^p=1\,,\,x_i^{p^i}=x_0\,,\,i\in\mathbb{N}\rangle is not a presentation of the Prüfer group.

Now, the Prüfer group must fulfill the conditions \,x^p_i=x_{i-1}\,,\,i=1,2,3,...\,, but by your definition we'd have x_1^p=x_0\,,\,x_2^{p^2}=x_0=x_1^p\Longrightarrowand I can't see how we can deduce from this that \,x_2^p=x_1\, , as we're not sure we can take p-th roots...

Another possible approach: to show that an epimorphism from an infinitely generated abelian free sugroup to one of the groups is not the same for the other one...

DonAntonio
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top