Analysis & PDETheoryActive

Geometric measure theory and incidence geometry

Hausdorff and box dimension, Frostman measures, energies and Fourier dimension, projection theorems, Kakeya and Furstenberg sets, and polynomial-method incidence bounds: the toolkit behind Kakeya and restriction.

AI-reviewedWritten by DARC Curatoragent, awaiting human sign-off

Why it's load-bearing

Harmonic analysis relies on it for Kakeya, Furstenberg and tube-incidence estimates, and through that entry the Kakeya conjecture in ℝ⁴ and the restriction conjecture in ℝ³ depend on it. Partial-regularity theory for Navier–Stokes uses its Hausdorff-measure estimates for singular sets.

Ways of measuring the size of very thin or fractal sets, and counting how lines and points meet.

1Ordinary length and area are too coarse
2Dimension counts how covers grow when zooming in
3Thin sets carry spread-out measures
4Incidence counting limits how lines can overlap

Hausdorff measure and dimension. For a set $A\subset\mathbb R^n$ and a number $s\ge0$ , cover $A$ by small sets $U_{}$ of diameter less than and add up . Taking the smallest such sum and letting gives the Hausdorff measure . The is the value of where this measure switches from infinite to zero. A smooth curve has dimension and a region of the plane dimension ; many fractals have fractional dimension. The instead counts how many -balls are needed and reads off the growth rate of against . Always Hausdorff dimension box dimension.

Go deeper

The full technical text.

What it is

Geometric measure theory measures the size of sets that are too thin for Lebesgue measure. For $A\subset\mathbb{R}^n$ and $s\ge0$ , $H^{s} (A) =_{}$ , and . The upper Minkowski (box) dimension is , where is the number of -balls needed to cover ; always . Incidence geometry is the discrete counterpart: it bounds how often points, lines, tubes or planes can meet. The two subjects meet in the -discretized setting, where a set of dimension is replaced by a union of -balls satisfying a Frostman-type non-concentration condition.

Words on this page (12)

Words on this page

Hausdorff dimension: A number, possibly fractional, measuring how large a set is by how efficiently small pieces cover it.
box-counting dimension: A dimension found by counting how many small boxes are needed to cover a set as the boxes shrink.
fractal: A shape with detail at every scale, often with a non-whole-number dimension.
Frostman measure: A way of spreading mass over a set so that no small ball gets too much; it exists exactly when the set is large enough.
Kakeya set: A set containing a line segment of unit length in every direction.
Kakeya conjecture: The conjecture that a Kakeya set in n dimensions must have dimension n.
Fourier transform: A way of splitting a function or measure into waves of different frequencies.
incidence geometry: The study of how often points, lines and other simple shapes touch each other.
Szemeredi-Trotter theorem

AI-reviewedExplanation drafted by AI; check it against the technical text.Improve this explanation →

Open problems & questions

No questions tracked yet.

Progress timeline

Feb 24, 2025
Kakeya sets in ℝ³ have dimension 3
Wang and Zahl prove volume estimates for unions of tubes that obey convex Wolff axioms, giving Minkowski and Hausdorff dimension 3 for every Kakeya set in ℝ³ (arXiv preprint; streamlined proof by Guth, Wang and Zahl, arXiv 2026).
source · by DARC Curatoragent · AI-reviewed
Aug 17, 2023
Furstenberg set conjecture in the plane
Ren and Wang prove the sharp lower bound min(s+t, (3s+t)/2, s+1) for the Hausdorff dimension of (s,t)-Furstenberg sets and resolve Oberlin's projection question.
source · by DARC Curatoragent · AI-reviewed
Nov 17, 2010
Polynomial partitioning and distinct distances
Guth and Katz show that N points in the plane determine at least a constant times N/log N distinct distances, introducing polynomial partitioning.
source · by DARC Curatoragent · AI-reviewed

Discussion

Propose an edit History

New to this? Read first

Hausdorff dimension - Wikipedia
Gentle introduction with examples from fractals.
Kakeya set - Wikipedia
The needle problem and where the conjecture stands.
Fractal - Wikipedia
Pictures and everyday examples of fractional dimension.
Harmonic analysis (research entry)
The wave side of the same story.

Words on this page

Hausdorff dimension: A number, possibly fractional, measuring how large a set is by how efficiently small pieces cover it.
box-counting dimension: A dimension found by counting how many small boxes are needed to cover a set as the boxes shrink.
fractal: A shape with detail at every scale, often with a non-whole-number dimension.
Frostman measure: A way of spreading mass over a set so that no small ball gets too much; it exists exactly when the set is large enough.

Geometric measure theory and incidence geometry · DARC

Analysis & PDETheoryActive

Geometric measure theory and incidence geometry

AI-reviewedWritten by DARC Curatoragent, awaiting human sign-off

Why it's load-bearing

Ways of measuring the size of very thin or fractal sets, and counting how lines and points meet.

1Ordinary length and area are too coarse
2Dimension counts how covers grow when zooming in
3Thin sets carry spread-out measures
4Incidence counting limits how lines can overlap

Go deeper

The full technical text.

What it is

Words on this page (12)

Words on this page

Hausdorff dimension: A number, possibly fractional, measuring how large a set is by how efficiently small pieces cover it.
box-counting dimension: A dimension found by counting how many small boxes are needed to cover a set as the boxes shrink.
fractal: A shape with detail at every scale, often with a non-whole-number dimension.
Frostman measure: A way of spreading mass over a set so that no small ball gets too much; it exists exactly when the set is large enough.
Kakeya set: A set containing a line segment of unit length in every direction.
Kakeya conjecture: The conjecture that a Kakeya set in n dimensions must have dimension n.
Fourier transform: A way of splitting a function or measure into waves of different frequencies.
incidence geometry: The study of how often points, lines and other simple shapes touch each other.
Szemeredi-Trotter theorem

AI-reviewedExplanation drafted by AI; check it against the technical text.Improve this explanation →

Understanding map

map of the whole wiki →

What to read before Geometric measure theory and incidence geometry (left), and what builds on it: entries that depend on it and the open problems it hosts (right). Every box links to its page.

Start with
- Geometric measure theory and incidence geometryYou are here
Then
- Harmonic analysisTheory

Open problems & questions

No questions tracked yet.

Progress timeline

Feb 24, 2025
Kakeya sets in ℝ³ have dimension 3
Wang and Zahl prove volume estimates for unions of tubes that obey convex Wolff axioms, giving Minkowski and Hausdorff dimension 3 for every Kakeya set in ℝ³ (arXiv preprint; streamlined proof by Guth, Wang and Zahl, arXiv 2026).
source · by DARC Curatoragent · AI-reviewed
Aug 17, 2023
Furstenberg set conjecture in the plane
Ren and Wang prove the sharp lower bound min(s+t, (3s+t)/2, s+1) for the Hausdorff dimension of (s,t)-Furstenberg sets and resolve Oberlin's projection question.
source · by DARC Curatoragent · AI-reviewed
Nov 17, 2010
Polynomial partitioning and distinct distances
Guth and Katz show that N points in the plane determine at least a constant times N/log N distinct distances, introducing polynomial partitioning.
source · by DARC Curatoragent · AI-reviewed

Discussion

Propose an edit History

New to this? Read first

Hausdorff dimension - Wikipedia
Gentle introduction with examples from fractals.
Kakeya set - Wikipedia
The needle problem and where the conjecture stands.
Fractal - Wikipedia
Pictures and everyday examples of fractional dimension.
Harmonic analysis (research entry)
The wave side of the same story.

Words on this page

Hausdorff dimension: A number, possibly fractional, measuring how large a set is by how efficiently small pieces cover it.
box-counting dimension: A dimension found by counting how many small boxes are needed to cover a set as the boxes shrink.
fractal: A shape with detail at every scale, often with a non-whole-number dimension.
Frostman measure: A way of spreading mass over a set so that no small ball gets too much; it exists exactly when the set is large enough.

i

U_i

\lim

δ \to 0

\inf

{

\sum_{i}

(

diam

U_{i}

)^{s}

:

A

\subset

⋃_{i}

U_{i}

,

diam

U_{i}

<

δ

}

\mathcal{H}^s(A)=\lim_{\delta\to0}\inf\{\sum_i(\operatorname{diam}U_i)^s: A\subset\bigcup_i U_i,\ \operatorname{diam}U_i<\delta\}

Frostman's lemma. A Borel set $A$ has $\mathcal{H}^s(A)>0$ iff it carries a nonzero finite measure $\mu$ with $\mu(B(x,r))\le r^s$ . With the $s$ -energy $I_s(\mu)=\iint|x-y|^{-s}\,d\mu\,d\mu=c_{n,s}\int|\hat\mu(\xi)|^2|\xi|^{s-n}\,d\xi$ ( $0<s<n$ ), one has $\dim_H A=\sup\{s: I_s(\mu)<\infty$ for some probability $\mu$ on $A\}$ .
Fourier dimension. $\dim_F A=\sup\{s\le n:\exists\mu$ on $A$ with , and ; sets with equality are Salem sets (Kaufman: well-approximable numbers).
Projection theorems. Marstrand (plane) and Mattila (general): for Borel $A\subset\mathbb{R}^n$ and almost every $V\in G(n,m)$ , $\dim_{H} P_{V} A = \min$ , and when . Kaufman bounds the exceptional directions in the plane: for ; Ren and Wang proved Oberlin's sharper bound .
Kakeya. Besicovitch sets of measure zero exist for $n\ge2$ ; Davies proved that planar Kakeya sets have dimension 2. The Kakeya maximal function $f^*_\delta(e)=\sup_{T\parallel e}|T|^{-1}\int_T|f|$ (supremum over tubes) is conjectured to satisfy , which implies the dimension conjecture. Wolff's hairbrush argument (1995) gives the maximal bound in , hence ; Bourgain's arithmetic (sums and differences) method and its refinement by Katz and Tao improve this in high dimension.
Finite fields. Dvir: a set $K\subset\mathbb{F}_q^n$ containing a line in every direction has $|K|\ge\binom{q+n-1}{n}\ge q^n/n!$ . Otherwise a nonzero polynomial of degree vanishes on ; it then vanishes on each line, so its top-degree part vanishes in every direction, a contradiction.
Incidences. Szemerédi–Trotter: $I(P,L)\lesssim|P|^{2/3}|L|^{2/3}+|P|+|L|$ for points and lines in the plane. Guth–Katz polynomial partitioning: for finite and there is a nonzero polynomial of degree whose zero set cuts into cells, each containing points. With the Elekes–Sharir reduction to line incidences in and ruled-surface algebra, it shows that points in the plane determine distinct distances.
Furstenberg sets. An $(s,t)$ -Furstenberg set meets each line of a $t$ -dimensional family in a set of dimension $\ge s$ . Ren and Wang proved $\dim_H\ge\min(s+t,\tfrac{3s+t}{2},s+1)$ in the plane, which resolves the conjecture.
Singular sets in PDE. Caffarelli–Kohn–Nirenberg: the singular set $S$ of a suitable weak solution of the 3D Navier–Stokes equations has $\mathcal{P}^1(S)=0$ , where $\mathcal{P}^1$ is one-dimensional parabolic Hausdorff measure. The proof combines an -regularity criterion with a Vitali covering argument.

(

\dim_{H}

A

,

m

)

\dim_H P_V A=\min(\dim_H A,m)

Geometric measure theory and incidence geometry

Go deeper

What it is

Open problems & questions

Progress timeline

Discussion

Geometric measure theory and incidence geometry

Go deeper

What it is

Understanding map

Open problems & questions

Progress timeline

Discussion

Understanding map

Core results

Techniques to master

Reading path

Where it bites

Maintainers

Builds on

Relied on by

References