Forgot password
 Register account
View 318|Reply 7

350 is solvable

[Copy link]

3175

Threads

7937

Posts

48

Reputation

Show all posts

hbghlyj posted 2023-3-16 08:34 |Read mode
OEIS A number is solvable if every group of that order is solvable.

Show that 350 is solvable

48

Threads

771

Posts

93

Reputation

Show all posts

Czhang271828 posted 2023-3-16 13:23
Last edited by Czhang271828 2023-3-16 13:32First, second.

The solvability of group with order $175=5^2\cdot 7$ is also proved by some basic calculations. Since the number of Sylow $7$-group is $7k+1$, which is also a divisor of $25$, such group has a normal subgroup with order $7$ (aka. unique maximal Sylow $7$-group). The proof is complete.

3175

Threads

7937

Posts

48

Reputation

Show all posts

original poster hbghlyj posted 2023-3-17 18:29
Czhang271828 发表于 2023-3-16 06:23
basic calculations. Since the number of Sylow $7$-group is $7k+1$, which is also a divisor of $25$, such group has a normal subgroup with order $7$ (aka. unique maximal Sylow $7$-group)
方法与Theorem 2一样
Theorem 2. If $|G|=p^k q^s$ where $p$ and $q$ are prime numbers $k, s \in \mathbb{N}$ and $1 \bmod p \neq$ $q^t$ for $t=1,2, . .$, s then $G$ is solvable.

Proof. Since $N_p$ divides $|G|$ and it is equal to $1 \bmod p$ and since $q^t \neq 1 \bmod p$ for $t=1,2, . ., s$ we get that $N_p=1$. Let $P$ be the only p-Sylow subgroup of $G$. $P$ is a normal subgroup of $G$. Since the order of $P$ is $p^k$ where $p$ is prime we have that $P$ is a p-group and by our basic example-theorem $P$ is solvable. Also $[G: P]=q^s$ thus $\frac{G}{P}$ is a q-group and again by our basic example-theorem $\frac{G}{P}$ is solvable. By the tool theorem, now $G$ is solvable.

3175

Threads

7937

Posts

48

Reputation

Show all posts

original poster hbghlyj posted 2023-3-17 19:00
Czhang271828 发表于 2023-3-16 06:23
First, second.

The solvability of group with order $175=5^2\cdot 7$ is also proved by some basic ca ...
How can I prove $G$ has a subgroup of order 175
It has a Sylow 2-subgroup, why is it normal?
The number of Sylow 2-subgroups $n_2\equiv 1\pmod2,n_2∣175$ but I can't prove $n_2=1$

48

Threads

771

Posts

93

Reputation

Show all posts

Czhang271828 posted 2023-3-17 22:01
hbghlyj 发表于 2023-3-17 19:00
How can I prove $G$ has a subgroup of order 175
It has a Sylow 2-subgroup, why is it norm ...
It is well-known that any group of order $4n+2$ has a subgroup of index $2$. It is easy to find the proof and generalisation on forums such as Stackexchange.

48

Threads

771

Posts

93

Reputation

Show all posts

Czhang271828 posted 2023-3-17 22:05
Last edited by Czhang271828 2023-3-17 22:13
hbghlyj 发表于 2023-3-17 18:55
Is it true that “If $|G|=2n$, $n$ is odd, then $C_2\lhd G$.”
Indeed, it is almost imposible for randomly generated groups of order $4n+2$. For instance, the only non-trivial normal subgroup of $S_3$ is $A_3$.

I think you may have some misunderstanding on my Sketch of Proof? The main issue is to prove the solvability of group with order $175$, yet it doesnot mean that $G_{\text{order }175}$ is obtained by the quotient $G_{\text{order }350}/C_2$. A (finite) group $G$ is solvable whenever there exsits (thus forall) $H\lhd G$ such that both $H$ and $G/H$ are solvable. Here we take $H$ as the normal subgroup of order $175$.

3175

Threads

7937

Posts

48

Reputation

Show all posts

original poster hbghlyj posted 2023-3-17 23:04
Czhang271828 发表于 2023-3-17 15:05
Here we take $H$ as the normal subgroup of order $175$.
Ok. I see.
$|G|\equiv2\pmod4$, so $G$ has a index-2 normal subgroup $H$, so $|H|=175$.

3175

Threads

7937

Posts

48

Reputation

Show all posts

original poster hbghlyj posted 2023-5-2 17:13
Last edited by hbghlyj 2023-5-19 13:15Lectures in group theory 2017
在页边补充了一些字,制成pdf
pdfpages改正誤植、添加鏈接:
$type group.tex (11.56 KB, Downloads: 59)
$type group.pdf (585.02 KB, Downloads: 59)

Quick Reply

Advanced Mode
B Color Image Link Quote Code Smilies
You have to log in before you can reply Login | Register account

$\LaTeX$ formula tutorial

Mobile version

2025-7-1 06:34 GMT+8

Powered by Discuz!

Processed in 0.020711 seconds, 51 queries