lemma
proved
Jcost_symm
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Cost on GitHub at line 22.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
srCost_reciprocal_symm -
pleasure_symmetric -
aestheticCost_reciprocal_symm -
J_reciprocal -
maillard_symmetric -
forecastCost_reciprocal_symm -
analogicalReasoningCert -
inverse_preserves_cost -
chainCost_reciprocal_symm -
V_reciprocal_symm -
log_space_symmetry -
scaleInvarianceCert -
Jcost_reciprocal -
Jcost_small_strain_bound -
Jmetric_symm -
Jcost_agrees_on_exp -
Jcost_symm -
Jcost_is_reciprocal -
unique_cost_on_pos_from_rcl -
jcost_log_symmetric -
symmetry_at_equilibrium -
gini_jcost_symmetric -
decileCost_reciprocal_symm -
public_cost_layer -
jcost_log_symmetric -
g_even -
jcost_reciprocal -
Jcost_n_symm -
amplitude_reciprocal_symm -
higgs_symmetric -
sectorCost_reciprocal_symm -
ledger_symmetry_negative_rungs -
shared_symmetry -
lorentz_invariance -
reciprocal_cost_forgets_orientation -
info_cost_symmetric -
jcost_satisfies_information_cost -
jcost_symmetric -
cooper_pair_symmetry -
fatigueCost_reciprocal_symm
formal source
19 field_simp [hx]
20 ring
21
22lemma Jcost_symm {x : ℝ} (hx : 0 < x) : Jcost x = Jcost x⁻¹ := by
23 have hx0 : x ≠ 0 := ne_of_gt hx
24 rw [Jcost_eq_sq hx0, Jcost_eq_sq (inv_ne_zero hx0)]
25 field_simp [hx0]
26 ring
27
28/-- J(x) ≥ 0 for positive x (AM-GM inequality) -/
29lemma Jcost_nonneg {x : ℝ} (hx : 0 < x) : 0 ≤ Jcost x := by
30 have hx0 : x ≠ 0 := hx.ne'
31 rw [Jcost_eq_sq hx0]
32 positivity
33
34def AgreesOnExp (F : ℝ → ℝ) : Prop := ∀ t : ℝ, F (Real.exp t) = Jcost (Real.exp t)
35
36@[simp] lemma Jcost_exp (t : ℝ) :
37 Jcost (Real.exp t) = ((Real.exp t) + (Real.exp (-t))) / 2 - 1 := by
38 have h : (Real.exp t)⁻¹ = Real.exp (-t) := by
39 symm; simp [Real.exp_neg t]
40 simp [Jcost, h]
41
42class SymmUnit (F : ℝ → ℝ) : Prop where
43 symmetric : ∀ {x}, 0 < x → F x = F x⁻¹
44 unit0 : F 1 = 0
45
46class AveragingAgree (F : ℝ → ℝ) : Prop where
47 agrees : AgreesOnExp F
48
49class AveragingDerivation (F : ℝ → ℝ) : Prop extends SymmUnit F where
50 agrees : AgreesOnExp F
51
52lemma even_on_log_of_symm {F : ℝ → ℝ} [SymmUnit F] (t : ℝ) :
papers checked against this theorem (showing 5 of 5)
-
RL reasoning performance saturates as policy entropy drops to zero
"the change in policy entropy is driven by the covariance between action probability and the change in logits, which is proportional to its advantage"
-
Lattice Weyl fermion gets an exact chiral symmetry, no doubling
"finite-range non-on-site chiral symmetry ... S_chiral(k) = ½[(1+cos k_z) τ^z + sin k_z τ^x]"
-
Point-free relations recovered from a parallel pair of frame operators
"A pair of cones △, ▽ : L → L on a meet-semilattice is called parallel if for all x,y ∈ L: △x ∧ y ⊑ △(x ∧ ▽y) and x ∧ ▽y ⊑ ▽(△x ∧ y). … Note the resemblance of parallelness to the Frobenius reciprocity condition. … Conjugate pairs (Jónsson–Tarski 1951): △x ∧ y = ⊥ iff x ∧ ▽y = ⊥."
-
Golden-ratio exponent fixes a gravity kernel, then meets 147 galaxies
"Reciprocity J(x) = J(1/x) forces double-entry ledger structure"
-
Multidimensional cost geometry
"Symmetrized Itakura-Saito: ½(D_IS(1‖x) + D_IS(x‖1)) = J(x); Hessian metric in log coords is Fisher-Rao of normal family with mean m(S) = ∫₀^S √cosh u du."