{"id":"33a73002-380b-45ff-a016-2581d87dc6cc","arxiv_id":"2411.18766","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Kalman rank condition is necessary and sufficient for arbitrarily fast steering of invertible rearrangements of identical linear systems, but no continuous universal feedback law exists.","lead":"This paper proves that a common time-varying linear feedback law can steer a collection of identical linear systems from any initial arrangement to any target arrangement that differs by an invertible map, and that it can do so in arbitrarily short time. It settles a question Brockett left open and shows why no continuous universal feedback formula can exist for such steering.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proof depends on an unproved pole-placement assertion (existence of Kc with e^{(A+BKc)ts}=I); this is standard and true but should be stated as a lemma, and the 'trivial' necessity direction in Theorem 3 also needs a written argument.","rationale":"The paper's main constructive achievement—Kalman rank condition implies controllability and strong controllability of (5) on GL+(n,R)—is sound. The proof of Proposition 2 is correct: the similarity transformation via S_t^{-1/2} is valid, and the positivity argument for I+S_t^{1/2}(M-I)S_t^{1/2} follows from 0≺S_t⪯I and M≻0. The concatenation of motion primitives respects right-invariance, and the factorization into five SPD factors of W^{-1/2}Φfn W^{1/2} is justified by Ballantine's theorem. The topological obstruction in Proposition 4 is also correct. The two concerns that justify the reader's CONDITIONAL verdict are real: the unproved existence of Kc with e^{Ac ts}=I is load-bearing but true by standard pole placement, and the necessity implication (ii)⇒(i) is asserted without proof but can be established by the invariant-subspace/quotient argument. Both are repairable without changing the central claims, so I do not move the verdict. My read agrees with the reader's weakest_assumption, which correctly identified the pole-placement assertion as the most load-bearing unproved step.","tokens_in":14726,"tokens_out":28494,"duration_ms":258755,"concrete_test":"Write the missing lemma: for any controllable (A,B) and any ts>0, construct a real Kc by real pole placement with spectrum {0 or ±2πi k/ts} distinct and symmetric, and verify that e^{(A+BKc)ts}=I; if some controllable pair fails this, Theorems 1 and 3 collapse. For the necessity direction, take a noncontrollable (A,B), form R=span{B,AB,...,A^{n-1}B}, choose a basis with R as the first r coordinates, and exhibit an explicit Φfn in GL+(n,R) that cannot satisfy πΦfn=e^{Āt}π for any t≥0 (e.g., a nonzero lower-left block, or a bottom-right block not in {e^{Āt}:t>0}); if no such Φfn exists for some noncontrollable pair, the claimed equivalence is false.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Both Theorem 1 and Theorem 3 hinge on selecting, for arbitrary ts>0, a constant Kc such that e^{Ac ts}=I (Section 2.2 and the proofs of Theorems 1 and 3). This is asserted without proof. It is true: by controllability, one can place the spectrum of Ac at distinct purely imaginary eigenvalues in (2πi/ts)Z, symmetric about the real axis, making Ac diagonalizable over C with e^{Ac ts}=I. Yet because the entire motion-primitive stitching relies on it, the assertion should be proven or cited as a lemma; otherwise the construction is not fully verifiable from the text. Separately, Theorem 3's implications (iii)⇒(ii) and (ii)⇒(i) are dismissed as 'trivial'; (ii)⇒(i) is not trivial and needs an argument. If (A,B) is uncontrollable, the controllable subspace R is a proper A-invariant subspace containing Im(B); then for the quotient map π, one has π(Φ_t v)=e^{Āt}π(v) independent of K, so any reachable Φfn must satisfy πΦfn=e^{Āt}π for some t≥0 and must map R into itself. This excludes generic matrices in GL+(n,R). The necessity is true but omitted. Neither gap invalidates the constructive result (i)⇒(iii), but Theorem 3 as stated is not completely proved in the manuscript.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the right-invariant bilinear control system Phi_dot = (A + B K) Phi on GL^+(n,R), which models the collective steering of n identical linear agents by a broadcast time-varying feedback gain. The main results are Theorem 1, proving controllability under the Kalman rank condition, and Theorem 3, asserting the equivalence of the Kalman rank condition, controllability, and strong controllability in arbitrary finite time. The proof strategy repairs a norm-monotonicity lemma of Brockett through a symmetrized condition, decomposes the target matrix into symmetric positive definite factors, and concatenates motion primitives obtained from optimal open-loop segments that remain in GL^+(n,R). The paper also gives a topological obstruction to the existence of a universal feedback formula that is continuous in the terminal data and presents partial results for dynamics on orientation-preserving diffeomorphisms.","tokens_in":15038,"tokens_out":22254,"duration_ms":271563,"significance":"If the main result is correct, it gives a clean and usable characterization: for identical linear agents, the Kalman rank condition is exactly equivalent to strong controllability of the collective flow on GL^+(n,R), and steering can be done arbitrarily fast. The symmetrized condition in Proposition 1 is a genuine repair of Brockett's lemma, and the use of symmetric positive definite factors as motion primitives in Proposition 2 is elegant. The constructive proof is parameter-free and does not rely on numerical fitting. The topological obstruction in Section 4 is a useful complement. However, two load-bearing arguments are missing from the manuscript, and the illustrative example in Section 5 contains a demonstrably incorrect factor, so the paper cannot be accepted in its present form.","major_comments":[{"comment":"The existence of a constant gain K_c with e^{(A+BK_c)t_s} = I is asserted without proof, with the text saying only that this is guaranteed by the Kalman rank condition. Since every motion primitive in Theorems 1 and 3 depends on this assertion, it should be stated as a lemma and proved or cited. A proof is available by pole placement: assign the controllable pair a real spectrum consisting of distinct purely imaginary eigenvalues in (2 pi i / t_s) Z, so that A+BK_c is diagonalizable over C and e^{(A+BK_c)t_s} = I. As written, the construction is not fully verifiable from the text.","section":"Section 2.2, Eq. (14); proofs of Theorems 1 and 3"},{"comment":"The proof dismisses the implications (iii) => (ii) and (ii) => (i) as trivial. The first is indeed definitional, but the second is not. When the Kalman rank condition fails, the controllable subspace R is a proper A-invariant subspace containing Im B; writing pi for the quotient map onto R^n / R, every trajectory of (5) satisfies pi Phi_t = e^{bar A t} pi, where bar A is induced by A on the quotient. Hence any reachable Phi_fn must preserve R and satisfy this quotient condition for some t, which excludes generic elements of GL^+(n,R). This argument, or a citation, should be supplied before the equivalence is claimed.","section":"Theorem 3, proof"},{"comment":"The matrix S3 = (S2 S1^2 S2)^(-1/2) S2 S1 is the orthogonal polar factor of S2 S1 and is not symmetric positive definite in general. Consequently S3 S2 S1 has the same singular values as S2 S1, which are not all 1 for a 45-degree rotation, so the claimed factorization and the corresponding segment Phi_3 do not satisfy condition (19) as written. The illustrative example needs a corrected positive definite factorization or should be removed; this does not affect the main theorems, but as stated the example is erroneous.","section":"Section 5, definitions of S3 and the factorization S3 S2 S1 = Phi_fn"}],"minor_comments":[{"comment":"The displayed factor contains a typographical double plus sign, reading '(I + + ... )'; the extra '+' should be removed.","section":"Proof of Proposition 1, Eq. (18)"},{"comment":"The deduction from Lemma 2 should explicitly state that Lemma 2 is applied to the inverse Gramian W_{ts}^{-1}, or equivalently to the transposed increment (Phi_k - I)^T; otherwise the displayed bound on ||W_{ts}^{-1/2}(Phi_k - I) W_{ts}^{1/2}|| does not follow from the version of the lemma applied to W_{ts}.","section":"Proof of Theorem 1"},{"comment":"For odd n, the matrix -I does not belong to GL^+(n,R), so the sentence 'The case of odd n is not substantially different' should either be expanded with a valid terminal matrix or removed.","section":"Example 1"},{"comment":"The contraction assumption on psi should specify the norm with respect to which psi is a contraction, since the proof uses the Euclidean norm in the displayed estimate.","section":"Section 6, Proposition 6"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is within scope for a control theory journal, and the central constructive result appears sound and significant. The two missing arguments and the incorrect Section 5 factorization are repairable without changing the main conclusions, so I recommend major revision rather than rejection. I did not see a citation-pattern problem: the self-citation to [1] is used for context and does not support the main proofs."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper finishes Brockett's program by proving that the Kalman rank condition is necessary and sufficient for both controllability and strong controllability of the bilinear system on GL+(n,R). I think the main theorem is correct, but the proof as written is not fully there. Three things need fixing.\n\nWhat's genuinely new and good: Theorem 3's equivalence is new, and the use of Ballantine's five-factor SPD decomposition to get strong controllability is a clever and clean construction. The correction of Brockett's norm argument in Section 2.2 is careful and right—the symmetrized condition (16) does repair the flaw. The topological obstruction for continuous feedback laws in Section 4 is a nice addition.\n\nNow the soft spots, in order of severity. First, the existence of Kc with e^{Ac ts}=I is asserted without proof. It's true—pole placement can put the eigenvalues at distinct imaginary multiples of 2π/ts—but since the entire stitching construction rests on it, it should be stated as a lemma. Second, in Theorem 3 the implication (ii)=> (i) is dismissed as trivial. It isn't. One needs the invariant-subspace argument: the controllable subspace R is A-invariant and contains Im(B), so quotient dynamics are independent of K. Any reachable Φ must map R into itself and have quotient form e^{Āt}π, which excludes generic matrices. The claim is true but the argument is missing. Third, Theorem 1's proof misapplies Lemma 2. Lemma 2 bounds ||W^{1/2} Δ W^{-1/2}||, but Proposition 1's condition needs ||W^{-1/2} Φ_k W^{1/2} - I||. These two are similar, but not equal in norm, and the proof doesn't bridge that. This one is also fixable—you can choose the factorization so the correct norm is small—but as written it's a real gap.\n\nBottom line: the ideas are solid and the main result is almost certainly correct. The paper is for geometric control and ensemble-control people, and it deserves a serious referee. Send it out, but the referee should ask for the pole-placement lemma, a written necessity proof, and a corrected application of Lemma 2.","headline":"Completes Brockett's program with a likely-correct main theorem, but the written proof has three repairable gaps that need a referee's attention.","tokens_in":15559,"tokens_out":7340,"would_cite":true,"duration_ms":57963,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["93B05","93C15","22E15","49J15"],"pacs":[],"model":"deepseek-v4-flash","headline":"Under the Kalman rank condition, a single broadcast time-varying gain can steer any swarm of identical linear systems to any same-orientation configuration in any prescribed positive time; no continuous universal feedback formula exists.","keywords":["collective steering","common feedback gain","bilinear control system","strong controllability","general linear group","Kalman rank condition","topological obstruction","symmetric positive definite factorization"],"falsifier":"Compute, for the double-integrator pair with $t_s\\to0$, the five factors $\\Phi_k$ obtained from the symmetric positive definite factorization of a target such as the rotation matrix $e^{(\\pi/4)\\Omega}$, and check numerically that each segment $\\Phi_{k,t}^\\star=e^{A_c t}(I+W_t W_{t_s}^{-1}(\\Phi_k-I))$ stays nonsingular over $[0,t_s]$ and that $K_t=U_t^\\star(\\Phi_t^\\star)^{-1}+K_c$ is integrable. The theorem is falsified if any determinant crosses zero or any gain develops a non-integrable singularity; Section 5 presents this example as evidence that the construction works for every $t_s>0$.","tokens_in":14536,"feed_emoji":"🔄","tokens_out":16002,"duration_ms":132801,"temperature":0.7,"pith_summary":"Collective steering asks whether a swarm of n identical linear agents can be repositioned at will by broadcasting the same time-varying feedback gain to every agent. The paper's central claim is that the answer is yes exactly when the underlying pair (A,B) satisfies the classical Kalman rank condition: the induced right-invariant flow on the space of positive-determinant matrices is controllable and, more strongly, can be steered from the identity to any target in any prescribed positive time. The same result carries a negative counterpart: there is no universal feedback formula that is continuous in the target specification, because the state space is topologically non-contractible. If correct, the result reduces a seemingly geometric swarm-control problem to a textbook algebraic condition and gives an explicit five-segment construction for the control law.","feed_headline":"Any controllable swarm reaches any rearrangement arbitrarily fast","feed_subtitle":"A single broadcast time-varying gain suffices; only the topology of the state space blocks a continuous formula.","key_machinery":"The load-bearing device is a constant-gain reset: for any chosen time step $t_s>0$, controllability of $(A,B)$ lets one pick $K_c$ so that $A_c=A+BK_c$ has purely imaginary eigenvalues in $(2\\pi i/t_s)\\mathbb{Z}$, forcing $e^{A_c t_s}=I$. With this reset, the linearized flow $\\dot{\\Phi}_t=A_c\\Phi_t+BU_t$ is analyzed through the Gramian $W_t=\\int_0^t e^{-A_c\\tau}BB^\\top e^{-A_c^\\top\\tau}d\\tau$, a positive definite matrix that encodes the energy needed to steer in each direction. The paper defines a class of factors $\\Phi_k$ such that $W_{t_s}^{-1/2}\\Phi_k W_{t_s}^{1/2}$ is symmetric positive definite; for these, the optimal trajectory $\\Phi_t^\\star=e^{A_c t}(I+W_t W_{t_s}^{-1}(\\Phi_k-I))$ stays inside $\\mathrm{GL}^+(n,\\mathbb{R})$, so the optimal input rewrites as a feedback gain $K_t=U_t^\\star(\\Phi_t^\\star)^{-1}+K_c$. Concatenating five such factors — possible because every positive-determinant matrix is a product of five symmetric positive definite matrices — yields strong controllability. The obstruction half uses the polar decomposition $\\mathrm{GL}^+(n,\\mathbb{R})\\simeq\\mathrm{Sym}^+(n)\\times\\mathrm{SO}(n)$ and the non-contractibility of $\\mathrm{SO}(n)$: a continuous universal steering formula would give a homotopy contracting the state manifold, which is impossible.","core_discovery":"The paper establishes the equivalence: $(A,B)$ satisfies the Kalman rank condition (the block matrix $[B\\ AB\\ \\cdots\\ A^{n-1}B]$ has full row rank) if and only if the bilinear system $\\dot{\\Phi}_t=(A+BK_t)\\Phi_t$ is controllable on $\\mathrm{GL}^+(n,\\mathbb{R})$ — the invertible $n\\times n$ real matrices with positive determinant — and if and only if it is strongly controllable, meaning every $\\Phi_{\\mathrm{fn}}\\in\\mathrm{GL}^+(n,\\mathbb{R})$ and every $t_{\\mathrm{fn}}>0$ admit an integrable gain $K_\\cdot:[0,t_{\\mathrm{fn}}]\\to\\mathbb{R}^{m\\times n}$ taking the flow from $I$ to $\\Phi_{\\mathrm{fn}}$. The constructive proof fixes a step $t_s=t_{\\mathrm{fn}}/5$, chooses a constant gain $K_c$ with $e^{(A+BK_c)t_s}=I$, and factors the target into five symmetric positive definite matrices in the metric of the Gramian $W_{t_s}$; each factor is then traversed by the optimal open-loop segment, which stays invertible, and the gains are read off in feedback form. The paper also shows that the optimal open-loop controller can fail to be expressible as a feedback law, repairs an earlier proposed sufficient condition by replacing a norm bound with a symmetrized one, and proves that a continuous universal feedback formula cannot exist since $\\mathrm{GL}^+(n,\\mathbb{R})$ is not contractible. For the group of orientation-preserving diffeomorphisms, it obtains a partial reachability result under a contraction condition.","pith_inferences":["The uniform five-factor bound suggests that control effort for a fixed target concentrates as $t_{\\mathrm{fn}}\\to0$; a testable extension is to characterize the minimal $\\sup_t\\|K_t\\|$ as a function of $t_{\\mathrm{fn}}$ and the target's distance from the identity.","The symmetrized condition (16) gives a quantitative ball of targets reachable by a single optimal feedback segment; a natural next question is whether iterating the optimal map rather than stitching five factors yields shorter or less aggressive paths.","The topological obstruction applies to any state space with nontrivial fundamental group; for $\\mathrm{SO}(n)$ targets one expects branch cuts analogous to angle unwrapping in two dimensions.","For the diffeomorphism setting, the contraction condition (28) is only sufficient; the paper leaves open whether a rank-like condition characterizes reachability on $\\mathrm{Diff}^+(\\mathbb{R}^n)$ and whether the five-factor factorization has an infinite-dimensional analogue."],"forward_implications":["For any controllable $(A,B)$, a swarm of $n$ identical agents can be sent from one nondegenerate configuration to any other configuration with the same orientation in arbitrarily short time using only a broadcast time-varying gain; the final time does not constrain feasibility.","The proof is constructive: every target is reached by at most five concatenated optimal segments, so the result yields an explicit piecewise-smooth feedback law rather than a bare existence statement.","Because a continuous universal formula is ruled out, any practical implementation must either switch between local charts, accept discontinuities in the gain as a function of the target, or use a non-feedback selection rule.","Strong controllability of the $\\mathrm{GL}^+(n,\\mathbb{R})$ flow implies controllability of the Lyapunov equation on positive definite matrices, so the same Kalman condition governs steering of covariance matrices.","For orientation-preserving diffeomorphisms, the contraction-condition result indicates how the same stitching idea extends beyond linear maps, albeit with a Lipschitz smallness hypothesis rather than a rank condition."],"supporting_citations":[{"why":"Supplies the motion-primitive strategy — a constant gain with $e^{(A+BK_c)t_s}=I$ and optimal segments — which the paper corrects by replacing the norm bound with a symmetrized condition and then completes.","marker":"[8]"},{"why":"Provides the theorem that every element of $\\mathrm{GL}^+(n,\\mathbb{R})$ is a product of at most five symmetric positive definite matrices, the factorization used to prove strong controllability.","marker":"[6]"},{"why":"Provides the definitions of strong controllability and the strong Lie saturate criterion, and the counterexample warning that motivates the paper's constructive route.","marker":"[12]"},{"why":"Gives the fact that every element of a connected Lie group is a product of two exponentials, used in Lemma 1 to split a target into arbitrarily small factors for controllability.","marker":"[19]"},{"why":"Supplies the continuous feedback law for the Lyapunov equation via displacement interpolation, adapted in Proposition 5 and contrasted with the non-continuous case on $\\mathrm{GL}^+(n,\\mathbb{R})$.","marker":"[10]"}],"fun_headline_variants":["Any controllable swarm can be rearranged at any speed","Swarm steering: always possible, arbitrarily fast","Broadcast time-varying gain rearranges any controllable swarm at any speed","Kalman rank condition equals strong controllability of swarm flows","No continuous universal feedback formula for optimal swarm rearrangement"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole construction assumes that for every controllable pair $(A,B)$ and every chosen time step $t_s>0$ there is a constant gain $K_c$ with $e^{(A+BK_c)t_s}=I$; the paper invokes this standard linear-systems fact without proof, and the stitching argument collapses if it ever failed.","fun_headline_variants_meta":{"raw":{"variants":["Any controllable swarm can be rearranged at any speed","Swarm steering: always possible, arbitrarily fast","Broadcast time-varying gain rearranges any controllable swarm at any speed","Kalman rank condition equals strong controllability of swarm flows","No continuous universal feedback formula for optimal swarm rearrangement"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001639,"raw_usage":{"total_tokens":6553,"prompt_tokens":1021,"completion_tokens":5532,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":637,"completion_tokens_details":{"reasoning_tokens":5454}},"tokens_in":637,"tokens_out":5532,"duration_ms":35996,"temperature":1.0,"reasoning_tokens":5454,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T10:55:30.231538+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute, for the double-integrator pair with $t_s\\to0$, the five factors $\\Phi_k$ obtained from the symmetric positive definite factorization of a target such as the rotation matrix $e^{(\\pi/4)\\Omega}$, and check numerically that each segment $\\Phi_{k,t}^\\star=e^{A_c t}(I+W_t W_{t_s}^{-1}(\\Phi_k-I))$ stays nonsingular over $[0,t_s]$ and that $K_t=U_t^\\star(\\Phi_t^\\star)^{-1}+K_c$ is integrable. The theorem is falsified if any determinant crosses zero or any gain develops a non-integrable singularity; Section 5 presents this example as evidence that the construction works for every $t_s>0$.","supporting_citations":[{"cited_title":"Optimal control of the Liouville equation","cited_arxiv_id":null,"evidence_quote":"Supplies the motion-primitive strategy — a constant gain with $e^{(A+BK_c)t_s}=I$ and optimal segments — which the paper corrects by replacing the norm bound with a symmetrized condition and then completes."},{"cited_title":"Products of positive definite matrices","cited_arxiv_id":null,"evidence_quote":"Provides the theorem that every element of $\\mathrm{GL}^+(n,\\mathbb{R})$ is a product of at most five symmetric positive definite matrices, the factorization used to prove strong controllability."},{"cited_title":"Geometric control theory","cited_arxiv_id":null,"evidence_quote":"Provides the definitions of strong controllability and the strong Lie saturate criterion, and the counterexample warning that motivates the paper's constructive route."},{"cited_title":"A connected Lie group equals the square of the exponential image","cited_arxiv_id":null,"evidence_quote":"Gives the fact that every element of a connected Lie group is a product of two exponentials, used in Lemma 1 to split a target into arbitrarily small factors for controllability."},{"cited_title":"Optimal transport over a linear dynamical system","cited_arxiv_id":null,"evidence_quote":"Supplies the continuous feedback law for the Lyapunov equation via displacement interpolation, adapted in Proposition 5 and contrasted with the non-continuous case on $\\mathrm{GL}^+(n,\\mathbb{R})$."}],"review_version":1}