Convex space: Difference between revisions

From testwiki
Jump to navigation Jump to search
Undid revision 1202361980 by 2600:6C50:4F3F:F695:A9AA:7164:B9A1:7DF9 (talk)
 
(No difference)

Latest revision as of 17:19, 2 February 2024

In mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any sets of points.[1][2]

Formal Definition

A convex space can be defined as a set X equipped with a binary convex combination operation cλ:X×XX for each λ[0,1] satisfying:

  • c0(x,y)=x
  • c1(x,y)=y
  • cλ(x,x)=x
  • cλ(x,y)=c1λ(y,x)
  • cλ(x,cμ(y,z))=cλμ(cλ(1μ)1λμ(x,y),z) (for λμ1)

From this, it is possible to define an n-ary convex combination operation, parametrised by an n-tuple (λ1,,λn), where iλi=1.

Examples

Any real affine space is a convex space. More generally, any convex subset of a real affine space is a convex space.

History

Convex spaces have been independently invented many times and given different names, dating back at least to Stone (1949).[3] They were also studied by Neumann (1970)[4] and Świrszcz (1974),[5] among others.

References

Template:Reflist