{"id":"9b51769d-866a-4e70-bf9a-e2cb722bcd77","arxiv_id":"2606.26846","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Semidefinite programming framework constructs time-varying Lyapunov densities for nonautonomous systems on hypertorus via hybrid polynomial Gram matrices and block decomposition, demonstrated on Kuramoto synchronization and robust stability.","lead":"The paper develops a semidefinite programming framework to construct time-varying Lyapunov densities for nonautonomous dynamical systems on a hypertorus using Gram matrices of hybrid polynomials, plus a block decomposition to limit density blow-up. A smart generalist might read it for new computational tools to certify stability in time-varying systems such as oscillator networks.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"SDP feasibility and validity of resulting densities depend on hybrid polynomial approximation quality for the time-varying vector field","rationale":"The reader's weakest_assumption correctly isolates the representation/approximation step as load-bearing; the block decomposition is an implementation detail whose correctness is secondary to whether the underlying polynomial model matches the dynamics closely enough for the Lyapunov inequality to transfer.","tokens_in":1637,"tokens_out":346,"duration_ms":32937,"concrete_test":"For the time-varying Kuramoto example, extract the exact trigonometric polynomial degree and coefficients used to represent the vector field in the SDP; recompute the divergence condition residual on a fine grid over the hypertorus and time interval; if the residual exceeds 1e-4 in L^infty norm anywhere outside the blow-up set, increase polynomial degree by 2 and re-solve the SDP to check whether the density and stability conclusion change.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The framework constructs time-varying Lyapunov densities via SDP on Gram matrices of hybrid (real-trigonometric) polynomials, with a block decomposition to localize blow-up. For the central claim to hold, the nonautonomous vector field (including its explicit time or parameter dependence) must be exactly representable or sufficiently well approximated by such polynomials so that a feasible SDP solution yields a density satisfying the required inequality (partial_t rho + div(f rho) <= 0 almost everywhere, with rho positive and integrable except at the prescribed blow-up set). The block decomposition must also preserve this inequality without hidden conservatism. This assumption is least secure for general parameter-varying systems, where approximation error is uncontrolled and could invalidate the certificate even if the SDP is feasible.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript presents a semidefinite programming (SDP) framework for constructing time-varying Lyapunov densities for nonautonomous dynamical systems on the hypertorus. It employs Gram matrix representations of hybrid (real-trigonometric) polynomials and introduces a novel block decomposition of these representations to localize the blow-up of the density to a prescribed set. The approach is applied to prove almost global synchronization in a time-varying Kuramoto model and robust almost-global stability for a parameter-varying nonautonomous system, with all examples computed via an open-source MATLAB implementation.","tokens_in":1773,"tokens_out":439,"duration_ms":19136,"significance":"If the SDP constructions are valid, the work supplies a computational certificate for almost-global stability properties in explicitly time-dependent systems on compact manifolds, extending Lyapunov density methods beyond autonomous cases. The emphasis on reproducibility through referenced open-source code strengthens the contribution for the dynamical systems community.","major_comments":[{"comment":"The central claim that feasible SDP solutions yield valid Lyapunov densities (satisfying δ_t \rho + div(f \rho) ≤ 0 a.e. with the required positivity and integrability properties) depends on the nonautonomous vector field being exactly representable or sufficiently approximated by hybrid polynomials; this assumption is load-bearing but its error control is not addressed in the formulation or applications.","section":"Abstract and applications"},{"comment":"The novel block decomposition is asserted to confine blow-up without introducing hidden conservatism in the inequality; however, no explicit verification is provided that the decomposed Gram matrices preserve the original semidefinite constraint and the divergence inequality after decomposition.","section":"Method description"}],"minor_comments":[{"comment":"Notation for the hypertorus and hybrid polynomial basis should be introduced with explicit definitions early in the text for clarity.","section":null},{"comment":"The open-source MATLAB implementation reference should include a direct link or repository identifier to facilitate immediate reproducibility.","section":null}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"Thank you for the careful review and constructive comments. We address each major point below with clarifications based on the manuscript content. Where the comments identify gaps in exposition, we indicate revisions that will be incorporated.","responses":[{"response":"The applications in the manuscript (time-varying Kuramoto synchronization and robust stability of the parameter-varying system) use vector fields that are exactly expressible as hybrid polynomials, so the SDP yields densities satisfying the inequality exactly with no approximation. We agree that error control for non-polynomial fields is not treated and lies outside the paper's scope. We will add a clarifying remark in the introduction and method section stating the exact-representation assumption.","revision_made":"yes","referee_comment":"[Abstract and applications] The central claim that feasible SDP solutions yield valid Lyapunov densities (satisfying δ_t ρ + div(f ρ) ≤ 0 a.e. with the required positivity and integrability properties) depends on the nonautonomous vector field being exactly representable or sufficiently approximated by hybrid polynomials; this assumption is load-bearing but its error control is not addressed in the formulation or applications."},{"response":"The block decomposition is defined algebraically so that each block inherits positive-semidefiniteness from the original Gram matrix and the divergence inequality is unchanged because the decomposition acts only on the support of the density without modifying the polynomial coefficients in the Lie derivative term. To address the request for explicit verification we will insert a short proposition (with proof) in the revised Section 3 confirming preservation of both the SDP constraint and the pointwise inequality.","revision_made":"yes","referee_comment":"[Method description] The novel block decomposition is asserted to confine blow-up without introducing hidden conservatism in the inequality; however, no explicit verification is provided that the decomposed Gram matrices preserve the original semidefinite constraint and the divergence inequality after decomposition."}],"tokens_in":1250,"tokens_out":409,"duration_ms":30085,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main takeaway is that this paper gives an SDP method to construct time-varying Lyapunov densities for nonautonomous systems on the hypertorus. It works with Gram representations of hybrid polynomials and adds a block decomposition to confine the blow-up to a chosen set. The authors then use it for almost global synchronization in a time-varying Kuramoto model and for robust stability in a parameter-varying system.\n\nThe block decomposition is the clearest new piece. It gives a way to localize the singularity without the density blowing up across the whole space, which is a practical step beyond standard Gram-matrix constructions for these densities. The two examples show the method handling explicit time dependence and parameter variation, and the open-source MATLAB code makes the computations checkable.\n\nThe setup is straightforward: when the vector field is representable or well approximated by the hybrid polynomials, a feasible SDP produces a density satisfying the required inequality. The paper frames the work as constructive rather than fitted, so there is no obvious circularity.\n\nThe main soft spot is the approximation step. If the nonautonomous vector field is not close enough to the polynomial class, the SDP solution may not actually certify the stability property even when it solves. That limitation is inherent to the approach and is not hidden, but it does mean the method is most reliable for systems that already fit the representation well.\n\nThis paper is for researchers in dynamical systems and control who need computational certificates for time-varying stability or synchronization on compact manifolds. A reader working on Lyapunov densities or SDP methods for nonautonomous systems would find the framework and examples useful.\n\nIt deserves a serious referee. The new decomposition, the SDP formulation, the applications, and the code together make it worth review.","headline":"SDP framework with block-decomposed Gram matrices builds time-varying Lyapunov densities on hypertori and applies it to Kuramoto synchronization plus a parameter-varying case.","tokens_in":2227,"tokens_out":420,"would_cite":false,"duration_ms":27349,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A semidefinite programming framework constructs time-varying Lyapunov densities for nonautonomous systems on the hypertorus using hybrid polynomial Gram matrices and block decomposition.","keywords":["Lyapunov density","semidefinite programming","nonautonomous systems","hypertorus","Gram matrix","Kuramoto model","almost global stability","hybrid polynomials"],"falsifier":"An explicit nonautonomous system on the hypertorus that possesses a time-varying Lyapunov density but for which the semidefinite program returns infeasible or produces a function that fails the Lyapunov inequality.","tokens_in":2539,"feed_emoji":"","tokens_out":679,"duration_ms":27506,"temperature":0.7,"pith_summary":"The paper develops a computational method to find time-varying Lyapunov densities for dynamical systems that evolve on a hypertorus and change explicitly with time. The method turns the search for such densities into a semidefinite program by representing hybrid real-trigonometric polynomials via Gram matrices. A new block decomposition of these matrices is introduced so that the density is allowed to become large only inside a chosen set. When the resulting program is feasible, the density certifies almost-global stability properties. The approach is demonstrated on a time-varying Kuramoto model and a parameter-varying system to show almost-global synchronization and robust stability.","feed_headline":"SDP framework builds time-varying Lyapunov densities on hypertorus","feed_subtitle":"Hybrid polynomial Gram matrices and block decomposition certify almost-global stability for nonautonomous systems such as the Kuramoto model","key_machinery":"Gram matrix representations of hybrid (real-trigonometric) polynomials together with a novel block decomposition that confines density blow-up to a prescribed set, turning Lyapunov density search into a feasible semidefinite program.","core_discovery":"We present a semidefinite programming framework for constructing time-varying Lyapunov densities for nonautonomous dynamical systems on a hypertorus. The formulation leverages Gram matrix representations of hybrid polynomials. In addition, we introduce a novel block decomposition of these Gram representations to confine the blow-up of the resulting density to a prescribed set. The results are then applied to establish the almost global synchronization of a time-varying Kuramoto model and the robust almost-global stability of a parameter-varying nonautonomous system.","pith_inferences":["The block decomposition technique may transfer to positivity certificates on other compact manifolds where trigonometric polynomials appear.","If hybrid polynomial approximations remain accurate, the same framework could certify stability for systems with periodic forcing on the circle or torus.","Engineering applications such as coupled oscillators with slowly varying parameters could be analyzed by solving the corresponding semidefinite programs numerically."],"forward_implications":["Almost global synchronization is established for the time-varying Kuramoto model on the hypertorus.","Robust almost-global stability holds for the examined parameter-varying nonautonomous system.","The method supplies a reproducible computational pipeline via the referenced open-source MATLAB implementation.","Feasibility of the semidefinite program directly yields a certificate of the desired stability property."],"fun_headline_variants":["SDP constructs time-varying Lyapunov densities on hypertorus","Hybrid polynomial Gram matrices build Lyapunov densities on hypertorus","Block decomposition confines Lyapunov density blow-up on hypertorus","SDP for almost global Kuramoto synchronization on hypertorus"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The dynamical systems of interest can be represented or approximated sufficiently well by hybrid polynomials so that the semidefinite programs remain feasible and the resulting densities are valid.","fun_headline_variants_meta":{"raw":{"variants":["SDP constructs time-varying Lyapunov densities on hypertorus","Hybrid polynomial Gram matrices build Lyapunov densities on hypertorus","Block decomposition confines Lyapunov density blow-up on hypertorus","SDP for almost global Kuramoto synchronization on hypertorus"]},"model":"grok-4.3","cost_usd":0.008972,"raw_usage":{"total_tokens":3989,"prompt_tokens":585,"num_sources_used":0,"completion_tokens":60,"cost_in_usd_ticks":89724500,"prompt_tokens_details":{"text_tokens":585,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":3344,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":585,"tokens_out":60,"duration_ms":42589,"temperature":1.0,"reasoning_tokens":3344,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T02:33:29.861881+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit nonautonomous system on the hypertorus that possesses a time-varying Lyapunov density but for which the semidefinite program returns infeasible or produces a function that fails the Lyapunov inequality.","supporting_citations":[],"review_version":1}