On $k$-antichains in the unit $n$-cube

Christos Pelekis; V\'aclav Vlas\'ak

REVIEW 1 major objections 5 minor 20 references

On $k$-antichains in the unit $n$-cube

T0 review · 1 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every k-antichain in the unit n-cube has (n−1)-dimensional Hausdorff measure at most kn, and the bound is attained exactly in the plane.

desk verdict Solid short paper: the n=2 equality construction is genuinely new, the upper bound is a clean corollary, and the only real gap is the unproved asymptotic-sharpness remark. read the letter →

arxiv 1908.04727 v1 pith:4AF6KGF2 submitted 2019-08-13 math.CA math.CO

Christos Pelekis , Václav Vlasák This is my paper · ORCID

classification math.CAmath.CO MSC 05D0528A7805C3526A30

keywords k-antichainsHausdorffmeasureunitn-cubesingularfunctionErdősk-Spernertheoremantichaincontinuousanalogueextremalsettheory

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper proves a continuous analogue of Erdős's k-Sperner theorem: any $k$-antichain $A$ in the unit $n$-cube $[0,1]^n$ satisfies $H^{n-1}(A) \le kn$. The proof peels a $k$-antichain into $k$ antichains and applies the known antichain bound $H^{n-1} \le n$ to each layer. In the plane the bound is attained exactly: the authors build a $k$-antichain as a union of $k$ disjoint singular-function graphs, each of length 2, so $H^1(A)=2k$. The authors conjecture equality holds in every dimension and leave the case $n \ge 3$ open.

What carries the argument

The proof runs on three objects. First, the antichain bound $H^{n-1}(A)\le n$ (Theorem 1.2) supplies the base case and the per-layer estimate. Second, the peeling argument shows every $k$-antichain decomposes into $k$ antichains by repeatedly discarding minimal elements; this reduces the $k$-antichain problem to the antichain problem. Third, the singular-function graph is the tool that realizes equality: a strictly decreasing function $f$ whose derivative is zero almost everywhere has a graph of length $1+1=2$ in the unit square, and Lemma 2.1 arranges such a graph between any two bounding strictly decreasing bijections. Theorem 1.6 stacks $k$ such graphs between $2k$ ordered bijections, yielding a $k$-antichain of total length $2k$.

What would settle it

Construct a $k$-antichain in $[0,1]^3$ and compute its 2-dimensional Hausdorff measure; if it exceeds $3k$, Theorem 1.5 is false. A simpler check for the sharpness claim: for the pair $g(x)=1-x$, $h(x)=1-x^2$, approximate the graph $D$ produced by Lemma 2.1 by polygonal arcs and sum their lengths; the lemma predicts a limit of exactly 2, so any limit different from 2 would expose an error in the equality construction.

Watch

Extended reading notes

Core claim

The central claim is that for every $k$-antichain $A \subset [0,1]^n$, $H^{n-1}(A) \le kn$, and that this bound is asymptotically sharp; for $n=2$, equality is achieved. The upper bound follows by induction: taking $B$ to be the minimal elements of $A$, $B$ is an antichain and $A\setminus B$ is a $(k-1)$-antichain, so $A$ is a union of $k$ antichains; Theorem 1.2 gives each antichain measure at most $n$. The equality construction for $n=2$ pairs $2k$ strictly decreasing continuous bijections $f_1>f_2>\cdots>f_{2k}$ and, using singular functions, inserts between each pair $f_{2i-1}, f_{2i}$ a strictly decreasing graph $D_i$ with $H^1(\mathrm{Gr}(D_i))=2$; the union $A=\cup_i \mathrm{Gr}(D_i)$ is a $k$-antichain with $H^1(A)=2k$.

Load-bearing premise

The upper bound assumes the known antichain theorem $H^{n-1}(A)\le n$ applies to every antichain in the unit cube, including the irregular antichains obtained by repeatedly peeling minimal elements from an arbitrary $k$-antichain; the paper does not state or verify any measurability or regularity hypothesis that this application might require.

Editorial extensions

If this is right

Every $k$-antichain in $[0,1]^n$ has Hausdorff dimension at most $n-1$, since its $(n-1)$-dimensional Hausdorff measure is finite and bounded by $kn$.
The $kn$ bound is asymptotically sharp in every dimension: there are $k$-antichains whose $(n-1)$-dimensional Hausdorff measure is arbitrarily close to $kn$.
In the plane the bound is attained exactly: there exists a $k$-antichain $A\subset[0,1]^2$ with $H^1(A)=2k$.
The proof reduces the $k$-antichain problem to the antichain case, so any improvement or sharpening of the antichain bound would transfer directly to $k$-antichains.
The conjecture that equality $H^{n-1}(A)=kn$ is attainable for all $n\ge3$ remains open; the paper settles only $n=2$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The linear dependence on $k$ in the continuous bound $kn$ stands in contrast to the discrete Erdős theorem, where the extremal size is a sum of $k$ middle binomial coefficients; the continuous analogue loses the binomial profile and treats each layer identically.
The equality construction for $n=2$ is made of singular-function graphs, so if the conjecture for $n\ge3$ is true, extremal $k$-antichains are likely to be singular or fractal hypersurfaces rather than smooth boundaries; this points toward constructing analogues of the singular graph in higher dimensions.
The paper states asymptotic sharpness in all dimensions without a full proof, referring only to an argument similar to the one after Theorem 1.2; a complete proof would need to exhibit approximating $k$-antichains explicitly and check that no chain meets them more than $k$ times.
If Theorem 1.2 carries hidden regularity conditions on antichains, the peeling argument would inherit them; the authors state no such conditions, so the upper bound is only as unconditional as the antichain theorem it imports.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Quick read on Pelekis–Vlasák, arXiv:1908.04727. The paper's real content is Lemma 2.1 and the n=2 equality construction; Theorem 1.5 is a clean but easy consequence of Engel et al.'s antichain bound. The induction peeling off minimal elements is valid, and the gluing of singular functions in Lemma 2.1 checks out: the telescoping sums give H^1=2, and the function is well-defined because the two sequences meet at 1/2 with matching values. I don't see a hidden measurability trap in importing Theorem 1.2; Hausdorff outer measure doesn't care, and the chain intersection is finite by the k-antichain condition, so the minimal-element step is legitimate.

The soft spots are real but minor. The abstract claims kn is asymptotically sharp for general k, but the proof just says 'similarly' and gives no construction. The stress-test note supplies the obvious homothetic-copy argument, so this is an exposition gap, not a correctness risk. Also, the paper does not resolve equality for n≥3, which it clearly states. The alternative direction in [16] is duly noted, and the connection to Problem 3.1 is honest.

Who is this for? People working in continuous analogues of Sperner theory. The upper bound is a one-line corollary for someone who knows [7], but the equality case n=2 is genuinely new and the lemma is a useful tool. The paper is short, readable, and the citation pattern is appropriate. I'd send it to a referee; it deserves a careful look, and the only required fix is to write out the sharpness construction for k>1.

Referee Report

1 major / 5 minor

Summary. The paper studies k-antichains in the unit n-cube, i.e. sets A such that every chain meets A in at most k points. Its main results are Theorem 1.5, which gives the upper bound H^{n-1}(A) ≤ kn for every k-antichain A in [0,1]^n, and Theorem 1.6, which constructs, for n=2, a k-antichain with H^1(A)=2k. The upper bound is proved by peeling off minimal elements to partition A into k antichains and then applying the n=1 theorem of Engel et al. The n=2 construction uses a lemma that inserts a strictly decreasing singular graph of Hausdorff measure 2 into any strip between two strictly decreasing bijections, and stacks k such graphs. The paper also asserts that kn is asymptotically sharp and conjectures that equality is attainable in all dimensions.

Significance. If the results are correct, they provide a sharp continuous analogue of Erdős's k-Sperner theorem, with the simple constant kn, exact equality in dimension 2, and asymptotic equality in all dimensions. The upper-bound proof is elegant and checkable, and the singular-function construction in Lemma 2.1 is explicit: the gluing argument is coherent and the telescoping sum correctly yields measure 2. The proofs do not rely on fitted parameters or circular definitions. The only substantive gap is the unproved asymptotic-sharpness remark, which is local and can be supplied by a short construction.

major comments (1)

[§1 (remark after Theorem 1.5)] The sentence claiming that the bound kn is asymptotically sharp is stated without proof, even though the abstract advertises this as part of the paper's contribution. Please add a proof. A valid construction is A = ⋃_{j=1}^k {x∈[0,1]^n : ‖x‖_p = r_j} with 0<r_1<...<r_k≤1 chosen close to 1 and p large; each ℓ_p-sphere is an antichain, the union is a k-antichain, and H^{n-1}(A) tends to kn as p→∞ and r_j→1. This gap is local and does not affect the validity of Theorems 1.5 or 1.6.

minor comments (5)

[§2, proof of Theorem 1.5] Please justify explicitly that every nonempty subset of a k-antichain has a minimal element (otherwise it would contain an infinite descending chain); this is used both for the nonemptiness of B and for the choice of y. It would also help to spell out why the set D is a chain, namely that minimality of y in (A\B)∩C forces all other points of that set to lie above y.
[§2, Lemma 2.1] The construction of the sequence {y_n} and the proof that its limit is 1 are omitted with 'similarly'; the details are indeed analogous, but a brief indication of the symmetric inequalities would improve readability.
[§1, Theorem 1.2] Since Theorem 1.5 imports Theorem 1.2 from [7], it would be helpful to state explicitly that the cited result applies to arbitrary, not necessarily measurable, antichains, or to add a measurability hypothesis to the statement if one is needed.
[§2, proof of Theorem 1.6] In the final display, H1(Gr(Di) is missing a closing parenthesis; it should read H1(Gr(D_i)).
[References] Reference [3] contains a typo: 'Hausdroff' should be 'Hausdorff'.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the k-antichain upper bound is a genuine induction over the independent antichain bound, and the n=2 equality construction is self-contained.

full rationale

Theorem 1.5 does not assume its own conclusion. The proof peels off the set B of minimal elements of A, observes that B is an antichain and that A\B is a (k-1)-antichain, then inducts; subadditivity plus Theorem 1.2 gives H^{n-1}(A)≤kn. Theorem 1.2 is exactly the k=1 case, imported from an external paper [7] that shares an author, but it is a parameter-free theorem for antichains and is not derived from the k-antichain bound. Using it as the base case is standard mathematical practice, not a circular reduction: for k>1, the proof adds a nontrivial partition argument, and the imported theorem's assumption (antichain) is weaker than the target condition. Lemma 2.1 constructs a decreasing graph of H^1-measure 2 inside any strip by gluing singular-function graphs and applying the folklore Theorem 1.4; no fitted parameter or self-referential benchmark enters. Theorem 1.6 then places k disjoint such graphs between ordered decreasing bijections, yielding a k-antichain with H^1=2k independently of the upper-bound argument. The only gap is the unproved assertion that kn is asymptotically sharp, stated without a construction; since a straightforward scaling/strip argument supplies it, this is an exposition gap, not circularity. No step in the derivation is equivalent by definition to its input.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No fitted parameters appear: the numbers n and k are fixed by the problem, and the functions f_i in Theorem 1.6 are chosen to be ordered but not tuned to data. The central claim rests on the external theorems listed as axioms.

assumptions (5)

domain assumption Theorem 1.2 from [7] (Engel, Mitsis, Pelekis, Reiher): every antichain A in [0,1]^n satisfies H^{n-1}(A) <= n.
Imported as the base case k=1 in the induction for Theorem 1.5; not proved in this paper. One author overlaps with the current paper, but the result is published externally.
standard math Theorem 1.4 (folklore): if f : [a,b] -> [c,d] is strictly decreasing and singular, then H^1(Graph(f)) = (b-a)+(d-c).
Used in Lemma 2.1 to give each piece d_{x,n} and d_{y,n} a graph of prescribed length. Cited to [10] and [18].
standard math Strictly decreasing singular functions exist on arbitrary intervals [a,b] with prescribed decreasing endpoint values.
Needed for the pieces d_{x,n} and d_{y,n}; a standard construction via Cantor-type functions, cited through [18].
standard math Hausdorff measure is countably subadditive and countably additive on disjoint Borel sets; H^0 is counting measure.
Used to sum H^1 over the disjoint graphs in Lemma 2.1 and to bound a union of antichains in Theorem 1.5; from [9].
standard math Boundary (n-1)-measure is continuous under Hausdorff convergence for convex bodies, giving H^{n-1}(partial B_p) -> n as p -> infinity.
Used in the asymptotic sharpness remark for the k=1 construction of l_p boundaries; cited to [19, p.219].

how reviews work

0 comments

Cite this review

Pith. "Pith review of On $k$-antichains in the unit $n$-cube." pith.science (2026). https://pith.science/paper/4AF6KGF2

@misc{pith2026190804727,
  author       = {Pith},
  title        = {Pith review of: On $k$-antichains in the unit $n$-cube},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4AF6KGF2}},
  note         = {Machine review of arXiv:1908.04727}
}

abstract

A \emph{chain} in the unit $n$-cube is a set $C\subset [0,1]^n$ such that for every $\mathbf{x}=(x_1,\ldots,x_n)$ and $\mathbf{y}=(y_1,\ldots,y_n)$ in $C$ we either have $x_i\le y_i$ for all $i\in [n]$, or $x_i\ge y_i$ for all $i\in [n]$. We consider subsets, $A$, of the unit $n$-cube $[0,1]^n$ that satisfy \[ \text{card}(A \cap C) \le k, \, \text{ for all chains } \, C \subset [0,1]^n \, , \] where $k$ is a fixed positive integer. We refer to such a set $A$ as a $k$-antichain. We show that the $(n-1)$-dimensional Hausdorff measure of a $k$-antichain in $[0,1]^n$ is at most $kn$ and that the bound is asymptotically sharp. Moreover, we conjecture that there exist $k$-antichains in $[0,1]^n$ whose $(n-1)$-dimensional Hausdorff measure equals $kn$ and we verify the validity of this conjecture when $n=2$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

[16]

A continuous analogue of Erd\H{o}s' $k$-Sperner theorem

T. Mitsis, C. Pelekis, V . Vlas´ ak, A continuous analogue of Erd˝ os’k-Sperner theorem, (2019), arXiv:1904.09625

work page Pith review arXiv 2019
[7]

Projection inequalities for antichains

K. Engel, T. Mitsis, C. Pelekis, C. Reiher, Projection ineq ualities for antichains, to appear in Israel J. Math., arXiv:1812.06496

work page Pith review arXiv
[1]

Anderson, Combinatorics of ﬁnite sets

I. Anderson, Combinatorics of ﬁnite sets . Corrected reprint of the 1989 edition. Dover Publications, Inc., Mineola, NY , 2002. xvi+250 pp

work page 1989
[2]

Blokhuis, A.E

A. Blokhuis, A.E. Brouwer, A. Chowdhury , P . Frankl, T. Mus sche, B. Patk ´ os, T. Sz˝ onyi, A Hilton-Milner theorem for vector spaces, Electron. J. Combin. 17 (2010), no. 1, Research Paper 71, 12 pp

work page 2010
[3]

The de Bruijn-Erd\H{o}s theorem from a Hausdorff measure point of view

M. Dole ˇzal, T. Mitsis, C. Pelekis, The de Bruijn-Erd˝ os theorem froma Hausdroff mea- sure point of view, to appear in Acta Math. Hungarica, arXiv:1805.10980

work page Pith review arXiv
[4]

Engel, A continuous version of a Sperner-type theorem, Elektron

K. Engel, A continuous version of a Sperner-type theorem, Elektron. Informationsver- arb. Kybernet. 22 (1986), no. 1, 45–50

work page 1986
[5]

Engel, Sperner Theory, Encyclopedia of Mathematics and its Applications, 65

K. Engel, Sperner Theory, Encyclopedia of Mathematics and its Applications, 65. Cam- bridge University Press, Cambridge, 1997. x+417 pp

work page 1997
[6]

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$-cube

K. Engel, T. Mitsis, C. Pelekis, A fractal perspective on op timal antichains and inter- secting subsets of the unit n-cube, (2017), arXiv:1707.04856

work page Pith review arXiv 2017

Show all 20 references

[8]

Erd˝ os, On a lemma of Littlewood and Offord, Bull

P . Erd˝ os, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945) 898– 902

1945
[9]

Evans, R.F

L.C. Evans, R.F. Gariepy , Measure Theory and Fine Properties of Functions , CRC Press, Revised Edition, 2015

2015
[10]

Foran, The Length of the Graph of a One to One Function f rom [0, 1] to [0, 1], Real Anal

J. Foran, The Length of the Graph of a One to One Function f rom [0, 1] to [0, 1], Real Anal. Exchange 25 (1999/00), no. 2, 809–816

1999
[11]

Frankl, R.M

P . Frankl, R.M. Wilson, The Erd˝ os-Ko-Rado theorem for vector spaces, J. Combin. The- ory Ser. A 43 (1986), no. 2, 228–236

1986
[12]

Katona, Continuous versions of some extremal hyp ergraph problems, Com- binatorics (Proc

G.O.H. Katona, Continuous versions of some extremal hyp ergraph problems, Com- binatorics (Proc. Fifth Hungarian Colloq., Keszthely , 1976 ), V ol. II, pp. 653–678, Col- loq. Math. Soc. Jnos Bolyai , 18, North-Holland, Amsterdam-New York, 1978

1976
[13]

Katona, Continuous versions of some extremal hyp ergraph problems II, Acta Math

G.O.H. Katona, Continuous versions of some extremal hyp ergraph problems II, Acta Math. Acad. Sci. Hungar. 35 (1980), no. 1-2, 67–77

1980
[14]

Klain, G.C

D.A. Klain, G.C. Rota, A continuous analogue of Sperner’ s theorem, Comm. Pure Appl. Math. 50 (1997), no. 3, 205–223. 8

1997
[15]

Katchalski, R

M. Katchalski, R. Meshulam, An extremal problem for famili es of pairs of subspaces, European J. Combin. 15 (1994), no. 3, 253–257

1994
[17]

C. St.-J. A. Nash-Williams, Unexplored and semi-explo red territories in graph theory , New directions in graph theory (ed. F. Harary , Academic Press, 1973), pp. 149-186

1973
[18]

Saks, Theory of the Integral , Dover Publications, 1964

S. Saks, Theory of the Integral , Dover Publications, 1964

1964
[19]

Schneider, Convex bodies: the Brunn-Minkowski theory , Second expanded edition, Encyclopedia of Mathematics and its Applications, vol

R. Schneider, Convex bodies: the Brunn-Minkowski theory , Second expanded edition, Encyclopedia of Mathematics and its Applications, vol. 151, Cambridge University Press, 2014

2014
[20]

Sperner, Ein Satz ¨ uber Untermengen einer endlichen Menge, Math

E. Sperner, Ein Satz ¨ uber Untermengen einer endlichen Menge, Math. Z. 27 (1928) 544-548. 9

1928

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [16]

A continuous analogue of Erd\H{o}s' $k$-Sperner theorem

T. Mitsis, C. Pelekis, V . Vlas´ ak, A continuous analogue of Erd˝ os’k-Sperner theorem, (2019), arXiv:1904.09625

work page Pith review arXiv 2019

[2] [7]

Projection inequalities for antichains

K. Engel, T. Mitsis, C. Pelekis, C. Reiher, Projection ineq ualities for antichains, to appear in Israel J. Math., arXiv:1812.06496

work page Pith review arXiv

[3] [1]

Anderson, Combinatorics of ﬁnite sets

I. Anderson, Combinatorics of ﬁnite sets . Corrected reprint of the 1989 edition. Dover Publications, Inc., Mineola, NY , 2002. xvi+250 pp

work page 1989

[4] [2]

Blokhuis, A.E

A. Blokhuis, A.E. Brouwer, A. Chowdhury , P . Frankl, T. Mus sche, B. Patk ´ os, T. Sz˝ onyi, A Hilton-Milner theorem for vector spaces, Electron. J. Combin. 17 (2010), no. 1, Research Paper 71, 12 pp

work page 2010

[5] [3]

The de Bruijn-Erd\H{o}s theorem from a Hausdorff measure point of view

M. Dole ˇzal, T. Mitsis, C. Pelekis, The de Bruijn-Erd˝ os theorem froma Hausdroff mea- sure point of view, to appear in Acta Math. Hungarica, arXiv:1805.10980

work page Pith review arXiv

[6] [4]

Engel, A continuous version of a Sperner-type theorem, Elektron

K. Engel, A continuous version of a Sperner-type theorem, Elektron. Informationsver- arb. Kybernet. 22 (1986), no. 1, 45–50

work page 1986

[7] [5]

Engel, Sperner Theory, Encyclopedia of Mathematics and its Applications, 65

K. Engel, Sperner Theory, Encyclopedia of Mathematics and its Applications, 65. Cam- bridge University Press, Cambridge, 1997. x+417 pp

work page 1997

[8] [6]

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$-cube

K. Engel, T. Mitsis, C. Pelekis, A fractal perspective on op timal antichains and inter- secting subsets of the unit n-cube, (2017), arXiv:1707.04856

work page Pith review arXiv 2017