{"id":"eb89bc7e-f043-42c6-9d73-961a003222ba","arxiv_id":"2412.17985","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Pinned dot product sets are large when the underlying set has Hausdorff dimension above n/2 with spread translations, or above (n+1)/2 for any translation, proven by reducing dot products to orthogonal projections.","lead":"This paper finds new Hausdorff dimension thresholds under which the set of pinned dot products of a fractal set is guaranteed to be large, and shows that the n/2 threshold from the Falconer distance problem is reachable for dot products when translations are drawn from a well-spread family. It offers a projection-theoretic framework that turns dot product size questions into classical projection estimates, with applications to dot product trees.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proof of Theorem 1.6 never shows the pin set Ax is full-dimensional; in the advertised range s∈(n/2,(n+1)/2] the argument allows the complementary bad set to have full dimension, so the main threshold improvement is not established.","rationale":"The reader's weakest assumption was the imported Theorem 2.7. That is a legitimate concern, but it is an external input that can be checked against [Ren23]; the present paper's internal logic has a more immediate gap. The proof of Theorem 1.6.(2) simply asserts the pin set Ax is full-dimensional in A without proof. The only available covering argument requires s>(n+1)/2, exactly the regime where Theorem 1.2 already gives the result for every translation; the advertised range n/2 < s ≤ (n+1)/2 is left unsupported. The counterexample template shows the conclusion is not a formal consequence of dimπ_x(A)>n-s and dimE_+≤n-s, because a full-dimensional bad part can coexist with a high-dimensional radial image. Consequently Corollary 1.9, which uses full-dimensionality to obtain a full-dimensional difference set, is also unsupported. The paper may be salvageable by weakening the conclusion to 'positive-dimensional pin set' or by adding a genuine argument; as written the central claim is not established.","tokens_in":14051,"tokens_out":22989,"duration_ms":226862,"concrete_test":"Work in R^2 with s=1.25. Take a Borel set A_bad realizing the sharp exceptional-set bound dim E_+(A_bad)=0.75 with dim A_bad=1.25 (Falconer 1982), and choose A_bad so that H^1(P_θ(A_bad))=0 for every θ in a set E of directions with dim E=0.75. Add A_good={r(θ)θ:θ∈D}, D⊂S^1\\E a Cantor set of directions of dimension 0.8, with r chosen so dim A_good=0.8. Put A=A_bad∪A_good and X=R^2. Verify: (i) dim A=1.25; (ii) X has 1-planar dispersion; (iii) dim π_0(A)=0.8>0.75; (iv) the set {a∈A:H^1(P_{π_0(a)}(A))>0} has dimension <1.25. If (i)-(iv) all hold, Theorem 1.6.(2) is false; if (iv) fails, isolate which property prevents it and use it to fill the gap.","verdict_should_be":"REJECT","load_bearing_attack":"Claim: the proof of Theorem 1.6.(2) does not establish the asserted full-dimensionality of the pin set. For each x in X_A the proof defines Ax = π_x^{-1}(π_x(A)\\E_+(A)) and verifies positivity, but no argument shows dim Ax = dim A. Repeating the covering argument from Theorem 1.2 gives dim(A\\Ax) ≤ dim E_+(A)+1 ≤ n-s+1; hence a full-dimensional bad complement can be ruled out only when s>(n+1)/2, the range already covered by Theorem 1.2. In the advertised improvement n/2 < s ≤ (n+1)/2 this argument is silent. The gap is real: take A_bad with dim s all of whose radial directions lie in E_+(A) (sharp examples for Proposition 2.3.(2) have dim E_+ = n-s), and add a lower-dimensional good set A_good whose radial projection has dimension >n-s. Then dimπ_x(A)>n-s while the good pins have dimension <s, so no full-dimensional Ax exists. Corollary 1.9's full-dimensional difference set depends on this unproved step.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies pinned dot product sets \\Pi^a_x(A):=\\{(a-x)\\cdot y:y\\in A\\} for Borel sets A\\subset\\mathbb{R}^n and parameters a,x\\in\\mathbb{R}^n. It proves translation-invariant results (Theorem 1.2) that give dimensional thresholds for \\Pi^a_x(A) to have Hausdorff dimension at least u, positive H^1 measure, or nonempty interior, using classical exceptional-set estimates for orthogonal projections. It then states translation-dependent results (Theorem 1.6) that lower these thresholds to the Falconer-type exponent n/2 under a k-planar dispersion assumption on a set X of translations, via recent radial projection theorems of Orponen\\textendash Shmerkin\\textendash Wang and Ren. The paper also contains a Fourier-dimension result, a restricted-projection result using Zahl's theorem, and applications to dot-product trees and sharpness constructions. The Key Lemma 2.9, which identifies the size of \\Pi^a_x(A) with the size of the orthogonal projection P_{\\pi_x(a)}(A), is a direct and elegant reduction.","tokens_in":14296,"tokens_out":20674,"duration_ms":193713,"significance":"If the full statement of Theorem 1.6 were established, it would give a pinned dot product result at the same dimensional threshold as the Falconer distance conjecture, which is an attractive and significant outcome. The paper's projection-theoretic framework is clean, and the translation-invariant Theorem 1.2 appears to be correctly proved and provides a useful unified treatment. Proposition 1.4 and Proposition 1.10 are also nice consequences of known projection results. However, the proof of Theorem 1.6 contains a substantial gap: it never proves that the pin set A_x is full-dimensional in the advertised range n/2<s\\le (n+1)/2, and the proof of Corollary 1.9 additionally fails to justify the existence of a single full-dimensional pin set common to all translates. These gaps directly affect the paper's main new claims.","major_comments":[{"comment":"The proof defines A_x=\\pi_x(A)\\setminus E_+(A) and then A_x=\\pi_x^{-1}(A_x)\\cap(A\\setminus\\{x\\}), and verifies that H^1(\\Pi^a_x(A))>0 for every a in the second set. It never proves that this A_x has dim A_x=\\dim A, which is part of the theorem's conclusion. For A^*=A\\setminus A_x=\\{a\\in A:\\pi_x(a)\\in E_+(A)\\}, the only bound available is \\dim A^*\\le \\dim E_+(A)+1\\le n-s+1. This gives \\dim A^*<s only when s>(n+1)/2, which is exactly the range already covered by Theorem 1.2(2). In the advertised improvement range n/2<s\\le(n+1)/2 the argument does not exclude the possibility that the bad complement has full dimension. The analogous gap affects Theorem 1.6(1), where the corresponding bound would require s>(n+u)/2, and Theorem 1.6(3), where it would require s>(n+2)/2. Thus the central claim that Theorem 1.6 improves the threshold to n/2 is not established by the given proof.","section":"Section 3.2, proof of Theorem 1.6(2)"},{"comment":"The proof takes X=A in Theorem 1.6 and obtains a full-dimensional set A_1\\subset A and, for each x\\in A_1, a full-dimensional set A_x\\subset A with H^1(\\Pi^a_x(A))>0 for all a\\in A_x. The conclusion (1.3), however, requires a single full-dimensional set A_2 such that positivity holds for every (a_1,a_2)\\in A_1\\times A_2; this would require A_2\\subset\\bigcap_{a_1\\in A_1}A_{a_1}. The proof simply renames the pointwise sets A_x as A_2, without any argument that a common full-dimensional intersection exists. This does not follow from Theorem 1.6 as stated, so the advertised consequence that there is a full-dimensional set A_0\\subset A-A with H^1(\\Pi^{a_0}_0(A))>0 is unsupported.","section":"Corollary 1.9, proof"}],"minor_comments":[{"comment":"The symbol A_x is used both for the set of directions \\pi_x(A)\\setminus E(A) and for the pin set \\pi_x^{-1}(A_x)\\cap A. This overloading makes the proofs difficult to follow; using distinct notation such as D_x and A_x would improve clarity.","section":"Sections 3.1 and 3.2"},{"comment":"The proof sets k=\\lfloor(n+1)/2\\rfloor while the statement uses k=\\lceil n/2\\rceil. The two expressions are equal for integer n, but the inconsistency should be resolved in a revision.","section":"Proof of Theorem 1.6"},{"comment":"The line 'A^*\\subset E_+(A)' is a type error: A^* is a subset of \\mathbb{R}^n while E_+(A) is a subset of S^{n-1}. The intended statement is \\pi_x(A^*)\\subset E_+(A).","section":"Proof of Theorem 1.2(2), Section 3.1"},{"comment":"The inclusion A\\subset\\pi_x(A\\setminus\\{x\\})\\times\\hat{A}_x is informal; the polar-coordinate map (\\theta,r)\\mapsto x+r\\theta should be stated explicitly so that the dimension bound is rigorously justified.","section":"Proof of Proposition 2.6"},{"comment":"The statement repeats 'for all x\\in A_v' and does not assert any lower bound on \\dim A_v; as written, the result is close to vacuous. The intended quantitative assertion should be stated.","section":"Theorem 4.1 statement"},{"comment":"The proof does not explicitly specify the choice of \\epsilon in Corollary 2.8. Because s>n/2 gives \\min\\{\\dim X,\\dim A,k\\}-(n-s)\\ge s-n/2>0, a sufficiently small \\epsilon exists, but this should be spelled out.","section":"Application of Corollary 2.8 in Theorem 1.6"}],"recommendation":"major_revision","confidential_remarks":"The main new result, Theorem 1.6, is not proved in the range that constitutes the paper's advertised improvement over Theorem 1.2. The gap is not a minor technicality: the standard dimension bookkeeping only yields full-dimensionality of the pin set when s>(n+1)/2. If the authors cannot supply a new argument for full-dimensionality in the range n/2<s\\le(n+1)/2, the theorem should be weakened or restated. The proof of Corollary 1.9 has a separate, also substantial, common-pin-set issue. The paper also depends on a deep black-box result (Theorem 2.7, attributed to Ren); the editor may wish to have a specialist confirm that the statement is quoted with exactly the hypotheses needed."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Here's the short version: the paper has a clean and genuinely useful framework, but the main advertised result, Theorem 1.6, has a load-bearing gap. The proof never shows that the pin set A_x is full-dimensional in A.\n\nWhat is actually new and good: the reduction of pinned dot product sets to orthogonal projections is elegant and correct. Lemma 2.9 is an exact scaling identity, and the discussion connecting exceptional sets for projections to dot product size is a nice unifying perspective. The new parts of Theorem 1.2 (parts (1) and (3)) look solid and are genuinely new; part (2) correctly re-proves the known Iosevich–Taylor–Uriarte-Tuero result with classical tools. The translation-dependent formulation with k-planar dispersion and the use of Ren's and Orponen–Shmerkin–Wang's radial projection theorems is a sensible and interesting route, and the survey of the state of the art is a useful service.\n\nThe soft spot is not a typo. In the proof of Theorem 1.6.(2), the set of directions A_x = π_x(A) \\ E_+(A) is shown to be large in π_x(A). But the pin set is the preimage of that set inside A, and no argument shows this preimage has dimension equal to dim A. For that you need to bound the bad set A \\ A_x, and the only available argument (the one used in Theorem 1.2) gives dim(A \\ A_x) ≤ dim E_+(A) + 1 ≤ n−s+1. That is smaller than s only when s > (n+1)/2, which is precisely Theorem 1.2's range, not the advertised improvement. So in the range n/2 < s ≤ (n+1)/2, the main conclusion is unproved. The stress-test scenario is plausible and worth taking seriously: a lower-dimensional good subset can lift the radial projection above n−s while the good pins stay low-dimensional. Corollary 1.9 inherits this gap. The same issue affects parts (1) and (3) of Theorem 1.6.\n\nMinor issues: the notation A_x is used for both the direction set and the pin set; the proof of Theorem 1.6 says k = floor((n+1)/2) while the statement has k = ceil(n/2) (these coincide, so it is not a real conflict); and the tree construction in Section 4 is only sketched.\n\nWho should read this: anyone working on configuration problems or projection theory will get something from the framework and the survey. The new parts of Theorem 1.2 are worth citing once they are vetted. But do not cite Theorem 1.6 or Corollary 1.9 in their present form.\n\nRecommendation: this deserves a serious referee, but the referee should be sent to work on the full-dimensionality step. Either the authors prove it under additional hypotheses on A (e.g., k-planar dispersion of A) or they soften the statement. As is, the main threshold improvement is not established.","headline":"Nice projection framework, but the advertised n/2 threshold for pinned dot products is not proved: Theorem 1.6 lacks the key full-dimensionality step for the pin set.","tokens_in":14828,"tokens_out":6952,"would_cite":false,"duration_ms":62117,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["28A80","28A75"],"pacs":[],"model":"deepseek-v4-flash","headline":"For fractals in R^n, pinned dot product sets become large once the dimension exceeds n/2, the same threshold conjectured for Falconer distances.","keywords":["pinned dot products","Falconer distance problem","Hausdorff dimension","radial projections","orthogonal projections","exceptional sets","k-planar dispersion","geometric measure theory"],"falsifier":"A concrete refutation would be a Borel set A ⊂ R^n with dim A > n/2 and a k-planar dispersed set X with dim X ≥ dim A such that, for every full-dimensional subset of X, the set {x ∈ X : dim π_x(A) ≤ n - dim A} already has full dimension in X; that would contradict Corollary 2.8 and collapse Theorem 1.6.(2).","tokens_in":13858,"feed_emoji":"📐","tokens_out":6305,"duration_ms":49737,"temperature":0.7,"pith_summary":"This paper studies how large a fractal set A in R^n must be so that its pinned dot product sets are large. For a fixed translation x, the threshold is (n+1)/2: whenever dim A > (n+1)/2, a full-dimensional subset of pins a in A has Π^a_x(A) with positive 1-dimensional Hausdorff measure, and analogous thresholds give high dimension or nonempty interior. The main new result is translation-dependent: if the set of allowed translations X is k-planar dispersed and dim X ≥ dim A, then dim A > n/2 already forces positive-measure dot product sets for a full-dimensional family of translations and pins. This matches the conjectured Falconer distance threshold, supporting the authors' conjecture that for any Borel A with dim A > n/2 there is a pin a with $H^{1}$(Π^a_0(A)) > 0.","feed_headline":"Pinned dot products reach Falconer's n/2 threshold","feed_subtitle":"A new projection argument shows positive-measure pinned dot products whenever dim A > n/2.","key_machinery":"The load-bearing identity is Lemma 2.9: for a ≠ x, H^s(Π^a_x(A)) = c_{a,x,s} H^s(P_{π_x(a)}(A)), where P_θ is orthogonal projection onto the line spanned by θ and π_x(a) = (a-x)/|a-x| is the radial projection of the pin onto the unit sphere. This converts dot product sets into projection theory: one needs directions π_x(a) that avoid the exceptional sets E^+(A), E^u(A), E^◦(A). The argument combines classical exceptional set estimates (Prop 2.3), the elementary radial projection bound dim π_x(A) ≥ dim A - 1, and, for the strengthened theorem, Ren's discretized radial projection theorem (Theorem 2.7) in the form of Corollary 2.8, which guarantees many translations x in X with large radial projection dimension when X has k-planar dispersion.","core_discovery":"The paper's central discovery is that the pinned dot product problem reduces, through the identity $H^{1}$(Π^a_x(A)) = c $H^{1}$(P_{π_x(a)}(A)), to comparing the radial projection set π_x(A) with the exceptional set of orthogonal projections that shrink A. Classical exceptional set bounds give the translation-invariant threshold (n+1)/2. The new input is Corollary 2.8: for k-planar dispersed X, except for a dimension-negligible subset of x in X, dim π_x(A) ≥ min{dim X, dim A, k}; taking k = ceil(n/2), this beats the exceptional set dimension whenever dim A > n/2, yielding Theorem 1.6.(2). The proof then produces full-dimensional sets X_A ⊂ X and A_x ⊂ A for which every pinned dot product set has positive measure. A corollary gives a full-dimensional set of difference vectors a0 in A - A with $H^{1}$(a0 · A) > 0.","pith_inferences":["The same projection framework likely applies to other pinned configurations (e.g., pinned volumes or angles) where the configuration map is a submersion onto hyperplanes, so improvements in radial projection theorems should transfer directly.","A natural test of the k-planar dispersion hypothesis: construct a Borel set X with dim X ≥ s but without k-planar dispersion for which the conclusion of Theorem 1.6 fails; if such a set exists, the dispersion assumption would be shown necessary.","Because the epsilon loss in Corollary 2.8 is absorbed only by strict inequality s > n/2, the theorem does not address the critical case s = n/2; one might expect the conclusion to fail there, analogously to the distance problem.","The sharpness example A = C × {0} in the plane shows the n/2 threshold cannot be lowered in general, so the theorem is optimal in dimension without additional Fourier or structural hypotheses."],"forward_implications":["If Theorem 1.6.(2) is correct, the pins/translations version of the dot product Falconer problem is solved at the conjectured threshold n/2, the same as the distance problem.","Corollary 1.9 gives a full-dimensional set of difference vectors a0 in A - A with H^1(a0 · A) > 0, extending the dot product result to differences.","For even n, any set with dim A > n/2 is automatically k-planar dispersed, so the main theorem covers all even-dimensional sets at the threshold.","The sharper planar bound of Ren and Wang on exceptional sets would further lower the dimensional thresholds in Theorem 1.2.(1) and Theorem 1.6.(1) for n = 2, as noted in Remark 2.4.","The tree application (Theorem 4.1) extends the pinned dot product result to k-trees of dot products: for dim A > (n+1)/2, there is a full-dimensional set of roots with positive k-dimensional measure of edge-weight tuples."],"supporting_citations":[{"why":"Supplies the discretized radial projection theorem (Theorem 2.7) that gives large radial projections for sets with non-concentration; the main input for the translation-dependent results.","marker":"[Ren23]"},{"why":"Provides the proof framework from which Corollary 2.8 is deduced, converting k-planar dispersion of X into large radial projections off an exceptional set.","marker":"[OSW24]"},{"why":"Gives the classical exceptional set estimate dim E^+(A) ≤ n - dim A used to compare radial and orthogonal projection dimensions in both main theorems.","marker":"[Fal82]"},{"why":"Supplies the elementary radial projection bound dim π_x(A) ≥ dim A - 1 used for the translation-invariant theorem.","marker":"[BFR24]"},{"why":"Provides the restricted projections estimate (Theorem 3.1) used for Proposition 1.10, which adds a geometric condition on π_x(A) to guarantee good pins for a fixed x.","marker":"[Zah23]"},{"why":"The standard reference for the exceptional set estimates (Prop 2.3) and the projection theory background used throughout.","marker":"[Mat15]"}],"fun_headline_variants":["Pinned dot products get positive measure above n/2","New projection proof for pinned dot products above n/2","Radial projections pin dot product sets past n/2","Positive measure for pinned dot products when dim A > n/2","Projection identities lift pinned dot product size"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole translation-dependent improvement rests on Ren's discretized radial projection theorem, taken as a black box: if its stated conclusion does not hold for general Borel A and X, or if the epsilon loss in the derived Corollary 2.8 cannot be absorbed into the strict dimension gap, the n/2 threshold falls. The classical bound dim E^+(A) ≤ n - dim A is also assumed without proof.","fun_headline_variants_meta":{"raw":{"variants":["Pinned dot products get positive measure above n/2","New projection proof for pinned dot products above n/2","Radial projections pin dot product sets past n/2","Positive measure for pinned dot products when dim A > n/2","Projection identities lift pinned dot product size"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000752,"raw_usage":{"total_tokens":3336,"prompt_tokens":927,"completion_tokens":2409,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":543,"completion_tokens_details":{"reasoning_tokens":2329}},"tokens_in":543,"tokens_out":2409,"duration_ms":15759,"temperature":1.0,"reasoning_tokens":2329,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T05:08:42.884694+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete refutation would be a Borel set A ⊂ R^n with dim A > n/2 and a k-planar dispersed set X with dim X ≥ dim A such that, for every full-dimensional subset of X, the set {x ∈ X : dim π_x(A) ≤ n - dim A} already has full dimension in X; that would contradict Corollary 2.8 and collapse Theorem 1.6.(2).","supporting_citations":[],"review_version":1}