{"id":"1be452a3-6878-486c-b4e2-fd19f453468c","arxiv_id":"2411.16001","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"There exist direction sets of Hausdorff dimension zero that are universal for AD-regular planar sets, and direction sets of arbitrarily small positive dimension universal for weakly regular sets.","lead":"The paper constructs tiny sets of directions that still guarantee at least one projection of any set in certain regular classes has maximal dimension. This shows that Marstrand's projection theorem can hold on direction sets of zero dimension when the underlying sets are regular.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 20's first case fails to control the accumulated error from Lemma 13: with M=floor(r/r_n), the term (4M+1)εr can be about 4r/(sε), not 5εr, so the displayed bound in (15) does not follow and Theorem 3 lacks a valid proof as written.","rationale":"After tracing the argument, the reader's weakest assumption is exactly where the proof breaks, but the issue is sharper than 'not shown to be controllable': a direct substitution makes the displayed error bound impossible. This is not an external-consensus objection; it is an internal inconsistency in Proposition 20's estimate. The high-level strategy (bit-deleted D_s sets, point-to-set principle) is plausible, and the AD-regular theorem (Thm 24) relies on Lemma 11 rather than Lemma 13, so this concern does not automatically invalidate every result. However, the headline weakly-regular result (Thm 3/21) is unsupported as currently written, and because the omitted proofs of Lemmas 12 and 13 are the only places where the '4εb' error term could be corrected, the conditional status the reader assigned is appropriate. I would keep the reader's CONDITIONAL verdict rather than escalate to reject, since a corrected lemma error term would repair the proof.","tokens_in":1,"tokens_out":10312,"duration_ms":221939,"concrete_test":"One check settles whether this is a real failure: recompute the accumulated error term in Proposition 20 using the printed statement of Lemma 13, with s=1/2, ε=10^{-2}, and r=2·10^4 r_n (the upper end of the first case). Then M=2·10^4 and the error term subtracted in the proof equals (4M+1)εr ≈ 800r, whereas inequality (15) claims a bound of 5εr = 0.05r; the two differ by four orders of magnitude. Even without numbers, substituting M ≤ 1/(sε²) directly shows (4M+1)εr is not O(εr) unless the per-interval error is changed to 4ε(b−a). If the authors can prove Lemma 13 with the latter error and update the summation, Proposition 20 is salvageable; otherwise Theorem 3 does not follow.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Proposition 20, the first case r_n ≤ r < (1/ε^2)⌊r_n/s⌋ partitions [r_n,r] into M=⌊r/r_n⌋ intervals [r_i,r_{i+1}] and applies Lemma 13 to each. Lemma 13 gives an error 4εb per interval, so the total error entering the complexity calculation is at least 4Mεr (and actually 4ε∑ r_{i+1}, which is larger). The proof then obtains K_r^{A,B,e}(p_e x) ≥ σr − (4M+1)εr − O(log r) and asserts this is ≥ σr − 5εr. But the case assumption gives M ≤ 1/(sε²), so (4M+1)εr can be as large as (4/(sε)+ε)r, which for small ε is much larger than r, let alone 5εr. For example, with s=1/2, ε=10^{-2}, r=2·10^4 r_n, the error is ~800r while the claimed bound is 0.05r. Thus inequality (15) is arithmetically false under the stated hypotheses. Since Theorem 21 is proved entirely through Proposition 20, the weakly-regular universal set theorem is unsupported as printed. The omission of proof for Lemma 13 matters here because its error term is exactly what drives the contradiction; if the intended lemma had error 4ε(b−a) instead of 4εb, the summation would be O(εr) and the proof could be repaired, but that is not what is stated.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper studies universal sets of directions for projection theorems in R^2. A direction set D is universal for a class C of planar sets if for every E in C some e in D satisfies dim_H(p_e E) = min{1, dim_H(E)}. The authors construct a family of small direction sets D_s, s in (0,1), of lower box dimension s, and prove (Theorem 21) that D_s is universal for the class of weakly regular sets; for s=0, D_0 has lower box dimension zero and is claimed to be universal for Ahlfors-David regular sets (Theorem 24). They also prove a Kaufman-type exceptional set estimate for sets with optimal oracles (Theorem 27), deduce existence of essentially s-dimensional universal sets for optimal-oracle classes (Corollary 28), and construct zero-dimensional Bourgain universal sets for analytic sets (Theorem 26). The proofs are based on effective dimension, the point-to-set principle, and a sequence of 'teal/yellow' interval decomposition lemmas from earlier work of the second author.","tokens_in":22855,"tokens_out":16919,"duration_ms":132761,"significance":"If the main theorems are correct, they give a sharp qualitative picture: stronger regularity assumptions on the class of sets shrink the dimension of universal direction sets to zero, while weak regularity still allows universal sets of arbitrarily small positive dimension. The construction of D_0 and D_s is elegant and the pointwise-to-classical transfer is well organized. The paper also generalizes Kaufman's exceptional set estimate to a broad 'optimal oracles' class, which is a substantial contribution in itself. However, the proof of Theorem 21 relies on Proposition 20, whose first case contains a concrete arithmetic error in the accumulation of errors from Lemma 13; as printed, Theorem 3 is not established. The paper also omits proofs of Lemmas 12 and 13, one of which drives the flawed step. The framework is promising and the gap appears local, so the result is likely repairable.","major_comments":[{"comment":"The bound in (15) does not follow from the preceding estimate. In the first case, after applying Lemma 13 to each [r_i, r_{i+1}], the total error is at least 4ε Σ_{i=1}^M r_{i+1} (and the author's intermediate quantity 4Mεr is of the same order), which is of order ε r^2/r_n. Under the case assumption r < ε^{-2}⌊r_n/s⌋, this error can be as large as 4r/(sε), which is not bounded by 5εr; for example, with s=1/2, ε=10^{-2}, and r=2·10^4 r_n, the error is approximately 800r. Hence the inequality K^{A,B,e}_r(p_e x) ≥ min{α,1} - 5εr - O(log r) is arithmetically false under the stated hypotheses. Since Theorem 21 is proved directly from Proposition 20, Theorem 3 is not established by the present proof.","section":"Section 5.1, Proposition 20, Eq. (15)"},{"comment":"Lemma 13 is stated without proof, as a 'simple modification' of Lemmas 11 and 12. This is not merely a presentation issue: the error term 4εb on each interval is exactly what causes the summation failure in Proposition 20. If the correct statement had error 4ε(b-a), the total error over a partition of [r_n, r] would be O(εr), and the argument could be repaired. The authors should provide the proof of Lemma 13, or correct its statement and verify the corrected version, since Theorem 21 depends on it.","section":"Section 3, Lemma 13"},{"comment":"The assertion that each interval [r_i, r_{i+1}] is both (α, ε)-almost teal and (α, ε)-almost yellow is not justified. The hypotheses give only global bounds on the liminf and limsup of r^{-1}K^A_r(x); they do not directly imply uniform bounds on K^A_{b,s}(x|x) for all s in [a,b]. Moreover, Lemma 13 is applied with σ = min{α,1}, but if α > 1 the intervals would need to be (1,ε)-almost teal (upper bound with slope 1), which is not implied by an (α,ε)-almost teal bound (larger slope). This step should be proved carefully, as it is used to convert complexity differences into projection bounds.","section":"Section 5.1, Proposition 20"}],"minor_comments":[{"comment":"In the statement of Proposition 20, condition (3) reads 'K^{A,B,e}_s(x) ≥ K^A_r(x) - εr for every sufficiently large r ∈ N'; the subscripts on the two sides do not match. It should presumably be K^{A,B,e}_r(x) ≥ K^A_r(x) - εr.","section":"Section 5.1, Proposition 20, condition (3)"},{"comment":"In the second case, the line 'K^{A,B,e}_r(p_e x) ≥ min{r, K^A_r(x)} - 25εr - O(log r)' appears to contain a typo: the right-hand side should be of the form min{dim^A(x),1} r - 25εr, as in Theorem 9. As written, the expression min{r, K^A_r(x)} compares a precision with a complexity and is not the intended lower bound.","section":"Section 5.1, Proposition 20, proof, second case"},{"comment":"In the proof of Lemma 19, the notation for the condition 'r_n/s ≤ r ≤ r_{n+1}' uses real division but the definition of D_s uses ⌊r_n/s⌋; the floors should be handled consistently to make the inequalities exact.","section":"Section 4, Lemma 19"},{"comment":"There are several typos, e.g., 'Hasudorff' in Section 2.2, 'Oc(log b)2' in Lemma 11, and 'K A,D b,b,a (pe | e, x )' where 'pe' should read 'p_e x' in the proof of Lemma 16. These should be corrected in a revision.","section":"Global"}],"recommendation":"major_revision","confidential_remarks":"The paper's main theorem for weakly regular sets currently has a gap in Proposition 20, but the gap appears local and likely repairable by replacing the equal-length partition with a dyadic one or by sharpening Lemma 13 to have error 4ε(b-a). The manuscript leans heavily on prior work of the second author, but this is acknowledged and those tools are used legitimately. I therefore recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Jacob,\n\nHere's my read of Fiedler–Stull's universal sets paper. The headline: there is genuinely new material here, and the AD-regular and Bourgain results are likely correct, but the proof of the weakly-regular theorem (Theorem 3) has a gap that looks fatal as written. I checked the stress-test note and it lands.\n\nWhat's new: the bit-deletion construction (Section 4) is a clever way to build direction sets with prescribed small box dimension while retaining enough effective complexity. Theorem 24 (zero-dimensional universal set for AD-regular sets) is a solid contribution, and the proof via Proposition 23 uses the AD-regular oracle machinery cleanly. Theorem 26 (zero-dimensional Bourgain universal set for analytic sets) is also likely correct; the partition argument there accumulates only logarithmic or √r errors, which is fine. Theorem 27, generalizing Kaufman's exceptional set estimate to optimal oracles, is a short and plausible application of Theorem 9.\n\nThe soft spot is Proposition 20. In the first case, the partition [r_n, r] into M = floor(r/r_n) intervals plus Lemma 13 produces an error of order 4Mεr. Under the case assumption r < (1/ε^2) floor(r_n/s), M can be as large as ~1/(sε^2). Then (4M+1)εr is on the order of (4/sε)r, not 5εr. For s=1/2, ε=10^{-2}, that is ~800r versus 0.05r. So inequality (15) is simply false under the stated hypotheses. Since Theorem 21 is proved entirely through this proposition, Theorem 3 is unsupported.\n\nThe omitted proofs of Lemmas 12 and 13 don't help. They are called 'simple modifications' of Lemma 11, but the error term in Lemma 13 is load-bearing. If the lemma actually gave 4ε(b−a) rather than 4εb, the summation would be O(εr) and the argument might be repairable. That is not what is stated.\n\nThe other proofs do not seem to share this problem. So this is a paper with one broken load-bearing step, not a hollow outline. The right call is to send it to a serious referee, but with the expectation that Theorem 3 needs major repair or a change of statement.","headline":"Genuinely new constructions and a sharp gap in the weakly-regular theorem; the paper earns a referee but Theorem 3 needs a repaired proof.","tokens_in":23445,"tokens_out":8759,"would_cite":false,"duration_ms":73980,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["28A78","28A80","68Q30"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that for AD-regular planar sets there is a universal set of directions of lower box dimension zero, and for weakly regular sets there is one of arbitrarily small lower box dimension.","keywords":["projection theorems","universal sets of directions","Hausdorff dimension","box dimension","AD-regular sets","weakly regular sets","effective dimension","Kolmogorov complexity"],"falsifier":"Complete the omitted proofs of Lemmas 12 and 13 and explicitly sum their error terms over the $M \\approx r/r_n$ intervals of Proposition 20 in the case $r_n \\le r < (1/\\varepsilon^2)\\lfloor r_n/s \\rfloor$; if the total error is not $o(r)$, then Theorem 3's pointwise estimate for weakly regular sets fails.","tokens_in":22257,"feed_emoji":"📐","tokens_out":14180,"duration_ms":105420,"temperature":0.7,"pith_summary":"Classical projection theorems guarantee that for an analytic plane set, projections in almost every direction have maximal Hausdorff dimension. This paper asks the converse: how small a set of directions can be while still containing, for every set in a class, at least one direction whose projection is maximal. The answer depends on regularity: for AD-regular sets (roughly, sets that look the same size at every scale) a single direction set of lower box dimension $0$ is universal, and for weakly regular sets (those whose Hausdorff and packing dimensions agree) a direction set of lower box dimension $\\varepsilon$ is universal for every $\\varepsilon > 0$. The proofs translate the geometry into statements about the Kolmogorov complexity of projected points, using the point-to-set principle and direction sets built by zeroing selected bits of algorithmically random angles.","feed_headline":"Tiny direction sets still capture full projections of regular sets","feed_subtitle":"For AD-regular sets, a zero-dimensional direction set is universal; dimension ε works for weakly regular sets.","key_machinery":"The load-bearing construction is a family of direction sets $D_s \\subset S^1$ ($0 \\le s < 1$) defined from algorithmically random angles $\\theta$ by setting blocks of binary digits to zero. The counting scale $r_n$ grows extremely fast, with $r_{n+1} = 2^{2^{r_n}}$, and bits in the blocks $(r_n, n r_n]$ (for $D_0$) or $(r_n, r_n/s]$ (for $D_s$) are replaced by zeros; this gives lower box dimension $0$ or $s$ while retaining high effective complexity on all sufficiently long precision intervals. The proofs then rest on 'teal/yellow' interval lemmas (Lemmas 11–13), which bound the conditional complexity $K(x \\mid p_e x, e)$ on intervals where the direction $e$ has uniformly high complexity and the point $x$ has either low ('teal') or high ('yellow') complexity growth; these bounds let the argument sum pointwise complexity over a partition of $[1, r]$. The point-to-set principle converts the resulting pointwise statements into the classical Hausdorff-dimension theorems.","core_discovery":"The central claim is that strong regularity shrinks the dimension of a universal direction set to zero, while weak regularity only forces an arbitrarily small positive dimension. Specifically, the paper constructs a set $D_0 \\subseteq S^1$ of lower box dimension zero that is universal for the class of AD-regular sets, and, for every $\\varepsilon > 0$, a set $D_\\varepsilon \\subseteq S^1$ of lower box dimension $\\varepsilon$ that is universal for the class of weakly regular sets, those whose Hausdorff and packing dimensions coincide. The same construction, with the same $D_0$, yields a Bourgain-universal set for analytic sets, meaning every analytic $E$ has a direction $e \\in D_0$ with $\\dim_H(p_e E) \\ge \\dim_H(E)/2$. The paper also proves an exceptional set estimate for sets with optimal oracles (a broad class that includes analytic, weakly regular, and metric-outer-measure sets): for $0 < s \\le \\min\\{\\dim_H(E), 1\\}$, the set of directions whose projection of $E$ has dimension $<s$ has Hausdorff dimension at most $s$.","pith_inferences":["If Lemmas 12 and 13 hold, the bit-zeroing template likely generalizes to other classes of sets defined by equality of two dimensions, producing universal direction sets of arbitrarily small but positive dimension.","The method indicates that the boundary between zero-dimensional and positive-dimensional universal sets is controlled by whether the pointwise complexity bound holds with logarithmic rather than linear error; identifying which regularity classes admit logarithmic errors would map that boundary.","A concrete test of the omitted proofs is to replace Lemma 13's teal-case error $4\\varepsilon b$ with the explicit enumeration error from Lemma 14 and check whether the sum over the partition in Proposition 20 stays $o(r)$ in the critical range $r < r_n/(\\varepsilon^2 s)$."],"forward_implications":["For AD-regular planar sets, a single fixed zero-dimensional direction set is universal: every AD-regular $E$ has some $e \\in D_0$ with $\\dim_H(p_e E) = \\min\\{\\dim_H(E), 1\\}$.","For weakly regular sets, every $\\varepsilon > 0$ admits a universal direction set of lower box dimension $\\varepsilon$, so weakening AD-regularity to weak regularity costs at most an arbitrarily small positive dimension.","The exceptional set estimate for optimal-oracle sets ($\\dim_H\\{e : \\dim_H(p_e E) < s\\} \\le s$) recovers and extends the classical exceptional set estimate, giving universal direction sets for any essentially $s$-dimensional set of directions.","There exists a zero-dimensional set $D_0$ that is Bourgain universal for analytic sets: every analytic $E$ has a direction with projection dimension at least half its own dimension."],"supporting_citations":[{"why":"The classical projection theorem that defines the maximal projection dimension this paper compares against.","marker":"[18]"},{"why":"The exceptional set estimate that the paper extends to sets with optimal oracles.","marker":"[13]"},{"why":"The point-to-set principle that converts classical Hausdorff dimension into effective dimension, used throughout.","marker":"[14]"},{"why":"Provides the base effective projection theorems and the enumeration framework for the proofs.","marker":"[17]"},{"why":"Supplies the teal/yellow interval lemmas and the technical lemma used in the Bourgain-universal argument.","marker":"[29]"},{"why":"Introduces optimal oracles, the class for which the exceptional set estimate is proved.","marker":"[28]"},{"why":"Gives the symmetry-of-information and geometric projection lemmas needed for the complexity bounds.","marker":"[15]"},{"why":"Supplies the complexity growth bound used to control error terms.","marker":"[3]"}],"fun_headline_variants":["Zero-dimensional directions capture all AD-regular projections","Strong regularity drives universal direction dimension to zero","Weak regularity needs only arbitrarily small positive dimension","Projection universality: minimal direction dimension tied to regularity","AD-regular sets: zero-dimensional direction set suffices"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the omitted proofs of Lemmas 12 and 13 are correct and that the error accumulated across the partition in Proposition 20 is $o(r)$; if either fails, the weakly regular universal set theorem (Theorem 3) is unsupported.","fun_headline_variants_meta":{"raw":{"variants":["Zero-dimensional directions capture all AD-regular projections","Strong regularity drives universal direction dimension to zero","Weak regularity needs only arbitrarily small positive dimension","Projection universality: minimal direction dimension tied to regularity","AD-regular sets: zero-dimensional direction set suffices"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000878,"raw_usage":{"total_tokens":3779,"prompt_tokens":913,"completion_tokens":2866,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":529,"completion_tokens_details":{"reasoning_tokens":2803}},"tokens_in":529,"tokens_out":2866,"duration_ms":21264,"temperature":1.0,"reasoning_tokens":2803,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:40:25.175190+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Complete the omitted proofs of Lemmas 12 and 13 and explicitly sum their error terms over the $M \\approx r/r_n$ intervals of Proposition 20 in the case $r_n \\le r < (1/\\varepsilon^2)\\lfloor r_n/s \\rfloor$; if the total error is not $o(r)$, then Theorem 3's pointwise estimate for weakly regular sets fails.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"The classical projection theorem that defines the maximal projection dimension this paper compares against."},{"cited_title":"MR 248779","cited_arxiv_id":null,"evidence_quote":"The exceptional set estimate that the paper extends to sets with optimal oracles."},{"cited_title":"Lutz and Neil Lutz, Algorithmic information, plane Kakeya sets, and condi- tional dimension , ACM Trans","cited_arxiv_id":null,"evidence_quote":"The point-to-set principle that converts classical Hausdorff dimension into effective dimension, used throughout."},{"cited_title":"Stull, Projection theorems using effective dimension , Information and Computation 297 (2024), 105137","cited_arxiv_id":null,"evidence_quote":"Provides the base effective projection theorems and the enumeration framework for the proofs."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces optimal oracles, the class for which the exceptional set estimate is proved."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the symmetry-of-information and geometric projection lemmas needed for the complexity bounds."},{"cited_title":"Lutz, Mutual dimension , ACM Transactions on Computation Theory 7 (2015), no","cited_arxiv_id":null,"evidence_quote":"Supplies the complexity growth bound used to control error terms."}],"review_version":1}