{"id":"193b8ae4-a148-4a89-a2ee-6d0b1520da25","arxiv_id":"1908.00972","paper_version":1,"verdict":"UNVERDICTED","confidence":"MODERATE","novelty_score":2.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper builds an interactive visualization of Arnold's proof that no radical formula can solve the general fifth-degree polynomial.","lead":"This paper describes a JavaScript and p5.js web app that animates Arnold's topological proof of Abel's theorem, showing why a general fifth-degree polynomial has no formula in radicals. It is an educational visualization of a long-established theorem, not a new mathematical result.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Claim 3.7's contradiction hinges on an unproved soluble-monodromy lemma for nested radicals; the text asserts that iterated commutators close all intermediate branches instead of proving it.","rationale":"The theorem itself is true and classical, and the visualization is a legitimate teaching aid. My concern is not with the mathematical statement but with the paper's written argument: Claim 3.7 is the only place where the universal impossibility is established, and its proof is a sequence of assertions rather than an induction. The reader's weakest-assumption call identifies the same gap, and I agree. I also note that the abstract's phrase 'our program shows' overstates what a fixed animation can establish, but that is secondary: even if the software is flawless, the written proof must contain the soluble-monodromy lemma. Since the reader already chose UNVERDICTED, this concern does not change the verdict; it reinforces it. A revised version that proves the lemma and describes how the program's path generation reflects it would move the paper toward acceptance as an expository artifact.","tokens_in":7859,"tokens_out":6621,"duration_ms":75285,"concrete_test":"Write out the missing induction in full: for an arbitrary expression E with N nested radicals, choose closed coefficient paths in the complement of the discriminant and of the zero loci of every intermediate analytic function, and prove that applying the (N+1)-fold iterated commutator returns every intermediate radical to its starting branch. Verify that each radical layer contributes only a cyclic permutation of its branches, so that each additional commutator level kills one layer. If this induction cannot be completed without extra hypotheses, Claim 3.7's contradiction fails; if it can, insert the lemma before Claim 3.7 and confirm that the software's path generator actually implements the corresponding construction for arbitrary expressions rather than a single hardcoded example.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Claim 3.7) reduces to the assertion that every finite expression built from analytic functions, field operations, and nested radicals has soluble monodromy. The proof never establishes this. Claim 3.3 proves only the single-radical case: if two closed coefficient loops induce powers of the same cyclic permutation on the values of an n-th root, their commutator is trivial. For a tower of N nested radicals one must prove by induction that the (N+1)-fold iterated commutator of carefully chosen loops restores every intermediate radical branch and hence the whole expression. Section 3.3 and §3.7 instead say 'by previous case' and 'we know' that such paths exist. The sentence 'Since S5 is not soluble, then we know that there exists continuous paths...' assumes the exact fact needed to turn non-solubility of S5 into a contradiction. Without that fact, a non-soluble permutation group on the roots does not by itself rule out a radical formula, because one must also prove that the radical formula's own monodromy cannot be non-soluble. This is the standard Arnold step, but it is neither proved nor given a precise citation in §3.7. The gap is load-bearing because the visualization animates a fixed set of paths; it cannot exhibit a contradiction for an arbitrary expression unless the soluble-monodromy lemma supplies the general path construction.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper describes a JavaScript/p5.js animation intended to visualize Arnold's topological proof of the Abel-Ruffini theorem. After sketching Riemann-surface and monodromy background in Section 2, the authors present a sequence of claims: analytic functions alone cannot solve the quadratic (Section 3.1); a commutator argument forces nested radicals for the cubic and higher degrees (Sections 3.2-3.3); the derived series of S4 accounts for the three levels of nesting in the quartic (Sections 3.4-3.5); and no finite expression built from analytic functions, field operations, and nested radicals can solve the general quintic, because closed coefficient paths can return the expression to its starting values while non-trivially permuting the roots (Claim 3.7 in Section 3.7). Section 4 documents the software implementation (Point, Path, Motion classes, Vieta's formulas, Complex.js). The mathematical content is the classical Arnold argument as presented in Alekseev's problem book [2]/[3]; the paper's contribution is the visualization and its expository framing rather than new mathematics.","tokens_in":8115,"tokens_out":13573,"duration_ms":132217,"significance":"The underlying theorem is classical and true, and the paper's pedagogical plan -- building from S2 to S5 via commutators and the derived series -- is a sound way to present Arnold's proof. The visualization artifact is a genuine strength: the GitHub repository [5] makes the animation reproducible, and the quadrant layout (roots, coefficients from Vieta, expression values, radical branches) gives a concrete picture of the path argument. If the proof texts are corrected and the load-bearing steps are located in the literature, this could be a useful teaching supplement for courses using Alekseev's problem book. As it stands, however, the paper's own proofs are sketches: Theorem 3.4 is stated for degree 2 but proved for five roots, and Claim 3.7 asserts rather than proves the decisive soluble-monodromy fact for nested radicals. The contribution is expository rather than research-level, which is appropriate for math.HO, but the exposition must be accurate at precisely the points where it claims to prove the theorem.","major_comments":[{"comment":"Theorem 3.4 is stated for a monic polynomial in Poly2(C), but the statement is false in that degree: with k=1, n1=2, f1(a0,a1)=a1^2-4a0, and g(w)=(-a1+w)/2, Eq. (3.2) is exactly the quadratic formula, an analytic g applied to a single radical of an analytic f1. The proof is also internally inconsistent with the statement: it fixes five roots z1,...,z5 and loops β̂=(123), γ̂=(345), which cannot arise for a degree-2 polynomial. The proof is evidently the degree-5 argument; the theorem should be restated for Poly5(C) (or degree at least 5), and the text should not claim that quadratic roots are inexpressible in the form (3.2), since the quadratic formula refutes that.","section":"§3.2, Theorem 3.4 and Eq. (3.2)"},{"comment":"The proof's decisive sentence -- 'Since S5 is not soluble, then we know that there exists continuous paths such that their commutator induces a non-trivial permutation of the roots, while both the coefficients of p(z) and fi, for 1≤i≤k, follow a closed loop' -- presupposes the soluble-monodromy lemma for nested radicals: for every finite expression built from analytic functions, field operations, and N levels of nested radicals, there exist closed coefficient paths whose (N+1)-fold iterated commutator restores every intermediate radical branch and hence the whole expression. The manuscript proves this only for a single radical: Claim 3.3 handles one level, and even there the justification ('both β and γ define a cyclic permutation of the 5 radicals which commute') is compressed, since arbitrary distinct 5-cycles need not commute; the real reason is that the monodromy of w = z^{1/5} is an abelian group of multiplications by roots of unity. Neither Theorem 3.4 ('by previous case') nor Claim 3.7 ('we know') supplies the induction over nesting depth. Without that induction, non-solubility of S5 is not by itself a contradiction to the existence of a radical formula, because one must also know that the formula's own monodromy cannot be non-soluble. This is the standard Arnold step; the paper should either prove the induction (each added radical level contributes an abelian cyclic factor to the monodromy, so the derived length is bounded by the nesting depth) or cite the specific problem in Alekseev [2]/[3] where it is proved. As written, the step is a restatement of the desired contradiction rather than a derivation of it.","section":"§3.7, Claim 3.7 (and §3.3, Claim 3.3)"},{"comment":"The abstract claims that 'given any expression that uses analytic functions and radicals one can always construct closed paths' with the stated behavior, and §3.7 says the visualization 'demonstrates the impossibility' of a quintic formula. A finite animation runs specific loops for specific root configurations; it cannot, by itself, establish a universal statement over all expressions. The paper should explicitly separate (i) what the program illustrates (a concrete instance of the path argument) from (ii) what is proved in the text and (iii) what is imported from the literature. This distinction matters because Claims 3.2, 3.5, and 3.7 are each labeled 'Proof.', while §2 itself admits that the Galois-theoretic arguments behind Arnold's proof are omitted; the §3.7 proof then relies on exactly that omitted content.","section":"Abstract and §3.7"}],"minor_comments":[{"comment":"'Gorup theory' should read 'group theory', and the theorem should be referred to consistently as the Abel-Ruffini theorem rather than 'Abel's Impossibility Theorem'.","section":"§1"},{"comment":"'it's' should be 'its' in the abstract, in §2, and in §3.1.","section":"Abstract, §2, §3.1"},{"comment":"References [2] and [3] are the same book (Alekseev, Abel's Theorem in Problems and Solutions); they should be consolidated into one entry, and the text should cite specific problem or section numbers for the monodromy-of-radicals step.","section":"References"},{"comment":"The displayed notation 'zt↦→z2πint' is garbled, and the sentence about t = m/n should be rewritten with proper formatting so that the argument of the exponential is unambiguous.","section":"§2"},{"comment":"The superscript footnote marker in 'Poly2(C)1' is a leftover LaTeX reference; the footnote about the screen shot should be attached to the figure itself.","section":"§3.1"},{"comment":"The counts '12 non-trivial permutations of commutators ... 4 non-trivial ... trivial' are an informal description of the derived series S4 > A4 > V4 > {e}; since the count '4' includes the identity, the text should state the group-theoretic statement explicitly.","section":"§3.5"},{"comment":"It is unclear how the program 'calculates' the solutions from the coefficients without solving the quintic; clarify that the animation prescribes the root paths and computes coefficients via Vieta, then plots the branches of the displayed expression rather than numerically solving the polynomial.","section":"§4, item (4)"},{"comment":"Only the GitHub repository [5] is given for the artifact; a live URL for the running animation and a note on the tested browsers/versions would improve reproducibility and allow a reader to verify the central visual claim.","section":"References and §4"}],"recommendation":"major_revision","confidential_remarks":"The paper's contribution is a teaching visualization rather than new mathematics, which is appropriate for math.HO. My main concern beyond the technical points in the report is that the manuscript reads like an undergraduate project write-up: the Theorem 3.4 statement/proof mismatch and the duplicate references suggest the text was not carefully proofread before posting. The gap in Claim 3.7 is repairable by adding the induction lemma or by citing the corresponding problems in Alekseev's book, and I would ask the authors to make the division between 'proved here' and 'cited' explicit. If the authors do not fix Theorem 3.4 and the Claim 3.7 gap, I would not recommend publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know: this is an expository preprint plus a JavaScript animation. The theorem is Abel's, the proof is Arnold's, and the paper's own contribution is the visualization, not new mathematics. The visualization is genuinely useful as a teaching aid; the paper is not rigorous enough to count as a proof.\n\nWhat is new is the browser app: it walks through quadratics, cubics, quartics, and then the quintic, animating the commutator construction that underlies Arnold's proof. That is a real service. I can imagine assigning this alongside Alekseev's book to help students see why the roots get permuted while radical expressions come back unchanged.\n\nThe outline of the argument is correct, and the paper is honest about its debt to Arnold. The code is on GitHub, which is good. But the central proof has a load-bearing hole. Claim 3.7 assumes, without proof, that a finite expression made of analytic functions and nested radicals has a soluble monodromy group. That is the fact that turns the non-solubility of S5 into a contradiction, and the text simply says \"Since S5 is not soluble, then we know that there exists continuous paths...\" That's the exact step the reader must be shown. The stress-test note is right about this; it is not a nitpick.\n\nThere are smaller problems. Theorem 3.4 is stated for degree two but the proof fixes five roots; that is a copy-paste error that should have been caught. The abstract overclaims: a finite animation cannot \"show\" that no formula exists. What it can show is a particular set of paths doing the expected permutation, which is an illustration of the known proof, not a fresh demonstration.\n\nNone of this changes the theorem, which is classical and correct. The flaws are all in the exposition and the depth of the proof sketch. For an undergraduate project this is solid; for a research paper it would not hold up.\n\nWho is this for? Teachers of Galois theory or complex analysis might use the visualization in class. Someone looking for a new mathematical result should not bother. I would not cite it in my own work, but I would happily point an undergraduate to it as a visual companion to Arnold's book.\n\nIf this crosses an editor's desk at a teaching-oriented journal, it deserves peer review, with the expectation that the authors tighten the proof sketch, fix the mismatch, and soften the claims. A research journal should desk-reject. On arXiv, it is fine as a pedagogical artifact, but the abstract is too ambitious.","headline":"A well-intentioned undergraduate visualization of Arnold's proof; useful for teaching, but the paper's claims outrun what the animation and the proof sketch actually establish.","tokens_in":8633,"tokens_out":3854,"would_cite":false,"duration_ms":39558,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["12D10","12F10","20B35"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper reports an interactive visualization that makes the impossibility of solving the general quintic by radicals visible through commutator loops.","keywords":["quintic equation","radicals","monodromy","symmetric group","visual proof","commutator loops","elementary symmetric relations","solubility"],"falsifier":"Run the program with a concrete candidate expression carrying more nested radicals than the displayed levels and look for one closed coefficient path along which the roots permute non-trivially while the candidate's output returns exactly to its starting position. More directly, give one finite expression in analytic functions, field operations, and radicals whose monodromy group is not solvable, since the proof of Claim 3.7 silently assumes none exists.","tokens_in":7656,"feed_emoji":"🔄","tokens_out":7864,"duration_ms":75991,"temperature":0.7,"pith_summary":"The paper presents an interactive visualization of the classical theorem that no expression built from analytic functions, finite field operations, and finitely many nested radicals can recover the roots of a general fifth-degree polynomial from its coefficients. The program animates the standard topological proof: move five roots along loops that leave the coefficients unchanged, apply the commutator of two such loops, and watch a non-trivial root permutation appear while every radical branch returns to its starting value. The same screen walks through quadratics, cubics, and quartics to show how many levels of nested radicals each case requires, then shows the quintic defeating all finite nesting levels. If the demonstration is faithful, it turns the non-existence of a quintic formula into something a user can watch happen.","feed_headline":"No radical formula can solve the quintic; the loops show why","feed_subtitle":"A commutator of coefficient loops returns every analytic-radical expression to start while swapping the roots.","key_machinery":"The load-bearing mechanism is the commutator of closed coefficient loops, applied once for each level of nested radicals. A radical sends a closed coefficient loop to a cyclic permutation of its branches, and a commutator $[\\beta,\\gamma]=\\beta\\gamma\\beta^{-1}\\gamma^{-1}$ makes those cyclic permutations cancel, returning the radical to its starting branch while the roots themselves are permuted by the commutator of the two root cycles. Iterating this at successive nesting levels gives exactly the solvability condition of the monodromy group: a finite expression of analytic functions and radicals has a group of possible root-label changes whose commutator series reaches the identity. The visualization turns that abstract group ladder into moving points on screen, with $S_5$ as the stage on which the ladder never reaches the bottom.","core_discovery":"The central claim is that the obstruction to solving the quintic by radicals can be exhibited as a loop-winding phenomenon. Starting with five distinct roots, the program uses the elementary symmetric relations between roots and coefficients to convert root motions into coefficient motions, then tracks the value of any candidate formula built from analytic functions, field operations, and nested radicals. For a carefully chosen commutator of coefficient loops, the roots undergo a non-trivial permutation while every analytic subexpression and every radical branch closes up, so the candidate formula returns to its starting value and fails to track the roots. The group-theoretic reason is that the monodromy group of a radical expression is solvable—after enough iterated commutators all branch choices close—whereas the symmetric group $S_5$ is not solvable, so no finite nesting depth can eliminate the obstruction. The same argument applies to every degree at least five.","pith_inferences":["Beyond the paper, the same loop-winding picture suggests a practical certificate: for any proposed finite expression in analytic functions and radicals, one could algorithmically search coefficient loops for a commutator that closes the expression while permuting roots, turning non-existence into a checkable animation.","The commutator-depth reading also predicts a natural grading on radical formulas by nesting level, with solvability of the monodromy group as the invariant; this could connect to circuit-depth lower bounds or complexity-theoretic versions of Galois theory.","The visualization could be extended to one-parameter families of higher-degree polynomials or to algebraic functions defined by equations, testing whether their monodromy groups are solvable and making the same argument operate outside the narrow polynomial setting."],"forward_implications":["No increase in the number or depth of nested radicals can rescue a formula for degree five.","The same commutator-loop construction rules out radical formulas for every degree $\\geq 5$, since $S_n$ contains a copy of $S_5$ and is therefore not solvable.","For degrees two, three, and four, the visualization makes visible why one level of radicals, nested radicals, and three nested levels respectively are needed.","A user can test any proposed formula: if its animated value follows the roots through the commutator loop, the formula is tracking a root; if it closes up while the roots permute, the formula fails."],"supporting_citations":[{"why":"States the impossibility theorem and provides the topological proof that the visualization follows.","marker":"[2]"},{"why":"Supplies the theorem formulation and the quintic equation used to generate the monodromy group in the demonstration.","marker":"[3]"},{"why":"Provides the complex-number computation used to update coefficients and roots in the animated frames.","marker":"[4]"},{"why":"Is the companion software artifact whose animated behavior the paper reports as the demonstration.","marker":"[5]"}],"fun_headline_variants":["Watch roots swap while formulas fail: Abel's theorem visualized","Quintic no-go: loops that fool every radical formula","Abel's impossibility: see why degree 5 has no radical solution","Radicals can't solve quintics: a visual proof of Abel's theorem","The loop that kills quintic formulas: Abel-Ruffini visualized"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument stands on the unproved premise that every finite expression in analytic functions and nested radicals has a monodromy group whose repeated commutators eventually collapse to the identity, so that a sufficiently iterated coefficient loop closes all radical branches; without that premise, the visual loop cannot force the claimed contradiction.","fun_headline_variants_meta":{"raw":{"variants":["Watch roots swap while formulas fail: Abel's theorem visualized","Quintic no-go: loops that fool every radical formula","Abel's impossibility: see why degree 5 has no radical solution","Radicals can't solve quintics: a visual proof of Abel's theorem","The loop that kills quintic formulas: Abel-Ruffini visualized"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001083,"raw_usage":{"total_tokens":4494,"prompt_tokens":879,"completion_tokens":3615,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":495,"completion_tokens_details":{"reasoning_tokens":3539}},"tokens_in":495,"tokens_out":3615,"duration_ms":24684,"temperature":1.0,"reasoning_tokens":3539,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:41:59.964998+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the program with a concrete candidate expression carrying more nested radicals than the displayed levels and look for one closed coefficient path along which the roots permute non-trivially while the candidate's output returns exactly to its starting position. More directly, give one finite expression in analytic functions, field operations, and radicals whose monodromy group is not solvable, since the proof of Claim 3.7 silently assumes none exists.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"States the impossibility theorem and provides the topological proof that the visualization follows."},{"cited_title":"Springer Science & Business Media, 2004","cited_arxiv_id":null,"evidence_quote":"Supplies the theorem formulation and the quintic equation used to generate the monodromy group in the demonstration."},{"cited_title":"infusion/complex.js, Apr 2019","cited_arxiv_id":null,"evidence_quote":"Provides the complex-number computation used to update coefficients and roots in the animated frames."},{"cited_title":"ryanostrander/abel-s-theorem, Apr 2019","cited_arxiv_id":null,"evidence_quote":"Is the companion software artifact whose animated behavior the paper reports as the demonstration."}],"review_version":1}