pith. machine review for the scientific record. sign in
theorem proved term proof

failed_gate_count_bounded_at_KTheta

show as:
view Lean formalization →

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)

  66theorem failed_gate_count_bounded_at_KTheta
  67    {n : ℕ} {costOf : ℕ → ℝ} {S : Finset ℕ}
  68    (stable : StableIntegerLedgerBudget n costOf)
  69    (floor : KThetaFailureFloorHypothesis n costOf)
  70    (hfails : ∀ c ∈ S, GateFails n c) :
  71    KTheta * (S.card : ℝ) ≤ stable.budget := by

proof body

Term-mode proof.

  72  apply failed_gate_count_bounded_by_budget stable
  73  exact ⟨KTheta_pos, hfails, fun c hc => floor.floor c (hfails c hc)⟩
  74
  75end BoundedPhaseVisibility
  76end NumberTheory
  77end IndisputableMonolith

depends on (7)

Lean names referenced from this declaration's body.