Expand description
Auto-generated module
🤖 Generated with SplitRS
Functions§
- app
- app2
- app3
- arrow
- aubin_
property_ criteria_ ty AubinPropertyCriteria : (List Real -> List Real -> Prop) -> PropAubin (pseudo-Lipschitz) property: set-valued map has Lipschitz-like continuity.- berge_
maximum_ theorem_ ty BergeMaximumTheorem : (List Real -> Real) -> (List Real -> List Real -> Prop) -> PropBerge’s maximum theorem: if f is continuous and C is continuous compact-valued, then V(x) = max_{y∈C(x)} f(x,y) is continuous and the argmax correspondence is USC.- bool_ty
- borwein_
preiss_ principle_ ty BorweinPreissPrinciple : (List Real -> Real) -> PropSmooth variational principle: perturbation by a smooth gauge function.- borwein_
preiss_ smooth_ ty BorweinPreissSmooth : (List Real -> Real) -> PropBorwein-Preiss: for any ε > 0, there exists a smooth perturbation realising a minimiser.- bregman_
dynamics_ ty BregmanDynamics : (List Real -> Real) -> (List Real -> Real) -> PropBregman proximal dynamics: xₖ₊₁ = argmin {f(x) + Dφ(x, xₖ)/λ}.- build_
env - Build an
Environmentwith variational analysis kernel axioms. - build_
variational_ analysis_ env - Build an
Environmentcontaining variational analysis axioms and theorems. - build_
variational_ analysis_ env_ extended - Build the extended variational analysis environment (adds §7 axioms to existing §1-§6).
- bundle_
method_ ty BundleMethod : (List Real -> Real) -> PropBundle method: collects subgradient information in a “bundle” to build cutting planes.- bvar
- cerami_
condition_ ty Cerami condition : (List Real -> Real) -> PropCerami variant of (PS): (1 + ‖x_n‖)‖∇f(x_n)‖ → 0.- check_
gamma_ convergence_ indicator - Check whether a sequence of penalty functions Gamma-converges to the indicator of [a,b]. Only verifies the liminf inequality at a test point.
- check_
regular_ subgradient - Check whether a vector is a regular (Fréchet) subgradient: liminf_{y→x} (f(y) - f(x) - ⟨v, y-x⟩) / ‖y-x‖ ≥ -tol by sampling random directions.
- clarke_
directional_ derivative_ ty ClarkeGeneralisedDirectionalDerivative : (List Real -> Real) -> List Real -> List Real -> Realf°(x;v) = limsup_{y→x, t↓0} (f(y+tv) - f(y))/t.- clarke_
generalised_ jacobian_ ty ClarkeGeneralisedJacobian : (List Real -> List Real) -> List Real -> Type∂^C F(x) = conv{lim ∇F(xₙ) | xₙ → x, xₙ ∉ Ω_F}: Clarke generalised Jacobian.- clarke_
generalized_ gradient_ ty ClarkeGeneralizedGradient : (List Real -> Real) -> List Real -> List RealA selection from Clarke subdifferential (not unique in general).- clarke_
gradient_ approx - Compute a Clarke-type subgradient via smoothing (convolution with Gaussian). For locally Lipschitz f, approximate Clarke gradient by averaging finite differences.
- clarke_
stationary_ condition_ ty ClarkeStationaryCondition : (List Real -> Real) -> List Real -> Prop0 ∈ ∂^C f(x): Clarke stationarity as a necessary optimality condition.- clarke_
subdiff_ chain_ rule_ ty ClarkeSubdiffChainRule : PropClarke’s chain rule for composite locally Lipschitz functions.- clarke_
subdiff_ sum_ rule_ ty ClarkeSubdiffSumRule : PropClarke’s sum rule: ∂^C(f+g)(x) ⊆ ∂^C f(x) + ∂^C g(x).- clarke_
subdifferential_ ty ClarkeSubdifferential : (List Real -> Real) -> List Real -> (List Real -> Prop)∂^C f(x) = conv(∂_L f(x)): convex hull of limiting subdifferential.- cst
- deformation_
lemma_ ty DeformationLemma : (List Real -> Real) -> PropDeformation retract of sub-level sets avoiding critical levels.- density_
of_ minimisers_ ty DensityOfMinimisers : (List Real -> Real) -> PropThe set of strict minimisers is dense (consequence of variational principles).- deville_
godefroy_ zizler_ ty Deville_Godefroy_Zizler : PropDeville-Godefroy-Zizler variational principle: smooth bump function perturbation.- douglas_
rachford_ splitting_ ty DouglasRachfordSplitting : (List Real -> Real) -> (List Real -> Real) -> PropDouglas-Rachford splitting for minimising f + g via proximal operators.- ekeland_
approximate_ minimiser - Approximate Ekeland minimiser: finds x_ε near x₀ such that f(x_ε) ≤ f(x₀) and f(x_ε) ≤ f(x) + eps * ‖x - x_ε‖ for all tested x.
- ekeland_
variational_ principle_ ty EkelandVariationalPrinciple : (List Real -> Real) -> PropFor every ε > 0 and near-minimiser x₀ of lsc proper f bounded below, ∃ xε: f(xε) ≤ f(x₀) and f(xε) ≤ f(x) + ε‖x-xε‖ for all x.- ekeland_
with_ error_ bound_ ty EkelandWithErrorBound : (List Real -> Real) -> Real -> PropEkeland’s principle with explicit error bound for approximate minimisers.- epi_
conv_ implies_ min_ ty EpiConvergenceImpliesMinConvergence : PropIf f_n epi-converges to f then inf f_n → inf f and argmin_n converges.- epi_
convergence_ stability_ ty EpiConvergenceStability : PropEpi-convergence is stable under continuous perturbations of the functionals.- epi_
converges_ ty EpiConverges : (Nat -> List Real -> Real) -> (List Real -> Real) -> Propf_n epi-converges to f: epi(f_n) → epi(f) in the set convergence sense.- epi_
liminf_ ty EpiLimInf : (Nat -> List Real -> Real) -> List Real -> Real(e-liminf f_n)(x) = liminf_{y_n → x} liminf_n f_n(y_n).- epi_
limsup_ ty EpiLimSup : (Nat -> List Real -> Real) -> List Real -> Real(e-limsup f_n)(x) = liminf_{y_n → x} limsup_n f_n(y_n).- flowering_
principle_ ty FloweringPrinciple : PropStegall’s “flowering” variational principle in Asplund spaces.- fn_ty
- frechet_
normal_ cone_ ty FrechetNormalCone : (List Real -> Prop) -> List Real -> (List Real -> Prop)N̂(C;x): Fréchet (regular) normal cone — subdifferential of indicator function.- fuzzy_
sum_ rule_ ty FuzzySum : PropFuzzy (approximate) sum rule for regular subdifferentials.- gamma_
compactness_ ty GammaCompactness : PropEvery sequence of equi-coercive functions has a Γ-convergent subsequence.- gamma_
conv_ minimisers_ ty GammaConvergenceMinimisers : PropΓ-convergence ensures convergence of minimisers and minimum values.- gamma_
conv_ stability_ ty GammaConvergenceStability : PropΓ-convergence is stable under addition of continuous perturbations.- gamma_
converges_ ty GammaConverges : (Nat -> List Real -> Real) -> (List Real -> Real) -> Propf_n Γ-converges to f iff Γ-liminf = Γ-limsup = f.- gamma_
liminf_ ty GammaLimInf : (Nat -> List Real -> Real) -> List Real -> RealΓ-liminf_n f_n(x) = sup_{U∋x} liminf_n inf_{y∈U} f_n(y).- gamma_
limsup_ ty GammaLimSup : (Nat -> List Real -> Real) -> List Real -> RealΓ-limsup_n f_n(x) = sup_{U∋x} lim_n inf_{y∈U} f_n(y).- gradient_
flow_ ty GradientFlow : (List Real -> Real) -> PropGradient flow: ẋ ∈ -∂f(x), the steepest descent curve in the sense of maximal slope.- hausdorff_
continuity_ ty HausdorffContinuity : (List Real -> List Real -> Prop) -> PropA set-valued map is Hausdorff continuous if d_H(F(x), F(y)) → 0 as y → x.- is_
palais_ smale_ sequence - Check whether a finite sequence is a Palais-Smale sequence: |f(x_n)| bounded AND ‖∇f(x_n)‖ → 0.
- is_
prox_ regular_ function_ ty IsProxRegularFunction : (List Real -> Real) -> Real -> Propf is r-prox-regular: its epigraph is r-prox-regular as a set.- is_
prox_ regular_ set_ ty IsProxRegularSet : (List Real -> Prop) -> Real -> PropC is r-prox-regular: the projection onto C is single-valued on a tube of radius r.- is_
pseudoconvex_ ty IsPseudoconvex : (List Real -> Real) -> Propf is pseudoconvex: ⟨∇f(x), y-x⟩ ≥ 0 ⟹ f(y) ≥ f(x).- is_
quasiconvex_ ty IsQuasiconvex : (List Real -> Real) -> Propf is quasiconvex: level sets {x | f(x) ≤ α} are convex for all α.- kkt_
conditions_ ty KKTConditions : (List Real -> Real) -> (List (List Real -> Real)) -> List Real -> PropKarush-Kuhn-Tucker necessary optimality conditions.- kuratowski_
ryll_ nardzewski_ ty KuratowskiRyllNardzewski : (List Real -> List Real -> Prop) -> PropKuratowski-Ryll-Nardzewski measurable selection theorem.- licq_ty
LICQ : (List (List Real -> Real)) -> List Real -> PropLinear Independence CQ: gradients of active constraints are linearly independent.- limiting_
normal_ cone_ ty LimitingNormalCone : (List Real -> Prop) -> List Real -> (List Real -> Prop)N_L(C; x) = Limsup_{y→x, y∈C} N̂(C; y).- limiting_
subdifferential_ ty LimitingSubdifferential : (List Real -> Real) -> List Real -> (List Real -> Prop)Mordukhovich (basic) subdifferential: cluster points of regular subgradients along sequences.- linear_
regularity_ ty LinearRegularity : (List (List Real -> Prop)) -> PropA collection of sets is linearly regular: d(x, ∩Cᵢ) ≤ κ max d(x, Cᵢ).- linking_
theorem_ ty LinkingTheorem : (List Real -> Real) -> PropAbstract linking theorem yielding critical points.- lipschitz_
stability_ ty LipschitzStability : (List Real -> List Real) -> Real -> PropA map F is Lipschitz-stable (calm) with constant κ near a point.- list_ty
- lower_
dini_ derivative_ ty LowerDiniDerivative : (List Real -> Real) -> List Real -> List Real -> RealD₋f(x;v) = liminf_{t↓0} (f(x+tv) - f(x))/t.- metric_
regularity_ ty MetricRegularity : (List Real -> List Real -> Prop) -> Real -> PropF is metrically regular at (x,y) with constant κ: d(x, F⁻¹(y)) ≤ κ d(y, F(x)).- mfcq_ty
MFCQ : (List (List Real -> Real)) -> (List (List Real -> Real)) -> List Real -> PropMangasarian-Fromovitz CQ: active constraint gradients + inequality multipliers positively independent.- michael_
selection_ theorem_ ty MichaelSelectionTheorem : (List Real -> List Real -> Prop) -> PropMichael’s selection theorem: an LSC map with convex closed values has a continuous selection.- mirror_
descent_ algorithm_ ty MirrorDescentAlgorithm : (List Real -> Real) -> (List Real -> Real) -> PropMirror descent: generalises gradient descent to curved geometries via Bregman divergence.- mordukhovich_
coderivative_ ty MordukhovichCoderivative : (List Real -> List Real) -> List Real -> (List Real -> List Real -> Prop)D*F(x)(v): coderivative of a set-valued map F at (x, y).- mordukhovich_
criterion_ ty MordukhovichCriterion : (List Real -> Prop) -> List Real -> PropMordukhovich normal cone regularity criterion for closed sets.- mordukhovich_
subdiff_ chain_ rule_ ty MordukhovichSubdiffChainRule : PropMordukhovich chain rule for compositions of Lipschitz mappings.- mordukhovich_
subdiff_ sum_ rule_ ty MordukhovichSubdiffSumRule : PropMordukhovich sum rule with SNC (sequential normal compactness) condition.- morse_
index_ ty MorseIndex : (List Real -> Real) -> List Real -> NatIndex of a nondegenerate critical point (dimension of negative eigenspace of Hessian).- morse_
inequalities_ ty MorseInequalities : (List Real -> Real) -> PropMorse inequalities relating critical points and Betti numbers.- mosco_
convergence_ reflexive_ banach_ ty MoscoConvergenceReflexiveBanach : PropIn reflexive Banach spaces, Mosco convergence is equivalent to weak epi + strong epi convergence.- mosco_
converges_ ty MoscoConverges : (Nat -> List Real -> Real) -> (List Real -> Real) -> PropMosco convergence: combines strong epi and weak epi convergence conditions.- mosco_
implies_ epi_ ty MoscoImpliesEpi : PropMosco convergence implies epi-convergence (in reflexive Banach spaces).- mountain_
pass_ theorem_ ty MountainPassTheorem : (List Real -> Real) -> PropIf f satisfies (PS) and has a mountain-pass geometry, ∃ critical point.- nat_ty
- normal_
cone_ calculus_ ty NormalConeCalculus : (List Real -> Prop) -> (List Real -> Prop) -> PropNormal cone calculus: N(C₁ ∩ C₂; x) ⊆ N(C₁; x) + N(C₂; x) under regularity.- normal_
cone_ inclusion_ ty NormalConeInclusion : PropProximal ⊆ Fréchet ⊆ Limiting normal cone (fundamental inclusions).- palais_
smale_ condition_ ty PalaisSmaleCondition : (List Real -> Real) -> Prop(PS): every sequence with bounded values and gradient → 0 has a convergent subsequence.- penalty_
indicator_ 1d - Compute penalty approximation of indicator function of [a, b]: f_n(x) = n * (max(0, x - b) + max(0, a - x)).
- pi
- prop
- prox_
regular_ minimisation_ ty ProxRegularMinimisation : (List Real -> Real) -> Real -> PropProx-regularity ensures the proximal point algorithm converges at linear rate.- prox_
regularity_ projection_ ty ProxRegularityProjection : (List Real -> Prop) -> Real -> PropFor r-prox-regular C, proj_C is single-valued on the open r-tube around C.- proximal_
normal_ cone_ ty ProximalNormalCone : (List Real -> Prop) -> List Real -> (List Real -> Prop)N̂^P(C;x): proximal normals via squared distance to C.- proximal_
point_ algorithm_ ty ProximalPointAlgorithm : (List Real -> Real) -> PropProximal point algorithm: x_{k+1} = prox_{λf}(xₖ) converges to a minimiser.- quasiconvex_
level_ sets_ ty QuasiconvexLevelSets : (List Real -> Real) -> Real -> PropLevel set {x | f(x) ≤ α} is convex for each α ∈ ℝ when f is quasiconvex.- quasidifferential_
ty Quasidifferential : (List Real -> Real) -> List Real -> TypeQuasidifferential ∂f(x) = (Df(x), -Df(x)): pair of convex compact sets characterising df.- real_ty
- regular_
subdifferential_ ty RegularSubdifferential : (List Real -> Real) -> List Real -> (List Real -> Prop)F-subdifferential (Fréchet): v ∈ D̂f(x) iff liminf_{y→x} (f(y)-f(x)-⟨v,y-x⟩)/‖y-x‖ ≥ 0.- robinson_
stability_ ty RobinsonStability : (List Real -> List Real -> Prop) -> PropRobinson’s stability theorem: MFCQ implies Lipschitz stability of solution maps.- saddle_
point_ dynamics_ ty SaddlePointDynamics : (List Real -> List Real -> Real) -> PropPrimal-dual saddle point dynamics: (ẋ, ẏ) = (-∂_x L(x,y), ∂_y L(x,y)).- saddle_
point_ theorem_ ty SaddlePointTheorem : (List Real -> Real) -> PropGeneralisation of mountain pass to saddle geometries.- second_
order_ necessary_ conditions_ ty SecondOrderNecessaryConditions : (List Real -> Real) -> List Real -> PropSONC: Hessian of Lagrangian is PSD on the critical cone at a local minimiser.- second_
order_ sufficient_ conditions_ ty SecondOrderSufficientConditions : (List Real -> Real) -> List Real -> PropSOSC: positive definiteness of Lagrangian Hessian on the critical cone.- seq_ty
- star_
shaped_ minimisation_ ty StarShapedMinimisation : PropVariational principle for star-shaped constraint sets.- strict_
differentiability_ ty StrictDifferentiability : (List Real -> List Real) -> List Real -> PropF is strictly differentiable at x: limit of (F(y)-F(z))/(y-z) as y,z→x is uniform.- strict_
quasiconvexity_ ty StrictQuasiconvexity : (List Real -> Real) -> PropStrict quasiconvexity: f(λx + (1-λ)y) < max(f(x), f(y)) for x≠y, λ∈(0,1).- subdiff_
chain_ rule_ ty SubdiffChainRule : PropChain rule for limiting subdifferential of composed mappings.- subdiff_
sum_ rule_ ty SubdiffSumRule : PropLimiting subdiff of sum: ∂(f+g)(x) ⊆ ∂f(x) + ∂g(x) under SNEC condition.- subsmooth_
function_ ty SubsmoothFunction : (List Real -> Real) -> PropA subsmooth function: regular subdifferential equals limiting subdifferential everywhere.- topological_
epi_ convergence_ ty TopologicalEpiConvergence : (Nat -> List Real -> Real) -> (List Real -> Real) -> PropEpi-convergence in a general topological space setting.- trust_
region_ principle_ ty TrustRegionPrinciple : PropTrust-region model for approximate variational principles.- type0
- uniformly_
prox_ regular_ ty UniformlyProxRegular : (List Real -> Prop) -> Real -> PropUniformly r-prox-regular: same r works at every boundary point.- upper_
dini_ derivative_ ty UpperDiniDerivative : (List Real -> Real) -> List Real -> List Real -> RealD⁺f(x;v) = limsup_{t↓0} (f(x+tv) - f(x))/t.- vec_ty