Theorems · Theorem · convex and discrete geometry

stdSimplex.map_comp_apply

∀ {S : Type u_1} [inst : Semiring S] [inst_1 : PartialOrder S] {X : Type u_2} {Y : Type u_3} {Z : Type u_4}
  [inst_2 : Fintype X] [inst_3 : Fintype Y] [inst_4 : Fintype Z] [inst_5 : IsOrderedRing S] (f : X → Y) (g : Y → Z)
  (x : ↑(stdSimplex S X)), stdSimplex.map g (stdSimplex.map f x) = stdSimplex.map (g ∘ f) x

Defined in

Mathlib.Analysis.Convex.StdSimplex

Cited by

0 results in Mathlib

Foundations

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

Assumes

SemiringPartialOrderFintypeFintypeFintypeIsOrderedRing