• HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
Thursday, November 19, 2026
BIOENGINEER.ORG
No Result
View All Result
  • Login
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
No Result
View All Result
Bioengineer.org
No Result
View All Result
Home NEWS Science News Technology

Variational Principles Extended to Spaces Lacking Symmetry and Triangle Inequalities

by
November 19, 2026
in Technology
Reading Time: 6 mins read
0
Variational Principles Extended to Spaces Lacking Symmetry and Triangle Inequalities

Variational Principles Extended to Spaces Lacking Symmetry and Triangle Inequalities

Share on FacebookShare on TwitterShare on LinkedinShare on RedditShare on Telegram

In an analytical development within mathematical optimization and nonlinear analysis, researchers Natthaya Boonyam, Parin Chaipunya, and Poom Kumam have established generalizations of the Borwein-Preiss and Ekeland variational principles on spaces governed by distance functions that neither possess symmetry nor satisfy the triangle inequality. Published in Fixed Point Theory and Algorithms for Sciences and Engineering, the work addresses theoretical foundations relevant to settings where directional perturbation and asymmetric sensitivity occur naturally, including learning objectives such as the Fenchel-Young loss and asymmetric divergence measures in information geometry.

Variational principles serve as fundamental tools in modern variational analysis, originating with Ivar Ekeland’s formulation demonstrating that a lower semicontinuous function bounded from below can be perturbed by a metric function to attain an exact minimum. While classical results such as the Weierstrass theorem require compactness to guarantee a global minimum, Ekeland’s theorem provides existence and geometric characterizations near approximate minimizers by supporting graphs with cones. However, because the standard metric perturbation kernel in Ekeland’s theorem lacks differentiability, smooth alternatives like the Borwein-Preiss variational principle were subsequently introduced in Banach spaces and later adapted to metric settings, typically relying heavily on metric structures.

A persistent limitation in existing extensions of these principles has been the lingering reliance on metric axioms, particularly the triangle inequality. In many previous generalizations across quasi-metric, b-metric, and generalized distance frameworks, proofs continued to depend implicitly or explicitly on metric triangle inequalities, often through classical tools such as Cantor’s intersection theorem. The authors addressed this gap by introducing an axiomatic framework on an arbitrary nonempty set X equipped with a general distance function d where the only defining requirement is that the distance between two points is nonnegative and equals zero if and only if the points are identical, without demanding symmetry or triangular subadditivity.

To construct variational principles in the complete absence of a metric topology, the authors formulated synthetic sequential notions governed entirely by the distance function itself. They defined directional notions of convergence, distinguishing between right d-convergence, where the distance from a fixed point to sequence elements vanishes, and left d-convergence, where the distance from sequence elements to the point vanishes. Corresponding definitions were established for right and left d-Cauchy sequences, right and left completeness, and right and left Hausdorff properties ensuring uniqueness of sequential limits, as well as sequential lower and upper semicontinuity for scalar functions.

A critical technical milestone enabling the main theorems is an asymmetric adaptation of Cantor’s intersection theorem. Under the assumption that the underlying distance function is right complete and right Hausdorff, the authors proved that any sequence of nonempty, right sequentially d-closed subsets nested within shrinking right d-balls whose radii tend to zero must admit a sequence of centers that is right d-convergent to a unique limit point. Furthermore, when the sequence of subsets is monotonically decreasing, their countable intersection contains precisely that single limit point, providing an analytical machinery that bypasses standard metric topological compactness.

Using this generalized intersection result, the team proved a non-triangular, asymmetric Borwein-Preiss variational principle. Assuming the distance function is right complete, right Hausdorff, and separately right sequentially d-lower semicontinuous, any lower bounded, right sequentially d-lower semicontinuous function f perturbed by an infinite series of weighted distances to an inductively generated sequence attains a structured minimum. The construction generates a decreasing sequence of closed sublevel sets, ensuring that the perturbed functional exhibits a strict minimum at a specific limit point, which also yields a corresponding weak form guaranteeing a unique minimizer.

The authors subsequently established the Ekeland variational principle within the same non-symmetric, non-triangular setting. Because deducing Ekeland’s formulation from the Borwein-Preiss theorem is obstructed by the requirement of strictly positive perturbation weights, the authors adapted their inductive sublevel set construction directly. Under slightly strengthened assumptions—requiring the distance function to be right complete, right Hausdorff, right sequentially d-lower semicontinuous in its first argument, and right sequentially d-continuous in its second argument—they proved that for any approximate minimizer, there exists a point that minimizes the function perturbed by a single distance kernel scaled by an arbitrary positive parameter.

To illustrate the utility of these principles, the authors applied their Ekeland variational principle to set-valued fixed point theory, deriving a version of the Caristi fixed point theorem. By defining an auxiliary product distance that reverses argument order on the Cartesian product of the space with itself, they proved that any set-valued map satisfying an appropriate descent inequality on a closed graph possesses a fixed point. Notably, their theorem establishes that these fixed points are necessarily end points, meaning the set-valued image of the point collapses strictly to the singleton containing the point itself, a property demonstrated via an explicit non-symmetric, non-triangular example on the unit interval.

Finally, the authors extended their framework to equilibrium problems governed by bifunctions over constrained sets. By combining a sequential compactness hypothesis with the weak form of their non-triangular Ekeland principle, they proved an existence criterion for equilibrium solutions when the governing bifunction admits a lower bound in terms of a lower semicontinuous potential function. Throughout the study, the required continuity and regularity hypotheses on the distance function gradually enrich from the Borwein-Preiss principle through Ekeland’s theorem, Caristi’s theorem, and equilibrium problems, establishing a systematic hierarchy for optimization in non-metric spaces.

To establish applications for their general distance formulation, the investigators targeted dissimilarity structures that naturally lack symmetry and the triangle inequality. These include \ell^p and L^p-type distances for exponent parameters p between zero and one, p-Wasserstein distances over the same range or with general cost functions, and divergences from information geometry, including Euclidean, Bregman, and Kullback-Leibler divergences. The authors noted that while their definition encompasses metric, quasi-metric, and b-metric spaces, it does not subsume JS-metric spaces because JS-metrics permit a positive distance from a point to itself. Within this framework, sublevel sets where a functional does not exceed a real threshold remain right sequentially closed whenever the functional is right sequentially lower semicontinuous, providing the closed sets needed for sequential intersection arguments.

The analytical mechanism driving the generalized Borwein-Preiss variational principle relies on an inductive scheme that confines candidate minimizers within decreasing sublevel sets. Beginning with an initial point whose functional value lies within an epsilon margin of the infimum, the construction generates a sequence of points and nested sets parameterized by positive weights. At each step, a new set restricts the previous sublevel set by enforcing an inequality with cumulative weighted distance terms. Each nested subset lies inside a right distance ball centered at the current sequence element with radius equal to epsilon divided by the product of the initial weight and two raised to the step power. Because these radii decay to zero, the asymmetric Cantor intersection theorem guarantees that the sequence of centers converges to a unique limit point where the perturbed functional attains a strict minimum.

For the Ekeland variational principle, the authors tailored the inductive sublevel process with geometric radii equal to epsilon divided by two raised to the step index. The proof relies on directional regularities: the distance function must be right complete, right Hausdorff, right sequentially lower semicontinuous in its first argument, and right sequentially continuous in its second argument. Continuity in the second argument allows the authors to take limits along subsequences outside balls of positive radius, confirming that the perturbed objective cannot drop below its value at the limit point. In their accompanying weak formulation of the Ekeland principle, the required regularities are swapped across the distance arguments, demanding right sequential continuity in the first argument and right sequential lower semicontinuity in the second argument to guarantee a minimizer.

The authors substantiated their Caristi fixed point theorem through an explicit construction on the unit interval equipped with a distance combining a squared difference and a positive part truncation. Although this distance violates symmetry and the triangle inequality, sequential convergence under it coincides with standard Euclidean convergence, preserving right completeness, the right Hausdorff property, and joint sequential continuity. The example defines a piecewise potential function that scales linearly on the lower subinterval and follows a quadratic curve on the upper subinterval, paired with a set-valued map whose graph splits into two distinct segments. By verifying three algebraic cases across these segments, the authors proved that the directional Caristi descent inequality holds universally. Consequently, the fixed points collapse into singleton end points where the image of each point is solely itself.

In their analysis of equilibrium problems, the investigators established that a bifunction admitting a lower estimate via a bounded-below potential function attains a solution over any right sequentially compact domain. By choosing a sequence of positive parameters vanishing to zero, the weak Ekeland principle generates an approximating sequence whose sequential compactness yields a convergent subsequence. Finally, the authors observed that any non-symmetric distance can be converted into a symmetric counterpart by summing the distance evaluated in both directions, optionally with weights. Under this symmetrized distance, convergent sequences are precisely those that satisfy both right and left convergence simultaneously.

Subject of Research: Variational analysis and optimization in generalized metric spaces

Article Title: Variational principles using a non-symmetric non-triangular distance

Article References: Boonyam, N., Chaipunya, P., & Kumam, P. (2026). Variational principles using a non-symmetric non-triangular distance. Fixed Point Theory and Algorithms for Sciences and Engineering, 2026(1), Article 10. https://doi.org/10.1186/s13663-026-00824-w

Image Credits: AI Generated

DOI: 10.1186/s13663-026-00824-w

Keywords: variational analysis, Ekeland variational principle, Borwein-Preiss variational principle, non-symmetric distance, non-triangular distance, Caristi fixed point theorem, equilibrium problems, mathematical optimization, metric spaces, sequential convergence, Cantor intersection theorem, dissimilarity measures, quasi-metric spaces, information geometry, applied mathematics, lower semicontinuity

News Source: Reid Dalton. (November 19, 2026). Variational Principles Extended to Spaces Lacking Symmetry and Triangle Inequalities. Scienmag.

Tags: Applied MathematicsBorwein-Preiss variational principleCantor intersection theoremCaristi fixed point theoremdissimilarity measuresEkeland variational principleequilibrium problemsinformation geometrylower semicontinuitymathematical optimizationMetric Spacesnon-symmetric distancenon-triangular distancequasi-metric spacessequential convergencevariational analysis
Share12Tweet7Share2ShareShareShare1

Related Posts

Mathematicians Prove Solution Existence and Hyers-Ulam Stability for Fractional Differential Equations

Mathematicians Prove Solution Existence and Hyers-Ulam Stability for Fractional Differential Equations

November 19, 2026
Novel Kubernetes Load Balancer Cuts Edge-to-Cloud Response Times by Fivefold

Novel Kubernetes Load Balancer Cuts Edge-to-Cloud Response Times by Fivefold

November 19, 2026

Multi-Stream Vision System Evaluates Classroom Teaching Behaviors With High Accuracy

November 19, 2026

Priority Scheduling Algorithm Improves Edge Computing Task Completion by 28 Percent

November 19, 2026

POPULAR NEWS

  • Evidence on Glucose-Based ICU Fluids and Blood Sugar Control Remains Inconclusive

    Evidence on Glucose-Based ICU Fluids and Blood Sugar Control Remains Inconclusive

    29 shares
    Share 12 Tweet 7
  • DNA Computing and Bio-Robotics Revolutionize Biological Data Storage and Automation

    29 shares
    Share 12 Tweet 7
  • Multi-Stream Vision System Evaluates Classroom Teaching Behaviors With High Accuracy

    29 shares
    Share 12 Tweet 7
  • Five Clinicoradiological Markers Predict Progression-Free Survival in Advanced EGFR-Mutant Lung Adenocarcinoma

    29 shares
    Share 12 Tweet 7

About

We bring you the latest biotechnology news from best research centers and universities around the world. Check our website.

Follow us

Recent News

Housing Disparities Shape PM2.5 Exposure and Health Management in Northern Thailand

MCM10 Gene Defect Linked to Natural Killer Cell Deficiency and Rare Cancer

Mathematicians Prove Solution Existence and Hyers-Ulam Stability for Fractional Differential Equations

Subscribe to Blog via Email

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 89 other subscribers
  • Contact Us

Bioengineer.org © Copyright 2023 All Rights Reserved.

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
No Result
View All Result
  • Homepages
    • Home Page 1
    • Home Page 2
  • News
  • National
  • Business
  • Health
  • Lifestyle
  • Science

Bioengineer.org © Copyright 2023 All Rights Reserved.