How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
One-step subgroup test: a nonempty is a subgroup iff for all ; the identity and the inverses of are then those of
Statement
Let be a group (Group and abelian group) with identity and let be nonempty. Then is a subgroup of (Subgroup) if and only if
Moreover, if is nonempty, closed under the operation of , and is a group under that restricted operation with some identity element and some inverse for each , then and for every ; so is a subgroup in the sense of Subgroup, and "subgroup" and "subset that is a group under the restricted operation" agree.
Facts & Assumptions
Given: A group with identity , and a nonempty subset .
A subgroup is a subset containing and closed under the operation and under inverses; it is then a group under the restricted operation, with identity and with the inverses of (Subgroup).
The group laws in : associativity, the two-sided identity , and two-sided inverses (Group and abelian group).
Uniqueness of inverses in a monoid, in the sharp form: if is invertible and or , then (In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided).
Proof
Necessity. Suppose is a subgroup and let . Then by closure under inverses, and by closure under the operation.
Sufficiency, the identity. Suppose for all . Since is nonempty, choose ; taking gives .
The second claim, the identity. Let be nonempty, closed under the operation, and a group under the restricted operation with identity . Then in , hence in ; also in . Cancelling on the left in gives .
Sufficiency, inverses. Let . Taking , which lies in by step 1.2, gives .
The second claim, inverses. Let with inverse for the restricted operation, so by step 1.3. Since is invertible in , uniqueness of inverses gives ; in particular .
Sufficiency, products. Let . By step 2.1, , so applying the hypothesis to the pair and gives , and , so .
Hence such an contains by step 1.3, is closed under the operation by assumption, and is closed under inverses by step 2.2: it is a subgroup in the sense of Subgroup.
Steps 1.2, 2.1 and 3.1 verify (S1), (S3) and (S2), so is a subgroup; with step 1.1 this proves the equivalence.
The one-step test characterises subgroups among nonempty subsets, and a nonempty subset that is a group under the restricted operation is a subgroup with the same identity and the same inverses as .
Remarks
-
Why the second claim is needed at all. Nothing in the phrase "is a group under the restricted operation" forces the identity of that group to be the identity of ; the hypothesis only says some element acts as an identity within . Cancellation in is what collapses the two, and it is available because is a group. In a monoid the corresponding statement is false: a subset closed under the operation can be a monoid whose identity is not the identity of the ambient monoid, as inside shows, where is an idempotent acting as an identity on that subset.
-
Nonemptiness cannot be dropped from the one-step test, since the empty set satisfies the condition vacuously and is not a subgroup: it does not contain .
-
Closure under the operation alone is not enough, even for a nonempty subset: the nonnegative integers inside are closed under addition and contain , but are not a subgroup, as recorded on the companion page.
Depends on
- Subgroup
- Group and abelian group
- In a group $e^{-1} = e$, $(g^{-1})^{-1} = g$ and $(gh)^{-1} = h^{-1}g^{-1}$, the order of the last product being essential
- Cancellation in a group: $gx = gy$ or $xg = yg$ forces $x = y$; equivalently left and right translation by $g$ are bijections of $G$, so $gx = h$ and $xg = h$ each have exactly one solution
- In a monoid, a left inverse and a right inverse of the same element are equal; hence an invertible element has exactly one inverse, and it is two-sided
Used by
- A nonempty subset of a group closed under the operation need not be a subgroup: the nonnegative integers inside (ℤ, +) Counterexample
- nℤ is a subgroup of (ℤ, +) for every n ∈ ℤ, and every subgroup of (ℤ, +) has this form Example
- The eight vertex permutations of a square form a non-abelian subgroup of Sym({1,2,3,4}) of order 8, generated by a 4-cycle and one diagonal swap Example
- The Klein four-group as the subgroup {id, (12)(34), (13)(24), (14)(23)} of Sym({1,2,3,4}): abelian of order 4, non-cyclic, every non-identity element of order 2 Example
- The subgroup orders in Sym({1,2,3}) are 1,2,3 and 6 Example
- FALSE: The union of two subgroups is a subgroup False statement
- ⟨ g ⟩ = { gⁿ : n ∈ ℤ }, and every cyclic group is abelian Lemma
- C_G(x) and N_G(H) are subgroups of G Lemma
- Core_G(H) is the largest normal subgroup of G contained in H Lemma
- Every subgroup of (ℤ, +) is ⟨ n ⟩ = nℤ for exactly one natural number n Lemma
- Ideal criteria and intersections of ideals Lemma
- If H≤ G and N is normal in G, then HN is a subgroup and H∩ N is normal in H Lemma
- Subring criterion: S ⊆ R is a subring if and only if 1_R ∈ S and a - b ∈ S and ab ∈ S for all a, b ∈ S; and an intersection of subrings is a subring Lemma
- The intersection of a nonempty family of subgroups of G is a subgroup of G Lemma
- The one-step submodule criterion; intersections and sums of submodules are submodules Lemma
- The stabilizer Gₓ is a subgroup of G Lemma
- aℤ + bℤ = gcd(a,b) ℤ and aℤ ∩ bℤ = lcm(a,b) ℤ; equivalently, in (ℤ,+) the subgroup generated by {a,b} is ⟨ gcd(a,b) ⟩ and ⟨ a ⟩ ∩ ⟨ b ⟩ = ⟨ lcm(a,b) ⟩ Theorem
- Correspondence theorem: subgroups of G/N correspond to subgroups of G containing N, with normality preserved Theorem
- The image of a group homomorphism is a subgroup and its kernel is a normal subgroup Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 14 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Subgroup test (Wikipedia) (standard reference, not scraped)
- Subgroup (Wikipedia) (standard reference, not scraped)