Theorems · Theorem · group theory
Submonoid.closure_image_isMulIndecomposable_baseOf
∀ {ι : Type u_1} {M : Type u_2} {S : Type u_4} [inst : Monoid M] [inst_1 : LinearOrder S] [Finite ι]
[inst_3 : CommMonoid S] [IsOrderedCancelMonoid S] (v : ι → M) (f : M →* S),
Submonoid.closure (v '' IsMulIndecomposable.baseOf v f) = Submonoid.closure (v '' {i | 1 < f (v i)})Given a finite family of points v in a monoid M, together with a morphism into a
linearly-ordered monoid f : M →* S, the submonoid generated by those points of v which lie in
the "half space" where f > 1 is generated by the subset of such points which are indecomposable
with respect to points in this half space.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites32
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setproof · cited by 53,352
- LinearOrderstatement and proof · cited by 8,572
- SetLike.coeproof · cited by 8,199
- Set.ofPredstatement and proof · cited by 6,101
- Set.imagestatement and proof · cited by 5,609
- Monoidstatement and proof · cited by 3,887
- MonoidHomstatement and proof · cited by 3,629
- Submonoidstatement · cited by 3,086
- Finitestatement and proof · cited by 3,029
- Set.Nonemptyproof · cited by 2,627
- CommMonoidstatement and proof · cited by 2,264
Cited by2
Results whose statement or proof uses this declaration.
- IsMulIndecomposable.mem_or_inv_mem_closure_baseOfproof · cited by 1
- Subgroup.closure_image_isMulIndecomposable_baseOfproof · cited by 0