Complete Bertrand proof · typed mixed graph

Bertrand theorems and conservative definitions

Proof arrows and notation arrows are different relations. Only theorem-proof arrows participate in the exact prerequisite path to Bertrand’s postulate.

Sparse modes suppress visual objects only. Every exact proof and notation relation remains in the selected-node panel and graph data; large views use compact clickable marks.

Loading graph…

Loading…

Proof arrows run from prerequisite to dependent; notation arrows run from a theorem or definition to the definition it uses. Select any node to inspect every direct relation.

theorem definition proof dependency uses definition