recognition /
NumberTheory /
NumberTheory.PhaseFailureCost /
explainer
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)
29 def cumulativeFailureCost (_n : ℕ) (costOf : ℕ → ℝ) (S : Finset ℕ) : ℝ :=
proof body
Definition body.
30 S.sum costOf
31
32 /-- If every gate in a nonempty finite set fails and each failed gate has
33 positive cost, then the cumulative cost is positive. -/
used by (6)
From the project-wide theorem graph. These declarations reference this one in their body.
depends on (9)
Lean names referenced from this declaration's body.
has
in IndisputableMonolith.Engineering.AsteroidOreSpectroscopy
decl_use
cost
in IndisputableMonolith.Foundation.MultiplicativeRecognizerL4
decl_use
cost
in IndisputableMonolith.Foundation.ObserverForcing
decl_use
is
in IndisputableMonolith.Foundation.OptionAEmpiricalProgram
decl_use
is
in IndisputableMonolith.Foundation.SimplicialLedger.EdgeLengthFromPsi
decl_use
is
in IndisputableMonolith.GameTheory.MechanismDesignFromSigma
decl_use
is
in IndisputableMonolith.Mathematics.RamanujanBridge.MockThetaPhantom
decl_use
and
in IndisputableMonolith.NumberTheory.CirclePhaseLift
decl_use
S
in IndisputableMonolith.Relativity.ILG.Action
decl_use