structure
definition
PrimitiveCostHypotheses
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Cost.AczelClassification on GitHub at line 53.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
-
reciprocal -
IsCalibrated -
IsNormalized -
IsReciprocalCost -
SatisfiesCompositionLaw -
IsNormalized -
reciprocal -
normalized -
F -
F -
F
used by
formal source
50surface. `JensenSketch` remains available as a compatibility layer, but the
51official statement now records the reciprocal-cost, normalization, composition,
52calibration, and continuity assumptions explicitly. -/
53structure PrimitiveCostHypotheses (F : ℝ → ℝ) : Prop where
54 reciprocal : IsReciprocalCost F
55 normalized : IsNormalized F
56 composition : SatisfiesCompositionLaw F
57 calibrated : IsCalibrated F
58 continuous : ContinuousOn F (Set.Ioi 0)
59
60private theorem H_one_of_normalized (F : ℝ → ℝ)
61 (hNorm : IsNormalized F) : H F 0 = 1 := by
62 have h0 : F 1 = 0 := by simpa [IsNormalized] using hNorm
63 simp [H, G, h0]
64
65private theorem H_continuous_of_positive_continuous (F : ℝ → ℝ)
66 (hCont : ContinuousOn F (Set.Ioi 0)) : Continuous (H F) := by
67 have h := ContinuousOn.comp_continuous hCont Real.continuous_exp
68 have h' : Continuous (fun t => F (Real.exp t)) :=
69 h (by intro t; exact Set.mem_Ioi.mpr (Real.exp_pos t))
70 have h_add : Continuous (fun t : ℝ => F (Real.exp t) + (1 : ℝ)) :=
71 h'.add (continuous_const : Continuous fun _ : ℝ => (1 : ℝ))
72 simpa [H, G] using h_add
73
74private theorem H_dAlembert_of_composition (F : ℝ → ℝ)
75 (hComp : SatisfiesCompositionLaw F) :
76 ∀ t u, H F (t + u) + H F (t - u) = 2 * H F t * H F u := by
77 let Gf : ℝ → ℝ := G F
78 have h_direct : DirectCoshAdd Gf :=
79 CoshAddIdentity_implies_DirectCoshAdd F ((composition_law_equiv_coshAdd F).mp hComp)
80 intro t u
81 have hG := h_direct t u
82 have h_goal : (Gf (t + u) + 1) + (Gf (t - u) + 1) = 2 * (Gf t + 1) * (Gf u + 1) := by
83 calc