Theorems · Theorem · convex and discrete geometry

Convexity.subtypeVal_iConvexComb

∀ {I : Type u_2} {R : Type u_3} {X : Type u_5} [inst : Semiring R] [inst_1 : PartialOrder R]
  [inst_2 : IsStrictOrderedRing R] [inst_3 : Convexity.ConvexSpace R X] (s : Set X) (hs : Convexity.IsConvexSet R s)
  (w : Convexity.StdSimplex R I) (f : I → ↑s), ↑(Convexity.iConvexComb w f) = Convexity.iConvexComb w fun i => ↑(f i)

Defined in

Mathlib.Geometry.Convex.Set

Cited by

1 results in Mathlib

Foundations

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

Assumes

SemiringPartialOrderIsStrictOrderedRingConvexity.ConvexSpace