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.
The intersection of a nonempty family of subgroups of is a subgroup of
Statement
Let be a group (Group and abelian group) and let be a nonempty set of subgroups of (Subgroup). Then the intersection
is a subgroup of . In particular the intersection of two subgroups is a subgroup.
Facts & Assumptions
Given: A group with identity , a nonempty set of subgroups of , and the intersection of the members of .
Each contains , is closed under the operation, and is closed under inverses (Subgroup).
One-step test: a nonempty subset with for all is a subgroup (One-step subgroup test: a nonempty is a subgroup iff for all ; the identity and the inverses of are then those of ).
Proof
, since every member of is a subset of and is nonempty.
, since for every ; in particular is nonempty.
Let and let be arbitrary. Then , so by closure under inverses and by closure under the operation.
Since was arbitrary in step 1.3, lies in every member of , that is .
is a nonempty subset of satisfying the one-step test, hence a subgroup of .
Remarks
-
The hypothesis that is nonempty is load bearing. The intersection of the empty family of subsets of is not a subset of by any convention used here; the statement is made for a nonempty family so that step 1.1 is available.
-
This lemma is what makes The subgroup generated by a subset, the cyclic subgroup , and cyclic groups legitimate: the family of subgroups containing a given subset is nonempty, since itself belongs to it, so its intersection is a subgroup, and it is by construction the smallest subgroup containing .
Depends on
Used by
- The subgroup ⟨ S ⟩ generated by a subset, the cyclic subgroup ⟨ g ⟩, and cyclic groups Definition
- FALSE: The union of two subgroups is a subgroup False statement
- 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 normal subgroups is normal 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
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 14 results over 12 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 (Wikipedia) (standard reference, not scraped)