{"id":"f2659f27-a677-4c90-bfeb-2fec69334787","arxiv_id":"2506.06776","paper_version":3,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Develops bootstrap-based tests for solvability of linear inequality systems with estimated coefficients and proves uniform validity over broad classes of data-generating processes.","lead":"This paper develops bootstrap tests to check if a system of linear inequalities with estimated coefficients has any solution. Economists studying partially identified models can use it to test complex constraints that arise in empirical work.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Bootstrap uniform validity requires continuity of the LP value function at the true parameter, which can fail when the optimum is attained at a vertex or binding constraint in partially identified settings.","rationale":"The reader's weakest assumption already isolates the regularity conditions on the LP value function. This is the precise point at which the uniform-validity claim is most exposed; confirming or refuting continuity in the relevant boundary cases directly tests whether the bootstrap procedure inherits the claimed robustness.","tokens_in":1611,"tokens_out":327,"duration_ms":24685,"concrete_test":"Construct a simple two-constraint example in which the true LP value is exactly zero and the optimum is attained at a vertex; draw 5000 Monte Carlo samples of size n=200 from a DGP that places the true coefficients exactly at the kink; compute the bootstrap test at nominal 5% level and check whether rejection frequency exceeds 0.07.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper reduces the hypothesis to whether the value of a linear program equals zero and then applies bootstrap to the estimated value. Uniform validity of this bootstrap over the stated classes rests on continuity (or Hadamard directional differentiability) of the LP value map at the true coefficient vector. When the true parameter lies on the boundary of the feasible region or the optimum is attained at a kink, small perturbations in the estimated coefficients can produce jumps in the value function, violating the conditions invoked for the uniform convergence argument. The abstract and the claimed large classes do not automatically guarantee this continuity in the applications to partially identified models.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper studies testing solvability of systems of linear equalities and inequalities with estimated coefficients. It reformulates the null as the optimal value of an associated linear program equaling zero, develops bootstrap tests for this hypothesis, and claims uniform validity over large classes of data-generating processes. The approach is positioned as covering a wide range of inferential questions in partially identified models, with supporting Monte Carlo evidence and two empirical applications.","tokens_in":1749,"tokens_out":581,"duration_ms":49734,"significance":"If the uniform validity result holds, the framework unifies testing procedures across many partially identified settings by reducing them to a common linear-programming form. The exploitation of LP duality for the characterization and the bootstrap construction for uniform inference are technically appealing strengths. Simulation results indicating good finite-sample performance for moderate sample sizes add practical value, though the result's applicability hinges on the regularity conditions being satisfied in the targeted econometric applications.","major_comments":[{"comment":"Abstract and the section establishing uniform validity of the bootstrap: the claimed uniform validity over large classes of DGPs rests on continuity (or Hadamard directional differentiability) of the linear-program value function at the true coefficient vector. When the optimum is attained at a vertex or binding constraint—as is typical in partially identified models with set-valued parameters—small perturbations in the estimated coefficients can induce jumps in the value, violating the conditions needed for the uniform convergence argument. The manuscript should either add explicit assumptions ensuring continuity in the relevant applications or delineate the boundary cases where the bootstrap may fail.","section":"Abstract and bootstrap validity section"},{"comment":"The reduction of partially identified inference problems to solvability of linear inequalities (likely §2 or §3): while the LP-value characterization is clean, the paper must verify that the moment and continuity conditions invoked for uniform bootstrap validity are satisfied for the specific linear programs arising in standard partially identified models (e.g., moment inequalities with estimated support functions). Without this verification, the “large classes” claim remains too abstract to support the central inferential contribution.","section":"Characterization of hypotheses in partially identified models"}],"minor_comments":[{"comment":"The abstract refers to “large classes of data-generating processes” without listing the key regularity conditions (moment bounds, continuity of the value map, etc.) up front; moving a concise statement of these conditions to the introduction would improve readability.","section":"Abstract"},{"comment":"Simulation section: additional detail on the design of the data-generating processes (e.g., how binding constraints or vertices are generated) would help readers assess whether the reported good performance covers the boundary cases raised in the major comments.","section":"Simulation results"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive and insightful comments on our manuscript. These observations help clarify the scope and applicability of our uniform validity results. We address each major comment below and will revise the paper to incorporate additional discussion and verifications as outlined.","responses":[{"response":"We appreciate this careful reading of the technical conditions underlying our bootstrap validity result. The proof in the manuscript relies on Hadamard directional differentiability of the linear-program value function, which is established for the class of LPs considered and holds even when the optimum occurs at a vertex or binding constraint; the directional derivative is given by the dual problem evaluated at the active set and remains well-defined under the maintained moment and non-degeneracy conditions. Nevertheless, we agree that an explicit statement of these regularity conditions and a delineation of boundary cases would strengthen the presentation. We will revise the bootstrap validity section (and the abstract if space permits) to state the precise assumptions guaranteeing directional differentiability, discuss their interpretation in partially identified settings, and note the (measure-zero) cases where the bootstrap may fail due to degeneracy.","revision_made":"yes","referee_comment":"[Abstract and bootstrap validity section] Abstract and the section establishing uniform validity of the bootstrap: the claimed uniform validity over large classes of DGPs rests on continuity (or Hadamard directional differentiability) of the linear-program value function at the true coefficient vector. When the optimum is attained at a vertex or binding constraint—as is typical in partially identified models with set-valued parameters—small perturbations in the estimated coefficients can induce jumps in the value, violating the conditions needed for the uniform convergence argument. The manuscript should either add explicit assumptions ensuring continuity in the relevant applications or delineate the boundary cases where the bootstrap may fail."},{"response":"We agree that concrete verification for leading applications would make the scope of the results more transparent. In the revised manuscript we will add a dedicated subsection (or appendix) that verifies the required moment and continuity conditions for two canonical cases: (i) testing a finite set of moment inequalities with estimated support functions, and (ii) inference on parameters defined by linear equality and inequality restrictions on reduced-form coefficients. Under standard assumptions (bounded moments, positive-definite asymptotic covariance, and interior or non-degenerate binding constraints), the directional differentiability and moment conditions hold, thereby confirming that the uniform validity result applies directly to these settings.","revision_made":"yes","referee_comment":"[Characterization of hypotheses in partially identified models] The reduction of partially identified inference problems to solvability of linear inequalities (likely §2 or §3): while the LP-value characterization is clean, the paper must verify that the moment and continuity conditions invoked for uniform bootstrap validity are satisfied for the specific linear programs arising in standard partially identified models (e.g., moment inequalities with estimated support functions). Without this verification, the “large classes” claim remains too abstract to support the central inferential contribution."}],"tokens_in":1320,"tokens_out":622,"duration_ms":67729,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main takeaway is that many inference problems in partially identified models reduce to asking whether an estimated system of linear equalities and inequalities has a solution. The authors turn this into a test of whether a particular linear program evaluates to zero and then build bootstrap procedures around that, claiming uniform validity across large classes of data-generating processes. Simulations look reasonable even at moderate sample sizes, and they show the method in two empirical examples. That practical framing is the useful part here. It gives applied researchers a concrete way to handle a common type of question without having to derive case-by-case asymptotics each time. The LP reformulation itself draws on standard duality, so the technical lift comes mainly from the bootstrap step and the uniformity argument. On the soft spots, the uniform validity result rests on continuity or directional differentiability of the LP value function at the true parameter. In partially identified settings the optimum often sits at a vertex or along a binding constraint, where small perturbations in the estimated coefficients can produce discrete jumps in the value. The abstract invokes large classes of DGPs to cover this, but without the explicit regularity conditions or the full proof it is hard to tell whether those classes actually exclude the boundary cases that arise in typical applications. If the continuity fails, the bootstrap critical values may not deliver the claimed coverage. This work is aimed at econometricians who routinely deal with set-identified models in microeconomics or industrial organization. A reader who needs a general-purpose test for these solvability questions will find a ready-to-use procedure and some evidence that it behaves well in finite samples. The paper has enough structure and empirical illustration to merit sending out for referee reports, mainly so the proofs and the precise conditions can be checked against the continuity concern.","headline":"The paper recasts testing solvability of estimated linear inequality systems as checking whether an LP value hits zero, then applies bootstrap with uniform validity claims over broad DGPs.","tokens_in":2202,"tokens_out":421,"would_cite":false,"duration_ms":30788,"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","rs_theorem":"washburn_uniqueness_aczel","paper_passage":"We show that a wide range of inferential questions in partially identified models can be formulated as hypotheses of this form... bootstrap-based testing procedures and establish their uniform validity"},{"relation":"unclear","rs_module":"IndisputableMonolith/Foundation/RealityFromDistinction.lean","rs_theorem":"reality_from_one_distinction","paper_passage":"Building on Shapiro (1991) and Fang and Santos (2019)... uniformly valid over large classes of data-generating processes"}],"headline":"Econometric bootstrap for LP-value tests in partial ID has no structural overlap with RS forcing chain","alignment":"orthogonal","rationale":"Paper centers on reformulating moment-inequality and linear-system tests as H0: v=0 for an LP (Examples 2.1-2.4), then constructing bootstrap critical values under MFCQ, compactness, and uniform asymptotic normality (Theorems 4.7, 4.14, 4.21, 4.29). These are standard econometric tools for uniform size control over DGPs; they invoke continuity/Hadamard differentiability of the value map at boundary points but introduce no J-cost, ratio symmetry, φ-ladder, 8-tick periodicity, or parameter-free constant derivations. RS modules (Cost/FunctionalEquation, Foundation/RealityFromDistinction, AlexanderDuality) contain none of this statistical machinery and make no claims about bootstrap validity or LP solvers.","tokens_in":62480,"confidence":"high","tokens_out":376,"duration_ms":9569,"cache_read_input_tokens":32896,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Testing solvability of systems of linear inequalities with estimated coefficients covers many questions in partially identified models.","keywords":["linear inequalities","bootstrap test","partial identification","hypothesis testing","econometrics","linear programming","uniform validity"],"falsifier":"A counterexample data-generating process within the claimed class where the bootstrap test fails to achieve the correct asymptotic size or power properties as the sample size increases.","tokens_in":2506,"feed_emoji":"📊","tokens_out":418,"duration_ms":25936,"temperature":0.7,"pith_summary":"The paper establishes that testing whether a system of linear equalities and inequalities has a solution, where the coefficients are estimated, can address a wide range of inferential questions in partially identified models. It provides an equivalent way to express this test as checking if a particular linear program has value zero. From this characterization, bootstrap-based testing procedures are developed that are uniformly valid over broad classes of data-generating processes. The methods show good performance in simulations for moderate sample sizes and are demonstrated in empirical applications.","feed_headline":"Bootstrap tests check solvability of estimated linear inequalities","feed_subtitle":"This unifies testing for many questions in partially identified models by checking if a linear program's value is zero.","key_machinery":"The alternative characterization of the solvability hypothesis as the value of a certain linear program being equal to zero, which enables the application of bootstrap methods for testing.","core_discovery":"The authors characterize the hypothesis that a system of linear equalities and inequalities admits a solution in terms of a linear program having value zero, and then construct bootstrap tests for this hypothesis that achieve uniform validity over large classes of data-generating processes. This formulation allows many inferential questions in partially identified models to be cast and tested in this unified way.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Bootstrap tests solvability of estimated linear inequalities","Linear program value tests inequality system solvability","Bootstrap tests for partial identification with linear programs","Testing solvability of linear inequalities using bootstrap"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The data-generating processes belong to classes where moment bounds and continuity of the linear program value function hold to support the uniform convergence of the bootstrap procedures.","fun_headline_variants_meta":{"raw":{"variants":["Bootstrap tests solvability of estimated linear inequalities","Linear program value tests inequality system solvability","Bootstrap tests for partial identification with linear programs","Testing solvability of linear inequalities using bootstrap"]},"model":"grok-4.3","cost_usd":0.01183,"raw_usage":{"total_tokens":5028,"prompt_tokens":538,"num_sources_used":0,"completion_tokens":53,"cost_in_usd_ticks":118303000,"prompt_tokens_details":{"text_tokens":538,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":4437,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":538,"tokens_out":53,"duration_ms":65002,"temperature":1.0,"reasoning_tokens":4437,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-19T11:00:29.165622+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A counterexample data-generating process within the claimed class where the bootstrap test fails to achieve the correct asymptotic size or power properties as the sample size increases.","supporting_citations":[],"review_version":1}