Mathematics · Glossary

What is Barycenter?

Definition 17.3 University Mathematics — Year 2 · Chapter 17 — Affine Spaces

Let (Ai,λi)ik(A_i, \lambda_i)_{i \leq k} be weighted points with λi0\sum\lambda_i \neq 0. The barycenter G=bar((Ai,λi))G = \operatorname{bar}\bigl((A_i, \lambda_i)\bigr) is the unique point with

iλiGAi=0equivalentlyOG=1λiiλiOAi(any O).\sum_i \lambda_i\, \vect{GA_i} = 0 \qquad\text{equivalently}\qquad \vect{OG} = \frac{1}{\sum\lambda_i}\sum_i \lambda_i\,\vect{OA_i} \quad (\text{any } O).

Barycenters are associative (subgroups of points may be replaced by their partial barycenter with the summed weight) and invariant under rescaling of all weights.

Examples

Example 17.7 (Classical barycenter geometry)

The centroid of a triangle ABCABC is the barycenter G=bar(A,1;B,1;C,1)G = \operatorname{bar}(A,1; B,1; C,1). Associativity with the midpoint A=bar(B,1;C,1)A' = \operatorname{bar}(B, 1; C, 1) shows

G=bar(A,1; A,2):G = \operatorname{bar}(A, 1;\ A', 2) :

GG lies on the median AAAA' at two-thirds of it — and likewise for the other two medians: the three medians are concurrent, in one line of barycentric calculus.

Example 17.8 (The bimedians of a quadrilateral)

Let ABCDABCD be any quadrilateral (planar or not!) and consider its bimedians: the segments joining the midpoints of opposite sides, MABMCDM_{AB}M_{CD} and MBCMDAM_{BC}M_{DA}. Introduce the barycenter GG of (A,1;B,1;C,1;D,1)(A,1; B,1; C,1; D,1) and group the weights two ways:

G=bar(MAB,2; MCD,2)=bar(MBC,2; MDA,2):G = \operatorname{bar}\bigl(M_{AB}, 2;\ M_{CD}, 2\bigr) = \operatorname{bar}\bigl(M_{BC}, 2;\ M_{DA}, 2\bigr) :

GG is the midpoint of both bimedians — so the two bimedians always bisect each other, and the quadrilateral of the four midpoints is a parallelogram (its diagonals are the bimedians). No case analysis, no coordinates, and the argument survives unchanged for a skew quadrilateral in R3\R^3, where a picture-based proof would already be delicate: associativity does not care about dimension.

Example 17.12 (Epigraphs are convex sets)

The region C={(x,y):yx2}C = \{(x, y) : y \geq x^2\} above the parabola is convex: for (x1,y1),(x2,y2)C(x_1, y_1), (x_2, y_2) \in C and t[0,1]t \in \intcc01, the convexity inequality of the square function gives

((1t)x1+tx2)2(1t)x12+tx22(1t)y1+ty2,\bigl((1-t)x_1 + tx_2\bigr)^2 \leq (1-t)x_1^2 + tx_2^2 \leq (1-t)y_1 + ty_2 ,

so the barycenter stays above the parabola. The computation is general: {yf(x)}\{y \geq f(x)\} is convex exactly when ff is a convex function — convex sets and convex functions (Chapter 8) are two faces of one notion, epigraphs being the dictionary. This is the geometric reason support lines exist for convex functions, the fact that will prove Jensen’s inequality in Chapter 22.

Read in context →