Harmonic analysis · additive combinatorics · cosine polynomials

Chowla’s Cosine Conjecture

Collaboration beta

For every finite set of positive integer frequencies, must the corresponding cosine sum have a negative value whose magnitude is at least a constant times the square root of the set size?

c>0A>0finite,K(A)=-minxaAcos(ax)c|A|
Erdős Problems, Problem 510Listed inBen Green's 100 Open Problems, Problem 81
Known results and sources
An ivory frequency comb and many fine cosine traces descend into one deep trough over a forest-green residue-cell field, then open into faint orbit circles; the route remains visibly unfinished.
Positive integer frequencies, a negative cosine trough, residue cells, and open orbit motifs give the Chowla workspace a mathematical identity without claiming that the conjectured square-root bound is proved.

Research problem

Exact mathematical statement

For a finite set A>0A\subset\mathbb Z_{>0}, let K(A)=-minxaAcos(ax)K(A)=-\min_x\sum_{a\in A}\cos(ax). Chowla’s conjecture asks whether there is one absolute constant c>0c>0 such that

c>0A>0finite,K(A)c|A|.\exists c>0\;\forall A\subset\mathbb Z_{>0}\text{ finite},\qquad K(A)\ge c\sqrt{|A|}.

the source reports substantial exact internal algebra and a narrowed proof route, but no complete proof or counterexample.

Problem infographic

Problem at a glance

A forest-green scientific plate begins with a finite comb of positive integer frequencies and overlays their cosine waves into one large sum curve. The curve crosses a zero line and reaches a marked negative trough whose depth is K(A); the central open question asks whether K(A) is always at least an absolute positive constant times the square root of the number of frequencies. Small insets note square-root-order examples and dilation invariance.
For a finite set A of positive integer frequencies, K(A) measures the depth of the most negative value of the cosine sum. Chowla’s conjecture asks whether K(A) is always bounded below by c√|A| for one absolute c>0. Square-root-order examples show that the exponent would be best possible; the general conjecture remains open.

Current mathematical picture

Where work on Chowla’s Cosine Conjecture stands

Open conjecture

This curated overview retains the current work's collision-to-quotient route, the revised-v10 oriented-fiber collapse of every nonempty near-transversal row to h=1, the exact cell-square, Fejer, entropy, prime-factor, and quotient-Haar charges, and the current large-loss arithmetic frontier. The centered-moment period module remains available only as an explicitly superseded consistency tool inside the pair branch. The source reports no complete proof or counterexample, and no claim here has proof, review, acceptance, or publication effect.

Strongest supported footholdEvery filtered odd pair stage receives a two-step payment

The second audit combines singleton-or-wrap with entropy to produce an exhaustive Fejer, Schur, or entropy alternative and parity-telescoping budgets.

Evidence posture · Reported result
Leading routeCollision-to-primitive-quotient route

Active collision energy is terminalized into teeth, then split between nonprimitive divisor ledgers and a popular primitive quotient row.

Route status · Active route
Useful failureNontrivial-period near-transversal branch

Eliminated as a current pair branch: oriented-fiber divisibility forces h=1 whenever the near-transversal row is nonempty. Nontrivial periods remain only in paid wrap branches.

Route status · Eliminated route
Main reductionBoundary paths split into Haar, long-path, and orbit branches

Exact boundary holes, filtered sections, spectral slack, and common orbit length give the current arithmetic trichotomy for odd rough rows.

Evidence posture · Reported reduction
Priority open bridgeNormalize quotient-Haar payments globally

Construct a scale-aware Bellman potential that makes local Delta_d payments and strict descendants telescope alongside entropy, Fejer, and Schur charges.

Task status · Prerequisites still open
Research-record correctionResearch-record correction

We corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Reader-facing record corrected; mathematics unchanged

Work mapped so far

Chowla’s Cosine Conjecture in numbers

5.9kretained lines of mathematical investigation5,898 in the current working snapshot
Argument development
5,146 · 87%
Explored or eliminated routes
98 · 2%
Computational analysis
48 · 1%
Open obligations
308 · 5%
Definitions and setup
298 · 5%
22selected mapped statements12routes investigated9reported milestones6open questions
How this is measured

This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.

Argument map and routes

How the current approaches connect

Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.

Visible working map

Research route map

26 selected steps

Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.

26 selected steps

Scroll horizontally to explore the route

Working route overview for Chowla’s Cosine ConjectureA selected map of recorded claims, active routes, useful failures, open questions, and their explicit relationships. Search, filter, zoom, or pan within this page.Chowla cosine conjecture — Depends on missing premiseChowla cosine conjectureLarge-loss trivial-period closure — Depends on missing premiseLarge-loss trivial-periodclosureCollision forcing to terminal teeth — Depends on missing premiseCollision forcing toterminal teethCurrent local row classification — Depends on missing premiseCurrent local rowclassificationExact quotient interface split — Depends on missing premiseExact quotient interfacesplitTwo-step Fejer-Schur-entropy trichotomy — Depends on missing premiseTwo-step Fejer-Schur-entropytrichotomyCentered-moment period divisibility — Depends on missing premiseCentered-moment perioddivisibilityEntropy drop under divisor filtering — Depends on missing premiseEntropy drop under divisorfilteringExact h=1 pair-row normal form — Depends on missing premiseExact h=1 pair-row normalformExact signed 2-orbit cycles — Depends on missing premiseExact signed 2-orbit cyclesGenuine boundary-hole count — Depends on missing premiseGenuine boundary-hole countLong paths force a filtered 3-section — Depends on missing premiseLong paths force a filtered3-sectionCollision-to-primitive-quotient route — activeCollision-to-primitive-quot‑ient routeLarge singleton/interface fringe — activeLarge singleton/interfacefringeSuperpopular perfect-cell row — activeSuperpopular perfect-cellrowLong signed-carry path — activeLong signed-carry pathCardinality-loss ledger as standalone termination — stoppedCardinality-loss ledger asstandalone terminationEntropy-only closure of arbitrary large-loss rows — stoppedEntropy-only closure ofarbitrary large-loss rowsUncorrected odd signed-cell theorem at even modulus — stoppedUncorrected odd signed-celltheorem at even modulusCharging Gamma at the first descendant — stoppedCharging Gamma at the firstdescendantClose the large singleton/interface fringe — OpenClose the largesingleton/interface fringeClose superpopular perfect-cell rows — OpenClose superpopularperfect-cell rowsClose long signed-carry paths — OpenClose long signed-carrypathsClose complete signed 2-orbits — OpenClose complete signed2-orbitsNormalize quotient-Haar payments globally — OpenNormalize quotient-Haarpayments globallyTerminate even and small-prime descents — OpenTerminate even andsmall-prime descents
Working claimActive routeOpen, active, or blocked questionUseful failure

Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.

Active routeCollision-to-primitive-quotient route

Active collision energy is terminalized into teeth, then split between nonprimitive divisor ledgers and a popular primitive quotient row.

Route status · Active route
Active routeLarge singleton/interface fringe

Active current route for exceptional rows where C is much larger than tooth mass W; it must retain aperiodic teeth and missing self-sums.

Route status · Active route
Active routeSuperpopular perfect-cell row

Active exceptional-row route combining signed-residue distinctness, boundary holes, Haar slack, long paths, and complete orbit cosets.

Route status · Active route
Active routeLong signed-carry path

Active arithmetic route using filtered 2-3 sections and the exact affine recurrence while preserving signs, carries, and missing self-sums.

Route status · Active route
Active routeComplete signed 2-orbit closure

Active arithmetic route on complete cosets of the signed subgroup generated by two, with common orbit length and affine lifts retained.

Route status · Active route
Active routeNormalized Haar-entropy Bellman potential

Active global route intended to combine entropy, density, quotient-Haar, Fejer, Schur, and strict-descendant payments at compatible scales.

Route status · Active route

Explored alternatives

Other routes

6 recorded
Eliminated routeNontrivial-period near-transversal branch

Eliminated as a current pair branch: oriented-fiber divisibility forces h=1 whenever the near-transversal row is nonempty. Nontrivial periods remain only in paid wrap branches.

Route status · Eliminated route
Narrowed routeCentered-moment period module

recorded as an exact consistency and non-pair external-wrap audit module, but explicitly superseded as the main route inside the near-transversal pair branch.

Route status · Narrowed route
Narrowed routeNormal retentive entropy chain

Closed in its stated regime: rows with W comparable to n/T and pair defect O(W) cannot persist while normalized density is unbounded.

Route status · Narrowed route
Browse 3 more explored routes
Narrowed routeTwo-step Fejer-Schur-entropy ledger

Every odd h=1 pair stage with a following filter is assigned to one of three explicit parity-telescoping charges.

Route status · Narrowed route
Useful but insufficientCardinality payment alone

Too weak as a termination proof; retained only as one exact account inside a larger Bellman argument.

Route status · Useful but insufficient
Useful but insufficientGeneric polynomial-loss additive reductions

Rejected for the square-root target because polynomial losses in E overwhelm the relevant 1/E densities.

Route status · Useful but insufficient

Route statements and reductions

Statements the next route can inspect and build on

Route statementCollision forcing to terminal teeth

Under an unbounded normalized-density counterexample regime, the inherited collision argument supplies on the order of n^2/E terminal teeth d<b with d,b,b+d in A and 2b+d outside A, then concentrates primitive tooth mass W on a quotient row or produces a nonprimitive divisor ledger.

Source-reported route statement · dependencies incomplete
Route statementExact quotient interface split

For a complete primitive row d=hq, the quotient defect and external wrap satisfy one exact interface identity; substantial active or inactive wrap is assigned to existing telescoping payments, leaving the near-transversal inequality as the locally uncharged branch.

Source-reported route statement · dependencies incomplete
Route statementGenuine boundary-hole count

Small pair defect converts almost every low-occupancy signed-doubling boundary image into an exact quotient hole attached injectively to a missing self-sum 2b+d.

Source-reported route statement · dependencies incomplete
Route statementLong paths force a filtered 3-section

A sufficiently long no-wrap signed-doubling path in the odd h=1 branch forces a weighted occupied 3-section, a proper divisor descendant when 3 divides d, or an exact filtered zero.

Source-reported route statement · dependencies incomplete
Route statementQuotient-Haar payment

Low-occupancy boundary images and short signed-doubling paths are bounded by quotient spectral slack, which in turn is bounded by the ordinary quotient-Haar defect Delta_d.

Source-reported route statement · dependencies incomplete
Route statementExact signed 2-orbit cycles

Every directed cycle of perfect signed unit classes has the common length k_d=min{k>=1:2^k congruent to plus or minus 1 mod d} and is a complete coset of the signed subgroup generated by 2.

Source-reported route statement · dependencies incomplete
Route statementLarge-loss trivial-period closure

An exceptional h=1 row outside the normal retentive entropy regime must yield a square-root bound, a sharp quotient block, a summably controlled strict descendant, a no-wrap recurrence, a missing-self-sum payment, signed-carry closure, orbit closure, or normalized quotient-Haar payment.

Source-reported route statement · dependencies incomplete

More ways to contribute

Open questions

Additional prepared tasks for exploring this research frontier.

6 featured tasks
01
Normalize quotient-Haar payments globally

Construct a scale-aware Bellman potential that makes local Delta_d payments and strict descendants telescope alongside entropy, Fejer, and Schur charges.

Suggested move: Test a potential combining log(n/T^2), normalized entropy, scale-weighted quotient defects, and normalized Schur-triple mass.
Prerequisites still open
02
Close superpopular perfect-cell rows

When TW/n is large and pair defect is moderate, combine boundary holes, Haar slack, filtered long paths, complete signed 2-orbits, and exact missing self-sums to obtain a one-row contradiction or strict descendant.

Suggested move: Optimize the path cutoff against spectral slack while keeping all perfect-cell multiplicities and missing values.
Prerequisites still open
03
Close the large singleton/interface fringe

When C is much larger than W, use the aperiodic lift, terminal teeth, missing self-sums, and quotient positivity to force a sharp quotient block, no-wrap interval, strict descendant, or Bellman-paid module.

Suggested move: Separate occupancy-one signed classes from structurally malformed cells and retain their exact missing self-sums through the quotient argument.
Prerequisites still open
04
Close complete signed 2-orbits

Use common orbit length, full orbit cosets, affine lifts, missing values 2b+d, and singleton fringe to force a common divisor, arithmetic spine, short quotient block, or autocorrelation contradiction.

Suggested move: Classify the complete orbit cosets together with their actual lifted missing self-sums and affine carries.
Prerequisites still open
05
Close long signed-carry paths

Extend the filtered 2-3 section output into a lossless recurrence, arithmetic relation, internal interval, or proper divisor descendant while preserving edge signs, affine carries, multiplicity, and missing self-sums.

Suggested move: Iterate the exact g=3 filter only while no-wrap hypotheses remain valid and record the signed affine state at every stage.
Prerequisites still open
06
Terminate even and small-prime descents

Integrate the exact almost-half-retentive and small-prime descendant bounds into a global descent that consumes prime factors, reduces maximum frequency, and preserves a uniform square-root constant.

Suggested move: Track consumed prime factors and maximum-frequency reduction together with entropy, Fejer, and quotient-defect charges.
Prerequisites still open

Sourced mathematical context

The known mathematical landscape

Context collected Aug 2, 2026
Current statusOpen problem

For K(n), the least possible magnitude of the negative minimum of an n-frequency cosine sum, the conjectural and construction-sharp order is sqrt(n). The current bounds are n^(1/5-o(1)) << K(n) << n^(1/2), so the exponent gap remains open.

[2][10]
External progress

What the literature has established

Selected external milestones in reverse chronological order, with their evidence posture.

  1. PreprintBedert's v3 improved the lower-bound exponent to 1/5-o(1).[2]
  2. PreprintJin, Milojević, Tomon, and Zhang obtained an independent polynomial lower bound through spectral graph theory.[1]
  3. Peer reviewedSanders proved structural results for symmetric subsets of discrete abelian groups and a polynomial bound in a restricted dense-frequency regime.[4]
  4. Peer reviewedRuzsa proved K(n) >= exp(c sqrt(log n)), the record lower bound until 2025.[6]
14 cited sources4 related results or reductionsReferences

Mathematical neighborhood

Related results and reusable starting points

Current focusChowla's cosine problem
Equivalent formulationnegative Fourier coefficients of symmetric integer sets

After symmetrizing A to A union -A, the cosine sum is the Fourier transform of the indicator up to normalization and a factor of two.

[3]
Related problemLittlewood's L1 problem

Lower bounds from Littlewood's L1 problem supplied the early logarithmic progress on Chowla's problem.

[3]
Related problemSidon difference sets

Sidon-set difference constructions give the O(sqrt(n)) upper bound and show that the conjectured exponent 1/2 is best possible.

[10]
Dependency or reductionspectral graph theory

The 2025 Jin-Milojević-Tomon-Zhang route derives a polynomial bound from structural theorems for graphs with constrained least eigenvalue.

[1]

Formal and computational footholds

Existing statements, libraries, computations, and datasets that can shorten the next serious attempt.

  • formal statement · statement onlyLean 4

    Google DeepMind's Formal Conjectures repository contains an Erdős Problem 510 statement and bound variants, but not checked proofs; the recorded progress exponent is older than Bedert v3.

    [8]
  • computation · source linked; not reproduced by ProofAtlasExact Small Cases

    Mercer determined the exact extremal values for two and three frequencies; these finite cases do not resolve the asymptotic conjecture.

    [9]

Research-record corrections

What changed in the research record

These notes describe corrections to cited passages, highlighted tasks, or connections between claims. The mathematical claims and their status did not change.

Research-record correctionWe corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. We removed a duplicate or outdated task or route step. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details
Research-record correctionWe corrected the cited passages. We updated the highlighted open task or route. The mathematical claims and their status did not change.

Corrected the research recordCorrection note

Correction details

The initial argument structure appears separately. Uploads, model runs, and presentation changes do not count as mathematical updates.

How the route was assembled

Argument structure

These stages follow the mathematical order of the supplied argument.

10 mapped milestonesretained argument map

Browse all 10 mapped stages

  1. stage 1Collision forcing reaches a primitive quotient row
  2. stage 2External-interface split isolates near transversality
  3. stage 3Oriented fibers eliminate nontrivial near-transversal periods
  4. stage 4Exact h=1 normal form and prime descent
  5. stage 5Cell squares yield singleton-or-wrap payments
  6. stage 6Entropy closes the normal retentive regime
  7. stage 7Odd rough rows split into Haar, paths, and orbits
  8. stage 8Centered-moment period work recorded as an archive
  9. stage 9Two-step ledger assigns every filtered odd pair stage
  10. stage 10Frontier refined to four exceptional arithmetic mechanisms
Collision forcing reaches a primitive quotient rowThe inherited route converts active-difference collisions into terminal teeth and then a primitive quotient row or a nonprimitive divisor ledger.

Mapped research milestoneInitial research sequence

Research stage 1
External-interface split isolates near transversalityThe exact quotient interface assigns substantial wrap to existing telescoping payments and leaves the near-transversal branch.

Mapped research milestoneInitial research sequence

Research stage 2
Oriented fibers eliminate nontrivial near-transversal periodsDouble-root fiber divisibility forces h to divide every reduced occupancy, so every nonempty near-transversal pair row has h=1.

Mapped research milestoneInitial research sequence

Research stage 3
Exact h=1 normal form and prime descentThe surviving pair row gains an exact loss identity, many perfect cells, and quantitative retained-descendant bounds for every prime divisor of d.

Mapped research milestoneInitial research sequence

Research stage 4
Cell squares yield singleton-or-wrap paymentsThe odd h=1 layer decomposes into signed cell squares and, after a required next filter, gives a constant Fejer charge or persistent external wrap.

Mapped research milestoneInitial research sequence

Research stage 5
Entropy closes the normal retentive regimeQuantitative entropy drops rule out repeated h=1 rows with W comparable to n/T and pair defect O(W) at unbounded normalized density.

Mapped research milestoneInitial research sequence

Research stage 6
Odd rough rows split into Haar, paths, and orbitsBoundary holes, spectral slack, filtered sections, and exact cycle arithmetic reduce odd rough rows to quotient-Haar payment, a long signed-carry path, or complete signed 2-orbits.

Mapped research milestoneInitial research sequence

Research stage 7
Centered-moment period work recorded as an archiveThe second audit restores the exact centered-moment module but keeps its near-transversal h>1 use superseded by the stronger oriented-fiber collapse.

Mapped research milestoneInitial research sequence

Research stage 8
Two-step ledger assigns every filtered odd pair stageThe second audit combines singleton-or-wrap with entropy so every eligible odd pair stage pays through Fejer, Schur triples, or entropy.

Mapped research milestoneInitial research sequence

Research stage 9
Frontier refined to four exceptional arithmetic mechanismsThe current first bridge is reduced to the singleton fringe, superpopular cells, long signed-carry paths, and complete signed 2-orbits, with even and rough descendants integrated into one Bellman potential.

Mapped research milestoneInitial research sequence

Research stage 10

Detailed research inventory

Claims, milestones, and routes in the current map

This view highlights the mathematical statements most useful for following the current route.

20 standing statements2 proposed statements9 mathematical milestones6 open questions3 narrowed routes4 conditional results
Statements by mathematical role22 selected mapped statements
  • theorem candidate2 of 222
  • negative result3 of 223
  • reduction3 of 223
  • equivalence1 of 221
  • lemma13 of 2213
Selected mathematical clusters7 mathematical clusters
Conjecture and public mathematical boundaryThe exact square-root conjecture, the literature gap recorded in the current work, and the explicit statement that no proof or counterexample is claimed.2 displayed rows
  • retained route statementChowla cosine conjecture
  • retained route statementPublished exponent gap remains open
Collision, teeth, and quotient interfaceThe inherited conditional reduction from sharp collision energy to terminal teeth, primitive quotient rows, and the exact external-interface split.5 displayed rows · 1 route included
  • retained route statementCollision forcing to terminal teethconditional
  • retained route statementExact quotient interface splitintermediate
  • Recorded relationshipThe retained proof program assumes an unbounded normalized-density counterexample regime and applies active-difference collision forcing and terminalization.reduces to · reported by source
  • Recorded relationshipTerminal teeth either feed a divisor ledger or concentrate on a popular primitive quotient row where the external-interface split applies.reduces to · reported by source
  • Active routeCollision-to-primitive-quotient routeActive collision energy is terminalized into teeth, then split between nonprimitive divisor ledgers and a popular primitive quotient row.
Oriented fibers and period supersessionThe decisive double-root and divisibility chain, the h=1 collapse, and the centered-moment module retained only for its narrowed audit role.9 displayed rows · 2 routes included
  • retained route statementOriented-fiber double rootsintermediate
  • retained route statementTermwise period divisibilityintermediate
  • retained route statementNontrivial near-transversal periods excludedintermediate
  • retained route statementCentered-moment period divisibilityintermediate
  • DerivationEvaluate each fiber at w=1, identify its mass with h times the reduced occupancy, and use the double-root Dirichlet-kernel divisor to obtain divisibility by h.active reported
  • DerivationWhen h>1, every occupied class has occupancy at least h, so its collision contribution is at least (h-1)c_r; summing contradicts the near-transversal upper bound alpha C/h.active reported
  • ComputationPacket-level second audit of the oriented-fiber phase and derivative argument, divisor arithmetic, cell-square factors, two-step charges, and the expanded exact-period certificate fields.The source reports the h=1 collapse, strengthened square-divisor consequences, restored centered-moment consistency module, reciprocal-loss ledger, and two-step Fejer-Schur-entropy trichotomy. this page did not independently rerun a checker or formalize those derivations. · reported unreproduced
  • Eliminated routeNontrivial-period near-transversal branchEliminated as a current pair branch: oriented-fiber divisibility forces h=1 whenever the near-transversal row is nonempty. Nontrivial periods remain only in paid wrap branches.
  • Narrowed routeCentered-moment period modulerecorded as an exact consistency and non-pair external-wrap audit module, but explicitly superseded as the main route inside the near-transversal pair branch.
Trivial-period pair and cell algebraExact pair loss, prime-factor retention, signed cell squares, singleton extraction, and their stated scope restrictions.12 displayed rows · 2 routes included
  • retained route statementExact h=1 pair-row normal formintermediate
  • retained route statementPrime-factor retained descendantintermediate
  • retained route statementSigned cell-square decompositionintermediate
  • retained route statementSingleton-or-wrap identityintermediate
  • retained route statementTwo-color Fejer-atom budgetintermediate
  • DerivationPerfect-cell elements avoid every prime divisor of d; bounding the remaining unpaired elements and applying root filtering modulo p gives the retained-descendant inequality.active reported
  • DerivationA second root filter partitions each signed cell by residues: singleton groups give a constant descendant minorant, while nonsingletons contribute pairs that appear in the two-step external wrap.active reported
  • Useful failureUncorrected odd signed-cell theorem at even modulusreported failure
  • Useful failureCharging Gamma at the first descendantreported failure
  • Useful failureReplace external wrap by total multiples-of-d correlationreported failure
  • Narrowed routeTwo-step Fejer-Schur-entropy ledgerEvery odd h=1 pair stage with a following filter is assigned to one of three explicit parity-telescoping charges.
  • Useful but insufficientCardinality payment aloneToo weak as a termination proof; retained only as one exact account inside a larger Bellman argument.
Entropy, Fejer, Schur, and Haar ledgersThe globally budgeted normal-retentive and two-step payments, together with the still-unfinished scale normalization of quotient-Haar slack.13 displayed rows · 3 routes included
  • retained route statementEntropy drop under divisor filteringintermediate
  • retained route statementNormal retentive chains cannot persistconditional
  • retained route statementTwo-step Fejer-Schur-entropy trichotomyintermediate
  • retained route statementQuotient-Haar paymentintermediate
  • DerivationThe lower loss bound gives a per-stage entropy charge, the upper loss bound controls logarithmic density descent, and comparison with the entropy upper budget bounds the starting density.active reported
  • DerivationIf Gamma is below one half, the singleton-or-wrap inequality leaves at least half the first loss as two-step wrap; a large active share pays Schur triples and a small active share activates the entropy bound.active reported
  • Useful failureCardinality-loss ledger as standalone terminationreported failure
  • Useful failureEntropy-only closure of arbitrary large-loss rowsreported failure
  • Useful failureTreat local quotient-Haar slack as a completed global paymentreported failure
  • Research targetNormalize quotient-Haar payments globallyopen
  • Narrowed routeNormal retentive entropy chainClosed in its stated regime: rows with W comparable to n/T and pair defect O(W) cannot persist while normalized density is unbounded.
  • Narrowed routeTwo-step Fejer-Schur-entropy ledgerEvery odd h=1 pair stage with a following filter is assigned to one of three explicit parity-telescoping charges.
  • Active routeNormalized Haar-entropy Bellman potentialActive global route intended to combine entropy, density, quotient-Haar, Fejer, Schur, and strict-descendant payments at compatible scales.
Boundary holes, signed paths, and complete orbitsThe exact quotient-hole, filtered-section, spectral, affine-carry, and common-orbit structure retained for the rough odd branch.10 displayed rows · 2 routes included
  • retained route statementGenuine boundary-hole countintermediate
  • retained route statementLong paths force a filtered 3-sectionintermediate
  • retained route statementQuotient-Haar paymentintermediate
  • retained route statementExact signed 2-orbit cyclesintermediate
  • DerivationParseval bounds signed-doubling occupancy mismatches by Sigma_d, and the nonnegative quotient root values convert Sigma_d to the ordinary Haar defect Delta_d.active reported
  • Useful failureGeneric boundary, path, or cycle counting after discarding arithmetic labelsreported failure
  • Research targetClose long signed-carry pathsopen
  • Research targetClose complete signed 2-orbitsopen
  • Active routeLong signed-carry pathActive arithmetic route using filtered 2-3 sections and the exact affine recurrence while preserving signs, carries, and missing self-sums.
  • Active routeComplete signed 2-orbit closureActive arithmetic route on complete cosets of the signed subgroup generated by two, with common orbit length and affine lifts retained.
Current exceptional-row frontierThe four first unresolved mechanisms, even and small-prime termination, the shared large-loss theorem, and source-explicit methods that must not be revived.15 displayed rows · 6 routes included
  • retained route statementCurrent local row classificationconditional
  • retained route statementLarge-loss trivial-period closureconditional
  • Research targetClose the large singleton/interface fringeopen
  • Research targetClose superpopular perfect-cell rowsopen
  • Research targetClose long signed-carry pathsopen
  • Research targetClose complete signed 2-orbitsopen
  • Research targetNormalize quotient-Haar payments globallyopen
  • Research targetTerminate even and small-prime descentsopen
  • Useful failureGeneric polynomial-loss additive combinatoricsreported failure
  • Active routeLarge singleton/interface fringeActive current route for exceptional rows where C is much larger than tooth mass W; it must retain aperiodic teeth and missing self-sums.
  • Active routeSuperpopular perfect-cell rowActive exceptional-row route combining signed-residue distinctness, boundary holes, Haar slack, long paths, and complete orbit cosets.
  • Active routeLong signed-carry pathActive arithmetic route using filtered 2-3 sections and the exact affine recurrence while preserving signs, carries, and missing self-sums.
  • Active routeComplete signed 2-orbit closureActive arithmetic route on complete cosets of the signed subgroup generated by two, with common orbit length and affine lifts retained.
  • Active routeNormalized Haar-entropy Bellman potentialActive global route intended to combine entropy, density, quotient-Haar, Fejer, Schur, and strict-descendant payments at compatible scales.
  • Useful but insufficientGeneric polynomial-loss additive reductionsRejected for the square-root target because polynomial losses in E overwhelm the relevant 1/E densities.
How to interpret these counts

A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.

Research outlook

Conditions that would advance the current route

Priority open bridgeConstruct a scale-aware Bellman potential that makes local Delta_d payments and strict descendants telescope alongside entropy, Fejer, and Schur charges.

3 approaches have already been tested and narrowed. The task above is the current priority within the larger open route.

Evidence needed nextConcrete conditions for progress

A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.

  • Prove every local Haar payment or retained descendant decreases one common bounded potential at the popular-row scale.

Continue the mathematics

Contribute

ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.

Read-only beta · actions unavailable
Prepared starting pointNormalize quotient-Haar payments globally

Chowla’s Cosine Conjecture · ready to start

Mathematical updatesFollow this problem

Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.

Research contextPrepared context for any AI agent

For every finite set of positive integer frequencies, must the corresponding cosine sum have a negative value whose magnitude is at least a constant times the square root of the set size?

  • Exact question and boundaries
  • Current routes and known obstacles
  • What a useful result should report
Return mathematical workReturn what you or your agent found

A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.

Proof attempt or partial resultSupporting notes or data
Hosted agentRun this task with a hosted agent

A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.

Your own AI agentConnect an outside research agent

Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.

Sources and references14 cited works · next context review by Nov 2, 2026

The mathematical context was checked on Aug 2, 2026. Status can be refreshed sooner after a material result or claim.

  1. 1
  2. 2
    Polynomial bounds for the Chowla Cosine Problempreprint · accessed Aug 2, 2026
  3. 3
  4. 4
    Chowla's cosine problempeer reviewed result · accessed Aug 2, 2026
  5. 5
    Some Applications of a Method of A. Selbergoriginal source · accessed Aug 2, 2026
  6. 6
    Negative values of cosine sumspeer reviewed result · accessed Aug 2, 2026
  7. 7
    Sur le minimum d'une somme de cosinusauthoritative webpage · accessed Aug 2, 2026
  8. 8
  9. 9
    The Minimum of a Cosine Sumauthoritative webpage · accessed Aug 2, 2026
  10. 10
    100 Open Problemsauthoritative webpage · accessed Aug 2, 2026
  11. 11
    Erdős Problems, Problem 510maintained problem list · accessed Aug 2, 2026
  12. 12
    On the Cosine Problemauthoritative webpage · accessed Aug 2, 2026
  13. 13
    Open Problem Garden, three-star entrymaintained problem list · accessed Aug 2, 2026
  14. 14
    Chowla's Cosine Problemmaintained problem list · Epoch AI · accessed Aug 2, 2026

Important qualifications

  • The best bound changed on 2026-07-24. Public problem lists and the Formal Conjectures scaffold that still report exponents 1/7, 1/12, or Ruzsa's bound are stale relative to Bedert v3.
  • Do not conflate this problem with Chowla's Liouville-correlation conjecture, the Ankeny-Artin-Chowla conjecture, or the Chowla-Selberg formula.
  • Empty formalization or computation lists mean that none was verified in this scoped search, not that none exists.
  • FrontierMath membership is mutable and must be rechecked after source changelog updates; membership is not proof evidence or an importance score.

Continue exploring

Compare another research frontier

See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.

Explore all research workspaces

Expanded visual

Open original image