arxiv: 2605.00728 · v1 · submitted 2026-05-01 · 🧮 math.FA · math.MG· math.OC

Recognition: unknown

Sion's minimax theorem and the proximal point algorithm in Hadamard spaces

Fumiaki Kohsaka

Pith reviewed 2026-05-09 18:16 UTC · model grok-4.3

classification 🧮 math.FA math.MGmath.OC

keywords Sion's minimax theoremHadamard spaceproximal point algorithmsaddle functionresolventCAT(0) spaceconvex analysisminimax problem

0 comments

The pith

Sion's minimax theorem holds in Hadamard spaces for convex-concave saddle functions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper shows that Sion's minimax theorem carries over to Hadamard spaces, meaning that for a convex-concave saddle function on the product of two convex sets the value of the infimum over the supremum equals the supremum over the infimum. This matters because Hadamard spaces are complete geodesic metric spaces with non-positive curvature and include Euclidean space, hyperbolic space, and trees as special cases, so the result widens the geometric settings in which equilibrium problems can be analyzed without extra compactness assumptions. The proof proceeds by establishing key properties of the resolvents of such saddle functions, which are single-valued operators that solve a regularized minimization problem at each step. These properties then yield convergence of the proximal point algorithm when applied to find saddle points in the same setting.

Core claim

We obtain Sion's minimax theorem in Hadamard spaces and discuss its applications. Among other things, we study several fundamental properties of resolvents of saddle functions in Hadamard spaces. An application to the proximal point algorithm for minimax problems in Hadamard spaces is also included.

What carries the argument

The resolvent of a saddle function, the operator that returns the unique point minimizing a proximal regularization of the saddle function at a given base point.

If this is right

The minimax equality holds for convex-concave functions on products of convex sets without requiring compactness of the sets.
Resolvents of saddle functions are well-defined, single-valued, and satisfy nonexpansive-type inequalities in Hadamard spaces.
The proximal point algorithm generates a sequence that converges to a saddle point for minimax problems.
Existence and uniqueness results for saddle points follow directly from the minimax equality in this geometry.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Similar arguments may allow other Euclidean minimax results to transfer once the relevant convexity and continuity notions are metrized in CAT(0) spaces.
The framework supplies a natural setting for saddle-point problems that arise when data or constraints live on tree-structured or negatively curved domains.
Numerical checks on explicit bilinear functions in the hyperbolic plane would give immediate evidence for or against the claimed equality.

Load-bearing premise

Saddle functions are convex in one variable and concave in the other with appropriate semicontinuity, and the ambient space is a complete CAT(0) space.

What would settle it

A concrete saddle function on the hyperbolic plane whose resolvent fails to exist or whose proximal-point iterates diverge from any saddle point.

read the original abstract

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper extends Sion's minimax theorem to Hadamard spaces via geodesic convexity and applies it to resolvents and proximal point iteration for saddle problems.

read the letter

The main point is that Sion's minimax theorem carries over to complete CAT(0) spaces under the usual convex-concave assumptions plus metric semicontinuity, and the author uses this to define resolvents of saddle functions and run a proximal point algorithm on minimax problems in those spaces. The extension itself is the central new piece, since most prior versions stay in Hilbert or Banach settings. The resolvent properties and the algorithm convergence result follow directly once the minimax statement is in hand, which keeps the contribution focused and self-contained. The assumptions line up with what the geometry supplies: unique geodesics and convexity along them, plus compactness on one side to run the standard argument. No extra compactness or continuity conditions are invented to make it work. The write-up stays technical and does not overstate the scope beyond metric convex analysis. One limitation is that the abstract supplies no proof outline, so it is hard to see at a glance whether the transfer of the KKM or fixed-point step requires any non-obvious metric adjustments. If the full proofs are direct and the comparisons to the Euclidean case are clear, that is minor. If they are not, the paper would need tightening. This is useful for people already working on optimization or game theory in non-Euclidean metric spaces, such as certain data geometry or manifold settings. A reader outside that niche will not find broad motivation or new applications beyond the proximal point iteration. It is worth sending to referees because the claim is concrete, the setting is well-defined, and the logical chain from minimax to resolvents to algorithm looks internally consistent.

Referee Report

0 major / 4 minor

Summary. The manuscript extends Sion's minimax theorem to Hadamard spaces (complete CAT(0) metric spaces). It establishes the result for convex-concave saddle functions satisfying appropriate semicontinuity conditions, derives several properties of the resolvents of such saddle functions, and applies the theorem to the proximal point algorithm for minimax problems in these spaces.

Significance. If the central claims hold, the work provides a useful generalization of a classical result in convex analysis to the setting of Hadamard spaces, where geodesic convexity and the CAT(0) inequality replace linear structure. The resolvent analysis and proximal-point application could support iterative methods for saddle-point problems in metric geometry and optimization. The paper does not include machine-checked proofs or parameter-free derivations, but the logical chain from the minimax statement through resolvent construction to the algorithm appears internally consistent under the stated assumptions.

minor comments (4)

Abstract: the sentence 'An application to the proximal point algorithm for minimax problems in Hadamard spaces are also included' contains a subject-verb agreement error and should be revised for grammatical correctness.
Introduction and §2: the notation for saddle functions (e.g., the precise definition of convexity-concavity along geodesics) could be stated more explicitly at the first appearance to aid readers unfamiliar with metric-space convex analysis.
§4 (resolvent properties): several lemmas on resolvent existence and uniqueness are presented; adding a short table summarizing the key properties (domain, monotonicity, etc.) would improve readability.
References: the bibliography appears to omit several standard works on CAT(0) spaces and proximal algorithms in metric spaces (e.g., recent papers on Hadamard-space optimization); a brief comparison paragraph would strengthen the positioning.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful summary of our work extending Sion's minimax theorem to Hadamard spaces, including the resolvent properties and proximal point algorithm application. The positive assessment and recommendation for minor revision are appreciated. However, the major comments section contains no specific points, so we have nothing to address point by point at this stage.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper extends Sion's minimax theorem to Hadamard spaces by adapting classical convex-concave arguments to geodesic convexity and the CAT(0) structure, using standard KKM or fixed-point techniques once compactness is assumed on one set. The resolvent properties for saddle functions and the proximal-point iteration follow directly from the minimax result combined with the space's unique geodesics and completeness, without any reduction of a claimed prediction to a fitted input, self-definitional loop, or load-bearing self-citation chain. All steps rely on externally verifiable metric-space properties rather than internal redefinitions or ansatzes imported from the authors' prior work.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based solely on the abstract, no free parameters, axioms, or invented entities can be identified. The claim rests on standard properties of Hadamard spaces and saddle functions, but no explicit ledger is extractable without the full text.

pith-pipeline@v0.9.0 · 5343 in / 1058 out tokens · 48248 ms · 2026-05-09T18:16:44.923760+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

32 extracted references

[1]

Aoyama, Y

K. Aoyama, Y. Kimura, and W. Takahashi,Maximal monotone operators and maximal mono- tone functions for equilibrium problems, J. Convex Anal.15(2008), 395–409

2008
[2]

Baˇ c´ ak,The proximal point algorithm in metric spaces, Israel J

M. Baˇ c´ ak,The proximal point algorithm in metric spaces, Israel J. Math.194(2013), 689– 701

2013
[3]

,Convex analysis and optimization in Hadamard spaces, De Gruyter, Berlin, 2014

2014
[4]

Blum and W

E. Blum and W. Oettli,From optimization and variational inequalities to equilibrium prob- lems, Math. Student63(1994), 123–145

1994
[5]

J. M. Borwein and A. S. Lewis,Convex analysis and nonlinear optimization, Springer, New York, 2006

2006
[6]

M. R. Bridson and A. Haefliger,Metric spaces of non-positive curvature, Springer-Verlag, Berlin, 1999

1999
[7]

Burago, Y

D. Burago, Y. Burago, and S. Ivanov,A course in metric geometry, American Mathematical Society, Providence, RI, 2001

2001
[8]

Jost,Convex functionals and generalized harmonic maps into spaces of nonpositive cur- vature, Comment

J. Jost,Convex functionals and generalized harmonic maps into spaces of nonpositive cur- vature, Comment. Math. Helv.70(1995), 659–673

1995
[9]

Kamimura, F

S. Kamimura, F. Kohsaka, and W. Takahashi,Weak and strong convergence theorems for maximal monotone operators in a Banach space, Set-Valued Anal.12(2004), 417–429

2004
[10]

Kimura,Resolvents of equilibrium problems on a complete geodesic space with curvature bounded above, Carpathian J

Y. Kimura,Resolvents of equilibrium problems on a complete geodesic space with curvature bounded above, Carpathian J. Math.37(2021), 463–476

2021
[11]

Kimura and Y

Y. Kimura and Y. Kishi,Equilibrium problems and their resolvents in Hadamard spaces, J. Nonlinear Convex Anal.19(2018), 1503–1513

2018
[12]

Kimura and F

Y. Kimura and F. Kohsaka,Two modified proximal point algorithms for convex functions in Hadamard spaces, Linear Nonlinear Anal.2(2016), 69–86

2016
[13]

W. A. Kirk and B. Panyanak,A concept of convergence in geodesic spaces, Nonlinear Anal. 68(2008), 3689–3696

2008
[14]

Knaster, C

B. Knaster, C. Kuratowski, and S. Mazurkiewicz,Ein beweis des fixpunktsatzes f¨ urn- dimensionale simplexe, Fund. Math.14(1929), 132–138

1929
[15]

Kohsaka,Minimax problems and mappings of firmly nonexpansive type in Banach spaces, Banach and function spaces III (ISBFS 2009), Yokohama Publ., Yokohama, 2011, pp

F. Kohsaka,Minimax problems and mappings of firmly nonexpansive type in Banach spaces, Banach and function spaces III (ISBFS 2009), Yokohama Publ., Yokohama, 2011, pp. 381– 390

2009
[16]

,Existence and approximation of fixed points of vicinal mappings in geodesic spaces, Pure Appl. Funct. Anal.3(2018), 91–106

2018
[17]

,Fixed points of metrically nonspreading mappings in Hadamard spaces, Appl. Anal. Optim.3(2019), 213–230

2019
[18]

,Minimax problems in Hadamard spaces, 2026 16th International Conference on Ap- plied Physics and Mathematics (ICAPM 2026), which was held in Osaka, Japan during April 10–12, 2026 (At Room 4B, TKP Garden City Osaka River Side Hotel), 18:00–18:15 (UTC+9), April 11th (Saturday), 2026

2026
[19]

Kohsaka and W

F. Kohsaka and W. Takahashi,Strong convergence of an iterative sequence for maximal monotone operators in a Banach space, Abstr. Appl. Anal. (2004), 239–249

2004
[20]

,Weak and strong convergence theorems for minimax problems in Banach spaces, Nonlinear analysis and convex analysis, Yokohama Publ., Yokohama, 2004, pp. 203–215

2004
[21]

Komiya,Elementary proof for Sion’s minimax theorem, Kodai Math

H. Komiya,Elementary proof for Sion’s minimax theorem, Kodai Math. J.11(1988), 5–7

1988
[22]

Kumam and P

P. Kumam and P. Chaipunya,Equilibrium problems and proximal algorithms in Hadamard spaces, J. Nonlinear Anal. Optim.8(2017), 155–172

2017
[23]

Martinet,R´ egularisation d’in´ equations variationnelles par approximations successives, Rev

B. Martinet,R´ egularisation d’in´ equations variationnelles par approximations successives, Rev. Fran¸ caise Informat. Recherche Op´ erationnelle4(1970), no. S´ er. R-3, 154–158 (French)

1970
[24]

U. F. Mayer,Gradient flows on nonpositively curved metric spaces and harmonic maps, Comm. Anal. Geom.6(1998), 199–253

1998
[25]

C. P. Niculescu and I. Rovent ¸a,Fan’s inequality in geodesic spaces, Appl. Math. Lett.22 (2009), 1529–1533

2009
[26]

R. T. Rockafellar,Monotone operators associated with saddle-functions and minimax prob- lems, Nonlinear Functional Analysis (Proc. Sloops. Pure Math., Vol. XVIII, Part 1, Chicago, Ill., 1968), Proc. Sympos. Pure Math., vol. XVIII, Part 1, Amer. Math. Soc., Providence, RI, 1970, pp. 241–250. 25

1968
[27]

Control Optimiza- tion14(1976), 877–898

,Monotone operators and the proximal point algorithm, SIAM J. Control Optimiza- tion14(1976), 877–898

1976
[28]

Sion,On general minimax theorems, Pacific J

M. Sion,On general minimax theorems, Pacific J. Math.8(1958), 171–176

1958
[29]

Takahashi,Nonlinear variational inequalities and fixed point theorems, J

W. Takahashi,Nonlinear variational inequalities and fixed point theorems, J. Math. Soc. Japan28(1976), 168–181

1976
[30]

,Fixed point, minimax, and Hahn-Banach theorems, Nonlinear functional analysis and its applications, Part 2 (Berkeley, Calif., 1983), Proc. Sympos. Pure Math., vol. 45, Part 2, Amer. Math. Soc., Providence, RI, 1986, pp. 419–427

1983
[31]

Fixed point theory and its applications

,Nonlinear functional analysis, Yokohama Publishers, Yokohama, 2000. Fixed point theory and its applications

2000
[32]

,Introduction to nonlinear and convex analysis, Yokohama Publishers, Yokohama, 2009. (F. Kohsaka)Department of Mathematical Sciences, Tokai University, Kitakaname, Hiratsuka, Kanagawa 259-1292, Japan Email address:f-kohsaka@tokai.ac.jp

2009