def
definition
G
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Cost.FunctionalEquation on GitHub at line 23.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
cost_algebra_unique -
cost_algebra_unique_aczel -
J_defect_form -
H_RSZeroParameterStatus -
E_coh -
ml_zero_parameter_certificate -
BridgeData -
lambda_rec -
lambda_rec_dimensionless_id -
lambda_rec_dimensionless_id_physical -
lambda_rec_pos -
Physical -
duhamelRemainderOfGalerkin_integratingFactor -
AllReachable -
IsolationInvariant -
Reachable -
G -
G_pos -
kappa_einstein -
kappa_einstein_eq -
lambda_rec_pos -
alpha_seed_structural -
G -
G_ne_zero -
G_pos -
inner_nonneg -
tau0_planck_relation -
dimensions_status -
dim_G -
NA_SI -
proton_mass_MeV_pos -
G_rs -
G_rs_pos -
balance_determines_lambda -
balance_unique_positive_root -
GDerivationChain -
lambda_rec_is_forced -
ell_P -
ell_P_pos -
lambda_rec_over_ell_P
formal source
20open Real
21
22/-- Log-coordinate reparametrization: `G_F t = F (exp t)` -/
23@[simp] noncomputable def G (F : ℝ → ℝ) (t : ℝ) : ℝ := F (Real.exp t)
24
25/-- Convenience reparametrization: `H_F t = G_F t + 1`. -/
26@[simp] noncomputable def H (F : ℝ → ℝ) (t : ℝ) : ℝ := G F t + 1
27
28/-- The cosh-type functional identity for `G_F`. -/
29def CoshAddIdentity (F : ℝ → ℝ) : Prop :=
30 ∀ t u : ℝ,
31 G F (t+u) + G F (t-u) = 2 * (G F t * G F u) + 2 * (G F t + G F u)
32
33/-- Direct cosh-add identity on a function. -/
34def DirectCoshAdd (Gf : ℝ → ℝ) : Prop :=
35 ∀ t u : ℝ,
36 Gf (t+u) + Gf (t-u) = 2 * (Gf t * Gf u) + 2 * (Gf t + Gf u)
37
38lemma CoshAddIdentity_implies_DirectCoshAdd (F : ℝ → ℝ)
39 (h : CoshAddIdentity F) :
40 DirectCoshAdd (G F) := h
41
42lemma G_even_of_reciprocal_symmetry
43 (F : ℝ → ℝ)
44 (hSymm : ∀ {x : ℝ}, 0 < x → F x = F x⁻¹) :
45 Function.Even (G F) := by
46 intro t
47 have hpos : 0 < Real.exp t := Real.exp_pos t
48 have hrec : Real.exp (-t) = (Real.exp t)⁻¹ := by simp [Real.exp_neg]
49 simp [G, hrec, hSymm hpos]
50
51lemma G_zero_of_unit (F : ℝ → ℝ) (hUnit : F 1 = 0) : G F 0 = 0 := by
52 simpa [G] using hUnit
53