Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Favard length and generalized projections

T0 review · 3 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

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

Pith's one-line read This paper proves that smooth nonlinear projection families, under a uniform transversality condition, have generalized Favard length locally comparable to classical Favard length, and uses that comparison to transfer known decay bounds to

desk verdict A useful transfer principle for generalized Favard length; upper bounds are clean, the lower bound in Thm 2.4 needs a closer look, and one lemma is over-stated. read the letter →

arxiv 2607.28793 v1 pith:Z27XDSXE submitted 2026-07-30 math.CA

Izabella Laba , Alex McDonald , Krystal Taylor This is my paper · ORCID
classification math.CA MSC 28A7828A80
keywords Favardlengthgeneralizedprojectionsself-similarsetspurelyunrectifiabletransversalityunionsofcircleslevelcurvescomparisonprinciple
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

The paper establishes a local comparison principle: for any C² family of nonlinear projections whose gradient has unit size, bounded second derivatives, and a uniformly nondegenerate rate of rotation of the fiber direction, the generalized Favard length of a small set is bounded above by a constant multiple of its classical Favard length, with the constant independent of scale. Because the comparison is uniform, every quantitative upper bound known for the Favard length of purely unrectifiable self-similar 1-sets and of random Cantor sets transfers automatically to broad classes of curved projection families. As a concrete application, the paper proves that a union of circles centered at a purely unrectifiable self-similar 1-set has Lebesgue measure zero whenever the radius function varies slowly (gradient strictly less than 1), and obtains analogous results for ellipses and other level-curve families. The upshot is a reduction of a family of nonlinear projection problems—and a family of union-of-curves problems—to the classical linear theory, preserving essentially all decay rates.

What carries the argument

The key object is the angle function θ_α(x), the direction of ∇Φ_α(x), whose level curves are the fibers of the nonlinear projection. Lemma 3.3 shows that the determinant condition (2.3) is equivalent to |∂_α θ_α(x)| ≈ 1, i.e., the fiber direction rotates at a definite speed as the parameter changes. The local comparison is carried out by Lemma 4.5, which compares |Φ_α(E)| and |π_θ(E)| by containing each fiber component in a rectangle of dimensions ≈δ×δ² whose long side is nearly tangent to the fiber; the δ² width is exactly the curvature error of a C² curve over a δ-length segment. Summing over angle bins in the parameter interval converts this rectangle comparison into the integrated inequ

What would settle it

Take the C² family Φ_α(x) = x₁ + α x₂² on a small square Q containing the origin. Then ∇Φ_α = (1, 2αx₂), ∂_α∇Φ_α = (0, 2x₂), and the determinant det[∂₁Φ, ∂_α∂₁Φ; ∂₂Φ, ∂_α∂₂Φ] equals 1·2x₂ − 2αx₂·0 = 2x₂, which vanishes on the x₁-axis, violating (2.3). Directly computing Fav_Φ and Fav for E = Q ∩ {|x₂| ≤ δ²} should reveal whether the comparison Fav_Φ(E) ≲ Fav(E) fails or holds with a constant that grows as δ→0; the predicted behaviour distinguishes the necessity of (2.3).

Watch

Extended reading notes

Core claim

The central claim is Theorem 2.2: if Φ ∈ C²(I×U) satisfies |∇Φ_α|≈1, bounded second derivatives, and the uniform determinant condition det[∂₁Φ_α, ∂_α∂₁Φ_α; ∂₂Φ_α, ∂_α∂₂Φ_α] ≈ 1, then for every sufficiently small square Q and every E ⊂ Q that is a finite union of δ²-squares, Fav_Φ(E) ≲ Fav(E). The proof passes from linear to nonlinear projections by covering E with thin rectangles of dimensions δ×δ² whose long sides are nearly tangent to the fibers of Φ_α, using C² regularity to control the deviation. The determinant condition is exactly what forces the fiber direction θ_α(x) to rotate at a uniformly nondegenerate rate as α changes, so that the parameter interval can be partitioned into angle

Load-bearing premise

The load-bearing assumption is the uniform transversality condition (2.3): the fiber direction must rotate at a speed bounded away from zero everywhere, so that each angle bin in the parameter space is a controlled-length interval; if this determinant vanishes or degenerates over a non-negligible set of parameters and points, the partition argument in the proof of Theorem 2.2 collapses.

Editorial extensions

If this is right

  • Known upper bounds for the Favard length of the four-corner Cantor set and other purely unrectifiable self-similar 1-sets automatically hold for the generalized Favard length of any qualifying nonlinear projection family.
  • Random Cantor set bounds — 1/n for non-degenerate uniform choices, log(n)/n for degenerate ones — hold in expectation for generalized Favard length.
  • A union of circles centered at a purely unrectifiable self-similar 1-set has Lebesgue measure zero whenever the radius function is C² with gradient strictly less than 1.
  • The same Theorem 6.1 gives measure bounds for unions of ellipses with slowly varying axes, and more generally for level-curve families satisfying the determinant condition.
  • The transfer loses only a factor of two in the generation index (E_n vs E_{⌊n/2⌋}), so any power-law or subexponential decay rate is preserved in the exponent.

Reading between the lines

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

  • The strict gradient bound |∇r| < 1 in the circle theorem is likely an artifact of the proof: the determinant for circles equals 8r[(∇r)·(x−y) − r], which at |∇r| close to 1 can vanish on parts of the circle. One could test whether the measure-zero conclusion persists at |∇r|=1 for special radius functions such as r(x)=c·x₁.
  • Because the comparison is scale-invariant and purely local, the same argument should extend to higher-dimensional families of hypersurfaces, replacing 2×2 determinants by (d−1)×(d−1) Jacobians and δ² by δ² again; the θ_α rotation condition becomes a curvature-transversality condition on the normal field.
  • The constant in the comparison depends on Φ only through the quantitative constants in (2.1)–(2.3), not on the scale; this suggests that any family with uniform transversality admits a 'linearization at scale δ' that could be used for computational estimation of nonlinear Favard lengths.
  • The ⌊n/2⌋ loss is a subadditivity effect that may be removable by a more careful two-scale argument; if so, the transfer would become sharp at the level of the exponent.
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.

Referee Report

3 major / 4 minor

Summary. The paper introduces a generalized Favard length FavΦ(E)=∫_I |Φ_α(E)| dα for smooth families of nonlinear projections and proves, under the nondegeneracy conditions (2.1)–(2.3), a local comparison theorem: for unions of δ²-squares inside a δ-square, FavΦ(E) ≲ Fav(E) (Theorem 2.2), with a lower-bound variant on the range of realized directions (Theorem 2.3). These local results are then transferred to global estimates for self-similar 1-sets (Theorem 2.4), random Cantor sets (Theorem 2.6), and to measure-zero statements for unions of circles and ellipses (Theorems 2.7 and 6.1). The central mechanism is to approximate fibers by thin rectangles of dimensions δ×δ² and to use transversality (2.3) to discretize the angle parameter.

Significance. If the results hold, the paper gives a flexible transfer principle: quantitative upper bounds for classical Favard length imply corresponding bounds for a broad class of nonlinear projection families, with new applications to unions of curves. The local comparison proof (Lemmas 3.3, 4.1–4.5, Theorem 2.2) is self-contained and appears sound; the explicit determinant computations for circles and ellipses are also valuable. The main weaknesses are the proof of the global lower bound in Theorem 2.4, which depends on an unstated external theorem applied to a localized set, and the chart localization in the proof of Theorem 6.1, which is not justified as written. These issues do not undermine the local comparison itself, but they affect two of the paper's central stated conclusions.

major comments (3)
  1. [§5, proof of Theorem 2.4 (lower bound)] The proof verifies the transversality estimate (5.5) and then states: 'we now apply [7, Theorem 1.5] to the set E_n∩U′'. This is the entire justification for the 1/n lower bound. However, [7, Theorem 1.5] is not stated, and no argument is given that E_n∩U′ satisfies its hypotheses. In particular, the bullet 'U′∩E_n are approximations of a 1-set' is informal and does not quantify the approximation or its dependence on n. If [7, Theorem 1.5] applies to full iterates E_n or requires a specific self-similar structure, a localized subset E_n∩U′ need not be admissible, and the constant may depend on U′. Thus the two-sided statement (2.10) is not proved as written. The upper-bound transfer and the measure-zero applications are not affected.
  2. [§5, proof of Theorem 2.4 (upper bound)] With δ:=4(B+1)L^{-m}, the proof asserts that each E_{m,j} is 'a union of δ²-squares'. But E_{m,j} is a rescaled copy of E_m and consists of squares of side L^{-n}; for n=2m, δ²=16(B+1)²L^{-n}, which is not equal to L^{-n} unless the constant is 1. If δ²>L^{-n}, a square of side L^{-n} is not a union of δ²-squares, so Theorem 2.2 cannot be applied to E_{m,j} directly. The argument can likely be repaired by covering each E_{m,j} by O(1) squares of side L^{-n/2} aligned with the L^{-n} grid and applying Theorem 2.2 piecewise, but this step is missing.
  3. [§6, proof of Theorem 6.1] After covering V by product neighbourhoods U_j=U×I×J, the proof writes |G_j(E_n)| = FavΦ(E_n), implicitly assuming that E_n⊂U. In general, an implicit-function chart has a small x-domain U, and E_n∩U is an arbitrary subset of E_n; Theorem 2.4 applies to full iterates, not to such subsets. The proof therefore needs a localization argument showing that the contributions from the finitely many charts can be bounded by a constant multiple of Fav(E_{⌊n/2⌋}). Without such an argument, the derivations for circles (Theorem 2.7) and ellipses are incomplete.
minor comments (4)
  1. [Lemma 4.1] The lower bound should be interpreted with the projective distance on R/πZ; as stated, it fails when |θ_α−θ| is close to π. In the applications the angle differences are O(δ), so the proofs go through, but the statement needs clarification.
  2. [Ellipse application after Theorem 6.1] The condition '|x_1−y_1|≥a²/2' should almost certainly be '|x_1−y_1|≥a/√2' (and similarly for the second coordinate); the displayed inequality is false when a>2.
  3. [§5, proof of Theorem 2.4] The lower-bound part relies entirely on [7, Theorem 1.5] but the theorem is not stated. Please state the exact result used, so the reader can verify the hypotheses on E_n∩U′.
  4. [Theorem 6.1 statement] The final line '|G(E)|=Fav(E)=0' should read '|G(E)|=0' and 'Fav(E)=0'; the current formatting is ambiguous.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity; the central upper-bound comparison is self-contained, and the only self-citation (lower bound) is disclosed external support rather than a definitional reduction.

full rationale

The derivation chain for Theorem 2.2 is self-contained: conditions (2.1)-(2.3) are used to prove Lemma 3.3 (|∂_α θ_α|≈1), Lemmas 4.1-4.5 construct the rectangle comparison, and Theorem 2.2 integrates the resulting discrete angle bound. No equation in the conclusion is assumed as an input. The applications (Theorem 2.4 upper bound, Theorem 2.6, Theorem 6.1, Theorem 2.7) are honest reductions: subadditivity, scaling, and an explicit determinant computation (the circle determinant 8r[(∇r)·(x−y)−r]). The lower-bound half of Theorem 2.4 is explicitly attributed in Section 5 to [7, Thm 1.5] from Bongers-Taylor, with K. Taylor as a co-author; this is a disclosed self-citation. The paper does not redefine the cited theorem or fit parameters: it verifies the transversality condition (5.5) before applying [7]. That the verification for E_n∩U' is abbreviated ('U'∩E_n are approximations of a 1-set') is a possible proof gap for the lower bound, but it is a support/correctness concern, not a circular reduction. The central upper-bound transfer and measure-zero applications do not depend on the lower bound.

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

The paper is a pure-math proof with no empirically fitted parameters or invented entities. Its central claim rests on standard results (Implicit Function Theorem, Besicovitch's theorem), on the quantitative nondegeneracy assumptions (2.1)-(2.3), and on two prior theorems: [7, Thm 1.5] (for the global lower bound) and the classical upper bounds of Bond-Volberg / Nazarov-Peres-Volberg for Favard length. Self-similarity and strong separation are domain assumptions for the applications.

assumptions (5)
  • domain assumption Strong Separation Condition for the self-similar set E
    Section 2.2: Λ_i(E)∩Λ_j(E)=∅ for i≠j guarantees the Hausdorff/similarity dimension equals 1 and, with non-collinear b_i, pure unrectifiability.
  • standard math Besicovitch's theorem: a set of finite length is purely unrectifiable iff its Favard length vanishes
    Cited as [2,15]; used to assert Fav(E)=0 and to frame the transfer problem.
  • domain assumption [7, Theorem 1.5] (Bongers-Taylor) supplies the lower bound 1/n ≲ Fav_Φ(E_n)
    Proof of Theorem 2.4 imports this theorem after verifying its transversality condition; the verification is terse.
  • domain assumption Known classical upper bounds (Bond-Volberg; Nazarov-Peres-Volberg) for Fav(E_n)
    Equations (2.8)-(2.9); the transfer theorem is only as good as these inputs.
  • standard math Fubini reduction: |G(E_n)| = ∫_I |Φ_{y₁}(E_n)| dy₁
    Proof of Theorem 6.1 uses Fubini to identify the measure of the union of level curves with the generalized Favard length; requires the level curves to be graphs over y₁ on each chart.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Favard length and generalized projections." pith.science (2026). https://pith.science/paper/Z27XDSXE

@misc{pith2026260728793,
  author       = {Pith},
  title        = {Pith review of: Favard length and generalized projections},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Z27XDSXE}},
  note         = {Machine review of arXiv:2607.28793}
}
read the original abstract

We investigate generalized Favard lengths associated to smooth families of nonlinear projections. Under suitable regularity and transversality assumptions, we prove that generalized projections are locally comparable to orthogonal projections on sufficiently small scales. This yields a comparison principle that transfers quantitative upper bounds for classical Favard length to broad classes of nonlinear projection families. As a consequence, known upper bounds for the Favard length of purely unrectifiable self-similar 1-sets yield corresponding upper bounds for their generalized Favard lengths. We also prove that the union of circles with centers in a purely unrectifiable self-similar 1-set has Lebesgue measure zero whenever the radii vary sufficiently slowly. More generally, the same method yields measure estimates for unions of curves arising from suitable level-set families.

Figures

Figures reproduced from arXiv: 2607.28793 by the authors.

Figure 1
Figure 1. The projection of the rectangle Ri Theorem 2.7 follows from Theorem 6.1, a more general result on unions of curves defined as level curves of a function satisfying appropriate regularity and curvature conditions. Since the statement of Theorem 6.1 is longer and more complicated technically, we defer it to Section 6, along with the proofs of both theorems. 2.5. Organization of the paper. Section 1.5 introduces notati… view at source ↗

Discussion (0). Continue with ORCID 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. Applications of Nonlinear Projections to Rectifiable 1-sets

    math.CA 2026-08 conditional novelty 5.0 of 10

    A Federer-style projection framework for nonlinear maps yields structural bounds on exceptional pins, radial projection vantage points, and circle unions of 1-rectifiable sets.

Reference graph

Works this paper leans on

27 extracted references · cited by 1 Pith paper

  1. [7]

    Bongers and K

    R. Bongers and K. Taylor. Transversal families of nonlinear projections and generalizations of Favard length.Anal. PDE, 16(1):279–308, 2023

    2023

  2. [1]

    Bateman and A

    M. Bateman and A. Volberg. An estimate from below for the Buffon needle probability of the four-corner Cantor set.Math. Res. Lett., 17(5):959–967, 2010

    2010

  3. [2]

    A. S. Besicovitch. On the fundamental geometrical properties of linearly measurable plane sets of points (III).Math. Ann., 116(1):349–357, 1939

    1939

  4. [3]

    Bond.Combinatorial and Fourier analytic L²methods for Buffon ’s needle problem

    M. Bond.Combinatorial and Fourier analytic L²methods for Buffon ’s needle problem. PhD thesis, Michigan State Uni- versity, 2011

    2011

  5. [4]

    M. Bond, I. Laba, and A. Volberg. Buffon’s needle estimates for rational product Cantor sets.Amer. J. Math., 136(2):357– 391, 2014

    2014

  6. [5]

    Bond and A

    M. Bond and A. Volberg. Buffon needle lands inϵ-neighborhood of a 1-dimensional Sierpinski gasket with probability at most|logϵ| −c.C. R. Math. Acad. Sci. Paris, 348(11-12):653–656, 2010

    2010

  7. [6]

    Bond and A

    M. Bond and A. Volberg. Buffon’s needle landing near Besicovitch irregular self-similar sets.Indiana Univ. Math. J., 61(6):2085–2109, 2012

  8. [8]

    Chang, P

    A. Chang, P. Shmerkin, and V. Suomala. Sharp Favard length of random Cantor sets.Geom. Funct. Anal., 36:786–830, 2026

    2026

Show all 27 references
  1. [9]

    Cladek, B

    L. Cladek, B. Davey, and K. Taylor. Upper and lower bounds on the rate of decay of the Favard curve length for the four-corner Cantor set.Indiana Univ. Math. J., 71(3):1003–1025, 2022

    2022

  2. [10]

    J. E. Hutchinson. Fractals and self-similarity.Indiana University Mathematics Journal, 30(5):713–747, 1981

    1981

  3. [11]

    Laba and C

    I. Laba and C. Marshall. Vanishing sums of roots of unity and the Favard length of self-similar product sets.Discrete Anal., 2022(19):1–31, 2022

    2022

  4. [12]

    Laba and K

    I. Laba and K. Zhai. The Favard length of product Cantor sets.Bull. Lond. Math. Soc., 42(6):997–1009, 2010

    2010

  5. [13]

    J. M. Marstrand. Some fundamental geometrical properties of plane sets of fractional dimensions.Proc. London Math. Soc. (3), 4:257–302, 1954

    1954

  6. [14]

    P. Mattila. Orthogonal projections, Riesz capacities, and Minkowski content.Indiana Univ. Math. J., 39(1):185–198, 1990

    1990

  7. [15]

    Mattila.Geometry of sets and measures in Euclidean spaces, volume 44 ofCambridge Studies in Advanced Mathematics

    P. Mattila.Geometry of sets and measures in Euclidean spaces, volume 44 ofCambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1995. Fractals and rectifiability

    1995

  8. [16]

    Mattila.Fourier Analysis and Hausdorff Dimension

    P. Mattila.Fourier Analysis and Hausdorff Dimension. Cambridge University Press, 2nd edition, 2015

    2015

  9. [17]

    T. Mitsis. On a problem related to sphere and circle packing.Journal of the London Mathematical Society, 60(2):501–516, 1999

    1999

  10. [18]

    Nazarov, Y

    F. Nazarov, Y. Peres, and A. Volberg. The power law for the Buffon needle probability of the four-corner Cantor set. Algebra i Analiz, 22(1):82–97, 2010

    2010

  11. [19]

    D. M. Oberlin. Packing spheres and fractal Strichartz estimates inR d ford≥3.Proceedings of the American Mathematical Society, 134(11):3201–3209, 2006. F A V ARD LENGTH AND GENERALIZED PROJECTIONS 21

    2006

  12. [20]

    D. M. Oberlin. Unions of hyperplanes, unions of spheres, and some related estimates.Illinois Journal of Mathematics, 51(4):1265–1274, 2007

    2007

  13. [21]

    T. Orponen. On the dimension and smoothness of radial projections.Anal. PDE, 12(5):1273–1294, 2019

    2019

  14. [22]

    Peres and W

    Y. Peres and W. Schlag. Smoothness of projections, bernoulli convolutions, and the dimension of exceptions.Duke Math- ematical Journal, 102(2):193–251, 2000

    2000

  15. [23]

    Peres and B

    Y. Peres and B. Solomyak. How likely is Buffon’s needle to fall near a planar Cantor set?Pacific J. Math., 204(2):473–496, 2002

    2002

  16. [24]

    Simon and K

    K. Simon and K. Taylor. Dimension and measure of sums of planar sets and curves.Mathematika, 68(4):1364–1392, 2022

    2022

  17. [25]

    Talagrand

    M. Talagrand. Sur la mesure de la projection d’un compact et certaines familles de cercles.Bull. Sci. Math. (2), 104(3):225– 231, 1980

    1980

  18. [26]

    T. Wolff. A Kakeya-type problem for circles.American Journal of Mathematics, 119(5):985–1026, 1997

    1997

  19. [27]

    T. Wolff. Local smoothing type estimates onL p for largep.Geometric and Functional Analysis, 10(5):1237–1288, 2000. Mathematics Department, The University of British Columbia Email address:ilaba@math.ubc.ca Mathematics Department, Kennesaw State University, Marietta, GA Email ...

    2000

Pith tools

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