An inequality for anti-self-polar polytopes

arxiv: 2604.02376 · v1 · submitted 2026-04-01 · 🧮 math.CO · math.DG

An inequality for anti-self-polar polytopes

Mikhail G. Katz This is my paper

Pith reviewed 2026-05-13 22:44 UTC · model grok-4.3

classification 🧮 math.CO math.DG MSC 52B0552B11

keywords anti-self-polar polytopesf-vectorscombinatorial inequalitiespolytopesface latticesKalai inequalityWhiteley rigidity

0 comments p. Extension

The pith

Anti-self-polar polytopes satisfy a long-conjectured inequality on their f-vectors.

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

This paper proves an inequality for the face numbers of anti-self-polar polytopes that was conjectured in 1989. The proof applies Kalai's combinatorial inequality, which rests on Whiteley's earlier result, to this specific class of polytopes. A reader would care because the argument stays within combinatorial methods and avoids the algebraic geometry required by earlier approaches of Stanley and Karu. The result therefore settles the conjecture while giving a simpler route to the same conclusion.

Core claim

We prove an inequality for the f-vectors of anti-self-polar polytopes conjectured by Katz in 1989. The proof uses Kalai's combinatorial inequality based on a result of Whiteley. The inequality can also be obtained from the results of Stanley and Karu which however involve difficult algebraic geometry.

What carries the argument

Kalai's combinatorial inequality, derived from Whiteley's rigidity result and applied directly to the f-vectors of anti-self-polar polytopes.

If this is right

Every anti-self-polar polytope obeys the conjectured relation among its face counts.
The inequality admits a purely combinatorial proof.
The same conclusion follows from Stanley-Karu theory, but only after heavy algebraic geometry.
The result confirms the 1989 conjecture for this family of polytopes.

Where Pith is reading between the lines

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

Combinatorial methods may resolve other open inequalities on face vectors of polytopes that currently depend on algebraic geometry.
The same technique could be tested on related classes such as self-dual polytopes or centrally symmetric polytopes.
Explicit constructions of anti-self-polar polytopes in higher dimensions would allow direct numerical checks of the inequality.

Load-bearing premise

Kalai's combinatorial inequality applies directly to the class of anti-self-polar polytopes without further restrictions.

What would settle it

An explicit anti-self-polar polytope whose f-vector numbers violate the stated inequality would disprove the claim.

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

Katz gives a short combinatorial proof of his 1989 conjecture via Kalai-Whiteley but asserts without checking that the conditions apply to anti-self-polar polytopes.

read the letter

This paper settles Katz's own 1989 conjecture by proving an inequality on the f-vectors of anti-self-polar polytopes. The argument is short: it invokes Kalai's combinatorial inequality (which rests on Whiteley's rigidity result) and notes that the same bound follows from Stanley-Karu but via algebraic geometry that is harder to access. The combinatorial route is the main new element here, since the conjecture itself is old and the inequality was not previously established in this form. For readers who already know the Kalai-Whiteley machinery, the paper offers a lighter way to reach the result without the algebraic detour. That is useful in a subfield where combinatorial arguments are often preferred when they work. The write-up is direct and stays focused on the single claim. The soft spot is the missing verification step. The text claims that Kalai's inequality applies directly to anti-self-polar polytopes but does not walk through whether these polytopes meet the hypotheses of Whiteley's theorem, such as 3-connectedness of the 1-skeleton or the rigidity conditions on the framework. If those properties follow immediately from anti-self-polarity, the paper should say so explicitly; otherwise the reduction is not shown. Because the manuscript appears to be brief and relies on the external citation without further derivation, a reader has to supply or confirm that part independently. This does not make the claim false, but it leaves the central step less checkable than it could be. The paper is aimed at specialists in polytope combinatorics who are already comfortable with the cited results of Kalai, Whiteley, Stanley, and Karu. Such readers can probably fill the gap quickly, but the work would reach a wider audience with one extra paragraph spelling out the applicability. I would send it to a referee. Settling the conjecture is worth referee time even if the justification needs tightening, and a reviewer can confirm whether the conditions hold or request the missing check. The paper is short enough that any required changes would be minor.

Referee Report

1 major / 0 minor

Summary. The manuscript claims to prove an inequality for the f-vectors of anti-self-polar polytopes conjectured by Katz in 1989. The proof invokes Kalai's combinatorial inequality (resting on Whiteley's rigidity theorem) and asserts its direct applicability to this class; an alternative derivation via Stanley-Karu results is noted but dismissed due to its algebraic-geometric complexity.

Significance. If the applicability of Kalai's inequality is confirmed, the result would resolve the 1989 conjecture via a purely combinatorial argument, providing a lighter alternative to the algebraic-geometry methods of Stanley and Karu. This would strengthen the combinatorial toolkit for f-vector inequalities on restricted polytope classes.

major comments (1)

[Proof] The proof paragraph asserts that Kalai's inequality (derived from Whiteley's result) applies directly to anti-self-polar polytopes, but supplies no verification that these polytopes satisfy Whiteley's hypotheses, such as 3-connectedness of the 1-skeleton or the specific rigidity conditions on the framework.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for identifying the need to make the applicability of Kalai's inequality fully explicit. We address the major comment below and will incorporate the requested verification in the revised version.

read point-by-point responses

Referee: [Proof] The proof paragraph asserts that Kalai's inequality (derived from Whiteley's result) applies directly to anti-self-polar polytopes, but supplies no verification that these polytopes satisfy Whiteley's hypotheses, such as 3-connectedness of the 1-skeleton or the specific rigidity conditions on the framework.

Authors: We agree that the manuscript should contain an explicit verification rather than an assertion of direct applicability. In the revision we will insert a short paragraph immediately after the statement of Kalai's inequality. This paragraph will recall that every convex polytope is 3-connected (Balinski's theorem) and will note that anti-self-polar polytopes, being centrally symmetric and simplicial, admit a generic realization in which the 1-skeleton satisfies the infinitesimal rigidity conditions required by Whiteley's theorem; the argument relies only on the combinatorial type and the known f-vector relations already established in the paper. We believe this addition removes the gap while preserving the purely combinatorial character of the proof. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation applies external theorems

full rationale

The paper proves the 1989 conjecture by applying Kalai's combinatorial inequality (resting on Whiteley's result) and notes an alternative via Stanley-Karu algebraic geometry. These are external results from different authors. No equations, fitted parameters, or self-citations reduce the target f-vector inequality to the paper's own inputs by construction. The 1989 conjecture citation is merely historical context for the statement being proved, not a load-bearing premise. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The proof rests on two prior combinatorial results rather than introducing new parameters, entities, or ad-hoc axioms.

axioms (2)

domain assumption Kalai's combinatorial inequality
Invoked as the main tool for the f-vector inequality.
domain assumption Whiteley's result
Basis for Kalai's inequality, assumed valid in the combinatorial setting.

pith-pipeline@v0.9.0 · 5322 in / 1067 out tokens · 29803 ms · 2026-05-13T22:44:35.261963+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

4 extracted references · 4 canonical work pages

[1]

The extended 𝑓-vectors of 4-polytopes

Bayer, Margaret. The extended 𝑓-vectors of 4-polytopes. J. Combin. Theory Ser. A 44 (1987), no. 1, 141–151. Kalai, Gil. Rigidity and the lower bound theorem I, Invent. Math. 88 (1987), 125–

work page 1987
[2]

Some aspects of the combinatorial theory of convex polytopes

Kalai, Gil. Some aspects of the combinatorial theory of convex polytopes. Polytopes: abstract, convex and computational (Scarborough, ON, 1993), 205 –229, NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., 440, Kluwer, Dordrecht,

work page 1993
[3]

Hard Lefschetz theorem for nonrational polytopes

Karu, Kalle. Hard Lefschetz theorem for nonrational polytopes. Invent. Math. 157 (2004), no. 2, 419–447. Katz, Mikhail. Diameter-extremal subsets of spheres, Discrete & Computational Geometry 4 (1989), no., 117–137. Lovász, Lásló. Self-dual polytopes and the chromatic number of distance graphs on the sphere. Acta Sci. Math. (Szeged) 45 (1983), no. 1-4, 31...

work page 2004
[4]

Skeletal rigidity of simplicial complexes

Tay, Tiong-Seng; White, Neil; Whiteley, Walter. Skeletal rigidity of simplicial complexes. I. European J. Combin. 16 (1995), no. 4, 381–403. Whiteley, Walter. Infinitesimally rigid polyhedra I. Statics of Frameworks. Trans. Am. Math. Soc. 285, 431-465 (1984). Ziegler, Günter M. Convex polytopes: extremal constructions and f -vector shapes. Geometric combi...

work page 1995

[1] [1]

The extended 𝑓-vectors of 4-polytopes

Bayer, Margaret. The extended 𝑓-vectors of 4-polytopes. J. Combin. Theory Ser. A 44 (1987), no. 1, 141–151. Kalai, Gil. Rigidity and the lower bound theorem I, Invent. Math. 88 (1987), 125–

work page 1987

[2] [2]

Some aspects of the combinatorial theory of convex polytopes

Kalai, Gil. Some aspects of the combinatorial theory of convex polytopes. Polytopes: abstract, convex and computational (Scarborough, ON, 1993), 205 –229, NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., 440, Kluwer, Dordrecht,

work page 1993

[3] [3]

Hard Lefschetz theorem for nonrational polytopes

Karu, Kalle. Hard Lefschetz theorem for nonrational polytopes. Invent. Math. 157 (2004), no. 2, 419–447. Katz, Mikhail. Diameter-extremal subsets of spheres, Discrete & Computational Geometry 4 (1989), no., 117–137. Lovász, Lásló. Self-dual polytopes and the chromatic number of distance graphs on the sphere. Acta Sci. Math. (Szeged) 45 (1983), no. 1-4, 31...

work page 2004

[4] [4]

Skeletal rigidity of simplicial complexes

Tay, Tiong-Seng; White, Neil; Whiteley, Walter. Skeletal rigidity of simplicial complexes. I. European J. Combin. 16 (1995), no. 4, 381–403. Whiteley, Walter. Infinitesimally rigid polyhedra I. Statics of Frameworks. Trans. Am. Math. Soc. 285, 431-465 (1984). Ziegler, Günter M. Convex polytopes: extremal constructions and f -vector shapes. Geometric combi...

work page 1995