Theorems · Theorem · group theory
IsAddIndecomposable.mem_or_neg_mem_closure_baseOf
∀ {ι : Type u_1} {G : Type u_3} {S : Type u_4} [inst : AddCommGroup G] [inst_1 : LinearOrder S] [Finite ι]
[inst_3 : InvolutiveNeg ι] [inst_4 : AddCommGroup S] [IsOrderedAddMonoid S] (v : ι → G) (f : G →+ S) (i : ι),
f (v i) ≠ 0 →
v (-i) = -v i →
v i ∈ AddSubmonoid.closure (v '' IsAddIndecomposable.baseOf v f) ∨
-v i ∈ AddSubmonoid.closure (v '' IsAddIndecomposable.baseOf v f)- Cited by
- 5 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
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
- AddCommGroupstatement and proof · cited by 12,871
- LinearOrderstatement and proof · cited by 8,572
- Set.imagestatement · cited by 5,609
- AddMonoidHomstatement and proof · cited by 3,230
- Finitestatement and proof · cited by 3,029
- IsOrderedAddMonoidstatement and proof · cited by 1,659
- AddSubmonoidstatement and proof · cited by 1,178
- map_negproof · cited by 378
- AddSubmonoid.closurestatement · cited by 224
- InvolutiveNegstatement and proof · cited by 151
- AddSubmonoid.subset_closureproof · cited by 63
Cited by5
Results whose statement or proof uses this declaration.
- RootPairing.eq_baseOf_of_linearIndepOn_of_mem_or_neg_mem_closureproof · cited by 2
- RootPairing.eq_baseOf_iffproof · cited by 0
- RootPairing.coroot_mem_or_neg_mem_closure_of_rootproof · cited by 0
- IsAddIndecomposable.apply_ne_zero_iff_mem_closureproof · cited by 0
- RootPairing.nonempty_baseproof · cited by 0