Estimation.NPIV.DR
Doubly robust estimation of linear functionals of the NPIV structural function.
Estimator 5 core · 0 supporting Defines estimator-level helpers and local instances for the doubly robust NPIV development. ★ trae_dr_estimator_eq_avg_phi
Defines estimator-level helpers and local instances for the doubly robust NPIV development. The module exposes sample, measure, and inverse-problem-system fields in the form used by the DR rate and limit theorems.
For a measurable sample space with a measure and an inverse-problem system, the measurable structure on the observation space is the measurable structure specified by that system.
Definition (Lean source)
For a measurable sample space with a measure and an inverse-problem system, the measurable structure on the covariate space is the measurable structure specified by that system.
Definition (Lean source)
For a measurable sample space with a measure and an inverse-problem system, the measurable structure on the instrument space is the measurable structure specified by that system.
Definition (Lean source)
The one-shot TRAE doubly robust estimator averages the plug-in pseudo-outcome over the evaluation fold of a split sample, using an inverse-problem system on a measured sample space, its observation law, the primal and dual nuisance sequences, and the selected sample size and realization.
Definition (Lean source)
Estimator unfolding. For primal nuisance estimators ĥ_n, indexed by sample size and by outcome, paired with dual nuisance estimators q̂_n, an inverse-problem system, an i.i.d. sample, and a one-shot cross-fitting split, the one-shot TRAE doubly robust estimator evaluated at sample size n and outcome ω equals the average, over the evaluation fold B(n), of the pointwise doubly-robust pseudo-outcome φ_{ĥ_n,q̂_n} computed at each fold member's observation.
Formal statement
Proof (Lean source)
AsymptoticLinear 3 core · 3 supporting States and proves an asymptotic-linearity criterion for the doubly robust NPIV estimator. ★ trae_dr_isAsymLinear
States and proves an asymptotic-linearity criterion for the doubly robust NPIV estimator. Its hypothesis bundle contains exactly the candidate-membership, mixed-bias, empirical-process, and finite-variance conditions used to isolate the leading oracle-score term.
The oracle score for an inverse-problem system on a measured sample space, a dual nuisance, and an observation is the true-primal pseudo-outcome minus the scalar target.
Definition (Lean source)
The TRAE-DR remainder hypotheses state that both fitted nuisances stay in their candidate classes, their √-scaled mixed-bias integral is negligible, the centered plug-in empirical-process remainder vanishes at the √-rate, and the oracle score has finite variance. These are precisely the inputs consumed by the asymptotic-linearity criterion.
Definition (Lean source)
Support condition for the formal mixed-bias identity: the fitted primal and dual nuisance functions lie in the candidate classes for every sample size and outcome.
Unconditional mixed-bias sufficient criterion: scaling the mixed-bias
integral by √|B(n)| is o_p(1) under μ. This is the unconditional
assumption used here rather than the conditional-on-training-fold
hypothesis from the paper statement.
Empirical-process / mean-squared-continuity remainder (iii):
the centered fold-B sum of φ̂_n − φ₀ is o_p(1) after √|B(n)|
scaling.
(iv) Finite oracle-score variance: E[ρ₀² ] < ∞ under P_W.
Abstract TRAE-DR asymptotic-linearity criterion. For an inverse-problem system, a dual solution, an i.i.d. sample, a one-shot split, primal nuisance functions, and dual nuisance functions, suppose the candidate-membership, unconditional mixed-bias, empirical-process, and finite-variance conditions hold. Given the observation-law bridge and measurability of the oracle score, the TRAE-DR estimator is asymptotically linear at the structural target, with the oracle score as its mean-zero, finite-variance influence function.
Formal statement
Proof (Lean source)
3 supporting declarations (lemmas, instances)
-
mean_zero_of_DualSolution_mutheorem — Mean-zero of the oracle score under the structural law μ.Proof (Lean source)
theorem mean_zero_of_DualSolution_mu {Ω : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ] (S : InverseProblemSystem Ω μ) {q₀ : S.𝒵 → ℝ} (hq₀ : S.DualSolution q₀) : ∫ ω, ρ₀ S q₀ (S.W ω) ∂μ = 0 := by have hphi_int : Integrable (fun ω => S.phiVal S.h₀ q₀ (S.W ω)) μ := by unfold InverseProblemSystem.phiVal exact ((S.integrable_m_e S.h₀ S.h₀_mem).add (S.integrable_m q₀ hq₀.mem)).sub (S.integrable_qh S.h₀ S.h₀_mem q₀ hq₀.mem) have htheta_int : Integrable (fun _ : Ω => S.θ₀) μ := integrable_const _ have hzero := Θ_q₀_eq_θ₀ S hq₀ S.h₀_mem unfold ρ₀ rw [integral_sub hphi_int htheta_int] unfold InverseProblemSystem.Θ InverseProblemSystem.phi at hzero rw [hzero] simp -
mean_zero_of_DualSolutiontheorem — Mean-zero of the oracle score under the observation law P_W.hypothesesΩ :S :q₀ :S.𝒵 → ℝhq₀ :S.DualSolution q₀P_W :Measure S.𝒲h_law_W :μ.map S.W = P_Whρ₀_meas :Measurable (ρ₀ S q₀)conclusion∫ w, ρ₀ S q₀ w ∂P_W = 0Proof (Lean source)
theorem mean_zero_of_DualSolution {Ω : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ] (S : InverseProblemSystem Ω μ) {q₀ : S.𝒵 → ℝ} (hq₀ : S.DualSolution q₀) {P_W : Measure S.𝒲} (h_law_W : μ.map S.W = P_W) (hρ₀_meas : Measurable (ρ₀ S q₀)) : ∫ w, ρ₀ S q₀ w ∂P_W = 0 := by rw [← h_law_W] rw [MeasureTheory.integral_map S.meas_W.aemeasurable hρ₀_meas.aestronglyMeasurable] exact mean_zero_of_DualSolution_mu S hq₀ -
mixed_bias_isLittleOp_of_pointwise_boundtheorem — For an inverse-problem system, an i.i.d. sample, a one-shot sample split, primal nuisance estimators, dual nuisance estimators, and a real upper-bound sequence, if the absolute mixed-bias integral is bounded pointwise by that sequence and the fold-scaled bound is o_p(1), then the fold-scaled mixed-bias integral is o_p(1).hypothesesΩ :S :q₀ :S.𝒵 → ℝP_W :Measure S.𝒲sample :IIDSample Ω S.𝒲 μ P_Wsplit :OneShotSplit sampleh_hat :ℕ → Ω → (S.𝒳 → ℝ)q_hat :ℕ → Ω → (S.𝒵 → ℝ)bnd :ℕ → Ω → ℝ_h_dom :∀ n ω,|∫ ω', (q₀ (S.zOf (S.W ω')) - q_hat n ω (S.zOf (S.W ω'))) * (h_hat n ω (S.xOf (S.W ω')) - S.h₀ (S.xOf (S.W ω'))) ∂μ|≤ bnd n ω_h_rate :IsLittleOp (fun n ω => sqrt ((split.foldB n).card : ℝ) * bnd n ω) (fun _ => (1 : ℝ)) μconclusionIsLittleOp (fun n ω => sqrt ((split.foldB n).card : ℝ) * ∫ ω', (q₀ (S.zOf (S.W ω')) - q_hat n ω (S.zOf (S.W ω'))) * (h_hat n ω (S.xOf (S.W ω')) - S.h₀ (S.xOf (S.W ω'))) ∂μ) (fun _ => (1 : ℝ)) μProof (Lean source)
theorem mixed_bias_isLittleOp_of_pointwise_bound {Ω : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ] (S : InverseProblemSystem Ω μ) {q₀ : S.𝒵 → ℝ} {P_W : Measure S.𝒲} [IsProbabilityMeasure P_W] (sample : IIDSample Ω S.𝒲 μ P_W) (split : OneShotSplit sample) (h_hat : ℕ → Ω → (S.𝒳 → ℝ)) (q_hat : ℕ → Ω → (S.𝒵 → ℝ)) (bnd : ℕ → Ω → ℝ) (_h_dom : ∀ n ω, |∫ ω', (q₀ (S.zOf (S.W ω')) - q_hat n ω (S.zOf (S.W ω'))) * (h_hat n ω (S.xOf (S.W ω')) - S.h₀ (S.xOf (S.W ω'))) ∂μ| ≤ bnd n ω) (_h_rate : IsLittleOp (fun n ω => sqrt ((split.foldB n).card : ℝ) * bnd n ω) (fun _ => (1 : ℝ)) μ) : IsLittleOp (fun n ω => sqrt ((split.foldB n).card : ℝ) * ∫ ω', (q₀ (S.zOf (S.W ω')) - q_hat n ω (S.zOf (S.W ω'))) * (h_hat n ω (S.xOf (S.W ω')) - S.h₀ (S.xOf (S.W ω'))) ∂μ) (fun _ => (1 : ℝ)) μ := by -- Reference to `sample` is intentional: the conclusion is the precise -- form of the `mixed_bias` field above, indexed by `split.foldB`. let _ := sample intro ε hε rw [ENNReal.tendsto_nhds_zero] intro δ hδ have hrate := (ENNReal.tendsto_nhds_zero.mp (_h_rate ε hε)) δ hδ filter_upwards [hrate] with n hn refine (measure_mono ?_).trans hn intro ω hω simp only [Set.mem_setOf_eq, mul_one, Real.norm_eq_abs] at hω ⊢ let bias : ℝ := ∫ ω', (q₀ (S.zOf (S.W ω')) - q_hat n ω (S.zOf (S.W ω'))) * (h_hat n ω (S.xOf (S.W ω')) - S.h₀ (S.xOf (S.W ω'))) ∂μ have h_bnd_nonneg : 0 ≤ bnd n ω := le_trans (abs_nonneg bias) (_h_dom n ω) have h_sqrt_nonneg : 0 ≤ sqrt ((split.foldB n).card : ℝ) := Real.sqrt_nonneg _ have h_abs_bias : |sqrt ((split.foldB n).card : ℝ) * bias| = sqrt ((split.foldB n).card : ℝ) * |bias| := by rw [abs_mul, abs_of_nonneg h_sqrt_nonneg] have h_abs_bnd : |sqrt ((split.foldB n).card : ℝ) * bnd n ω| = sqrt ((split.foldB n).card : ℝ) * bnd n ω := by rw [abs_of_nonneg (mul_nonneg h_sqrt_nonneg h_bnd_nonneg)] rw [show (∫ ω', (q₀ (S.zOf (S.W ω')) - q_hat n ω (S.zOf (S.W ω'))) * (h_hat n ω (S.xOf (S.W ω')) - S.h₀ (S.xOf (S.W ω'))) ∂μ) = bias from rfl, h_abs_bias] at hω rw [h_abs_bnd] exact hω.trans (mul_le_mul_of_nonneg_left (_h_dom n ω) h_sqrt_nonneg)
AsymptoticNormal 2 core · 1 supporting Derives asymptotic normality for the doubly robust NPIV estimator from asymptotic linearity, Gaussian score limits, and studentization/continuous-mapping inputs. ★ trae_dr_asymp_normal★ trae_dr_studentized
Derives asymptotic normality for the doubly robust NPIV estimator from asymptotic linearity, Gaussian score limits, and studentization/continuous-mapping inputs.
TRAE-DR asymptotic normality from abstract remainder bounds. For an inverse-problem system, a dual solution, an i.i.d. sample, a one-shot split, primal nuisance functions, and dual nuisance functions, assume the abstract remainder conditions, the observation-law bridge, measurability of the oracle score, measurability of the rescaled estimator, and measurability of its normalized oracle-score sum. Then the rescaled estimator converges along the evaluation folds to the centered Gaussian law whose variance is the oracle score's second moment.
Formal statement
Proof (Lean source)
Studentized TRAE-DR convergence. For an inverse-problem system, a dual solution, an i.i.d. sample, a one-shot split, primal nuisance functions, and dual nuisance functions, assume the abstract remainder conditions, the observation-law bridge, a standard-deviation estimator, a positive limiting standard deviation satisfying the oracle second-moment identity, its consistency in probability, measurability of the oracle score, and the required estimator, oracle-sum, and studentized-statistic measurability conditions. Then the studentized statistic converges in distribution to the standard normal law.
Formal statement
Proof (Lean source)
1 supporting declaration (lemmas, instances)
-
trae_dr_wald_coverage_of_event_bridgetheorem — Wald-coverage transfer from a probability bridge. For an inverse-problem system, a dual solution q₀, an i.i.d. sample, a one-shot split, primal nuisance estimators, and dual nuisance estimators satisfying the TRAE-DR remainder conditions, assume the sample's W-marginal is P_W, a standard-deviation-estimator sequence, a limiting standard deviation, its strict positivity, the oracle variance identity, standard-deviation consistency in probability, and measurability of ρ₀, the rescaled estimator, its normalized-sum representation, and the studentized statistic. For a cutoff, if the Wald coverage probability and the studentized interval probability become asymptotically equal, then the Wald coverage probability converges to the standard-normal mass on [-z,z].hypothesesΩ :S :q₀ :S.𝒵 → ℝhq₀ :S.DualSolution q₀P_W :Measure S.𝒲sample :IIDSample Ω S.𝒲 μ P_Wsplit :OneShotSplit sampleh_hat :ℕ → Ω → (S.𝒳 → ℝ)q_hat :ℕ → Ω → (S.𝒵 → ℝ)_hyps :TRAEDRRemainderHyps S hq₀ sample split h_hat q_hath_law_W :μ.map S.W = P_Wσ_hat_n :ℕ → Ω → ℝσ₀ :ℝ_hσ₀_pos :0 < σ₀_hσ_eq :σ₀ ^ 2 = ∫ w, (ρ₀ S q₀ w) ^ 2 ∂P_W_hσ_consistent :Modes.TendstoInProbability (fun _ : ℕ => μ) σ_hat_n atTop (fun _ _ => σ₀)h_ρ₀_meas :Measurable (ρ₀ S q₀)h_meas_θ :∀ n,AEMeasurable (IsAsymLinear.rescaledEstimator (trae_dr_estimator S sample split h_hat q_hat) S.θ₀ split.foldB n) μh_meas_sum :∀ n, AEMeasurable (IsAsymLinear.normalizedSum sample (ρ₀ S q₀) split.foldB n) μh_studentized_meas :∀ n,AEMeasurable (fun ω => sqrt ((split.foldB n).card : ℝ) * (trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀) / σ_hat_n n ω) μz :ℝh_wald_studentized :Tendsto (fun n => (μ {ω | |trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀| ≤ z * σ_hat_n n ω / sqrt ((split.foldB n).card : ℝ)}).toReal - (μ {ω | sqrt ((split.foldB n).card : ℝ) * (trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀) / σ_hat_n n ω ∈ Icc (-z) z}).toReal) atTop (𝓝 0)conclusionTendsto (fun n => (μ {ω | |trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀| ≤ z * σ_hat_n n ω / sqrt ((split.foldB n).card : ℝ)}).toReal) atTop (𝓝 ((gaussianMeasure 0 1) (Icc (-z) z)).toReal)Proof (Lean source)
theorem trae_dr_wald_coverage_of_event_bridge {Ω : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ] (S : InverseProblemSystem Ω μ) {q₀ : S.𝒵 → ℝ} (hq₀ : S.DualSolution q₀) {P_W : Measure S.𝒲} [IsProbabilityMeasure P_W] (sample : IIDSample Ω S.𝒲 μ P_W) (split : OneShotSplit sample) (h_hat : ℕ → Ω → (S.𝒳 → ℝ)) (q_hat : ℕ → Ω → (S.𝒵 → ℝ)) (_hyps : TRAEDRRemainderHyps S hq₀ sample split h_hat q_hat) (h_law_W : μ.map S.W = P_W) (σ_hat_n : ℕ → Ω → ℝ) (σ₀ : ℝ) (_hσ₀_pos : 0 < σ₀) (_hσ_eq : σ₀ ^ 2 = ∫ w, (ρ₀ S q₀ w) ^ 2 ∂P_W) (_hσ_consistent : Modes.TendstoInProbability (fun _ : ℕ => μ) σ_hat_n atTop (fun _ _ => σ₀)) (h_ρ₀_meas : Measurable (ρ₀ S q₀)) (h_meas_θ : ∀ n, AEMeasurable (IsAsymLinear.rescaledEstimator (trae_dr_estimator S sample split h_hat q_hat) S.θ₀ split.foldB n) μ) (h_meas_sum : ∀ n, AEMeasurable (IsAsymLinear.normalizedSum sample (ρ₀ S q₀) split.foldB n) μ) (h_studentized_meas : ∀ n, AEMeasurable (fun ω => sqrt ((split.foldB n).card : ℝ) * (trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀) / σ_hat_n n ω) μ) (z : ℝ) (h_wald_studentized : Tendsto (fun n => (μ {ω | |trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀| ≤ z * σ_hat_n n ω / sqrt ((split.foldB n).card : ℝ)}).toReal - (μ {ω | sqrt ((split.foldB n).card : ℝ) * (trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀) / σ_hat_n n ω ∈ Icc (-z) z}).toReal) atTop (𝓝 0)) : Tendsto (fun n => (μ {ω | |trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀| ≤ z * σ_hat_n n ω / sqrt ((split.foldB n).card : ℝ)}).toReal) atTop (𝓝 ((gaussianMeasure 0 1) (Icc (-z) z)).toReal) := by let studentized : ℕ → Ω → ℝ := fun n ω => sqrt ((split.foldB n).card : ℝ) * (trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀) / σ_hat_n n ω let coverProb : ℕ → ℝ := fun n => (μ {ω | |trae_dr_estimator S sample split h_hat q_hat n ω - S.θ₀| ≤ z * σ_hat_n n ω / sqrt ((split.foldB n).card : ℝ)}).toReal let studProb : ℕ → ℝ := fun n => (μ {ω | studentized n ω ∈ Icc (-z) z}).toReal change Tendsto (fun n => coverProb n - studProb n) atTop (𝓝 0) at h_wald_studentized have hStud : Modes.TendstoInLaw (fun _ : ℕ => μ) studentized atTop (gaussianMeasure 0 1) := by simpa [studentized] using trae_dr_studentized S hq₀ sample split h_hat q_hat _hyps h_law_W σ_hat_n σ₀ _hσ₀_pos _hσ_eq _hσ_consistent h_ρ₀_meas h_meas_θ h_meas_sum h_studentized_meas have hfrontier : gaussianMeasure 0 1 (frontier (Icc (-z) z)) = 0 := by by_cases hz : 0 ≤ z · have hle : -z ≤ z := by linarith rw [frontier_Icc hle] rw [show ({-z, z} : Set ℝ) = {-z} ∪ {z} by ext x; simp [or_comm]] exact le_antisymm (by calc gaussianMeasure 0 1 (({-z} : Set ℝ) ∪ {z}) ≤ gaussianMeasure 0 1 ({-z} : Set ℝ) + gaussianMeasure 0 1 ({z} : Set ℝ) := measure_union_le _ _ _ = 0 := by simp [gaussianMeasure_zero_one_singleton]) zero_le · rw [Set.Icc_eq_empty (by linarith)] simp have hpm := Modes.TendstoInLaw.tendsto_measure_of_null_frontier hStud hfrontier have hstudent_event : Tendsto studProb atTop (nhds ((gaussianMeasure 0 1) (Icc (-z) z)).toReal) := by refine hpm.congr' ?_ filter_upwards with n rw [Measure.map_apply_of_aemeasurable (h_studentized_meas n) measurableSet_Icc] rfl have hsum := hstudent_event.add h_wald_studentized have hsum' : Tendsto (fun n => studProb n + (coverProb n - studProb n)) atTop (nhds ((gaussianMeasure 0 1) (Icc (-z) z)).toReal) := by simpa using hsum refine (hsum'.congr' ?_) filter_upwards with n simp [coverProb]
PrimalRate 1 core · 1 supporting The primal theorem is stated in the L²(sigma(X)) strong norm. ★ primal_l2_consistency_of_rate
Passing the primal NPIV rate to the doubly robust layer
The primal theorem is stated in the L²(sigma(X)) strong norm. This module
proves its equivalence to an explicit eLpNorm convergence statement and
derives that convergence from the primal rate theorem. The current doubly
robust remainder bundle has no nuisance-consistency field.
The fitted primal nuisance converges to the truth in the ambient L² metric in probability when an NPIV operator system and its primal TRAE estimator sequence satisfy source smoothness and bias conditions, admissible regularization and localized regimes, valid confidence levels with critical-radius and peeling floors, vanishing confidence and localization sequences, and vanishing regularization and scaled variance.
Formal statement
Proof (Lean source)
1 supporting declaration (lemmas, instances)
-
primal_l2_consistency_iff_strongNormtheorem — Given an NPIV operator system, a sequence of primal nuisance estimators, and membership of every fitted nuisance in the primal candidate space, strong-norm convergence in probability is equivalent to convergence in the corresponding explicit ambient L² metric.hypothesesOmega :S :OperatorSystem Omega muh_hat :ℕ → Omega → S.𝒳 → ℝhmem :∀ n omega, h_hat n omega ∈ S.HbarProof (Lean source)
theorem primal_l2_consistency_iff_strongNorm {Omega : Type*} [MeasurableSpace Omega] {mu : Measure Omega} (S : OperatorSystem Omega mu) (h_hat : ℕ → Omega → S.𝒳 → ℝ) (hmem : ∀ n omega, h_hat n omega ∈ S.Hbar) : Modes.TendstoInProbability (fun _ : ℕ => mu) (fun n omega => S.strongNorm (S.hL2 (hmem n omega) - S.hL2 S.h₀_mem)) atTop (fun _ _ => 0) ↔ Modes.TendstoInProbability (fun _ : ℕ => mu) (fun n omega => (eLpNorm (fun omega' => h_hat n omega (S.xOf (S.W omega')) - S.h₀ (S.xOf (S.W omega'))) 2 mu).toReal) atTop (fun _ _ => 0) := by have hfun : (fun n omega => S.strongNorm (S.hL2 (hmem n omega) - S.hL2 S.h₀_mem)) = fun n omega => (eLpNorm (fun omega' => h_hat n omega (S.xOf (S.W omega')) - S.h₀ (S.xOf (S.W omega'))) 2 mu).toReal := by funext n omega exact S.strongNorm_hL2_sub_eq_eLpNorm_toReal (hmem n omega) S.h₀_mem rw [hfun]