Theorems · Theorem · real analysis
MonovaryOn.sum_comp_perm_smul_lt_sum_smul_iff
∀ {ι : Type u_1} {α : Type u_2} {β : Type u_3} [inst : Semiring α] [inst_1 : LinearOrder α] [IsStrictOrderedRing α]
[ExistsAddOfLE α] [inst_4 : AddCommMonoid β] [inst_5 : LinearOrder β] [IsOrderedCancelAddMonoid β]
[inst_7 : Module α β] [PosSMulStrictMono α β] {s : Finset ι} {σ : Equiv.Perm ι} {f : ι → α} {g : ι → β},
MonovaryOn f g ↑s → {x | σ x ≠ x} ⊆ ↑s → (∑ i ∈ s, f (σ i) • g i < ∑ i ∈ s, f i • g i ↔ ¬MonovaryOn (f ∘ ⇑σ) g ↑s)Strict inequality case of the Rearrangement Inequality: Pointwise scalar multiplication of
f and g, which monovary together on s, is strictly decreased by a permutation if and only if
f ∘ σ and g do not monovary together on s. Stated by permuting the entries of f.
- Defined in
- Mathlib.Algebra.Order.Rearrangement
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 84 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
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
- Setstatement · cited by 53,352
- Modulestatement and proof · cited by 20,661
- Semiringstatement and proof · cited by 13,802
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- LinearOrderstatement and proof · cited by 8,572
- SetLike.coestatement and proof · cited by 8,199
- Set.ofPredstatement and proof · cited by 6,101
- Finset.sumstatement and proof · cited by 5,195
- IsStrictOrderedRingstatement and proof · cited by 2,490
- Equiv.Permstatement and proof · cited by 1,375
Cited by2
Results whose statement or proof uses this declaration.
- Monovary.sum_comp_perm_smul_lt_sum_smul_iffproof · cited by 1
- MonovaryOn.sum_comp_perm_mul_lt_sum_mul_iffproof · cited by 0