No prose has been written for this declaration yet. The Lean source and graph data below render
without it.
generate prose now
formal statement (Lean)
29structure MinimalEngine where
30 costOf : ℕ → ℕ → ℝ
31 stable :
32 ∀ n : ℕ, NonIdentityReciprocal n → StableIntegerLedgerBudget n (costOf n)
33 floor :
34 ∀ n : ℕ, NonIdentityReciprocal n → KThetaFailureFloorHypothesis n (costOf n)
35
36/-- A minimal engine yields a successful admissible gate for every
37nonidentity reciprocal ledger. -/
used by (4)
From the project-wide theorem graph. These declarations reference this one in their body.
depends on (10)
Lean names referenced from this declaration's body.
-
reciprocal
in IndisputableMonolith.Algebra.CostAlgebra
decl_use
-
A
in IndisputableMonolith.Foundation.IntegrationGap
decl_use
-
reciprocal
in IndisputableMonolith.Foundation.LedgerForcing
decl_use
-
for
in IndisputableMonolith.Foundation.UniversalForcingSelfReference
decl_use
-
admissible
in IndisputableMonolith.Information.Thermodynamics
decl_use
-
A
in IndisputableMonolith.Masses.Anchor
decl_use
-
A
in IndisputableMonolith.Modal.Actualization
decl_use
-
KThetaFailureFloorHypothesis
in IndisputableMonolith.NumberTheory.BoundedPhaseVisibility
decl_use
-
NonIdentityReciprocal
in IndisputableMonolith.NumberTheory.BoundedPhaseVisibility
decl_use
-
StableIntegerLedgerBudget
in IndisputableMonolith.NumberTheory.T1PhaseBudgetBound
decl_use