Let \(N \leq G\).

**Proposition.** The left cosets of \(N\) in \(G\) partition \(G\).

*Proof:* First we show their union is precisely \(G\). Since \(N \leq G\), \(1 \in N\) so \(g \in gN\). Hence

\[\bigcup_{g \in G} gN = G.\]

Next we show that distinct cosets have empty intersection. We argue by contraposition. Assume \(uN \cap vN \neq \emptyset\). There exist \(m,n \in N\) such that \(um = vn\) . So \(m = u^{-1}vn \in N\), and by closure we have \(u^{-1}v \in N\) also.

Thus, for all \(x \in N\), \(u^{-1}vx \in N\). This implies that \(vx \in uN\), so \(vN \subseteq uN\).

A similar argument implies \(uN \subseteq vN\). Therefore \(uN = vN\).

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

There are no comments in this discussion.