arxiv: 2603.06948 · v2 · submitted 2026-03-06 · 🧮 math.OC

Recognition: 2 theorem links

· Lean Theorem

A geometric simplex method in infinite-dimensional spaces

Robert L Smith , Christopher Thomas Ryan

Authors on Pith no claims yet

Pith reviewed 2026-05-15 14:24 UTC · model grok-4.3

classification 🧮 math.OC

keywords simplex methodlocally convex spacesinfinite-dimensional linear programmingpolytopesextreme pointsHilbert cubeedge paths

0 comments

The pith

The simplex method extends geometrically to linear programs in locally convex topological vector spaces.

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

The paper defines polytopes and the simplex method using only geometric notions of extreme points and edges in locally convex spaces. This avoids algebraic column operations that had limited earlier extensions to Hilbert or finite-dimensional cases. The definition is shown to include the Hilbert cube as a valid polytope. Under this setup the method converges in value to optimality when edge paths exist between exposed extreme points. A sympathetic reader would care because the approach covers a broad class of infinite-dimensional linear programs that arise in functional analysis and control.

Core claim

By relying on a geometric definition of polytopes in locally convex topological vector spaces that guarantees exposed extreme points connected by edge paths, the authors establish conditions under which the simplex method converges in value to optimality for linear programs. This definition captures optimization over the Hilbert cube and ensures that all polytopes under it possess exposed extreme points linked by edge paths, generalizing prior work restricted to more structured spaces.

What carries the argument

A geometric definition of polytopes in locally convex topological vector spaces that ensures exposed extreme points connected by edge paths, allowing the simplex method to proceed without algebraic pivoting.

If this is right

The simplex method converges in value for linear programs in any locally convex space satisfying the polytope conditions.
Optimization over the Hilbert cube falls under the method because the cube satisfies the polytope definition.
All polytopes under this definition admit exposed extreme points connected by edge paths.
The geometric construction applies to instances previously excluded by algebraic pivoting requirements.

Where Pith is reading between the lines

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

The same geometric lens might allow direct extension of other vertex-following algorithms to infinite-dimensional settings.
Numerical implementations could track edge paths explicitly rather than maintaining basis matrices.
The path-connectivity property may yield iteration bounds independent of dimension for certain problem classes.

Load-bearing premise

The chosen definition of polytope must be rich enough to include key infinite-dimensional problems such as the Hilbert cube while still forcing all such polytopes to have exposed extreme points joined by edge paths.

What would settle it

Exhibit a linear program in a locally convex space whose feasible set meets the polytope definition yet possesses either a non-exposed extreme point or two exposed extreme points with no edge path connecting them.

Figures

Figures reproduced from arXiv: 2603.06948 by Christopher Thomas Ryan, Robert L Smith.

**Figure 2.** Figure 2: A counter-example to the converse of Proposition 1. Proof. Suppose H(p) = {p} and, by way of contradiction, that p = λx′ + (1 − λ)x ′′ for some x ′ , x′′ ∈ P and λ ∈ (0, 1) with x ′ ̸= x ′′ . Let’s derive a contradiction to x ′ ̸= x ′′. We do so by showing that x ′ , x′′ ∈ H(p) and using the fact that H(p) is the singleton {p} and so x ′ , x′′ ∈ H(p) implies that x ′ = x ′′ = p. It remains to show that x ′… view at source ↗

**Figure 3.** Figure 3: An illustration of extreme points, edges, and adjacent extreme points. Here [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗

**Figure 4.** Figure 4: Visualizing the construction of the Schauder basis at an extreme point. [PITH_FULL_IMAGE:figures/full_fig_p010_4.png] view at source ↗

read the original abstract

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many previous investigations of the simplex method, which are restricted to Hilbert spaces or otherwise specially structured instances. Our generality is obtained by avoiding the ``algebraic'' machinery of pivoting via column operations, which has required stronger topological conditions in establishing a connection between basic feasible solutions and extreme point structure. We show that our definition of polytopes captures optimization over the Hilbert cube, a quintessential object in infinite-dimensional spaces known for its surprisingly complicated properties. Moreover, all polytopes (under our definition) have exposed extreme points connected by edge paths.

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 gives a geometric simplex method for linear programs in locally convex spaces that covers the Hilbert cube by redefining polytopes to guarantee exposed extreme points on edge paths.

read the letter

The main takeaway is that this work extends the simplex method geometrically to general locally convex topological vector spaces without relying on algebraic pivoting. That choice relaxes the topological demands that confined earlier Hilbert-space versions, and the authors show their polytope definition includes the Hilbert cube while ensuring extreme points are exposed and connected by edges. This is the concrete new piece: a broader setting with a connectivity guarantee that supports convergence under stated conditions. It is a clean way to handle infinite-dimensional linear programs that show up in control and economics. The paper does well at laying out the setup and picking a nontrivial test case like the Hilbert cube to illustrate that the definition stays rich enough. The argument stays internally consistent by focusing on geometric properties rather than column operations. The soft spot is that the abstract states the convergence conditions and polytope properties but gives no derivation details or counter-example checks. Soundness depends on whether the full proofs confirm that the definition delivers edge-path connectivity without ruling out important practical instances. No circularity or self-referential fitting appears in the central claim. This is for readers already working in infinite-dimensional optimization who need an algorithmic handle on polytopes beyond Hilbert spaces. A specialist in that subfield would get value from the geometric framing and the Hilbert-cube example. I would send it to peer review so referees can examine the proofs directly.

Referee Report

2 major / 1 minor

Summary. The paper expands the simplex method to linear programs over locally convex topological vector spaces by introducing a geometric definition of polytopes that avoids algebraic pivoting. It states convergence conditions in value to optimality, shows that the definition includes optimization over the Hilbert cube, and claims that all such polytopes possess exposed extreme points connected by edge paths.

Significance. If the stated convergence conditions and polytope properties hold, the work would generalize the simplex method beyond Hilbert spaces or specially structured cases to a broader class of infinite-dimensional problems in functional analysis and optimization. The Hilbert-cube example is a concrete strength, as it demonstrates that the geometric definition remains sufficiently rich for a canonical infinite-dimensional set with known topological complexity. Machine-checked proofs or explicit edge-path constructions would further strengthen the contribution.

major comments (2)

[Abstract] Abstract: The central convergence claim rests on the geometric polytope definition guaranteeing exposed extreme points and edge-path connectivity, yet the abstract provides no derivation details or counter-example verification; the full manuscript must supply the explicit topological arguments (e.g., the relevant theorem establishing path connectivity) to confirm the claim does not rely on unstated assumptions about the locally convex topology.
[Abstract] Abstract: The assertion that the chosen polytope definition captures optimization over the Hilbert cube is load-bearing for demonstrating practical relevance; without an explicit construction or reference to a numbered result showing how the Hilbert cube satisfies the geometric polytope axioms while retaining exposed extreme points, it is unclear whether the definition is rich enough or inadvertently excludes key instances.

minor comments (1)

[Abstract] The abstract uses the phrase 'we show that our definition of polytopes captures optimization over the Hilbert cube' without indicating the section or theorem where the explicit verification appears; adding a forward reference would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed comments on the abstract. We address each major point below and will revise the manuscript accordingly to improve clarity.

read point-by-point responses

Referee: [Abstract] Abstract: The central convergence claim rests on the geometric polytope definition guaranteeing exposed extreme points and edge-path connectivity, yet the abstract provides no derivation details or counter-example verification; the full manuscript must supply the explicit topological arguments (e.g., the relevant theorem establishing path connectivity) to confirm the claim does not rely on unstated assumptions about the locally convex topology.

Authors: The abstract is intended as a high-level summary and therefore omits full derivations. The explicit topological arguments establishing path connectivity of exposed extreme points are given in Theorem 3.5, which proves that any polytope under our geometric definition in a locally convex space has exposed extreme points joined by edge paths. The proof relies only on the separation properties of locally convex topologies and the geometric axioms stated in Definition 2.3; no additional assumptions are used. We will revise the abstract to include a direct reference to Theorem 3.5. revision: yes
Referee: [Abstract] Abstract: The assertion that the chosen polytope definition captures optimization over the Hilbert cube is load-bearing for demonstrating practical relevance; without an explicit construction or reference to a numbered result showing how the Hilbert cube satisfies the geometric polytope axioms while retaining exposed extreme points, it is unclear whether the definition is rich enough or inadvertently excludes key instances.

Authors: Section 4 contains the explicit construction: the Hilbert cube is realized as a polytope satisfying the geometric axioms of Definition 2.3, and Proposition 4.2 verifies that its extreme points are exposed and connected by edge paths. This example is chosen precisely because the Hilbert cube is known to have complicated topological properties, yet our definition still applies. We will add a reference to Section 4 and Proposition 4.2 in the revised abstract. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper defines polytopes geometrically in locally convex spaces to ensure exposed extreme points and edge-path connectivity, then verifies that this definition includes the Hilbert cube as an example. The convergence claim for the simplex method follows from these topological properties rather than any fitted parameter, self-referential definition, or load-bearing self-citation. No equation or claim reduces by construction to its own inputs; the argument relies on external topological facts about the chosen space and the explicit verification for the Hilbert cube.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on a custom definition of polytope in locally convex spaces together with standard background results from topological vector space theory; no free parameters or new invented entities are introduced beyond the polytope definition itself.

axioms (2)

standard math Locally convex topological vector spaces admit a sufficient supply of continuous linear functionals to separate points and support exposed extreme points.
Invoked to guarantee that extreme points are exposed and that edge paths exist between them.
domain assumption The chosen polytope definition preserves the geometric properties needed for simplex iteration while remaining broad enough to contain the Hilbert cube.
This is the load-bearing modeling choice that enables the claimed generality.

invented entities (1)

Geometric polytope in locally convex space no independent evidence
purpose: To serve as the feasible region for the infinite-dimensional simplex method while ensuring exposed extreme points and edge connectivity.
New definition introduced to replace algebraic pivoting; independent evidence would be verification that it correctly models the Hilbert cube.

pith-pipeline@v0.9.0 · 5406 in / 1443 out tokens · 37208 ms · 2026-05-15T14:24:43.186902+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

all polytopes (under our definition) have exposed extreme points connected by edge paths
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean embed_injective unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We show that our definition of polytopes captures optimization over the Hilbert cube

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

44 extracted references · 44 canonical work pages

[1]

Vertices of choquet simplexes.Mathematica Scandinavica, 23(1): 171–176, 1969

Erik M Alfsen and Tore Nordseth. Vertices of choquet simplexes.Mathematica Scandinavica, 23(1): 171–176, 1969. 3, 16

work page 1969
[2]

Aliprantis and Kim C

Charalambos D. Aliprantis and Kim C. Border.Infinite Dimensional Analysis: A Hitchhiker’s Guide. Springer, 3rd edition, 2006. 3, 6, 13, 17, 18

work page 2006
[3]

Suns, moons, and quasi-polyhedra.Journal of Approximation Theory, 6(2):176–201, 1972

Dan Amir and Frank Deutsch. Suns, moons, and quasi-polyhedra.Journal of Approximation Theory, 6(2):176–201, 1972. 3, 16 mij =β iaij/δj. Under [22, (A3)], there exist ¯a >0 andα∈(0, δ) such that|a ij| ≤¯a α j for alli, j, and hence |mij| ≤¯a βi(α/δ)j. It follows that ∞X i=1 ∞X j=1 |mij|2 ≤¯a2 ∞X i=1 β2i ∞X j=1 (α/δ)2j <∞, sinceβ <1 andα < δ. Therefore,A 0 ...

work page 1972
[4]

Anderson and Peter Nash.Linear Programming in Infinite-Dimensional Spaces: Theory and Applications

Edward J. Anderson and Peter Nash.Linear Programming in Infinite-Dimensional Spaces: Theory and Applications. Wiley, 1987. 1, 4, 19

work page 1987
[5]

Anderson and A.S

E.J. Anderson and A.S. Lewis. An extension of the simplex algorithm for semi-infinite linear program- ming.Math. Prog., 44(1-3):247–269, 1989. 1

work page 1989
[6]

Anderson, M.A

E.J. Anderson, M.A. Goberna, and M.A. L´ opez. Simplex-like trajectories on quasi-polyhedral sets. Mathematics of Operations Research, 26(1):147–162, 2001. 1

work page 2001
[7]

Polyhedrality of infinite dimensional cubes.Pacific Journal of Mathematics, 70 (2):297–307, 1977

Thomas Armstrong. Polyhedrality of infinite dimensional cubes.Pacific Journal of Mathematics, 70 (2):297–307, 1977. 2, 3, 16

work page 1977
[8]

Cones convexes et pyramides convexes.Ann

Andr´ ee Bastiani. Cones convexes et pyramides convexes.Ann. Inst. Fourier, 9:249–292, 1959. 3, 16

work page 1959
[9]

Tsitsiklis.Introduction to Linear Optimization

Dimistris Bertsimas and John N. Tsitsiklis.Introduction to Linear Optimization. Athena, 1997. 1, 4

work page 1997
[10]

Cambridge University Press Cambridge, 2010

Jonathan M Borwein, Jon D Vanderwerff, et al.Convex functions: constructions, characterizations and counterexamples, volume 109. Cambridge University Press Cambridge, 2010. 9

work page 2010
[11]

On some geometric properties of suns.Journal of Approximation Theory, 10(3):245–267, 1974

Bruno Brosowski and Frank Deutsch. On some geometric properties of suns.Journal of Approximation Theory, 10(3):245–267, 1974. 3, 16

work page 1974
[12]

Forecast, solution, and rolling horizons in operations management problems: A classified bibliography.Manufacturing & Service Operations Management, 4 (1):25–43, 2002

Suresh Chand, Vernon Ning Hsu, and Suresh Sethi. Forecast, solution, and rolling horizons in operations management problems: A classified bibliography.Manufacturing & Service Operations Management, 4 (1):25–43, 2002. 1

work page 2002
[13]

Sets of efficient points in a normed space.Journal of Mathe- matical Analysis and Applications, 117(2):506–528, 1986

Roland Durier and Christian Michelot. Sets of efficient points in a normed space.Journal of Mathe- matical Analysis and Applications, 117(2):506–528, 1986. 3, 16

work page 1986
[14]

Polyhedral norms in an infinite dimensional space.The Rocky Mountain Journal of Mathematics, pages 863–875, 1993

Roland Durier and Pier Luigi Papini. Polyhedral norms in an infinite dimensional space.The Rocky Mountain Journal of Mathematics, pages 863–875, 1993. 3

work page 1993
[15]

The persuasion duality.Theoretical Economics, 19(4):1701–1755,

Piotr Dworczak and Anton Kolotilin. The persuasion duality.Theoretical Economics, 19(4):1701–1755,

work page
[16]

An interior point algorithm for semi-infinite linear program- ming.Mathematical Programming, 43:257–276, 1989

Michael C Ferris and Andrew B Philpott. An interior point algorithm for semi-infinite linear program- ming.Mathematical Programming, 43:257–276, 1989. 1

work page 1989
[17]

Infinite-dimensional polyhedrality.Canadian Journal of Mathemat- ics, 56(3):472–494, 2004

Vladimir P Fonf and Libor Vesel` y. Infinite-dimensional polyhedrality.Canadian Journal of Mathemat- ics, 56(3):472–494, 2004. 3

work page 2004
[18]

Infinite dimensional convexity

VP Fonf, J Lindenstrauss, and RR Phelps. Infinite dimensional convexity. InHandbook of the Geometry of Banach Spaces, volume 1, pages 599–670. Elsevier, 2001. 3

work page 2001
[19]

Archis Ghate and Robert L. Smith. Characterizing extreme points as basic feasible solutions in infinite linear programs.Operations Research Letters, 37(1):7–10, 2009. 4

work page 2009
[20]

Archis Ghate and Robert L. Smith. A linear programming approach to non stationary infinite-horizon Markov decision processes.Operations Research, 61:413–425, 2013. 1, 2

work page 2013
[21]

Archis Ghate, Dushyant Sharma, and Robert L. Smith. A shadow simplex method for infinite linear programs.Operations Research, 58(4):865–877, 2010. 12

work page 2010
[22]

A simplex method for countably infinite linear programs.SIAM Journal on Optimization, 31(4):3157–3183, 2021

Archis Ghate, Christopher T Ryan, and Robert L Smith. A simplex method for countably infinite linear programs.SIAM Journal on Optimization, 31(4):3157–3183, 2021. 1, 2, 6, 21, 22

work page 2021
[23]

A note on polyhedral Banach spaces.Proceedings of the American Mathematical Society, pages 398–404, 1972

Alan Gleit and Robert McGuigan. A note on polyhedral Banach spaces.Proceedings of the American Mathematical Society, pages 398–404, 1972. 3, 16 23

work page 1972
[24]

Online learning to transport via the minimal selection principle

Wenxuan Guo, YoonHaeng Hur, Tengyuan Liang, and Christopher Thomas Ryan. Online learning to transport via the minimal selection principle. InConference on Learning Theory, pages 4085–4109. PMLR, 2022. 1

work page 2022
[25]

Lasserre.Discrete-time Markov Control Processes: Basic Optimality Criteria, volume 30

Onesimo Hern´ andez-Lerma and Jean B. Lasserre.Discrete-time Markov Control Processes: Basic Optimality Criteria, volume 30. Springer, 2012. 1

work page 2012
[26]

Springer Science & Business Media, 2012

Richard B Holmes.Geometric Functional Analysis and its Applications, volume 24. Springer Science & Business Media, 2012. 3

work page 2012
[27]

On the translocation of masses.Management Science, 5(1):1–4, 1958

Leonid Kantorovitch. On the translocation of masses.Management Science, 5(1):1–4, 1958. 1

work page 1958
[28]

Strict separation of convex sets.Proceedings of the American Mathematical Society, 7(4): 735–737, 1956

VL Klee. Strict separation of convex sets.Proceedings of the American Mathematical Society, 7(4): 735–737, 1956. 3, 7, 16, 19

work page 1956
[29]

Strong duality in monopoly pricing.Econometrica, 87(4): 1391–1396, 2019

Andreas Kleiner and Alejandro Manelli. Strong duality in monopoly pricing.Econometrica, 87(4): 1391–1396, 2019. 1

work page 2019
[30]

Constraint aggregation in infinite-dimensional spaces and applications.Mathematics of Operations Research, 26(4):769–795, 2001

Arkadii V Kryazhimskii and Andrzej Ruszczy´ nski. Constraint aggregation in infinite-dimensional spaces and applications.Mathematics of Operations Research, 26(4):769–795, 2001. 1

work page 2001
[31]

Infinite dimensional polytopes.Mathematica Scandinavica, 32(2):193–213, 1974

Ka-sing Lau. Infinite dimensional polytopes.Mathematica Scandinavica, 32(2):193–213, 1974. 3, 16

work page 1974
[32]

Convex polytopes in linear spaces.Illinois Journal of Mathematics, 9(4):623–635, 1965

PH Maserick. Convex polytopes in linear spaces.Illinois Journal of Mathematics, 9(4):623–635, 1965. 3, 16

work page 1965
[33]

M´ emoire sur la th´ eorie des d´ eblais et des remblais.Mem

Gaspard Monge. M´ emoire sur la th´ eorie des d´ eblais et des remblais.Mem. Math. Phys. Acad. Royale Sci., pages 666–704, 1781. 1

work page
[34]

Infinite dimensional compact convex polytopes.Mathematica Scandinavica, 24(1): 5–26, 1969

Robert R Phelps. Infinite dimensional compact convex polytopes.Mathematica Scandinavica, 24(1): 5–26, 1969. 3, 16, 19

work page 1969
[35]

Malcolm C. Pullan. An algorithm for a class of continuous linear programs.SIAM Journal on Control and Optimization, 31(6):1558–1577, 1993. 1

work page 1993
[36]

Maximal core representing measures and generalized polytopes.The Quarterly Journal of Mathematics, 25(1):257–271, 1974

M Rajagopalan and AK Roy. Maximal core representing measures and generalized polytopes.The Quarterly Journal of Mathematics, 25(1):257–271, 1974. 3, 16

work page 1974
[37]

International Series in Pure and Applied Mathematics

Walter Rudin.Functional Analysis. International Series in Pure and Applied Mathematics. McGraw– Hill, New York, 2 edition, 1991. ISBN 0-07-054236-8. 22

work page 1991
[38]

A simplex method for uncapac- itated pure-supply infinite network flow problems.SIAM Journal on Optimization, 28(3):2022–2048,

Christopher Thomas Ryan, Robert L Smith, and Marina A Epelman. A simplex method for uncapac- itated pure-supply infinite network flow problems.SIAM Journal on Optimization, 28(3):2022–2048,

work page 2022
[39]

Schaefer.Topological Vector Spaces

H.H. Schaefer.Topological Vector Spaces. Springer, 1971. 8

work page 1971
[40]

Sharkey and H

Thomas C. Sharkey and H. Edwin Romeijn. A simplex algorithm for minimum-cost network-flow problems in infinite networks.Networks, 52(1):14–31, 2008. 1, 2

work page 2008
[41]

A simplex-type algorithm for continuous linear programs with constant coefficients.Mathematical Programming, 180:157–201, 2020

Evgeny Shindin and Gideon Weiss. A simplex-type algorithm for continuous linear programs with constant coefficients.Mathematical Programming, 180:157–201, 2020. 1

work page 2020
[42]

Infinite horizon production planning in time-varying systems with convex production and inventory costs.Management Science, 44(9):1313–1320, 1998

Robert L Smith and Rachel Q Zhang. Infinite horizon production planning in time-varying systems with convex production and inventory costs.Management Science, 44(9):1313–1320, 1998. 1

work page 1998
[43]

World Scientific, 2019

Valeriu Soltan.Lectures on Convex Sets. World Scientific, 2019. 5

work page 2019
[44]

A simplex based algorithm to solve separated continuous linear programs.Mathematical Programming, 115(1):151–198, 2008

Gideon Weiss. A simplex based algorithm to solve separated continuous linear programs.Mathematical Programming, 115(1):151–198, 2008. 1 24

work page 2008