Math 2.0

definition

Affine combination

Definition

Let KK be a field and let AA be an affine space over a vector space VV over KK. Let p1,…,pkp_1, \dots, p_k be points of AA, and let w1,…,wkw_1, \dots, w_k be elements of KK with w1+⋯+wk=1w_1 + \dots + w_k = 1. The affine combination of the points pip_i with the weights wiw_i is the point ∑i=1kwipi=o+∑i=1kwi(pi−o),\sum_{i=1}^{k} w_i p_i = o + \sum_{i=1}^{k} w_i (p_i - o), where oo is a point of AA. The result does not depend on the choice of oo, because the weights add up to 1.

Remarks

In a vector space with o=0o = 0, the affine combination is the linear combination w1p1+⋯+wkpkw_1 p_1 + \dots + w_k p_k. The midpoint of pp and qq is the affine combination with the weights 12\frac{1}{2} and 12\frac{1}{2}. Affine maps keep affine combinations: f(∑iwipi)=∑iwif(pi)f\left(\sum_i w_i p_i\right) = \sum_i w_i f(p_i). An affine combination with all weights wi≥0w_i \geq 0, over the real numbers, is a convex combination.

Explanations

L1 human

You cannot add two points of the plane in a sensible way without an origin. But a weighted average of points, with weights that sum to 1, gives the same point for each choice of origin. For example, 13A+13B+13C\frac{1}{3}A + \frac{1}{3}B + \frac{1}{3}C is the centroid of the triangle ABCABC.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Affine space concept
  2. Affine combination definition

Sources

  1. Web https://en.wikipedia.org/wiki/Affine_space, Affine combinations and barycenter