{"id":"03c0969d-7956-48f4-88fd-44c5e6bb9704","arxiv_id":"2601.07246","paper_version":3,"verdict":"CONDITIONAL","confidence":"LOW","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The rate-distortion infimum is attained for lower semi-continuous distortions on locally compact Polish alphabets via one-point compactification for bounded distortions and concentration-compactness for unbounded coercive distortions.","lead":"This paper proves existence of optimal reconstruction distributions for rate-distortion problems with lower semi-continuous distortions on noncompact alphabets, using one-point compactification for bounded cases and concentration-compactness for unbounded coercive distortions. It extends classical results that require compactness, enabling analysis in more general settings common to continuous data.","discovery_kind":"unclear","skeptic_critique":{"model":"grok-4.3","headline":"Coercivity may fail to force tightness of minimizing Y-sequences for arbitrary (non-tight) sources, blocking weak convergence in the unbounded case.","rationale":"The reader's weakest-assumption flag (lsc on locally compact Polish) correctly locates the setting, but the load-bearing risk is narrower: whether pointwise coercivity plus concentration-compactness actually produces a tight subsequence for completely general sources. This keeps the result CONDITIONAL rather than unconditional, aligning with the low-confidence abstract-based verdict; no change to the stated verdict is warranted.","tokens_in":1617,"tokens_out":378,"duration_ms":67581,"concrete_test":"Extract the precise definition of 'coercive' and the tightness/relative-compactness paragraph in the unbounded-distortion existence theorem. Check whether the argument uses only pointwise coercivity or implicitly requires uniform growth or compactly supported μ; if the former, test the claim on Y=ℝ with d(x,y)=|x-y| and a source μ with unbounded support whose near-optimal reproductions escape to infinity.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The unbounded coercive case invokes concentration-compactness to obtain a weakly convergent subsequence of reproduction measures attaining the rate-distortion infimum. On a general locally compact Polish space, pointwise coercivity (lim_{y→∞} d(x,y)=∞ for each fixed x) does not imply tightness of {Y_n} with E_μ[d(X,Y_n)] bounded when the source μ itself has escaping mass: for x far out, d(x,y) can remain moderate for correspondingly far y, so Markov-type bounds fail without uniformity in x. The mutual-information functional then has no guaranteed weak limit in P(Y), leaving the attainment step open. The one-point-compactification argument for bounded distortions is less exposed to this issue.","agreement_with_reader":"partial"},"referee_report":{"model":"grok-4.3","summary":"The paper establishes existence of optimal reproduction distributions attaining the rate-distortion infimum for general sources when the reproduction alphabet is a locally compact Polish space and the distortion measure is lower semi-continuous. It provides two complementary mechanisms: one-point compactification for bounded distortions, and concentration-compactness for unbounded coercive distortions. Several counterexamples are given to show that the attainability results are close to sharp, yielding a unified existence theorem beyond the classical compact-alphabet setting.","tokens_in":1759,"tokens_out":490,"duration_ms":28955,"significance":"If the central claims hold, the results meaningfully extend classical rate-distortion attainability theorems (which rely on compactness and continuity) to noncompact alphabets under only lower semi-continuity. The explicit proof strategies, use of standard topological tools, and sharpness counterexamples constitute a solid contribution to information theory on general alphabets, with potential applicability to source coding problems involving unbounded or noncompact reproduction spaces.","major_comments":[{"comment":"Unbounded coercive case (concentration-compactness argument): pointwise coercivity (lim_{y→∞} d(x,y)=∞ for each fixed x) does not automatically imply tightness of minimizing sequences {Y_n} when the source μ itself has escaping mass. Without uniformity in x, Markov-type bounds on E_μ[d(X,Y_n)] may fail to control mass escape in Y, so weak convergence in P(Y) is not guaranteed and the attainment step remains open. This directly affects the central existence claim for the unbounded case.","section":"unbounded coercive distortions section"},{"comment":"The one-point compactification argument for bounded distortions is less exposed but should still verify that the extended distortion remains lower semi-continuous at the point at infinity and that the infimum is preserved under the compactification.","section":"bounded distortions section"}],"minor_comments":[{"comment":"Notation for the rate-distortion functional and the sets of admissible reproduction measures should be introduced with explicit definitions early in the paper to improve readability.","section":"introduction"},{"comment":"A few counterexamples could benefit from explicit numerical values or simple concrete alphabets (e.g., R with quadratic distortion) to make the sharpness claims more transparent.","section":"counterexamples section"}],"recommendation":"major_revision","confidential_remarks":"The manuscript fits well within cs.IT scope. The citation pattern appears standard; no obvious omissions of key prior work on noncompact rate-distortion."},"author_rebuttal":{"model":"grok-4.3","summary":"We are grateful to the referee for the insightful comments and the recommendation for major revision. We address each major comment below and will make the necessary revisions to strengthen the manuscript.","responses":[{"response":"We thank the referee for highlighting this potential gap. We agree that pointwise coercivity requires additional care to ensure tightness of the minimizing sequences. In the revised manuscript, we will strengthen the argument by first using the tightness of the source measure μ (guaranteed since the alphabet is Polish) to truncate the source to a compact set with high probability. On this compact set, the lower semi-continuity of the distortion allows us to establish effective uniformity of the coercivity for the purpose of applying Markov's inequality to control the escape of mass in Y_n. We will include this detailed step in the concentration-compactness proof. This addresses the concern and confirms the attainment result under the stated conditions.","revision_made":"yes","referee_comment":"[unbounded coercive distortions section] Unbounded coercive case (concentration-compactness argument): pointwise coercivity (lim_{y→∞} d(x,y)=∞ for each fixed x) does not automatically imply tightness of minimizing sequences {Y_n} when the source μ itself has escaping mass. Without uniformity in x, Markov-type bounds on E_μ[d(X,Y_n)] may fail to control mass escape in Y, so weak convergence in P(Y) is not guaranteed and the attainment step remains open. This directly affects the central existence claim for the unbounded case."},{"response":"We thank the referee for this constructive comment. We will revise the bounded distortions section to explicitly verify that the one-point compactification preserves the lower semi-continuity of the distortion measure at the added point at infinity. Specifically, we will show that the extended distortion function is lower semi-continuous on the compactified space. Furthermore, we will demonstrate that the rate-distortion infimum remains unchanged under this compactification, as measures assigning positive mass to the infinity point can be approximated by sequences of measures supported on the original alphabet without increasing the mutual information or the expected distortion. These verifications will be added to the manuscript.","revision_made":"yes","referee_comment":"[bounded distortions section] The one-point compactification argument for bounded distortions is less exposed but should still verify that the extended distortion remains lower semi-continuous at the point at infinity and that the infimum is preserved under the compactification."}],"tokens_in":1306,"tokens_out":526,"duration_ms":45705,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that this paper proves the rate-distortion infimum is attained for lower semi-continuous distortions on locally compact Polish alphabets. It splits the problem into bounded distortions, handled by one-point compactification, and unbounded coercive distortions, handled by concentration-compactness, plus counterexamples that show the conditions are nearly sharp. This extends the classical compact-alphabet results without requiring continuity of the distortion or compactness of the reproduction space. The approach is a direct, useful addition for settings like real-valued or integer alphabets that come up in practice. The outline in the abstract is clean and the reliance on standard Polish-space properties keeps the derivations straightforward with no circularity or fitted parameters. The bounded case looks especially solid because compactification sidesteps tightness questions. The unbounded case is where the stress-test concern lands: pointwise coercivity does not automatically produce tightness when the source measure itself has escaping mass, so the weak-convergence step for the mutual-information functional needs the concentration-compactness argument to be fully rigorous. If the full proofs close that gap, the issue is minor; otherwise it is the spot that referees should examine first. Overall the work is honest and addresses a real gap. It is the sort of paper that information theorists working on general alphabets will want to cite when they need existence without truncation. I would bring it to a reading group focused on foundations. It deserves peer review because the contribution is concrete and the technical claims are checkable.","headline":"This paper supplies existence theorems for rate-distortion on noncompact alphabets via one-point compactification and concentration-compactness.","tokens_in":2217,"tokens_out":363,"would_cite":true,"duration_ms":27551,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[{"relation":"unclear","rs_module":"IndisputableMonolith/Cost/FunctionalEquation.lean (Jcost, washburn_uniqueness_aczel)","rs_theorem":null,"paper_passage":"Theorem 7 (Tightness of Minimizing Sequences) ... Assumption 4 (Coercivity of the Distortion Function) ... lim d_Y(y',y)→∞ ρ(x,y)=+∞ ... proper Polish space ... concentration-compactness principle"},{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/RealityFromDistinction.lean","rs_theorem":"reality_from_one_distinction","paper_passage":"Generalized Concentration-compactness Lemma I ... Compactness / Vanishing / Dichotomy alternatives"}],"headline":"Rate-distortion existence via concentration-compactness on proper Polish spaces; no structural overlap with RS forcing chain","alignment":"orthogonal","rationale":"The paper's central machinery (generalized Lions concentration-compactness lemma on unbounded proper Polish spaces, coercivity Assumption 4 forcing tightness of minimizing sequences for the dual functional J_β, lower-semi-continuity of the rate-distortion functional) is a standard variational-analysis argument in information theory. It has no isomorphism to any RS theorem: no J-cost functional, no φ-ladder, no 8-tick periodicity, no parameter-free derivation of constants, and no recognition-cost forcing. The domain (existence of RD minimizers under LSC + coercivity) lies outside the RS scope.","tokens_in":53572,"confidence":"high","tokens_out":352,"duration_ms":12531,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Rate-distortion infima are attained for lower semi-continuous distortions on locally compact Polish alphabets.","keywords":["rate-distortion theory","lower semi-continuous distortion","noncompact alphabets","existence of optimal distributions","Polish spaces","one-point compactification","concentration-compactness"],"falsifier":"An explicit locally compact Polish alphabet together with a lower semi-continuous distortion for which no minimizing reconstruction distribution exists would falsify the attainability claim.","tokens_in":2528,"feed_emoji":"📊","tokens_out":568,"duration_ms":27402,"temperature":0.7,"pith_summary":"This paper establishes existence of optimal reconstruction distributions for rate-distortion problems when the reproduction alphabet is noncompact. The authors prove two complementary mechanisms under lower semi-continuity: one-point compactification works for bounded distortions, while concentration-compactness handles unbounded coercive distortions. These results apply directly to alphabets such as the real line that classical compactness-based theorems cannot cover. The paper supplies counterexamples showing the conditions are close to sharp.","feed_headline":"Rate-distortion infima attained on noncompact alphabets","feed_subtitle":"Lower semi-continuous distortions on locally compact Polish spaces guarantee existence via compactification or concentration-compactness.","key_machinery":"Lower semi-continuity of the distortion function on a locally compact Polish reproduction alphabet, which permits one-point compactification for bounded cases or concentration-compactness for coercive unbounded cases to produce minimizing reconstruction distributions.","core_discovery":"When the reproduction alphabet is a locally compact Polish space and the distortion function is lower semi-continuous, the rate-distortion infimum is attained. Bounded distortions yield attainment through the one-point compactification argument. Unbounded coercive distortions yield attainment through a concentration-compactness argument. Several counterexamples confirm that these attainability conditions are nearly necessary.","pith_inferences":["The results justify direct rate-distortion analysis of continuous-valued sources without preliminary discretization.","Similar existence arguments may apply to related quantities such as channel capacity under matching distortion constraints.","Numerical optimization procedures for finding optimal distributions gain theoretical support in these noncompact settings."],"forward_implications":["The rate-distortion function is achieved by some reconstruction distribution whenever the stated conditions hold.","Optimal rate-distortion performance is attainable without requiring the reproduction alphabet to be compact.","Existence extends to common noncompact alphabets such as the real line under bounded or coercive distortions.","The two mechanisms together give a unified existence theorem for lower semi-continuous distortions."],"fun_headline_variants":["Rate-distortion attainment on noncompact Polish alphabets","Compactification attains bounded rate-distortion infima","Concentration-compactness for unbounded rate-distortion problems","Counterexamples nearly sharp for rate-distortion existence"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The reproduction alphabet is a locally compact Polish space.","fun_headline_variants_meta":{"raw":{"variants":["Rate-distortion attainment on noncompact Polish alphabets","Compactification attains bounded rate-distortion infima","Concentration-compactness for unbounded rate-distortion problems","Counterexamples nearly sharp for rate-distortion existence"]},"model":"grok-4.3","cost_usd":0.006006,"raw_usage":{"total_tokens":2794,"prompt_tokens":568,"num_sources_used":0,"completion_tokens":58,"cost_in_usd_ticks":60062000,"prompt_tokens_details":{"text_tokens":568,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2168,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":568,"tokens_out":58,"duration_ms":22812,"temperature":1.0,"reasoning_tokens":2168,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-16T15:43:46.765574+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An explicit locally compact Polish alphabet together with a lower semi-continuous distortion for which no minimizing reconstruction distribution exists would falsify the attainability claim.","supporting_citations":[],"review_version":1}