FrankenRobotics

Mathematics compendium

6,230 words10 subsections10 tablesPlan version 1.1

On this page10
D.1 Groups, frames and inertiaD.2 Time stepping and hybrid eventsD.3 Contact, wheels and terrainD.4 Actuators and powerD.5 Symmetry, similarity and countingD.6 Missions, information and certificatesD.7 Estimation, control and safetyD.8 Statistics and decisionsD.9 Time to an answer, speed-up bounds and capacityD.10 Structure and life

Conventions are those of §11. g = (R, p) = a_from_b is a rigid transform acting as x_a = R·x_b + p; ξ = (ω, v) is a twist, angular part first, body-frame by default; w = (τ, f) is a wrench, torque first; μ = (π, ℓ) is a momentum. The coadjoint convention is stated once and used everywhere: the algebra coadjoint is the dual map ad*_ξ = ad_ξᵀ, with no minus sign; the group coadjoint is the inverse transpose Ad_g⁻ᵀ; and the Euler–Poincaré equation of a left-invariant system in body velocity reads μ̇ = ad*_ξ μ + w. The map ξ ↦ −ad_ξᵀ is never written ad* in this plan (§11.2).

Every row is a mathematical statement. Constants inside a formula are exact. A value that is a choice of this plan is marked DESIGN, and a threshold a gate will test is marked TARGET; the worked numbers behind the rows are in Appendix E. The column "Used in" names the construction, section or card that depends on the row, and the last column says when the statement holds and when it is known to fail.

D.1 Groups, frames and inertia

Name Statement Used in Assumptions and validity
Bracket on 𝔰𝔢(3) [ξ₁, ξ₂] = (ω₁ × ω₂, ω₁ × v₂ − ω₂ × v₁) C-01, C-07, T-11 Angular part first
Adjoint Ad_g(ω, v) = (R·ω, R·v + p × R·ω); Ad(g·h) = Ad(g)·Ad(h) C-02, C-04, T-04 g maps the source frame b to the target frame a
Group coadjoint Wrenches move by Ad_g⁻ᵀ: (τ, f) ↦ (R·τ + p × R·f, R·f) C-02, §11.2, T-04 Same g; this is the wrench pushforward
Algebra adjoint and coadjoint ad_ξ η = [ξ, η] = (ω × η_ω, ω × η_v + v × η_ω); ad*_ξ μ = ad_ξᵀ μ = (π × ω + ℓ × v, ℓ × ω), defined by ⟨ad*_ξ μ, η⟩ = ⟨μ, [ξ, η]⟩ C-04, §11.2, §13.3, T-16 The transpose, with no minus sign; −ad_ξᵀ is written out where it is needed
Three typed frame maps Twist map Ad_g; wrench pushforward Ad_g⁻ᵀ; wrench pullback Ad_gᵀ, the inverse of the pushforward; ⟨Ad_g⁻ᵀ w, Ad_g ξ⟩ = ⟨w, ξ⟩ §11.3, C-02 A Jacobian transpose is a pullback; moving a wrench with the twist map loses the moment arm
Power pairing ⟨w, ξ⟩ = τ·ω + f·v, invariant under a change of frame C-02, §29.9, T-05 Twist and wrench expressed in the same frame
Reflection parity Under x ↦ P·x + t with det P = −1: polar vectors map by P, axial vectors by det(P)·P; twists and wrenches by T(P) = diag(det(P)·P, P) §11.4, C-09, T-16 T(P) preserves the pairing and the bracket because det(P)² = 1
Euler–Poincaré, free body μ̇ = ad*_ξ μ + w. With μ = (π, ℓ): π̇ = π × ω + ℓ × v + τ, ℓ̇ = ℓ × ω + f C-04, §11.2 Body frame, left-invariant kinetic energy. Check: a force-free body keeps R·v constant
Momentum map μ = 𝕀(s)·(ξ + 𝔸(s)·ṡ) C-04, C-08 𝕀 is the locked (composite rigid-body) inertia at the base
Reconstruction ξ = −𝔸(s)·ṡ + 𝕀(s)⁻¹·p; at zero momentum ξ = −𝔸(s)·ṡ C-07, C-08 p is the group momentum; the second term is absent for principally kinematic systems and for zero-momentum free flight. A connection belongs to one contact stratum
Curvature of the connection (D𝔸)ᵢⱼ = ∂ᵢ𝔸ⱼ − ∂ⱼ𝔸ᵢ − [𝔸ᵢ, 𝔸ⱼ]; a small loop of area da in the (i, j) plane gives g ≈ exp(−(D𝔸)ᵢⱼ·da) §11.6, C-08, T-20 Leading order in loop size; large loops keep the ordered product. A formula with +[𝔸ᵢ, 𝔸ⱼ] is wrong by twice the answer on the SO(3) fixture
Cayley map cay(x) = (I − x/2)⁻¹·(I + x/2). On SO(3): R = I + 4/(4 + ‖ω‖²)·(ω̂ + ω̂²/2). On SE(3) the translation is (I − ω̂/2)⁻¹·v C-05, T-01, T-02 Rational; lands on the group exactly; agrees with exp to second order
Cayley angle A Cayley step rotates by 2·atan(‖ω‖·h/2); the relative error is about (‖ω‖·h)²/12 GB-01, C-05 Use bounded by ‖ω‖·h ≤ 0.2 per substep (DESIGN), refused beyond
Planar Cayley z₊ = z·((1 − a²/4) + i·a)/(1 + a²/4), a = ω·h ADR-MARROW-03 Unit complex z; the revolute coordinate is (c, s) plus a turn count
Inverse Cayley differential (Dcay_x)⁻¹ = [[I + ½·ω̂ + ¼·ω·ωᵀ, 0], [½·v̂ + ¼·ω̂·v̂, I + ½·ω̂]] for x = (ω, v); its rotation block inverts to 2/(4 + ‖ω‖²)·(2I − ω̂) C-36 Left-trivialized: cay(x)⁻¹·δcay(x) = Dcay_x(δx). Using the right-trivialized form keeps momentum and destroys the energy bound
Pseudo-inertia 𝖯 = [[Σ, h], [hᵀ, m]] with Σ = ∫ x·xᵀ dm = ½·tr(Ī)·I − Ī and h = m·c; consistent exactly when 𝖯 ≻ 0 C-03, §11.5, T-19 Ī is the rotational inertia about the frame origin
Shell rule 𝖯_shell = 𝖯(Ω, ρ) − 𝖯(Ω_t, ρ) for outer region Ω and inward offset Ω_t; a thin spherical shell tends to I = (2/3)·m·r² §11.5, §14.5 Same frame and density; computed in exact rationals so the subtraction loses nothing
Mass-support bound ‖c − o‖² + tr(I_C)/(2m) ≤ ρ² for mass inside a ball of centre o and radius ρ §11.5, C-03, T-19 Applied to a declared mass envelope, never to a collision proxy
Mobility count M = 6·(n − 1 − j) + Σ fᵢ C-01, A-01 Wrong for over-constrained linkages (Sarrus: count 0, mobility 1; Bennett: count −2, mobility 1), which is why A-01 computes the lattice
Product of exponentials g(θ) = exp(θ₁·Ŝ₁)·…·exp(θₙ·Ŝₙ)·g₀ C-11 Screws in the base frame; polynomial in (cᵢ, sᵢ) with cᵢ² + sᵢ² = 1
Constant-twist chord Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)) with δ = ω·Δt and sinc(0) = 1 C-07 Planar motion at constant twist; exact for straight travel. A unit-speed half turn in one second gives the chord (0, 2/π) m

D.2 Time stepping and hybrid events

Name Statement Used in Assumptions and validity
Trapezoidal variational step With L_d = (h/2)·ξ_kᵀ𝕄ξ_k − (h/2)·(V(g_k) + V(g_k₊₁)) and g_k₊₁ = g_k·cay(h·ξ_k): half kick μ⁺ = μ_k + (h/2)·(f(g_k) + u_k); solve (Dcay_{−hξ_k})⁻ᵀ·𝕄ξ_k = μ⁺; drift c = cay(h·ξ_k), g_k₊₁ = g_k·c, μ° = Ad_cᵀ·μ⁺; half kick μ_k₊₁ = μ° + (h/2)·(f(g_k₊₁) + u_k₊₁) C-36, §16.7 One rigid body in a potential: second order, time-reversible, spatial momentum Ad_g⁻ᵀ·μ exact. For an articulated tree the splitting is not the variational step and no symplectic claim is made
Discrete nonholonomic step v⁺ = v* − M⁻¹·Aᵀ·(A·M⁻¹·Aᵀ)⁻¹·(A·v* − b); ‖v⁺‖_M ≤ ‖v*‖_M when b = 0 C-36, C-07, §18.9 Ideal rolling; with traction limits each multiplier is confined to its friction cone. Energy is conserved; the symmetry momentum in general is not
Chaplygin sleigh v̇ = a·ω², ω̇ = −m·a·v·ω/(I + m·a²); ½·m·v² + ½·(I + m·a²)·ω² is constant C-36, C-07 Blade at offset a from the centre of mass; the direction of linear momentum turns
Saltation matrix Ξ_e = D_x R + (f⁺ − D_x R·f⁻ − D_t R)·(D_x g)/(D_t g + D_x g·f⁻); the event time moves by δt = −(D_x g·δx)/(D_t g + D_x g·f⁻) C-16, T-17 An isolated event with transverse crossing. Refused near grazing, for untied near-simultaneous events and when the active set changes. Bouncing ball: Ξ = [[−r, 0], [−(1 + r)·g/v⁻, −r]], determinant r²
Return map and Floquet multipliers A periodic gait is a fixed point x* = P(x*) on a Poincaré section; DP is the product of flow tangent maps and saltation matrices over a cycle, restricted to the section; the multipliers are the eigenvalues of DP. For a relative periodic orbit x(T) = h·x(0) the monodromy is D(h⁻¹)·DΦ_T C-16, C-10, §22.9 Local orbital stability only; transient growth is reported for non-normal DP. On throughput tiers DP is a product of step Jacobians
Orbit gradient (I − D_x P)ᵀ·λ = ∇_x J at the fixed point; one linear solve per objective C-16, §22.9 Implicit-function theorem; needs 1 not to be a multiplier
Rimless-wheel return map ω₊² ↦ cos²(2α)·(ω₊² + (4g/ℓ)·sin α·sin γ); multiplier cos²(2α), exactly ½ for eight spokes C-16 Spoke half-angle α, slope γ, inelastic impacts
Symmetry–event identity D h(x⁺)·Ξ_e(x⁻) = Ξ_{h·e}(h·x⁻)·D h(x⁻) C-16, T-18 Needed before a symmetry is used across an event; fails by terms proportional to the asymmetry
Rational clocks Base unit 1/L s with L the least common multiple of the period denominators; process i fires when n ≡ φᵢ (mod Nᵢ) with Nᵢ = Tᵢ·L; firings up to clock n number ⌊(n − φᵢ)/Nᵢ⌋ + 1 §11.7, §20.4 No floating-point time is compared; a model whose base unit is finer than a declared limit is refused
Exposure average A sensor reading is a functional of the history over its window (a, b]; an impulse J inside an exposure of length T contributes J/T to that window and nothing to its neighbour §11.8, §20.5 Half-open windows: an event at b belongs to the window ending at b
Single-precision spacing The spacing of f32 values in [2^e, 2^(e+1)) is 2^(e−23) GB-04, §35.8 Anchored offsets in [−4, 4) m have spacing at most 2⁻²² m, about 0.24 µm
Two-sided scaling of a Cholesky solve The computed factor of D·H·D is D times the computed factor of H when D is a diagonal of powers of two §35.10 Absent overflow and underflow. Scaling changes tolerances and their meaning, not the accuracy of the factorization

D.3 Contact, wheels and terrain

Name Statement Used in Assumptions and validity
Friction cone 𝒦_μ = {‖γₜ‖ ≤ μ·γₙ}; its dual is 𝒦_{1/μ} C-06, T-07 Isotropic; elliptic cones by a linear map. The box |γₜ₁|, |γₜ₂| ≤ μ·γₙ admits √2·μ·γₙ on the diagonals and is not used
Spin-factor Jordan product (x₀, x̄) ∘ (y₀, ȳ) = (x₀·y₀ + x̄·ȳ, x₀·ȳ + y₀·x̄); eigenvalues x₀ ± ‖x̄‖ C-06 The second-order cone is its cone of squares
Fast-tier contact problem v = argmin ½·(v − v*)ᵀA(v − v*) + Σ_c ℓ_c(J_c·v), with γ_c = −∇ℓ_c C-06, §16.6, T-08 ℓ_c convex, A positive definite; the Hessian is positive semidefinite by construction
Four-dimensional friction cone 𝒦 = {‖(λ_t1, λ_t2, λ_s/r)‖ ≤ μ·λ_n}, with dual {μ·‖(v_t1, v_t2, r·ω_n)‖ ≤ v_n}; r = 2R/3 for uniform pressure on a disc of radius R and 3πR/16 for a Hertzian distribution C-37, §18.6, T-07 An ellipsoidal approximation of the sliding–spinning law of a finite patch. At v_t = r·ω_n the tangential friction is μ·λ_n/√2
Joint-level rows Stiction: a row whose multiplier lies in [−τ_s, τ_s]. Backlash: −β/2 ≤ q_out − q_motor/N ≤ β/2, two unilateral rows with non-negative multipliers. Hard stop: one unilateral row C-37, §15.6, §18.7 Stribeck dependence enters as a parameter update between steps
Growth vector and cost A direction first reached at bracket depth w costs path length of order ε^(1/w) for a displacement ε; for a differential drive a lateral shift d costs about 4·√(d·b) of wheel travel with half-track b C-07, GB-05 Regular points of a bracket-generating distribution with reversible inputs; a finite mission needs an integrated witness
Squeeze film dh/dt = −2·N·h³/(3π·η·a⁴), so 1/h² − 1/h₀² = 4·N·t/(3π·η·a⁴); μ_eff = ψ·μ_b + (1 − ψ)·η·v·π·a²/(h·N) with ψ = 1 for h ≤ σ and ψ = 0 for h ≥ 3σ §18.8 Stefan's law on a circular patch of radius a under load N; semi-empirical, Estimated; flagged outside the calibrated range of the Hersey number η·v/(p·a)
Pressure–sinkage and shear p = (k_c/b + k_φ)·zⁿ; τ = (c + σ·tan φ)·(1 − e^(−j/K)) §18.10 Semi-empirical; parameters from soil cards
Swept right-angle corner A thin rod of length L turns a right-angle corner between corridors of width a exactly when L ≤ 2√2·a C-33, §19.11 The known answer that defeats any single clearance radius
Clearance sandwich 𝒞_in ⊆ 𝒞_free ⊆ 𝒞_out; a path in 𝒞_in is a feasibility witness, disconnection in 𝒞_out an impossibility certificate; widths between the two critical widths are unknown C-33, §19.11, T-31 Planar base in SE(2); the band follows from cell size and heading bin and is reported

D.4 Actuators and power

Name Statement Used in Assumptions and validity
Port-Hamiltonian form ẋ = (J(x) − R(x))·∇H(x) + G(x)·u, y = G(x)ᵀ·∇H(x), so Ḣ = uᵀy − ∇HᵀR∇H C-38, C-12, §15.5 J skew, R positive semidefinite
Motor axis L·di/dt = V − R_w·i − k·ω; J_r·ω̇ = k·i − b·ω − τ_load; locked-rotor current (V/R_w)·(1 − e^(−t/τ)) with τ = L/R_w C-38, §15.4 k_t = k_e = k in SI units
Motor envelope i ≤ min(I_max, (V_bus − k_e·N·ω)/R); τ = η·N·k_t·i − τ_friction §15.4, A-11 Steady-state electrical model at level L1
Voltage limit and field weakening (λ + L_d·i_d)² + (L_q·i_q)² ≤ (V_lim/ω_e)² with V_lim = V_bus/√2; base speed V_lim/√(λ² + (L·I_max)²); top speed V_lim/(λ − L·I_max) when λ > L·I_max §15.8 Power-invariant dq coordinates, resistance neglected, non-salient for the closed forms; the inscribed circle is conservative by at most 1 − √3/2 of voltage
Thermal node C·Ṫ_w = P_loss − G_th·(T_w − T_amb), with copper loss i²·R₀·(1 + α·(T_w − T₀)) C-38, §15.7 One lumped node; card values are Estimated unless calibrated
Thermal runaway condition With s = i²·R₀·α: a stable equilibrium T_amb + P_amb/(G − s) exists exactly when s < G; runaway begins at I_crit = √(G/(R₀·α)). In general an equilibrium is stable where dP/dT < G C-38, §15.7, A-11 Constant current. Under torque control the loss curve is convex and the equilibrium vanishes at a tangency below the slope estimate
Entropy production σ = P_loss/T_w + G_th·(T_w − T_amb)²/(T_w·T_amb) ≥ 0 whenever P_loss ≥ 0 C-38 A sign check on each assigned loss; it cannot fail for a correct model
Two-RC battery V = OCV(z) − R₀·I − V₁ − V₂; dVₖ/dt = −Vₖ/(Rₖ·Cₖ) + I/Cₖ; dz/dt = −I/Q §15.10 I positive on discharge; R₀ depends on cell temperature; ageing advances between episodes only
Bus power ceiling A source E with series resistance R delivers P only if P ≤ E²/(4·R), at V = [E + √(E² − 4·R·P)]/2 §15.10 Constant-power loads; above the ceiling there is no operating point and the step records a brownout
Four-quadrant transmission Motoring: τ_joint = η_f·N·τ_motor. Back-driven: τ_motor = η_b·τ_joint/N. A screw with lead angle a and friction angle φ has η_f = tan a/tan(a + φ), η_b = tan(a − φ)/tan a, and locks when φ ≥ a §15.9 One multiplier in all quadrants creates energy
Rational gear law From f₂ = r·f₁ and e₁ = −r·e₂ it follows that e₁·f₁ + e₂·f₂ = 0 C-12, T-15 Ideal transformer; a composition of power-preserving maps preserves power
Energy balance Supplied = change in stored + dissipated + exported, per mechanism and per step, with the numerical residual on its own line C-12, C-38, §29.9 Heat held in a thermal node is stored energy, not loss
Cost of transport E/(m·g·d) §24.8 Stated separately for mechanical and electrical energy
Froude number v²/(g·L) §24.8, C-21 L is leg length, or ℓ₀ in canonical form

D.5 Symmetry, similarity and counting

Name Statement Used in Assumptions and validity
Equivariance of the dynamics f(ρ_X(g)·x, ρ_U(g)·u) = ρ_X(g)·f(x, u) for g ∈ Γ_mech C-09, T-10 Exact reduction inside one world uses only Γ_obs intersected with the stabilizers of payload, boundary conditions and contact mode
Reynolds projection W ↦ |Γ|⁻¹·Σ_g ρ_out(g)·W·ρ_in(g)⁻¹ C-09, §13.5 Finite group, linear representations
Isotypic projector P_χ = (d_χ/|Γ|)·Σ_g χ(g)*·ρ(g) C-09, §13.5 χ irreducible of degree d_χ
Complex-type block A complex-type pair of real irreducibles is parameterized by 2×2 blocks [[a, −b], [b, a]] C-09, §13.5 Occurs for Cₙ with n ≥ 3 and no mirror; no group in this plan has an irreducible of quaternionic type
H/K theorem For a periodic orbit of an equivariant system, H/K is cyclic, with K the pointwise and H the setwise symmetries C-10, T-25 Used as an enumeration rule for admissible gait types, not as a list of realized gaits
Max-plus eigenproblem A ⊗ x = λ ⊗ x; λ is the maximum cycle mean of A C-10 Irreducible A
Similarity rescaling Under factors (α_M, α_L, α_T) a quantity of dimension MᵃLᵇTᶜ scales by α_Mᵃ·α_Lᵇ·α_Tᶜ; the subgroup fixing gravity has α_L = λ, α_T = √λ; canonical scales are m₀, ℓ₀ and t₀ = √(ℓ₀/g); n quantities of dimensional rank r give n − r groups C-21, T-09, §17.11 Exact for dimensionally homogeneous kernels; with power-of-two factors the scaled run must match in every bit away from overflow and underflow. Every group must match for similarity
Burnside counting The number of distinct assignments of k types to slots X under Γ is |Γ|⁻¹·Σ_{g ∈ Γ} k^c(g), with c(g) the number of cycles of g on X C-22, §13.6, T-24 Γ is Γ_obs, never Γ_mech alone. The factor is at most |Γ|
Wreath product K ≀ H = K^|X| ⋊ H, of order |K|^|X|·|H| C-22, §13.6 K preserves the module's port invariants and H the decorated ports; both are checked first
Kleene iteration x₀ = ⊥, x_{k+1} = f(x_k) converges to the least fixed point C-12, T-12, GB-03 f monotone and continuous on a complete partial order

D.6 Missions, information and certificates

Name Statement Used in Assumptions and validity
Feasible set of a mission query F = { d ∈ D : ∃π ∈ Π_Y ∀w ∈ W, T(d, π, w) ≠ ∅ ∧ ∀τ ∈ T(d, π, w), A(τ) } C-17, §25.4 W is nonempty and declared before any candidate is tested; executions must progress; a solver failure is unknown
Inner and outer sandwich I ⊆ F ⊆ O. A union of proved inner cells is inner; a cell E leaves O only by a proof that E ∩ F = ∅; cells of O ∖ I are unresolved C-17, D-13, §25.5 Infeasible sample points do not eliminate their cell. F is not convex: the hull of two witnesses can contain an infeasible design
Monotonicity and polarity F is antitone in W and monotone in Π and in A ordered by implication; F(V) ⊆ ⋂_{w ∈ V} F({w}) C-18, §28.13 The inclusion is strict where the controller cannot observe in time which world it is in
Design–world duality For closed loops X and worlds V: V ⊆ X↑ exactly when X ⊆ V↓ C-18, C-28, §25.9 Fixed controllers; an antitone Galois connection
Docking boundary Feasible first commands satisfy 1 − U ≤ p ≤ (U + ½)/2 for U ∈ [½, 1]; with the packet on time a robust causal policy exists exactly when ε < (U + ½)/4, equality excluded; with the packet late none exists C-19, §20.16, T-23 Unit mass, three unit ticks, hidden gain g ∈ {1, 2}, read error in [−ε, +ε]. A scalar model: no device timing follows from it
Two-world success cap With equal priors and a reading of law P in one world and Q in the other, success is at most (1 + TV(P, Q))/2 C-19 A fixed experiment; stochastic packets
Majority of repeated reads n independent reads, each correct with probability q, give a correct majority with probability Σ_{k > n/2} C(n, k)·qᵏ·(1 − q)ⁿ⁻ᵏ: 27/32, 459/512 and 3807/4096 for q = ¾ and n = 3, 5, 7 C-19, §20.6 Independence. Reads that share one fault bit stay at q
Observability Gramian W = Σ_k Φ_kᵀ·H_kᵀ·R_k⁻¹·H_k·Φ_k; the index is the smallest singular value of W on the complement of the declared gauge, in whitened units C-20, §20.11, A-17 Local: full rank does not imply distinguishability, so a global ambiguity search runs beside it
Region certificate An outward-rounded enclosure [c](B) of a constraint c(θ) ≤ 0 on a box B: feasible if its upper end is at most 0, infeasible if its lower end is above 0, otherwise bisect C-32, §25.6 Per constraint, on boxes of about six parameters or fewer. After k bisections in n dimensions a uniform box keeps 2^(−k/n) of each side, so joint paving of twenty dimensions is out of reach
Farkas witness {x ≥ 0, M·x = r} is infeasible if some y has Mᵀy ≥ 0 and rᵀy < 0; for {x ∈ 𝒦, M·x = r} the witness has Mᵀy ∈ 𝒦* and rᵀy < 0 C-32, T-21, §22.5 Checked in exact rationals; only a strict conic witness is accepted, otherwise unknown
Stance family With feet pᵢ = A·qᵢ + d, B = A⁻¹ and e = −B·d: Σ fᵢ = W, Σ qᵢ·fᵢ = B·P + e·W and 0 ≤ fᵢ ≤ cᵢ are linear in (B, e), c and f C-32, §25.13, T-22 Static, planar template, independently commanded forces; false for a passive suspension, which is why the authority model is a field
Dominance by unreachability B dominates A on a cell if the outcome pair (A succeeds, B fails) is unreachable over an enclosure of every joint execution of the product system on shared inputs C-40, §25.16, T-32 Shared inputs are coupled at physical coordinates; outcomes enclosed separately admit the impossible pair
Smale's α-test α(f, z) < (13 − 3√17)/4 ≈ 0.157671 proves that Newton's iteration from z converges quadratically to a root within twice the Newton step; reality needs the robust test α(f, z) < 0.03 with ‖z − Re z‖ < 1/(20·γ(f, z)) C-34, T-34 Evaluated in exact rationals; it proves a nearby nonsingular root and nothing about completeness
Three-pose dyad The fixed pivot O is the circumcentre of the moving pivot's positions: 2·(Pᵢ − P₁)·O = ‖Pᵢ‖² − ‖P₁‖² for i = 2, 3 C-34, §25.21 Degenerate when the three positions are collinear
Minimal failing ideal Admissible sub-worlds are the order ideals of the edit set E; the search returns a failing ideal from which no single edit can be removed C-28, §26.7 1-minimal, not minimum; failure sets are not monotone; worst-case cost quadratic in |E|

D.7 Estimation, control and safety

Name Statement Used in Assumptions and validity
Invariant error η = X̂⁻¹·X; for group-affine dynamics log η obeys a linear equation C-13, §22.3 Noise enters to first order; with biases and delays the filter is labelled imperfect-invariant
Attitude error e_R = ½·(R_dᵀ·R − Rᵀ·R_d)^∨ C-13 Almost-global; excludes rotations by π from the target
Requirement robustness An atom ψ(x) ≥ 0 with declared scale s has ρ = ψ/s; conjunction is min, disjunction max, negation −ρ; G_[0,T] φ at time 0 equals H_[0,T] φ at time T C-30, §24.5 ρ > 0 implies satisfaction, ρ < 0 violation, ρ = 0 decides nothing; an uncovered window yields undetermined (§24.5)
Energy budget ½·m_cap·v² + ∫ max(P_elec, 0) dt + E_stored + E_gravity + E_other + E_reserve ≤ W_abs,min C-31, §22.11, T-28 Needs a physical guide with an absorber on every forward path; passive contact with any μ ≥ 0 only dissipates. Covers stops and guided contacts, not balance
Tube inclusion R_mn((K_m ⊕ E) ∩ G_mn, D) ⊆ K_n ⊖ (−E) for every simultaneously enabled guard G_mn, for cells of measured states with true = measured + e, e ∈ E C-31, §22.11 Subsystems of at most four reduced states; the reduction is a monitored assumption
Single-row shield u(λ) = clip(u_π + λ·R⁻¹·a, lo, hi) is piecewise linear in λ with at most 2n breakpoints; the answer is the least λ ≥ 0 with aᵀu(λ) ≥ b C-31, §22.12 Diagonal metric R; quantifier order ∃u ∀(w, e). Projecting and then clipping is wrong
Residual risk of a shield Per episode at most E[N_breach]·δ₁ + P(N_alarm ≥ 1)·δ₂ + δ₃, with δ₂ the probability that an episode with at least one alarm ends in a violation C-31, §22.12 δ₁ needs independent hidden-state labels; the bound does not survive a shift that moves δ₁

D.8 Statistics and decisions

Name Statement Used in Assumptions and validity
Ville's inequality For a nonnegative supermartingale with E₀ = 1, P(sup Eₙ ≥ 1/α) ≤ α C-15, §24.12 Holds under optional stopping
Betting e-process Eₙ = ∏ᵢ (1 + λᵢ·d̃ᵢ) with predictable bets λᵢ on bounded paired differences d̃ᵢ; for one bit per pair, ln E = (n − k)·ln((1 − p₀)/(1 − p₁)) + k·ln(p₀/p₁) on the promoting side C-15, §16.8, §28.6, GB-06 A supermartingale under the null that B is no better; pairs by world address; refused under an uncontrolled determinism class
Error budget for retries α_i = α/[i·(i + 1)]; since 1/[i·(i + 1)] = 1/i − 1/(i + 1) the sum telescopes to α·m/(m + 1) after m requests and to α in the limit §24.13, T-26 The request is fixed before the draw, the clusters are fresh, and the level is spent whatever the answer
Race correction An N-way race spends α/(N − 1) per comparison, so a null race keeps its best with probability at least 1 − α §24.12, §28.8 Union bound
Paired lower bound With ℓᵢ = ln(aᵢ/bᵢ) over n ≥ 10 pairs, mean ℓ̄ and standard deviation s, the admitted ratio is exp(ℓ̄ − t·s/√n), t the 95th percentile of Student's law with n − 1 degrees of freedom §36.6 Arms run back to back in randomized order on the same host state
Control-variate estimator θ̂ = Ȳ_hi(n) − β·(Ȳ_lo(n) − Ȳ_lo(N)); at the optimal β its variance is Var(Y_hi)/n·(1 − ρ²·(1 − n/N)) C-25, §29.11 The saving is at most 1/(1 − ρ²): about 2 at ρ = 0.7, 5 at ρ = 0.894, 10 at ρ = 0.949
Multilevel estimator E[Y_L] = E[Y₀] + Σ_ℓ E[Y_ℓ − Y_ℓ₋₁], N_ℓ ∝ √(V_ℓ/C_ℓ), total cost (Σ_ℓ √(V_ℓ·C_ℓ))²/ε² for variance ε² C-25 Coupled levels at the same world address; chaotic contact decorrelates long episodes
Doubly robust estimator Zᵢ = mᵢ + Aᵢ·(Yᵢ − mᵢ)/pᵢ with Aᵢ ~ Bernoulli(pᵢ), pᵢ ≥ p_min > 0; E[Zᵢ | past] = E[Yᵢ | past] for any mᵢ; Var(Zᵢ) = Var(Yᵢ) + E[(1 − pᵢ)/pᵢ·(Yᵢ − mᵢ)²] C-25, §29.11 mᵢ and pᵢ are fixed before any high-tier outcome exists; a wrong cheap model inflates variance and never bias
Kendall τ and its top-weighted form τ = (concordant − discordant pairs)/C(n, 2); the gates use τ on the top band, the designs in the top m of either rung with m = max(10, 3k), on the lower bootstrap bound C-26, §16.9, §28.10 TARGET thresholds fixed before data: 0.7, at or above which the cheap rung is used to discard, and 0.5, below which it may not discard; the gate register (§40) governs the band between
Split-conformal survivor set On n audit designs q̂ is the ⌈(n + 1)·(1 − α)⌉-th smallest residual |y_hi − ĝ(y_lo)|; every design within 2·q̂ of the k-th best cheap score advances; a pair separated by more than the margin is misordered with probability at most 2α C-26, §28.9 Exchangeability with the audit set; coverage is on average over calibration draws; α = 0.05 needs n ≥ 19; calibrating on promoted designs under-covers
Reality band A simulated metric in a calibrated cell is reported as [ŷ − q̂, ŷ + q̂] with n and the level §30.12 Draws exchangeable with the calibration draws; an unbuilt design has no band
Zero-failure bound n independent nominal episodes without failure give p ≤ 1 − δ^(1/n) ≤ ln(1/δ)/n at confidence 1 − δ C-27, §26.9 Scoped to its tier; found failures are replayed one tier up
Bounded-weight importance sampling n⁻¹·Σ wᵢ·1[fail] with w = dp/dq ≤ w_max is unbiased with terms in [0, w_max]; with a defensive mixture q = β·p + (1 − β)·q′ the weights are at most 1/β and zero failures certify only p ≤ ln(1/δ)/(β·n) C-27, §26.9 Weights computed exactly from addressed draws; no sampler discounts the price of certifying absence
Splitting variance The product of conditional fractions has squared coefficient of variation near L·(1 − p₀)/(p₀·N) C-27, §26.9 L levels of conditional probability p₀, N trials per level; dependent trials, so the rate is Estimated only
Unseen-mode mass Good–Turing: modes seen once divided by failures seen C-27, §26.9 A stopping signal for exploration, not a bound
Probability of necessity and contrast PN(c) = P(no failure under do(¬c) | failure); the reported contrast is the rescue rate minus the placebo flip rate ρ₀ C-29, §27.6 Bitwise replay; c is named a cause only when PN(c) exceeds ρ₀ under a sequential test
Shapley summary φᵢ = Σ_S |S|!·(n − |S| − 1)!/n!·(v(S ∪ {i}) − v(S)), v(S) the fraction of failures S prevents C-29, §27.7 2ⁿ coalitions; values can be negative and do not identify necessary causes
Value of sample information EVSI = s̃·[φ(z) − z·Φ(−z)] with z = |m|/s̃, for Δ ~ N(m, s²) and an experiment that removes variance s̃² C-39, §28.16, DC-05 Ranks experiments only; verdicts come from C-15, C-25 and C-26
Disjoint-reading probe A probe separates two mechanisms exactly when their sets of possible readings, over the admitted nuisance intervals, are disjoint C-39, §25.14 Conditional on the admitted mechanism set ℳ; an omitted mechanism can reverse the decision

D.9 Time to an answer, speed-up bounds and capacity

Name Statement Used in Assumptions and validity
Restricted mean time and the ratio RMT = E[min(T, H)] at a common deadline H; R = E[min(T_rival, H)] ÷ E[min(T_frob, H)] §2.1, §39 An unresolved mission costs H; cold and warm runs are separate results
Completion cap If the candidate misses a fraction q of deadlines then R ≤ 1/q, because its restricted mean time is at least q·H and the rival's at most H §2.1, §2.3 Holds for any rival
Rate ratio R_rate = (accepted_frob ÷ makespan_frob) ÷ (accepted_rival ÷ makespan_rival). It is a different estimand from the restricted-time ratio: 9.677 against 10.081 on the 25-mission case of §39.20 §39.20 The word ten-fold attaches to the restricted-time ratio only
Smallest suite for a population claim A distribution-free procedure at one-sided level α can certify R ≥ 10 on n independent mission families only if (10/11)ⁿ ≤ α, so n ≥ ln(1/α)/ln(1.1): 32 at α = 0.05, 46 at 0.0125, 49 at 0.01 §39.20 With fewer families the result is a finite-suite result, with no population wording
Recovery ratio r_T = (T_B − T_W)/(T_B − T_F), and r_C likewise for compute, for the declared incumbent B, the composed incumbent W and this system F. If T_F = 0.10·T_B then r_T ≥ 0.8 exactly when T_W ≤ 0.28·T_B §39.22 Defined when F beats B on that measure
General speed-up bound If a fraction f of matched wall time is improved by a factor r with relative overhead h, the speed-up is at most 1/(1 − f + f/r + h); as r → ∞ it tends to 1/(1 − f + h) D-10, §2.3, §17.6, §36.5 Serial cost model on the strongest baseline's critical path; a pruning ratio is never multiplied by a speed-up measured on work already removed
Engine-only ceiling An infinitely fast environment step speeds training by at most 1/(1 − s), s the step's share of training time §2.3, §36.4 Fixed sample count
One design per turn With agent latency t in both arms and training time T_train in the rival, deciding one design per turn gains at most (T_train + t)/t §2.3 Even at zero compute on this side
Compute per decision C ÷ (c + c_T·f), with C the rival's cost per trained candidate, c the cheap rung, c_T the training rung and f the trained fraction §2.3, §28.9 At f = 0 the ceiling is C/c
Padding overhead For work scaling as Lᵖ, a cohort padded to L_max has overhead Ω_p = L_maxᵖ/E[Lᵖ] with 1/r ≤ Ω_p ≤ r⁻ᵖ, r = E[L]/L_max, for 1 ≤ p ≤ 3 §17.5, §21.11 Lower bound from Lᵖ ≤ L_maxᵖ⁻¹·L; upper bound from Jensen's inequality
Bucket bounds A bucket ratio q caps overhead inside a bucket at q for linear stages and q³ for cubic ones; a finer plan with B buckets wins when N·τ·(Ω − Ω_b) > (B − 1)·c_L §17.5, §21.11 τ the unpadded cost of a world-step, c_L the launch overhead of one step plan per step
Mixing ratio Against D designs run one after another with W worlds each, a mixed batch gains D·(c_L + W·τ)/(c_L + Ω·D·W·τ) per step §17.5, §17.14 The weakest fair comparator; the gain is occupancy and vanishes near a thousand worlds per design
Units of throughput An env-step is d world-steps, with d the control period divided by h; env-steps/s = world-steps/s ÷ d; a world-second is 1/h world-steps §36.2, §16.1 The two units are never mixed in one row
Scene memory Samples = volume/spacing³; bytes = 2 × samples at 16 bits GB-07, §19.15 Dense field; a narrow band saves a factor of one to five at 2 cm

D.10 Structure and life

Name Statement Used in Assumptions and validity
Compliance sensitivity With K(ρ) = Σ ρ_eᵖ·K_e and c = FᵀU subject to K(ρ)·U = F: ∂c/∂ρ_e = −p·ρ_eᵖ⁻¹·u_eᵀ·K_e·u_e C-35, §31.7 Self-adjoint, so no extra solve; p = 3 (DESIGN); a density filter fixes the length scale
Two-bar truss At fixed stress the volume of a symmetric two-bar truss under an apex load is proportional to 1/(sin θ·cos θ), least at 45° C-35, §31.18 The known answer for sizing
Cumulative fatigue damage D = Σ nᵢ/N(Sᵢ) over rainflow cycles, with N(S) = (S/S₀)⁻ᵐ (Basquin); failure is predicted at D = 1 C-35, §31.8 Linear rule: ignores load order; open half-cycles are carried between windows; every life figure is Estimated
Tolerance stacks and allocation Worst case Σ |aᵢ|·tᵢ; statistical (Σ aᵢ²·tᵢ²)^½. Minimizing Σ kᵢ/tᵢ under a stack limit gives tᵢ ∝ (kᵢ/aᵢ²)^⅓ for the statistical stack and tᵢ ∝ (kᵢ/|aᵢ|)^½ for the worst case C-35, §31.11 First-order sensitivities aᵢ = ∂f/∂xᵢ; a zero first-order sensitivity needs the second-order term