Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Averages of hypergraphs and higher arity stability

T0 review · 4 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read Functions that measure intersections of set families satisfy a strong hypergraph regularity lemma, and the two known counterexamples to ternary stability share a hidden regularity that blocks excluded-substructure characterizations.

desk verdict A real result and a real gap: the advertised strong regularity theorem is only sketched, and the F(b) error bound does not follow from the cited lemma; still deserves peer review. read the letter →

arxiv 2508.05839 v1 pith:TR5BOXL3 submitted 2025-08-07 math.CO math.LOmath.PR

Artem Chernikov , Henry Towsner This is my paper
classification math.COmath.LOmath.PR MSC 05C6503C4505D10
keywords hypergraphregularityhigheraritystabilitystrong2-stabilityaveragesofhypergraphsperfectlemmamonotonehalf-simplexGS3
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

Functions such as $f(x,y,z)=\mu(P_{x,y}\cap Q_{x,z}\cap R_{y,z})$ — measures of intersections of families of measurable sets indexed by overlapping coordinates — are not arbitrary high-arity functions: the paper proves they satisfy a very strong hypergraph regularity lemma. The partition of each $d$-fold product can be chosen so that every cylinder intersection set, outside a set of density controlled by an arbitrary prescribed $F(b)$, is nearly constant. The proof views these functions as averages of hypergraphs over a probability space and applies hypergraph regularity to auxiliary $(d+1)$-uniform hypergraphs. The second part shows that the two known sources of failure of ternary stability — the half-simplex and $GS_3$ — cannot jointly exclude anything: every finite 3-hypergraph that embeds into both still satisfies perfect 2-stable regularity. Hence strong 2-stability cannot be characterized simply by forbidden induced subhypergraphs.

What carries the argument

The key objects are the auxiliary $(d+1)$-uniform hypergraphs $P^e=\{(x_e,z): z\in P^e_{x_e}\}$ on $(\prod_{i\in e} X_i)\times\Omega$. For Theorem 2.1, the paper applies the hypergraph regularity lemma to each $P^e$, intersects the resulting regular partitions to form 'cells', 'faces' and 'bases', and then uses quasi-randomness of the $P^e$ on faces to show, by successive slicing over an ordering of the $d$-subsets, that the intersection-measure function is approximated by a product of face densities, uniformly in most points. For Theorem 3.9, the machinery is a direct partition construction on pairs of coordinates using the monotone order inherited from the half-simplex embedding: it isolat

What would settle it

A direct refutation would exhibit $k=3,d=2$, some $\varepsilon>0$ and $F:\mathbb{N}\to(0,1]$, and families $P_{x,y},Q_{x,z},R_{y,z}$ of measurable sets such that for every $N$ there is some finite $X,Y,Z$ and $\Omega$ with no partitions of the three pair-products into $\le N$ parts having exceptional density $<\varepsilon$, and cylinder intersections on which $f=\mu(P\cap Q\cap R)$ varies by more than $\varepsilon$ outside any set of density $<F(b)$. For Theorem 3.9, a refutation would be one sequence of finite 3-partite 3-hypergraphs, each an induced subhypergraph of both $GS_3$ and the half-

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is Theorem 2.1: for any $1\le d<k$, $\varepsilon>0$ and $F:\mathbb{N}\to(0,1]$, there is $N(d,k,\varepsilon,F)$ such that every function $f(x_1,\dots,x_k)=\mu\left(\bigcap_{e\in\binom{[k]}{d}} P^e_{x_e}\right)$ admits partitions $\bigsqcup_{i\le b_e} S_{e,i}$ of each $\prod_{i\in e} X_i$ with $b_e\le N$, exceptional part of density $<\varepsilon$, and on every cylinder intersection $\bigcap_e S_{e,j_e}$ with each $j_e>0$, $f$ is contained in an interval of length $<\varepsilon$ except on a set of density $<F(\max_e b_e)$. Corollary 2.2 extends the same conclusion to $f(\vec x)=\int h\left((f^e_{\vec x_e}(z))_{e}\right)d\mu(z)$ for continuous $h

Load-bearing premise

The proof of Theorem 2.1 applies hypergraph regularity to a $(d+1)$-uniform hypergraph whose last vertex set is an arbitrary probability space $\Omega$, which may be infinite, while the cited regularity lemmas are stated for finite hypergraphs; the paper does not prove the needed infinite-vertex version with the stated error bounds.

Editorial extensions

If this is right

  • Every function of the form $f(x_1,\dots,x_k)=\mu\left(\bigcap_e P^e_{x_e}\right)$ satisfies strong $d$-stable regularity: partitions of bounded size, small exceptional part, and near-constancy up to a density-$F(b)$ error.
  • The same conclusion holds for integrals $\int h\left((f^e_{\vec x_e}(z))_e\right)d\mu(z)$ with $h$ continuous, so the class of well-behaved functions is closed under continuous combinations of smaller-arity measurable functions.
  • Every finite 3-hypergraph that embeds into both $GS_3$ and the half-simplex has perfect 2-stable regularity, hence strong 2-stable regularity.
  • Strong 2-stability is not characterized by a single excluded finite induced subhypergraph, partially addressing a conjecture in the literature on ternary stability.
  • The functions considered in Theorem 2.1 are $NFOP_k$ and $NOP_2$ (for $k=3,d=2$) but are not slice-wise NIP, so they occupy an intermediate position in the higher-arity tameness hierarchy.

Reading between the lines

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

  • Inference: If the infinite-$\Omega$ step can be supplied, the same strong regularity should hold uniformly for definable families in arbitrary probability algebras, giving a model-theoretic 'perfect regularity' companion for higher arities analogous to stable graph regularity.
  • Inference: The partition built in Theorem 3.9 is constructive and does not pass through a combinatorial characterization of strong 2-stability; this suggests that the right 'forbidden configuration' picture for strong $k$-stability may involve ordered or continuous configurations rather than finite hypergraphs.
  • Inference: The $R$/$sR$ rectangle decomposition used in the proof may yield explicit bounds on the number of parts that are far smaller than iterated hypergraph regularity; this quantitative question is not addressed in the paper.
  • Inference: Because the parity example in Remark 3.5 shows that $NFOP_k$ functions can lack slice-wise NIP, the hierarchy of higher-arity tameness notions branches; one testable extension is whether the half-simplex/$GS_3$ common class is exactly the class of functions with perfect 2-stable regularity, which the paper leaves open.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 5 minor

Summary. The paper studies a higher-arity analogue of the stable regularity lemma for functions defined as measures of intersections of families of measurable sets, e.g. f(x,y,z)=μ(P_{x,y}∩Q_{x,z}∩R_{y,z}). Theorem 2.1 claims a strong hypergraph regularity statement: for every ε>0 and every function F:N→(0,1], there is N such that for any finite sets X_i and any probability space Ω, one can partition each d-fold product into at most N parts so that on every nonexceptional cylinder intersection the function is ε-constant outside a set of density < F(max b_e). Corollary 2.2 extends this to integrals of continuous combinations of arbitrary measurable functions. The second part of the paper addresses higher-arity model-theoretic stability. After relating perfect d-stable regularity to strong d-stable regularity (Prop. 3.2) and to Terry–Wolf's binary disc_{2,3} error (Prop. 3.3), the authors prove Theorem 3.9: every finite 3-hypergraph embedding both into the half-simplex and into GS_3 satisfies perfect 2-stable regularity. Hence strong ternary stability cannot be characterized by a single excluded family of hypergraphs.

Significance. If the results hold, they are significant. Theorem 2.1 would give a regularity lemma far stronger than ordinary hypergraph regularity for a natural class of 'average hypergraph' functions, and Corollary 2.2 would make the statement quite robust. The second part addresses an explicit open question from Terry and Wolf about strong 2-stability; Theorem 3.9 is a substantial direct construction using monotonicity and the GS_3 structure, rather than a routine adaptation of known machinery. The paper also makes a useful conceptual contribution by separating perfect, strong, and ordinary regularities in higher arity. However, the proof of the main finitary theorem is not complete in its current form, and one auxiliary lemma used in Corollary 2.2 is only proved in a special case. The paper is well organized and clearly written in its broad lines, but the missing technical steps are load-bearing.

major comments (4)
  1. [Section 2, proof of Theorem 2.1] The asserted dependence on F is not established. The proof applies hypergraph regularity once, obtaining partitions of size b_e ≤ B(ε') and an error η(ε') that is a power of ε'. In standard hypergraph regularity, B(ε') is at least an iterated exponential in 1/ε'. The averaging argument in the proof can at best show that on each cylinder C the bad set has density O(η(ε')). The theorem requires this density to be < F(max_e b_e) for an arbitrary prescribed F. For example, for F(n)=2^{-n}, the requirement is η(ε') < 2^{-B(ε')}, which cannot be satisfied by any power of ε' as ε'→0. The phrase 'with suitable parameters ε'≪ε and F'≪F' is not justified: the cited finite hypergraph regularity lemmas have no functional parameter F'. No iterative refinement step is supplied. This is not a minor bookkeeping gap; the size-dependence of the error is exactly the 'strong' part of the theorem. The proof
  2. [Section 2, proof of Theorem 2.1, definition of P^e] The proof applies hypergraph regularity to the (d+1)-uniform hypergraph P^e with vertex set (∏_{i∈e} X_i) × Ω, where Ω is an arbitrary probability space, possibly infinite. The cited regularity lemmas ([RS04], [Gow07], [Tao06]) are for finite hypergraphs. Since the X_i are finite, the family {P^e_x} is finite for each e, so one can reduce Ω to the finite Boolean algebra generated by these sets before invoking the finite regularity lemma. But this reduction is not stated, and without it the claimed application of the finite hypergraph regularity lemma is not justified. This issue is fixable, but it is a genuine missing step in the current proof.
  3. [Corollary 2.2 and Remark 3.4] Corollary 2.2 says that a common refinement of the partitions obtained from Theorem 2.1 is taken 'using Remark 3.4'. However, Remark 3.4 is proved only in the setting of 3-partite 3-hypergraphs with d=1: its proof uses pair sets {u,v}, vertex partitions, and graph regularity. The statement of Remark 3.4 for general d and k is not proved, and it is not a formal consequence of Theorem 2.1 alone. The common refinement of finitely many partitions requires a lower bound on the ratio μ(C)/μ(C_r) for sub-cylinders; without a general form of Remark 3.4, the error bounds F'(b_r)|C_r| do not transfer to the refined cylinder with the desired F(B). Thus Corollary 2.2 currently rests on an unproved generalization.
  4. [Section 3.2, Definition 3.13 and Claim 4] The construction of R^{u,v} says we 'add sR sets to R^{u,v} by induction on length n∈N∗'. Since N∗ is a nonprincipal ultrapower of N, it is not well-ordered, so this is not a legitimate external induction principle. If the intended meaning is that the selected sR sets are those minimal under containment, the text should say so and prove that a minimal element exists for every sR set, or explain why chains without minimal elements are covered by the later L sets. Claim 4 proves pairwise disjointness of the selected sets, but it does not address the existence of selected minimal elements in descending chains. This is a load-bearing point in the construction of the partitions P^{u,v} for Theorem 3.9.
minor comments (5)
  1. [Theorem 2.1 statement] The notation 'For every 1≤d<k∈N' is nonstandard; it should be written as 'For every k∈N and every 1≤d<k'.
  2. [Section 2, proof of Theorem 2.1] The symbol μ is used both for the probability measure on Ω and for the normalized counting measure on products of the finite sets X_i. This overload is confusing, especially in the displayed equations involving μ(C^e), μ(C_{[k]}), and μ(P^e∩C^e).
  3. [Definition 3.6] The phrase 'For an ordinal κ∈ω∪{ω}' is confusing; presumably the intended set is κ∈ω+1 (all ordinals ≤ω).
  4. [Remark 3.8(3)] The cross-reference 'Claim 3(3a)' should be 'Claim 3(2a)': Claim 3 has parts (1) and (2), with subparts (a)–(c) under (2).
  5. [General] The paper relies heavily on the authors' unpublished preprints [CT20] and [CT24b] for definitions, the graded probability space framework, and Proposition 3.2. This is acceptable, but the dependence should be flagged clearly, and the referee report should note that the current manuscript is not self-contained in these places.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: Theorem 2.1 is proved directly from hypergraph regularity and Theorem 3.9 is a new construction; self-citations are contextual/auxiliary.

full rationale

The paper's central claims do not reduce to their inputs by definition or by fitted parameters. Theorem 2.1 builds partitions of the d-fold products by applying standard hypergraph regularity to the auxiliary (d+1)-uniform hypergraphs P^e and then uses quasi-randomness and a successive 'well-behaved' averaging argument; the conclusion is not assumed in the construction. Corollary 2.2 reduces to Theorem 2.1 by discretizing continuous functions, so it inherits the same status. The proof does contain an unsubstantiated step: it says 'we apply hypergraph regularity with suitable parameters ε'≪ε and F'≪F' (Section 2, proof of Theorem 2.1), but the cited finite hypergraph regularity lemmas do not accept an arbitrary prescribed error function F; they supply a fixed error η(ε') while the partition size grows tower-fast in 1/ε'. This is a genuine correctness/technical gap about whether the strong F(b) bound follows, but it is not a circularity: the theorem's conclusion is not used as an input, and no parameter is fitted to the target statement. In Section 3, perfect and strong d-stable regularity are defined as distinct properties (Definition 3.1), and Proposition 3.2 proves an implication from perfect to strong with a sketched ultraproduct argument, citing [CT24b] for the base case d=1; this is a self-citation but the implication is not assumed and the central new content of Theorem 3.9 is a detailed, self-contained partition construction using monotonicity and the GS3 structure. The use of [CT20] and [CT24b] for graded probability spaces is contextual background, not load-bearing circularity. There are no fitted inputs renamed as predictions, no excluded-substructure uniqueness theorem imported from the authors' own work, and no renaming of a known result as a new one. Thus the circularity score is low; the flagged proof gap is a correctness risk, not a circular-step risk.

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

The central results rest on standard hypergraph regularity and counting lemmas, the framework of graded probability spaces from the authors' earlier work, and the monotone structure inherited from the half-simplex. No free parameters are fitted to data, and no new mathematical entities are introduced. The most fragile assumption is the unstated extension of hypergraph regularity to infinite measurable hypergraphs.

assumptions (5)
  • standard math Hypergraph regularity lemma for (d+1)-uniform hypergraphs.
    Invoked in the proof of Theorem 2.1 to obtain partitions of the hypergraphs P^e. Cited results include [NRS06, RS04, Gow07, Tao06].
  • standard math Hypergraph counting lemma for regular hypergraphs.
    Used inside the proof of Theorem 2.1 to approximate densities on faces and cells by the densities of the regular partitions. Standard consequence of hypergraph regularity.
  • domain assumption The hypergraph regularity lemma applies to hypergraphs with an infinite measurable vertex set Omega, or can be obtained by a finite approximation argument.
    The proof applies regularity to P^e with X_{k+1}=Omega, an arbitrary probability space. No measure-theoretic version is stated or proved; the paper merely says 'we apply hypergraph regularity'. This is a load-bearing gap.
  • standard math Ultraproduct construction and Los's theorem for graded probability spaces.
    Used in Section 3.1 to pass from finite functions to measurable functions on ultraproducts. References [CT20, Sections 2.2 and 9.3].
  • domain assumption Monotonicity of the edge relation inherited from the half-simplex embedding.
    Definition 3.7 and Remark 3.8 establish that induced subhypergraphs of the half-simplex are monotone. This monotonicity is used throughout Theorem 3.9, especially in Claim 3.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Averages of hypergraphs and higher arity stability." pith.science (2026). https://pith.science/paper/TR5BOXL3

@misc{pith2026250805839,
  author       = {Pith},
  title        = {Pith review of: Averages of hypergraphs and higher arity stability},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TR5BOXL3}},
  note         = {Machine review of arXiv:2508.05839}
}
abstract

We show that $k$-ary functions giving the measure of the intersection of multi-parametric families of sets in probability spaces, e.g. $(x,y,z) \in X \times Y \times Z \mapsto \mu(P_{x,y} \cap Q_{x,z} \cap R_{y,z})$, satisfy a particularly strong form of hypergraph regularity. More generally, this applies to the (integral) averages of continuous combinations of functions of smaller arity. This result is connected to higher arity stability in model theory, that we discuss in the second part of the paper. We demonstrate that all hypergraphs embedding both into the half-simplex and into $GS(\mathbb{F}_3)$, the two known sources of failure of ternary stability, do satisfy an analogous regularity lemma -- hence strong ternary stability cannot be characterized simply by excluded hypergraphs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Homogeneous hypergraph regularity lemmas via $k$-strong honest definitions

    math.LO 2026-07 conditional novelty 6.0 of 10

    (k+1)-uniform hypergraphs definable in NIP strongly k-distal structures admit homogeneous regularity lemmas whose partitions are uniformly definable and polynomially bounded in 1/δ.

Reference graph

Works this paper leans on

26 extracted references · 21 canonical work pages · cited by 1 Pith paper

  1. [1]

    Efficient testing of bipartite graphs for forbidden induced subgraphs

    Noga Alon, Eldar Fischer, and Ilan Newman. Efficient testing of bipartite graphs for forbidden induced subgraphs. SIAM Journal on Computing , 37(3):959--976, 2007

    work page 2007

  2. [2]

    On theories of random variables

    Ita \" Ben Yaacov. On theories of random variables. Israel Journal of Mathematics , 194(2):957--1012, 2013

    work page 2013

  3. [3]

    Model theory for metric structures

    Ita \" Ben Yaacov, Alexander Berenstein, C Ward Henson, and Alexander Usvyatsov. Model theory for metric structures. London Mathematical Society Lecture Note Series , 350:315, 2008

    work page 2008

  4. [4]

    Continuous stable regularity

    Nicolas Chavarria, Gabriel Conant, and Anand Pillay. Continuous stable regularity. Journal of the London Mathematical Society , 109(1):e12822, 2024

    work page 2024

  5. [5]

    Towards higher classification theory

    Artem Chernikov. Towards higher classification theory. In Model Theory: Combinatorics, Groups, Valued Fields and Neostability. Abstracts from the workshop held January 8--14, 2023 , volume 20 of Oberwolfach Workshop Reports , pages 129--134. Mathematisches Forschungsinstitut Oberwolfach, 2023

    work page 2023

  6. [6]

    On n-dependence

    Artem Chernikov, Daniel Palacin, and Kota Takeuchi. On n-dependence. Notre Dame Journal of Formal Logic , 60(2), 2019

    work page 2019

  7. [7]

    Definable regularity lemmas for NIP hypergraphs

    Artem Chernikov and Sergei Starchenko. Definable regularity lemmas for NIP hypergraphs. The Quarterly Journal of Mathematics , 72(4):1401--1433, 2021

    2021

  8. [8]

    Hypergraph regularity and higher arity VC -dimension

    Artem Chernikov and Henry Towsner. Hypergraph regularity and higher arity VC -dimension. Preprint, arXiv:2010.00726 , 2020

    arXiv 2010

Show all 26 references
  1. [9]

    Intersecting sets in probability spaces and Shelah 's classification

    Artem Chernikov and Henry Towsner. Intersecting sets in probability spaces and Shelah 's classification. Preprint, arXiv :2406.18772, 2024

    2024 arXiv

  2. [10]

    Perfect stable regularity lemma and slice-wise stable hypergraphs

    Artem Chernikov and Henry Towsner. Perfect stable regularity lemma and slice-wise stable hypergraphs. Preprint, arXiv:2402.07870 , 2024

    2024 arXiv

  3. [11]

    Extremal problems on set systems

    Peter Frankl and Vojt e ch R \"o dl. Extremal problems on set systems. Random Structures & Algorithms , 20(2):131--164, 2002

    2002

  4. [12]

    Hypergraph regularity and the multidimensional S zemer \'e di theorem

    W Timothy Gowers. Hypergraph regularity and the multidimensional S zemer \'e di theorem. Annals of Mathematics , pages 897--946, 2007

    2007

  5. [13]

    Crit \`e res de compacit \'e dans les espaces fonctionnels g \'e n \'e raux

    Alexandre Grothendieck. Crit \`e res de compacit \'e dans les espaces fonctionnels g \'e n \'e raux. American Journal of Mathematics , pages 168--186, 1952

    1952

  6. [14]

    Stable group theory and approximate subgroups

    Ehud Hrushovski. Stable group theory and approximate subgroups. Journal of the American Mathematical Society , 25(1):189--243, 2012

    2012

  7. [15]

    Approximate equivalence relations

    Ehud Hrushovski. Approximate equivalence relations. Model Theory , 3(2):317--416, 2024

    2024

  8. [16]

    Espaces de B anach stables

    Jean-Louis Krivine and Bernard Maurey. Espaces de B anach stables. Israel Journal of Mathematics , 39(4):273--295, 1981

    1981

  9. [17]

    Regularity lemmas for stable graphs

    Maryanthe Malliaris and Saharon Shelah. Regularity lemmas for stable graphs. Transactions of the American Mathematical Society , 366(3):1551--1585, 2014

    2014

  10. [18]

    The counting lemma for regular k-uniform hypergraphs

    Brendan Nagle, Vojt e ch R \"o dl, and Mathias Schacht. The counting lemma for regular k-uniform hypergraphs. Random Structures & Algorithms , 28(2):113--179, 2006

    2006

  11. [19]

    Remarks on Tao 's algebraic regularity lemma

    Anand Pillay and Sergei Starchenko. Remarks on Tao 's algebraic regularity lemma. Preprint, arXiv :1310.7538, 2013

    2013 arXiv

  12. [20]

    Regularity lemma for k-uniform hypergraphs

    Vojt e ch R \"o dl and Jozef Skokan. Regularity lemma for k-uniform hypergraphs. Random Structures & Algorithms , 25(1):1--42, 2004

    2004

  13. [21]

    On 2-order property

    Kota Takeuchi. On 2-order property. Slides from a talk given at the Asian Logic Conference 2017, Daejeon, Korea , 2017

    2017

  14. [22]

    A variant of the hypergraph removal lemma

    Terence Tao. A variant of the hypergraph removal lemma. Journal of combinatorial theory, Series A , 113(7):1257--1280, 2006

    2006

  15. [23]

    `` A spectral theory proof of the algebraic regularity lemma'', blogpost

    Terrence Tao. `` A spectral theory proof of the algebraic regularity lemma'', blogpost. https://terrytao.wordpress.com/2013/10/29/a-spectral-theory-proof-of-the-algebraic-regularity-lemma/, 2013

    2013

  16. [24]

    Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets

    Terence Tao. Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets. Contrib. Discrete Math. , 10(1):22--98, 2015

    2015

  17. [25]

    Higher-order generalizations of stability and arithmetic regularity

    Caroline Terry and Julia Wolf. Higher-order generalizations of stability and arithmetic regularity. Preprint, arXiv:2111.01739 , 2021

    2021

  18. [26]

    Irregular triads in 3-uniform hypergraphs

    Caroline Terry and Julia Wolf. Irregular triads in 3-uniform hypergraphs. Memoirs of the American Mathematical Society, accepted (arXiv:2111.01737) , 2021

    2021 arXiv

Pith tools

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