Theorems · Theorem · convex and discrete geometry

Convexity.convexCombPair_def

∀ {R : Type u_1} {M : Type u_3} [inst : PartialOrder R] [inst_1 : Semiring R] [inst_2 : IsStrictOrderedRing R]
  [inst_3 : Convexity.ConvexSpace R M] {s t : R} (hs : 0 ≤ s) (ht : 0 ≤ t) (h : s + t = 1) (p q : M),
  Convexity.convexCombPair s t hs ht h p q = Convexity.iConvexComb (Convexity.StdSimplex.duple 0 1 hs ht h) ![p, q]

Defined in

Mathlib.Geometry.Convex.ConvexSpace.Defs

Cited by

2 results in Mathlib

Foundations

Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

PartialOrderSemiringIsStrictOrderedRingConvexity.ConvexSpace