Theorems · Theorem · convex and discrete geometry

ConvexCone.map_map

∀ {R : Type u_2} {M : Type u_4} {N : Type u_5} {O : Type u_6} [inst : Semiring R] [inst_1 : PartialOrder R]
  [inst_2 : AddCommMonoid M] [inst_3 : AddCommMonoid N] [inst_4 : AddCommMonoid O] [inst_5 : Module R M]
  [inst_6 : Module R N] [inst_7 : Module R O] (g : N →ₗ[R] O) (f : M →ₗ[R] N) (C : ConvexCone R M),
  ConvexCone.map g (ConvexCone.map f C) = ConvexCone.map (g ∘ₗ f) C

Defined in

Mathlib.Geometry.Convex.Cone.Basic

Cited by

0 results in Mathlib

Foundations

Depth 25 from the axioms · uses propext, Quot.sound

Assumes

SemiringPartialOrderAddCommMonoidAddCommMonoidAddCommMonoidModuleModuleModule