PYTHON · NUMPY

Structure, not proof

Earn the certificate by CONSTRUCTION at any number of joints — where proving it box-by-box is astronomically infeasible.

01Challenge

Verify that a port-Hamiltonian energy gives V̇ = −q̇ᵀKd q̇ to machine precision on a multi-joint arm, at any size.

Predict firstAs joints grow, what happens to the STRUCTURAL certificate vs a box PROOF?

02Model

Proving a certificate by box refinement costs (2R/h)^(state-dim) — it walls out at ~8 dimensions. Physics gives a way out: structure the energy as a port-Hamiltonian, and the manipulator identity q̇ᵀ(½Ṁ−C)q̇ = 0 makes V̇ = −q̇ᵀKd q̇ ≤ 0 exactly — analytic, at ANY number of joints.

03Guided practice

For an N-link arm with mass matrix M(q), the energy-shaping controller gives a closed-loop energy whose derivative cancels to −q̇ᵀKd q̇ by the skew-symmetry of Ṁ−2C. Check it to machine precision, and compare to the box count a proof would need.

04Feedback

PASS WHEN PASS when the structural identity V̇ = −q̇ᵀKd q̇ holds to machine precision at N=2 and N=4.

If your run fails, check:

The skew-symmetry of Ṁ−2C kills the cross terms exactly, at any N — the certificate is free.
Notice the box count: it is astronomically large already at N=4. Structure scales where proof cannot.

05Retrieve & space

Why does a box-refinement proof become infeasible as the joints grow?
What physical property makes V̇ cancel to −q̇ᵀKd q̇?

06Mastery & project

Structure, not proof: a physics-structured energy is a Lyapunov certificate by construction, at any dimension.

Raise N to 6 and 8 and confirm the identity still holds to machine precision while the box count explodes.

← The same energy is the proof Verify before you commit →

PYTHON · NUMPY

Structure, not proof

A planar N-link arm. Confirm the structural identity holds to machine precision at N=2 and N=4 — and see the box count a proof would need explode.

You read

the arrays and values already in scope

You change

the code you write in each cell

Fixed

the dataset and the checks that grade you