Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

convex combination

A blend of points, each weighted nonnegatively, with the weights summing to exactly 1.

A convex combination of points x_1,\dots,x_k\in\mathbb R^n is a point \theta_1x_1+\cdots+\theta_kx_k with \theta_i\ge0 for every i and \sum_i\theta_i=1. For k=2 this traces exactly the straight segment between x_1 and x_2 as \theta_1 sweeps from 0 to 1; a set is convex exactly when it contains every convex combination of its own points.

Read the full section →
Graph settings

Calculator