Volume I opens by fixing the arena. Assumption 2.1 (Manifold Structure): the state space \(X\) is a smooth, finite-dimensional Riemannian manifold, locally compact and second-countable — general enough to hold a cell’s metabolic state, a star’s internal structure, or a tick-data embedding of a financial market. Assumption 2.2 (Trajectory Regularity): a system trajectory \(\gamma : [0,T] \to X\) is piecewise \(C^2\), locally non-degenerate (\(\|\dot\gamma(t)\| \neq 0\) almost everywhere), with bounded curvature on compact intervals prior to any folding event. These two assumptions alone are the entire starting point — nothing about contact geometry yet.
The stub this page replaces asked the right question: why contact geometry, not Riemannian? Volume I answers it precisely in §16 (Dimensional Threshold), not as a design choice but as a theorem-backed necessity: dimension 3 is the minimum dimension for non-trivial contact geometry. The paper states it directly — “the dm³ framework lives on a 3-dimensional contact manifold not by convention but by the structure theorem for contact manifolds.”
Keep the epistemic status straight from week one: Assumptions 2.1–2.2 and the operator definitions built on them (next week) are proved, machine-checked in PrincipiaVol1.lean. The N=3 / Collatz correspondence (Conjecture 16.1) is explicitly not proved — it is stated as an open, argued conjecture. Volume I is unusually careful about this line, and this course will be too.
PrincipiaVol1.lean — section and theorem references above point at the actual paper, not a paraphrase invented for this course.-- dm³ 101 · Week 01 · Grounded in PrincipiaVol1.lean -- Real theorem names from the source paper (§17 Formal Status): -- Machine-checked (0 sorry): -- P2: Contact non-degeneracy c(ρ) — proved -- Club filter / stationary sets (regular α) — proved -- Open (explicitly marked, NOT proved): -- O6 — Conjecture 16.1: discrete contact-geometric threshold N=3 / c=3 -- This week is conceptual (Assumptions 2.1–2.2); the first Lean -- definitions arrive in Week 2 with the operator structures. example : True := trivial