theorem
proved
errorRateCost_at_threshold
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.QuantumComputing.ErrorCorrectionThresholdFromJCost on GitHub at line 47.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
44def errorRateCost (actual_rate threshold_rate : ℝ) : ℝ :=
45 Jcost (actual_rate / threshold_rate)
46
47theorem errorRateCost_at_threshold (r : ℝ) (h : r ≠ 0) :
48 errorRateCost r r = 0 := by
49 unfold errorRateCost; rw [div_self h]; exact Jcost_unit0
50
51theorem errorRateCost_nonneg (a t : ℝ) (ha : 0 < a) (ht : 0 < t) :
52 0 ≤ errorRateCost a t := by
53 unfold errorRateCost; exact Jcost_nonneg (div_pos ha ht)
54
55structure ErrorCorrectionCert where
56 threshold_pos : 0 < surfaceCodeThreshold
57 cost_at_threshold : ∀ r : ℝ, r ≠ 0 → errorRateCost r r = 0
58 cost_nonneg : ∀ a t : ℝ, 0 < a → 0 < t → 0 ≤ errorRateCost a t
59
60noncomputable def cert : ErrorCorrectionCert where
61 threshold_pos := surfaceCodeThreshold_pos
62 cost_at_threshold := errorRateCost_at_threshold
63 cost_nonneg := errorRateCost_nonneg
64
65theorem cert_inhabited : Nonempty ErrorCorrectionCert := ⟨cert⟩
66
67end
68end ErrorCorrectionThresholdFromJCost
69end QuantumComputing
70end IndisputableMonolith