theorem
proved
path_weight_pos
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Foundation.PathIntegralDeep on GitHub at line 39.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
36def path_weight (r hbar : ℝ) : ℝ := Real.exp (-(Jcost r) / hbar)
37
38/-- Path weight is always positive. -/
39theorem path_weight_pos (r hbar : ℝ) : 0 < path_weight r hbar :=
40 Real.exp_pos _
41
42/-- Path weight is maximized at r = 1 (minimum action = 0). -/
43theorem path_weight_max_at_eq (hbar : ℝ) (h : 0 < hbar) :
44 ∀ r : ℝ, path_weight r hbar ≤ path_weight 1 hbar := by
45 intro r
46 unfold path_weight
47 apply Real.exp_le_exp.mpr
48 apply neg_le_neg
49 apply div_le_div_of_nonneg_right _ h
50 exact Jcost_nonneg (by positivity)
51
52/-- Gaussian approximation near r = 1: weight ≈ 1 - ε²/(2ℏ). -/
53theorem gaussian_approx_at_eq (hbar : ℝ) : path_weight 1 hbar = 1 := by
54 unfold path_weight; rw [Jcost_unit0, neg_zero, zero_div, Real.exp_zero]
55
56structure PathIntegralDeepCert where
57 path_weight_pos : ∀ r hbar : ℝ, 0 < path_weight r hbar
58 path_weight_max : ∀ hbar : ℝ, 0 < hbar → ∀ r : ℝ, path_weight r hbar ≤ path_weight 1 hbar
59 weight_one_at_eq : ∀ hbar : ℝ, path_weight 1 hbar = 1
60
61noncomputable def pathIntegralDeepCert : PathIntegralDeepCert where
62 path_weight_pos := fun r hbar => path_weight_pos r hbar
63 path_weight_max := path_weight_max_at_eq
64 weight_one_at_eq := gaussian_approx_at_eq
65
66theorem pathIntegralDeepCert_inhabited : Nonempty PathIntegralDeepCert :=
67 ⟨pathIntegralDeepCert⟩
68
69end