{"id":"8c6f5760-13d0-4498-b4b4-1a5e0299dfab","arxiv_id":"2608.12089","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A unital C*-algebra with complexity rank at most one has real rank zero, and the uniform Roe algebra of Z is an example.","lead":"Complexity rank one C*-algebras are shown to have real rank zero, meaning every self-adjoint element can be approximated by elements with finite spectrum. The proof uses a three-corner perturbation argument and yields as a corollary that the uniform Roe algebra of the integers has real rank zero.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proposition 1.7 carries the whole proof but is not proved and is ill-quantified: its commutator bound contains a free variable η, and the exact inclusion E⊆C∩D is asserted without derivation from Definition 1.4.","rationale":"The paper's core lemmas are a real argument: the Sylvester estimate in Lemma 2.8 is standard, Lemma 3.2's passage to an exactly commuting pair via Lin's theorem is plausible, and Lemma 3.3's three-corner spectral cut is carefully estimated. If Proposition 1.7 were replaced by a proved statement with commutator bound <ε and exact inclusions, the chain to Theorem 4.1 would hold. The stress-test therefore does not identify an error inside Section 3; it identifies the unproved reduction as the load-bearing point. The author-added note immediately after Proposition 1.7 admits that the exact-inclusion form is 'the substantive reduction', and no proof is supplied, only a citation. The unquantified η compounds the problem: even granting exact inclusions, the theorem's chosen δ cannot be fed into Lemma 3.2 unless commutator control is tied to δ. The reader's weakest_assumption named the same Proposition 1.7 and the same exact inclusion; our read sharpens it with the η issue. Nothing in the acknowledgement of AI assistance changes this mathematical assessment. The verdict should remain CONDITIONAL: accept only when Proposition 1.7 is checked against [8] and either proved or corrected, with η properly quantified.","tokens_in":9336,"tokens_out":13147,"duration_ms":102030,"concrete_test":"Look up [8, Proposition 2.14] and check it verbatim on two points: (1) does it give commutator control ∥[h,x]∥<ε with the same ε as the approximation conditions, or with a controlled η(ε) tending to 0; (2) does it establish the exact inclusion E⊆C∩D. If both hold, write out the specialization proof of Proposition 1.7 with η replaced by ε and verify the constants used in Theorem 4.1. If not, attempt to prove Proposition 1.7 directly from Definition 1.4. A decisive failure mode would be a unital C*-algebra of complexity rank one, for example a finite-dimensional or AF algebra, for which the original approximate intersection data cannot be replaced by exact E⊆C∩D; such an example would invalidate the proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The argument from Lemma 2.8 through Lemma 3.3 is internally coherent, but Theorem 4.1 depends on Proposition 1.7 at the point where it must produce, for the chosen δ in (21), a positive contraction h with ∥[h,a]∥<δ, h a∈δ C, (1−h)a∈δ D, h(1−h)a∈δ E, and E⊆C∩D. As printed, Proposition 1.7 is not a well-formed statement: η in condition (i) is never quantified. If η is not tied to ε, or to δ, the application in Theorem 4.1 does not follow; η could be 1 while δ is chosen very small. The proposition must at minimum state ∥[h,x]∥<ε, or provide η(ε) with η(δ)<δ. Even with that repaired, the exact inclusion E⊆C∩D is strictly stronger than Definition 1.4, which only gives unit-ball approximate containment in C and D. The paper itself calls the passage to this strengthened form 'the substantive reduction' and cites [8, Proposition 2.14] without proof. The later lemmas use the exact inclusion essentially: only because p0,p1,p⋄∈E⊆C∩D can the corner algebras p0Dp0, p1Cp1, p⋄Ep⋄ be formed and the elements s0,s1,r⋄ be placed in the required algebras. Thus the single load-bearing uncertainty is whether Proposition 1.7 is true as stated.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims that every unital C*-algebra with complexity rank at most one has real rank zero. The proof proceeds by taking an arbitrary self-adjoint contraction a and a tolerance ε>0, producing finite-dimensional unital subalgebras C,D,E of A satisfying a strengthened form of decomposability, and then using a three-corner perturbation argument. Lemmas 2.8, 3.2, and 3.3 build an exactly commuting pair in E and then a finite-dimensional subalgebra F with b∈F_sa and ∥a-b∥<ε. As a corollary, the authors derive that the uniform Roe algebra C_u^*|Z| has real rank zero.","tokens_in":9616,"tokens_out":11286,"duration_ms":93983,"significance":"If correct, this answers an open question in [8] (Question 6.5) and provides an elementary-looking proof of a structural property that had been related to other open problems in the area. The internal arguments in Sections 2 and 3 are carefully written: Lemma 2.8 is a correct Rosenblum-type estimate, Lemma 3.2's numerical bookkeeping checks out, and Lemma 3.3's corner decomposition is clear and the norm estimates are correct. The principal weakness is that the paper's central theorem is conditional on Proposition 1.7, which is cited from [8, Proposition 2.14] but not proved here and, as printed, is not even a well-formed statement because of the unquantified parameter η. The main proof is sound only if Proposition 1.7 is repaired and proved in the strong form used in Theorem 4.1.","major_comments":[{"comment":"The parameter η in condition (i) of Proposition 1.7 is never quantified. As written, the proposition has no well-defined truth value: it asserts existence of C,D,E,h such that ∥[h,x]∥<η, but η is not tied to the quantifiers. In Theorem 4.1 the authors apply Proposition 1.7 with X={a} and ε=δ, and then use Lemma 3.2, whose first hypothesis requires ∥[h,a]∥<δ. This forces η≤δ, or more generally η=η(δ) with η(δ)<δ. If η were independent of δ and large, the proof would not go through. The statement must be corrected, for example by quantifying η universally before the existential quantifiers or by giving an explicit function η(ε) with η(ε)<ε, and the proof of Theorem 4.1 must then verify the corresponding choice of δ.","section":"Section 1, Proposition 1.7; Section 4, Theorem 4.1"},{"comment":"The exact inclusion E⊆C∩D in Proposition 1.7(iii) is strictly stronger than the approximate containment in Definition 1.4(iii), which only requires every element of the unit ball of E to be ε-close to C and to D. The authors cite [8, Proposition 2.14] and state that the passage to the strengthened form is 'the substantive reduction', but no proof of this reduction is included. The exact inclusion is genuinely load-bearing: in Lemma 3.3 the elements s0, s1, r⋄ and the corner algebras p0Dp0, p1Cp1, p⋄Ep⋄ can be formed only because p0,p1,p⋄ belong to E and E is contained in C∩D. Without a proof of Proposition 1.7 in its strong form, the main theorem is not established. I request that the authors either prove Proposition 1.7 (or reproduce its proof from [8] with the precise hypotheses) or restructure the argument so that it does not need this strengthened statement.","section":"Section 1, Proposition 1.7(iii); Section 3, Lemmas 3.2 and 3.3"}],"minor_comments":[{"comment":"In Definition 2.4, 'sequece' should be 'sequence'.","section":"Section 2, Definition 2.4"},{"comment":"In the final estimate of ∥esa∥, the strict inequalities give ∥esa∥<1/2 rather than ≤1/2; the displayed '≤1/2' is harmless but should be made consistent.","section":"Section 3, Lemma 3.2"},{"comment":"The 3-by-3 block matrix after equation (11) uses asterisks for controlled entries; adding explicit labels such as 'controlled by (11)' and 'controlled by (12)' inside the diagram or in the surrounding text would improve readability.","section":"Section 3, Lemma 3.3"},{"comment":"The phrase 'must has complexity rank two' should be 'must have complexity rank two'.","section":"Section 4, Remark 4.5"}],"recommendation":"major_revision","confidential_remarks":"The three-corner argument itself is convincing and the numerical estimates are clean, but Proposition 1.7 is the single load-bearing bridge from the definition of complexity rank to the proof of Theorem 4.1. Because the proposition is not proved in the paper and contains an unquantified parameter, I would not accept the paper until this point is fixed, either by supplying a full proof of Proposition 1.7 or by citing an openly stated version with all quantifiers and then checking the required δ-dependence in Theorem 4.1."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the result is new and the main body of the proof is in good shape, but the paper currently does not prove the one proposition that carries the weight. Proposition 1.7 is stated as the strengthened rank-one form, with condition (i) ∥[h,x]∥ < η and no quantifier on η. Theorem 4.1 applies it with a fixed small δ and needs ∥[h,a]∥ < δ. As printed that step does not follow; this looks like a typo rather than a fatal flaw, but it must be fixed. The exact inclusion E ⊆ C∩D is also asserted as the “substantive reduction” and attributed to [8, Proposition 2.14] without proof in this paper. The corner constructions and estimates in Lemmas 3.2 and 3.3 use that inclusion essentially: p0Dp0, p1Cp1, and p⋄Ep⋄ all depend on the projections lying in E, which then lies in C and D. I have not checked [8] to see whether the precise statement with exact inclusions is actually proved there; the authors need to give a direct proof or a precise reference.\n\nWhat is genuinely good: Lemma 2.8 is a clean Rosenblum-type Sylvester estimate, and the boundary constants in Lemmas 3.2 and 3.3 check out. The three-corner approximation idea is nice: cut by h0, control outer off-diagonal blocks with Lemma 2.8 and the middle row with invertibility of p⋄k0p⋄, then approximate each diagonal corner with the corresponding corner element. The proof is not circular and does not fit parameters to an output; the dependence on Lin’s theorem is external and standard. The application to C_u^*|ℤ| follows if Theorem 4.1 holds, and the remark about ℤ² is a useful sanity check.\n\nThe acknowledgements disclose AI assistance for exposition; that is a disclosure norm issue, not a mathematical one.\n\nWho this is for: operator algebraists working on complexity rank, decomposability, and real rank zero. A serious referee should take it. My advice: send it to peer review, but require the authors to quantify η properly and to prove Proposition 1.7, or cite the exact location in [8] and spell out why the strengthened form follows. If that proposition is true as intended, the main theorem is likely correct.","headline":"Complexity rank one implies real rank zero is likely correct, but the printed proof leans entirely on an unproved and ill-quantified Proposition 1.7, so the paper needs revision, not rejection.","tokens_in":10190,"tokens_out":2875,"would_cite":false,"duration_ms":26173,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["46L05","46L80","46L85"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every unital $C^*$-algebra with complexity rank at most one has real rank zero.","keywords":["complexity rank","real rank zero","decomposability","finite-dimensional approximation","uniform Roe algebra","almost commuting self-adjoint matrices","spectral-separation estimate","three-corner estimation"],"falsifier":"Construct a unital $C^*$-algebra with complexity rank at most one in the original approximate sense of Definition 1.4 whose self-adjoint elements with finite spectrum are not dense; that would directly refute Theorem 4.1. The most concrete place to look is the uniform Roe algebra $C^*_u|\\mathbb{Z}^2|$, which is known not to have real rank zero; if it could be shown to admit a rank-one decomposition, the theorem would be false. Short of a counterexample, one could check whether Proposition 1.7 is valid for finite-dimensional classes by examining the cited proof in [8], since that proposition is the load-bearing step.","tokens_in":9085,"feed_emoji":"","tokens_out":13193,"duration_ms":107933,"temperature":0.7,"pith_summary":"The paper proves that any unital $C^*$-algebra that decomposes over finite-dimensional algebras in the sense of complexity rank at most one has real rank zero: its self-adjoint elements with finite spectrum form a norm-dense set. This establishes a previously open implication and, as a corollary, gives the uniform Roe algebra $C^*_u|\\mathbb{Z}|$ real rank zero. The proof is an elementary construction: for every self-adjoint contraction and every tolerance, it builds a finite-dimensional subalgebra whose self-adjoint part contains an element within tolerance. Because that approximating element lives in a finite-dimensional subalgebra, it automatically has finite spectrum, which is exactly what real rank zero requires.","feed_headline":"Rank-one complexity forces real rank zero","feed_subtitle":"Self-adjoint elements with finite spectrum are dense, and the uniform Roe algebra of Z gets real rank zero.","key_machinery":"The load-bearing mechanism is the three-corner estimation of Lemmas 3.2 and 3.3. Given the rank-one decomposition data $(C,D,E,h)$, Lemma 3.2 uses the almost-commuting self-adjoint matrices theorem inside the finite-dimensional algebra $E$ to replace $h$ by a positive contraction $h_0$ that commutes with an element $e_0\\in E$ close to $h(1-h)a$. Lemma 3.3 then applies the spectral projections $p_0 = \\mathbf{1}_{[0,1/3)}(h_0)$, $p_\\diamond = \\mathbf{1}_{[1/3,2/3]}(h_0)$, and $p_1 = \\mathbf{1}_{(2/3,1]}(h_0)$: the middle corner is handled because $t(1-t)\\ge 2/9$ there, and the two off-diagonal corners are controlled by the spectral-separation estimate of Lemma 2.8, whose proof uses exponential estimates and vector-valued integration. The diagonal corners are then approximated in the three algebras $D$, $E$, and $C$, and orthogonality assembles them into one finite-dimensional subalgebra.","core_discovery":"Theorem 4.1 states that if $A$ is a unital $C^*$-algebra with complexity rank at most one, then $A$ has real rank zero. The proof fixes a self-adjoint contraction $a$ and $\\varepsilon>0$, obtains from the refined rank-one property a triple of unital finite-dimensional subalgebras $C,D,E\\subseteq A$ with $E\\subseteq C\\cap D$ and a positive contraction $h\\in E$ that almost commutes with $a$ and separates it into $ha$, $(1-h)a$, and $h(1-h)a$, and then perturbs $h$ to a positive contraction $h_0$ that commutes with a self-adjoint $e_0\\in E$ approximating $h(1-h)a$. Cutting by the spectral projections of $h_0$ at $1/3$ and $2/3$ produces three diagonal corners that are approximated inside $D$, $E$, and $C$ respectively, while the off-diagonal blocks are controlled by an inversion on the middle corner and a spectral-separation estimate on the outer corners. The assembled element $b$ lies in the finite-dimensional subalgebra $p_0 D p_0 \\oplus p_\\diamond E p_\\diamond \\oplus p_1 C p_1$ and satisfies $\\|a-b\\|<\\varepsilon$.","pith_inferences":["The proof's reliance on the exact inclusion $E\\subseteq C\\cap D$ in Proposition 1.7 is the point most likely to be probed; if that strengthened form of rank-one decomposability failed in a concrete example, the theorem might still be true but would require a different argument.","Because the constants in Lemmas 3.2 and 3.3 are explicit, the construction could in principle yield quantitative finite-dimensional approximations for concrete rank-one algebras such as $C^*_u|\\mathbb{Z}|$.","The three-corner cut at $1/3$ and $2/3$ suggests a template for higher complexity ranks, where an algebra of rank $n$ might be approximated by a block decomposition with more corners; the paper does not attempt this iteration.","The related question of whether weak complexity rank one implies real rank zero remains open precisely because the strengthened Proposition 1.7 is not available in that setting."],"forward_implications":["The uniform Roe algebra $C^*_u|\\mathbb{Z}|$ has real rank zero (Theorem 4.4).","Since $C^*_u|\\mathbb{Z}^2|$ has complexity rank at most two but lacks real rank zero, its complexity rank is exactly two (Remark 4.5).","The result answers Question 3.10 of [9] and partially answers Question 6.5 of [8].","If the universal-coefficient-theorem hypothesis from [14] is met for a unital purely infinite simple nuclear $C^*$-algebra with zero $K$-theory, that algebra decomposes over finite-dimensional algebras and therefore has real rank zero."],"supporting_citations":[{"why":"Supplies the strengthened rank-one characterization, cited as Proposition 2.14, with the exact inclusion $E\\subseteq C\\cap D$ that the proof calls the substantive reduction.","marker":"[8]"},{"why":"Provides the almost-commuting self-adjoint matrices theorem invoked in Lemma 3.2 to produce the commuting pair $h_0,e_0$.","marker":"[3, 10]"},{"why":"Defines decomposability and complexity rank, and its Example A.9 bounds the complexity of uniform Roe algebras by the geometric complexity of the underlying space.","marker":"[14]"},{"why":"Supplies the geometric complexity notion used with Example A.9 to conclude that $C^*_u|\\mathbb{Z}|$ has complexity rank at most one.","marker":"[4]"},{"why":"Records the open questions answered here and the fact that $C^*_u|\\mathbb{Z}^2|$ lacks real rank zero, which after Theorem 4.1 forces its exact rank to be two.","marker":"[9]"},{"why":"Provides the spectral-separation method for the operator equation used in Lemma 2.8 to control the outer off-diagonal corners.","marker":"[11]"},{"why":"Provides the vector-valued integration tools used in Lemma 2.8 to justify the integral formula in the spectral-separation estimate.","marker":"[2]"},{"why":"Supplies the definition of real rank zero as density of self-adjoint elements with finite spectrum, the target property of Theorem 4.1.","marker":"[1]"}],"fun_headline_variants":["Rank-one complexity implies real rank zero","Real rank zero from rank-one complexity","Rank-one complexity yields real rank zero","Complexity rank one forces real rank zero","Zero real rank from complexity rank one"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof leans on an unproved strengthened form of rank-one decomposability that forces the small overlap algebra $E$ to lie exactly inside both large algebras $C$ and $D$; the corner approximations are built inside $E$ and promoted to $C$ or $D$ using exactly that inclusion, so without it the construction breaks.","fun_headline_variants_meta":{"raw":{"variants":["Rank-one complexity implies real rank zero","Real rank zero from rank-one complexity","Rank-one complexity yields real rank zero","Complexity rank one forces real rank zero","Zero real rank from complexity rank one"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000957,"raw_usage":{"total_tokens":4020,"prompt_tokens":829,"completion_tokens":3191,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":445,"completion_tokens_details":{"reasoning_tokens":3129}},"tokens_in":445,"tokens_out":3191,"duration_ms":24421,"temperature":1.0,"reasoning_tokens":3129,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T00:17:26.941132+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a unital $C^*$-algebra with complexity rank at most one in the original approximate sense of Definition 1.4 whose self-adjoint elements with finite spectrum are not dense; that would directly refute Theorem 4.1. The most concrete place to look is the uniform Roe algebra $C^*_u|\\mathbb{Z}^2|$, which is known not to have real rank zero; if it could be shown to admit a rank-one decomposition, the theorem would be false. Short of a counterexample, one could check whether Proposition 1.7 is valid for finite-dimensional classes by examining the cited proof in [8], since that proposition is the load-bearing step.","supporting_citations":[{"cited_title":"Jaime and R","cited_arxiv_id":null,"evidence_quote":"Supplies the strengthened rank-one characterization, cited as Proposition 2.14, with the exact inclusion $E\\subseteq C\\cap D$ that the proof calls the substantive reduction."},{"cited_title":"Willett and G","cited_arxiv_id":null,"evidence_quote":"Defines decomposability and complexity rank, and its Example A.9 bounds the complexity of uniform Roe algebras by the geometric complexity of the underlying space."},{"cited_title":"Guentner, R","cited_arxiv_id":null,"evidence_quote":"Supplies the geometric complexity notion used with Example A.9 to conclude that $C^*_u|\\mathbb{Z}|$ has complexity rank at most one."},{"cited_title":"Li and R","cited_arxiv_id":null,"evidence_quote":"Records the open questions answered here and the fact that $C^*_u|\\mathbb{Z}^2|$ lacks real rank zero, which after Theorem 4.1 forces its exact rank to be two."},{"cited_title":"Diestel and J","cited_arxiv_id":null,"evidence_quote":"Provides the vector-valued integration tools used in Lemma 2.8 to justify the integral formula in the spectral-separation estimate."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the definition of real rank zero as density of self-adjoint elements with finite spectrum, the target property of Theorem 4.1."}],"review_version":1}