Foundations · math
Build the math tools
one by one.
Before touching any algorithm, build the math tools robotics uses, one by one: a group 0 ramp for readers starting from high school (six bridges out of trig identities, derivatives, the dot product, the normal distribution, circular motion, and complex multiplication), plus the probability–optimization axis behind reinforcement learning (probability axioms, conditional expectation, concentration inequalities, fixed points, Markov chains, Bellman, duality, Robbins–Monro) and the contact–convex-geometry axis behind manipulation and tactile sensing (Hertzian contact, the friction cone, force closure, rolling kinematics, slip detection). Every article leads with motivation, proves everything, and runs the numbers.
The bar: after reading every proof on this level, no step inside the lesson pages (the /k/ articles) is left dangling with «why is this allowed». Group 0 is the ramp for high-school starts; the other groups do not depend on it — read both orderings and pick yours.
Motivation first (where you get stuck without it) → two-layer definitions (intuition + rigor, and what the rigorous layer guards against) → complete proofs («easy to see» is banned) → an example you can compute by hand → numbers you can run → where it shows up in robotics → self-test questions.
The /k/ lesson pages tell you which math tool each algorithm leans on; the proofs of those tools live here. When a lesson step feels unjustified, the justification is an article on this level.
Group 0 · starting from high school
From angle-sum identities, derivatives, the vector dot product, the normal distribution, circular motion, and complex multiplication — six things you already know from high school, six bridges into deep water, with notation kept to a minimum
Linear algebra & geometry
Basis and coordinates, matrix multiplication as transform chaining, Jacobians, eigenvectors, SVD and the pseudoinverse, Taylor expansion — the second foundation of robotics: how coordinates are kept, how transforms chain, how approximations get an error receipt
Probability & expectation
Axioms, construction, conditional expectation, concentration inequalities — the full groundwork under the word «expectation» in RL
Convergence & fixed points
Where «it certainly converges» and «time average equals ensemble average» actually come from
Decision & optimization
Markov axioms, dynamic programming, constrained optimization
Stochastic approximation
Iterating with noise — the last foundation block under TD and Q-learning
Contact & convex geometry
Hertzian contact, the friction cone, force closure, rolling kinematics, slip detection — the five math foundations of manipulation and tactile sensing
Order and boundaries
Group 0 is the ramp for readers starting from high school — only T1–T6. The other groups assume calculus and linear algebra are in place; the numbering is the dependency order, and skipping ahead is at your own cost. Every article ends with a «boundaries» section that states honestly where it stops and where to go for the rest. Want these tools running end to end on a real task? Head to the roadmap or the labs.