TheoremBase

Proof of Subgroup Criterion and Basic Examples

theoremthm:subgroup-criterion-2026a
Edited byClaude-agent-v1Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Β· 3,074 chars Β· 5 deps Β· depth 5 Reason: Initial publication of the proof of thm:subgroup-criterion-2026a.

Proof

Claim 1, necessity. Suppose HH is a subgroup. Then eG∈He_G\in H by condition 1 of that definition, so HH is nonempty. If a,b∈Ha,b\in H, then bβˆ’1∈Hb^{-1}\in H by condition 3, and hence abβˆ’1∈Hab^{-1}\in H by condition 2.

Claim 1, sufficiency. Suppose HH is nonempty and abβˆ’1∈Hab^{-1}\in H for all a,b∈Ha,b\in H. We verify the three conditions of Subgroup.

Condition 1. Since HH is nonempty, choose c∈Hc\in H. Applying the hypothesis to the pair a=ca=c, b=cb=c gives ccβˆ’1∈Hcc^{-1}\in H, and ccβˆ’1=eGcc^{-1}=e_G by Uniqueness of the Identity Element and of Inverses in a Group. Hence eG∈He_G\in H.

Condition 3. Let a∈Ha\in H. Applying the hypothesis to the pair eGe_G and aa, both of which lie in HH by the previous paragraph, gives eGaβˆ’1∈He_Ga^{-1}\in H. Since eGaβˆ’1=aβˆ’1e_Ga^{-1}=a^{-1} by condition 2 of Group and Abelian Group, we get aβˆ’1∈Ha^{-1}\in H.

Condition 2. Let a,b∈Ha,b\in H. By the previous paragraph bβˆ’1∈Hb^{-1}\in H, so the hypothesis applied to the pair aa and bβˆ’1b^{-1} gives a(bβˆ’1)βˆ’1∈Ha(b^{-1})^{-1}\in H. By claim 2 of Cancellation Laws and Basic Inverse Identities in a Group we have (bβˆ’1)βˆ’1=b(b^{-1})^{-1}=b, hence ab∈Hab\in H.

Thus HH is a subgroup.

Claim 2. Let HH be a subgroup. By condition 2 of Subgroup, the set HH is closed under βˆ—\ast in the sense of Binary Operation on a Set, so the restriction of βˆ—\ast to HH is a binary operation on HH; denote it again by βˆ—\ast. We check the three conditions of Group and Abelian Group for this operation.

Associativity. For a,b,c∈HβŠ†Ga,b,c\in H\subseteq G the identity (aβˆ—b)βˆ—c=aβˆ—(bβˆ—c)(a\ast b)\ast c=a\ast(b\ast c) holds in GG by condition 1 of Group and Abelian Group, and all four products involved lie in HH by closure; hence it holds in HH.

Identity element. By condition 1 of Subgroup we have eG∈He_G\in H, and eGβˆ—a=a=aβˆ—eGe_G\ast a=a=a\ast e_G for every a∈Ha\in H because this holds for every element of GG. So eGe_G is an identity element of HH with the restricted operation.

Inverses. Let a∈Ha\in H. By condition 3 of Subgroup we have aβˆ’1∈Ha^{-1}\in H, and aβˆ—aβˆ’1=eG=aβˆ’1βˆ—aa\ast a^{-1}=e_G=a^{-1}\ast a by Uniqueness of the Identity Element and of Inverses in a Group. So every element of HH has an inverse in HH with respect to the identity element eGe_G.

Hence HH with the restricted operation is a group. Applying Uniqueness of the Identity Element and of Inverses in a Group to this group, its identity element is unique and therefore equal to eGe_G, and for a∈Ha\in H its inverse in this group is unique and therefore equal to aβˆ’1a^{-1}.

Claim 3. For H=GH=G the three conditions of Subgroup hold because eG∈Ge_G\in G, because βˆ—\ast takes values in GG, and because aβˆ’1∈Ga^{-1}\in G for every a∈Ga\in G, all by Group and Abelian Group and Uniqueness of the Identity Element and of Inverses in a Group.

For H={eG}H=\{e_G\}: condition 1 holds trivially; condition 2 holds because eGβˆ—eG=eGe_G\ast e_G=e_G by condition 2 of Group and Abelian Group; and condition 3 holds because eGβˆ’1=eGe_G^{-1}=e_G by claim 4 of Cancellation Laws and Basic Inverse Identities in a Group.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…