IndisputableMonolith.Action.PathSpace
The PathSpace module defines the space of admissible paths for the J-action as continuous strictly positive functions on closed intervals, together with the integrated action functional and fixed-endpoint predicates. Researchers formalizing the variational principle in Recognition Science cite it when constructing the domain for cost-rate minimization. The module is purely definitional and supplies the basic objects used by the three downstream Action modules.
claimAn admissible path on $[a,b]$ is a continuous function $γ:[a,b]→ℝ^+$ with $γ(t)>0$ for all $t$. The associated action is $S[γ]=∫_a^b J(γ(t))dt$ where $J(x)=½(x+x^{-1})-1$, together with the predicates fixedEndpoints$(γ,γ_0,γ_1)$ enforcing $γ(a)=γ_0$ and $γ(b)=γ_1$.
background
The module belongs to the Action domain and imports Cost (which supplies the pointwise cost $J$) and Cost.Convexity (which establishes strict convexity of $J$ on $ℝ^+$). Its central definition states that an admissible path on $[a,b]$ is a continuous, strictly positive function. The fixedEndpoints relation and the constant-path constructor are introduced to support later variational arguments. The upstream Convexity module states: “This module proves that Jlog(t)=cosh t−1 is strictly convex on ℝ and Jcost(x)=½(x+x^{-1})−1 is strictly convex on ℝ₊.”
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
PathSpace supplies the path space, action functional, and endpoint conditions required by EulerLagrange (which reduces the EL equation to the constant path γ≡1), FunctionalConvexity (which uses the definitions to prove convexity of S and discharge the h_min hypothesis), and QuadraticLimit (which performs the small-strain expansion of J). It therefore forms the definitional base for the J-action variational principle that connects to the Recognition Science cost manifold.
scope and limits
- Does not derive any Euler-Lagrange equation.
- Does not prove convexity of the integrated action functional.
- Does not perform the quadratic Taylor expansion of J.
- Does not reference the forcing chain T0-T8 or the Recognition Composition Law.
used by (3)
depends on (2)
declarations in this module (18)
-
structure
AdmissiblePath -
lemma
coe_mk -
def
const -
lemma
const_apply -
def
actionJ -
lemma
actionJ_def -
lemma
actionJ_nonneg -
lemma
actionJ_const_one -
def
fixedEndpoints -
lemma
fixedEndpoints_refl -
lemma
fixedEndpoints_symm -
lemma
fixedEndpoints_trans -
def
interp -
lemma
interp_apply -
lemma
interp_zero -
lemma
interp_one -
lemma
interp_fixedEndpoints -
def
pathSpace_status