On a degeneracy ratio for bounded convex polytopes

Han Cheng Lie; Nada Cvetkovi\'c

arxiv: 1907.06085 · v1 · pith:U7Q7JTVGnew · submitted 2019-07-13 · 🧮 math.OC

On a degeneracy ratio for bounded convex polytopes

Nada Cvetkovi\'c , Han Cheng Lie This is my paper

Pith reviewed 2026-05-24 21:58 UTC · model grok-4.3

classification 🧮 math.OC

keywords degeneracy ratioconvex polytopesouter unit normalssmallest singular valuemajorizationroundness measurebounded convex setsfacet normals matrix

0 comments

The pith

The roundness measure of a bounded convex polytope is majorized by the smallest singular value of the matrix of its outer unit normals.

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

The paper introduces a degeneracy ratio that quantifies how far a bounded convex d-polytope deviates from roundness in R^d. It establishes an upper bound on this ratio expressed through the smallest singular value of the matrix whose entries are the outer unit normals to the polytope's facets. A reader would care because the bound converts a geometric shape property into a linear-algebraic quantity that can be computed from the boundary description alone. The result holds for any finite number of facets and any dimension.

Core claim

We consider a quantity that measures the roundness of a bounded, convex d-polytope in R^d. We majorise this quantity in terms of the smallest singular value of the matrix of outer unit normals to the facets of the polytope.

What carries the argument

The degeneracy ratio, upper-bounded via majorization by the smallest singular value of the outer-unit-normals matrix.

If this is right

Any polytope whose normals matrix has a large smallest singular value must have a degeneracy ratio no larger than the derived majorant.
The bound supplies a sufficient condition for controlling polytope degeneracy without directly measuring all pairwise facet angles or vertex positions.
The majorization holds uniformly across all dimensions and all numbers of facets.
Verification of the bound reduces to a singular-value computation on the normals matrix rather than a search over the polytope's combinatorial structure.

Where Pith is reading between the lines

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

The result may allow replacement of geometric roundness checks by a single linear-algebra step inside optimization solvers that rely on polytope representations.
It raises the question of whether a matching lower bound or a sharp constant exists that would make the majorization an equality in some limiting cases.
The same normals matrix could be examined for other singular-value statistics to obtain refined shape controls beyond the smallest one.

Load-bearing premise

The polytope is bounded and convex, guaranteeing a finite collection of outer unit normals that form a matrix admitting a smallest singular value.

What would settle it

Exhibit one concrete bounded convex polytope together with explicit computation of both its degeneracy ratio and the smallest singular value of its normals matrix such that the ratio exceeds the claimed majorant.

read the original abstract

We consider a quantity that measures the roundness of a bounded, convex $d$-polytope in $\mathbb{R}^d$. We majorise this quantity in terms of the smallest singular value of the matrix of outer unit normals to the facets of the polytope.

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 defines a roundness measure for bounded convex polytopes and gives an explicit majorization by the smallest singular value of the matrix of outer unit normals.

read the letter

The main point is a bound on a degeneracy ratio for bounded convex d-polytopes that measures roundness, expressed in terms of the smallest singular value of the matrix whose rows are the outer unit normals to the facets. The abstract states the setting and the majorization cleanly, with no obvious internal contradiction in the claim. The connection between a geometric roundness quantity and a linear-algebra conditioning measure on the normals is direct and stays within the standard polytope assumptions, so the matrix is well-defined and the singular value is a natural object to use. That link could be handy in contexts where facet normals are already computed, such as in linear programming or polyhedral computations. The work is narrow by design, limited to polytopes rather than general convex bodies, which keeps the statement precise but also limits its reach. The abstract supplies no derivation, no equality cases, and no comparison to prior bounds, so it is not possible to judge sharpness or overlap with existing results in convex geometry. If the full paper contains a self-contained proof and a few low-dimensional checks, that would make the contribution easier to assess. This is the sort of short, technical note that might interest readers working on conditioning or degeneracy in optimization over polytopes. A specialist in that area could extract value from the explicit bound even if the result turns out to be incremental. I would send it to peer review. The claim is specific enough that referees can check the math without needing extra context.

Referee Report

2 major / 0 minor

Summary. The manuscript defines a degeneracy (roundness) ratio for bounded convex d-polytopes in R^d and claims to majorize this ratio by the smallest singular value of the matrix whose rows (or columns) are the outer unit normals to the facets.

Significance. If the claimed majorization holds with a complete proof, it would connect a geometric roundness measure to a standard linear-algebra quantity (smallest singular value), offering a potentially useful bound for polytope analysis in optimization. No machine-checked proofs, reproducible code, or parameter-free derivations are present.

major comments (2)

[Abstract / main text] The manuscript states the majorization result but supplies neither a derivation of the inequality, the precise definition of the degeneracy ratio, nor any error analysis or assumptions beyond the abstract's first sentence. This renders the central claim unverifiable.
[Abstract] No explicit statement appears of whether the matrix of normals is square or rectangular, how its singular values are computed when the number of facets exceeds d, or under what conditions the majorization is tight or strict.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed comments. The points raised correctly identify that the current concise manuscript does not provide sufficient explicit detail on definitions, derivations, matrix dimensions, and tightness conditions. We will revise the manuscript to incorporate these elements.

read point-by-point responses

Referee: [Abstract / main text] The manuscript states the majorization result but supplies neither a derivation of the inequality, the precise definition of the degeneracy ratio, nor any error analysis or assumptions beyond the abstract's first sentence. This renders the central claim unverifiable.

Authors: We agree that the manuscript as submitted is too brief and lacks the requested elements. In the revised version we will add the precise definition of the degeneracy (roundness) ratio, a complete derivation of the majorization inequality, the standing assumptions on the polytope, and a brief discussion of numerical stability or error considerations. revision: yes
Referee: [Abstract] No explicit statement appears of whether the matrix of normals is square or rectangular, how its singular values are computed when the number of facets exceeds d, or under what conditions the majorization is tight or strict.

Authors: The matrix A whose rows are the outer unit normals is rectangular (m × d with m ≥ d). Its singular values are the square roots of the eigenvalues of AᵀA (or AAᵀ). We will insert an explicit statement clarifying the rectangular case, the SVD computation, and the equality cases (tightness) of the bound in both the abstract and the main text. revision: yes

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper defines a roundness/degeneracy-ratio quantity for bounded convex polytopes and states a majorisation result in terms of the smallest singular value of the matrix of outer unit normals. The abstract and description contain no equations, no fitted parameters renamed as predictions, no self-citations that are load-bearing for the central claim, and no self-definitional steps. The setting (bounded convex polytope with finite outer normals) is stated explicitly as an assumption, and the majorisation is presented as the result without reducing to its inputs by construction. This matches the provided reader's assessment of score 2.0 with no internal inconsistency visible.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract supplies no explicit free parameters, axioms, or invented entities; all details are deferred to the unseen full text.

pith-pipeline@v0.9.0 · 5553 in / 1054 out tokens · 20386 ms · 2026-05-24T21:58:52.346382+00:00 · methodology

On a degeneracy ratio for bounded convex polytopes

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)