Frostman random variables, entropy inequalities, and applications

Abstract

We introduce Frostman conditions for bivariate random variables and study discretized entropy sum-product phenomena in both independent and dependent settings. Fix 0 < s < 1, and let (X,Y) be a bivariate real random variable with bounded support, whose distribution satisfies a Frostman condition of dimension s. Let φ(x,y) be a polynomial obtained from a diagonal polynomial 1(x)+2(y)∈ R[x, y] of degree d 2 by applying a change of variables ∈ GL2(Q) in (x,y). We show that there exists ε = ε(d,,s)>0 such that \[ \Hn(X+Y), Hn(φ(X,Y))\ ≥ n(s+ε) \] for all sufficiently large n, where the precise assumptions on (X,Y) depend on the Frostman level. The proof introduces a novel multi-step entropy framework, combining the state-of-the-art results on the Falconer distance problem, a discretized entropy Balog-Szemer\'edi-Gowers mechanism, and new entropy inequalities adapted to dependent variables, to reduce general polynomials of arbitrary degree to a diagonal quadratic case. As applications, we obtain innovative discretized sum-product type estimates along dense graphs. In particular, for a δ-separated set A⊂eq [0, 1] of cardinality δ-s, satisfying certain non-concentration conditions, and a dense subset G⊂eq A× A, there exists ε=ε(s, φ)>0 such that Eδ(A+GA) + Eδ(φG(A, A)) δ-ε(\#A) for all δ small enough. Here Eδ(A) denotes the δ-covering number of A, A+GA:=\x+y (x, y)∈ G\, and φG(A,A):=\φ(x, y) (x, y)∈ G\.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…