{"id":"44ad9963-3f40-415f-a533-39092c99a2c6","arxiv_id":"2607.21539","paper_version":1,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The first Dirichlet eigenvalue of a convex body is log-convex under positive-definite linear deformations, yielding a unique spectral Faber–Krahn position and improved Schmuckenschläger inequalities.","lead":"This paper proves that every convex shape has a unique canonical 'Faber–Krahn' position—up to rotation—at which its lowest vibration frequency is minimized among all volume-preserving linear distortions, and it proves a new log-convexity law for how that frequency changes under stretching. The result links Gaussian probability inequalities to spectral geometry and yields new optimal-shape statements for triangles, simplices, and regular polygons.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified: the central log-convexity proof is internally coherent; the main risk remains the intricate uniform quasi-stationary estimate (Thm 3.4), but I found no gap.","rationale":"The reader identified Theorem 3.4 as the weakest assumption, and I agree that it is the most intricate step and the one least supported by independent verification. However, my review of the proof found no actual gap: the spectral-gap estimates, the L1 approximation, and the handling of boundary indices are all coherent, and the uniformity in t is justified by the local uniformity lemmas. The subsequent use of the estimate in §3.6 is also internally consistent: the decomposition R = U + V and the quadratic-form calculation leading to (28) are valid, and the resulting bound f_m''(t) ≤ C T^{3δ} with δ < 1/3 indeed yields convexity in the limit. I also re-derived the key identity (23) for F'' and found it correct, which removes a potential concern about Lemma 3.11. Because the central claim appears mathematically sound and the proof sketch is complete within the paper's stated assumptions, the appropriate verdict is unchanged. The recommended numerical check is not motivated by a discovered flaw but by the fact that Theorem 3.4 is the single most concentrated piece of technical novelty; independent numerical confirmation would raise confidence from moderate to high.","tokens_in":29093,"tokens_out":33454,"duration_ms":303454,"concrete_test":"Numerically verify Theorem 3.4 for a non-symmetric convex body: discretize the discrete-time Brownian chain for K_t = P^t K (e.g., an equilateral triangle) with h = 0.01, 0.02, 0.05 and m ≈ T/h with T moderately large, and compute the conditional mean E0[X_{kh} | X_{jh} ∈ K_t, j=1..m] by solving the linear system for the killed transition operator. Check that the deviation from z_h decays as e^{-ckh} + e^{-c(m-k)h} for k in the middle, uniformly over a small t-interval, and that the constant remains stable as h → 0. If the decay is only polynomial, Theorem 3.4 and the sublinearity in §3.6 would fail.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I focused on the proof of Theorem 1.1, specifically the step at §3.6 where the uniform discrete quasi-stationary mixing estimate (Theorem 3.4) is used to make the barycenter obstruction sublinear in T. The reader's weakest_assumption is correct: this is the most technically involved and least independently verified part of the paper. However, on close reading I find no internal inconsistency. The proof of Theorem 3.4 is built on Lemma 3.8, whose two remainder estimates follow from the spectral gap of the discretely killed chain (Lemma 3.6) and the lower bound on the Perron eigenfunction (Lemma 3.7). The L1 comparison leading to (20) is valid: the products of the expansions q = Aφ + r and Q^N 1 = Bφ + s are controlled by the Cauchy–Schwarz bound, and the denominator Q^m1(0) = AB + E has relative error at most 1/2 once kh and (m-k)h exceed a large TK. The boundary cases are handled by absorbing the O(1) error into the constant CK, which is legitimate because the conditional mean and z_h both lie in the bounded body Kt. The uniformity over compact t-intervals follows from the local uniformity of Lemmas 3.6–3.8 and the compactness of the matrix family Gt = P^{-2t}. I also checked the affine-orbit consequences: the properness proof (Proposition 3.12) is sound, and strict log-convexity follows from analyticity plus properness without circularity. The L2 estimate of §3.5 is a correct adaptation of the Cordero-Erausquin–Fradelizi–Maurey method; the identity (23) for F'' was independently re-derived and matches the paper. Hence no load-bearing objection to the central claim is identified.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves that for any convex body K in R^n and any positive definite matrix P, the first Dirichlet eigenvalue f(t)=λ1(P^tK) is log-convex on R, and strictly log-convex when P∈SL(n) is non-orthogonal. From this it derives that every convex body admits a unique (up to orthogonal transformations) Faber–Krahn position: a volume-preserving linear image minimizing λ1 over the SL(n)-orbit. This answers a question of Schmuckenschläger. Further applications include affine-orbit minimization results for simplices, centrally symmetric polytopes with 2n vertices, and regular polygons; log-convexity of the inverse inradius and planar Cheeger constant; heat-trace log-concavity in the centrally symmetric case; convexity for the Ornstein–Uhlenbeck first eigenvalue; and an improved Schmuckenschläger-type inequality λ1(K∩L)+λ1(K+L)≤λ1(K)+λ1(L) for centrally symmetric convex bodies, using the Gaussian conjugate Rogers–Shephard inequality.","tokens_in":29402,"tokens_out":16846,"duration_ms":159709,"significance":"The main theorem is a new and striking spectral- geometric convexity property: log-convexity of λ1 under positive definite linear flows. It resolves the existence and uniqueness of the Faber–Krahn position, a natural spectral analogue of John's position, and gives clean proofs of several affine-orbit eigenvalue minimization results. The proof is substantial and mostly self-contained: it introduces a uniform discrete quasi-stationary mixing estimate (Theorem 3.4), a discrete Kac formula (Proposition 3.9), and a quantitative L2 estimate extending the Cordero–Erausquin–Fradelizi–Maurey method. I found the central derivation coherent and the key estimate internally consistent. The paper is not machine-checked, but the main argument is presented with explicit quantitative statements and locally uniform constants, which is a notable strength. The main advertised results are falsifiable and likely to inspire further work on affine positions and p-Laplacian analogues.","major_comments":[],"minor_comments":[{"comment":"The proof of heat-trace log-concavity is only a sketch: the Brownian-loop discretization is stated without derivation, and the regularization step 'adding η∑|x_j|²' followed by η↓0 is not justified in detail. Since Theorem 2.21 is not used in the main Faber–Krahn argument, this does not affect the central claim, but the authors should either expand the proof or explicitly downgrade the statement to a remark/conjecture with a heuristic proof.","section":"§3.10 / Theorem 2.21"},{"comment":"Theorem 1.3 is an advertised consequence, but its proof is a direct application of inequality (6) from the external preprint [32] (Milman–Nakamura–Tsuji), which is not proved in the manuscript. I recommend the authors state explicitly in the introduction that this part is conditional on [32], or include a proof of (6). This does not affect the correctness of the central Faber–Krahn result.","section":"§4.1 / Theorem 1.3"},{"comment":"There is a typo in the final reduction step: the definition of P′ should read P′ = ((1−t0)In+t0P)^{-1}((1−t1)In+t1P). The matrix AM-GM step leading to c_{t,s}P^s would also benefit from a brief explanation, since it is central to the proof of the displayed inequality.","section":"Corollary 2.3"},{"comment":"The absorption of the boundary cases kh≤TK or (m−k)h≤TK into the constant CK is correct, but a one-sentence justification would improve readability: in these cases the exponential sum is bounded below by e^{-c_K T_K}, so CK can be enlarged to dominate the O(1) L1 error. The current wording 'can be accommodated by adjusting CK' is a little terse for such a technical step.","section":"§3.3.5 / Theorem 3.4"}],"recommendation":"minor_revision","confidential_remarks":"The central proof is sound in my reading; the main risk is the complexity of Theorem 3.4, but I found no gap. The two points to monitor are (i) the reliance of Theorem 1.3 on the external preprint [32], and (ii) the sketchy proof of Theorem 2.21. If the journal is strict about self-contained proofs, the authors should be asked to clarify the status of those results. The AI usage disclosure does not appear to affect the mathematics."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nI read the Faifman–Polterovich paper. Short version: this is a serious paper and the reader's ACCEPT is right. The main result — log-convexity of λ1(P^t K) for arbitrary convex bodies, strict for non-orthogonal P in SL(n) — is genuinely new. The centrally symmetric case falls out of the Gaussian B-theorem, but the general case needs a real new ingredient: the quantitative quasi-stationary estimate for discretely killed Brownian motion, which controls the barycenter term in the L2 method. That step is the heart of the paper, and it is the one a referee should read carefully.\n\nWhat the paper does well: the proof is structured and honest. The discrete Kac formula (Proposition 3.9) is stated cleanly; the L2 estimate follows the Cordero-Erausquin–Fradelizi–Maurey method and is re-derived correctly; the applications (regular simplex, regular polygons in their SL(2)-orbits, cross-polytopes) are immediate but nice consequences of the irreducible symmetry principle. The paper also marks its open questions sharply — the p-Laplacian case, the first Neumann eigenvalue — without overclaiming.\n\nWhere the soft spots are, in proportion: first, Theorem 3.4 is the load-bearing estimate. The stress-test note did a second pass on the step at §3.6 where it is used, and found no internal gap; I agree that the proof is coherent. But it is intricate, and the uniformity in t depends on compactness arguments that are plausible but not trivial. A referee should verify Lemmas 3.6–3.8 and the error control in (28) line by line. That is the one place where a hidden mistake would topple the main theorem.\n\nSecond, Theorem 1.3 — the improved Schmuckenschläger inequality — relies on the Gaussian conjugate Rogers–Shephard inequality of Milman–Nakamura–Tsuji, which is itself a 2026 preprint. The implication from (6) to (7) is a one-line Brownian-sampling argument, so the dependency is external but not deep. Still, the referee should note that a secondary result of the paper is conditional on an unverified preprint.\n\nThird, the heat-trace log-concavity (Theorem 2.21) is only sketched — the regularization of the loop measure is mentioned, not carried out. That is minor, since it is not central to the paper's main contribution.\n\nCitation pattern is fine: they build on Brascamp–Lieb, Cordero-Erausquin–Fradelizi–Maurey, Schmuckenschläger, and the relevant convex-geometry literature. No self-citation inflation.\n\nWho should read it: anyone working on spectral geometry of convex bodies, affine positions of convex sets, or Gaussian measure inequalities. I would bring it to a reading group and I would cite the main theorem.\n\nRecommendation: send it to serious peer review. The main theorem deserves the referee time. Expect heavy scrutiny of §3.3–3.6, but that is what peer review is for.","headline":"Strong spectral-geometry paper; the main theorem is new and the proof is credible, with the quasi-stationary estimate as the main thing to check.","tokens_in":29994,"tokens_out":2808,"would_cite":true,"duration_ms":27043,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["35P15","52A40","60J65"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every convex body has a unique Faber–Krahn position, enforced by log-convexity of the first eigenvalue along linear flows.","keywords":["first Dirichlet eigenvalue","log-convexity","Faber–Krahn position","convex bodies","Brownian motion","quasi-stationary distribution","Gaussian measure inequalities","affine position"],"falsifier":"Numerically compute, for a fixed non-symmetric K (say a right triangle) and P = diag(e^s, e^{-s}) with s ≠ 0, the second derivative of log λ₁(P^t K) at t = 0; log-convexity predicts it is nonnegative for every s and strictly positive when s ≠ 0, so one negative value refutes Theorem 1.1. Alternatively, simulate the discretely conditioned Brownian motion and check whether the conditional mean in Theorem 3.4 converges exponentially; observing only polynomial convergence would invalidate the proof.","tokens_in":28887,"feed_emoji":"📐","tokens_out":8598,"duration_ms":72515,"temperature":0.7,"pith_summary":"This paper establishes a new convexity law for the first Dirichlet eigenvalue of a convex body: as the body is deformed by powers P^t of a positive-definite matrix, the value λ₁(P^t K) is log-convex in t. From this one-parameter rigidity the authors extract a global geometric fact: every convex body has a Faber–Krahn position—a volume-preserving linear image that minimizes λ₁—and that position is unique up to rotations, answering a question raised in 2011. The eigenvalue version needs no symmetry hypothesis because the proof replaces the Gaussian B-theorem with a quantitative analysis of Brownian motion conditioned to stay inside the deforming body; a uniform exponential-mixing estimate makes the obstruction to convexity vanish in the long-time limit. If correct, the result supplies a spectral counterpart to John's ellipsoid, recovers the classical triangle and simplex minimization theorems, and shows regular polygons are extremal within their own linear orbits. A second line uses a Gaussian Rogers–Shephard inequality to sharpen the classical intersection bound for centrally symmetric bodies to λ₁(K∩L)+λ₁(K+L) ≤ λ₁(K)+λ₁(L).","feed_headline":"Every convex body has a unique Faber–Krahn position","feed_subtitle":"Log-convex eigenvalues under linear flows settle a 2011 uniqueness question and pin down regular extremal shapes.","key_machinery":"The engine is the one-parameter family K_t = P^t K. For centrally symmetric K, log-convexity drops out of the Gaussian B-theorem applied to sampled Brownian paths. For general K, the proof rests on a uniform discrete quasi-stationary mixing estimate (Theorem 3.4): a Brownian path conditioned to stay in K_t at discrete times has conditional mean at time kh exponentially close to the quasi-stationary mean, uniformly over compact t-intervals. Together with an L² estimate for the second derivative of the sampled Gaussian log-volume and a discrete Kac formula, this makes the barycenter obstruction only o(T), so dividing by T restores convexity of λ₁.","core_discovery":"The central claim is Theorem 1.1: for any convex body K and positive-definite P, t ↦ λ₁(P^t K) is log-convex on R, and strictly so when P preserves volume and is not the identity. This says the first eigenvalue never prefers an interpolated linear deformation over the interpolation of its own values. The centrally symmetric case follows from the Gaussian B-theorem; general bodies are handled by sampling Brownian motion at discrete times and conditioning on survival, with a uniform exponential-mixing estimate that makes the barycenter obstruction sublinear in time and lets Kac's formula pass to the limit. From this they derive Theorem 2.4: existence and uniqueness (up to orthogonal transforma","pith_inferences":["If the Faber–Krahn position is as canonical as John's position, it gives a GL-equivariant way to attach a Euclidean metric (a 'spectral ellipsoid') to a convex body; this could serve as a shape-normalization tool in computational geometry and image analysis.","The same quasi-stationary machinery might transfer to other spectral quantities, such as the first nonzero Neumann eigenvalue, if its conjectured log-concavity (Question 5.5) holds; the paper's open list explicitly invites this.","The p-Laplacian version is open; a positive answer would interpolate between the John position (p=∞, inradius) and the spectral position (p=2), suggesting a continuous family of affine positions.","The improved Schmuckenschläger inequality is derived from a Gaussian inequality with no Brownian conditioning; the same inequality may strengthen other survival-probability bounds for nonsymmetric bodies once centering conditions are understood."],"forward_implications":["Every convex body admits a Faber–Krahn position, and the minimizer is unique up to orthogonal transformations; the extremal condition is the isotropic energy identity ∫_K ∇ψ⊗∇ψ = (λ₁(K)/n) I for the first eigenfunction.","Bodies whose symmetry group acts irreducibly—regular simplex, regular polygons, regular cross-polytopes, Platonic solids—are automatically in Faber–Krahn position, so they minimize λ₁ among all their volume-preserving linear images.","The regular simplex minimizes λ₁ among all n-simplices of fixed volume in every dimension, giving a new proof of the triangle and simplex cases of Pólya–Szegő; regular N-gons likewise minimize among their area-normalized linear images.","For centrally symmetric K, L, the improved Schmuckenschläger inequality λ₁(K∩L)+λ₁(K+L) ≤ λ₁(K)+λ₁(L) holds, and the same inequality holds for the first Dirichlet eigenvalue of the Ornstein–Uhlenbeck operator.","Log-convexity also holds for the inverse inradius and for the planar Cheeger constant; for centrally symmetric bodies, the heat trace of P^t K is log-concave in t."],"fun_headline_variants":["Log-convex eigenvalues settle 2011 uniqueness question","Unique Faber–Krahn position for every convex body","Eigenvalue log-convexity pins down extremal shapes","Brownian motion proof: unique minimal eigenvalue position","Convex bodies: unique eigenvalue-minimizing position"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The proof that log-convexity holds for all convex bodies rests on the uniform discrete quasi-stationary mixing estimate: Brownian motion sampled at discrete times and conditioned to stay inside the deforming body must mix exponentially fast to its quasi-stationary law, uniformly on compact parameter intervals; if that rate were only polynomial, the barycenter term would not become sublinear and the convexity limit would fail.","fun_headline_variants_meta":{"raw":{"variants":["Log-convex eigenvalues settle 2011 uniqueness question","Unique Faber–Krahn position for every convex body","Eigenvalue log-convexity pins down extremal shapes","Brownian motion proof: unique minimal eigenvalue position","Convex bodies: unique eigenvalue-minimizing position"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000192,"raw_usage":{"total_tokens":1181,"prompt_tokens":738,"completion_tokens":443,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":482,"completion_tokens_details":{"reasoning_tokens":365}},"tokens_in":482,"tokens_out":443,"duration_ms":4103,"temperature":1.0,"reasoning_tokens":365,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T07:10:31.280958+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Numerically compute, for a fixed non-symmetric K (say a right triangle) and P = diag(e^s, e^{-s}) with s ≠ 0, the second derivative of log λ₁(P^t K) at t = 0; log-convexity predicts it is nonnegative for every s and strictly positive when s ≠ 0, so one negative value refutes Theorem 1.1. Alternatively, simulate the discretely conditioned Brownian motion and check whether the conditional mean in Theorem 3.4 converges exponentially; observing only polynomial convergence would invalidate the proof.","supporting_citations":[],"review_version":1}