REVIEW 2 major objections 6 minor 12 references
Characterizations of Faces of Convex Sets in Infinite-dimensional Vector Spaces
T0 review · 2 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read In any real vector space, every proper face of a convex set is the zero set of a nonnegative regular step-affine function, and equally the minimum set of a compatible total preorder.
desk verdict New topology-free face characterizations, but the theorems as stated fail because the sufficiency directions don't enforce properness; a small added condition fixes them. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The machinery is the generalized semispace: a maximal by inclusion convex subset of $X$ that is disjoint from a given affine manifold $M$; Proposition 2 shows it has the cone-like structure $S = \{a + t(x - a) \mid x \in S,\ t > 0\}$ for any $a \in M$. Theorem 3 is built on it: a face $F$ is cut out by taking $M = \mathrm{aff}\,F$ and any semispace $S$ generated by $M$ that contains $Q \setminus F$, so $Q \subset M \cup S$ and $F = M \cap Q$. From this single construction, the other two characterizations are derived. The compatible total preorder comes from the recession cone $0^{+}S$ of $S$, which is a conical halfspace and yields the order $x \preceq y$ iff $y - x \in 0^{+}S$. The step-affine function comes from Proposition 5, quoted from earlier work, which identifies $S$ as $\{u > 0\}$ and $M$ as $\{u = 0\}$ for a regular step-affine function $u$. Theorem 8 then splits the step-affine version into finite rank (lexicographically exposed faces) and rank one (exposed faces).
What would settle it
Find one convex set $Q$ in an infinite-dimensional real vector space and one proper face $F$ for which no affine manifold $M$ satisfies $F = M \cap Q$ with $Q \subset M \cup S$ for some generalized semispace $S$ generated by $M$; equivalently, find a proper face that is not the zero set of any nonnegative regular step-affine function. The standard example of a non-exposed face (cited in the paper from [1, p.179]) is a natural search area, since non-exposed faces are where the classical linear-function description breaks down.
Extended reading notes
Core claim
The central result is a three-way equivalence, stated as Theorem 7, for any convex set $Q$ in a real vector space $X$ and any $F \subset Q$: $F$ is a proper face of $Q$ iff (b) there exist a nonempty affine manifold $M$ and a generalized semispace $S$ generated by $M$ with $Q \subset M \cup S$ and $F = M \cap Q$; iff (c) $F$ is the set $\mathrm{Min}(Q\,|\preceq)$ of minimal elements for some compatible total preorder $\preceq$ on $X$; iff (d) there is a regular step-affine function $u$ with $u(x) \ge 0$ on $Q$ and $F = \{x \in Q \mid u(x) = 0\}$. Theorem 3 establishes (b), Theorem 4 establishes (c), and Theorem 6 establishes (d). The proof route passes through (b): Proposition 1 shows that for a proper face, $Q \setminus F$ is convex and $\mathrm{aff}\,F$ is disjoint from $Q \setminus F$, so a generalized semispace generated by $\mathrm{aff}\,F$ can contain $Q \setminus F$. Then (c) follows by taking the recession cone of the semispace, and (d) follows by representing the semispace as the positive set of a regular step-affine function.
Load-bearing premise
The load-bearing premise is the imported duality that generalized semispaces are exactly the positive sets of regular step-affine functions, together with the recession-cone criterion that makes a compatible preorder total; if either of those classifications has a hidden restriction, the equivalence would fail for some face.
Editorial extensions
If this is right
- In any real vector space, faces can be studied without any topology: a face is fully determined by the algebraic data of a maximal convex set disjoint from an affine manifold.
- Every proper face of a convex set is the minimum set of some compatible total preorder, so face structure is fully expressible in order-theoretic terms.
- Every proper face is the zero set of a nonnegative regular step-affine function; this generalizes the classical picture in which an exposed face is the zero set of a supporting affine function.
- Faces that are lexicographically exposed are exactly those representable by a finite-rank step-affine function, and exposed faces by rank-one step-affine functions, so the finite-dimensional theorem becomes a corollary.
Reading between the lines
- A natural next step the paper only hints at is to index faces by the order type of the defining cortege: finite rank gives lexicographic faces, while countable rank would give a new intermediate class in infinite-dimensional spaces.
- The preorder formulation could be applied to vector optimization without topology: minimal elements of compatible total preorders give a face-based solution concept analogous to lexicographic scalarization.
- One could test the sharpness of Proposition 5 by asking whether every generalized semispace in a given space can be generated by a cone over a linearly independent set of linear functionals; if not, the step-affine representation would need a wider function class.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims three equivalent, topology-free characterizations of proper faces of convex sets in arbitrary real vector spaces: Theorem 3 characterizes a proper face F of Q as an intersection F = M ∩ Q with a nonempty affine manifold M and a generalized semispace S generated by M such that Q ⊆ M ∪ S; Theorem 4 characterizes F as the minimum set Min(Q | ⪯) of a compatible total preorder; Theorem 6 characterizes F as the zero set of a regular step-affine function u with u ≥ 0 on Q. Theorem 7 declares the three statements equivalent, and Theorem 8 gives finite-rank and rank-one refinements that recover lexicographically exposed and exposed faces. Corollary 9 then derives Martinez-Legaz's finite-dimensional lexicographic characterization.
Significance. The proposed characterizations are natural and would give a complete, purely algebraic description of all faces without topological assumptions. The use of generalized semispaces, compatible preorders built from recession cones, and step-affine functions is elegant, and the necessity directions are largely well motivated. The paper is not fully self-contained: Proposition 5 imports the classification of generalized semispaces by regular step-affine functions from the author's earlier work, which is acceptable if that result is correct. The main contribution is the reduction of face theory to halfspace-type objects, but as written the central iff statements are false, so the paper needs a substantive correction before the claimed equivalence can be accepted.
major comments (2)
- [Theorems 3, 4, 6 and Theorem 7] The sufficiency directions prove only that the set F is a face, not that it is a proper face. Concretely, in any nontrivial real vector space X take Q = {x0}, M = {x0}, and let S be any generalized semispace generated by M (which exists by Zorn). Then Q ⊆ M ∪ S and F = M ∩ Q = Q, so the right-hand side of Theorem 3 holds even though F is not a proper face. The same defect is present in Theorem 6: for a nonzero linear functional l, the regular step-affine function u(x) = l(x - x0) satisfies u ≥ 0 on Q and F = {x ∈ Q : u(x) = 0} = Q. For Theorem 4, the compatible total preorder defined by l yields Min(Q | ⪯) = Q. Thus the universal iff statements are false as written. The fix is local: add the conditions F ≠ ∅ and F ≠ Q to the right-hand sides of Theorems 3, 4, 6 and Theorem 7(b)–(d), and in the sufficiency proofs explicitly observe that the already-proved face property plus these two conditions gives properness. The necessity proofs already assume properness and are unaffected; the internal constructions (semispace selection, preorder from recession cone, step-affine function from Proposition 5) remain valid.
- [Theorem 8 and Section 6] The improperness issue propagates to Theorem 8. In the sufficiency proof of part (a), the paper says 'by Theorem 6 F is a face of Q' and then proceeds to show F is lexicographically exposed. Since Theorem 6 as stated yields only a face, not a proper face, the proof would also apply to F = Q, for which the conclusion 'F is lexicographically exposed' is not meaningful under the paper's definition of a proper face. Once Theorem 6 is repaired as suggested, the proof of Theorem 8 works, but the dependence on a corrected Theorem 6 must be stated.
minor comments (6)
- [Abstract] The phrase 'All three characterization are equivalent each other' should be 'All three characterizations are equivalent to one another'.
- [Theorem 6] In the statement, 'A subset F⊂Qia a proper face' should read 'F⊂Q is a proper face'; in the proof, the expression 'S u S Mu' should contain explicit union symbols, e.g. S_u ∪ M_u.
- [Theorem 7(d)] The theorem states that u maps X to X, but the correct codomain is R, i.e. u : X → R, as used in Theorems 6 and 8.
- [Theorem 4, necessity proof] The displayed definition of Min(M∪S | ⪯_S) quantifies over y ∈ Q, but for the argument it must quantify over y ∈ M∪S; otherwise the subsequent equality M = Min(M∪S | ⪯_S) does not follow. This is a typo in the quantifier, not a substantive gap.
- [References] Reference [10] contains the typo 'Pronidence' for 'Providence'.
- [Notation] The manuscript uses the symbol F for disjoint union in expressions such as 'M F S', which is easily confused with the face F. A different symbol such as ⨆ or an explicit verbal clarification would improve readability.
Circularity Check
No significant circularity: the face characterizations are derived from independent convex-geometry lemmas, and the quoted prior-work results are external support rather than the target claim.
full rationale
I found no step where the paper's central claim reduces by construction to its own inputs. Theorem 3's necessity proof builds M = affF from Proposition 1 and chooses a generalized semispace containing Q\F; its sufficiency proof directly verifies the face property from Q⊂M∪S. Theorem 4's necessity reduces to Theorem 3 by constructing a total preorder from the recession cone of a halfspace, while its sufficiency is an independent segment argument. Theorem 6 similarly reduces to Theorem 3 via Proposition 5, which is quoted from the author's earlier work [8, Theorem 4.1]. Although [7] and [8] are self-citations, they are published, proof-carrying mathematical results with assumptions that do not include the target face characterization; citing them is external support, not circularity. No fitted parameters, definitional identities, or renamed-ansatz moves occur. The skeptical examples (F=Q or F=∅) point to a possible omission of properness conditions in the sufficiency directions of Theorems 3, 4, and 6; that is a correctness defect in the theorem statements as written, not a circular derivation. Therefore the circularity score is 0.
Assumptions & free parameters
assumptions (3)
- standard math Kuratowski-Zorn lemma (Axiom of Choice)
- domain assumption Halfspace classification results of [7,8]: recession cones of halfspaces are conical halfspaces and 0+S union -(0+S) equals X for generalized semispaces S
- domain assumption Proposition 5 from [8, Theorem 4.1]: every regular step-affine function defines a generalized semispace via its positive and zero level sets, and conversely every generalized semispace arises this way
Cite this review
Pith. "Pith review of Characterizations of Faces of Convex Sets in Infinite-dimensional Vector Spaces." pith.science (2026). https://pith.science/paper/5YJ3YQJJ
@misc{pith2026250608742,
author = {Pith},
title = {Pith review of: Characterizations of Faces of Convex Sets in Infinite-dimensional Vector Spaces},
year = {2026},
howpublished = {\url{https://pith.science/paper/5YJ3YQJJ}},
note = {Machine review of arXiv:2506.08742}
}
read the original abstract
In the paper three different characterizations of faces of convex sets, belonging to infinite-dimensional real vector spaces, are presented. The first one is formulated in the terms of generalized semispaces, the second -- in the terms of compatible complete (total) preorders, and the third -- in the terms of step-affine functions. All three characterization are equivalent each other and extend to infinite-dimensional vector spaces the lexicographical characterization of faces established in finite-dimensional settings by Martinez-Legaz J.-E. (Acta Mathematica Vietnamica. 1997. Vol. 22, No.~1, P. 207--211).
Reference graph
Works this paper leans on
-
[4]
Set-Valued and Variational Analysis, Article 14 (2023) https://doi.org/10.1007/s11228-023-00671-6
Diaz Millan, R., Roshchina V.: The Intrinsic Core and Minimal Faces of Convex Sets in General Vector Spaces. Set-Valued and Variational Analysis, Article 14 (2023) https://doi.org/10.1007/s11228-023-00671-6
-
[1]
Rockafellar, R.T.: Convex Analysis, Princeton University Press, Princeton, New Jersey (NJ) (1973)
work page 1973
-
[2]
Mordukhovich, B.S., Nam, N.M.: Convex analysis and beyond. Vol.1 Basic theory. Springer (2022) https://doi.org/10.1007/978-3-030-94785-9; ISBN 9783030947842
-
[3]
Springer-Verlag (1983) https://doi.org/10.1007/978-1-4612-1148-8; ISBN 978-0-387-90722-2
Bronsted, A.: An Introduction to Convex Polytopes. Springer-Verlag (1983) https://doi.org/10.1007/978-1-4612-1148-8; ISBN 978-0-387-90722-2
-
[5]
Acta Mathematica Vietnamica 22(1), 207–211 (1997)
Martinez-Legaz, J.-E.: Lexicographical characterization of the faces of convex sets. Acta Mathematica Vietnamica 22(1), 207–211 (1997)
work page 1997
-
[6]
Lassak, M.: Convex half-spaces. Fund. Math. 120(2), 7–13 (1984) https://doi.org/10.4064/fm-120-1-7-13
-
[7]
Mathematical Notes 64(2), 164 – 169 (1998) https://doi.org/10.1007/BF02310300
Gorokhovik, V.V., Semenkova, E.A.: Classification of semispaces according to their types in infinite-dimensional vector spaces. Mathematical Notes 64(2), 164 – 169 (1998) https://doi.org/10.1007/BF02310300
-
[8]
Gorokhovik, V.V., Shinkevich, E.A.: Geometric structure and classification of infinite-dimensional halfspaces. In: Przeworska–Rolewich, D. (ed). Algebraic Analysis and Related Topics. Banach Center Publications 53, 121–138 (2000) https://www.researchgate.net/publication/388932409
Show all 12 references
-
[9]
Proceedings of the Steklov Institute of Mathematics (Suppl.) 313(Suppl
Gorokhovik, V.V.: Step-Affine Functions, Halfspaces, and Separation of Con- vex Sets with Applications to Convex Optimization Problems. Proceedings of the Steklov Institute of Mathematics (Suppl.) 313(Suppl. 1), S83–S99 (2021) https://doi.org/10.1134/S008154382103010X 11
2021 doi
-
[10]
Pronidence (RI): American Math
Hille, E., Phillips, R.S.: Functional analysis and Semi-Groups. Pronidence (RI): American Math. Society (1957)
1957
-
[11]
Springer-Verlag (2006)
Jech, T.J.: Set theory: The third millenium edition (3rd ed.). Springer-Verlag (2006)
2006
-
[12]
Harper and Row, (1967) 12
Peressini, A.L.: Ordered topological vector spaces. Harper and Row, (1967) 12
1967
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.