Theorems · Theorem · real analysis
Monovary.sum_comp_perm_smul_eq_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 α β] {σ : Equiv.Perm ι} {f : ι → α} {g : ι → β} [inst_9 : Fintype ι],
Monovary f g → (∑ i, f (σ i) • g i = ∑ i, f i • g i ↔ Monovary (f ∘ ⇑σ) g)Equality case of the Rearrangement Inequality: Pointwise scalar multiplication of f and
g, which monovary together, is unchanged by a permutation if and only if f ∘ σ and g monovary
together. Stated by permuting the entries of g.
- Defined in
- Mathlib.Algebra.Order.Rearrangement
- Cited by
- 1 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.
Cites21
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
- Modulestatement and proof · cited by 20,661
- Semiringstatement and proof · cited by 13,802
- AddCommMonoidstatement and proof · cited by 12,281
- LinearOrderstatement and proof · cited by 8,572
- SetLike.coeproof · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Set.ofPredproof · cited by 6,101
- Finset.sumstatement · cited by 5,195
- Finset.univstatement and proof · cited by 3,473
- IsStrictOrderedRingstatement and proof · cited by 2,490
- Equiv.Permstatement and proof · cited by 1,375
Cited by1
Results whose statement or proof uses this declaration.
- Monovary.sum_comp_perm_mul_eq_sum_mul_iffproof · cited by 0