{"id":"93964bc8-5d27-4f66-9d91-53156eee37b5","arxiv_id":"2509.09649","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"An Omega lower bound near sqrt(N) exp((sqrt(2)+o(1)) sqrt(log(q/N) log_3(q/N)/log_2(q/N))) is claimed for character sums weighted by completely multiplicative f, but the extra positivity condition in the statement forces f identically 1.","lead":"This paper proves new lower bounds (Omega results) on the largest possible size of character sums twisted by multiplicative coefficients. The main advertised result turns out to apply only when the coefficient function is forced to be the constant 1, which severely limits its scope.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1.2's positivity hypothesis forces f≡1, so the advertised Omega result never applies to nontrivial multiplicative coefficients; the main claim is vacuous as stated.","rationale":"The reader's weakest_assumption is exactly this: the positivity condition in Theorem 1.2 is load-bearing and vacuous for nontrivial f. My analysis confirms it: evaluating at m=p^a, n=1 forces f(p)=1 for every prime p. This is the single most damaging issue because the paper's advertised novelty is an Omega result for multiplicative coefficients, and the stated theorem never engages any non-trivial f. I do not find an independent reason to move the verdict: the f≡1 case is plausibly salvageable, Theorem 1.1 appears to be a genuine small extension independent of this issue, and the proof of Theorem 1.2 is otherwise standard resonance-method machinery. The paper needs a corrected hypothesis (e.g., restricting m,n to the range actually appearing, or replacing the condition by a more reasonable one) before it can support the advertised claim. Since the reader already captured this concern and assigned CONDITIONAL, my read does not change that verdict.","tokens_in":4899,"tokens_out":5468,"duration_ms":65400,"concrete_test":"Formally verify vacuity: fix any prime p and set f(p)=e^{iθ}. Substitute m=p^a, n=1 into the hypothesis of Theorem 1.2, obtaining Re(e^{iaθ}) ≥ c > 0 for all a. If θ/2π is irrational, density of {e^{iaθ}} immediately gives some a with Re(e^{iaθ}) < 0. If θ/2π = s/r in lowest terms with r>1, average over a=1,...,r: the sum of e^{iaθ} is 0, so at least one real part is ≤0. Therefore the only possibility is θ=0 for all primes p, i.e., f≡1. This one-line check settles that the theorem's hypothesis set is {f≡1}.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing issue is in Theorem 1.2: the hypothesis Re(f(m) overline(f(n))) ≥ c > 0 for all integers m,n is so strong that it forces f≡1. For any prime p, complete multiplicativity and |f|=1 give f(p^a)=f(p)^a, with f(1)=1. Taking m=p^a, n=1 yields Re(f(p)^a) ≥ c > 0 for every a≥1. Write f(p)=e^{iθ}. If θ≠0 mod 2π, the sequence e^{iaθ} is either dense on the unit circle (if θ/2π is irrational) or is a nontrivial finite subgroup (if rational); in either case some term has real part ≤0, contradicting the condition. Hence θ=0 for every prime p, so f≡1. Thus Theorem 1.2, as stated, applies only to the trivial coefficient function and does not deliver the advertised Omega result for general multiplicative coefficients. The proof in Section 3 relies on this positivity to keep off-diagonal congruence terms positive, but the price is vacuity for every nontrivial f. The f≡1 case may be salvageable, but the central claim about general f is unsupported.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the maximum, over non-principal Dirichlet characters modulo a large prime q, of |∑_{n≤N} f(n)χ(n)| for completely multiplicative coefficients f with |f(n)|=1. Theorem 1.1 claims a lower bound of size √N exp((1+o(1)) A(τ+τ') √(log q / log_2 q)) when log N ≈ √(log q log_2 q) τ, following Hough's resonance method. Theorem 1.2 claims a stronger lower bound, √N exp((√2+o(1)) √(log(q/N) log_3(q/N) / log_2(q/N))), in the range exp((log q)^{1/2+δ}) ≤ N ≤ √q, under the additional assumption that Re f(m) \\overline{f(n)} ≥ c > 0 for all integers m,n. The proof of Theorem 1.2 uses Gál sums via Lemma 3.1 (a result of La Bretèche and Tenenbaum) and a positivity argument for off-diagonal congruence terms.","tokens_in":5164,"tokens_out":11751,"duration_ms":125706,"significance":"If valid, Theorem 1.2 would be a substantial advance over both Hough's result and the related preprint [3], and the strategy of building f directly into the resonator is natural. The manuscript also contains a plausible extension of Hough's method in Theorem 1.1. However, the central new theorem is not supported as stated: its positivity hypothesis forces f ≡ 1, so the advertised Omega result for non-trivial multiplicative coefficients is vacuous. In addition, a key counting estimate in the proof of Theorem 1.2 is false, and the claimed lower bound does not follow even in the trivial case. These are load-bearing flaws, not presentation issues.","major_comments":[{"comment":"The hypothesis 'Re f(m) \\overline{f(n)} ≥ c holds for any integers m,n and some absolute constant c>0' forces f≡1. Indeed, for any prime p, complete multiplicativity and |f|=1 give f(p^a)=f(p)^a; taking n=1 yields Re(f(p)^a) ≥ c for every a≥1. This is possible only if f(p)=1. Hence f(p)=1 for all primes p, so f is the trivial coefficient function. Consequently Theorem 1.2 has no non-trivial instances and cannot be described as an Omega result for general multiplicative coefficients. The introductory claim that it 'improves previous result of [3] at a cost of assuming an additional condition' is misleading: the cost is vacuity.","section":"Theorem 1.2 (Introduction, Section 3)"},{"comment":"The displayed lower bound for the congruence counting sum is false. With g=(m,n), a=m/g, b=n/g, the exact number of pairs (k,ℓ)≤N with mk=nℓ is floor(N/max(a,b)). The proof asserts the lower bound (N/√2)√((m,n)/[m,n]) = N/√(2ab). For example, if a=N and b=1 (i.e., m and n differ by a factor N), the count is 1, while the claimed bound is √(N/2), which exceeds 1 for N>2. The asserted inequality would require max(a,b) ≤ √(2ab), equivalently max(a,b) ≤ 2 min(a,b). The extremal set M from Lemma 3.1 is not shown to satisfy this condition for the pairs retained in the truncated sum, so the lower bound for M2 is not established.","section":"Section 3, inner-sum estimate"},{"comment":"The identity leading to ∑_{k≤N} r(k) ∑_{m≤Y/k} r(m)^2 requires r(mk)=r(m)r(k) for all m,k, i.e., complete multiplicativity of the resonator. The text defines r as a 'multiplicative function' and gives only values at primes; prime powers are not specified, and multiplicativity alone does not support the factorization. This affects the proof of Theorem 1.1 as well as Theorem 1.2. The authors should state explicitly that r is completely multiplicative and define r(p^a).","section":"Section 2, definition of r and M2 computation"}],"minor_comments":[{"comment":"The displayed assumption 'Ref(m) f(n) ≥ c' is missing the conjugation bar; it should read Re(f(m)\\overline{f(n)}) ≥ c.","section":"Theorem 1.2 statement"},{"comment":"The chain '≥ N q/(2 m/(m,n) n/(m,n))' appears to have a typographical 'q' or a misplaced factor; as printed it is dimensionally inconsistent. Please correct the intended expression.","section":"Section 3, displayed chain"},{"comment":"The claim 'By the proof of Page 105 in [6], we have ∑_{m≤Y/k} r(m)^2 = (1+o(1))∑_{m≥1} r(m)^2' is invoked without stating the uniformity conditions required for the range of k. The reader should be given the precise lemma or the needed hypotheses.","section":"Section 2, page 105 of [6]"},{"comment":"Reference [3] is the same group's preprint; the relation to the current paper's Theorem 1.1 and 1.2 should be clarified, especially whether Theorem 1.2 really supersedes it once the vacuity issue is resolved.","section":"References"}],"recommendation":"reject","confidential_remarks":"The paper's main new theorem is vacuous as stated, and the proof of the supporting estimate in Section 3 contains a false inequality. These are not local fixable issues within the manuscript's stated scope: the hypothesis of Theorem 1.2 essentially restricts to f≡1, and the Gál-set argument does not provide the required counting bound for general M. Even a careful revision would need to reformulate the theorem and supply substantially new arguments. I therefore recommend rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper has one genuinely nice observation: in Hough's resonator, an arbitrary completely multiplicative twist with |f|=1 cancels on the diagonal, so Theorem 1.1 extends Hough's Theorem 3.2 with modest effort. That part is probably correct, and it is new as stated. The authors are also honest about relying on heavy external machinery (La Bretèche–Tenenbaum for GCD sums, Hough's pages 105–107), which is fine when cited precisely.\n\nThe problem is Theorem 1.2, the advertised central result. The extra hypothesis Re(f(m) \\overline{f(n)}) ≥ c > 0 for all integers m,n forces f≡1. For any prime p, take m=p^a, n=1; then Re(f(p)^a) ≥ c for every a≥1, which only f(p)=1 can satisfy. So the theorem never applies to a nontrivial multiplicative coefficient. The proof uses that positivity to keep off-diagonal congruence contributions positive, so the vacuity is load-bearing, not cosmetic.\n\nThere's also a concrete error in the counting step: the bound N / max(m/g, n/g) ≥ (N/√2) sqrt((m,n)/[m,n]) is false for unbalanced pairs. For m/g=N, n/g=1 it gives 1 ≥ sqrt(N/2), which fails for N>2. That step is essential for the final lower bound, and the authors do not exclude such unbalanced pairs from the extremal set M.\n\nA smaller issue: the definition of r(m') is internally inconsistent as printed (it seems to conflate |M_j| and something else), which adds to the referee's burden.\n\nThe paper is not a waste of time. Theorem 1.1 is worth having, and the f=1 case of Theorem 1.2 would recover a known GCD-sum resonance bound. But the advertised generalization to multiplicative coefficients is unsupported. The abstract oversells it.\n\nWho gets value? Specialists in extreme values of character sums, and people who want to see how the resonance method handles twists. It deserves a serious referee, because the ideas are standard, the flaws are identifiable, and the fixes are plausible: restate the positivity condition on the integers that actually appear (up to q^{1+o(1)}), repair the pair-balance inequality, correct r(m'), and compare properly with the authors' own [3]. But I would not cite it in its current form.\n\nRecommendation: send it to peer review, but the referee should be told to check the vacuity argument and the counting step first. With those fixed, the paper could become a reasonable contribution; without them, Theorem 1.2 collapses to the trivial coefficient.","headline":"The f-twist idea in Theorem 1.1 is a genuine small step, but Theorem 1.2 is vacuous as stated (the positivity hypothesis forces f≡1) and the proof has a false inequality, so the advertised Omega result for multiplicative coefficients is unsupported.","tokens_in":5750,"tokens_out":3461,"would_cite":false,"duration_ms":39536,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11L40","11M06"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims new Omega lower bounds for character sums twisted by multiplicative coefficients, but the main theorem's positivity condition forces those coefficients to be trivial.","keywords":["character sums","multiplicative coefficients","Omega results","resonance method","GCD sums","Dirichlet characters","large values","completely multiplicative functions"],"falsifier":"For any prime p and integer a, the condition gives Re(f(p)^a) ≥ c for all a; letting a vary forces f(p) = 1, so no non-constant completely multiplicative f with |f| = 1 can satisfy the hypothesis. To test the theorem's actual content, compute max_{χ ≠ χ_0} |Σ_{n≤N} χ(n)| for a prime q and N in [exp((log q)^{1/2+δ}), √q]; if the stated lower bound fails, the proof has an error.","tokens_in":4662,"feed_emoji":"","tokens_out":7323,"duration_ms":75595,"temperature":0.7,"pith_summary":"This paper aims to prove lower bounds (Omega results) for Dirichlet character sums twisted by a completely multiplicative coefficient f, summing f(n)χ(n) over n ≤ N, in the range exp((log q)^{1/2+δ}) ≤ N ≤ √q. The main theorem, Theorem 1.2, claims the lower bound sqrt(N) exp((√2+o(1)) sqrt(log(q/N) log_3(q/N) / log_2(q/N))) for the maximum over non-principal characters, under an added positivity condition on f. A sympathetic reader would care because such mixed sums connect character sums to multiplicative functions, and lower bounds in this range are rare. However, the positivity condition is so restrictive that it forces f identically 1, so the theorem's stated generality over non-trivial f is vacuous; the result survives only for trivial coefficients.","feed_headline":"Multiplicative-coefficient sum bound only covers trivial f","feed_subtitle":"The theorem's positivity condition forces f=1, so the result covers only ordinary character sums.","key_machinery":"The central object is the resonator R_χ = Σ_{m} r(m) f(m) χ(m), where r is a multiplicative function supported on smooth numbers. For Theorem 1.2, the proof relies on a sharp asymptotic for maximal GCD sums: max_{|M|=K} Σ_{m,n∈M} sqrt((m,n)/[m,n]) = K exp((2√2+o(1)) sqrt(log K log_3 K / log_2 K)). This identity is the engine that converts a lower bound on the number of congruence solutions into the exponential gain in the final estimate. The positivity condition Re(f(m) overline(f(n))) ≥ c ensures that the off-diagonal congruence terms contribute with the same sign, so the lower bound for the second moment follows.","core_discovery":"On its own terms, the paper establishes an Omega result for character sums by injecting the twist f directly into the resonator and using congruences to bound the second moment from below. The proof of Theorem 1.2 reduces the evaluation of the resonance sum to counting solutions of m'k ≡ n'l (mod q), separates the diagonal terms m'k = n'l, and uses the positivity of off-diagonal terms to discard them. The remaining GCD-sum lower bound yields the stated exponential factor. For Theorem 1.1, a classical resonance argument gives a bound in the shorter range where log N is of order sqrt(log q log_2 q).","pith_inferences":["The positivity condition Re(f(m) overline(f(n))) ≥ c for all m,n forces f(p) = 1 for every prime p (take m = p^a, n = 1), so Theorem 1.2's hypothesis is satisfied only by f ≡ 1; the advertised 'multiplicative coefficients' result therefore reduces to the trivial coefficient case.","One might salvage the theorem by weakening the condition to hold only on average, e.g., with a weight over m,n, which could still control the off-diagonal terms without forcing pointwise positivity.","Read as a pure character-sum result for f = 1, the lower bound could be tested numerically for primes q and N near q^{1/2}; a failure would indicate a gap in the GCD-sum argument."],"forward_implications":["In the special case f ≡ 1, Theorem 1.2 yields a new Omega lower bound for ordinary Dirichlet character sums in the range exp((log q)^{1/2+δ}) ≤ N ≤ √q.","Theorem 1.1 supplies a lower bound for mixed sums in the shorter range where log N = sqrt(log q log_2 q) · (log_2 q)^{O(1)}.","The resonance approach directly incorporates the coefficient f, so the same framework could be reused for other multiplicative coefficients if hypotheses permit.","The GCD-sum estimate forces the lower bound's exact exponential shape, linking the problem to the extremal behavior of lcm/gcd ratios."],"fun_headline_variants":["Large character sums: proof only works when f=1","New Omega bound restricted to trivial multiplicative f","Multiplicative coefficients? Theorem forces them to be 1","Character sum result hinges on positivity, so f=1","Omega result for sums with f=1 only"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The load-bearing assumption is that Re(f(m) overline(f(n))) ≥ c > 0 for all integers m,n; because this condition is so strong that it forces f(n) = 1 for every n, the theorem cannot apply to any non-trivial multiplicative coefficient and its advertised scope collapses.","fun_headline_variants_meta":{"raw":{"variants":["Large character sums: proof only works when f=1","New Omega bound restricted to trivial multiplicative f","Multiplicative coefficients? Theorem forces them to be 1","Character sum result hinges on positivity, so f=1","Omega result for sums with f=1 only"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000322,"raw_usage":{"total_tokens":1549,"prompt_tokens":545,"completion_tokens":1004,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":289,"completion_tokens_details":{"reasoning_tokens":927}},"tokens_in":289,"tokens_out":1004,"duration_ms":10776,"temperature":1.0,"reasoning_tokens":927,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-04T18:52:05.806185+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For any prime p and integer a, the condition gives Re(f(p)^a) ≥ c for all a; letting a vary forces f(p) = 1, so no non-constant completely multiplicative f with |f| = 1 can satisfy the hypothesis. To test the theorem's actual content, compute max_{χ ≠ χ_0} |Σ_{n≤N} χ(n)| for a prime q and N in [exp((log q)^{1/2+δ}), √q]; if the stated lower bound fails, the proof has an error.","supporting_citations":[],"review_version":1}