Theorems · Theorem · group theory
AddSubgroup.closure_add_image_eq_top
∀ {G : Type u_1} [inst : AddGroup G] {H : AddSubgroup G} {R S : Set G} (hR : AddSubgroup.IsComplement (↑H) R),
0 ∈ R → AddSubgroup.closure S = ⊤ → AddSubgroup.closure ((fun g => ⟨g + -↑(hR.toRightFun g), ⋯⟩) '' (R + S)) = ⊤Schreier's Lemma: If R : Set G and H : AddSubgroup G are complements with
0 ∈ R, and if G is generated by S : Set G, then H is generated by the Set
(R + S).image (fun g ↦ g - (hR.toRightFun g)).
- Defined in
- Mathlib.GroupTheory.Schreier
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddGroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Top.topstatement and proof · cited by 9,680
- SetLike.coestatement and proof · cited by 8,199
- Set.imagestatement and proof · cited by 5,609
- AddGroupstatement and proof · cited by 4,410
- AddSubgroupstatement and proof · cited by 3,232
- LE.le.transproof · cited by 3,151
- Set.addstatement · cited by 338
- eq_top_iffproof · cited by 236
- AddSubgroup.mapproof · cited by 189
- AddSubgroup.closurestatement and proof · cited by 156
Cited by1
Results whose statement or proof uses this declaration.
- AddSubgroup.closure_add_image_eq_top'proof · cited by 1