Theorems · Theorem · real analysis
Antivary.sum_mul_lt_sum_mul_comp_perm_iff
∀ {ι : Type u_1} {α : Type u_2} [inst : Semiring α] [inst_1 : LinearOrder α] [IsStrictOrderedRing α] [ExistsAddOfLE α]
{σ : Equiv.Perm ι} {f g : ι → α} [inst_4 : Fintype ι],
Antivary f g → (∑ i, f i • g i < ∑ i, f i • g (σ i) ↔ ¬Antivary f (g ∘ ⇑σ))Strict inequality case of the Rearrangement Inequality: Pointwise multiplication of
f and g, which antivary together, is strictly decreased by a permutation if and only if
f and g ∘ σ do not antivary together. Stated by permuting the entries of g.
- Defined in
- Mathlib.Algebra.Order.Rearrangement
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Semiringstatement and proof · cited by 13,802
- LinearOrderstatement and proof · cited by 8,572
- Fintypestatement and proof · cited by 7,736
- Finset.sumstatement · cited by 5,195
- Finset.univstatement · cited by 3,473
- IsStrictOrderedRingstatement and proof · cited by 2,490
- Equiv.Permstatement and proof · cited by 1,375
- ExistsAddOfLEstatement and proof · cited by 330
- Antivarystatement and proof · cited by 121
- Antivary.sum_smul_lt_sum_smul_comp_perm_iffproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.