Introduction
Causal mediation analysis provides a principled framework for understanding the mechanisms through which a treatment affects an outcome [5 , 22 , 38 ] (Pearl 2022). It moves beyond testing whether an overall effect exists to ask how that effect operates by separating the total effect into a direct effect, representing the effect through other pathways, and an indirect effect, representing the effect through an intermediate variable (referred to as the mediator ). The statistical literature on mediation analysis has developed from its early regression-based formulations. The product-of-coefficients method of Baron and Kenny (1986) offered an intuitive way to study mediated pathways. Later, the potential-outcomes framework of Rubin (1974) allowed mediation to be defined in formal causal terms through natural direct and indirect effects [32 ] (Pearl 2022), along with the conditions for their identification [22 ] . Subsequent work developed semiparametric, weighting, and multiply robust methods for their estimation and inference [35 , 38 , 37 ] . More recent work has addressed high-dimensional mediation problems, even when the number of mediators is much larger than the sample size through variable selection, sparse regression, and related inferential techniques [41 , 21 , 10 , 42 , 46 , 30 , 18 , 19 , 20 , 31 , 8 ] . However, in many real-world applications, the true mediators are not directly observed; instead, researchers may rely on a potentially large number of surrogate measurements that provide indirect information about the underlying mediator. Our motivating application uses DNA methylation profiles from the Alzheimer’s Disease Neuroimaging Initiative (ADNI) study to investigate a latent biological pathway between depressive symptoms and cognitive impairment. Oxidative stress has been implicated in both depression and Alzheimer’s disease (AD) [7 , 9 ] . Direct quantification of reactive oxygen species (ROS) is difficult because of their short lifespan and high reactivity [23 ] . Researchers therefore rely on more stable molecular signatures that reflect oxidative activity. Among them is DNA methylation, which can be altered in response to oxidative stress and can be measured at scale [26 , 28 , 7 ] . While DNA methylation provides a useful surrogate for investigating the mediating role of oxidative stress, its measurement across hundreds of thousands of CpG sites using high-throughput assays produces a high-dimensional data structure in which individual sites capture only partial aspects of the underlying biological process. When the pre-treatment covariates needed for confounding adjustment are also measured indirectly, both the mediator and the covariates must be related to their observed surrogates. One way to describe this measurement structure is through a latent factor model, in which a small number of unobserved variables generate the common variation across many noisy measurements [3 , 13 ] .
Mediation analysis with indirectly measured variables has received attention in fixed-dimensional settings [1 ] , with fewer developments for high-dimensional measurements [11 ] . Proxy-based methods establish identification of mediation effects when the mediator is hidden and suitable proxy measurements are available [16 ] . Related factor-based approaches account for dependence among observed high-dimensional exposures and mediators [44 ] or accommodate individualized and time-varying mediation effects [45 ] . Despite these developments, existing results do not directly characterize how the dimensions of noisy surrogate measurements determine the error in recovering the latent mediation functional when both the mediator and the pre-treatment covariates are unobserved. In particular, it remains to be established when mediation regressions based on low-dimensional projections of these surrogates approximate the latent target closely enough to permit inference with the same first-order precision as if the latent factors were observed. This question becomes more delicate when the working factor dimensions exceed the true dimensions, because some directions then contain only measurement noise. For example, if there are three true factors but we estimate five, two linear combinations of the estimated factors contain no signal from the true factors. Their variances shrink as the number of surrogates grows, which can make the regression matrices nearly singular and the estimated regression coefficients unstable.
To address these questions, we propose Factor-Adjusted Regression for Mediation Analysis (FARMA), a factor-based framework for identification, estimation, and inference with high-dimensional surrogates of latent mediators and pre-treatment covariates. Building on factor-model approaches for high-dimensional data [4 , 3 , 13 , 14 , 12 ] , FARMA constructs low-dimensional projections of the surrogate covariates and mediators and incorporates these projected factors into cross-fitted mediation regressions. Under some standard assumptions, these projections retain information about the underlying latent factor spaces while reducing the contribution of measurement noise. Our analysis allows the fixed working dimensions to exceed these true factor dimensions and accounts for the additional directions that contain only measurement noise. The main contributions of this paper are threefold:
Identification. We establish asymptotic identification of the causal natural direct and indirect effects when both the mediator and the relevant covariate factors are latent. With a fixed number of surrogates, the target effects are generally not point identified from the observed data alone without strong restrictions on the data-generating process. We show that suitable projections of the high-dimensional surrogates yield an observed-data parameter that approaches the latent target as the number of measurements increases, leading to asymptotic point identification.
Estimation. Building on the identification result, we develop a cross-fitted estimator of the causal mediation effects using projected surrogate factors. The method does not require exact knowledge of the true factor dimensions and remains valid when fixed working dimensions are chosen as upper bounds on the true dimensions. Under suitable regularity and growth conditions on the surrogate dimensions, we show that the resulting estimator is n \sqrt{n} n -consistent and asymptotically normal for the parameter of interest. This result provides the basis for statistical inference on the natural direct and indirect effects even when mediators are not observed directly.
Application. We apply FARMA to investigate the effect of depression on Alzheimer’s disease (AD) mediated by oxidative stress, where the mediating process is not directly observed and is instead represented by high-dimensional DNA methylation measurements. We illustrate the approach using data from the Alzheimer’s Disease Neuroimaging Initiative (ADNI) Study.
The remainder of the paper is organized as follows. § 2 presents the problem setting and model. § 3 establishes identification of the target parameter. § 4 introduces the FARMA. § 5 develops the asymptotic theory. § 6 reports the simulation results. § 7 presents the application to the ADNI dataset. § 8 concludes with a discussion of future work.
Model Setting
We consider a binary treatment variable A ∈ { 0 , 1 } A \in\{0,1\} A ∈ { 0 , 1 } (also called exposure or action variable ), and a real-valued outcome Y ∈ R Y \in\mathbb{R} Y ∈ R . For each individual, we consider mediators f M = [ f M 1 , … , f M q ˉ ] ∈ R q ˉ \mathbf{f}_M = [f_{M1}, \ldots, f_{M\bar{q}}] \in\mathbb{R}^{\bar{q}} f M = [ f M 1 , … , f M q ˉ ] ∈ R q ˉ through which treatment may influence the outcome, and pre-treatment covariates f X = [ f X 1 , … , f X p ˉ ] ∈ R p ˉ \mathbf{f}_X = [f_{X1}, \ldots, f_{X\bar{p}}] \in\mathbb{R}^{\bar{p}} f X = [ f X 1 , … , f X p ˉ ] ∈ R p ˉ , which capture baseline characteristics that may confound the relationship among treatment, mediators and outcome. We use lowercase notation, such as f M i f_{Mi} f M i and f X j f_{Xj} f X j , to denote the individual coordinates within these factors, respectively. The treatment can influence the outcome in two ways, indirectly through the mediators, or directly without passing through them. Formally, the variables are assumed to be generated from the following structural equations:
f M = ( 1 − A ) ( δ 0 + B 0 f X + u X , M , 0 ) + A ( δ 1 + B 1 f X + u X , M , 1 ) , Y = ( 1 − A ) ( α 0 + β 0 T f X + γ 0 T f M + ϵ 0 ) + A ( α 1 + β 1 T f X + γ 1 T f M + ϵ 1 ) , (1) \begin{aligned}
\mathbf{f}_M &= (1-A)(\delta_0+\mathbf{B}_0\mathbf{f}_X+\mathbf{u}_{X,M,0}) + A(\delta_1+\mathbf{B}_1\mathbf{f}_X+\mathbf{u}_{X,M,1}),\\
Y &= (1-A)(\alpha_0+\beta_0^{\mathsf{T}}\mathbf{f}_X+\gamma_0^{\mathsf{T}}\mathbf{f}_M+\epsilon_0) + A(\alpha_1+\beta_1^{\mathsf{T}}\mathbf{f}_X+\gamma_1^{\mathsf{T}}\mathbf{f}_M+\epsilon_1), \tag*{(1)}
\end{aligned} f M Y = ( 1 − A ) ( δ 0 + B 0 f X + u X , M , 0 ) + A ( δ 1 + B 1 f X + u X , M , 1 ) , = ( 1 − A ) ( α 0 + β 0 T f X + γ 0 T f M + ϵ 0 ) + A ( α 1 + β 1 T f X + γ 1 T f M + ϵ 1 ) , (1)
where ϵ 0 \epsilon_0 ϵ 0 and ϵ 1 \epsilon_1 ϵ 1 are centered outcome errors on the control and treated arms, u X , M , 0 ∈ R q ˉ \mathbf{u}_{X,M,0} \in\mathbb{R}^{\bar{q}} u X , M , 0 ∈ R q ˉ and u X , M , 1 ∈ R q ˉ \mathbf{u}_{X,M,1} \in\mathbb{R}^{\bar{q}} u X , M , 1 ∈ R q ˉ are the corresponding centered mediator structural noises, B 0 , B 1 ∈ R q ˉ × p ˉ \mathbf{B}_0,\mathbf{B}_1 \in\mathbb{R}^{\bar{q}\times\bar{p}} B 0 , B 1 ∈ R q ˉ × p ˉ , β 0 , β 1 ∈ R p ˉ \beta_0,\beta_1 \in\mathbb{R}^{\bar{p}} β 0 , β 1 ∈ R p ˉ , and γ 0 , γ 1 ∈ R q ˉ \gamma_0,\gamma_1 \in\mathbb{R}^{\bar{q}} γ 0 , γ 1 ∈ R q ˉ are unknown coefficients, and δ 0 , δ 1 ∈ R q ˉ \delta_0,\delta_1 \in\mathbb{R}^{\bar{q}} δ 0 , δ 1 ∈ R q ˉ and α 0 , α 1 ∈ R \alpha_0,\alpha_1 \in\mathbb{R} α 0 , α 1 ∈ R are intercepts. Note that we allow for an A − f X A-f_X A − f X interaction in the generation of f M \mathbf{f}_M f M , and A − f X A-f_X A − f X and A − f M A-f_M A − f M interactions in the generation of the outcome Y Y Y .
In many real-world applications, f X \mathbf{f}_X f X and f M \mathbf{f}_M f M are latent (i.e., unobserved). Instead, we observe measurements X ∈ R p \mathbf{X} \in\mathbb{R}^{p} X ∈ R p and M ∈ R q \mathbf{M} \in\mathbb{R}^{q} M ∈ R q that serve as noisy surrogates for these latent variables. We focus on high-dimensional measurements with p ≫ p ˉ p \gg\bar{p} p ≫ p ˉ and q ≫ q ˉ q \gg\bar{q} q ≫ q ˉ . We adopt the following factor model for the observed measurements:
X = Γ X f X + u X , M = Γ M f M + u M , (2) \mathbf{X} = \mathbf{\Gamma}_X\mathbf{f}_X + \mathbf{u}_X,\qquad\mathbf{M} = \mathbf{\Gamma}_M\mathbf{f}_M + \mathbf{u}_M, \tag*{(2)} X = Γ X f X + u X , M = Γ M f M + u M , (2)
where Γ X ∈ R p × p ˉ \mathbf{\Gamma}_X \in\mathbb{R}^{p\times\bar{p}} Γ X ∈ R p × p ˉ and Γ M ∈ R q × q ˉ \mathbf{\Gamma}_M \in\mathbb{R}^{q\times\bar{q}} Γ M ∈ R q × q ˉ are unknown loading matrices, and u X \mathbf{u}_X u X and u M \mathbf{u}_M u M are mean-zero errors. Henceforth, we refer to f X \mathbf{f}_X f X and f M \mathbf{f}_M f M as latent factors. Figure 1 summarizes the causal relationships among the latent factors, treatment, and outcome specified in (1) with the measurement relationships in (2) . The standard mediation model with directly observed covariates and mediators is recovered as a special case by setting p = p ˉ p = \bar{p} p = p ˉ , q = q ˉ q = \bar{q} q = q ˉ , Γ X = I p \Gamma_X = I_p Γ X = I p , and Γ M = I q \Gamma_M = I_q Γ M = I q , with vanishing errors. In this case, X = f X X = f_X X = f X and M = f M M = f_M M = f M , so the structural equations in (1) can be written directly in terms of the observed variables X X X and M M M .
Figure 1. Causal diagram for the factor-augmented mediation model. The observed high-dimensional variables X \mathbf{X} X and M \mathbf{M} M are generated from the latent factors f X \mathbf{f}_X f X and f M \mathbf{f}_M f M , respectively.
We first consider the setting in which f X f_X f X and f M f_M f M are directly observed, and define the causal estimands using the potential-outcomes framework ([33 , 32 ] ). For each individual, let Y ( a , f M ) Y^{(a,f_M)} Y ( a , f M ) denote the potential outcome under treatment A = a A = a A = a and mediator value f M = f M f_M = f_M f M = f M , and let f M ( a ) f_M^{(a)} f M ( a ) denote the potential mediator value under treatment A = a A = a A = a , where a ∈ { 0 , 1 } a \in\{0,1\} a ∈ { 0 , 1 } . The potential outcome under treatment a a a is then Y ( a ) = Y ( a , f M ( a ) ) Y^{(a)} = Y^{(a,f_M^{(a)})} Y ( a ) = Y ( a , f M ( a ) ) . The average treatment effect (ATE) admits the following decomposition:
E [ Y ( 1 ) − Y ( 0 ) ] = E [ Y ( 1 , f M ( 1 ) ) − Y ( 1 , f M ( 0 ) ) ] ⏟ Total Effect + E [ Y ( 1 , f M ( 0 ) ) − Y ( 0 , f M ( 0 ) ) ] ⏟ Indirect Effect + E [ Y ( 1 , f M ( 0 ) ) − Y ( 0 , f M ( 0 ) ) ] ⏟ Direct Effect (3) \mathbb{E}\left[Y^{(1)} - Y^{(0)}\right]
=
\underbrace{\mathbb{E}\left[Y^{(1,f_M^{(1)})} - Y^{(1,f_M^{(0)})}\right]}_{\text{Total Effect}}
+
\underbrace{\mathbb{E}\left[Y^{(1,f_M^{(0)})} - Y^{(0,f_M^{(0)})}\right]}_{\text{Indirect Effect}}
+
\underbrace{\mathbb{E}\left[Y^{(1,f_M^{(0)})} - Y^{(0,f_M^{(0)})}\right]}_{\text{Direct Effect}} \tag*{(3)} E [ Y ( 1 ) − Y ( 0 ) ] = Total Effect E [ Y ( 1 , f M ( 1 ) ) − Y ( 1 , f M ( 0 ) ) ] + Indirect Effect E [ Y ( 1 , f M ( 0 ) ) − Y ( 0 , f M ( 0 ) ) ] + Direct Effect E [ Y ( 1 , f M ( 0 ) ) − Y ( 0 , f M ( 0 ) ) ] (3)
The two terms on the right-hand side are the total indirect effect and the pure direct effect, respectively, in the terminology of Robins and Greenland [32 ] . Following Pearl (2022), we refer to them as the natural indirect effect (NIE) and the natural direct effect (NDE). In our setting, these effects are defined with respect to f M f_M f M . The NIE measures the effect of changing the mediator from its potential value under control to its potential value under treatment, while holding treatment fixed at A = 1 A = 1 A = 1 . The NDE measures the effect of changing treatment from A = 0 A = 0 A = 0 to A = 1 A = 1 A = 1 , while holding the mediator at its potential value under control.
The decomposition in (3) depends on three counterfactual means, E [ Y ( 1 ) ] \mathbb{E}[Y^{(1)}] E [ Y ( 1 ) ] (≡ E [ Y ( 1 , f M ( 1 ) ) ] \equiv\mathbb{E}[Y^{(1,f_M^{(1)})}] ≡ E [ Y ( 1 , f M ( 1 ) ) ] ), E [ Y ( 0 ) ] \mathbb{E}[Y^{(0)}] E [ Y ( 0 ) ] (≡ E [ Y ( 0 , f M ( 0 ) ) ] \equiv\mathbb{E}[Y^{(0,f_M^{(0)})}] ≡ E [ Y ( 0 , f M ( 0 ) ) ] ), and E [ Y ( 1 , f M ( 0 ) ) ] \mathbb{E}[Y^{(1,f_M^{(0)})}] E [ Y ( 1 , f M ( 0 ) ) ] . Under consistency, positivity and sequential ignorability, the first two can be identified using some standard covariate adjustment. E [ Y ( 1 , f M ( 0 ) ) ] \mathbb{E}[Y^{(1,f_M^{(0)})}] E [ Y ( 1 , f M ( 0 ) ) ] is a cross-world mean that combines the outcome under treatment with the mediator value that would arise under control. Since its identification requires additional assumptions that links the outcome and mediator across treatment regimes, we consider this as our parameter of interest,
θ 0 : = E [ Y ( 1 , f M ( 0 ) ) ] . (4) \theta_0 := \mathbb{E}\left[Y^{(1,f_M^{(0)})}\right]. \tag*{(4)} θ 0 := E [ Y ( 1 , f M ( 0 ) ) ] . (4)
To identify θ 0 \theta_0 θ 0 , we impose the following standard assumptions.
Assumption 2.1 (Consistency). Y ( a , f M ) = Y Y^{(a,f_M)} = Y Y ( a , f M ) = Y if A = a A = a A = a , f M = f M f_M = f_M f M = f M ; f M ( a ) = f M f_M^{(a)} = f_M f M ( a ) = f M if A = a ∀ a , f M A = a \ \forall\ a,f_M A = a ∀ a , f M .
Assumption 2.2 (Positivity). *For all strata of f X f_X f X , the probability of being in the treatment and control group is positive, i.e., 0 < P ( A = a ∣ f X = f X ) 0 < P(A = a \mid f_X = f_X) 0 < P ( A = a ∣ f X = f X ) , and the conditional density of the mediator is positive, i.e., 0 < P ( f M ∣ A = a , f X = f X ) 0 < P(f_M \mid A = a,f_X = f_X) 0 < P ( f M ∣ A = a , f X = f X ) for all A A A , f X f_X f X and f M f_M f M .
In addition to positivity and consistency, we operate under the assumption of sequential exchangeability (Imai et al., [22 ] ), which implies that there are no unobserved confounders for the treatment-outcome, mediator-outcome, and treatment-mediator relationships:
Assumption 2.3 (Sequential exchangeability). Let X 1 ⊥ X 2 ∣ X 3 X_1 \perp X_2 \mid X_3 X 1 ⊥ X 2 ∣ X 3 indicate that the random variables X 1 X_1 X 1 and X 2 X_2 X 2 are conditionally independent given the random variable X 3 X_3 X 3 .
Y ( a , f M ) ⊥ { A , f M } ∣ f X Y^{(a,f_M)} \perp\{A,f_M\} \mid f_X Y ( a , f M ) ⊥ { A , f M } ∣ f X , ∀ a , f M \forall\ a,f_M ∀ a , f M ,
f M ( a ) ⊥ A ∣ f X f_M^{(a)} \perp A \mid f_X f M ( a ) ⊥ A ∣ f X , ∀ a \forall\ a ∀ a ,
Y ( a , f M ) ⊥ f M ( a ′ ) ∣ f X Y^{(a,f_M)} \perp f_M^{(a')} \mid f_X Y ( a , f M ) ⊥ f M ( a ′ ) ∣ f X , ∀ a , a ′ , f M \forall\ a,a',f_M ∀ a , a ′ , f M .
These assumptions concern the latent covariates f X f_X f X and latent mediators f M f_M f M . Under consistency, positivity, and sequential exchangeability, the mediation formula of Imai et al. [22 ] expresses θ 0 \theta_0 θ 0 as a functional of the joint distribution of ( Y , A , f X , f M ) (Y,A,f_X,f_M) ( Y , A , f X , f M ) :
θ 0 = ∬ E [ Y ∣ f X = f X , f M = f M , A = 1 ] d P f M ∣ f X , A ( f M ∣ f X , 0 ) d P f X ( f X ) . (5) \theta_0 = \iint\mathbb{E}[Y \mid f_X = f_X, f_M = f_M, A = 1] \, dP_{f_M\mid f_X,A}(f_M \mid f_X,0) \, dP_{f_X}(f_X). \tag*{(5)} θ 0 = ∬ E [ Y ∣ f X = f X , f M = f M , A = 1 ] d P f M ∣ f X , A ( f M ∣ f X , 0 ) d P f X ( f X ) . (5)
Here, the mediation functional combines three components: the outcome regression under treatment, the conditional distribution of the mediator factors under control, and the marginal distribution of the covariate factors. This representation identifies θ 0 \theta_0 θ 0 from the distribution involving the latent factors. In our setting, however, f X f_X f X and f M f_M f M are unobserved, so these components cannot be estimated directly from the available measurements X X X and M M M . Under the linear structural model, (5) yields the closed form
θ 0 = E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + γ 1 T δ 0 . (6) \theta_0 = \mathbb{E}\left[Y^{(1,f_M^{(0)})}\right] = \alpha_1 + \gamma_1^{\mathsf{T}}\delta_0. \tag*{(6)} θ 0 = E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + γ 1 T δ 0 . (6)
where the covariate contribution vanishes under E [ f X ] = 0 \mathbb{E}[f_X] = 0 E [ f X ] = 0 . Building on this, we can more generally define the mediation functional for any a , a ′ ∈ { 0 , 1 } a, a' \in\{0, 1\} a , a ′ ∈ { 0 , 1 } as θ a a ′ = E [ Y ( a , f M ( a ′ ) ) ] \theta_{aa'} = \mathbb{E}[Y^{(a,f_{M}^{(a')})}] θ a a ′ = E [ Y ( a , f M ( a ′ ) ) ] . In particular, θ 10 = θ 0 \theta_{10} = \theta_0 θ 10 = θ 0 , where the two baseline potential outcomes are as follows:
θ 00 = E [ Y ( 0 ) ] = α 0 + γ 0 T δ 0 , θ 11 = E [ Y ( 1 ) ] = α 1 + γ 1 T δ 1 . (7) \theta_{00} = \mathbb{E}[Y^{(0)}] = \alpha_0 + \gamma_0^{\mathsf{T}}\delta_0,\qquad\theta_{11} = \mathbb{E}[Y^{(1)}] = \alpha_1 + \gamma_1^{\mathsf{T}}\delta_1. \tag*{(7)} θ 00 = E [ Y ( 0 ) ] = α 0 + γ 0 T δ 0 , θ 11 = E [ Y ( 1 ) ] = α 1 + γ 1 T δ 1 . (7)
Following the decomposition in (3) , the natural direct and indirect effects are given by
θ N D E = θ 10 − θ 00 , θ N I E = θ 11 − θ 10 , (8) \theta_{\mathrm{NDE}} = \theta_{10} - \theta_{00},\qquad\theta_{\mathrm{NIE}} = \theta_{11} - \theta_{10}, \tag*{(8)} θ NDE = θ 10 − θ 00 , θ NIE = θ 11 − θ 10 , (8)
so that the total effect is θ 11 − θ 00 = θ N D E + θ N I E \theta_{11} - \theta_{00} = \theta_{\mathrm{NDE}} + \theta_{\mathrm{NIE}} θ 11 − θ 00 = θ NDE + θ NIE . Hence, evaluating these effects requires recovering θ 10 \theta_{10} θ 10 , θ 00 \theta_{00} θ 00 , and θ 11 \theta_{11} θ 11 from the observed data. However, a central challenge that still remains is that their coefficients are defined through models involving unobserved latent factors rather than direct measurements. In § 3 , we show how suitable projections of the high-dimensional surrogates allow us to overcome this and identify the parameters from observed data under appropriate conditions as the surrogate dimensions increase.
Notations. Throughout the paper, let n n n denote the sample size, and let p p p and q q q denote the dimensions of the surrogate vectors X X X and M M M , respectively. For any random variable, vector, or matrix X X X , let E [ X ] \mathbb{E}[X] E [ X ] denote its expectation and E [ X ∣ ⋅ ] \mathbb{E}[X \mid\cdot] E [ X ∣ ⋅ ] its conditional expectation. Let P ( ⋅ ) P(\cdot) P ( ⋅ ) denote probability and P ( ⋅ ∣ ⋅ ) P(\cdot\mid\cdot) P ( ⋅ ∣ ⋅ ) conditional probability. Let Cov ( X ) \operatorname{Cov}(X) Cov ( X ) (or Σ X \Sigma_X Σ X ) denote its covariance matrix, and let Cov ( X ∣ ⋅ ) \operatorname{Cov}(X \mid\cdot) Cov ( X ∣ ⋅ ) represent its conditional covariance matrix. Let N ( μ , Σ ) \mathcal{N}(\mu, \Sigma) N ( μ , Σ ) denote the multivariate Gaussian distribution with mean μ \mu μ and covariance Σ \Sigma Σ . For any vector x x x , let ∥ x ∥ 2 \lVert x\rVert_2 ∥ x ∥ 2 denote its Euclidean norm. For any matrix X X X , let X T X^{\mathsf{T}} X T denote its transpose, and let ∥ X ∥ o p \lVert X\rVert_{\mathrm{op}} ∥ X ∥ op and ∥ X ∥ F \lVert X\rVert_{\mathrm{F}} ∥ X ∥ F denote its operator norm and Frobenius norm, respectively. Let 1 d \mathbf{1}_d 1 d and 0 d \mathbf{0}_d 0 d denote vectors of all ones and all zeros in dimension d d d (such as 1 p \mathbf{1}_p 1 p or 1 q \mathbf{1}_q 1 q ), and let I d I_d I d denote the d × d d \times d d × d identity matrix. For real numbers a a a and b b b , define a ∨ b = max { a , b } a \vee b = \max\{a,b\} a ∨ b = max { a , b } and a ∧ b = min { a , b } a \wedge b = \min\{a,b\} a ∧ b = min { a , b } . We denote the smallest and largest eigenvalues of a symmetric matrix X X X by λ min ( X ) \lambda_{\min}(X) λ m i n ( X ) and λ max ( X ) \lambda_{\max}(X) λ m a x ( X ) , and the smallest and largest singular values of a rectangular matrix A A A by ν min ( A ) \nu_{\min}(A) ν m i n ( A ) and ν max ( A ) \nu_{\max}(A) ν m a x ( A ) . For two possibly random sequences a n a_n a n and b n b_n b n , write a n ≪ b n a_n \ll b_n a n ≪ b n (equivalently b n ≫ a n b_n \gg a_n b n ≫ a n ) if a n = o p ( b n ) a_n = o_p(b_n) a n = o p ( b n ) , meaning a n / b n → p 0 a_n/b_n \xrightarrow{p} 0 a n / b n p 0 whenever the ratio is well defined.
Identification
In this section, we show that high-dimensional surrogate measurements provide the information needed to identify the mediation functional when both the covariates and mediators of interest are latent. Recall from § 2 , under Assumptions 2.1–2.3, the structural models, and E [ f X ] = 0 \mathbb{E}[f_X] = 0 E [ f X ] = 0 , the causal estimand reduces to θ 0 = E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + γ 1 T δ 0 \theta_0 = \mathbb{E}[Y^{(1,f_M^{(0)})}] = \alpha_1 + \gamma_1^{\mathsf{T}}\delta_0 θ 0 = E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + γ 1 T δ 0 . When the surrogate dimensions p p p and q q q are fixed and the latent factors are unobserved, θ 0 \theta_0 θ 0 is not generally identifiable. Since the surrogates are noisy measurements, their idiosyncratic errors do not vanish at fixed dimension, and the map from observed moments to structural coefficients is confounded by the error covariances Σ u X \Sigma_{u_X} Σ u X and Σ u M \Sigma_{u_M} Σ u M .
To overcome this, we establish approximate identification results for θ 0 \theta_0 θ 0 , where the target is recovered up to an error that vanishes as p , q → ∞ p,q \to\infty p , q → ∞ . Since the latent factors are pervasive (Assumption 3.2(ii)), information about each factor is shared across many surrogate measurements, which allows low-dimensional projections to preserve common factor information while filtering out idiosyncratic noise. We show that, under the structural models in (2.1)–(2.2), θ 0 \theta_0 θ 0 becomes point identifiable as the dimensions p , q → ∞ p,q \to\infty p , q → ∞ . We begin by stating the assumptions needed for identification of θ 0 \theta_0 θ 0 . These assumptions ensure that the latent factors and the structural and proxy errors are well-behaved.
Assumption 3.1 (Sampling, latent factors, and errors). There exist constants 0 < c < C < ∞ 0 < c < C < \infty 0 < c < C < ∞ , independent of n , p , q n,p,q n , p , q , such that the following conditions hold for each a ∈ { 0 , 1 } a \in\{0,1\} a ∈ { 0 , 1 } .
(i) The sequence { ( X i , A i , u X , i , u M , i , u X M , 0 , i , u X M , 1 , i , ϵ 0 , i , ϵ 1 , i ) } i = 1 n \{(X_i,A_i,u_{X,i},u_{M,i},u_{XM,0,i},u_{XM,1,i},\epsilon_{0,i},\epsilon_{1,i})\}_{i=1}^n {( X i , A i , u X , i , u M , i , u X M , 0 , i , u X M , 1 , i , ϵ 0 , i , ϵ 1 , i ) } i = 1 n is independent and identically distributed.
(ii) For i = 1 , … , n i = 1,\ldots,n i = 1 , … , n , the errors ϵ a , i \epsilon_{a,i} ϵ a , i , u X , i u_{X,i} u X , i , u M , i u_{M,i} u M , i , and u X M , a , i u_{XM,a,i} u X M , a , i are mean zero and mutually independent, and ( ϵ a , i , u X , i , u M , i , u X M , a , i ) ⊥ ⊥ ( f X , i , f M , i , A i ) (\epsilon_{a,i},u_{X,i},u_{M,i},u_{XM,a,i}) \perp\!\!\!\perp(f_{X,i},f_{M,i},A_i) ( ϵ a , i , u X , i , u M , i , u X M , a , i ) ⊥ ⊥ ( f X , i , f M , i , A i ) .
(iii) The factor dimensions p ˉ \bar{p} p ˉ and q ˉ \bar{q} q ˉ are fixed, and E [ f X ] = 0 \mathbb{E}[f_X] = 0 E [ f X ] = 0 . For v ∈ { f X , f M } v \in\{f_X,f_M\} v ∈ { f X , f M } , ∥ μ v ∥ 2 ≤ C \lVert\mu_v\rVert_2 \le C ∥ μ v ∥ 2 ≤ C .
(iv) Let f = ( f X T , f M T ) T f = (f_X^{\mathsf{T}},f_M^{\mathsf{T}})^{\mathsf{T}} f = ( f X T , f M T ) T . The conditional covariance matrices satisfy c ≤ λ min ( Σ f ∣ A = a ) ≤ λ max ( Σ f ∣ A = a ) ≤ C c \le\lambda_{\min}(\Sigma_{f\mid A=a}) \le\lambda_{\max}(\Sigma_{f\mid A=a}) \le C c ≤ λ m i n ( Σ f ∣ A = a ) ≤ λ m a x ( Σ f ∣ A = a ) ≤ C .
(v) For u ∈ { u X , u M , u X M , a } u \in\{u_X,u_M,u_{XM,a}\} u ∈ { u X , u M , u X M , a } . The error covariance matrices satisfy c ≤ λ min ( Σ u ) ≤ λ max ( Σ u ) ≤ C c \le\lambda_{\min}(\Sigma_u) \le\lambda_{\max}(\Sigma_u) \le C c ≤ λ m i n ( Σ u ) ≤ λ m a x ( Σ u ) ≤ C .
Assumption 3.1 provides baseline conditions which are common in the factor model literature and ensure the data-generating process is well-behaved. It provides the independence and moment conditions that are used in the identification argument. Assumption 3.1(ii) yields the orthogonality relations between the latent factors and idiosyncratic errors, while Assumption 3.1(iii)–(v) control the conditional means and keep the relevant covariance matrices uniformly bounded and nondegenerate. Moreover, the independence from A A A also implies that the proxy-error covariance matrices are the same in both treatment groups.
Assumption 3.2 (Model Parameters). There exist universal constants 0 < c < C < ∞ 0<c<C<\infty 0 < c < C < ∞ such that, for a ∈ { 0 , 1 } a\in\{0,1\} a ∈ { 0 , 1 } , the following conditions hold.
(i) The structural parameters are uniformly bounded, max { ∣ α a ∣ , ∥ δ a ∥ 2 , ∥ β a ∥ 2 , ∥ γ a ∥ 2 , ∥ B a ∥ o p } ≤ C \max\{|\alpha_a|,\|\delta_a\|_2,\|\beta_a\|_2,\|\gamma_a\|_2,\|\mathbf{B}_a\|_{\mathrm{op}}\}\le C max { ∣ α a ∣ , ∥ δ a ∥ 2 , ∥ β a ∥ 2 , ∥ γ a ∥ 2 , ∥ B a ∥ op } ≤ C .
(ii) The loading matrices satisfy
c ≤ λ min ( Γ X T Γ X p ) ≤ λ max ( Γ X T Γ X p ) ≤ C , c\le\lambda_{\min}\left(\frac{\boldsymbol{\Gamma}_{X}^{\mathsf{T}}\boldsymbol{\Gamma}_{X}}{p}\right)\le\lambda_{\max}\left(\frac{\boldsymbol{\Gamma}_{X}^{\mathsf{T}}\boldsymbol{\Gamma}_{X}}{p}\right)\le C, c ≤ λ m i n ( p Γ X T Γ X ) ≤ λ m a x ( p Γ X T Γ X ) ≤ C , and
c ≤ λ min ( Γ M T Γ M q ) ≤ λ max ( Γ M T Γ M q ) ≤ C . c\le\lambda_{\min}\left(\frac{\boldsymbol{\Gamma}_{M}^{\mathsf{T}}\boldsymbol{\Gamma}_{M}}{q}\right)\le\lambda_{\max}\left(\frac{\boldsymbol{\Gamma}_{M}^{\mathsf{T}}\boldsymbol{\Gamma}_{M}}{q}\right)\le C. c ≤ λ m i n ( q Γ M T Γ M ) ≤ λ m a x ( q Γ M T Γ M ) ≤ C .
Assumption 3.2 (i) requires the structural parameters to remain uniformly bounded, which rules out models in which the strength of the structural relationships diverges with the dimensions of the observed surrogates and allows the approximation error to be controlled uniformly in p p p and q q q . Assumption 3.2 (ii) requires the latent factors to be pervasive, in the sense that their loadings do not become asymptotically sparse as p , q → ∞ p,q\to\infty p , q → ∞ . This ensures that each factor contributes a non-vanishing amount of variation to X X X and M M M . A sufficient condition for Assumption 3.2(ii) is that the rows of Γ X \boldsymbol{\Gamma}_{X} Γ X and Γ M \boldsymbol{\Gamma}_{M} Γ M are independently generated from common distributions with finite second moments and positive definite second-moment matrices. Then, by SLLN, Γ X T Γ X / p \boldsymbol{\Gamma}_{X}^{\mathsf{T}}\boldsymbol{\Gamma}_{X}/p Γ X T Γ X / p and Γ M T Γ M / q \boldsymbol{\Gamma}_{M}^{\mathsf{T}}\boldsymbol{\Gamma}_{M}/q Γ M T Γ M / q converge to fixed matrices, so that the eigenvalue bounds in Assumption 3.2(ii) hold. This condition is widely used in literature [34 , 3 , 13 ] and see Example 2.1 in Fan and Liao [12 ] for more discussion.
To exploit the high-dimensional structure, we introduce projection matrices that map the observed variables onto a lower-dimensional space while preserving information about the latent factors.
Definition 3.1 (Full-Projection Matrices). The matrices W X ∈ R p × p ~ \mathbf{W}_{X}\in\mathbb{R}^{p\times\widetilde{p}} W X ∈ R p × p and W M ∈ R q × q ~ \mathbf{W}_{M}\in\mathbb{R}^{q\times\widetilde{q}} W M ∈ R q × q are called full-projection matrices with W X = p V X \mathbf{W}_{X}=\sqrt{p}\mathbf{V}_{X} W X = p V X and W M = q V M \mathbf{W}_{M}=\sqrt{q}\mathbf{V}_{M} W M = q V M where V X ∈ R p × p ~ \mathbf{V}_{X}\in\mathbb{R}^{p\times\widetilde{p}} V X ∈ R p × p and V M ∈ R q × q ~ \mathbf{V}_{M}\in\mathbb{R}^{q\times\widetilde{q}} V M ∈ R q × q have minimum and maximum bounded eigenvalues, i.e., c ≤ λ min ( V X T V X ) ≤ λ max ( V X T V X ) ≤ C c\le\lambda_{\min}(\mathbf{V}_{X}^{\mathsf{T}}\mathbf{V}_{X})\le\lambda_{\max}(\mathbf{V}_{X}^{\mathsf{T}}\mathbf{V}_{X})\le C c ≤ λ m i n ( V X T V X ) ≤ λ m a x ( V X T V X ) ≤ C and c ≤ λ min ( V M T V M ) ≤ λ max ( V M T V M ) ≤ C c\le\lambda_{\min}(\mathbf{V}_{M}^{\mathsf{T}}\mathbf{V}_{M})\le\lambda_{\max}(\mathbf{V}_{M}^{\mathsf{T}}\mathbf{V}_{M})\le C c ≤ λ m i n ( V M T V M ) ≤ λ m a x ( V M T V M ) ≤ C for some constant C C C , if the resulting matrices
H X = 1 p W X T Γ X ; H M = 1 q W M T Γ M (9) \mathbf{H}_{X}=\frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}\boldsymbol{\Gamma}_{X};\quad\mathbf{H}_{M}=\frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}\boldsymbol{\Gamma}_{M} \tag*{(9)} H X = p 1 W X T Γ X ; H M = q 1 W M T Γ M (9) have full column rank.
In § 4 , we will provide a specific choice of full-projection matrices. We next show by leveraging full-projection matrices, the parameter θ 0 \theta_0 θ 0 is (approximately) identifiable with fixed p p p and q q q . Define
θ 0 , p , q = e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] \theta_{0,p,q}=\mathbf{e}_{1}^{\mathsf{T}}\mathbb{E}[L L^{\mathsf{T}}\mid A=1]^{-1}\mathbb{E}[L Y\mid A=1] θ 0 , p , q = e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ]
+ ( e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ) ( S q ~ E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] ) . \qquad+\left(\mathbf{e}_{1}^{\mathsf{T}}\mathbb{E}[Q Q^{\mathsf{T}}\mid A=0]^{-1}\mathbb{E}[Q N^{\mathsf{T}}\mid A=0]\right)\left(\mathbf{S}_{\widetilde{q}}\mathbb{E}[L L^{\mathsf{T}}\mid A=1]^{-1}\mathbb{E}[L Y\mid A=1]\right). + ( e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ) ( S q E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] ) .
where L = ( 1 , p − 1 X T W X , q − 1 M T W M ) T L=\left(1,p^{-1}X^{\mathsf{T}}\mathbf{W}_{X},q^{-1}M^{\mathsf{T}}\mathbf{W}_{M}\right)^{\mathsf{T}} L = ( 1 , p − 1 X T W X , q − 1 M T W M ) T , Q = ( 1 , p − 1 X T W X ) T Q=\left(1,p^{-1}X^{\mathsf{T}}\mathbf{W}_{X}\right)^{\mathsf{T}} Q = ( 1 , p − 1 X T W X ) T , and N = q − 1 W M T M N=q^{-1}\mathbf{W}_{M}^{\mathsf{T}}M N = q − 1 W M T M . Here, S q ~ = [ O q ~ × ( 1 + p ~ ) I q ~ ] ∈ R q ~ × ( 1 + p ~ + q ~ ) \mathbf{S}_{\widetilde{q}}=\left[O_{\widetilde{q}\times(1+\widetilde{p})}\ I_{\widetilde{q}}\right]\in\mathbb{R}^{\widetilde{q}\times(1+\widetilde{p}+\widetilde{q})} S q = [ O q × ( 1 + p ) I q ] ∈ R q × ( 1 + p + q ) be the selection matrix that selects last q ~ \widetilde{q} q elements.
Theorem 3.1. Suppose Assumptions 2.1–2.3 and 3.1–3.2 hold. Let W X \mathbf{W}_{X} W X and W M \mathbf{W}_{M} W M be any full-projection matrices, and θ 0 \theta_0 θ 0 be defined as in Equation (6) . Then, there exists a universal constant C > 0 C>0 C > 0 independent of p p p and q q q , such that
∣ θ 0 − θ 0 , p , q ∣ ≤ C ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) ( 1 + 1 p ν min 2 ( H X ) ) . |\theta_0-\theta_{0,p,q}|\le C\left(\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_{X})}+\frac{1}{q\nu_{\min}^{2}(\mathbf{H}_{M})}\right)\left(1+\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_{X})}\right). ∣ θ 0 − θ 0 , p , q ∣ ≤ C ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) ( 1 + p ν m i n 2 ( H X ) 1 ) . If, in addition, p ν min 2 ( H X ) ↑ ∞ p\nu_{\min}^{2}(\mathbf{H}_{X})\uparrow\infty p ν m i n 2 ( H X ) ↑ ∞ and q ν min 2 ( H M ) ↑ ∞ q\nu_{\min}^{2}(\mathbf{H}_{M})\uparrow\infty q ν m i n 2 ( H M ) ↑ ∞ as p , q → ∞ p,q\to\infty p , q → ∞ , then θ 0 , p , q → θ 0 \theta_{0,p,q}\to\theta_0 θ 0 , p , q → θ 0 , i.e., θ 0 \theta_0 θ 0 is point identifiable as p , q → ∞ p,q\to\infty p , q → ∞ .
Remark 3.1. The theorem assumes that both X X X and M M M are high-dimensional. A similar argument can be developed when either X X X or M M M is treated as fixed (i.e., no factor structure is imposed), we can replace f X \mathbf{f}_{X} f X with X X X in the model and identification can still be achieved through the remaining high-dimensional component. For instance, if X X X is fixed, then ∣ θ 0 − θ 0 , q ∣ ≤ C ( q − 1 ν min − 2 ( H M ) ) |\theta_0-\theta_{0,q}|\le C(q^{-1}\nu_{\min}^{-2}(\mathbf{H}_{M})) ∣ θ 0 − θ 0 , q ∣ ≤ C ( q − 1 ν m i n − 2 ( H M )) . An analogous result holds when M M M is fixed.
Theorem 3.1 provides an upper bound for the approximation error. As a consequence, it yields identification of θ 0 \theta_0 θ 0 when p p p and q q q grow large. To the best of our knowledge, identification results of this type, have not been explicitly established in this form in the literature, including parameters such as the average treatment effect. We formalize this in the Corollary 3.2 where we define θ A T E , p , q \theta_{\mathrm{ATE},p,q} θ ATE , p , q as follows:
θ A T E , p , q = { e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] + ( e 1 T E [ Q Q T ∣ A = 1 ] − 1 E [ Q N T ∣ A = 1 ] ) ( S q ~ E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] ) } − { e 1 T E [ L L T ∣ A = 0 ] − 1 E [ L Y ∣ A = 0 ] + ( e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ) ( S q ~ E [ L L T ∣ A = 0 ] − 1 E [ L Y ∣ A = 0 ] ) } \theta_{\mathrm{ATE},p,q} =
\left\{
e_1^{\mathsf{T}}\mathbb{E}[LL^{\mathsf{T}}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]
+\left(e_1^{\mathsf{T}}\mathbb{E}[QQ^{\mathsf{T}}\mid A=1]^{-1}\mathbb{E}[QN^{\mathsf{T}}\mid A=1]\right)
\left(S_{\tilde q}\mathbb{E}[LL^{\mathsf{T}}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]\right)
\right\}
-
\left\{
e_1^{\mathsf{T}}\mathbb{E}[LL^{\mathsf{T}}\mid A=0]^{-1}\mathbb{E}[LY\mid A=0]
+\left(e_1^{\mathsf{T}}\mathbb{E}[QQ^{\mathsf{T}}\mid A=0]^{-1}\mathbb{E}[QN^{\mathsf{T}}\mid A=0]\right)
\left(S_{\tilde q}\mathbb{E}[LL^{\mathsf{T}}\mid A=0]^{-1}\mathbb{E}[LY\mid A=0]\right)
\right\} θ ATE , p , q = { e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] + ( e 1 T E [ Q Q T ∣ A = 1 ] − 1 E [ Q N T ∣ A = 1 ] ) ( S q ~ E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] ) } − { e 1 T E [ L L T ∣ A = 0 ] − 1 E [ L Y ∣ A = 0 ] + ( e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ) ( S q ~ E [ L L T ∣ A = 0 ] − 1 E [ L Y ∣ A = 0 ] ) }
Corollary 3.2. Consider the structural models in (1) –(2) . Suppose Assumptions 2.1–2.3 and 3.1–3.2 hold. Define θ A T E : = ( α 1 + γ 1 T δ 1 ) − ( α 0 + γ 0 T δ 0 ) \theta_{\mathrm{ATE}} := (\alpha_1+\gamma_1^{\mathsf{T}}\delta_1)-(\alpha_0+\gamma_0^{\mathsf{T}}\delta_0) θ ATE := ( α 1 + γ 1 T δ 1 ) − ( α 0 + γ 0 T δ 0 ) . Then, θ A T E \theta_{\mathrm{ATE}} θ ATE satisfies the conditions of Theorem 3.1, there exists a universal constant C > 0 C>0 C > 0 , independent of p p p and q q q , such that
∣ θ A T E − θ A T E , p , q ∣ ≤ C ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) ( 1 + 1 p ν min 2 ( H X ) ) . \left|\theta_{\mathrm{ATE}}-\theta_{\mathrm{ATE},p,q}\right|
\le C\left(\frac{1}{p\nu_{\min}^2(H_X)}+\frac{1}{q\nu_{\min}^2(H_M)}\right)
\left(1+\frac{1}{p\nu_{\min}^2(H_X)}\right). ∣ θ ATE − θ ATE , p , q ∣ ≤ C ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) ( 1 + p ν m i n 2 ( H X ) 1 ) . Moreover, if p ν min 2 ( H X ) → ∞ p\nu_{\min}^2(H_X)\to\infty p ν m i n 2 ( H X ) → ∞ and q ν min 2 ( H M ) → ∞ q\nu_{\min}^2(H_M)\to\infty q ν m i n 2 ( H M ) → ∞ , then θ A T E , p , q → θ A T E \theta_{\mathrm{ATE},p,q}\to\theta_{\mathrm{ATE}} θ ATE , p , q → θ ATE , and hence θ A T E \theta_{\mathrm{ATE}} θ ATE is point identifiable as p , q → ∞ p,q\to\infty p , q → ∞ .
FARMA Algorithm for Mediation Analysis
In this section, we present FARMA for estimating the mediation functional θ 0 = α 1 + γ 1 T δ 0 \theta_0=\alpha_1+\gamma_1^{\mathsf{T}}\delta_0 θ 0 = α 1 + γ 1 T δ 0 . The procedure constructs projection directions on one subsample and fits two low-dimensional regressions on the other, then interchanges the subsamples and averages the resulting estimates. Let p ~ \tilde p p ~ and q ~ \tilde q q ~ denote the working dimensions of the covariate and mediator projections, respectively.
Algorithm 1 Cross-fitted FARMA estimator of the mediation functional
Step 0: Randomly partition the sample indices into two approximately equal folds, D 1 \mathcal{D}_1 D 1 and D 2 \mathcal{D}_2 D 2 .
Step 1: Let Σ ^ X \widehat{\Sigma}_X Σ X and Σ ^ M \widehat{\Sigma}_M Σ M be the sample covariance matrices of X i X_i X i and M i M_i M i computed on D 1 \mathcal{D}_1 D 1 . Form V ^ X ∈ R p × p ~ \widehat V_X\in\mathbb{R}^{p\times\tilde p} V X ∈ R p × p ~ and V ^ M ∈ R q × q ~ \widehat V_M\in\mathbb{R}^{q\times\tilde q} V M ∈ R q × q ~ from their leading orthonormal eigenvectors, and set W X = p V ^ X W_X=\sqrt{p}\widehat V_X W X = p V X and W M = q V ^ M W_M=\sqrt{q}\widehat V_M W M = q V M .
Step 2: For each i ∈ D 2 i\in\mathcal{D}_2 i ∈ D 2 , compute the projected factors
f ^ X , i = p − 1 W X T X i , f ^ M , i = q − 1 W M T M i , \widehat f_{X,i}=p^{-1}W_X^{\mathsf{T}}X_i,\qquad\widehat f_{M,i}=q^{-1}W_M^{\mathsf{T}}M_i, f X , i = p − 1 W X T X i , f M , i = q − 1 W M T M i ,
and define Z ^ i = ( 1 , f ^ X , i T , f ^ M , i T ) T \widehat Z_i=(1,\widehat f_{X,i}^{\mathsf{T}},\widehat f_{M,i}^{\mathsf{T}})^{\mathsf{T}} Z i = ( 1 , f X , i T , f M , i T ) T and R ^ i = ( 1 , f ^ X , i T ) T \widehat R_i=(1,\widehat f_{X,i}^{\mathsf{T}})^{\mathsf{T}} R i = ( 1 , f X , i T ) T .
Step 3: Let I a = { i ∈ D 2 : A i = a } \mathcal{I}_a=\{i\in\mathcal{D}_2:A_i=a\} I a = { i ∈ D 2 : A i = a } for a ∈ { 0 , 1 } a\in\{0,1\} a ∈ { 0 , 1 } . Regress Y i Y_i Y i on Z ^ i \widehat Z_i Z i by ordinary least squares using i ∈ I 1 i\in\mathcal{I}_1 i ∈ I 1 . Denote the fitted intercept and mediator-score coefficient by α ^ 1 \widehat\alpha_1 α 1 and γ ^ 1 ∈ R q ~ \widehat\gamma_1\in\mathbb{R}^{\tilde q} γ 1 ∈ R q ~ , respectively.
Step 4: Let e 1 = ( 1 , 0 , … , 0 ) T ∈ R 1 + p ~ e_1=(1,0,\ldots,0)^{\mathsf{T}}\in\mathbb{R}^{1+\tilde p} e 1 = ( 1 , 0 , … , 0 ) T ∈ R 1 + p ~ . Regress f ^ M , i T γ ^ 1 \widehat f_{M,i}^{\mathsf{T}}\widehat\gamma_1 f M , i T γ 1 on R ^ i \widehat R_i R i using i ∈ I 0 i\in\mathcal{I}_0 i ∈ I 0 , and define the fitted intercept as
γ ^ 1 T δ ^ 0 = e 1 T ( ∑ i ∈ I 0 R ^ i R ^ i T ) − 1 ∑ i ∈ I 0 R ^ i ( f ^ M , i T γ ^ 1 ) . \widehat\gamma_1^{\mathsf{T}}\widehat\delta_0
=e_1^{\mathsf{T}}\left(\sum_{i\in\mathcal{I}_0}\widehat R_i\widehat R_i^{\mathsf{T}}\right)^{-1}
\sum_{i\in\mathcal{I}_0}\widehat R_i\left(\widehat f_{M,i}^{\mathsf{T}}\widehat\gamma_1\right). γ 1 T δ 0 = e 1 T ( i ∈ I 0 ∑ R i R i T ) − 1 i ∈ I 0 ∑ R i ( f M , i T γ 1 ) .
Step 5: Set θ ^ 0 ( 1 ) = α ^ 1 + γ ^ 1 T δ ^ 0 \widehat\theta_0^{(1)}=\widehat\alpha_1+\widehat\gamma_1^{\mathsf{T}}\widehat\delta_0 θ 0 ( 1 ) = α 1 + γ 1 T δ 0 . Interchange D 1 \mathcal{D}_1 D 1 and D 2 \mathcal{D}_2 D 2 and repeat Steps 1–4 to obtain θ ^ 0 ( 2 ) \widehat\theta_0^{(2)} θ 0 ( 2 ) .
Return: θ ^ 0 c f = 1 2 ( θ ^ 0 ( 1 ) + θ ^ 0 ( 2 ) ) \widehat\theta_0^{\mathrm{cf}}=\frac{1}{2}\left(\widehat\theta_0^{(1)}+\widehat\theta_0^{(2)}\right) θ 0 cf = 2 1 ( θ 0 ( 1 ) + θ 0 ( 2 ) ) .
In Step 1, we use D 1 \mathcal{D}_1 D 1 to construct the projection matrices from the leading eigenvectors of the sample covariance matrices. In Step 2, we apply these directions to the surrogates in D 2 \mathcal{D}_2 D 2 to obtain the projected covariate and mediator scores. This separation allows the regression observations to be analyzed conditional on the projection directions, while retaining the factor-space information needed for estimation.
Steps 3 and 4 implement the two regression stages underlying the mediation functional, a treated outcome regression and a control bridge regression. In Step 3, the treated outcome regression yields α ^ 1 \widehat\alpha_1 α 1 and γ ^ 1 \widehat\gamma_1 γ 1 .
In Step 4, the bridge regression uses γ ^ 1 \widehat\gamma_1 γ 1 to form the scalar response f ^ M , i T γ ^ 1 \widehat f_{M,i}^{\mathsf{T}}\widehat\gamma_1 f M , i T γ 1 and regresses it on the projected covariates among control observations. The fitted intercept, denoted by γ ^ 1 T δ ^ 0 \widehat\gamma_1^{\mathsf{T}}\widehat\delta_0 γ 1 T δ 0 , estimates the contribution of the control mediator relation to the treated outcome.
Figure 2. Schematic overview of FARMA. The estimates α ^ 1 \widehat{\alpha}_1 α 1 and γ ^ 1 T δ ^ 0 \widehat{\gamma}_1^{\mathsf{T}}\widehat{\delta}_0 γ 1 T δ 0 combine into θ ^ 0 \widehat{\theta}_0 θ 0 , and interchanging the subsets gives the cross-fitted θ ^ 0 c f \widehat{\theta}_0^{\mathrm{cf}} θ 0 cf .
Algorithm 2 Cross-fitted FARMA estimators of the NDE and NIE
Step 1: Reuse the projected factors, design vectors, treatment groups, and fitted quantities from the first split of Algorithm 1. Regress Y i Y_i Y i on Z ^ i \widehat{Z}_i Z i using i ∈ I 0 i \in\mathcal{I}_0 i ∈ I 0 , and denote the fitted intercept and mediator-score coefficient by α ^ 0 \widehat{\alpha}_0 α 0 and γ ^ 0 ∈ R q \widehat{\gamma}_0 \in\mathbb{R}^q γ 0 ∈ R q , respectively.
Step 2: For each a ∈ { 0 , 1 } a \in\{0,1\} a ∈ { 0 , 1 } , regress f ^ M , i T γ ^ a \widehat{f}_{M,i}^{\mathsf{T}}\widehat{\gamma}_a f M , i T γ a on R ^ i \widehat{R}_i R i using i ∈ I a i \in\mathcal{I}_a i ∈ I a , and define the fitted intercept as
γ ^ a T δ ^ a = e 1 T ( ∑ i ∈ I a R ^ i R ^ i T ) − 1 ∑ i ∈ I a R ^ i ( f ^ M , i T γ ^ a ) . \widehat{\gamma}_a^{\mathsf{T}}\widehat{\delta}_a = \mathbf{e}_1^{\mathsf{T}}\left(\sum_{i\in\mathcal{I}_a}\widehat{R}_i\widehat{R}_i^{\mathsf{T}}\right)^{-1}\sum_{i\in\mathcal{I}_a}\widehat{R}_i\left(\widehat{f}_{M,i}^{\mathsf{T}}\widehat{\gamma}_a\right). γ a T δ a = e 1 T ( i ∈ I a ∑ R i R i T ) − 1 i ∈ I a ∑ R i ( f M , i T γ a ) . Step 3: Form the fold-specific estimates
θ ^ N D E ( 1 ) = α ^ 1 − α ^ 0 + γ ^ 1 T δ ^ 0 − γ ^ 0 T δ ^ 0 , \widehat{\theta}_{\mathrm{NDE}}^{(1)}=\widehat{\alpha}_1-\widehat{\alpha}_0+\widehat{\gamma}_1^{\mathsf{T}}\widehat{\delta}_0-\widehat{\gamma}_0^{\mathsf{T}}\widehat{\delta}_0, θ NDE ( 1 ) = α 1 − α 0 + γ 1 T δ 0 − γ 0 T δ 0 , θ ^ N I E ( 1 ) = γ ^ 1 T δ ^ 1 − γ ^ 1 T δ ^ 0 . \widehat{\theta}_{\mathrm{NIE}}^{(1)}=\widehat{\gamma}_1^{\mathsf{T}}\widehat{\delta}_1-\widehat{\gamma}_1^{\mathsf{T}}\widehat{\delta}_0. θ NIE ( 1 ) = γ 1 T δ 1 − γ 1 T δ 0 . Step 4: Interchange D 1 \mathcal{D}_1 D 1 and D 2 \mathcal{D}_2 D 2 and repeat Steps 1–3 using the corresponding fitted quantities from Algorithm 1, yielding θ ^ N D E ( 2 ) \widehat{\theta}_{\mathrm{NDE}}^{(2)} θ NDE ( 2 ) and θ ^ N I E ( 2 ) \widehat{\theta}_{\mathrm{NIE}}^{(2)} θ NIE ( 2 ) .
Return:
θ ^ N D E c f = 1 2 ( θ ^ N D E ( 1 ) + θ ^ N D E ( 2 ) ) , θ ^ N I E c f = 1 2 ( θ ^ N I E ( 1 ) + θ ^ N I E ( 2 ) ) . \widehat{\theta}_{\mathrm{NDE}}^{\mathrm{cf}}=\frac{1}{2}\left(\widehat{\theta}_{\mathrm{NDE}}^{(1)}+\widehat{\theta}_{\mathrm{NDE}}^{(2)}\right),\qquad
\widehat{\theta}_{\mathrm{NIE}}^{\mathrm{cf}}=\frac{1}{2}\left(\widehat{\theta}_{\mathrm{NIE}}^{(1)}+\widehat{\theta}_{\mathrm{NIE}}^{(2)}\right). θ NDE cf = 2 1 ( θ NDE ( 1 ) + θ NDE ( 2 ) ) , θ NIE cf = 2 1 ( θ NIE ( 1 ) + θ NIE ( 2 ) ) .
In Step 5, we add the two intercepts to obtain θ ^ 0 ( 1 ) \widehat{\theta}_0^{(1)} θ 0 ( 1 ) , repeat the construction with the folds interchanged, and average the two estimates. Thus, every observation contributes to the regression steps in one split, and the procedure only requires recovery of the relevant factor spaces.
Natural direct and indirect effects. Under the centering convention E ( f X ) = 0 \mathbb{E}(f_X)=0 E ( f X ) = 0 , the potential outcomes in (7) satisfy θ a a = α a + γ a T δ a \theta_{aa}=\alpha_a+\gamma_a^{\mathsf{T}}\delta_a θ aa = α a + γ a T δ a for a ∈ { 0 , 1 } a \in\{0,1\} a ∈ { 0 , 1 } . Thus, the effects defined in (8) have the structural representations as follows:
θ N D E = α 1 − α 0 + ( γ 1 − γ 0 ) T δ 0 , \theta_{\mathrm{NDE}}=\alpha_1-\alpha_0+(\gamma_1-\gamma_0)^{\mathsf{T}}\delta_0, θ NDE = α 1 − α 0 + ( γ 1 − γ 0 ) T δ 0 ,
θ N I E = γ 1 T ( δ 1 − δ 0 ) . \theta_{\mathrm{NIE}}=\gamma_1^{\mathsf{T}}(\delta_1-\delta_0). θ NIE = γ 1 T ( δ 1 − δ 0 ) .
Algorithm 2 estimates these expressions using the same projections and scalar-regression construction as Algorithm 1. The projected covariates remain in each regression, since the marginal centering condition does not imply E [ f X ∣ A = a ] = 0 \mathbb{E}[f_X\mid A=a]=0 E [ f X ∣ A = a ] = 0 . In Step 1 of Algorithm 2, we reuse the treated outcome fit and estimate the corresponding control outcome coefficients. In Step 2, the two within-arm mediator regressions provide γ ^ 0 T δ ^ 0 \widehat{\gamma}_0^{\mathsf{T}}\widehat{\delta}_0 γ 0 T δ 0 and γ ^ 1 T δ ^ 1 \widehat{\gamma}_1^{\mathsf{T}}\widehat{\delta}_1 γ 1 T δ 1 . Step 3 combines these with γ ^ 1 T δ ^ 0 \widehat{\gamma}_1^{\mathsf{T}}\widehat{\delta}_0 γ 1 T δ 0 from Algorithm 1 to estimate the two effects. Finally, Step 4 interchanges the folds, and the two estimates of each effect are averaged.
construct the projection directions from the remaining observations, run the regressions on that fold, and average the resulting K K K fold-specific estimates of each target.
Theoretical Analysis
In this section, we study the asymptotic behavior of the cross-fitted FARMA estimator θ ^ 0 c f \hat{\theta}^{\mathrm{cf}}_0 θ ^ 0 cf of θ 0 = α 1 + γ 1 T δ 0 \theta_0 = \alpha_1 + \gamma_1^{\mathsf{T}}\delta_0 θ 0 = α 1 + γ 1 T δ 0 and establish its n \sqrt{n} n -consistency and asymptotic normality. Furthermore, we also present a consistent estimator of the limiting variance, which aids in inference. Recall that, we allow the working factor dimensions to be anything larger than the true dimension, i.e., p ~ ≥ p ˉ \tilde{p} \ge\bar{p} p ~ ≥ p ˉ and q ~ ≥ q ˉ \tilde{q} \ge\bar{q} q ~ ≥ q ˉ . The limiting variance does not depend on ( p ~ , q ~ ) (\tilde{p},\tilde{q}) ( p ~ , q ~ ) , so the length of asymptotic confidence interval is independent of the choice of the working dimension as soon as it is larger than the true dimension.
The main challenge is to control the contribution of the projected measurement errors to the two regression stages, including the additional directions introduced by overestimating the factor dimensions.
Let π 1 = P ( A i = 1 ) \pi_1 = \mathbb{P}(A_i = 1) π 1 = P ( A i = 1 ) and π 0 = 1 − π 1 \pi_0 = 1 - \pi_1 π 0 = 1 − π 1 denote the fixed treatment probabilities, with 0 < π 1 , π 0 < 1 0 < \pi_1,\pi_0 < 1 0 < π 1 , π 0 < 1 (Assumption 5.1(iii)). We consider two approximately equal folds, so the treated and control sample sizes in each fold are of order n n n . For a given regression fold, the projection matrices are estimated using the other fold; we suppress this fold dependence in the notation. Under the measurement model (2) , the projected factors satisfy
f ^ X , i = 1 p W X T X i = ( 1 p W X T Γ X ) ⏟ = : H X f X , i + 1 p W X T u X , i ⏟ = : e X , i , \hat{\mathbf{f}}_{X,i} = \frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}\mathbf{X}_i = \underbrace{\left(\frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}\mathbf{\Gamma}_{X}\right)}_{=:\mathbf{H}_{X}}\mathbf{f}_{X,i} + \underbrace{\frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}\mathbf{u}_{X,i}}_{=:\mathbf{e}_{X,i}}, f ^ X , i = p 1 W X T X i = =: H X ( p 1 W X T Γ X ) f X , i + =: e X , i p 1 W X T u X , i ,
f ^ M , i = 1 q W M T M i = ( 1 q W M T Γ M ) ⏟ = : H M f M , i + 1 q W M T u M , i ⏟ = : e M , i . (10) \hat{\mathbf{f}}_{M,i} = \frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}\mathbf{M}_i = \underbrace{\left(\frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}\mathbf{\Gamma}_{M}\right)}_{=:\mathbf{H}_{M}}\mathbf{f}_{M,i} + \underbrace{\frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}\mathbf{u}_{M,i}}_{=:\mathbf{e}_{M,i}}. \tag*{(10)} f ^ M , i = q 1 W M T M i = =: H M ( q 1 W M T Γ M ) f M , i + =: e M , i q 1 W M T u M , i . (10)
Here, H X ∈ R p ~ × p ˉ \mathbf{H}_{X} \in\mathbb{R}^{\tilde{p}\times\bar{p}} H X ∈ R p ~ × p ˉ and H M ∈ R q ~ × q ˉ \mathbf{H}_{M} \in\mathbb{R}^{\tilde{q}\times\bar{q}} H M ∈ R q ~ × q ˉ map the latent factors into the space of working dimension, while e X , i \mathbf{e}_{X,i} e X , i and e M , i \mathbf{e}_{M,i} e M , i collect the projected idiosyncratic errors. We first state the regularity conditions used in the asymptotic analysis.
Assumption 5.1 (Sub-Gaussian tails and nondegeneracy). There exist constants C < ∞ C < \infty C < ∞ and σ 2 > 0 \sigma^2 > 0 σ 2 > 0 , independent of ( n , p , q ) (n,p,q) ( n , p , q ) , such that, for a ∈ { 0 , 1 } a \in\{0,1\} a ∈ { 0 , 1 } and i = 1 , … , n i = 1,\ldots,n i = 1 , … , n , the following hold.
(i) The random vectors f X , i \mathbf{f}_{X,i} f X , i , u X , i \mathbf{u}_{X,i} u X , i , u M , i \mathbf{u}_{M,i} u M , i , and u X M , a , i \mathbf{u}_{XM,a,i} u X M , a , i , and the scalar error ϵ a , i \epsilon_{a,i} ϵ a , i , are sub-Gaussian, with sub-Gaussian norms uniformly bounded by C C C .
(ii) The outcome error variance is uniformly bounded away from zero: Var ( ϵ a , i ) ≥ σ 2 > 0 \operatorname{Var}(\epsilon_{a,i}) \ge\sigma^2 > 0 Var ( ϵ a , i ) ≥ σ 2 > 0 .
(iii) π 1 \pi_1 π 1 is uniformly bounded away from 0 and 1.
Assumption 5.1(i) is a commonly used tail condition in high-dimensional analysis and simplifies the concentration arguments for sample covariances and regression terms. It includes Gaussian and many non-Gaussian distributions with sufficiently light tails. This condition could be relaxed under suitable moment and growth conditions using an appropriate truncation-based argument, but we do not pursue this extension here. Assumption 5.1(ii) is a mild nondegeneracy condition that prevents the outcome error variance from vanishing as n , p , q n,p,q n , p , q grow. Together with the remaining assumptions, it ensures that the limiting variance is positive, so the usual normal approximation can be used for inference. Assumption 5.1(iii) ensures that both treatment groups contain a nonvanishing proportion of the sample.
Assumption 5.2 (Dimensions and loadings). There exists a constant C < ∞ C < \infty C < ∞ , independent of n , p , q n,p,q n , p , q , such that the following hold.
(i) The loading rows are uniformly bounded, max j ≤ p ∥ Γ X , j ∥ 2 ≤ C \max_{j\le p}\|\mathbf{\Gamma}_{X,j}\|_2 \le C max j ≤ p ∥ Γ X , j ∥ 2 ≤ C and max j ≤ q ∥ Γ M , j ∥ 2 ≤ C \max_{j\le q}\|\mathbf{\Gamma}_{M,j}\|_2 \le C max j ≤ q ∥ Γ M , j ∥ 2 ≤ C .
(ii) The working dimensions p ~ ≥ p ˉ \tilde{p} \ge\bar{p} p ~ ≥ p ˉ and q ~ ≥ q ˉ \tilde{q} \ge\bar{q} q ~ ≥ q ˉ are fixed, and
log ( p ∨ q ) n ⟶ 0 , p ∧ q n ⟶ ∞ as n , p , q ⟶ ∞ . \frac{\log(p \vee q)}{n} \longrightarrow0,\qquad\frac{p \wedge q}{n} \longrightarrow\infty\quad\text{as } n,p,q \longrightarrow\infty. n log ( p ∨ q ) ⟶ 0 , n p ∧ q ⟶ ∞ as n , p , q ⟶ ∞.
Assumption 5.2(i) is a standard bounded-loading condition in factor models. It prevents any individual surrogate from having an increasingly large loading as p p p and q q q grow. Together with the pervasiveness condition in Assumption 3.2(ii), it ensures that information about each latent factor is spread across many surrogate measurements. Assumption 5.2(ii) allows the fixed working dimensions to exceed the true dimensions, so the true factor dimensions need not be known exactly. The condition log ( p ∨ q ) / n → 0 \log(p \vee q)/n \to0 log ( p ∨ q ) / n → 0 is mild and allows p p p and q q q to be much larger than n n n , including any fixed polynomial growth. The additional condition ( p ∧ q ) / n → ∞ (p \wedge q)/n \to\infty ( p ∧ q ) / n → ∞ requires the number of surrogates to grow faster than the sample size. This is sufficient condition for drawing inference at n \sqrt{n} n rate. This condition can potentially be relaxed to ( p ∧ q ) / n → ∞ (p \wedge q)/\sqrt{n} \to\infty ( p ∧ q ) / n → ∞ , but we leave this for future research. We are now in a position to state our main results. First, we show that the projection matrices constructed in Algorithm 1 satisfy the full-projection condition in Definition 3.1 with probability tending to one:
Proposition 5.1. Let V ^ X ∈ R p × p ~ \widehat{\mathbf{V}}_X \in\mathbb{R}^{p \times\widetilde{p}} V X ∈ R p × p and V ^ M ∈ R q × q ~ \widehat{\mathbf{V}}_M \in\mathbb{R}^{q \times\widetilde{q}} V M ∈ R q × q have orthonormal columns corresponding to the leading p ~ \widetilde{p} p and q ~ \widetilde{q} q eigenvectors of the sample covariance matrices Σ ^ X \widehat{\boldsymbol{\Sigma}}_X Σ X and Σ ^ M \widehat{\boldsymbol{\Sigma}}_M Σ M , respectively, computed on the training fold. Take W X = p V ^ X \mathbf{W}_X = \sqrt{p}\widehat{\mathbf{V}}_X W X = p V X and W M = q V ^ M \mathbf{W}_M = \sqrt{q}\widehat{\mathbf{V}}_M W M = q V M , and let H X \mathbf{H}_X H X and H M \mathbf{H}_M H M be defined as in Definition 3.1. Suppose Assumptions 3.1–3.2 and 5.1–5.2 hold. Then there exist constants 0 < c ≤ C < ∞ 0 < c \le C < \infty 0 < c ≤ C < ∞ and K 1 > 0 K_1 > 0 K 1 > 0 , independent of n n n , p p p , q q q , such that, for all sufficiently large n n n , with probability at least 1 − n − K 1 1-n^{-K_1} 1 − n − K 1 ,
c ≤ ν min ( H X ) ≤ ν max ( H X ) ≤ C , c ≤ ν min ( H M ) ≤ ν max ( H M ) ≤ C . c \le\nu_{\min}(\mathbf{H}_X) \le\nu_{\max}(\mathbf{H}_X) \le C,\qquad c \le\nu_{\min}(\mathbf{H}_M) \le\nu_{\max}(\mathbf{H}_M) \le C. c ≤ ν m i n ( H X ) ≤ ν m a x ( H X ) ≤ C , c ≤ ν m i n ( H M ) ≤ ν m a x ( H M ) ≤ C .
Proposition 5.1 ensures that the projection preserves every true latent factor direction and that the projected factors remain well-conditioned with probability tending to one. When p ~ > p ‾ \widetilde{p} > \overline{p} p > p , there are p ~ − p ‾ \widetilde{p}-\overline{p} p − p linearly independent combinations of f ^ X \widehat{\mathbf{f}}_X f X that contain no signal from the true latent factors f X \mathbf{f}_X f X . Similarly, when q ~ > q ‾ \widetilde{q} > \overline{q} q > q , there are q ~ − q ‾ \widetilde{q}-\overline{q} q − q such combinations of f ^ M \widehat{\mathbf{f}}_M f M containing no signal from f M \mathbf{f}_M f M . The variances of these combinations can be shown to be of order p − 1 p^{-1} p − 1 and q − 1 q^{-1} q − 1 , respectively. Consequently, the Gram matrices constructed from the projected factors in the outcome and bridge regressions need not remain uniformly well conditioned. A key part of our analysis is controlling the contributions of these additional directions and showing that they are negligible in the first-order asymptotic expansion of θ ^ 0 c f \widehat{\theta}^{\mathrm{cf}}_0 θ 0 cf . The proof of Proposition 5.1 is given in Appendix § 13 .§ 1 .
Our next result is the asymptotic normality of the proposed estimator. To state the limiting variance, let f 1 , i = ( 1 , f X , i ⊤ , f M , i ⊤ ) ⊤ \mathbf{f}_{1,i} = (1,\mathbf{f}_{X,i}^{\top},\mathbf{f}_{M,i}^{\top})^{\top} f 1 , i = ( 1 , f X , i ⊤ , f M , i ⊤ ) ⊤ and f X 1 , i = ( 1 , f X , i ⊤ ) ⊤ \mathbf{f}_{X1,i} = (1,\mathbf{f}_{X,i}^{\top})^{\top} f X 1 , i = ( 1 , f X , i ⊤ ) ⊤ . Define the conditional second-moment matrices
Ω 1 = E [ f 1 , i f 1 , i ⊤ ∣ A i = 1 ] , Ω X 0 = E [ f X 1 , i f X 1 , i ⊤ ∣ A i = 0 ] . \boldsymbol{\Omega}_1 = \mathbb{E}[\mathbf{f}_{1,i}\mathbf{f}_{1,i}^{\top} \mid A_i = 1],\qquad\boldsymbol{\Omega}_{X0} = \mathbb{E}[\mathbf{f}_{X1,i}\mathbf{f}_{X1,i}^{\top} \mid A_i = 0]. Ω 1 = E [ f 1 , i f 1 , i ⊤ ∣ A i = 1 ] , Ω X 0 = E [ f X 1 , i f X 1 , i ⊤ ∣ A i = 0 ] .
These matrices correspond to the treated outcome regression and the control bridge regression, respectively. Let a 1 = ( 1 , 0 p ‾ ⊤ , δ 0 ⊤ ) ⊤ \mathbf{a}_1 = (1,\mathbf{0}_{\overline{p}}^{\top},\boldsymbol{\delta}_0^{\top})^{\top} a 1 = ( 1 , 0 p ⊤ , δ 0 ⊤ ) ⊤ , e 1 , 1 + p ‾ = ( 1 , 0 p ‾ ⊤ ) ⊤ \mathbf{e}_{1,1+\overline{p}} = (1,\mathbf{0}_{\overline{p}}^{\top})^{\top} e 1 , 1 + p = ( 1 , 0 p ⊤ ) ⊤ , and η i = γ 1 ⊤ u X M , 0 , i \eta_i = \boldsymbol{\gamma}_1^{\top}\mathbf{u}_{XM,0,i} η i = γ 1 ⊤ u X M , 0 , i . Define
ξ 1 , i = a 1 ⊤ Ω 1 − 1 f 1 , i ϵ 1 , i , ξ 2 , i = e 1 , 1 + p ‾ ⊤ Ω X 0 − 1 f X 1 , i η i . \xi_{1,i} = \mathbf{a}_1^{\top}\boldsymbol{\Omega}_1^{-1}\mathbf{f}_{1,i}\epsilon_{1,i},\qquad\xi_{2,i} = \mathbf{e}_{1,1+\overline{p}}^{\top}\boldsymbol{\Omega}_{X0}^{-1}\mathbf{f}_{X1,i}\eta_i. ξ 1 , i = a 1 ⊤ Ω 1 − 1 f 1 , i ϵ 1 , i , ξ 2 , i = e 1 , 1 + p ⊤ Ω X 0 − 1 f X 1 , i η i .
Here, ξ 1 , i \xi_{1,i} ξ 1 , i and ξ 2 , i \xi_{2,i} ξ 2 , i are the first-order terms from the treated outcome regression and the control bridge regression, respectively.
Theorem 5.2 (Asymptotic normality of θ ^ 0 c f \widehat{\theta}^{\mathrm{cf}}_0 θ 0 cf ). Suppose Assumptions 2.1–2.3, 3.1–3.2, and 5.1–5.2 hold, and let θ ^ 0 c f \widehat{\theta}^{\mathrm{cf}}_0 θ 0 cf be the cross-fitted FARMA estimator defined in Algorithm 1. Then
n ( θ ^ 0 c f − θ 0 ) = 1 n ∑ i = 1 n ( A i π 1 ξ 1 , i + 1 − A i π 0 ξ 2 , i ) + o p ( 1 ) . \sqrt{n}\left(\widehat{\theta}^{\mathrm{cf}}_0-\theta_0\right)=\frac{1}{\sqrt{n}}\sum_{i=1}^{n}\left(\frac{A_i}{\pi_1}\xi_{1,i}+\frac{1-A_i}{\pi_0}\xi_{2,i}\right)+o_p(1). n ( θ 0 cf − θ 0 ) = n 1 i = 1 ∑ n ( π 1 A i ξ 1 , i + π 0 1 − A i ξ 2 , i ) + o p ( 1 ) . Consequently,
n ( θ ^ 0 c f − θ 0 ) → d N ( 0 , σ 2 ) , σ 2 = E [ ξ 1 , i 2 ∣ A i = 1 ] π 1 + E [ ξ 2 , i 2 ∣ A i = 0 ] π 0 . \sqrt{n}\left(\widehat{\theta}^{\mathrm{cf}}_0-\theta_0\right)\xrightarrow{d}N(0,\sigma^2),\qquad\sigma^2=\frac{\mathbb{E}[\xi_{1,i}^2\mid A_i=1]}{\pi_1}+\frac{\mathbb{E}[\xi_{2,i}^2\mid A_i=0]}{\pi_0}. n ( θ 0 cf − θ 0 ) d N ( 0 , σ 2 ) , σ 2 = π 1 E [ ξ 1 , i 2 ∣ A i = 1 ] + π 0 E [ ξ 2 , i 2 ∣ A i = 0 ] .
Theorem 5.2 shows that using the projected factors does not affect the first-order limiting distribution of θ ^ 0 c f \widehat{\theta}^{\mathrm{cf}}_0 θ 0 cf . The working dimensions p ~ \widetilde{p} p and q ~ \widetilde{q} q do not affect the limiting distribution as long as they do not grow with n n n . The estimator is n \sqrt{n} n -consistent, and its limiting variance remains oracle, in the sense that it is the same as the asymptotic variance of the corresponding two-stage regression estimator had the true latent factors ( f X , f M ) (\mathbf{f}_X,\mathbf{f}_M) ( f X , f M ) been observed exactly. The proof is given in Appendix § 13 .§ 2 .
For inference, we further require a consistent estimator of the limiting variance σ 2 \sigma^2 σ 2 , which depends on unobserved latent factors and structural errors. We estimate it using the projected factors and regression residuals from Algorithm 1. Let π ^ 1 = n − 1 ∑ i = 1 n 1 ( A i = 1 ) \widehat{\pi}_1=n^{-1}\sum_{i=1}^{n}\mathbb{1}(A_i=1) π 1 = n − 1 ∑ i = 1 n 1 ( A i = 1 ) and π ^ 0 = 1 − π ^ 1 \widehat{\pi}_0=1-\widehat{\pi}_1 π 0 = 1 − π 1 denote the proportions of treated and control units in the full sample. For each observation, the estimated first-order terms are computed using the fitted quantities from its regression fold. For notational simplicity, define σ ^ 1 2 = E [ ξ ^ 1 , i 2 ∣ A i = 1 ] \widehat{\sigma}_1^2=\mathbb{E}[\widehat{\xi}_{1,i}^2\mid A_i=1] σ 1 2 = E [ ξ 1 , i 2 ∣ A i = 1 ] and σ ^ 2 2 = E [ ξ ^ 2 , i 2 ∣ A i = 0 ] \widehat{\sigma}_2^2=\mathbb{E}[\widehat{\xi}_{2,i}^2\mid A_i=0] σ 2 2 = E [ ξ 2 , i 2 ∣ A i = 0 ] . To estimate σ ^ 1 2 \widehat{\sigma}_1^2 σ 1 2 and σ ^ 2 2 \widehat{\sigma}_2^2 σ 2 2 , we first replace ϵ 1 , i \epsilon_{1,i} ϵ 1 , i and η i \eta_i η i by the residuals ϵ ^ 1 , i \widehat{\epsilon}_{1,i} ϵ 1 , i and η ^ i \widehat{\eta}_i η i from the treated outcome regression in Step 3 and the control bridge regression in Step 4 of Algorithm 1, respectively. Within each regression fold, the weights involving Ω 1 − 1 \boldsymbol{\Omega}_1^{-1} Ω 1 − 1 and Ω X 0 − 1 \boldsymbol{\Omega}_{X0}^{-1} Ω X 0 − 1 are estimated using the inverses of the empirical second-moment matrices of f ^ 1 , i \widehat{\mathbf{f}}_{1,i} f 1 , i among treated observations and f ^ X 1 , i \widehat{\mathbf{f}}_{X1,i} f X 1 , i among control observations. Overestimating the factor dimensions can make these matrices ill-conditioned, so we carefully control for the contribution of the additional directions. We then square the estimated first-order terms and average them separately over treated and control observations across both folds to obtain σ ^ 1 2 \widehat{\sigma}_1^2 σ 1 2 and σ ^ 2 2 \widehat{\sigma}_2^2 σ 2 2 , respectively. Appendix § 13 .§ 3 gives the details of this construction and its justification.
Lemma 5.1 (Consistency of the variance estimator). Suppose the assumptions of Theorem 5.2 hold, and let
σ ^ 2 = σ ^ 1 2 π ^ 1 + σ ^ 0 2 π ^ 0 . \widehat{\sigma}^{2}=\frac{\widehat{\sigma}_{1}^{2}}{\widehat{\pi}_{1}}+\frac{\widehat{\sigma}_{0}^{2}}{\widehat{\pi}_{0}}. σ 2 = π 1 σ 1 2 + π 0 σ 0 2 . Then σ ^ 2 → p σ 2 \widehat{\sigma}^{2}\xrightarrow{p}\sigma^{2} σ 2 p σ 2 .
Lemma 5.1 establishes consistency of the variance estimator even when the working dimensions exceed the true factor dimensions. The proof is given in Appendix § 13 .§ 3 . Combining this lemma with Theorem 5.2 yields
n ( θ ^ 0 c f − θ 0 ) σ ^ → d N ( 0 , 1 ) , \frac{\sqrt{n}\left(\widehat{\theta}_{0}^{\mathrm{cf}}-\theta_{0}\right)}{\widehat{\sigma}}\xrightarrow{d}N(0,1), σ n ( θ 0 cf − θ 0 ) d N ( 0 , 1 ) ,
where σ ^ = σ ^ 2 \widehat{\sigma}=\sqrt{\widehat{\sigma}^{2}} σ = σ 2 . Thus, an asymptotically valid 100 ( 1 − α ) % 100(1-\alpha)\% 100 ( 1 − α ) % confidence interval for θ 0 \theta_{0} θ 0 is
[ θ ^ 0 c f − z 1 − α / 2 σ ^ n , θ ^ 0 c f + z 1 − α / 2 σ ^ n ] . \left[\widehat{\theta}_{0}^{\mathrm{cf}}-z_{1-\alpha/2}\frac{\widehat{\sigma}}{\sqrt{n}},\ \widehat{\theta}_{0}^{\mathrm{cf}}+z_{1-\alpha/2}\frac{\widehat{\sigma}}{\sqrt{n}}\right]. [ θ 0 cf − z 1 − α /2 n σ , θ 0 cf + z 1 − α /2 n σ ] .
where z 1 − α / 2 z_{1-\alpha/2} z 1 − α /2 is the ( 1 − α / 2 ) (1-\alpha/2) ( 1 − α /2 ) -quantile of the standard normal distribution.
Simulation Studies
In this section, we design simulation experiments to evaluate the performance of our estimator (θ ^ 0 c f \widehat{\theta}_{0}^{\mathrm{cf}} θ 0 cf as defined in § 4 ) under high-dimensional surrogates for the covariates and mediators, in terms of root mean squared error (RMSE), standard deviation (SD), confidence interval length, and coverage. We consider a data-generating process where both covariates and mediators are low-dimensional latent factors as stated in § 2 . The data is generated as follows:
We generate a latent factor f X ∈ R p ˉ \mathbf{f}_{X}\in\mathbb{R}^{\bar{p}} f X ∈ R p ˉ for each sample, with f X ∼ N ( 0 , Σ X ) \mathbf{f}_{X}\sim\mathcal{N}(0,\Sigma_{X}) f X ∼ N ( 0 , Σ X ) . The covariance matrix is constructed as Σ X = U Λ U ⊤ \Sigma_{X}=U\Lambda U^{\top} Σ X = U Λ U ⊤ , where U ∈ R p ˉ × p ˉ U\in\mathbb{R}^{\bar{p}\times\bar{p}} U ∈ R p ˉ × p ˉ is an orthonormal matrix, and Λ = diag ( λ 1 , … , λ p ˉ ) \Lambda=\operatorname{diag}(\lambda_{1},\ldots,\lambda_{\bar{p}}) Λ = diag ( λ 1 , … , λ p ˉ ) is diagonal with λ j ∼ U ( 1 , 2 ) \lambda_{j}\sim\mathcal{U}(1,2) λ j ∼ U ( 1 , 2 ) for 1 ≤ j ≤ p ˉ 1\leq j\leq\bar{p} 1 ≤ j ≤ p ˉ . Given covariates f X \mathbf{f}_{X} f X , the observed surrogates X ∈ R p X\in\mathbb{R}^{p} X ∈ R p are generated as:
X = Γ X f X + u X , u X ∼ i . i . d . N ( 0 , σ 2 I p ) . X=\Gamma_{X}\mathbf{f}_{X}+\mathbf{u}_{X},\qquad\mathbf{u}_{X}\overset{\mathrm{i.i.d.}}{\sim}\mathcal{N}(0,\sigma^{2}I_{p}). X = Γ X f X + u X , u X ∼ i.i.d. N ( 0 , σ 2 I p ) .
where Γ X ∈ R p × p ˉ \Gamma_{X}\in\mathbb{R}^{p\times\bar{p}} Γ X ∈ R p × p ˉ has entries sampled from U ( 0.5 , 1.5 ) \mathcal{U}(0.5,1.5) U ( 0.5 , 1.5 ) .
The treatment assignment follows a logistic model:
P ( A = 1 ∣ f X ) = logit − 1 ( f X ⊤ ξ ) , \mathbb{P}(A=1\mid\mathbf{f}_{X})=\operatorname{logit}^{-1}(\mathbf{f}_{X}^{\top}\xi), P ( A = 1 ∣ f X ) = logit − 1 ( f X ⊤ ξ ) ,
where ξ ∈ R p ˉ \xi\in\mathbb{R}^{\bar{p}} ξ ∈ R p ˉ with ξ j ∼ U ( 0 , 2 ) \xi_{j}\sim\mathcal{U}(0,2) ξ j ∼ U ( 0 , 2 ) .
Then, A ∼ Bernoulli ( P ( A = 1 ∣ f X ) ) A\sim\operatorname{Bernoulli}(\mathbb{P}(A=1\mid\mathbf{f}_{X})) A ∼ Bernoulli ( P ( A = 1 ∣ f X )) .
The latent mediator f M ∈ R q ˉ \mathbf{f}_{M}\in\mathbb{R}^{\bar{q}} f M ∈ R q ˉ is generated according to:
f M = ( 1 − A ) ( δ 0 + B 0 f X + u X M , 0 ) + A ( δ 1 + B 1 f X + u X M , 1 ) , u X M , 0 , u X M , 1 ∼ N ( 0 , Σ U ) , \mathbf{f}_{M}=(1-A)(\delta_{0}+B_{0}\mathbf{f}_{X}+\mathbf{u}_{XM,0})+A(\delta_{1}+B_{1}\mathbf{f}_{X}+\mathbf{u}_{XM,1}),\qquad\mathbf{u}_{XM,0},\mathbf{u}_{XM,1}\sim\mathcal{N}(0,\Sigma_{U}), f M = ( 1 − A ) ( δ 0 + B 0 f X + u X M , 0 ) + A ( δ 1 + B 1 f X + u X M , 1 ) , u X M , 0 , u X M , 1 ∼ N ( 0 , Σ U ) ,
where Σ U = R U Λ U R U ⊤ \Sigma_{U}=R_{U}\Lambda_{U}R_{U}^{\top} Σ U = R U Λ U R U ⊤ , R U ∈ R q ˉ × q ˉ R_{U}\in\mathbb{R}^{\bar{q}\times\bar{q}} R U ∈ R q ˉ × q ˉ is an orthonormal matrix, Λ U = diag ( λ 1 , … , λ q ˉ ) \Lambda_{U}=\operatorname{diag}(\lambda_{1},\ldots,\lambda_{\bar{q}}) Λ U = diag ( λ 1 , … , λ q ˉ ) with λ j ∼ i . i . d . U ( 1 , 2 ) \lambda_{j}\overset{\mathrm{i.i.d.}}{\sim}\mathcal{U}(1,2) λ j ∼ i.i.d. U ( 1 , 2 ) , δ 0 , δ 1 ∈ R q ˉ \delta_{0},\delta_{1}\in\mathbb{R}^{\bar{q}} δ 0 , δ 1 ∈ R q ˉ have entries drawn from U ( 0.5 , 1.5 ) \mathcal{U}(0.5,1.5) U ( 0.5 , 1.5 ) , and B 0 , B 1 ∈ R q ˉ × p ˉ B_{0},B_{1}\in\mathbb{R}^{\bar{q}\times\bar{p}} B 0 , B 1 ∈ R q ˉ × p ˉ have entries sampled from U ( 0.5 , 1.5 ) \mathcal{U}(0.5,1.5) U ( 0.5 , 1.5 ) .
Given mediators f M \mathbf{f}_{M} f M , we generate the observed surrogates M ∈ R q M\in\mathbb{R}^{q} M ∈ R q by:
M = Γ M f M + u M , u M ∼ i . i . d . N ( 0 , σ 2 I q ) , M=\Gamma_{M}\mathbf{f}_{M}+\mathbf{u}_{M},\qquad\mathbf{u}_{M}\overset{\mathrm{i.i.d.}}{\sim}\mathcal{N}(0,\sigma^{2}I_{q}), M = Γ M f M + u M , u M ∼ i.i.d. N ( 0 , σ 2 I q ) ,
where Γ M ∈ R q × q ˉ \Gamma_{M}\in\mathbb{R}^{q\times\bar{q}} Γ M ∈ R q × q ˉ has entries from U ( 0.5 , 1.5 ) \mathcal{U}(0.5,1.5) U ( 0.5 , 1.5 ) .
We generate response variable Y Y Y from the model:
Y = ( 1 − A ) ( α 0 + β 0 ⊤ f X + γ 0 ⊤ f M + ϵ 0 ) + A ( α 1 + β 1 ⊤ f X + γ 1 ⊤ f M + ϵ 1 ) , ϵ 0 , ϵ 1 ∼ i . i . d . N ( 0 , σ 2 ) , Y=(1-A)(\alpha_{0}+\beta_{0}^{\top}\mathbf{f}_{X}+\gamma_{0}^{\top}\mathbf{f}_{M}+\epsilon_{0})+A(\alpha_{1}+\beta_{1}^{\top}\mathbf{f}_{X}+\gamma_{1}^{\top}\mathbf{f}_{M}+\epsilon_{1}),\qquad\epsilon_{0},\epsilon_{1}\overset{\mathrm{i.i.d.}}{\sim}\mathcal{N}(0,\sigma^{2}), Y = ( 1 − A ) ( α 0 + β 0 ⊤ f X + γ 0 ⊤ f M + ϵ 0 ) + A ( α 1 + β 1 ⊤ f X + γ 1 ⊤ f M + ϵ 1 ) , ϵ 0 , ϵ 1 ∼ i.i.d. N ( 0 , σ 2 ) ,
where we set α 0 = α 1 = 1 \alpha_{0}=\alpha_{1}=1 α 0 = α 1 = 1 , and vectors β 0 , β 1 ∈ R p ˉ \beta_{0},\beta_{1}\in\mathbb{R}^{\bar{p}} β 0 , β 1 ∈ R p ˉ , γ 0 , γ 1 ∈ R q ˉ \gamma_{0},\gamma_{1}\in\mathbb{R}^{\bar{q}} γ 0 , γ 1 ∈ R q ˉ are sampled from U ( 0.5 , 1.5 ) \mathcal{U}(0.5,1.5) U ( 0.5 , 1.5 ) .
We vary that the number of samples n n n over { 500 , 1000 , 1500 , 2000 , 2500 } \{500,1000,1500,2000,2500\} { 500 , 1000 , 1500 , 2000 , 2500 } and the dimensionality p = q ∈ { 500 , 1000 , 2500 , 5000 } p=q\in\{500,1000,2500,5000\} p = q ∈ { 500 , 1000 , 2500 , 5000 } to reflect different high-dimensional scenarios. For all simulations, we vary σ ∈ { 0.1 , 1 } \sigma\in\{0.1,1\} σ ∈ { 0.1 , 1 } , and set p ˉ = q ˉ = 3 \bar{p}=\bar{q}=3 p ˉ = q ˉ = 3 with p ~ = q ~ = 7 \widetilde{p}=\widetilde{q}=7 p = q = 7 . This choice of p ~ \widetilde{p} p (resp. q ~ \widetilde{q} q ) comes from the lowest-RMSE rule in large samples according to our sensitivity analysis (Appendix § 16 .§ 3 ). Our estimator (θ ^ 0 c f = α ^ 1 + γ ^ 1 ⊤ δ ^ 0 \widehat{\theta}_{0}^{\mathrm{cf}}=\widehat{\alpha}_{1}+\widehat{\gamma}_{1}^{\top}\widehat{\delta}_{0} θ 0 cf = α 1 + γ 1 ⊤ δ 0 as defined in § 4 ) is computed as in Algorithm 1. The weight matrices in Step 1 (i.e., W X , W M W_{X},W_{M} W X , W M ) from the principal component analysis are obtained via the R package irlba, and the OLS estimators in Steps 3–4 via the lm function in R. All results are averaged over 500 replications.
We evaluate the estimator across four simulation designs:
Table 1. Performance of θ ^ 0 c f \hat{\theta}^{\mathrm{cf}}_0 θ ^ 0 cf under the baseline design, over 500 replications.
Baseline design. This applies the data-generating process described above over the full grid of n n n , p = q ∈ { 500 , 1000 , 2500 , 5000 } p=q\in\{500,1000,2500,5000\} p = q ∈ { 500 , 1000 , 2500 , 5000 } and σ ∈ { 0.1 , 1 } \sigma\in\{0.1,1\} σ ∈ { 0.1 , 1 } .
Signal strength. The baseline design fixes a single non-zero value for every parameter. To let the mediated pathway range from absent to strong, we proceed as follows. Fix a direction vector g ∈ R q ˉ g\in\mathbb{R}^{\bar{q}} g ∈ R q ˉ with entries drawn once from U ( 0.5 , 1.5 ) \mathcal{U}(0.5,1.5) U ( 0.5 , 1.5 ) and set
γ 1 = γ 0 = c g , c ∈ { 0 , 0.1 , 0.25 , 0.5 , 1 } , \gamma_1=\gamma_0=cg,\qquad c\in\{0,0.1,0.25,0.5,1\}, γ 1 = γ 0 = c g , c ∈ { 0 , 0.1 , 0.25 , 0.5 , 1 } ,
leaving all other components of the data-generating process unchanged, so that θ 0 = 1 + c δ 0 T g \theta_0=1+c\delta_0^{\mathsf{T}}g θ 0 = 1 + c δ 0 T g and the mediated contribution δ 0 T γ 1 \delta_0^{\mathsf{T}}\gamma_1 δ 0 T γ 1 vanishes at c = 0 c=0 c = 0 and grows linearly in c c c . We report results for p = q ∈ { 1000 , 2500 , 5000 } p=q\in\{1000,2500,5000\} p = q ∈ { 1000 , 2500 , 5000 } at σ = 0.1 \sigma=0.1 σ = 0.1 , so that the accuracy of θ ^ 0 \hat{\theta}_0 θ ^ 0 can be traced as the mediator signal weakens relative to the noise.
Heavy-tailed errors. Separately, we replace all three error terms by variance-matched Student-t t t variates: writing t ∼ t ν t\sim t_\nu t ∼ t ν with ν = 6 \nu=6 ν = 6 , each coordinate of u X u_X u X and u M u_M u M and the outcome error is set to σ t / ν / ( ν − 2 ) = σ t / 3 / 2 \sigma t/\sqrt{\nu/(\nu-2)}=\sigma t/\sqrt{3/2} σ t / ν / ( ν − 2 ) = σ t / 3/2 , which has variance exactly σ 2 \sigma^2 σ 2 and so isolates tail thickness from any change of scale. All other components of the design and the full grid of n n n , p = q p=q p = q and σ \sigma σ are unchanged.
Sensitivity to the working factor dimensions. Algorithm 1 requires the numbers p ~ \tilde{p} p ~ and q ~ \tilde{q} q ~ of principal components extracted from X X X and from M M M , and p ~ , q ~ \tilde{p},\tilde{q} p ~ , q ~ are unknown in any application. Setting κ = p ~ = q ~ \kappa=\tilde{p}=\tilde{q} κ = p ~ = q ~ , we vary
κ ∈ { 1 , 2 , 3 , 5 , 7 , 10 , 15 , 20 , 30 } \kappa\in\{1,2,3,5,7,10,15,20,30\} κ ∈ { 1 , 2 , 3 , 5 , 7 , 10 , 15 , 20 , 30 }
across all five sample sizes and p = q ∈ { 1000 , 2500 , 5000 } p=q\in\{1000,2500,5000\} p = q ∈ { 1000 , 2500 , 5000 } at σ = 0.1 \sigma=0.1 σ = 0.1 , retaining the baseline design in all other respects. This brackets the truth p ~ = q ~ = 3 \tilde{p}=\tilde{q}=3 p ~ = q ~ = 3 on both sides and reaches an order of magnitude above it. We also vary p ~ \tilde{p} p ~ and q ~ \tilde{q} q ~ separately over { 3 , 7 , 20 } \{3,7,20\} { 3 , 7 , 20 } at n = 2500 n=2500 n = 2500 .
Overall, the simulation results provide consistent support for the accuracy of θ ^ 0 c f \hat{\theta}^{\mathrm{cf}}_0 θ ^ 0 cf and the validity of the associated inference. Under the baseline design, the RMSE closely tracks the empirical standard deviation, both decrease as n n n increases, and the confidence intervals become shorter while maintaining coverage near the nominal 95% level, even when p = q p=q p = q substantially exceeds n n n . The same pattern persists under variance-matched t 6 t_6 t 6 errors; see Table 3 . The histogram and Q–Q plot are also broadly consistent with the Gaussian distribution; see Figure 3 a. As the mediated pathway varies from absent to strong, the estimator continues to exhibit decreasing estimation error with increasing n n n and coverage close to the nominal level; see Table 4 . The sensitivity analysis further shows that the estimator is relatively insensitive to moderate or substantial overestimation of the common working factor dimension; see Table 5.
Figure 3. Histogram and Q–Q plot of n ( θ ^ 0 b c f − θ 0 ) \sqrt{n}(\hat{\theta}^{\mathrm{bcf}}_0-\theta_0) n ( θ ^ 0 bcf − θ 0 ) under the base design with p = q = 2500 p=q=2500 p = q = 2500 , n = 1500 n=1500 n = 1500 , σ = 1 \sigma=1 σ = 1 , and p ~ = q ~ = 7 \tilde{p}=\tilde{q}=7 p ~ = q ~ = 7 , based on 500 Monte Carlo replications.
Table 4. Performance of θ ^ 0 \hat{\theta}_0 θ ^ 0 as the strength of the mediated pathway varies, γ 1 = γ 0 = c g \gamma_1=\gamma_0=cg γ 1 = γ 0 = c g , over 500 replications.
Table 3. Performance of θ ^ 0 \hat{\theta}_0 θ ^ 0 under variance-matched t 6 t_6 t 6 errors, over 500 replications.
and Figure 4 . Similar stability is observed when p ~ \tilde{p} p ~ and q ~ \tilde{q} q ~ are varied separately; see Table 6 . In contrast, severe underestimation of the working dimensions can produce persistent bias and substantial undercoverage in the more high-dimensional settings, as shown in Table 5. These findings are consistent with the asymptotic theory and indicate that reliable estimation and inference require the working representations to capture the relevant latent factor spaces.
Figure 4. Sensitivity Analysis of the working factor dimensions.
Table 6. RMSE of θ ^ 0 \hat{\theta}_0 θ ^ 0 (coverage in parentheses) for p ~ \tilde{p} p ~ and q ~ \tilde{q} q ~ varied separately, with p ˉ = q ˉ = 3 \bar{p}=\bar{q}=3 p ˉ = q ˉ = 3 and n = 2500 n=2500 n = 2500 , over 500 replications.
Real Data Experiments
Depression is among the most consistently reported risk factors for cognitive decline in Alzheimer’s disease, yet the biological route through which it acts remains poorly understood ([24 ] ). A hypothesis is that part of the effect is biological, transmitted through epigenetic changes such as DNA methylation, yet direct evidence for such mediation remains scarce ([45 , 15 ] ). We apply our proposed method to investigate how depressive symptoms influence cognitive decline in Alzheimer’s disease, and whether part of this relationship may operate through an underlying biological process represented by high-dimensional DNA methylation measurements.
As mentioned in § 1 , we view oxidative stress as the underlying biological process of interest and DNA methylation as a high-dimensional representation of this process. Since reactive oxygen species are short lived and highly reactive, oxidative stress is difficult to measure directly ([23 ] ). DNA methylation provides more stable molecular signals that may reflect changes associated with oxidative activity ([26 , 28 , 7 ] ). These changes are not expected to be represented by a single CpG site, but rather by patterns distributed across many sites. We therefore use the joint methylation profile as a collection of high-dimensional surrogates for the latent mediator, allowing the underlying biological signal to be summarized across the methylation measurements.
We conduct our analysis using data from the Alzheimer’s Disease Neuroimaging Initiative (ADNI), a longitudinal, multi-center study designed to validate biomarkers for Alzheimer’s disease clinical trials ([27 ] ). Our treatment is the Geriatric Depression Scale (GDS), a self-reported measure of depressive symptoms ranging from 0 to 15, with higher scores indicating more severe symptoms. Our outcome is the Alzheimer’s Disease Assessment Scale-Cognitive Subscale (ADAS-Cog), which ranges from 0 to 85, where higher scores reflect greater cognitive impairment. The mediator surrogates are DNA methylation measurements recorded at hundreds of thousands of CpG sites across the genome. Further details of the study are available at https://adni.loni.usc.edu/.
Data preprocessing. We study whether part of the relationship between depressive symptoms and cognition may operate through the latent biological process represented by DNA methylation, using measurements from the earliest available visit date during the ADNI-GO and ADNI-2 phases, for which methylation data are available. The dataset2 includes DNA methylation data for 653 individuals, ADAS-Cog scores for 1,212 individuals, GDS scores for 1,800 individuals, demographic information for 1,895 individuals, and medical history data for 1,673 individuals. Of these, 649 subjects had complete data across all components and form our analysis sample. We preprocess the data as follows:
The treatment A A A is a binarized Geriatric Depression Scale, where a GDS score below 5 indicates a normal mood state [17 ] , so subjects with GDS > 5 > 5 > 5 are classified as depressed and the rest as non-depressed. We include ten clinically relevant covariates X X X , such as gender, weight, and education level, of which seven are numerical and three are categorical (see Appendix § 16 .§ 4 for the full list).
We impute missing covariate values with mice [36 ] . To increase model expressiveness, we add second- through sixth-order polynomial terms and interactions between the categorical and numerical covariates, giving a covariate vector of dimension 171.
The raw DNA methylation data give marker intensities in red and green channels for each sample, from the Illumina HumanMethylationEPIC BeadChip array. We compute the methylation ratio, ranging continuously from 0 to 1, using the minfi package [2 ] .
The full methylation vector has dimension 866,836. We retain only sites with no missing values and CpG sites reported as significantly associated with Alzheimer’s disease in large-scale EWAS [43 , 25 , 6 ] , which reduces the mediators to dimension 3,206.
After preprocessing, we retain n = 649 n = 649 n = 649 subjects, each with a 171-dimensional covariate-surrogate vector X X X and 3,206 DNA methylation measurements forming the high-dimensional mediator-surrogate vector M M M .
Estimation. To estimate the natural indirect effect, natural direct effect, and total effect of GDS on ADAS-Cog, we apply Algorithms 1 and 2 to the counterfactual means E [ Y ( 1 , 1 ) ] ( = θ 11 ) \mathbb{E}[Y^{(1,1)}](=\theta_{11}) E [ Y ( 1 , 1 ) ] ( = θ 11 ) , E [ Y ( 0 , 0 ) ] ( = θ 00 ) \mathbb{E}[Y^{(0,0)}](=\theta_{00}) E [ Y ( 0 , 0 ) ] ( = θ 00 ) , and E [ Y ( 1 , 0 ) ] ( = θ 10 ) \mathbb{E}[Y^{(1,0)}](=\theta_{10}) E [ Y ( 1 , 0 ) ] ( = θ 10 ) (see Appendix § 16 .§ 2 for the decomposition). We set the projection, denoted by p ~ \widetilde{p} p and q ~ \widetilde{q} q , to the number of leading principal components that explain 50% of the cumulative variance, yielding ( p ~ , q ~ ) = ( 4 , 11 ) (\widetilde{p},\widetilde{q}) = (4,11) ( p , q ) = ( 4 , 11 ) . We quantify uncertainty with a nonparametric bootstrap. We resample the n = 649 n = 649 n = 649 subjects with replacement. For each resample, we apply FARMA using ten independent random two-fold splits and average the resulting direct, indirect, and total effect estimates to obtain one bootstrap replicate. Repeating this procedure across B B B resamples yields a bootstrap distribution for each effect, from which we report the bootstrap mean and the 95% percentile confidence interval defined by the empirical 2.5% and 97.5% quantiles.
Results. The full-sample point estimates and the bootstrap summaries are given in Table 2 .
Table 2. Estimated natural direct, natural indirect, and total effects with B = 300 B = 300 B = 300 .
The estimated total effect of GDS-defined depressive status on ADAS-Cog was 3.6244, with a 95% percentile bootstrap confidence interval of [1.6816, 6.1864]. The positive estimate indicates that participants with elevated depressive symptoms had an estimated ADAS-Cog score approximately 3.62 points higher than those without elevated symptoms, corresponding to worse cognitive function. The natural direct effect was estimated at 3.5891 with a 95% confidence interval of [1.5699, 6.1491], whereas the natural indirect effect through the latent pathway represented by the DNA methylation measurements was 0.0354 with an interval of [−0.5131, 0.4899]. Thus, the intervals for the total and direct effects excluded zero, while the interval for the indirect effect included zero. Based on the point estimates, the indirect effect accounted for approximately 1.0% of the total effect.
Overall, the estimated total effect was primarily attributable to the direct effect. The near-zero indirect-effect estimate and its confidence interval provide little evidence of mediation through the latent biological pathway represented by the DNA methylation measurements considered in this analysis. However, these results do not establish the absence of a mediated effect and do not rule out mediation through biological processes not adequately captured by the selected methylation features or through other biological and behavioral pathways.
Conclusion and Future Work
In this paper, we introduced Factor-Adjusted Regression for Mediation Analysis (FARMA), a factor-based framework for estimating mediation functionals when the covariates and mediators are latent and observed only through high-dimensional noisy surrogates. The main idea is that when the factor structure is pervasive, low-dimensional projections of the observed surrogates keep the information needed for causal mediation analysis. Within this framework, we showed that the mediation functional is approximately identified at finite proxy dimensions, and that the approximation error goes to zero as the numbers of surrogate covariates and mediators grow. We then built a cross-fitted estimator that separates the construction of the projection directions from the regression steps and does not need the true numbers of latent factors to be known. Under suitable regularity and growth conditions, this estimator is n \sqrt{n} n -consistent and asymptotically normal, so we can form valid Wald confidence intervals for the mediation functional, and hence for the natural direct and indirect effects. The simulations support the finite-sample accuracy of the estimator and its confidence intervals. In the ADNI application, we find that depressive symptoms are associated with greater cognitive impairment, with little evidence of mediation through the selected DNA methylation measurements.
Several directions remain open for future research. The present theory requires the dimensions of the observed variables to grow faster than the sample size, and extending it to the proportional regime, in which p n → c X \frac{p}{n} \to c_X n p → c X and q n → c M \frac{q}{n} \to c_M n q → c M for finite positive constants c X c_X c X and c M c_M c M , that would require accounting for projection errors that persist asymptotically rather than vanish. A second direction is to relax sequential exchangeability to accommodate confounding beyond the latent structure captured by the available surrogates, together with the sensitivity analysis needed to assess robustness to such departures. Finally, we focused on linear structural models, and extending FARMA to generalized linear and other nonlinear outcome and mediator models would widen the range of problems it can handle.
References
Appendix
This appendix contains the proofs of the two main results, along with notation and some auxiliary lemmas they rely on. Section B proves the identification theorem, Theorem 3.1 from § 3 . The argument is carried out at the population level and is built around the projected functional θ 0 , p , q = T 1 + T 3 T 2 \theta_{0,p,q}=T_1+T_3T_2 θ 0 , p , q = T 1 + T 3 T 2 , whose approximation error we control through three remainder terms R α R_\alpha R α , R γ R_\gamma R γ , and R δ R_\delta R δ . Section C proves the asymptotic normality theorem, Theorem 5.2 from § 5 , which gives the sampling theory for our cross-fitted estimator. The supporting results for identification and asymptotic analysis are gathered in Sections A.2 and C.1, respectively. The two matrix identities used in the identification proof are collected in Section D.1.
The notation of Section A.1 is used throughout both proofs. Any change is specified at the point where it is introduced. The identification argument involves no sampling. The asymptotic analysis uses the two-fold cross-fitting scheme of Algorithm 1, where the projection matrices and the regression coefficients are estimated on separate folds and then the two fold-specific estimators are averaged. We describe full details in the Section C.
Notation
For notational convenience, let f X i ∈ R p ˉ \mathbf{f}_{X_i}\in\mathbb{R}^{\bar{p}} f X i ∈ R p ˉ and f M i ∈ R q ˉ \mathbf{f}_{M_i}\in\mathbb{R}^{\bar{q}} f M i ∈ R q ˉ denote the latent factors for observation i i i , and define f i = ( f X i ⊤ , f M i ⊤ ) ⊤ ∈ R p ˉ + q ˉ \mathbf{f}_i=(\mathbf{f}_{X_i}^{\top},\mathbf{f}_{M_i}^{\top})^{\top}\in\mathbb{R}^{\bar{p}+\bar{q}} f i = ( f X i ⊤ , f M i ⊤ ) ⊤ ∈ R p ˉ + q ˉ . Let F X ∈ R n × p ˉ \mathbf{F}_X\in\mathbb{R}^{n\times\bar{p}} F X ∈ R n × p ˉ and F M ∈ R n × q ˉ \mathbf{F}_M\in\mathbb{R}^{n\times\bar{q}} F M ∈ R n × q ˉ be the matrices for the corresponding latent factors across observations. Define F = ( F X , F M ) ∈ R n × ( p ˉ + q ˉ ) \mathbf{F}=(\mathbf{F}_X,\mathbf{F}_M)\in\mathbb{R}^{n\times(\bar{p}+\bar{q})} F = ( F X , F M ) ∈ R n × ( p ˉ + q ˉ ) and the augmented factor matrix F 1 = ( 1 , F ) ∈ R n × ( 1 + p ˉ + q ˉ ) \mathbf{F}_1=(\mathbf{1},\mathbf{F})\in\mathbb{R}^{n\times(1+\bar{p}+\bar{q})} F 1 = ( 1 , F ) ∈ R n × ( 1 + p ˉ + q ˉ ) , where 1 ∈ R n \mathbf{1}\in\mathbb{R}^{n} 1 ∈ R n is the vector of ones.
Let H X ∈ R p ~ × p ˉ \mathbf{H}_X\in\mathbb{R}^{\tilde{p}\times\bar{p}} H X ∈ R p ~ × p ˉ and H M ∈ R q ~ × q ˉ \mathbf{H}_M\in\mathbb{R}^{\tilde{q}\times\bar{q}} H M ∈ R q ~ × q ˉ be the transformation matrices. Define H = diag ( H X , H M ) ∈ R ( p ~ + q ~ ) × ( p ˉ + q ˉ ) \mathbf{H}=\operatorname{diag}(\mathbf{H}_X,\mathbf{H}_M)\in\mathbb{R}^{(\tilde{p}+\tilde{q})\times(\bar{p}+\bar{q})} H = diag ( H X , H M ) ∈ R ( p ~ + q ~ ) × ( p ˉ + q ˉ ) and H 1 = diag ( 1 , H X , H M ) ∈ R ( 1 + p ~ + q ~ ) × ( 1 + p ˉ + q ˉ ) \mathbf{H}_1=\operatorname{diag}(1,\mathbf{H}_X,\mathbf{H}_M)\in\mathbb{R}^{(1+\tilde{p}+\tilde{q})\times(1+\bar{p}+\bar{q})} H 1 = diag ( 1 , H X , H M ) ∈ R ( 1 + p ~ + q ~ ) × ( 1 + p ˉ + q ˉ ) . The true design matrix on the projected scale is Z = F 1 H 1 ⊤ ∈ R n × ( 1 + p ~ + q ~ ) \mathbf{Z}=\mathbf{F}_1\mathbf{H}_1^{\top}\in\mathbb{R}^{n\times(1+\tilde{p}+\tilde{q})} Z = F 1 H 1 ⊤ ∈ R n × ( 1 + p ~ + q ~ ) , or equivalently Z ⊤ = H 1 F 1 ⊤ ∈ R ( 1 + p ~ + q ~ ) × n \mathbf{Z}^{\top}=\mathbf{H}_1\mathbf{F}_1^{\top}\in\mathbb{R}^{(1+\tilde{p}+\tilde{q})\times n} Z ⊤ = H 1 F 1 ⊤ ∈ R ( 1 + p ~ + q ~ ) × n .
Next, let u X i ∈ R p \mathbf{u}_{X_i}\in\mathbb{R}^{p} u X i ∈ R p and u M i ∈ R q \mathbf{u}_{M_i}\in\mathbb{R}^{q} u M i ∈ R q denote the idiosyncratic errors, and define u i = ( u X i ⊤ , u M i ⊤ ) ⊤ ∈ R p + q \mathbf{u}_i=(\mathbf{u}_{X_i}^{\top},\mathbf{u}_{M_i}^{\top})^{\top}\in\mathbb{R}^{p+q} u i = ( u X i ⊤ , u M i ⊤ ) ⊤ ∈ R p + q . Let U X ∈ R n × p \mathbf{U}_X\in\mathbb{R}^{n\times p} U X ∈ R n × p and U M ∈ R n × q \mathbf{U}_M\in\mathbb{R}^{n\times q} U M ∈ R n × q be the matrices of these errors across observations, and write U = ( U X , U M ) ∈ R n × ( p + q ) \mathbf{U}=(\mathbf{U}_X,\mathbf{U}_M)\in\mathbb{R}^{n\times(p+q)} U = ( U X , U M ) ∈ R n × ( p + q ) . Let V X ∈ R p × p ~ \mathbf{V}_X\in\mathbb{R}^{p\times\tilde{p}} V X ∈ R p × p ~ and V M ∈ R q × q ~ \mathbf{V}_M\in\mathbb{R}^{q\times\tilde{q}} V M ∈ R q × q ~ be as defined in Sections 3 and 5, respectively. Define W X = p V X \mathbf{W}_X=\sqrt{p}\mathbf{V}_X W X = p V X , W M = q V M \mathbf{W}_M=\sqrt{q}\mathbf{V}_M W M = q V M , and W = diag ( p − 1 W X , q − 1 W M ) ∈ R ( p + q ) × ( p ~ + q ~ ) \mathbf{W}=\operatorname{diag}(p^{-1}\mathbf{W}_X,q^{-1}\mathbf{W}_M)\in\mathbb{R}^{(p+q)\times(\tilde{p}+\tilde{q})} W = diag ( p − 1 W X , q − 1 W M ) ∈ R ( p + q ) × ( p ~ + q ~ ) . For each observation, define the projected errors e X i = p − 1 W X ⊤ u X i ∈ R p ~ \mathbf{e}_{X_i}=p^{-1}\mathbf{W}_X^{\top}\mathbf{u}_{X_i}\in\mathbb{R}^{\tilde{p}} e X i = p − 1 W X ⊤ u X i ∈ R p ~ , e M i = q − 1 W M ⊤ u M i ∈ R q ~ \mathbf{e}_{M_i}=q^{-1}\mathbf{W}_M^{\top}\mathbf{u}_{M_i}\in\mathbb{R}^{\tilde{q}} e M i = q − 1 W M ⊤ u M i ∈ R q ~ , and e i = W ⊤ u i ∈ R p ~ + q ~ \mathbf{e}_i=\mathbf{W}^{\top}\mathbf{u}_i\in\mathbb{R}^{\tilde{p}+\tilde{q}} e i = W ⊤ u i ∈ R p ~ + q ~ . Their augmented versions are e 0 i = ( 0 , e i ⊤ ) ⊤ ∈ R 1 + p ~ + q ~ \mathbf{e}_{0i}=(0,\mathbf{e}_i^{\top})^{\top}\in\mathbb{R}^{1+\tilde{p}+\tilde{q}} e 0 i = ( 0 , e i ⊤ ) ⊤ ∈ R 1 + p ~ + q ~ and e X 0 , i = ( 0 , e X i ⊤ ) ⊤ ∈ R 1 + p ~ \mathbf{e}_{X0,i}=(0,\mathbf{e}_{X_i}^{\top})^{\top}\in\mathbb{R}^{1+\tilde{p}} e X 0 , i = ( 0 , e X i ⊤ ) ⊤ ∈ R 1 + p ~ . Define the projected estimation error matrix E = U W ∈ R n × ( p ~ + q ~ ) \mathbf{E}=\mathbf{U}\mathbf{W}\in\mathbb{R}^{n\times(\tilde{p}+\tilde{q})} E = UW ∈ R n × ( p ~ + q ~ ) , and its augmented version E 0 = ( 0 n , E ) ∈ R n × ( 1 + p ~ + q ~ ) \mathbf{E}_0=(\mathbf{0}_n,\mathbf{E})\in\mathbb{R}^{n\times(1+\tilde{p}+\tilde{q})} E 0 = ( 0 n , E ) ∈ R n × ( 1 + p ~ + q ~ ) , where 0 n ∈ R n \mathbf{0}_n\in\mathbb{R}^{n} 0 n ∈ R n is the zero column vector.
The estimated factors are collected in F ^ = ( F ^ X , F ^ M ) ∈ R n × ( p ~ + q ~ ) \widehat{\mathbf{F}}=(\widehat{\mathbf{F}}_X,\widehat{\mathbf{F}}_M)\in\mathbb{R}^{n\times(\tilde{p}+\tilde{q})} F = ( F X , F M ) ∈ R n × ( p ~ + q ~ ) where F ^ X ∈ R n × p ~ \widehat{\mathbf{F}}_X\in\mathbb{R}^{n\times\tilde{p}} F X ∈ R n × p ~ and F ^ M ∈ R n × q ~ \widehat{\mathbf{F}}_M\in\mathbb{R}^{n\times\tilde{q}} F M ∈ R n × q ~ . The estimated design matrix is Z ^ = ( 1 , F ^ ) ∈ R n × ( 1 + p ~ + q ~ ) \widehat{\mathbf{Z}}=(\mathbf{1},\widehat{\mathbf{F}})\in\mathbb{R}^{n\times(1+\tilde{p}+\tilde{q})} Z = ( 1 , F ) ∈ R n × ( 1 + p ~ + q ~ ) . Throughout, we use the decomposition
Z ^ = Z + E 0 , (11) \widehat{\mathbf{Z}}=\mathbf{Z}+\mathbf{E}_0, \tag*{(11)} Z = Z + E 0 , (11)
where Z ^ \widehat{\mathbf{Z}} Z , Z \mathbf{Z} Z , and E 0 \mathbf{E}_0 E 0 all lie in R n × ( 1 + p ~ + q ~ ) \mathbb{R}^{n\times(1+\tilde{p}+\tilde{q})} R n × ( 1 + p ~ + q ~ ) .
For the outcome model, let Δ = ( α 1 , β 1 ⊤ , γ 1 ⊤ ) ⊤ ∈ R 1 + p ˉ + q ˉ \boldsymbol{\Delta}=(\alpha_1,\boldsymbol{\beta}_1^{\top},\boldsymbol{\gamma}_1^{\top})^{\top}\in\mathbb{R}^{1+\bar{p}+\bar{q}} Δ = ( α 1 , β 1 ⊤ , γ 1 ⊤ ) ⊤ ∈ R 1 + p ˉ + q ˉ , where α 1 ∈ R \alpha_1\in\mathbb{R} α 1 ∈ R , β 1 ∈ R p ˉ \boldsymbol{\beta}_1\in\mathbb{R}^{\bar{p}} β 1 ∈ R p ˉ , and γ 1 ∈ R q ˉ \boldsymbol{\gamma}_1\in\mathbb{R}^{\bar{q}} γ 1 ∈ R q ˉ denote the true coefficients on the latent factor scale. The corresponding coefficient vector in the projected factor scale is
δ = ( H 1 ⊤ ) ⊤ Δ = ( α 1 ( H X ⊤ ) ⊤ β 1 ( H M ⊤ ) ⊤ γ 1 ) ∈ R 1 + p ~ + q ~ . \boldsymbol{\delta}=(\mathbf{H}_1^{\top})^{\top}\boldsymbol{\Delta}=
\begin{pmatrix}
\alpha_1\\
(\mathbf{H}_X^{\top})^{\top}\boldsymbol{\beta}_1\\
(\mathbf{H}_M^{\top})^{\top}\boldsymbol{\gamma}_1
\end{pmatrix}
\in\mathbb{R}^{1+\tilde{p}+\tilde{q}}. δ = ( H 1 ⊤ ) ⊤ Δ = α 1 ( H X ⊤ ) ⊤ β 1 ( H M ⊤ ) ⊤ γ 1 ∈ R 1 + p ~ + q ~ .
The estimated coefficient vector is δ ^ = ( α ^ 1 , β ^ 1 ⊤ , γ ^ 1 ⊤ ) ⊤ ∈ R 1 + p ~ + q ~ \widehat{\boldsymbol{\delta}}=(\widehat{\alpha}_1,\widehat{\boldsymbol{\beta}}_1^{\top},\widehat{\boldsymbol{\gamma}}_1^{\top})^{\top}\in\mathbb{R}^{1+\tilde{p}+\tilde{q}} δ = ( α 1 , β 1 ⊤ , γ 1 ⊤ ) ⊤ ∈ R 1 + p ~ + q ~ , where α ^ 1 ∈ R \widehat{\alpha}_1\in\mathbb{R} α 1 ∈ R , β ^ 1 ∈ R p ~ \widehat{\boldsymbol{\beta}}_1\in\mathbb{R}^{\tilde{p}} β 1 ∈ R p ~ , and γ ^ 1 ∈ R q ~ \widehat{\boldsymbol{\gamma}}_1\in\mathbb{R}^{\tilde{q}} γ 1 ∈ R q ~ . Let Y = ( Y 1 , … , Y n ) ⊤ ∈ R n \mathbf{Y}=(Y_1,\ldots,Y_n)^{\top}\in\mathbb{R}^{n} Y = ( Y 1 , … , Y n ) ⊤ ∈ R n and ϵ 1 = ( ϵ 1 , 1 , … , ϵ 1 , n ) ⊤ ∈ R n \boldsymbol{\epsilon}_1=(\epsilon_{1,1},\ldots,\epsilon_{1,n})^{\top}\in\mathbb{R}^{n} ϵ 1 = ( ϵ 1 , 1 , … , ϵ 1 , n ) ⊤ ∈ R n . The treatment-specific outcome equation is
Y = Z δ + ϵ 1 , (12) \mathbf{Y}=\mathbf{Z}\boldsymbol{\delta}+\boldsymbol{\epsilon}_1, \tag*{(12)} Y = Z δ + ϵ 1 , (12)
where Z ∈ R n × ( 1 + p ~ + q ~ ) \mathbf{Z}\in\mathbb{R}^{n\times(1+\tilde{p}+\tilde{q})} Z ∈ R n × ( 1 + p ~ + q ~ ) and δ ∈ R 1 + p ~ + q ~ \boldsymbol{\delta}\in\mathbb{R}^{1+\tilde{p}+\tilde{q}} δ ∈ R 1 + p ~ + q ~ .
For the mediator block, define the selector matrix S q ˉ = [ 0 q ˉ × ( 1 + p ˉ ) I q ˉ ] ∈ R q ˉ × ( 1 + p ˉ + q ˉ ) \mathbf{S}_{\bar{q}}=[\mathbf{0}_{\bar{q}\times(1+\bar{p})}\ \mathbf{I}_{\bar{q}}]\in\mathbb{R}^{\bar{q}\times(1+\bar{p}+\bar{q})} S q ˉ = [ 0 q ˉ × ( 1 + p ˉ ) I q ˉ ] ∈ R q ˉ × ( 1 + p ˉ + q ˉ ) , so that S q ˉ \mathbf{S}_{\bar{q}} S q ˉ extracts the last q ˉ \bar{q} q ˉ coordinates of any vector in the projected design scale. Also, define P q ˉ = [ 0 q ˉ × ( 1 + p ˉ ) I q ˉ ] ∈ R q ˉ × ( 1 + p ˉ + q ˉ ) \mathbf{P}_{\bar{q}}=[\mathbf{0}_{\bar{q}\times(1+\bar{p})}\ \mathbf{I}_{\bar{q}}]\in\mathbb{R}^{\bar{q}\times(1+\bar{p}+\bar{q})} P q ˉ = [ 0 q ˉ × ( 1 + p ˉ ) I q ˉ ] ∈ R q ˉ × ( 1 + p ˉ + q ˉ ) , so that H M ⊤ S q ˉ = P q ˉ H 1 ⊤ \mathbf{H}_M^{\top}\mathbf{S}_{\bar{q}}=\mathbf{P}_{\bar{q}}\mathbf{H}_1^{\top} H M ⊤ S q ˉ = P q ˉ H 1 ⊤ . Throughout, e 1 \mathbf{e}_1 e 1 denotes the first standard basis vector of whatever dimension the surrounding matrix product requires.
Supporting Results
This subsection collects the invariance lemma and the well-posedness lemma for the population regressions used in the proof of Theorem 3.1. The two matrix identities, the intercept-augmented block inversion formula and the Woodbury identity, are given in Section D.1. We first fix notation and write the moment identities that the lemmas and the main proof in Section B draw on repeatedly. Define
L = ( 1 1 p W X T X 1 q W M T M ) ; Q = ( 1 1 p W X T X ) ; N = 1 q W M T M ; Z = ( 1 H X f X H M f M ) . (13) L=\begin{pmatrix}1\\ \frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}X\\ \frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}M\end{pmatrix};\quad Q=\begin{pmatrix}1\\ \frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}X\end{pmatrix};\quad N=\frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}M;\quad Z=\begin{pmatrix}1\\ \mathbf{H}_{X}\mathbf{f}_{X}\\ \mathbf{H}_{M}\mathbf{f}_{M}\end{pmatrix}. \tag*{(13)} L = 1 p 1 W X T X q 1 W M T M ; Q = ( 1 p 1 W X T X ) ; N = q 1 W M T M ; Z = 1 H X f X H M f M . (13)
Substituting the factor model X = Γ X f X + u X X=\mathbf{\Gamma}_{X}\mathbf{f}_{X}+\mathbf{u}_{X} X = Γ X f X + u X and M = Γ M f M + u M M=\mathbf{\Gamma}_{M}\mathbf{f}_{M}+\mathbf{u}_{M} M = Γ M f M + u M from Equation (2) into L L L , and using H X = 1 p W X T Γ X \mathbf{H}_{X}=\frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}\mathbf{\Gamma}_{X} H X = p 1 W X T Γ X , H M = 1 q W M T Γ M \mathbf{H}_{M}=\frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}\mathbf{\Gamma}_{M} H M = q 1 W M T Γ M from Definition 3.1, gives the signal-plus-noise decomposition as follows:
L = Z + e 0 = H 1 f 1 + e 0 , (14) L=Z+\mathbf{e}_{0}=\mathbf{H}_{1}\mathbf{f}_{1}+\mathbf{e}_{0}, \tag*{(14)} L = Z + e 0 = H 1 f 1 + e 0 , (14)
where f 1 = ( 1 , f X T , f M T ) T \mathbf{f}_{1}=(1,\mathbf{f}_{X}^{\mathsf{T}},\mathbf{f}_{M}^{\mathsf{T}})^{\mathsf{T}} f 1 = ( 1 , f X T , f M T ) T , H 1 = diag ( 1 , H X , H M ) \mathbf{H}_{1}=\operatorname{diag}(1,\mathbf{H}_{X},\mathbf{H}_{M}) H 1 = diag ( 1 , H X , H M ) , e 0 = ( 0 , e X T , e M T ) T \mathbf{e}_{0}=(0,\mathbf{e}_{X}^{\mathsf{T}},\mathbf{e}_{M}^{\mathsf{T}})^{\mathsf{T}} e 0 = ( 0 , e X T , e M T ) T , e X = ( W X T u X ) / p ∈ R p ~ \mathbf{e}_{X}=(\mathbf{W}_{X}^{\mathsf{T}}\mathbf{u}_{X})/p\in\mathbb{R}^{\widetilde{p}} e X = ( W X T u X ) / p ∈ R p , and e M = ( W M T u M ) / q ∈ R q ~ \mathbf{e}_{M}=(\mathbf{W}_{M}^{\mathsf{T}}\mathbf{u}_{M})/q\in\mathbb{R}^{\widetilde{q}} e M = ( W M T u M ) / q ∈ R q . Since Q Q Q consists of the leading 1 + p ~ 1+\widetilde{p} 1 + p coordinates of L L L , the same computation restricted to the X X X -block gives
Q = H X 1 f X 1 + e X 0 , f X 1 = ( 1 , f X T ) T , H X 1 = diag ( 1 , H X ) , e X 0 = ( 0 , e X T ) T . (15) Q=\mathbf{H}_{X1}\mathbf{f}_{X1}+\mathbf{e}_{X0},\quad\mathbf{f}_{X1}=(1,\mathbf{f}_{X}^{\mathsf{T}})^{\mathsf{T}},\quad\mathbf{H}_{X1}=\operatorname{diag}(1,\mathbf{H}_{X}),\quad\mathbf{e}_{X0}=(0,\mathbf{e}_{X}^{\mathsf{T}})^{\mathsf{T}}. \tag*{(15)} Q = H X 1 f X 1 + e X 0 , f X 1 = ( 1 , f X T ) T , H X 1 = diag ( 1 , H X ) , e X 0 = ( 0 , e X T ) T . (15)
We record the following moment identities, which hold for both treatment groups and are used throughout the Section B. By Assumption 3.1(ii), E ( u X ) = E ( u M ) = 0 \mathbb{E}(\mathbf{u}_{X})=\mathbb{E}(\mathbf{u}_{M})=0 E ( u X ) = E ( u M ) = 0 , so E ( e 0 ) = 0 \mathbb{E}(\mathbf{e}_{0})=0 E ( e 0 ) = 0 , and the independence property gives E [ f 1 e 0 T ∣ A ] = 0 \mathbb{E}[\mathbf{f}_{1}\mathbf{e}_{0}^{\mathsf{T}}\mid A]=0 E [ f 1 e 0 T ∣ A ] = 0 . Also by Assumption 3.1(ii), E ( u X u M T ) = 0 \mathbb{E}(\mathbf{u}_{X}\mathbf{u}_{M}^{\mathsf{T}})=0 E ( u X u M T ) = 0 , hence E ( e X e M T ) = 0 \mathbb{E}(\mathbf{e}_{X}\mathbf{e}_{M}^{\mathsf{T}})=0 E ( e X e M T ) = 0 , so
Σ e 0 : = E ( e 0 e 0 T ) = diag ( 0 , Σ e X , Σ e M ) , Σ e X = 1 p V X T Σ u X V X , Σ e M = 1 q V M T Σ u M V M , \boldsymbol{\Sigma}_{\mathbf{e}_{0}}:=\mathbb{E}(\mathbf{e}_{0}\mathbf{e}_{0}^{\mathsf{T}})=\operatorname{diag}(0,\boldsymbol{\Sigma}_{\mathbf{e}_{X}},\boldsymbol{\Sigma}_{\mathbf{e}_{M}}),\quad\boldsymbol{\Sigma}_{\mathbf{e}_{X}}=\frac{1}{p}\mathbf{V}_{X}^{\mathsf{T}}\boldsymbol{\Sigma}_{\mathbf{u}_{X}}\mathbf{V}_{X},\quad\boldsymbol{\Sigma}_{\mathbf{e}_{M}}=\frac{1}{q}\mathbf{V}_{M}^{\mathsf{T}}\boldsymbol{\Sigma}_{\mathbf{u}_{M}}\mathbf{V}_{M}, Σ e 0 := E ( e 0 e 0 T ) = diag ( 0 , Σ e X , Σ e M ) , Σ e X = p 1 V X T Σ u X V X , Σ e M = q 1 V M T Σ u M V M ,
using W X = p V X \mathbf{W}_{X}=\sqrt{p}\mathbf{V}_{X} W X = p V X and W M = q V M \mathbf{W}_{M}=\sqrt{q}\mathbf{V}_{M} W M = q V M from Definition 3.1. The conditional second moments of u X , u M \mathbf{u}_{X},\mathbf{u}_{M} u X , u M in Assumption 3.1(i) and (ii) do not depend on ( f X , f M , A ) (\mathbf{f}_{X},\mathbf{f}_{M},A) ( f X , f M , A ) , so these identities hold unconditionally. Now, restricting to A = 0 A=0 A = 0 gives the X X X -block analogues
E [ f X 1 e X 0 T ∣ A = 0 ] = 0 , E ( e X 0 e X 0 T ) = diag ( 0 , Σ e X ) . \mathbb{E}[\mathbf{f}_{X1}\mathbf{e}_{X0}^{\mathsf{T}}\mid A=0]=0,\quad\mathbb{E}(\mathbf{e}_{X0}\mathbf{e}_{X0}^{\mathsf{T}})=\operatorname{diag}(0,\boldsymbol{\Sigma}_{\mathbf{e}_{X}}). E [ f X 1 e X 0 T ∣ A = 0 ] = 0 , E ( e X 0 e X 0 T ) = diag ( 0 , Σ e X ) .
The first lemma establishes that the target functional depends on the latent factors only through their diversified projections.
Lemma A.1 (Invariance under linear transformation of the factors). For any H X , H M \mathbf{H}_{X},\mathbf{H}_{M} H X , H M with full column rank, we have:
E [ E [ Y ∣ f M , f X , A = 1 ] ∣ f X , A = 0 ] = E [ E [ Y ∣ H M f M , H X f X , A = 1 ] ∣ H X f X , A = 0 ] . \mathbb{E}\left[\mathbb{E}[Y\mid\mathbf{f}_{M},\mathbf{f}_{X},A=1]\mid\mathbf{f}_{X},A=0\right]
=
\mathbb{E}\left[\mathbb{E}[Y\mid\mathbf{H}_{M}\mathbf{f}_{M},\mathbf{H}_{X}\mathbf{f}_{X},A=1]\mid\mathbf{H}_{X}\mathbf{f}_{X},A=0\right]. E [ E [ Y ∣ f M , f X , A = 1 ] ∣ f X , A = 0 ] = E [ E [ Y ∣ H M f M , H X f X , A = 1 ] ∣ H X f X , A = 0 ] . Proof. Since H X f X \mathbf{H}_{X}\mathbf{f}_{X} H X f X and H M f M \mathbf{H}_{M}\mathbf{f}_{M} H M f M are measurable functions of f X \mathbf{f}_{X} f X and f M \mathbf{f}_{M} f M respectively, we have σ ( H X f X , H M f M ) ⊂ σ ( f X , f M ) \sigma(\mathbf{H}_{X}\mathbf{f}_{X},\mathbf{H}_{M}\mathbf{f}_{M})\subset\sigma(\mathbf{f}_{X},\mathbf{f}_{M}) σ ( H X f X , H M f M ) ⊂ σ ( f X , f M ) . On the other hand, as H X \mathbf{H}_{X} H X and H M \mathbf{H}_{M} H M have full column rank they admit left inverses H X † \mathbf{H}_{X}^{\dagger} H X † and H M † \mathbf{H}_{M}^{\dagger} H M † respectively, which satisfy H X † H X = I p ˉ \mathbf{H}_{X}^{\dagger}\mathbf{H}_{X}=I_{\bar p} H X † H X = I p ˉ , H M † H M = I q ˉ \mathbf{H}_{M}^{\dagger}\mathbf{H}_{M}=I_{\bar q} H M † H M = I q ˉ . Consequently we have f X = H X † ( H X f X ) \mathbf{f}_{X}=\mathbf{H}_{X}^{\dagger}(\mathbf{H}_{X}\mathbf{f}_{X}) f X = H X † ( H X f X ) and f M = H M † ( H M f M ) \mathbf{f}_{M}=\mathbf{H}_{M}^{\dagger}(\mathbf{H}_{M}\mathbf{f}_{M}) f M = H M † ( H M f M ) and hence σ ( f X , f M ) ⊆ σ ( H X f X , H M f M ) \sigma(\mathbf{f}_{X},\mathbf{f}_{M})\subseteq\sigma(\mathbf{H}_{X}\mathbf{f}_{X},\mathbf{H}_{M}\mathbf{f}_{M}) σ ( f X , f M ) ⊆ σ ( H X f X , H M f M ) . Therefore, σ ( f X , f M ) = σ ( H X f X , H M f M ) \sigma(\mathbf{f}_{X},\mathbf{f}_{M})=\sigma(\mathbf{H}_{X}\mathbf{f}_{X},\mathbf{H}_{M}\mathbf{f}_{M}) σ ( f X , f M ) = σ ( H X f X , H M f M ) . This argument also yields σ ( f X ) = σ ( H X f X ) \sigma(\mathbf{f}_{X})=\sigma(\mathbf{H}_{X}\mathbf{f}_{X}) σ ( f X ) = σ ( H X f X ) . As the conditional expectation of a random variable given another random variable is the projection of the former onto the sigma-field generated by the latter, we have:
σ ( f X , f M ) = σ ( H X f X , H M f M ) ⟹ E [ Y ∣ H M f M , H X f X , A = 1 ] = E [ Y ∣ f M , f X , A = 1 ] a.s. \sigma(\mathbf{f}_{X},\mathbf{f}_{M})=\sigma(\mathbf{H}_{X}\mathbf{f}_{X},\mathbf{H}_{M}\mathbf{f}_{M})\Longrightarrow\mathbb{E}[Y\mid\mathbf{H}_{M}\mathbf{f}_{M},\mathbf{H}_{X}\mathbf{f}_{X},A=1]=\mathbb{E}[Y\mid\mathbf{f}_{M},\mathbf{f}_{X},A=1]\quad\text{a.s.} σ ( f X , f M ) = σ ( H X f X , H M f M ) ⟹ E [ Y ∣ H M f M , H X f X , A = 1 ] = E [ Y ∣ f M , f X , A = 1 ] a.s. Furthermore, from σ ( f X ) = σ ( H X f X ) \sigma(\mathbf{f}_{X})=\sigma(\mathbf{H}_{X}\mathbf{f}_{X}) σ ( f X ) = σ ( H X f X ) , we have:
E [ E [ Y ∣ H M f M , H X f X , A = 1 ] ∣ H X f X , A = 0 ] = E [ E [ Y ∣ f M , f X , A = 1 ] ∣ f X , A = 0 ] , a.s. \mathbb{E}\left[\mathbb{E}[Y\mid\mathbf{H}_{M}\mathbf{f}_{M},\mathbf{H}_{X}\mathbf{f}_{X},A=1]\mid\mathbf{H}_{X}\mathbf{f}_{X},A=0\right]
=
\mathbb{E}\left[\mathbb{E}[Y\mid\mathbf{f}_{M},\mathbf{f}_{X},A=1]\mid\mathbf{f}_{X},A=0\right],\quad\text{a.s.} E [ E [ Y ∣ H M f M , H X f X , A = 1 ] ∣ H X f X , A = 0 ] = E [ E [ Y ∣ f M , f X , A = 1 ] ∣ f X , A = 0 ] , a.s. Finally, taking another expectation with respect to H X f X \mathbf{H}_{X}\mathbf{f}_{X} H X f X and f X \mathbf{f}_{X} f X on the left and right sides of the above equality, respectively, we conclude the proof. □ \square □
Recall the definition of θ 0 , p , q \theta_{0,p,q} θ 0 , p , q in § 3 :
T 1 = e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] , T 2 = S q ~ E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] ∈ R q ~ , T_{1}=\mathbf{e}_{1}^{\mathsf{T}}\mathbb{E}[LL^{\mathsf{T}}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1],\quad T_{2}=\mathbf{S}_{\widetilde{q}}\mathbb{E}[LL^{\mathsf{T}}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]\in\mathbb{R}^{\widetilde{q}}, T 1 = e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] , T 2 = S q E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] ∈ R q , T 3 = e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ∈ R 1 × q ~ . T_{3}=\mathbf{e}_{1}^{\mathsf{T}}\mathbb{E}[QQ^{\mathsf{T}}\mid A=0]^{-1}\mathbb{E}[QN^{\mathsf{T}}\mid A=0]\in\mathbb{R}^{1\times\widetilde{q}}. T 3 = e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ∈ R 1 × q . The next lemma guarantees that these population regression coefficients in the projected functional are well defined.
Lemma A.2 (Well-posedness of the population regressions). Let W X \mathbf{W}_{X} W X and W M \mathbf{W}_{M} W M be full-projection matrices as defined in Definition 3.1. Under Assumptions 3.1 and 3.2, the matrices E [ L L T ∣ A = 1 ] \mathbb{E}[LL^{\mathsf{T}}\mid A=1] E [ L L T ∣ A = 1 ] and E [ Q Q T ∣ A = 0 ] \mathbb{E}[QQ^{\mathsf{T}}\mid A=0] E [ Q Q T ∣ A = 0 ] are positive definite, and hence invertible. Thus, T 1 , T 2 T_{1},T_{2} T 1 , T 2 and T 3 T_{3} T 3 are well defined.
Proof of Theorem 3.1
Proof. For any nonzero w ∈ R p ˉ w \in\mathbb{R}^{\bar p} w ∈ R p ˉ , we have that
w ⊤ Σ e X w = 1 p ( V X w ) ⊤ Σ u X ( V X w ) ≥ λ min ( Σ u X ) p ∥ V X w ∥ 2 ≥ λ min ( V X ⊤ V X ) λ min ( Σ u X ) p ∥ w ∥ 2 > 0 , w^{\top}\Sigma_{eX}w=\frac{1}{p}(V_Xw)^{\top}\Sigma_{uX}(V_Xw)\ge\frac{\lambda_{\min}(\Sigma_{uX})}{p}\lVert V_Xw\rVert^2\ge\frac{\lambda_{\min}(V_X^{\top}V_X)\lambda_{\min}(\Sigma_{uX})}{p}\lVert w\rVert^2>0, w ⊤ Σ e X w = p 1 ( V X w ) ⊤ Σ u X ( V X w ) ≥ p λ m i n ( Σ u X ) ∥ V X w ∥ 2 ≥ p λ m i n ( V X ⊤ V X ) λ m i n ( Σ u X ) ∥ w ∥ 2 > 0 ,
using λ min ( V X ⊤ V X ) ≥ c \lambda_{\min}(V_X^{\top}V_X)\ge c λ m i n ( V X ⊤ V X ) ≥ c from Definition 3.1 and λ min ( Σ u X ) ≥ c > 0 \lambda_{\min}(\Sigma_{uX})\ge c>0 λ m i n ( Σ u X ) ≥ c > 0 from Assumption 3.1(v). Hence, Σ e X ≻ 0 \Sigma_{eX}\succ0 Σ e X ≻ 0 and the same argument gives Σ e M ≻ 0 \Sigma_{eM}\succ0 Σ e M ≻ 0 .
Next, we show that the augmented factor second-moment matrices are positive definite. Recall Ω 1 = E [ f 1 f 1 ⊤ ∣ A = 1 ] \Omega_1=\mathbb{E}[f_1f_1^{\top}\mid A=1] Ω 1 = E [ f 1 f 1 ⊤ ∣ A = 1 ] . Now, take any nonzero vector v = ( v 0 , b ⊤ ) ⊤ ∈ R 1 + p ˉ + q ˉ v=(v_0,b^{\top})^{\top}\in\mathbb{R}^{1+\bar p+\bar q} v = ( v 0 , b ⊤ ) ⊤ ∈ R 1 + p ˉ + q ˉ , where b = ( b X ⊤ , b M ⊤ ) ⊤ b=(b_X^{\top},b_M^{\top})^{\top} b = ( b X ⊤ , b M ⊤ ) ⊤ . We have that v ⊤ Ω 1 v = E [ ( v 0 + b ⊤ f ) 2 ∣ A = 1 ] v^{\top}\Omega_1v=\mathbb{E}[(v_0+b^{\top}f)^2\mid A=1] v ⊤ Ω 1 v = E [( v 0 + b ⊤ f ) 2 ∣ A = 1 ] . If b ≠ 0 b\ne0 b = 0 , let μ f ∣ 1 = E [ f ∣ A = 1 ] \mu_{f\mid1}=\mathbb{E}[f\mid A=1] μ f ∣ 1 = E [ f ∣ A = 1 ] be the conditional mean under treatment group of the factors. Now, by the definition of variance, we have that
Var ( b ⊤ f ∣ A = 1 ) = E [ ( b ⊤ f − E [ b ⊤ f ∣ A = 1 ] ) 2 ∣ A = 1 ] = E [ ( b ⊤ ( f − μ f ∣ 1 ) ) 2 ∣ A = 1 ] . \operatorname{Var}(b^{\top}f\mid A=1)=\mathbb{E}\left[\left(b^{\top}f-\mathbb{E}[b^{\top}f\mid A=1]\right)^2\mid A=1\right]=\mathbb{E}\left[\left(b^{\top}(f-\mu_{f\mid1})\right)^2\mid A=1\right]. Var ( b ⊤ f ∣ A = 1 ) = E [ ( b ⊤ f − E [ b ⊤ f ∣ A = 1 ] ) 2 ∣ A = 1 ] = E [ ( b ⊤ ( f − μ f ∣ 1 ) ) 2 ∣ A = 1 ] .
Since b ⊤ ( f − μ f ∣ 1 ) b^{\top}(f-\mu_{f\mid1}) b ⊤ ( f − μ f ∣ 1 ) is a scalar, so we can write its square as ( b ⊤ ( f − μ f ∣ 1 ) ) 2 = b ⊤ ( f − μ f ∣ 1 ) ( f − μ f ∣ 1 ) ⊤ b (b^{\top}(f-\mu_{f\mid1}))^2=b^{\top}(f-\mu_{f\mid1})(f-\mu_{f\mid1})^{\top}b ( b ⊤ ( f − μ f ∣ 1 ) ) 2 = b ⊤ ( f − μ f ∣ 1 ) ( f − μ f ∣ 1 ) ⊤ b . When we take the conditional expectation, we get that
b ⊤ E [ ( f − μ f ∣ 1 ) ( f − μ f ∣ 1 ) ⊤ ∣ A = 1 ] b = b ⊤ Cov ( f ∣ A = 1 ) b = b ⊤ Σ f ∣ A = 1 b , b^{\top}\mathbb{E}[(f-\mu_{f\mid1})(f-\mu_{f\mid1})^{\top}\mid A=1]b=b^{\top}\operatorname{Cov}(f\mid A=1)b=b^{\top}\Sigma_{f\mid A=1}b, b ⊤ E [( f − μ f ∣ 1 ) ( f − μ f ∣ 1 ) ⊤ ∣ A = 1 ] b = b ⊤ Cov ( f ∣ A = 1 ) b = b ⊤ Σ f ∣ A = 1 b ,
By Assumption 3.1(iv), we have that λ min ( Σ f ∣ A = 1 ) ≥ c > 0 \lambda_{\min}(\Sigma_{f\mid A=1})\ge c>0 λ m i n ( Σ f ∣ A = 1 ) ≥ c > 0 , and so
Var ( b ⊤ f ∣ A = 1 ) = b ⊤ Σ f ∣ A = 1 b ≥ λ min ( Σ f ∣ A = 1 ) ∥ b ∥ 2 ≥ c ∥ b ∥ 2 > 0. \operatorname{Var}(b^{\top}f\mid A=1)=b^{\top}\Sigma_{f\mid A=1}b\ge\lambda_{\min}(\Sigma_{f\mid A=1})\lVert b\rVert^2\ge c\lVert b\rVert^2>0. Var ( b ⊤ f ∣ A = 1 ) = b ⊤ Σ f ∣ A = 1 b ≥ λ m i n ( Σ f ∣ A = 1 ) ∥ b ∥ 2 ≥ c ∥ b ∥ 2 > 0.
Since E [ Z 2 ] ≥ Var ( Z ) \mathbb{E}[Z^2]\ge\operatorname{Var}(Z) E [ Z 2 ] ≥ Var ( Z ) for any Z Z Z and adding the constant v 0 v_0 v 0 does not change the variance, we get that
v ⊤ Ω 1 v = E [ ( v 0 + b ⊤ f ) 2 ∣ A = 1 ] ≥ Var ( b ⊤ f ∣ A = 1 ) > 0. v^{\top}\Omega_1v=\mathbb{E}[(v_0+b^{\top}f)^2\mid A=1]\ge\operatorname{Var}(b^{\top}f\mid A=1)>0. v ⊤ Ω 1 v = E [( v 0 + b ⊤ f ) 2 ∣ A = 1 ] ≥ Var ( b ⊤ f ∣ A = 1 ) > 0.
If b = 0 b=0 b = 0 , then v ≠ 0 v\ne0 v = 0 implies v 0 ≠ 0 v_0\ne0 v 0 = 0 , so v ⊤ Ω 1 v = v 0 2 > 0 v^{\top}\Omega_1v=v_0^2>0 v ⊤ Ω 1 v = v 0 2 > 0 . Hence, Ω 1 ≻ 0 \Omega_1\succ0 Ω 1 ≻ 0 . The same argument applied to f X 1 f_{X1} f X 1 shows that $\Omega_{X0}:=\mathbb{E}[f_{X1}f_{X1}^{\top}\mid A=0]\succ 0.
By Equation A.4 and the moment identities in Section A.2, we have
E [ L L ⊤ ∣ A = 1 ] = H 1 Ω 1 H 1 ⊤ + Σ e 0 . \mathbb{E}[LL^{\top}\mid A=1]=H_1\Omega_1H_1^{\top}+\Sigma_{e0}. E [ L L ⊤ ∣ A = 1 ] = H 1 Ω 1 H 1 ⊤ + Σ e 0 .
Let Ω 1 1 / 2 \Omega_1^{1/2} Ω 1 1/2 denote the symmetric positive definite square root of Ω 1 \Omega_1 Ω 1 . For any v = ( v 0 , v X ⊤ , v M ⊤ ) ⊤ ∈ R 1 + p ~ + q ~ v=(v_0,v_X^{\top},v_M^{\top})^{\top}\in\mathbb{R}^{1+\tilde p+\tilde q} v = ( v 0 , v X ⊤ , v M ⊤ ) ⊤ ∈ R 1 + p ~ + q ~ , we obtain
v ⊤ E [ L L ⊤ ∣ A = 1 ] v = ∥ Ω 1 1 / 2 H 1 ⊤ v ∥ 2 + v X ⊤ Σ e X v X + v M ⊤ Σ e M v M ≥ 0. v^{\top}\mathbb{E}[LL^{\top}\mid A=1]v=\lVert\Omega_1^{1/2}H_1^{\top}v\rVert^2+v_X^{\top}\Sigma_{eX}v_X+v_M^{\top}\Sigma_{eM}v_M\ge0. v ⊤ E [ L L ⊤ ∣ A = 1 ] v = ∥ Ω 1 1/2 H 1 ⊤ v ∥ 2 + v X ⊤ Σ e X v X + v M ⊤ Σ e M v M ≥ 0.
Suppose this sum vanishes. Since each term is nonnegative, all three terms must be zero. The positive definiteness of Σ e X \Sigma_{eX} Σ e X and Σ e M \Sigma_{eM} Σ e M implies that the equalities v X ⊤ Σ e X v X = 0 v_X^{\top}\Sigma_{eX}v_X=0 v X ⊤ Σ e X v X = 0 and v M ⊤ Σ e M v M = 0 v_M^{\top}\Sigma_{eM}v_M=0 v M ⊤ Σ e M v M = 0 yield v X = 0 v_X=0 v X = 0 and v M = 0 v_M=0 v M = 0 , respectively. The first term gives ∥ Ω 1 1 / 2 H 1 ⊤ v ∥ 2 = 0 \lVert\Omega_1^{1/2}H_1^{\top}v\rVert^2=0 ∥ Ω 1 1/2 H 1 ⊤ v ∥ 2 = 0 , which implies Ω 1 1 / 2 H 1 ⊤ v = 0 \Omega_1^{1/2}H_1^{\top}v=0 Ω 1 1/2 H 1 ⊤ v = 0 . Since Ω 1 1 / 2 \Omega_1^{1/2} Ω 1 1/2 is invertible, we obtain H 1 ⊤ v = 0 H_1^{\top}v=0 H 1 ⊤ v = 0 .
Since H 1 = diag ( 1 , H X , H M ) H_1=\operatorname{diag}(1,H_X,H_M) H 1 = diag ( 1 , H X , H M ) and v X = v M = 0 v_X=v_M=0 v X = v M = 0 ,
H 1 ⊤ v = ( v 0 , H X ⊤ v X , H M ⊤ v M ) ⊤ = ( v 0 , 0 , 0 ) ⊤ , H_1^{\top}v=(v_0,H_X^{\top}v_X,H_M^{\top}v_M)^{\top}=(v_0,0,0)^{\top}, H 1 ⊤ v = ( v 0 , H X ⊤ v X , H M ⊤ v M ) ⊤ = ( v 0 , 0 , 0 ) ⊤ ,
so H 1 ⊤ v = 0 H_1^{\top}v=0 H 1 ⊤ v = 0 forces v 0 = 0 v_0=0 v 0 = 0 as well, and hence v = 0 v=0 v = 0 . Therefore, we get that E [ L L ⊤ ∣ A = 1 ] ≻ 0 \mathbb{E}[LL^{\top}\mid A=1]\succ0 E [ L L ⊤ ∣ A = 1 ] ≻ 0 .
For the control part, Equation A.5 gives E [ Q Q ⊤ ∣ A = 0 ] = H X 1 Ω X 0 H X 1 ⊤ + diag ( 0 , Σ e X ) \mathbb{E}[QQ^{\top}\mid A=0]=H_{X1}\Omega_{X0}H_{X1}^{\top}+\operatorname{diag}(0,\Sigma_{eX}) E [ Q Q ⊤ ∣ A = 0 ] = H X 1 Ω X 0 H X 1 ⊤ + diag ( 0 , Σ e X ) . The same argument with v = ( v 0 , v X ⊤ ) ⊤ v=(v_0,v_X^{\top})^{\top} v = ( v 0 , v X ⊤ ) ⊤ gives
v ⊤ E [ Q Q ⊤ ∣ A = 0 ] v = ∥ Ω X 0 1 / 2 H X 1 ⊤ v ∥ 2 + v X ⊤ Σ e X v X ≥ 0 , v^{\top}\mathbb{E}[QQ^{\top}\mid A=0]v=\lVert\Omega_{X0}^{1/2}H_{X1}^{\top}v\rVert^2+v_X^{\top}\Sigma_{eX}v_X\ge0, v ⊤ E [ Q Q ⊤ ∣ A = 0 ] v = ∥ Ω X 0 1/2 H X 1 ⊤ v ∥ 2 + v X ⊤ Σ e X v X ≥ 0 ,
which vanishes only if v X = 0 v_X=0 v X = 0 and H X 1 ⊤ v = ( v 0 , 0 ) ⊤ = 0 H_{X1}^{\top}v=(v_0,0)^{\top}=0 H X 1 ⊤ v = ( v 0 , 0 ) ⊤ = 0 , forcing v 0 = 0 v_0=0 v 0 = 0 and hence v = 0 v=0 v = 0 . Therefore, E [ Q Q ⊤ ∣ A = 0 ] ≻ 0 \mathbb{E}[QQ^{\top}\mid A=0]\succ0 E [ Q Q ⊤ ∣ A = 0 ] ≻ 0 . Therefore, both matrices are invertible, and thus, T 1 T_1 T 1 , T 2 T_2 T 2 and T 3 T_3 T 3 are well defined.
The block-inversion formula for the intercept and noise signal shared by E [ L L ⊤ ∣ A = 1 ] \mathbb{E}[LL^{\top}\mid A=1] E [ L L ⊤ ∣ A = 1 ] and E [ Q Q ⊤ ∣ A = 0 ] \mathbb{E}[QQ^{\top}\mid A=0] E [ Q Q ⊤ ∣ A = 0 ] is given in Lemma D.1 in Section D.1.
Proof of Theorem 3.1
Proof. Recall the definition of ( L , Q , N ) (L,Q,N) ( L , Q , N ) from (A.3). We write θ 0 , p , q \theta_{0,p,q} θ 0 , p , q in terms of the distributions of L L L , Q Q Q , and N N N as
θ 0 , p , q = e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] + ( e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ) ( S q ~ E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] ) \theta_{0,p,q}=e_1^{\mathsf T}\mathbb{E}[LL^{\mathsf T}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]
+\left(e_1^{\mathsf T}\mathbb{E}[QQ^{\mathsf T}\mid A=0]^{-1}\mathbb{E}[QN^{\mathsf T}\mid A=0]\right)\left(S_{\widetilde q}\mathbb{E}[LL^{\mathsf T}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]\right) θ 0 , p , q = e 1 T E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] + ( e 1 T E [ Q Q T ∣ A = 0 ] − 1 E [ Q N T ∣ A = 0 ] ) ( S q E [ L L T ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] )
: = T 1 + T 3 T 2 , :=T_1+T_3T_2, := T 1 + T 3 T 2 ,
By Lemma A.2, E [ L L T ∣ A = 1 ] \mathbb{E}[LL^{\mathsf T}\mid A=1] E [ L L T ∣ A = 1 ] and E [ Q Q T ∣ A = 0 ] \mathbb{E}[QQ^{\mathsf T}\mid A=0] E [ Q Q T ∣ A = 0 ] are invertible, so T 1 , T 2 T_1,T_2 T 1 , T 2 and T 3 T_3 T 3 are well defined. In the rest of the proof, we will establish a bound on the right-hand side of the above inequality.
T 1 = α 1 + R α , ∣ R α ∣ ≲ C 1 1 min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } , T_1=\alpha_1+R_\alpha,\qquad|R_\alpha|\lesssim C_1\frac{1}{\min\{p\nu_{\min}^2(H_X),q\nu_{\min}^2(H_M)\}}, T 1 = α 1 + R α , ∣ R α ∣ ≲ C 1 min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} 1 ,
H M T T 2 = γ 1 + R γ , ∥ R γ ∥ ≲ C 2 , X 1 p ν min 2 ( H X ) + C 2 , M 1 q ν min 2 ( H M ) , H_M^{\mathsf T}T_2=\gamma_1+R_\gamma,\qquad\|R_\gamma\|\lesssim C_{2,X}\frac{1}{p\nu_{\min}^2(H_X)}+C_{2,M}\frac{1}{q\nu_{\min}^2(H_M)}, H M T T 2 = γ 1 + R γ , ∥ R γ ∥ ≲ C 2 , X p ν m i n 2 ( H X ) 1 + C 2 , M q ν m i n 2 ( H M ) 1 ,
T 3 = δ 0 T H M T + R δ , T_3=\delta_0^{\mathsf T}H_M^{\mathsf T}+R_\delta, T 3 = δ 0 T H M T + R δ ,
and that R δ R_\delta R δ factors as R δ = R ~ δ H M T R_\delta=\widetilde R_\delta H_M^{\mathsf T} R δ = R δ H M T for a matrix R ~ δ \widetilde R_\delta R δ satisfying ∥ R ~ δ ∥ ≲ C 3 / ( p ν min 2 ( H X ) ) \|\widetilde R_\delta\|\lesssim C_3/(p\nu_{\min}^2(H_X)) ∥ R δ ∥ ≲ C 3 / ( p ν m i n 2 ( H X )) . These are proved in Steps 1, 2, and 3 respectively. The constants are
C 1 : = κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ λ ˉ λ min ( Σ f ∣ 1 ) , C 2 , X : = C H M κ ( Σ f X ∣ 1 ) ∥ Σ f M f X T ∣ 1 ∥ ∥ β 1 ∥ λ ˉ V X λ ˉ u X λ min ( Σ u X M , 1 ) λ min ( Σ f X ∣ 1 ) , C_1:=\sqrt{\kappa(\Sigma_{f\mid1})}\frac{\|\mu_{f\mid1}\|\|\Delta'\|\bar\lambda}{\lambda_{\min}(\Sigma_{f\mid1})},\qquad
C_{2,X}:=C_{H_M}\sqrt{\kappa(\Sigma_{fX\mid1})}\frac{\|\Sigma_{f_Mf_X}^{\mathsf T}\mid_1\|\|\beta_1\|\bar\lambda_{V_X}\bar\lambda_{u_X}}{\lambda_{\min}(\Sigma_{u_XM,1})\lambda_{\min}(\Sigma_{fX\mid1})}, C 1 := κ ( Σ f ∣ 1 ) λ m i n ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥∥ Δ ′ ∥ λ ˉ , C 2 , X := C H M κ ( Σ f X ∣ 1 ) λ m i n ( Σ u X M , 1 ) λ m i n ( Σ f X ∣ 1 ) ∥ Σ f M f X T ∣ 1 ∥∥ β 1 ∥ λ ˉ V X λ ˉ u X ,
C 2 , M : = κ ( D ) ∥ γ 1 ∥ λ ˉ V M λ ˉ u M λ min ( Σ u X M , 1 ) , C 3 : = κ ( Σ f X ∣ 0 ) ∥ μ f X ∣ 0 ∥ ∥ Φ ∥ λ ˉ u X λ min ( Σ f X ∣ 0 ) . C_{2,M}:=\sqrt{\kappa(D)}\frac{\|\gamma_1\|\bar\lambda_{V_M}\bar\lambda_{u_M}}{\lambda_{\min}(\Sigma_{u_XM,1})},\qquad
C_3:=\sqrt{\kappa(\Sigma_{fX\mid0})}\frac{\|\mu_{fX\mid0}\|\|\Phi\|\bar\lambda_{u_X}}{\lambda_{\min}(\Sigma_{fX\mid0})}. C 2 , M := κ ( D ) λ m i n ( Σ u X M , 1 ) ∥ γ 1 ∥ λ ˉ V M λ ˉ u M , C 3 := κ ( Σ f X ∣ 0 ) λ m i n ( Σ f X ∣ 0 ) ∥ μ f X ∣ 0 ∥∥Φ∥ λ ˉ u X .
Here, we have λ ˉ u X : = λ max ( Σ u X ) \bar\lambda_{u_X}:=\lambda_{\max}(\Sigma_{u_X}) λ ˉ u X := λ m a x ( Σ u X ) , λ ˉ u M : = λ max ( Σ u M ) \bar\lambda_{u_M}:=\lambda_{\max}(\Sigma_{u_M}) λ ˉ u M := λ m a x ( Σ u M ) , λ ˉ V X : = λ max ( V X T V X ) \bar\lambda_{V_X}:=\lambda_{\max}(V_X^{\mathsf T}V_X) λ ˉ V X := λ m a x ( V X T V X ) , λ ˉ V M : = λ max ( V M T V M ) \bar\lambda_{V_M}:=\lambda_{\max}(V_M^{\mathsf T}V_M) λ ˉ V M := λ m a x ( V M T V M ) , and λ ˉ : = max { λ ˉ V X λ ˉ u X , λ ˉ V M λ ˉ u M } \bar\lambda:=\max\{\bar\lambda_{V_X}\bar\lambda_{u_X},\bar\lambda_{V_M}\bar\lambda_{u_M}\} λ ˉ := max { λ ˉ V X λ ˉ u X , λ ˉ V M λ ˉ u M } . The factor C H M C_{H_M} C H M is the O ( 1 ) O(1) O ( 1 ) bound on ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ \|H_M^{\mathsf T}(H_MD H_M^{\mathsf T}+\Sigma_{e_M})^{-1}H_M\| ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ established in Step 2, the matrix D D D is defined in Equation (B.2) of Step 2, and Φ \Phi Φ is defined in Equation (B.9) of Step 3. Each constant is a fixed population quantity bounded using Assumptions 3.1–3.2 and Definition 3.1, and does not depend on p p p or q q q . Since H M T T 2 = γ 1 + R γ H_M^{\mathsf T}T_2=\gamma_1+R_\gamma H M T T 2 = γ 1 + R γ , the error term expands as
θ 0 , p , q − θ 0 = T 1 + T 3 T 2 − ( α 1 + γ 1 T δ 0 ) = α 1 + R α + ( δ 0 T H M T + R δ ) T 2 − ( α 1 + δ 0 T γ 1 ) = α 1 + R α + δ 0 T ( γ 1 + R γ ) + R δ T 2 − ( α 1 + δ 0 T γ 1 ) = R α + δ 0 T R γ + R δ T 2 . \begin{aligned}
\theta_{0,p,q}-\theta_0=T_1+T_3T_2-(\alpha_1+\gamma_1^{\mathsf T}\delta_0) \\
&=\alpha_1+R_\alpha+(\delta_0^{\mathsf T}H_M^{\mathsf T}+R_\delta)T_2-(\alpha_1+\delta_0^{\mathsf T}\gamma_1) \\
&=\alpha_1+R_\alpha+\delta_0^{\mathsf T}(\gamma_1+R_\gamma)+R_\delta T_2-(\alpha_1+\delta_0^{\mathsf T}\gamma_1) \\
&=R_\alpha+\delta_0^{\mathsf T}R_\gamma+R_\delta T_2.
\end{aligned} θ 0 , p , q − θ 0 = T 1 + T 3 T 2 − ( α 1 + γ 1 T δ 0 ) = α 1 + R α + ( δ 0 T H M T + R δ ) T 2 − ( α 1 + δ 0 T γ 1 ) = α 1 + R α + δ 0 T ( γ 1 + R γ ) + R δ T 2 − ( α 1 + δ 0 T γ 1 ) = R α + δ 0 T R γ + R δ T 2 .
The matrix H M T H_M^{\mathsf T} H M T acts on T 2 ∈ R q ˉ T_2\in\mathbb{R}^{\bar q} T 2 ∈ R q ˉ , and since H M H_M H M has full column rank with q ˉ \bar q q ˉ , the kernel of H M T H_M^{\mathsf T} H M T is nontrivial. The relation H M T T 2 = γ 1 + R γ H_M^{\mathsf T}T_2=\gamma_1+R_\gamma H M T T 2 = γ 1 + R γ determines only the component of T 2 T_2 T 2 lying in range ( H M ) \operatorname{range}(H_M) range ( H M ) , and leaves the component of T 2 T_2 T 2 in ker ( H M T ) \operatorname{ker}(H_M^{\mathsf T}) ker ( H M T ) unconstrained. Thus, the final term R δ T 2 R_\delta T_2 R δ T 2 must be controlled without separately bounding ∥ T 2 ∥ \|T_2\| ∥ T 2 ∥ . This can be shown using the factorization R δ = R ~ δ H M T R_\delta=\widetilde R_\delta H_M^{\mathsf T} R δ = R δ H M T established in Step 3. Substituting this factorization gives
R δ T 2 = R ~ δ H M T T 2 = R ~ δ ( γ 1 + R γ ) . R_\delta T_2=\widetilde R_\delta H_M^{\mathsf T}T_2=\widetilde R_\delta(\gamma_1+R_\gamma). R δ T 2 = R δ H M T T 2 = R δ ( γ 1 + R γ ) .
and since ∥ γ 1 ∥ ≤ C \|\gamma_1\|\le C ∥ γ 1 ∥ ≤ C by Assumption 3.2(i), we get that
∣ R δ T 2 ∣ ≤ ∥ R ~ δ ∥ ( ∥ γ 1 ∥ + ∥ R γ ∥ ) ≲ 1 p ν min 2 ( H X ) + 1 p ν min 2 ( H X ) ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) . |R_\delta T_2|\le\|\widetilde R_\delta\|(\|\gamma_1\|+\|R_\gamma\|)\lesssim\frac{1}{p\nu_{\min}^2(H_X)}+\frac{1}{p\nu_{\min}^2(H_X)}\left(\frac{1}{p\nu_{\min}^2(H_X)}+\frac{1}{q\nu_{\min}^2(H_M)}\right). ∣ R δ T 2 ∣ ≤ ∥ R δ ∥ ( ∥ γ 1 ∥ + ∥ R γ ∥ ) ≲ p ν m i n 2 ( H X ) 1 + p ν m i n 2 ( H X ) 1 ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) .
Therefore,
∣ θ 0 − θ 0 , p , q ∣ ≲ ∣ R α ∣ + ∥ δ 0 ∥ ∥ R γ ∥ + ∣ R δ T 2 ∣ |\theta_0-\theta_{0,p,q}|\lesssim|R_\alpha|+\|\delta_0\|\|R_\gamma\|+|R_\delta T_2| ∣ θ 0 − θ 0 , p , q ∣ ≲ ∣ R α ∣ + ∥ δ 0 ∥∥ R γ ∥ + ∣ R δ T 2 ∣
≲ C 1 1 min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } + C 2 ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) \lesssim C_1\frac{1}{\min\{p\nu_{\min}^2(H_X),q\nu_{\min}^2(H_M)\}}+C_2\left(\frac{1}{p\nu_{\min}^2(H_X)}+\frac{1}{q\nu_{\min}^2(H_M)}\right) ≲ C 1 min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} 1 + C 2 ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 )
+ C 3 ( 1 p ν min 2 ( H X ) + 1 p ν min 2 ( H X ) ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) ) ≤ C ∗ ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) ( 1 + 1 p ν min 2 ( H X ) ) . \begin{aligned}
\qquad+C_3\left(\frac{1}{p\nu_{\min}^2(H_X)}+\frac{1}{p\nu_{\min}^2(H_X)}\left(\frac{1}{p\nu_{\min}^2(H_X)}+\frac{1}{q\nu_{\min}^2(H_M)}\right)\right) \\
&\le C_*\left(\frac{1}{p\nu_{\min}^2(H_X)}+\frac{1}{q\nu_{\min}^2(H_M)}\right)\left(1+\frac{1}{p\nu_{\min}^2(H_X)}\right).
\end{aligned} + C 3 ( p ν m i n 2 ( H X ) 1 + p ν m i n 2 ( H X ) 1 ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) ) ≤ C ∗ ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) ( 1 + p ν m i n 2 ( H X ) 1 ) .
The stated rate in Theorem 3.1 follows.
Step 1: T 1 T_1 T 1 .
Recall the outcome regression (1) under the treatment group. The intercept α 1 \alpha_1 α 1 admits the representation
e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] = α 1 + ( − K 1 + K 2 ) . e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]=\alpha_1+(-K_1+K_2). e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] = α 1 + ( − K 1 + K 2 ) .
We derive this representation as follows
e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L L ⊤ ∣ A = 1 ] δ + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y − L L ⊤ δ ∣ A = 1 ] = α 1 + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y − L L ⊤ δ ∣ A = 1 ] = α 1 + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ( Z − L ) ⊤ δ ∣ A = 1 ] + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] = α 1 − e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L e 0 ⊤ δ ∣ A = 1 ] + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] . (16) \begin{aligned}
e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]
&=e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[LL^{\top}\mid A=1]\delta\\
&\quad+e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[LY-LL^{\top}\delta\mid A=1]\\
&=\alpha_1+e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[LY-LL^{\top}\delta\mid A=1]\\
&=\alpha_1+e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[L(Z-L)^{\top}\delta\mid A=1]\\
&\quad+e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[L\epsilon_1\mid A=1]\\
&=\alpha_1-e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[Le_0^{\top}\delta\mid A=1]\\
&\quad+e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[L\epsilon_1\mid A=1]. \tag*{(16)}
\end{aligned} e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L L ⊤ ∣ A = 1 ] δ + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y − L L ⊤ δ ∣ A = 1 ] = α 1 + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y − L L ⊤ δ ∣ A = 1 ] = α 1 + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ( Z − L ) ⊤ δ ∣ A = 1 ] + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] = α 1 − e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L e 0 ⊤ δ ∣ A = 1 ] + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] . (16)
Here, (1) uses that δ \delta δ is a fixed vector, so E [ L L ⊤ δ ∣ A = 1 ] = E [ L L ⊤ ∣ A = 1 ] δ \mathbb{E}[LL^{\top}\delta\mid A=1]=\mathbb{E}[LL^{\top}\mid A=1]\delta E [ L L ⊤ δ ∣ A = 1 ] = E [ L L ⊤ ∣ A = 1 ] δ . Equality (2) uses the outcome model Y = Z ⊤ δ + ϵ 1 Y=Z^{\top}\delta+\epsilon_1 Y = Z ⊤ δ + ϵ 1 from (1) under A = 1 A=1 A = 1 . The remaining steps use Z − L = − e 0 Z-L=-e_0 Z − L = − e 0 from (A.4). We show that K 1 K_1 K 1 and K 2 K_2 K 2 are each asymptotically negligible.
Negligibility of K 1 K_1 K 1 . From L = H 1 f 1 + e 0 L=H_1f_1+e_0 L = H 1 f 1 + e 0 , we have
K 1 = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L e 0 ⊤ δ ∣ A = 1 ] = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ H 1 f 1 e 0 ⊤ ∣ A = 1 ] δ + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 Σ e 0 δ = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 Σ e 0 δ . \begin{aligned}
K_1&=e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[Le_0^{\top}\delta\mid A=1]\\
&=e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[H_1f_1e_0^{\top}\mid A=1]\delta
+e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\Sigma_{e_0}\delta\\
&=e_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\Sigma_{e_0}\delta.
\end{aligned} K 1 = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ L e 0 ⊤ δ ∣ A = 1 ] = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 E [ H 1 f 1 e 0 ⊤ ∣ A = 1 ] δ + e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 Σ e 0 δ = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 Σ e 0 δ .
where the first term vanishes by E [ f 1 e 0 ⊤ ∣ A = 1 ] = 0 \mathbb{E}[f_1e_0^{\top}\mid A=1]=0 E [ f 1 e 0 ⊤ ∣ A = 1 ] = 0 from Section A.2. With Λ f 1 ∣ 1 : = E [ f 1 f 1 ⊤ ∣ A = 1 ] \Lambda_{f_1\mid1}:=\mathbb{E}[f_1f_1^{\top}\mid A=1] Λ f 1 ∣ 1 := E [ f 1 f 1 ⊤ ∣ A = 1 ] for the uncentered second moment and Δ ′ = ( β 1 ⊤ , γ 1 ⊤ ) ⊤ \Delta'=(\beta_1^{\top},\gamma_1^{\top})^{\top} Δ ′ = ( β 1 ⊤ , γ 1 ⊤ ) ⊤ , we get
∥ K 1 ∥ = ∥ e 1 ⊤ ( H 1 Λ f 1 ∣ 1 H 1 ⊤ + Σ e 0 ) − 1 Σ e 0 H 1 ( H 1 ⊤ H 1 ) − 1 Δ ′ ∥ . \lVert K_1\rVert=\left\lVert e_1^{\top}(H_1\Lambda_{f_1\mid1}H_1^{\top}+\Sigma_{e_0})^{-1}\Sigma_{e_0}H_1(H_1^{\top}H_1)^{-1}\Delta'\right\rVert. ∥ K 1 ∥ = e 1 ⊤ ( H 1 Λ f 1 ∣ 1 H 1 ⊤ + Σ e 0 ) − 1 Σ e 0 H 1 ( H 1 ⊤ H 1 ) − 1 Δ ′ .
Using Lemma D.1, whose formula is stated in the mean μ f ∣ 1 \mu_{f\mid1} μ f ∣ 1 and covariance Σ f ∣ 1 \Sigma_{f\mid1} Σ f ∣ 1 , and noting that Σ e 0 = diag ( 0 , Σ e ) \Sigma_{e_0}=\operatorname{diag}(0,\Sigma_e) Σ e 0 = diag ( 0 , Σ e ) so that the intercept component of Δ \Delta Δ drops out and that only Δ ′ \Delta' Δ ′ survives, we get
∥ K 1 ∥ = ∥ − μ f ∣ 1 ⊤ H ⊤ ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 Σ e H ( H ⊤ H ) − 1 Δ ′ ∥ = ( 1 ) ∥ − μ f ∣ 1 ⊤ H ⊤ ( Σ e − 1 − Σ e − 1 H ( Σ f ∣ 1 − 1 + H ⊤ Σ e − 1 H ) − 1 H ⊤ Σ e − 1 ) Σ e H ( H ⊤ H ) − 1 Δ ′ ∥ = ∥ μ f ∣ 1 ⊤ Δ ′ − μ f ∣ 1 ⊤ H ⊤ Σ e − 1 H ( Σ f ∣ 1 − 1 + H ⊤ Σ e − 1 H ) − 1 Δ ′ ∥ = ∥ μ f ∣ 1 ⊤ Σ f ∣ 1 − 1 ( Σ f ∣ 1 − 1 + H ⊤ Σ e − 1 H ) − 1 Δ ′ ∥ = ∥ μ f ∣ 1 ⊤ ( I p ˉ + q ˉ + H ⊤ Σ e − 1 H Σ f ∣ 1 ) − 1 Δ ′ ∥ . \begin{aligned}
\lVert K_1\rVert
&=\left\lVert-\mu_{f\mid1}^{\top}H^{\top}(H\Sigma_{f\mid1}H^{\top}+\Sigma_e)^{-1}\Sigma_eH(H^{\top}H)^{-1}\Delta'\right\rVert\\
&\mathrel{\overset{(1)}{=}}\left\lVert-\mu_{f\mid1}^{\top}H^{\top}\left(\Sigma_e^{-1}-\Sigma_e^{-1}H(\Sigma_{f\mid1}^{-1}+H^{\top}\Sigma_e^{-1}H)^{-1}H^{\top}\Sigma_e^{-1}\right)\Sigma_eH(H^{\top}H)^{-1}\Delta'\right\rVert\\
&=\left\lVert\mu_{f\mid1}^{\top}\Delta'-\mu_{f\mid1}^{\top}H^{\top}\Sigma_e^{-1}H(\Sigma_{f\mid1}^{-1}+H^{\top}\Sigma_e^{-1}H)^{-1}\Delta'\right\rVert\\
&=\left\lVert\mu_{f\mid1}^{\top}\Sigma_{f\mid1}^{-1}(\Sigma_{f\mid1}^{-1}+H^{\top}\Sigma_e^{-1}H)^{-1}\Delta'\right\rVert\\
&=\left\lVert\mu_{f\mid1}^{\top}(I_{\bar p+\bar q}+H^{\top}\Sigma_e^{-1}H\Sigma_{f\mid1})^{-1}\Delta'\right\rVert.
\end{aligned} ∥ K 1 ∥ = − μ f ∣ 1 ⊤ H ⊤ ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 Σ e H ( H ⊤ H ) − 1 Δ ′ = ( 1 ) − μ f ∣ 1 ⊤ H ⊤ ( Σ e − 1 − Σ e − 1 H ( Σ f ∣ 1 − 1 + H ⊤ Σ e − 1 H ) − 1 H ⊤ Σ e − 1 ) Σ e H ( H ⊤ H ) − 1 Δ ′ = μ f ∣ 1 ⊤ Δ ′ − μ f ∣ 1 ⊤ H ⊤ Σ e − 1 H ( Σ f ∣ 1 − 1 + H ⊤ Σ e − 1 H ) − 1 Δ ′ = μ f ∣ 1 ⊤ Σ f ∣ 1 − 1 ( Σ f ∣ 1 − 1 + H ⊤ Σ e − 1 H ) − 1 Δ ′ = μ f ∣ 1 ⊤ ( I p ˉ + q ˉ + H ⊤ Σ e − 1 H Σ f ∣ 1 ) − 1 Δ ′ .
where (1) uses the Woodbury identity of Lemma D.2. The matrix A : = H ⊤ Σ e − 1 H A:=H^{\top}\Sigma_e^{-1}H A := H ⊤ Σ e − 1 H is symmetric positive semidefinite, but A Σ f ∣ 1 A\Sigma_{f\mid1} A Σ f ∣ 1 inside ( I + A Σ f ∣ 1 ) − 1 (I+A\Sigma_{f\mid1})^{-1} ( I + A Σ f ∣ 1 ) − 1 is not symmetric. So, we set S : = Σ f ∣ 1 1 / 2 A Σ f ∣ 1 1 / 2 S:=\Sigma_{f\mid1}^{1/2}A\Sigma_{f\mid1}^{1/2} S := Σ f ∣ 1 1/2 A Σ f ∣ 1 1/2 , which is symmetric positive semidefinite,
( I + A Σ f ∣ 1 ) − 1 = Σ f ∣ 1 − 1 / 2 ( I + S ) − 1 Σ f ∣ 1 1 / 2 , ∥ ( I + A Σ f ∣ 1 ) − 1 ∥ ≤ κ ( Σ f ∣ 1 ) 1 1 + λ min ( S ) , (I+A\Sigma_{f\mid1})^{-1}=\Sigma_{f\mid1}^{-1/2}(I+S)^{-1}\Sigma_{f\mid1}^{1/2},\qquad\lVert(I+A\Sigma_{f\mid1})^{-1}\rVert\le\sqrt{\kappa(\Sigma_{f\mid1})}\frac{1}{1+\lambda_{\min}(S)}, ( I + A Σ f ∣ 1 ) − 1 = Σ f ∣ 1 − 1/2 ( I + S ) − 1 Σ f ∣ 1 1/2 , ∥( I + A Σ f ∣ 1 ) − 1 ∥ ≤ κ ( Σ f ∣ 1 ) 1 + λ m i n ( S ) 1 ,
with λ min ( S ) ≥ λ min ( Σ f ∣ 1 ) λ min ( A ) \lambda_{\min}(S)\ge\lambda_{\min}(\Sigma_{f\mid1})\lambda_{\min}(A) λ m i n ( S ) ≥ λ m i n ( Σ f ∣ 1 ) λ m i n ( A ) and κ ( Σ f ∣ 1 ) = λ max ( Σ f ∣ 1 ) / λ min ( Σ f ∣ 1 ) = O ( 1 ) \kappa(\Sigma_{f\mid1})=\lambda_{\max}(\Sigma_{f\mid1})/\lambda_{\min}(\Sigma_{f\mid1})=O(1) κ ( Σ f ∣ 1 ) = λ m a x ( Σ f ∣ 1 ) / λ m i n ( Σ f ∣ 1 ) = O ( 1 ) by Assumption 3.1(iv). This gives us that
∥ K 1 ∥ ≤ κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ 1 + λ min ( Σ f ∣ 1 ) λ min ( H ⊤ Σ e − 1 H ) . \lVert K_1\rVert\le\frac{\sqrt{\kappa(\Sigma_{f\mid1})}\lVert\mu_{f\mid1}\rVert\lVert\Delta'\rVert}{1+\lambda_{\min}(\Sigma_{f\mid1})\lambda_{\min}(H^{\top}\Sigma_e^{-1}H)}. ∥ K 1 ∥ ≤ 1 + λ m i n ( Σ f ∣ 1 ) λ m i n ( H ⊤ Σ e − 1 H ) κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ .
It remains to bound λ min ( H ⊤ Σ e − 1 H ) \lambda_{\min}(H^{\top}\Sigma_e^{-1}H) λ m i n ( H ⊤ Σ e − 1 H ) from below. Since H = diag ( H X , H M ) H=\operatorname{diag}(H_X,H_M) H = diag ( H X , H M ) and Σ e = diag ( Σ e X , Σ e M ) \Sigma_e=\operatorname{diag}(\Sigma_{eX},\Sigma_{eM}) Σ e = diag ( Σ e X , Σ e M ) are block diagonal,
H ⊤ Σ e − 1 H = diag ( H X ⊤ ( 1 p V X ⊤ Σ u X V X ) − 1 H X , H M ⊤ ( 1 q V M ⊤ Σ u M V M ) − 1 H M ) . H^{\top}\Sigma_e^{-1}H=\operatorname{diag}\left(H_X^{\top}\left(\frac{1}{p}V_X^{\top}\Sigma_{uX}V_X\right)^{-1}H_X,\ H_M^{\top}\left(\frac{1}{q}V_M^{\top}\Sigma_{uM}V_M\right)^{-1}H_M\right). H ⊤ Σ e − 1 H = diag ( H X ⊤ ( p 1 V X ⊤ Σ u X V X ) − 1 H X , H M ⊤ ( q 1 V M ⊤ Σ u M V M ) − 1 H M ) .
so λ min ( H ⊤ Σ e − 1 H ) \lambda_{\min}(\mathbf{H}^{\top}\Sigma_e^{-1}\mathbf{H}) λ m i n ( H ⊤ Σ e − 1 H ) is the smaller of the two blocks minimum eigenvalues. For the first block,
λ min ( H X ⊤ ( 1 p V X ⊤ Σ u X V X ) − 1 H X ) ≥ λ min ( H X ⊤ H X ) λ min ( 1 p V X ⊤ Σ u X V X ) − 1 ≥ p λ min ( H X ⊤ H X ) λ max ( V X ⊤ V X ) λ max ( Σ u X ) = p ν min 2 ( H X ) λ max ( V X ⊤ V X ) λ max ( Σ u X ) , \begin{aligned}
\lambda_{\min}\left(\mathbf{H}_{X}^{\top}\left(\frac{1}{p}\mathbf{V}_{X}^{\top}\Sigma_{u_X}\mathbf{V}_{X}\right)^{-1}\mathbf{H}_{X}\right) \ge\lambda_{\min}(\mathbf{H}_{X}^{\top}\mathbf{H}_{X})\lambda_{\min}\left(\frac{1}{p}\mathbf{V}_{X}^{\top}\Sigma_{u_X}\mathbf{V}_{X}\right)^{-1} \\
&\ge\frac{p\lambda_{\min}(\mathbf{H}_{X}^{\top}\mathbf{H}_{X})}{\lambda_{\max}(\mathbf{V}_{X}^{\top}\mathbf{V}_{X})\lambda_{\max}(\Sigma_{u_X})} \\
&= \frac{p\nu_{\min}^{2}(\mathbf{H}_{X})}{\lambda_{\max}(\mathbf{V}_{X}^{\top}\mathbf{V}_{X})\lambda_{\max}(\Sigma_{u_X})},
\end{aligned} λ m i n ( H X ⊤ ( p 1 V X ⊤ Σ u X V X ) − 1 H X ) ≥ λ m i n ( H X ⊤ H X ) λ m i n ( p 1 V X ⊤ Σ u X V X ) − 1 ≥ λ m a x ( V X ⊤ V X ) λ m a x ( Σ u X ) p λ m i n ( H X ⊤ H X ) = λ m a x ( V X ⊤ V X ) λ m a x ( Σ u X ) p ν m i n 2 ( H X ) ,
using λ max ( V X ⊤ V X ) ≤ C \lambda_{\max}(\mathbf{V}_{X}^{\top}\mathbf{V}_{X}) \le C λ m a x ( V X ⊤ V X ) ≤ C from Definition 3.1, and the identical computation gives
λ min ( H M ⊤ ( 1 q V M ⊤ Σ u M V M ) − 1 H M ) ≥ q ν min 2 ( H M ) λ max ( V M ⊤ V M ) λ max ( Σ u M ) . \lambda_{\min}\left(\mathbf{H}_{M}^{\top}\left(\frac{1}{q}\mathbf{V}_{M}^{\top}\Sigma_{u_M}\mathbf{V}_{M}\right)^{-1}\mathbf{H}_{M}\right) \ge\frac{q\nu_{\min}^{2}(\mathbf{H}_{M})}{\lambda_{\max}(\mathbf{V}_{M}^{\top}\mathbf{V}_{M})\lambda_{\max}(\Sigma_{u_M})}. λ m i n ( H M ⊤ ( q 1 V M ⊤ Σ u M V M ) − 1 H M ) ≥ λ m a x ( V M ⊤ V M ) λ m a x ( Σ u M ) q ν m i n 2 ( H M ) .
Then
λ min ( H ⊤ Σ e − 1 H ) ≥ min { p ν min 2 ( H X ) λ ˉ u X λ ˉ V X , q ν min 2 ( H M ) λ ˉ u M λ ˉ V M } ≥ min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } max { λ ˉ u X λ ˉ V X , λ ˉ u M λ ˉ V M } . \lambda_{\min}(\mathbf{H}^{\top}\Sigma_e^{-1}\mathbf{H}) \ge\min\left\{\frac{p\nu_{\min}^{2}(\mathbf{H}_{X})}{\bar{\lambda}_{u_X}\bar{\lambda}_{V_X}},\frac{q\nu_{\min}^{2}(\mathbf{H}_{M})}{\bar{\lambda}_{u_M}\bar{\lambda}_{V_M}}\right\} \ge\frac{\min\{p\nu_{\min}^{2}(\mathbf{H}_{X}),q\nu_{\min}^{2}(\mathbf{H}_{M})\}}{\max\{\bar{\lambda}_{u_X}\bar{\lambda}_{V_X},\bar{\lambda}_{u_M}\bar{\lambda}_{V_M}\}}. λ m i n ( H ⊤ Σ e − 1 H ) ≥ min { λ ˉ u X λ ˉ V X p ν m i n 2 ( H X ) , λ ˉ u M λ ˉ V M q ν m i n 2 ( H M ) } ≥ max { λ ˉ u X λ ˉ V X , λ ˉ u M λ ˉ V M } min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} .
We write λ f : = λ min ( Σ f ∣ 1 ) \lambda_f := \lambda_{\min}(\Sigma_{f\mid1}) λ f := λ m i n ( Σ f ∣ 1 ) , and then substituting the lower bound gives
∥ K 1 ∥ ≤ κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ ⋅ 1 1 + λ f min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } / λ ˉ = κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ ⋅ λ ˉ λ ˉ + λ f min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } ≤ κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ λ f ⋅ 1 min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } = C 1 1 min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } , \begin{aligned}
\lVert K_1\rVert\le\sqrt{\kappa(\Sigma_{f\mid1})}\lVert\mu_{f\mid1}\rVert\lVert\Delta'\rVert\cdot\frac{1}{1+\lambda_f\min\{p\nu_{\min}^{2}(\mathbf{H}_{X}),q\nu_{\min}^{2}(\mathbf{H}_{M})\}/\bar{\lambda}} \\
&= \sqrt{\kappa(\Sigma_{f\mid1})}\lVert\mu_{f\mid1}\rVert\lVert\Delta'\rVert\cdot\frac{\bar{\lambda}}{\bar{\lambda}+\lambda_f\min\{p\nu_{\min}^{2}(\mathbf{H}_{X}),q\nu_{\min}^{2}(\mathbf{H}_{M})\}} \\
&\le\sqrt{\kappa(\Sigma_{f\mid1})}\frac{\lVert\mu_{f\mid1}\rVert\lVert\Delta'\rVert}{\lambda_f}\cdot\frac{1}{\min\{p\nu_{\min}^{2}(\mathbf{H}_{X}),q\nu_{\min}^{2}(\mathbf{H}_{M})\}} \\
&= C_1\frac{1}{\min\{p\nu_{\min}^{2}(\mathbf{H}_{X}),q\nu_{\min}^{2}(\mathbf{H}_{M})\}},
\end{aligned} ∥ K 1 ∥ ≤ κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ ⋅ 1 + λ f min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} / λ ˉ 1 = κ ( Σ f ∣ 1 ) ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ ⋅ λ ˉ + λ f min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} λ ˉ ≤ κ ( Σ f ∣ 1 ) λ f ∥ μ f ∣ 1 ∥ ∥ Δ ′ ∥ ⋅ min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} 1 = C 1 min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} 1 ,
where the third inequality drops the positive term λ ˉ \bar{\lambda} λ ˉ from the denominator.
Negligibility of K 2 K_2 K 2 . From L = Z + e 0 L=Z+e_0 L = Z + e 0 , E [ L ϵ 1 ∣ A = 1 ] = E [ Z ϵ 1 ∣ A = 1 ] + E [ e 0 ϵ 1 ∣ A = 1 ] \mathbb{E}[L\epsilon_1\mid A=1]=\mathbb{E}[Z\epsilon_1\mid A=1]+\mathbb{E}[e_0\epsilon_1\mid A=1] E [ L ϵ 1 ∣ A = 1 ] = E [ Z ϵ 1 ∣ A = 1 ] + E [ e 0 ϵ 1 ∣ A = 1 ] . The first term vanishes because E [ ϵ 1 ] = 0 \mathbb{E}[\epsilon_1]=0 E [ ϵ 1 ] = 0 by Assumption 3.1(ii), so
E [ Z ϵ 1 ∣ A = 1 ] = E [ Z E [ ϵ 1 ] ∣ A = 1 ] = 0. \mathbb{E}[Z\epsilon_1\mid A=1]=\mathbb{E}[Z\mathbb{E}[\epsilon_1]\mid A=1]=0. E [ Z ϵ 1 ∣ A = 1 ] = E [ Z E [ ϵ 1 ] ∣ A = 1 ] = 0.
The second term vanishes by Assumption 3.1(ii), since e 0 e_0 e 0 is a linear function of ( u X , u M ) (u_X,u_M) ( u X , u M ) , which are orthogonal to ϵ 1 \epsilon_1 ϵ 1 under A = 1 A=1 A = 1 . Hence K 2 = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 ⋅ 0 = 0 K_2=\mathbf{e}_1^{\top}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\cdot0=0 K 2 = e 1 ⊤ E [ L L ⊤ ∣ A = 1 ] − 1 ⋅ 0 = 0 exactly. Since R α = − K 1 + K 2 R_\alpha=-K_1+K_2 R α = − K 1 + K 2 , we have that
∣ R α ∣ ≤ ∣ K 1 ∣ + ∣ K 2 ∣ = O ( 1 min { p ν min 2 ( H X ) , q ν min 2 ( H M ) } ) . |R_\alpha|\le|K_1|+|K_2|=O\left(\frac{1}{\min\{p\nu_{\min}^{2}(\mathbf{H}_{X}),q\nu_{\min}^{2}(\mathbf{H}_{M})\}}\right). ∣ R α ∣ ≤ ∣ K 1 ∣ + ∣ K 2 ∣ = O ( min { p ν m i n 2 ( H X ) , q ν m i n 2 ( H M )} 1 ) .
Step 2: T 2 T_2 T 2 . Using the outcome model exactly as in Step 1, we get
H M ⊤ S ~ q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] = H M ⊤ S ~ q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L L ⊤ δ ∣ A = 1 ] + H M ⊤ S ~ q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ( Z − L ) ⊤ δ ∣ A = 1 ] + H M ⊤ S ~ q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] = γ 1 − H M ⊤ S ~ q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L e 0 ⊤ δ ∣ A = 1 ] ⏟ K 3 + H M ⊤ S ~ q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] ⏟ K 4 , \begin{aligned}
\mathbf{H}_{M}^{\top}\widetilde{\mathbf{S}}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[LY\mid A=1]
&=\mathbf{H}_{M}^{\top}\widetilde{\mathbf{S}}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[LL^{\top}\delta\mid A=1]\\
&\quad+\mathbf{H}_{M}^{\top}\widetilde{\mathbf{S}}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[L(Z-L)^{\top}\delta\mid A=1]\\
&\quad+\mathbf{H}_{M}^{\top}\widetilde{\mathbf{S}}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[L\epsilon_1\mid A=1]\\
&=\gamma_1-\underbrace{\mathbf{H}_{M}^{\top}\widetilde{\mathbf{S}}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[Le_0^{\top}\delta\mid A=1]}_{K_3}\\
&\quad+\underbrace{\mathbf{H}_{M}^{\top}\widetilde{\mathbf{S}}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[L\epsilon_1\mid A=1]}_{K_4},
\end{aligned} H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L Y ∣ A = 1 ] = H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L L ⊤ δ ∣ A = 1 ] + H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ( Z − L ) ⊤ δ ∣ A = 1 ] + H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] = γ 1 − K 3 H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L e 0 ⊤ δ ∣ A = 1 ] + K 4 H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] ,
so that H M ⊤ T 2 = γ 1 + ( − K 3 + K 4 ) ⏟ R γ \mathbf{H}_{M}^{\top}T_2=\gamma_1+\underbrace{(-K_3+K_4)}_{R_\gamma} H M ⊤ T 2 = γ 1 + R γ ( − K 3 + K 4 ) . It suffices to prove the negligibility of K 3 K_3 K 3 and K 4 K_4 K 4 .
Negligibility of K 3 K_3 K 3 . From L = H 1 f 1 + e 0 L=\mathbf{H}_1f_1+e_0 L = H 1 f 1 + e 0 and the cancellation E [ f 1 e 0 ⊤ ∣ A = 1 ] = 0 \mathbb{E}[f_1e_0^{\top}\mid A=1]=0 E [ f 1 e 0 ⊤ ∣ A = 1 ] = 0 of Section A.2,
K 3 = H M ⊤ S ~ q E [ L L ⊤ ∣ A = 1 ] − 1 Σ e 0 δ . K_3=\mathbf{H}_{M}^{\top}\widetilde{\mathbf{S}}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\Sigma_{e_0}\delta. K 3 = H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 Σ e 0 δ .
To bound the norm of K 3 K_3 K 3 , write the block inverse of E [ L L T ∣ A = 1 ] \mathbb{E}[LL^{\mathsf{T}} \mid A = 1] E [ L L T ∣ A = 1 ] , partitioned according to the intercept, X X X -block, and M M M -block. Since H M T S ~ q ˉ = P q ˉ H 1 T \mathsf{H}_M^{\mathsf{T}}\widetilde{S}_{\bar{q}} = P_{\bar{q}}\mathsf{H}_1^{\mathsf{T}} H M T S q ˉ = P q ˉ H 1 T , where S ~ q ˉ \widetilde{S}_{\bar{q}} S q ˉ selects the last q ~ \widetilde{q} q projected coordinates and P q ˉ P_{\bar{q}} P q ˉ selects the last q ˉ \bar{q} q ˉ true-factor coordinates, and using Σ e 0 = diag ( 0 , Σ e X , Σ e M ) \Sigma_{e0} = \operatorname{diag}(0,\Sigma_{eX},\Sigma_{eM}) Σ e 0 = diag ( 0 , Σ e X , Σ e M ) together with δ = ( α 1 , ( H X T ) T β 1 , ( H M T ) T γ 1 ) \delta= (\alpha_1,(\mathsf{H}_X^{\mathsf{T}})^{\mathsf{T}}\beta_1,(\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}\gamma_1) δ = ( α 1 , ( H X T ) T β 1 , ( H M T ) T γ 1 ) , we get that
∥ K 3 ∥ = ∥ P q ˉ H 1 T E [ L L T ∣ A = 1 ] − 1 Σ e 0 δ ∥ = ∥ P q ˉ [ 1 0 0 0 H X T 0 0 0 H M T ] [ B 11 B 12 B 13 B 21 B 22 B 23 B 31 B 32 B 33 ] [ 0 0 0 0 Σ e X 0 0 0 Σ e M ] [ α 1 ( H X T ) T β 1 ( H M T ) T γ 1 ] ∥ = ∥ H M T B 32 Σ e X ( H X T ) T β 1 + H M T B 33 Σ e M ( H M T ) T γ 1 ∥ ≤ ∥ H M T B 32 Σ e X ( H X T ) T β 1 ∥ ⏟ M 1 + ∥ H M T B 33 Σ e M ( H M T ) T γ 1 ∥ ⏟ M 2 . \begin{aligned}
\lVert K_3\rVert
&= \left\lVert P_{\bar{q}}\mathsf{H}_1^{\mathsf{T}}\mathbb{E}[LL^{\mathsf{T}}\mid A=1]^{-1}\Sigma_{e0}\delta\right\rVert\\
&= \left\lVert P_{\bar{q}}
\begin{bmatrix}
1 & 0 & 0\\
0 & \mathsf{H}_X^{\mathsf{T}} & 0\\
0 & 0 & \mathsf{H}_M^{\mathsf{T}}
\end{bmatrix}
\begin{bmatrix}
B_{11} & B_{12} & B_{13}\\
B_{21} & B_{22} & B_{23}\\
B_{31} & B_{32} & B_{33}
\end{bmatrix}
\begin{bmatrix}
0 & 0 & 0\\
0 & \Sigma_{eX} & 0\\
0 & 0 & \Sigma_{eM}
\end{bmatrix}
\begin{bmatrix}
\alpha_1\\
(\mathsf{H}_X^{\mathsf{T}})^{\mathsf{T}}\beta_1\\
(\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}\gamma_1
\end{bmatrix}
\right\rVert\\
&= \left\lVert\mathsf{H}_M^{\mathsf{T}}B_{32}\Sigma_{eX}(\mathsf{H}_X^{\mathsf{T}})^{\mathsf{T}}\beta_1+\mathsf{H}_M^{\mathsf{T}}B_{33}\Sigma_{eM}(\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}\gamma_1\right\rVert\\
&\le\underbrace{\left\lVert\mathsf{H}_M^{\mathsf{T}}B_{32}\Sigma_{eX}(\mathsf{H}_X^{\mathsf{T}})^{\mathsf{T}}\beta_1\right\rVert}_{M_1}
+\underbrace{\left\lVert\mathsf{H}_M^{\mathsf{T}}B_{33}\Sigma_{eM}(\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}\gamma_1\right\rVert}_{M_2}.
\end{aligned} ∥ K 3 ∥ = P q ˉ H 1 T E [ L L T ∣ A = 1 ] − 1 Σ e 0 δ = P q ˉ 1 0 0 0 H X T 0 0 0 H M T B 11 B 21 B 31 B 12 B 22 B 32 B 13 B 23 B 33 0 0 0 0 Σ e X 0 0 0 Σ e M α 1 ( H X T ) T β 1 ( H M T ) T γ 1 = H M T B 32 Σ e X ( H X T ) T β 1 + H M T B 33 Σ e M ( H M T ) T γ 1 ≤ M 1 H M T B 32 Σ e X ( H X T ) T β 1 + M 2 H M T B 33 Σ e M ( H M T ) T γ 1 .
The forms of B 32 B_{32} B 32 and B 33 B_{33} B 33 follow from Lemma D.1 and a further application of Block Inverse formula to the ( X , M ) (X,M) ( X , M ) partition of H Σ f ∣ 1 H T + Σ e \mathsf{H}\Sigma_{f\mid1}\mathsf{H}^{\mathsf{T}}+\Sigma_e H Σ f ∣ 1 H T + Σ e . The Block Inverse formula gives
B 32 = − B 33 H M Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 , B_{32}=-B_{33}\mathsf{H}_M\Sigma_{f_Mf_X^{\mathsf{T}}\mid1}\mathsf{H}_X^{\mathsf{T}}\left(\mathsf{H}_X\Sigma_{f_X\mid1}\mathsf{H}_X^{\mathsf{T}}+\Sigma_{eX}\right)^{-1}, B 32 = − B 33 H M Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 ,
B 33 = ( H M Σ f M ∣ 1 H M T + Σ e M − H M Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X f M T ∣ 1 H M T ) − 1 . B_{33}=\left(\mathsf{H}_M\Sigma_{f_M\mid1}\mathsf{H}_M^{\mathsf{T}}+\Sigma_{eM}-\mathsf{H}_M\Sigma_{f_Mf_X^{\mathsf{T}}\mid1}\mathsf{H}_X^{\mathsf{T}}\left(\mathsf{H}_X\Sigma_{f_X\mid1}\mathsf{H}_X^{\mathsf{T}}+\Sigma_{eX}\right)^{-1}\mathsf{H}_X\Sigma_{f_Xf_M^{\mathsf{T}}\mid1}\mathsf{H}_M^{\mathsf{T}}\right)^{-1}. B 33 = ( H M Σ f M ∣ 1 H M T + Σ e M − H M Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X f M T ∣ 1 H M T ) − 1 .
Since M 1 M_1 M 1 and M 2 M_2 M 2 are norms, the leading minus sign in B 32 B_{32} B 32 does not affect the bounds.
Bound on M 2 M_2 M 2 . We have
∥ M 2 ∥ = ∥ H M T B 33 Σ e M ( H M T ) T γ 1 ∥ = ∥ H M T ( H M ( Σ f M ∣ 1 − Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X f M T ∣ 1 ) H M T + Σ e M ) − 1 Σ e M ( H M T ) T γ 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 Σ e M ( H M T ) T γ 1 ∥ ≤ ( 1 ) ∥ H M T ( Σ e M − 1 − Σ e M − 1 H M ( D − 1 + H M T Σ e M − 1 H M ) − 1 H M T Σ e M − 1 ) Σ e M H M ( H M T H M ) − 1 γ 1 ∥ = ∥ ( I q ˉ + H M T Σ e M − 1 H M D ) − 1 γ 1 ∥ . (17) \begin{aligned}
\lVert M_2\rVert
&=\left\lVert\mathsf{H}_M^{\mathsf{T}}B_{33}\Sigma_{eM}(\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}\gamma_1\right\rVert\\
&=\left\lVert\mathsf{H}_M^{\mathsf{T}}\left(\mathsf{H}_M\left(\Sigma_{f_M\mid1}-\Sigma_{f_Mf_X^{\mathsf{T}}\mid1}\mathsf{H}_X^{\mathsf{T}}\left(\mathsf{H}_X\Sigma_{f_X\mid1}\mathsf{H}_X^{\mathsf{T}}+\Sigma_{eX}\right)^{-1}\mathsf{H}_X\Sigma_{f_Xf_M^{\mathsf{T}}\mid1}\right)\mathsf{H}_M^{\mathsf{T}}+\Sigma_{eM}\right)^{-1}\Sigma_{eM}(\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}\gamma_1\right\rVert\\
&=\left\lVert\mathsf{H}_M^{\mathsf{T}}\left(\mathsf{H}_MD\mathsf{H}_M^{\mathsf{T}}+\Sigma_{eM}\right)^{-1}\Sigma_{eM}(\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}\gamma_1\right\rVert\\
&\mathrel{\mathop{\le}^{(1)}}\left\lVert\mathsf{H}_M^{\mathsf{T}}\left(\Sigma_{eM}^{-1}-\Sigma_{eM}^{-1}\mathsf{H}_M\left(D^{-1}+\mathsf{H}_M^{\mathsf{T}}\Sigma_{eM}^{-1}\mathsf{H}_M\right)^{-1}\mathsf{H}_M^{\mathsf{T}}\Sigma_{eM}^{-1}\right)\Sigma_{eM}\mathsf{H}_M\left(\mathsf{H}_M^{\mathsf{T}}\mathsf{H}_M\right)^{-1}\gamma_1\right\rVert\\
&=\left\lVert\left(I_{\bar{q}}+\mathsf{H}_M^{\mathsf{T}}\Sigma_{eM}^{-1}\mathsf{H}_MD\right)^{-1}\gamma_1\right\rVert. \tag*{(17)}
\end{aligned} ∥ M 2 ∥ = H M T B 33 Σ e M ( H M T ) T γ 1 = H M T ( H M ( Σ f M ∣ 1 − Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X f M T ∣ 1 ) H M T + Σ e M ) − 1 Σ e M ( H M T ) T γ 1 = H M T ( H M D H M T + Σ e M ) − 1 Σ e M ( H M T ) T γ 1 ≤ ( 1 ) H M T ( Σ e M − 1 − Σ e M − 1 H M ( D − 1 + H M T Σ e M − 1 H M ) − 1 H M T Σ e M − 1 ) Σ e M H M ( H M T H M ) − 1 γ 1 = ( I q ˉ + H M T Σ e M − 1 H M D ) − 1 γ 1 . (17)
where step (1) applies the Woodbury identity of Lemma D.2 to the term ( H M D H M T + Σ e M ) − 1 (\mathsf{H}_MD\mathsf{H}_M^{\mathsf{T}}+\Sigma_{eM})^{-1} ( H M D H M T + Σ e M ) − 1 , and the remaining equalities collect terms as in the bound for ∥ K 1 ∥ \lVert K_1\rVert ∥ K 1 ∥ in Step 1, using ( H M T ) T = H M ( H M T H M ) − 1 (\mathsf{H}_M^{\mathsf{T}})^{\mathsf{T}}=\mathsf{H}_M(\mathsf{H}_M^{\mathsf{T}}\mathsf{H}_M)^{-1} ( H M T ) T = H M ( H M T H M ) − 1 , and then applying the symmetric-similarity reduction used for K 1 K_1 K 1 with A M : = H M T Σ e M − 1 H M A_M:=\mathsf{H}_M^{\mathsf{T}}\Sigma_{eM}^{-1}\mathsf{H}_M A M := H M T Σ e M − 1 H M , we get
∥ M 2 ∥ ≤ κ ( D ) ∥ γ 1 ∥ 1 + λ min ( D ) λ min ( A M ) . \lVert M_2\rVert\le\sqrt{\kappa(D)}\frac{\lVert\gamma_1\rVert}{1+\lambda_{\min}(D)\lambda_{\min}(A_M)}. ∥ M 2 ∥ ≤ κ ( D ) 1 + λ m i n ( D ) λ m i n ( A M ) ∥ γ 1 ∥ .
The two-sided bound on D D D established below gives λ min ( D ) ≥ λ min ( Σ u X M , 1 ) \lambda_{\min}(D)\ge\lambda_{\min}(\Sigma_{u_{XM,1}}) λ m i n ( D ) ≥ λ m i n ( Σ u X M , 1 ) and κ ( D ) = O ( 1 ) \kappa(D)=O(1) κ ( D ) = O ( 1 ) . For λ min ( A M ) \lambda_{\min}(A_M) λ m i n ( A M ) , the identical computation as in Step 3 gives
λ min ( A M ) ≥ q ν min 2 ( H M ) λ ˉ V M λ ˉ u M . (18) \lambda_{\min}(A_M)\ge\frac{q\nu_{\min}^2(\mathsf{H}_M)}{\bar{\lambda}_{V_M}\bar{\lambda}_{u_M}}. \tag*{(18)} λ m i n ( A M ) ≥ λ ˉ V M λ ˉ u M q ν m i n 2 ( H M ) . (18)
Now, combining these,
λ min ( D ) λ min ( A M ) ≥ λ min ( Σ u X M , 1 ) ⋅ q ν min 2 ( H M ) λ ˉ V M λ ˉ u M , \lambda_{\min}(D)\lambda_{\min}(A_M)\ge\lambda_{\min}(\Sigma_{u_{XM,1}})\cdot\frac{q\nu_{\min}^2(\mathsf{H}_M)}{\bar{\lambda}_{V_M}\bar{\lambda}_{u_M}}, λ m i n ( D ) λ m i n ( A M ) ≥ λ m i n ( Σ u X M , 1 ) ⋅ λ ˉ V M λ ˉ u M q ν m i n 2 ( H M ) ,
so, since t ↦ 1 / ( 1 + t ) t\mapsto1/(1+t) t ↦ 1/ ( 1 + t ) is decreasing and dropping the positive term λ ˉ V M λ ˉ u M \bar{\lambda}_{V_M}\bar{\lambda}_{u_M} λ ˉ V M λ ˉ u M from the denominator only enlarges the bound,
∥ M 2 ∥ ≤ C 2 , M 1 q ν min 2 ( H M ) . \lVert M_2\rVert\le C_{2,M}\frac{1}{q\nu_{\min}^2(\mathsf{H}_M)}. ∥ M 2 ∥ ≤ C 2 , M q ν m i n 2 ( H M ) 1 .
Two-sided bound on D D D . We now bound D D D above and below, uniformly in p , q p,q p , q . We can simplify this expression using that f M ∣ A = 1 f_M\mid A=1 f M ∣ A = 1 has the same distribution as δ 1 + B 1 f X + u X M , 1 ∣ A = 1 \delta_1+B_1f_X+u_{XM,1}\mid A=1 δ 1 + B 1 f X + u X M , 1 ∣ A = 1 (see Equation (1) )
Σ f M ∣ 1 = var ( f M ∣ A = 1 ) = var ( δ 1 + B 1 f X + u X M , 1 ∣ A = 1 ) = B 1 Σ f X ∣ 1 B 1 T + Σ u X M , 1 , \Sigma_{f_M\mid1}=\operatorname{var}(f_M\mid A=1)=\operatorname{var}(\delta_1+B_1f_X+u_{XM,1}\mid A=1)=B_1\Sigma_{f_X\mid1}B_1^{\mathsf{T}}+\Sigma_{u_{XM,1}}, Σ f M ∣ 1 = var ( f M ∣ A = 1 ) = var ( δ 1 + B 1 f X + u X M , 1 ∣ A = 1 ) = B 1 Σ f X ∣ 1 B 1 T + Σ u X M , 1 ,
where in the last equality we use the fact that u X M , 1 ⊥ ⊥ f X ∣ A = 1 \mathbf{u}_{X_M,1} \perp\!\!\!\perp\mathbf{f}_X \mid A = 1 u X M , 1 ⊥ ⊥ f X ∣ A = 1 . Similarly, Σ f M f X T ∣ 1 = B 1 Σ f X ∣ 1 \Sigma_{\mathbf{f}_M\mathbf{f}_X^{\mathsf{T}}\mid1} = \mathbf{B}_1\Sigma_{\mathbf{f}_X\mid1} Σ f M f X T ∣ 1 = B 1 Σ f X ∣ 1 . Also, since Σ f X ∣ 1 \Sigma_{\mathbf{f}_X\mid1} Σ f X ∣ 1 is symmetric, we have Σ f X f M T ∣ 1 = Σ f M f X T ∣ 1 T = Σ f X ∣ 1 B 1 T \Sigma_{\mathbf{f}_X\mathbf{f}_M^{\mathsf{T}}\mid1} = \Sigma_{\mathbf{f}_M\mathbf{f}_X^{\mathsf{T}}\mid1}^{\mathsf{T}} = \Sigma_{\mathbf{f}_X\mid1}\mathbf{B}_1^{\mathsf{T}} Σ f X f M T ∣ 1 = Σ f M f X T ∣ 1 T = Σ f X ∣ 1 B 1 T . Now, substituting these identities into
D = Σ f M ∣ 1 − Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X f M T ∣ 1 , D = \Sigma_{\mathbf{f}_M\mid1} - \Sigma_{\mathbf{f}_M\mathbf{f}_X^{\mathsf{T}}\mid1}\mathbf{H}_X^{\mathsf{T}}\left(\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X}\right)^{-1}\mathbf{H}_X\Sigma_{\mathbf{f}_X\mathbf{f}_M^{\mathsf{T}}\mid1}, D = Σ f M ∣ 1 − Σ f M f X T ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X f M T ∣ 1 ,
we get that
D = B 1 Σ f X ∣ 1 B 1 T + Σ u X M , 1 − B 1 Σ f X ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 B 1 T = Σ u X M , 1 + B 1 ( Σ f X ∣ 1 − Σ f X ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 ) ⏟ E B 1 T = Σ u X M , 1 + B 1 E B 1 T . (19) \begin{aligned}
D = \mathbf{B}_1\Sigma_{\mathbf{f}_X\mid1}\mathbf{B}_1^{\mathsf{T}}+\Sigma_{\mathbf{u}_{X_M,1}}-\mathbf{B}_1\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}\left(\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X}\right)^{-1}\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{B}_1^{\mathsf{T}} \\
&= \Sigma_{\mathbf{u}_{X_M,1}}+\mathbf{B}_1\underbrace{\left(\Sigma_{\mathbf{f}_X\mid1}-\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}\left(\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X}\right)^{-1}\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\right)}_{E}\mathbf{B}_1^{\mathsf{T}} \\
&= \Sigma_{\mathbf{u}_{X_M,1}}+\mathbf{B}_1E\mathbf{B}_1^{\mathsf{T}}. \tag*{(19)}
\end{aligned} D = B 1 Σ f X ∣ 1 B 1 T + Σ u X M , 1 − B 1 Σ f X ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 B 1 T = Σ u X M , 1 + B 1 E ( Σ f X ∣ 1 − Σ f X ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 ) B 1 T = Σ u X M , 1 + B 1 E B 1 T . (19)
Now, we first show that E ⪰ 0 E \succeq0 E ⪰ 0 . We know that H X f X + e X \mathbf{H}_X\mathbf{f}_X+\mathbf{e}_X H X f X + e X is the X X X -block of L L L from (A.4). By Assumption 3.1(ii) and the tower property, we have
Cov ( H X f X + e X ∣ A = 1 ) = H X Σ f X ∣ 1 H X T + Σ e X , Cov ( f X , H X f X + e X ∣ A = 1 ) = Σ f X ∣ 1 H X T . \operatorname{Cov}(\mathbf{H}_X\mathbf{f}_X+\mathbf{e}_X\mid A=1)=\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X},\qquad\operatorname{Cov}(\mathbf{f}_X,\mathbf{H}_X\mathbf{f}_X+\mathbf{e}_X\mid A=1)=\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}. Cov ( H X f X + e X ∣ A = 1 ) = H X Σ f X ∣ 1 H X T + Σ e X , Cov ( f X , H X f X + e X ∣ A = 1 ) = Σ f X ∣ 1 H X T .
Therefore,
Ω : = Cov ( ( f X H X f X + e X ) | A = 1 ) = ( Σ f X ∣ 1 Σ f X ∣ 1 H X T H X Σ f X ∣ 1 H X Σ f X ∣ 1 H X T + Σ e X ) ⪰ 0. \Omega:=\operatorname{Cov}\left(\begin{pmatrix}\mathbf{f}_X\\ \mathbf{H}_X\mathbf{f}_X+\mathbf{e}_X\end{pmatrix}\middle| A=1\right)=\begin{pmatrix}\Sigma_{\mathbf{f}_X\mid1}&\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}\\ \mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}&\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X}\end{pmatrix}\succeq0. Ω := Cov ( ( f X H X f X + e X ) A = 1 ) = ( Σ f X ∣ 1 H X Σ f X ∣ 1 Σ f X ∣ 1 H X T H X Σ f X ∣ 1 H X T + Σ e X ) ⪰ 0.
The bottom-right block is invertible since H X Σ f X ∣ 1 H X T ⪰ 0 \mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}\succeq0 H X Σ f X ∣ 1 H X T ⪰ 0 and Σ e X ≻ 0 \Sigma_{\mathbf{e}_X}\succ0 Σ e X ≻ 0 . Now, fix a a a and let
b : = − ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 a . b:= -\left(\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X}\right)^{-1}\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}a. b := − ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 a .
Since Ω ⪰ 0 \Omega\succeq0 Ω ⪰ 0 , we have
0 ≤ ( a b ) T Ω ( a b ) = a T Σ f X ∣ 1 a − a T Σ f X ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 a = a T E a . 0\leq\begin{pmatrix}a\\b\end{pmatrix}^{\mathsf{T}}\Omega\begin{pmatrix}a\\b\end{pmatrix}=a^{\mathsf{T}}\Sigma_{\mathbf{f}_X\mid1}a-a^{\mathsf{T}}\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}\left(\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X}\right)^{-1}\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}a=a^{\mathsf{T}}Ea. 0 ≤ ( a b ) T Ω ( a b ) = a T Σ f X ∣ 1 a − a T Σ f X ∣ 1 H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 H X Σ f X ∣ 1 a = a T E a .
Since a a a was arbitrary, E ⪰ 0 E\succeq0 E ⪰ 0 . Also, B 1 E B 1 T ⪰ 0 \mathbf{B}_1E\mathbf{B}_1^{\mathsf{T}}\succeq0 B 1 E B 1 T ⪰ 0 . Thus, from (B.4),
D − Σ u X M , 1 = B 1 E B 1 T ⪰ 0. D-\Sigma_{\mathbf{u}_{X_M,1}}=\mathbf{B}_1E\mathbf{B}_1^{\mathsf{T}}\succeq0. D − Σ u X M , 1 = B 1 E B 1 T ⪰ 0.
For the lower bound, let v v v be a unit eigenvector of D D D corresponding to λ min ( D ) \lambda_{\min}(D) λ m i n ( D ) . Then,
λ min ( D ) = v T D v = v T Σ u X M , 1 v + v T ( D − Σ u X M , 1 ) v ≥ v T Σ u X M , 1 v ≥ λ min ( Σ u X M , 1 ) . \lambda_{\min}(D)=v^{\mathsf{T}}Dv=v^{\mathsf{T}}\Sigma_{\mathbf{u}_{X_M,1}}v+v^{\mathsf{T}}\left(D-\Sigma_{\mathbf{u}_{X_M,1}}\right)v\geq v^{\mathsf{T}}\Sigma_{\mathbf{u}_{X_M,1}}v\geq\lambda_{\min}\left(\Sigma_{\mathbf{u}_{X_M,1}}\right). λ m i n ( D ) = v T D v = v T Σ u X M , 1 v + v T ( D − Σ u X M , 1 ) v ≥ v T Σ u X M , 1 v ≥ λ m i n ( Σ u X M , 1 ) .
Hence, using Assumption 3.1(ii),
λ min ( D ) ≥ λ min ( Σ u X M , 1 ) ≥ c > 0. \lambda_{\min}(D)\geq\lambda_{\min}\left(\Sigma_{\mathbf{u}_{X_M,1}}\right)\geq c>0. λ m i n ( D ) ≥ λ m i n ( Σ u X M , 1 ) ≥ c > 0.
For the upper bound, for any matrix C C C and symmetric positive definite K K K , C T K − 1 C ⪰ 0 C^{\mathsf{T}}K^{-1}C\succeq0 C T K − 1 C ⪰ 0 . Now, take C = H X Σ f X ∣ 1 C=\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1} C = H X Σ f X ∣ 1 and K = H X Σ f X ∣ 1 H X T + Σ e X K=\mathbf{H}_X\Sigma_{\mathbf{f}_X\mid1}\mathbf{H}_X^{\mathsf{T}}+\Sigma_{\mathbf{e}_X} K = H X Σ f X ∣ 1 H X T + Σ e X . Then the subtracted term in E E E is positive semidefinite, and hence E ⪯ Σ f X ∣ 1 E\preceq\Sigma_{\mathbf{f}_X\mid1} E ⪯ Σ f X ∣ 1 . Therefore, B 1 E B 1 T ⪯ B 1 Σ f X ∣ 1 B 1 T \mathbf{B}_1E\mathbf{B}_1^{\mathsf{T}}\preceq\mathbf{B}_1\Sigma_{\mathbf{f}_X\mid1}\mathbf{B}_1^{\mathsf{T}} B 1 E B 1 T ⪯ B 1 Σ f X ∣ 1 B 1 T . Using (B.4) and Σ f M ∣ 1 = B 1 Σ f X ∣ 1 B 1 T + Σ u X M , 1 \Sigma_{\mathbf{f}_M\mid1}=\mathbf{B}_1\Sigma_{\mathbf{f}_X\mid1}\mathbf{B}_1^{\mathsf{T}}+\Sigma_{\mathbf{u}_{X_M,1}} Σ f M ∣ 1 = B 1 Σ f X ∣ 1 B 1 T + Σ u X M , 1 , we have
D = Σ u X M , 1 + B 1 E B 1 T ⪯ Σ u X M , 1 + B 1 Σ f X ∣ 1 B 1 T = Σ f M ∣ 1 . D=\Sigma_{\mathbf{u}_{X_M,1}}+\mathbf{B}_1E\mathbf{B}_1^{\mathsf{T}}\preceq\Sigma_{\mathbf{u}_{X_M,1}}+\mathbf{B}_1\Sigma_{\mathbf{f}_X\mid1}\mathbf{B}_1^{\mathsf{T}}=\Sigma_{\mathbf{f}_M\mid1}. D = Σ u X M , 1 + B 1 E B 1 T ⪯ Σ u X M , 1 + B 1 Σ f X ∣ 1 B 1 T = Σ f M ∣ 1 .
Let u u u be a unit eigenvector of D D D corresponding to λ max ( D ) \lambda_{\max}(D) λ m a x ( D ) . Then, using Assumption 3.1(iv),
λ max ( D ) = u T D u = u T Σ f M ∣ 1 u − u T ( Σ f M ∣ 1 − D ) u ≤ u T Σ f M ∣ 1 u ≤ λ max ( Σ f M ∣ 1 ) ≤ C , \lambda_{\max}(D)=u^{\mathsf{T}}Du=u^{\mathsf{T}}\Sigma_{\mathbf{f}_M\mid1}u-u^{\mathsf{T}}\left(\Sigma_{\mathbf{f}_M\mid1}-D\right)u\leq u^{\mathsf{T}}\Sigma_{\mathbf{f}_M\mid1}u\leq\lambda_{\max}\left(\Sigma_{\mathbf{f}_M\mid1}\right)\leq C, λ m a x ( D ) = u T D u = u T Σ f M ∣ 1 u − u T ( Σ f M ∣ 1 − D ) u ≤ u T Σ f M ∣ 1 u ≤ λ m a x ( Σ f M ∣ 1 ) ≤ C ,
Lastly, combining the two bounds, we get
0 < c ≤ λ min ( D ) ≤ λ max ( D ) ≤ C < ∞ , κ ( D ) = λ max ( D ) λ min ( D ) ≤ C c = O ( 1 ) . (20) 0<c\leq\lambda_{\min}(D)\leq\lambda_{\max}(D)\leq C<\infty,\qquad\kappa(D)=\frac{\lambda_{\max}(D)}{\lambda_{\min}(D)}\leq\frac{C}{c}=O(1). \tag*{(20)} 0 < c ≤ λ m i n ( D ) ≤ λ m a x ( D ) ≤ C < ∞ , κ ( D ) = λ m i n ( D ) λ m a x ( D ) ≤ c C = O ( 1 ) . (20)
Since λ min ( D ) > 0 \lambda_{\min}(D)>0 λ m i n ( D ) > 0 , D ≻ 0 D\succ0 D ≻ 0 , which justifies the use of D 1 / 2 D^{1/2} D 1/2 and D − 1 / 2 D^{-1/2} D − 1/2 above.
Bound on M 1 M_1 M 1 . We proceed in a similar way as for M 2 M_2 M 2 . First, we substitute the expression for B 32 B_{32} B 32 and apply the Woodbury identity of Lemma D.2 to ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 (\mathbf{H}_X\boldsymbol{\Sigma}_{fX|1}\mathbf{H}_X^{\mathsf{T}}+\boldsymbol{\Sigma}_{eX})^{-1} ( H X Σ f X ∣1 H X T + Σ e X ) − 1 . This gives
∥ M 1 ∥ = ∥ H M T B 32 Σ e X ( H X T ) T β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣ 1 T H X T ( H X Σ f X ∣ 1 H X T + Σ e X ) − 1 Σ e X ( H X T ) T β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣ 1 T H X T ( Σ e X − 1 − Σ e X − 1 H X ( Σ f X ∣ 1 − 1 + H X T Σ e X − 1 H X ) − 1 H X T Σ e X − 1 ) Σ e X ( H X T ) T β 1 ∥ . \begin{aligned}
\lVert M_1\rVert
&=\lVert\mathbf{H}_M^{\mathsf{T}}B_{32}\boldsymbol{\Sigma}_{eX}(\mathbf{H}_X^{\mathsf{T}})^{\mathsf{T}}\beta_1\rVert\\
&=\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\mathbf{H}_X^{\mathsf{T}}(\mathbf{H}_X\boldsymbol{\Sigma}_{fX|1}\mathbf{H}_X^{\mathsf{T}}+\boldsymbol{\Sigma}_{eX})^{-1}\boldsymbol{\Sigma}_{eX}(\mathbf{H}_X^{\mathsf{T}})^{\mathsf{T}}\beta_1\rVert\\
&=\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\mathbf{H}_X^{\mathsf{T}}(\boldsymbol{\Sigma}_{eX}^{-1}-\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X(\boldsymbol{\Sigma}_{fX|1}^{-1}+\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X)^{-1}\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1})\boldsymbol{\Sigma}_{eX}(\mathbf{H}_X^{\mathsf{T}})^{\mathsf{T}}\beta_1\rVert.
\end{aligned} ∥ M 1 ∥ = ∥ H M T B 32 Σ e X ( H X T ) T β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣1 T H X T ( H X Σ f X ∣1 H X T + Σ e X ) − 1 Σ e X ( H X T ) T β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣1 T H X T ( Σ e X − 1 − Σ e X − 1 H X ( Σ f X ∣1 − 1 + H X T Σ e X − 1 H X ) − 1 H X T Σ e X − 1 ) Σ e X ( H X T ) T β 1 ∥ .
Now, expanding the inner factor and collecting terms exactly as in the derivation of ∥ K 1 ∥ \lVert K_1\rVert ∥ K 1 ∥ in Step 1, we get that
∥ M 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣ 1 T β 1 − H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣ 1 T H X T Σ e X − 1 H X ( Σ f X ∣ 1 − 1 + H X T Σ e X − 1 H X ) − 1 β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣ 1 T Σ f X ∣ 1 − 1 ( Σ f X ∣ 1 − 1 + H X T Σ e X − 1 H X ) − 1 β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣ 1 T ( I ‾ p + H X T Σ e X − 1 H X Σ f X ∣ 1 ) − 1 β 1 ∥ ≤ ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ ⋅ ∥ Σ f M f X ∣ 1 T ∥ ⋅ ∥ ( I ‾ p + H X T Σ e X − 1 H X Σ f X ∣ 1 ) − 1 β 1 ∥ . (21) \begin{aligned}
\lVert M_1\rVert
&=\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\beta_1\\
&\quad-\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X(\boldsymbol{\Sigma}_{fX|1}^{-1}+\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X)^{-1}\beta_1\rVert\\
&=\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\boldsymbol{\Sigma}_{fX|1}^{-1}(\boldsymbol{\Sigma}_{fX|1}^{-1}+\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X)^{-1}\beta_1\rVert\\
&=\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}(\overline{I}_p+\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X\boldsymbol{\Sigma}_{fX|1})^{-1}\beta_1\rVert\\
&\leq\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\rVert\cdot\lVert\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\rVert\cdot\lVert(\overline{I}_p+\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X\boldsymbol{\Sigma}_{fX|1})^{-1}\beta_1\rVert. \tag*{(21)}
\end{aligned} ∥ M 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣1 T β 1 − H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣1 T H X T Σ e X − 1 H X ( Σ f X ∣1 − 1 + H X T Σ e X − 1 H X ) − 1 β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣1 T Σ f X ∣1 − 1 ( Σ f X ∣1 − 1 + H X T Σ e X − 1 H X ) − 1 β 1 ∥ = ∥ H M T ( H M D H M T + Σ e M ) − 1 H M Σ f M f X ∣1 T ( I p + H X T Σ e X − 1 H X Σ f X ∣1 ) − 1 β 1 ∥ ≤ ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ ⋅ ∥ Σ f M f X ∣1 T ∥ ⋅ ∥( I p + H X T Σ e X − 1 H X Σ f X ∣1 ) − 1 β 1 ∥ . (21)
We apply the same symmetric similarity argument as for K 1 K_1 K 1 above, and we get that
∥ M 1 ∥ ≤ ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ ⋅ κ ( Σ f X ∣ 1 ) ⋅ ∥ Σ f M f X ∣ 1 T ∥ ∥ β 1 ∥ λ ˉ V X λ ˉ u X λ min ( Σ f X ∣ 1 ) ⋅ 1 p ν min 2 ( H X ) . \lVert M_1\rVert\leq\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\rVert\cdot\sqrt{\kappa(\boldsymbol{\Sigma}_{fX|1})}\cdot\lVert\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\rVert\lVert\beta_1\rVert\frac{\bar{\lambda}_{VX}\bar{\lambda}_{uX}}{\lambda_{\min}(\boldsymbol{\Sigma}_{fX|1})}\cdot\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}. ∥ M 1 ∥ ≤ ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ ⋅ κ ( Σ f X ∣1 ) ⋅ ∥ Σ f M f X ∣1 T ∥ ∥ β 1 ∥ λ m i n ( Σ f X ∣1 ) λ ˉ V X λ ˉ u X ⋅ p ν m i n 2 ( H X ) 1 .
The last equality comes from λ min ( H X T Σ e X − 1 H X ) ≥ p ν min 2 ( H X ) λ ˉ V X λ ˉ u X \lambda_{\min}(\mathbf{H}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{eX}^{-1}\mathbf{H}_X)\geq\frac{p\nu_{\min}^{2}(\mathbf{H}_X)}{\bar{\lambda}_{VX}\bar{\lambda}_{uX}} λ m i n ( H X T Σ e X − 1 H X ) ≥ λ ˉ V X λ ˉ u X p ν m i n 2 ( H X ) as derived earlier. It remains to show the leading factor is ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ = O ( 1 ) \lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\rVert=O(1) ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ = O ( 1 ) . Applying the Woodbury identity to ( H M D H M T + Σ e M ) − 1 (\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1} ( H M D H M T + Σ e M ) − 1 and collecting terms, we get that
∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ = ∥ H M T ( Σ e M − 1 − Σ e M − 1 H M ( D − 1 + H M T Σ e M − 1 H M ) − 1 H M T Σ e M − 1 ) H M ∥ = ∥ H M T Σ e M − 1 H M − H M T Σ e M − 1 H M ( D − 1 + H M T Σ e M − 1 H M ) − 1 H M T Σ e M − 1 H M ∥ = ∥ H M T Σ e M − 1 H M ( I ‾ q + D H M T Σ e M − 1 H M ) − 1 ∥ = ∥ D − 1 ( I ‾ q + D H M T Σ e M − 1 H M − I ‾ q ) ( I ‾ q + D H M T Σ e M − 1 H M ) − 1 ∥ ≤ ∥ D − 1 ∥ + ∥ D − 1 ( I ‾ q + D H M T Σ e M − 1 H M ) − 1 ∥ ≤ 1 λ min ( D ) + ∥ D − 1 ( I ‾ q + D H M T Σ e M − 1 H M ) − 1 ∥ ≤ 1 λ min ( Σ u X M , 1 ) + 1 λ min ( Σ u X M , 1 ) ∥ ( I ‾ q + D H M T Σ e M − 1 H M ) − 1 ∥ . \begin{aligned}
\lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\rVert
&=\lVert\mathbf{H}_M^{\mathsf{T}}(\boldsymbol{\Sigma}_{eM}^{-1}-\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M(D^{-1}+\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M)^{-1}\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1})\mathbf{H}_M\rVert\\
&=\lVert\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M-\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M(D^{-1}+\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M)^{-1}\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M\rVert\\
&=\lVert\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M(\overline{I}_q+D\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M)^{-1}\rVert\\
&=\lVert D^{-1}(\overline{I}_q+D\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M-\overline{I}_q)(\overline{I}_q+D\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M)^{-1}\rVert\\
&\leq\lVert D^{-1}\rVert+\lVert D^{-1}(\overline{I}_q+D\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M)^{-1}\rVert\\
&\leq\frac{1}{\lambda_{\min}(D)}+\lVert D^{-1}(\overline{I}_q+D\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M)^{-1}\rVert\\
&\leq\frac{1}{\lambda_{\min}(\boldsymbol{\Sigma}_{u_XM,1})}+\frac{1}{\lambda_{\min}(\boldsymbol{\Sigma}_{u_XM,1})}\lVert(\overline{I}_q+D\mathbf{H}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{eM}^{-1}\mathbf{H}_M)^{-1}\rVert.
\end{aligned} ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ = ∥ H M T ( Σ e M − 1 − Σ e M − 1 H M ( D − 1 + H M T Σ e M − 1 H M ) − 1 H M T Σ e M − 1 ) H M ∥ = ∥ H M T Σ e M − 1 H M − H M T Σ e M − 1 H M ( D − 1 + H M T Σ e M − 1 H M ) − 1 H M T Σ e M − 1 H M ∥ = ∥ H M T Σ e M − 1 H M ( I q + D H M T Σ e M − 1 H M ) − 1 ∥ = ∥ D − 1 ( I q + D H M T Σ e M − 1 H M − I q ) ( I q + D H M T Σ e M − 1 H M ) − 1 ∥ ≤ ∥ D − 1 ∥ + ∥ D − 1 ( I q + D H M T Σ e M − 1 H M ) − 1 ∥ ≤ λ m i n ( D ) 1 + ∥ D − 1 ( I q + D H M T Σ e M − 1 H M ) − 1 ∥ ≤ λ m i n ( Σ u X M , 1 ) 1 + λ m i n ( Σ u X M , 1 ) 1 ∥( I q + D H M T Σ e M − 1 H M ) − 1 ∥ .
Now, using the similar steps as for K 1 K_1 K 1 , we get that
∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ ≤ 1 λ min ( Σ u X M , 1 ) + 1 λ min ( Σ u X M , 1 ) ⋅ κ ( D ) ⋅ 1 1 + λ min ( D ) ( q ν min 2 ( H M ) λ ˉ u M λ ˉ V M ) . \lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\rVert\leq\frac{1}{\lambda_{\min}(\boldsymbol{\Sigma}_{u_XM,1})}+\frac{1}{\lambda_{\min}(\boldsymbol{\Sigma}_{u_XM,1})}\cdot\sqrt{\kappa(D)}\cdot\frac{1}{1+\lambda_{\min}(D)\left(\frac{q\nu_{\min}^{2}(\mathbf{H}_M)}{\bar{\lambda}_{uM}\bar{\lambda}_{VM}}\right)}. ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ ≤ λ m i n ( Σ u X M , 1 ) 1 + λ m i n ( Σ u X M , 1 ) 1 ⋅ κ ( D ) ⋅ 1 + λ m i n ( D ) ( λ ˉ u M λ ˉ V M q ν m i n 2 ( H M ) ) 1 .
We name this upper bound as C H M C_{HM} C H M . Thus, we have that ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ = O ( 1 ) \lVert\mathbf{H}_M^{\mathsf{T}}(\mathbf{H}_MD\mathbf{H}_M^{\mathsf{T}}+\boldsymbol{\Sigma}_{eM})^{-1}\mathbf{H}_M\rVert=O(1) ∥ H M T ( H M D H M T + Σ e M ) − 1 H M ∥ = O ( 1 ) . Substituting this bound into the inequality (B.6), we get
∥ M 1 ∥ ≤ C H M κ ( Σ f X ∣ 1 ) ∥ Σ f M f X ∣ 1 T ∥ ∥ β 1 ∥ λ ˉ V X λ ˉ u X λ min ( Σ f X ∣ 1 ) ⋅ 1 p ν min 2 ( H X ) = C 2 , X ⋅ 1 p ν min 2 ( H X ) . \lVert M_1\rVert\leq C_{HM}\sqrt{\kappa(\boldsymbol{\Sigma}_{fX|1})}\frac{\lVert\boldsymbol{\Sigma}_{fM}\mathbf{f}_{X|1}^{\mathsf{T}}\rVert\lVert\beta_1\rVert\bar{\lambda}_{VX}\bar{\lambda}_{uX}}{\lambda_{\min}(\boldsymbol{\Sigma}_{fX|1})}\cdot\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}=C_{2,X}\cdot\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}. ∥ M 1 ∥ ≤ C H M κ ( Σ f X ∣1 ) λ m i n ( Σ f X ∣1 ) ∥ Σ f M f X ∣1 T ∥ ∥ β 1 ∥ λ ˉ V X λ ˉ u X ⋅ p ν m i n 2 ( H X ) 1 = C 2 , X ⋅ p ν m i n 2 ( H X ) 1 .
Using the bounds established above for M 1 M_1 M 1 and M 2 M_2 M 2 in ∥ K 3 ∥ ≤ M 1 + M 2 \lVert K_3\rVert\leq M_1+M_2 ∥ K 3 ∥ ≤ M 1 + M 2 , it follows that
∥ K 3 ∥ ≤ M 1 + M 2 = O ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) . \lVert K_3\rVert\leq M_1+M_2=O\left(\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}+\frac{1}{q\nu_{\min}^{2}(\mathbf{H}_M)}\right). ∥ K 3 ∥ ≤ M 1 + M 2 = O ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) .
For K 4 K_4 K 4 . We have that
K 4 = H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] = 0. K_4 = \mathbf{H}_M^{\top}\mathbb{S}_{q}\mathbb{E}[LL^{\top}\mid A=1]^{-1}\mathbb{E}[L\epsilon_1\mid A=1]=0. K 4 = H M ⊤ S q E [ L L ⊤ ∣ A = 1 ] − 1 E [ L ϵ 1 ∣ A = 1 ] = 0.
By the same decomposition L = Z + e 0 L=Z+e_0 L = Z + e 0 and the same two conditional-mean-zero arguments used for K 2 K_2 K 2 , E [ L ϵ 1 ∣ A = 1 ] = 0 \mathbb{E}[L\epsilon_1\mid A=1]=0 E [ L ϵ 1 ∣ A = 1 ] = 0 exactly. Since R γ = − K 3 + K 4 R_{\gamma}=-K_3+K_4 R γ = − K 3 + K 4 , we have that
∥ R γ ∥ ≤ ∥ K 3 ∥ + ∥ K 4 ∥ = O ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) \lVert R_{\gamma}\rVert\leq\lVert K_3\rVert+\lVert K_4\rVert=O\left(\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}+\frac{1}{q\nu_{\min}^{2}(\mathbf{H}_M)}\right) ∥ R γ ∥ ≤ ∥ K 3 ∥ + ∥ K 4 ∥ = O ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 )
Step 3: T 3 T_3 T 3 . To identify δ 0 \delta_0 δ 0 up to the linear transformation H M \mathbf{H}_M H M , we decompose N N N under the control group. Using M = Γ M f M + u M M=\Gamma_Mf_M+u_M M = Γ M f M + u M and the mediator regression f M = δ 0 + B 0 f X + u X M , 0 f_M=\delta_0+B_0f_X+u_{XM,0} f M = δ 0 + B 0 f X + u X M , 0 under A = 0 A=0 A = 0 ,
N = 1 q W M ⊤ M = 1 q W M ⊤ Γ M f M + 1 q W M ⊤ u M = 1 q W M ⊤ Γ M ( δ 0 + B 0 f X + u X M , 0 ) + 1 q W M ⊤ u M = H M ( δ 0 + B 0 f X + u X M , 0 ) + e M = H M δ 0 + H M B 0 H X ⊤ H X f X + H M u X M , 0 + e M = ϕ X M , 0 ⊤ H X 1 f X 1 + e X M , 0 , (22) \begin{aligned}
N&=\frac{1}{q}\mathbf{W}_M^{\top}M\\
&=\frac{1}{q}\mathbf{W}_M^{\top}\Gamma_Mf_M+\frac{1}{q}\mathbf{W}_M^{\top}u_M\\
&=\frac{1}{q}\mathbf{W}_M^{\top}\Gamma_M(\delta_0+B_0f_X+u_{XM,0})+\frac{1}{q}\mathbf{W}_M^{\top}u_M\\
&=\mathbf{H}_M(\delta_0+B_0f_X+u_{XM,0})+e_M\\
&=\mathbf{H}_M\delta_0+\mathbf{H}_MB_0\mathbf{H}_X^{\top}\mathbf{H}_Xf_X+\mathbf{H}_Mu_{XM,0}+e_M\\
&=\phi_{XM,0}^{\top}\mathbf{H}_{X1}f_{X1}+e_{XM,0}, \tag*{(22)}
\end{aligned} N = q 1 W M ⊤ M = q 1 W M ⊤ Γ M f M + q 1 W M ⊤ u M = q 1 W M ⊤ Γ M ( δ 0 + B 0 f X + u X M , 0 ) + q 1 W M ⊤ u M = H M ( δ 0 + B 0 f X + u X M , 0 ) + e M = H M δ 0 + H M B 0 H X ⊤ H X f X + H M u X M , 0 + e M = ϕ X M , 0 ⊤ H X 1 f X 1 + e X M , 0 , (22)
so that N ⊤ = f X 1 ⊤ H X 1 ⊤ ϕ X M , 0 + e X M , 0 ⊤ N^{\top}=f_{X1}^{\top}\mathbf{H}_{X1}^{\top}\phi_{XM,0}+e_{XM,0}^{\top} N ⊤ = f X 1 ⊤ H X 1 ⊤ ϕ X M , 0 + e X M , 0 ⊤ , where
ϕ X M , 0 = ( δ 0 ⊤ H M ⊤ ( H M B 0 H X ⊤ ) ⊤ ) = ( H X 1 ⊤ ) ⊤ Φ H M ⊤ , e X M , 0 = u X M , 0 ⊤ H M + e M ⊤ , \phi_{XM,0}=\begin{pmatrix}\delta_0^{\top}\mathbf{H}_M^{\top}\\(\mathbf{H}_MB_0\mathbf{H}_X^{\top})^{\top}\end{pmatrix}=(\mathbf{H}_{X1}^{\top})^{\top}\Phi\mathbf{H}_M^{\top},\qquad e_{XM,0}=u_{XM,0}^{\top}\mathbf{H}_M+e_M^{\top}, ϕ X M , 0 = ( δ 0 ⊤ H M ⊤ ( H M B 0 H X ⊤ ) ⊤ ) = ( H X 1 ⊤ ) ⊤ Φ H M ⊤ , e X M , 0 = u X M , 0 ⊤ H M + e M ⊤ ,
and where, since ( H M B 0 H X ⊤ ) ⊤ = ( H X ⊤ ) ⊤ B 0 ⊤ H M ⊤ (\mathbf{H}_MB_0\mathbf{H}_X^{\top})^{\top}=(\mathbf{H}_X^{\top})^{\top}B_0^{\top}\mathbf{H}_M^{\top} ( H M B 0 H X ⊤ ) ⊤ = ( H X ⊤ ) ⊤ B 0 ⊤ H M ⊤ , we have
Φ : = ( δ 0 ⊤ B 0 ⊤ ) ∈ R ( 1 + p ˉ ) × q ˉ , Φ ′ = B 0 ⊤ , ∥ Φ ′ ∥ = ∥ B 0 ∥ op ≤ C (23) \Phi:=\begin{pmatrix}\delta_0^{\top}\\B_0^{\top}\end{pmatrix}\in\mathbb{R}^{(1+\bar p)\times\bar q},\qquad\Phi'=B_0^{\top},\qquad\lVert\Phi'\rVert=\lVert B_0\rVert_{\operatorname{op}}\leq C \tag*{(23)} Φ := ( δ 0 ⊤ B 0 ⊤ ) ∈ R ( 1 + p ˉ ) × q ˉ , Φ ′ = B 0 ⊤ , ∥ Φ ′ ∥ = ∥ B 0 ∥ op ≤ C (23)
by Assumption 3.2(i). The matrix Φ ′ \Phi' Φ ′ denotes the lower p ˉ \bar p p ˉ -row block of Φ \Phi Φ , the analogue of the truncation Δ ′ = ( β 1 ⊤ , γ 1 ⊤ ) ⊤ \Delta'=(\beta_1^{\top},\gamma_1^{\top})^{\top} Δ ′ = ( β 1 ⊤ , γ 1 ⊤ ) ⊤ of Δ = ( α 1 , β 1 ⊤ , γ 1 ⊤ ) ⊤ \Delta=(\alpha_1,\beta_1^{\top},\gamma_1^{\top})^{\top} Δ = ( α 1 , β 1 ⊤ , γ 1 ⊤ ) ⊤ used in Step 1. The quantity Φ ′ \Phi' Φ ′ is what appears below wherever Σ e X \Sigma_{eX} Σ e X acts on Φ \Phi Φ . We have
e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q N ⊤ ∣ A = 0 ] = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q Q ⊤ ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q N ⊤ − Q Q ⊤ ϕ X M , 0 ∣ A = 0 ] = δ 0 ⊤ H M + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( f X 1 ⊤ H X 1 ⊤ ϕ X M , 0 + e X M , 0 ) − Q Q ⊤ ϕ X M , 0 ∣ A = 0 ] = δ 0 ⊤ H M + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( f X 1 ⊤ H X 1 ⊤ − Q ⊤ ) ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q e X M , 0 ⊤ ∣ A = 0 ] = δ 0 ⊤ H M + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( − e X 0 ⊤ ) ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( e X M , 0 ⊤ ) ∣ A = 0 ] = ( 1 ) δ 0 ⊤ H M − e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ H X 1 f X 1 e X 0 ⊤ ϕ X M , 0 ∣ A = 0 ] − e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ H X 1 f X 1 ( e X M , 0 ⊤ ) ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ∣ A = 0 ] = δ 0 ⊤ H M − e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ∣ A = 0 ] ϕ X M , 0 + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ∣ A = 0 ] e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ∣ A = 0 ] ϕ X M , 0 ⏟ K 5 e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ∣ A = 0 ] ⏟ K 6 . \begin{aligned}
e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[QN^{\top}\mid A=0]
&=e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[QQ^{\top}\phi_{XM,0}\mid A=0]\\
&\quad+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[QN^{\top}-QQ^{\top}\phi_{XM,0}\mid A=0]\\
&=\delta_0^{\top}\mathbf{H}_M+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[Q(f_{X1}^{\top}\mathbf{H}_{X1}^{\top}\phi_{XM,0}+e_{XM,0})-QQ^{\top}\phi_{XM,0}\mid A=0]\\
&=\delta_0^{\top}\mathbf{H}_M+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[Q(f_{X1}^{\top}\mathbf{H}_{X1}^{\top}-Q^{\top})\phi_{XM,0}\mid A=0]\\
&\quad+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[Qe_{XM,0}^{\top}\mid A=0]\\
&=\delta_0^{\top}\mathbf{H}_M+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[Q(-e_{X0}^{\top})\phi_{XM,0}\mid A=0]\\
&\quad+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[Q(e_{XM,0}^{\top})\mid A=0]\\
&\mathrel{\stackrel{(1)}{=}}\delta_0^{\top}\mathbf{H}_M-e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[\mathbf{H}_{X1}f_{X1}e_{X0}^{\top}\phi_{XM,0}\mid A=0]\\
&\quad-e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X0}e_{X0}^{\top}\phi_{XM,0}\mid A=0]\\
&\quad+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[\mathbf{H}_{X1}f_{X1}(e_{XM,0}^{\top})\mid A=0]\\
&\quad+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X0}e_{XM,0}^{\top}\mid A=0]\\
&=\delta_0^{\top}\mathbf{H}_M-e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X0}e_{X0}^{\top}\mid A=0]\phi_{XM,0}\\
&\quad+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X0}e_{XM,0}^{\top}\mid A=0]\\
&\hspace{5cm}\underbrace{\phantom{e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X0}e_{X0}^{\top}\mid A=0]\phi_{XM,0}}}_{K_5}
\hspace{1cm}\underbrace{\phantom{e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X0}e_{XM,0}^{\top}\mid A=0]}}_{K_6}.
\end{aligned} e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q N ⊤ ∣ A = 0 ] = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q Q ⊤ ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q N ⊤ − Q Q ⊤ ϕ X M , 0 ∣ A = 0 ] = δ 0 ⊤ H M + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( f X 1 ⊤ H X 1 ⊤ ϕ X M , 0 + e X M , 0 ) − Q Q ⊤ ϕ X M , 0 ∣ A = 0 ] = δ 0 ⊤ H M + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( f X 1 ⊤ H X 1 ⊤ − Q ⊤ ) ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q e X M , 0 ⊤ ∣ A = 0 ] = δ 0 ⊤ H M + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( − e X 0 ⊤ ) ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ Q ( e X M , 0 ⊤ ) ∣ A = 0 ] = ( 1 ) δ 0 ⊤ H M − e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ H X 1 f X 1 e X 0 ⊤ ϕ X M , 0 ∣ A = 0 ] − e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ϕ X M , 0 ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ H X 1 f X 1 ( e X M , 0 ⊤ ) ∣ A = 0 ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ∣ A = 0 ] = δ 0 ⊤ H M − e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ∣ A = 0 ] ϕ X M , 0 + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ∣ A = 0 ] K 5 e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ∣ A = 0 ] ϕ X M , 0 K 6 e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ∣ A = 0 ] .
Here, (1) uses E [ f X 1 e X 0 ⊤ ∣ A = 0 ] = 0 \mathbb{E}[f_{X1}e_{X0}^{\top}\mid A=0]=0 E [ f X 1 e X 0 ⊤ ∣ A = 0 ] = 0 and E [ f X 1 e X M , 0 ⊤ ∣ A = 0 ] = 0 \mathbb{E}[f_{X1}e_{XM,0}^{\top}\mid A=0]=0 E [ f X 1 e X M , 0 ⊤ ∣ A = 0 ] = 0 . These follow from E [ e X 0 ∣ f X , A = 0 ] = 0 \mathbb{E}[e_{X0}\mid f_X,A=0]=0 E [ e X 0 ∣ f X , A = 0 ] = 0 and E [ e X M , 0 ∣ f X , A = 0 ] = 0 \mathbb{E}[e_{XM,0}\mid f_X,A=0]=0 E [ e X M , 0 ∣ f X , A = 0 ] = 0 , respectively, via the tower property. Since e X M , 0 = H M u X M , 0 + e M e_{XM,0}=\mathbf{H}_Mu_{XM,0}+e_M e X M , 0 = H M u X M , 0 + e M , we have
E [ e X M , 0 ⊤ ∣ f X , A = 0 ] = E [ u X M , 0 ⊤ ∣ f X , A = 0 ] H M ⊤ + E [ e M ⊤ ∣ f X , A = 0 ] = 0 , \mathbb{E}[e_{XM,0}^{\top}\mid f_X,A=0]=\mathbb{E}[u_{XM,0}^{\top}\mid f_X,A=0]\mathbf{H}_M^{\top}+\mathbb{E}[e_M^{\top}\mid f_X,A=0]=0, E [ e X M , 0 ⊤ ∣ f X , A = 0 ] = E [ u X M , 0 ⊤ ∣ f X , A = 0 ] H M ⊤ + E [ e M ⊤ ∣ f X , A = 0 ] = 0 ,
using Assumptions 3.1(ii). Consider that R δ = − K 5 + K 6 R_{\delta}=-K_5+K_6 R δ = − K 5 + K 6 , and we need to bound both the terms.
Negligibility of R δ R_{\delta} R δ .
Recall that we need to consider the negligibility of R ~ δ \widetilde{R}_{\delta} R δ when R δ = R ~ δ H M ⊤ R_{\delta}=\widetilde{R}_{\delta}H_{M}^{\top} R δ = R δ H M ⊤ as mentioned at the start of the proof. From the factor representation Q = H X 1 f X 1 + e X 0 Q=H_{X_1}f_{X_1}+e_{X_0} Q = H X 1 f X 1 + e X 0 , we have
K 5 = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ] Φ X M , 0 = e 1 ⊤ ( E [ H X 1 f X 1 f X 1 ⊤ H X 1 ⊤ ∣ A = 0 ] + E [ e X 0 e X 0 ⊤ ∣ A = 0 ] ) − 1 E [ e X 0 e X 0 ⊤ ] Φ X M , 0 = e 1 ⊤ ( H X 1 Λ f X 1 ∣ 0 H X 1 ⊤ + Σ e X 0 ) − 1 Σ e X 0 Φ X M , 0 = e 1 ⊤ ( H X 1 Λ f X 1 ∣ 0 H X 1 ⊤ + Σ e X 0 ) − 1 Σ e X 0 ( H X 1 ⊤ ) ⊤ Φ H M ⊤ . \begin{aligned}
K_5&=e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X_0}e_{X_0}^{\top}]\Phi_{X_M,0}\\
&=e_1^{\top}\left(\mathbb{E}[H_{X_1}f_{X_1}f_{X_1}^{\top}H_{X_1}^{\top}\mid A=0]+\mathbb{E}[e_{X_0}e_{X_0}^{\top}\mid A=0]\right)^{-1}\mathbb{E}[e_{X_0}e_{X_0}^{\top}]\Phi_{X_M,0}\\
&=e_1^{\top}\left(H_{X_1}\Lambda_{f_{X_1}\mid0}H_{X_1}^{\top}+\Sigma_{e_{X_0}}\right)^{-1}\Sigma_{e_{X_0}}\Phi_{X_M,0}\\
&=e_1^{\top}\left(H_{X_1}\Lambda_{f_{X_1}\mid0}H_{X_1}^{\top}+\Sigma_{e_{X_0}}\right)^{-1}\Sigma_{e_{X_0}}\left(H_{X_1}^{\top}\right)^{\top}\Phi H_M^{\top}.
\end{aligned} K 5 = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X 0 ⊤ ] Φ X M , 0 = e 1 ⊤ ( E [ H X 1 f X 1 f X 1 ⊤ H X 1 ⊤ ∣ A = 0 ] + E [ e X 0 e X 0 ⊤ ∣ A = 0 ] ) − 1 E [ e X 0 e X 0 ⊤ ] Φ X M , 0 = e 1 ⊤ ( H X 1 Λ f X 1 ∣ 0 H X 1 ⊤ + Σ e X 0 ) − 1 Σ e X 0 Φ X M , 0 = e 1 ⊤ ( H X 1 Λ f X 1 ∣ 0 H X 1 ⊤ + Σ e X 0 ) − 1 Σ e X 0 ( H X 1 ⊤ ) ⊤ Φ H M ⊤ .
Here, (1) follows from E [ f X 1 e X 0 ⊤ ∣ A = 0 ] = 0 \mathbb{E}[f_{X_1}e_{X_0}^{\top}\mid A=0]=0 E [ f X 1 e X 0 ⊤ ∣ A = 0 ] = 0 , so the two cross terms vanish, and where Λ f X 1 ∣ 0 : = E [ f X 1 f X 1 ⊤ ∣ A = 0 ] \Lambda_{f_{X_1}\mid0}:=\mathbb{E}[f_{X_1}f_{X_1}^{\top}\mid A=0] Λ f X 1 ∣ 0 := E [ f X 1 f X 1 ⊤ ∣ A = 0 ] is the uncentered second moment. We now rewrite the expression for K 5 K_5 K 5 .
K 5 = e 1 ⊤ ( H X 1 Λ f X 1 ∣ 0 H X 1 ⊤ + Σ e X 0 ) − 1 Σ e X 0 H X 1 ( H X 1 ⊤ H X 1 ) − 1 Φ H M ⊤ = K ~ 5 H M ⊤ K_5=e_1^{\top}\left(H_{X_1}\Lambda_{f_{X_1}\mid0}H_{X_1}^{\top}+\Sigma_{e_{X_0}}\right)^{-1}\Sigma_{e_{X_0}}H_{X_1}\left(H_{X_1}^{\top}H_{X_1}\right)^{-1}\Phi H_M^{\top}=\widetilde{K}_5H_M^{\top} K 5 = e 1 ⊤ ( H X 1 Λ f X 1 ∣ 0 H X 1 ⊤ + Σ e X 0 ) − 1 Σ e X 0 H X 1 ( H X 1 ⊤ H X 1 ) − 1 Φ H M ⊤ = K 5 H M ⊤
Now, we bound the K ~ 5 \widetilde{K}_5 K 5 ,
∥ K ~ 5 ∥ = ∥ e 1 ⊤ [ ( 1 + μ f X ∣ 0 H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 H X μ f X ∣ 0 ⊤ − μ f X ∣ 0 H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 ( − μ f X ∣ 0 ⊤ H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 ) ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 ) ] ( 0 Σ e X H X ( H X ⊤ H X ) − 1 Φ ′ ) ∥ = ∥ − μ f X ∣ 0 ⊤ H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 Σ e X H X ( H X ⊤ H X ) − 1 Φ ′ ∥ = ∥ − μ f X ∣ 0 ⊤ H X ⊤ ( Σ e X − 1 − Σ e X − 1 H X ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − 1 H X ⊤ Σ e X − 1 ) Σ e X H X ( H X ⊤ H X ) − 1 Φ ′ ∥ = ∥ μ f X ∣ 0 ⊤ Φ ′ − μ f X ∣ 0 ⊤ ( ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − Σ f X ∣ 0 − 1 ) ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − 1 Φ ′ ∥ = ∥ μ f X ∣ 0 ⊤ Σ f X ∣ 0 − 1 ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − 1 Φ ′ ∥ = ∥ μ f X ∣ 0 ⊤ ( I p ˉ + H X ⊤ Σ e X − 1 H X Σ f X ∣ 0 ) − 1 Φ ′ ∥ ≤ κ ( Σ f X ∣ 0 ) ∥ μ f X ∣ 0 ∥ ∥ Φ ′ ∥ 1 + λ min ( Σ f X ∣ 0 ) λ min ( H X ⊤ Σ e X − 1 H X ) . \begin{aligned}
\lVert\widetilde{K}_5\rVert
&=\left\lVert e_1^{\top}\left[
\begin{pmatrix}
1+\mu_{f_{X}\mid0}H_X^{\top}(H_X\Sigma_{f_X\mid0}H_X^{\top}+\Sigma_{e_X})^{-1}H_X\mu_{f_X\mid0}^{\top}
&
-\mu_{f_X\mid0}H_X^{\top}(H_X\Sigma_{f_X\mid0}H_X^{\top}+\Sigma_{e_X})^{-1}\\
(-\mu_{f_X\mid0}^{\top}H_X^{\top}(H_X\Sigma_{f_X\mid0}H_X^{\top}+\Sigma_{e_X})^{-1})^{\top}
&
(H_X\Sigma_{f_X\mid0}H_X^{\top}+\Sigma_{e_X})^{-1}
\end{pmatrix}
\right]
\begin{pmatrix}
0\\
\Sigma_{e_X}H_X(H_X^{\top}H_X)^{-1}\Phi'
\end{pmatrix}\right\rVert\\
&=\left\lVert-\mu_{f_X\mid0}^{\top}H_X^{\top}(H_X\Sigma_{f_X\mid0}H_X^{\top}+\Sigma_{e_X})^{-1}\Sigma_{e_X}H_X(H_X^{\top}H_X)^{-1}\Phi'\right\rVert\\
&=\left\lVert-\mu_{f_X\mid0}^{\top}H_X^{\top}\left(\Sigma_{e_X}^{-1}-\Sigma_{e_X}^{-1}H_X(\Sigma_{f_X\mid0}^{-1}+H_X^{\top}\Sigma_{e_X}^{-1}H_X)^{-1}H_X^{\top}\Sigma_{e_X}^{-1}\right)\Sigma_{e_X}H_X(H_X^{\top}H_X)^{-1}\Phi'\right\rVert\\
&=\left\lVert\mu_{f_X\mid0}^{\top}\Phi'-\mu_{f_X\mid0}^{\top}\left((\Sigma_{f_X\mid0}^{-1}+H_X^{\top}\Sigma_{e_X}^{-1}H_X)-\Sigma_{f_X\mid0}^{-1}\right)(\Sigma_{f_X\mid0}^{-1}+H_X^{\top}\Sigma_{e_X}^{-1}H_X)^{-1}\Phi'\right\rVert\\
&=\left\lVert\mu_{f_X\mid0}^{\top}\Sigma_{f_X\mid0}^{-1}(\Sigma_{f_X\mid0}^{-1}+H_X^{\top}\Sigma_{e_X}^{-1}H_X)^{-1}\Phi'\right\rVert\\
&=\left\lVert\mu_{f_X\mid0}^{\top}(I_{\bar p}+H_X^{\top}\Sigma_{e_X}^{-1}H_X\Sigma_{f_X\mid0})^{-1}\Phi'\right\rVert\\
&\leq\sqrt{\kappa(\Sigma_{f_X\mid0})}\frac{\lVert\mu_{f_X\mid0}\rVert\lVert\Phi'\rVert}{1+\lambda_{\min}(\Sigma_{f_X\mid0})\lambda_{\min}(H_X^{\top}\Sigma_{e_X}^{-1}H_X)}.
\end{aligned} ∥ K 5 ∥ = e 1 ⊤ [ ( 1 + μ f X ∣ 0 H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 H X μ f X ∣ 0 ⊤ ( − μ f X ∣ 0 ⊤ H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 ) ⊤ − μ f X ∣ 0 H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 ) ] ( 0 Σ e X H X ( H X ⊤ H X ) − 1 Φ ′ ) = − μ f X ∣ 0 ⊤ H X ⊤ ( H X Σ f X ∣ 0 H X ⊤ + Σ e X ) − 1 Σ e X H X ( H X ⊤ H X ) − 1 Φ ′ = − μ f X ∣ 0 ⊤ H X ⊤ ( Σ e X − 1 − Σ e X − 1 H X ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − 1 H X ⊤ Σ e X − 1 ) Σ e X H X ( H X ⊤ H X ) − 1 Φ ′ = μ f X ∣ 0 ⊤ Φ ′ − μ f X ∣ 0 ⊤ ( ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − Σ f X ∣ 0 − 1 ) ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − 1 Φ ′ = μ f X ∣ 0 ⊤ Σ f X ∣ 0 − 1 ( Σ f X ∣ 0 − 1 + H X ⊤ Σ e X − 1 H X ) − 1 Φ ′ = μ f X ∣ 0 ⊤ ( I p ˉ + H X ⊤ Σ e X − 1 H X Σ f X ∣ 0 ) − 1 Φ ′ ≤ κ ( Σ f X ∣ 0 ) 1 + λ m i n ( Σ f X ∣ 0 ) λ m i n ( H X ⊤ Σ e X − 1 H X ) ∥ μ f X ∣ 0 ∥ ∥ Φ ′ ∥ .
Using the similar steps as above, we have
∥ K ~ 5 ∥ ≤ κ ( Σ f X ∣ 0 ) ∥ μ f X ∣ 0 ∥ ∥ Φ ′ ∥ λ ‾ V X λ ‾ u X λ min ( Σ f X ∣ 0 ) ⋅ 1 p ν min 2 ( H X ) = C 3 ⋅ 1 p ν min 2 ( H X ) . \lVert\widetilde{K}_5\rVert\leq\sqrt{\kappa(\Sigma_{f_X\mid0})}\frac{\lVert\mu_{f_X\mid0}\rVert\lVert\Phi'\rVert\overline{\lambda}_{V_X}\overline{\lambda}_{u_X}}{\lambda_{\min}(\Sigma_{f_X\mid0})}\cdot\frac{1}{p\nu_{\min}^{2}(H_X)}=C_3\cdot\frac{1}{p\nu_{\min}^{2}(H_X)}. ∥ K 5 ∥ ≤ κ ( Σ f X ∣ 0 ) λ m i n ( Σ f X ∣ 0 ) ∥ μ f X ∣ 0 ∥ ∥ Φ ′ ∥ λ V X λ u X ⋅ p ν m i n 2 ( H X ) 1 = C 3 ⋅ p ν m i n 2 ( H X ) 1 .
For K 6 K_6 K 6 . Since e X 0 e_{X_0} e X 0 is a linear function of u X u_X u X ,
K 6 = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ] = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 ( u X M , 0 ⊤ H M ⊤ + e M ⊤ ) ] = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 u X M , 0 ⊤ H M ⊤ ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e M ⊤ ] = 0 \begin{aligned}
K_6&=e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X_0}e_{X_M,0}^{\top}]\\
&=e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X_0}(u_{X_M,0}^{\top}H_M^{\top}+e_M^{\top})]\\
&=e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X_0}u_{X_M,0}^{\top}H_M^{\top}]+e_1^{\top}\mathbb{E}[QQ^{\top}\mid A=0]^{-1}\mathbb{E}[e_{X_0}e_M^{\top}]\\
&=0
\end{aligned} K 6 = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e X M , 0 ⊤ ] = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 ( u X M , 0 ⊤ H M ⊤ + e M ⊤ )] = e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 u X M , 0 ⊤ H M ⊤ ] + e 1 ⊤ E [ Q Q ⊤ ∣ A = 0 ] − 1 E [ e X 0 e M ⊤ ] = 0
the first and second term vanishing by Assumptions 3.1(ii).
Recall that R δ = − K 5 + K 6 R_{\delta}=-K_5+K_6 R δ = − K 5 + K 6 , so R δ = − K 5 = − K ~ 5 H M ⊤ R_{\delta}=-K_5=-\widetilde{K}_5H_M^{\top} R δ = − K 5 = − K 5 H M ⊤ . For notational convenience, take R ~ δ = − K ~ 5 \widetilde{R}_{\delta}=-\widetilde{K}_5 R δ = − K 5 , and we have ∥ R ~ δ ∥ = O ( p − 1 ν min − 2 ( H X ) ) \lVert\widetilde{R}_{\delta}\rVert=O\left(p^{-1}\nu_{\min}^{-2}(H_X)\right) ∥ R δ ∥ = O ( p − 1 ν m i n − 2 ( H X ) ) as p ν min 2 ( H X ) → ∞ p\nu_{\min}^{2}(H_X)\to\infty p ν m i n 2 ( H X ) → ∞ .
Proof of Corollary 3.2
Proof. For a ∈ { 0 , 1 } a\in\{0,1\} a ∈ { 0 , 1 } , define μ a : = E [ Y ( a ) ] = α a + γ a ⊤ δ a \mu_a:=\mathbb{E}[Y^{(a)}]=\alpha_a+\gamma_a^{\top}\delta_a μ a := E [ Y ( a ) ] = α a + γ a ⊤ δ a . Here each μ a = α a + γ a ⊤ δ a \mu_a=\alpha_a+\gamma_a^{\top}\delta_a μ a = α a + γ a ⊤ δ a takes both its outcome coefficients ( α a , γ a ) (\alpha_a,\gamma_a) ( α a , γ a ) and its mediator coefficient δ a \delta_a δ a within the same arm a a a , so that μ 1 \mu_1 μ 1 and μ 0 \mu_0 μ 0 are the within-arm cases ( a Y , a M ) = ( 1 , 1 ) (a_Y,a_M)=(1,1) ( a Y , a M ) = ( 1 , 1 ) and ( 0 , 0 ) (0,0) ( 0 , 0 ) , whereas θ 0 = α 1 + γ 1 ⊤ δ 0 \theta_0=\alpha_1+\gamma_1^{\top}\delta_0 θ 0 = α 1 + γ 1 ⊤ δ 0 of Theorem 3.1 is the cross-world case ( 1 , 0 ) (1,0) ( 1 , 0 ) . Since Assumptions 3.1(iv)–(v) and 3.2 hold for each arm separately, the argument of Theorem 3.1 applies to each with the arm index relabeled. We therefore write μ a \mu_a μ a for this quantity in Theorem 3.1. Then, we have θ A T E = μ 1 − μ 0 \theta_{\mathrm{ATE}}=\mu_1-\mu_0 θ ATE = μ 1 − μ 0 and θ A T E , p , q = μ 1 , p , q − μ 0 , p , q \theta_{\mathrm{ATE},p,q}=\mu_{1,p,q}-\mu_{0,p,q} θ ATE , p , q = μ 1 , p , q − μ 0 , p , q . Using the same notation as in Theorem 3.1, let
L = ( 1 1 p W X T X 1 q W M T M ) , Q = ( 1 1 p W X T X ) , N = 1 q W M T M . L=\begin{pmatrix}1\\ \frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}\mathbf{X}\\ \frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}\mathbf{M}\end{pmatrix},\qquad Q=\begin{pmatrix}1\\ \frac{1}{p}\mathbf{W}_{X}^{\mathsf{T}}\mathbf{X}\end{pmatrix},\qquad N=\frac{1}{q}\mathbf{W}_{M}^{\mathsf{T}}\mathbf{M}. L = 1 p 1 W X T X q 1 W M T M , Q = ( 1 p 1 W X T X ) , N = q 1 W M T M .
By the same population-level argument as in Theorem 3.1, applied separately under A = 1 A=1 A = 1 and A = 0 A=0 A = 0 , μ a , p , q \mu_{a,p,q} μ a , p , q admits the representation given in the corollary statement for each a ∈ { 0 , 1 } a\in\{0,1\} a ∈ { 0 , 1 } . It follows that
θ A T E − θ A T E , p , q = ( μ 1 − μ 1 , p , q ) − ( μ 0 − μ 0 , p , q ) , \theta_{\mathrm{ATE}}-\theta_{\mathrm{ATE},p,q}=(\mu_1-\mu_{1,p,q})-(\mu_0-\mu_{0,p,q}), θ ATE − θ ATE , p , q = ( μ 1 − μ 1 , p , q ) − ( μ 0 − μ 0 , p , q ) ,
so, by the triangle inequality,
∣ θ A T E − θ A T E , p , q ∣ ≤ ∣ μ 1 − μ 1 , p , q ∣ + ∣ μ 0 − μ 0 , p , q ∣ . \left|\theta_{\mathrm{ATE}}-\theta_{\mathrm{ATE},p,q}\right|\leq\left|\mu_1-\mu_{1,p,q}\right|+\left|\mu_0-\mu_{0,p,q}\right|. ∣ θ ATE − θ ATE , p , q ∣ ≤ ∣ μ 1 − μ 1 , p , q ∣ + ∣ μ 0 − μ 0 , p , q ∣ .
Applying Theorem 3.1 to a = 1 a=1 a = 1 and a = 0 a=0 a = 0 , there exist constants C 1 ′ , C 0 ′ > 0 C'_1,C'_0>0 C 1 ′ , C 0 ′ > 0 , independent of p p p and q q q , such that
∣ μ a − μ a , p , q ∣ ≤ C a ′ ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) ( 1 + 1 p ν min 2 ( H X ) ) , a ∈ { 0 , 1 } . \left|\mu_a-\mu_{a,p,q}\right|\leq C'_a\left(\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}+\frac{1}{q\nu_{\min}^{2}(\mathbf{H}_M)}\right)\left(1+\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}\right),\qquad a\in\{0,1\}. ∣ μ a − μ a , p , q ∣ ≤ C a ′ ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) ( 1 + p ν m i n 2 ( H X ) 1 ) , a ∈ { 0 , 1 } .
Combining the two bounds yields
∣ θ A T E − θ A T E , p , q ∣ ≤ ( C 1 ′ + C 0 ′ ) ( 1 p ν min 2 ( H X ) + 1 q ν min 2 ( H M ) ) ( 1 + 1 p ν min 2 ( H X ) ) . \left|\theta_{\mathrm{ATE}}-\theta_{\mathrm{ATE},p,q}\right|\leq(C'_1+C'_0)\left(\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}+\frac{1}{q\nu_{\min}^{2}(\mathbf{H}_M)}\right)\left(1+\frac{1}{p\nu_{\min}^{2}(\mathbf{H}_X)}\right). ∣ θ ATE − θ ATE , p , q ∣ ≤ ( C 1 ′ + C 0 ′ ) ( p ν m i n 2 ( H X ) 1 + q ν m i n 2 ( H M ) 1 ) ( 1 + p ν m i n 2 ( H X ) 1 ) .
As p p p and q q q grow large, the right-hand side converges to zero, so θ A T E , p , q → θ A T E \theta_{\mathrm{ATE},p,q}\to\theta_{\mathrm{ATE}} θ ATE , p , q → θ ATE as p ν min 2 ( H X ) → ∞ p\nu_{\min}^{2}(\mathbf{H}_X)\to\infty p ν m i n 2 ( H X ) → ∞ and q ν min 2 ( H M ) → ∞ q\nu_{\min}^{2}(\mathbf{H}_M)\to\infty q ν m i n 2 ( H M ) → ∞ .
Asymptotic Analysis
To prove Theorem 5.2, we first establish a few results that will be used in the main proof. Recall that FARMA uses two-fold cross-fitting. We consider one regression fold at a time, with the projection matrices estimated using the other fold. Within the regression fold, the treated units are used to estimate α ^ 1 \hat{\alpha}_1 α ^ 1 and γ ^ 1 \hat{\gamma}_1 γ ^ 1 , while the control units are used for the second-stage bridge regression. We derive the expansion for one fold and combine the two fold-specific estimators at the end.
For fold k k k , let n k t n_k^t n k t and n k c n_k^c n k c denote the numbers of treated and control units respectively. Since the two folds have approximately equal size and the treatment probabilities are bounded away from zero and one, n k t ≍ n n_k^t\asymp n n k t ≍ n , n k c ≍ n n_k^c\asymp n n k c ≍ n and n k ≍ n n_k\asymp n n k ≍ n . Thus, rates written in terms of n k t n_k^t n k t or n k c n_k^c n k c are of the same order as rates in n n n .
The supporting results below are used in the main proof. Lemmas C.1-C.5 give the bounds needed to control the error terms, while Lemma C.6 gives the expansion of γ ^ 1 \hat{\gamma}_1 γ ^ 1 . We use these results in the proof of Theorem 5.2.
Supporting Results
Proof of Proposition 5.1
Proof of Proposition 5.1. We first prove the result for H X \mathbf{H}_X H X . We write S X = Γ X Σ f X Γ X T \mathbf{S}_X=\mathbf{\Gamma}_X\mathbf{\Sigma}_{fX}\mathbf{\Gamma}_X^{\mathsf{T}} S X = Γ X Σ f X Γ X T and Σ X = S X + Σ u X \mathbf{\Sigma}_X=\mathbf{S}_X+\mathbf{\Sigma}_{uX} Σ X = S X + Σ u X . Since W X = p V X \mathbf{W}_X=\sqrt{p}\mathbf{V}_X W X = p V X ,
H X = 1 p W X T Γ X = 1 p V X T Γ X , H X T H X = 1 p Γ X T V X V X T Γ X = 1 p Γ X T P V X Γ X . \mathbf{H}_X=\frac{1}{p}\mathbf{W}_X^{\mathsf{T}}\mathbf{\Gamma}_X=\frac{1}{\sqrt{p}}\mathbf{V}_X^{\mathsf{T}}\mathbf{\Gamma}_X,\qquad\mathbf{H}_X^{\mathsf{T}}\mathbf{H}_X=\frac{1}{p}\mathbf{\Gamma}_X^{\mathsf{T}}\mathbf{V}_X\mathbf{V}_X^{\mathsf{T}}\mathbf{\Gamma}_X=\frac{1}{p}\mathbf{\Gamma}_X^{\mathsf{T}}\mathbf{P}_{V_X}\mathbf{\Gamma}_X. H X = p 1 W X T Γ X = p 1 V X T Γ X , H X T H X = p 1 Γ X T V X V X T Γ X = p 1 Γ X T P V X Γ X .
Therefore, it is enough to bound the minimum and maximum eigenvalues of H X T H X \mathbf{H}_X^{\mathsf{T}}\mathbf{H}_X H X T H X . For notational simplicity, throughout the proof we write n = n k n=n_k n = n k and relabel the observations in D k \mathcal{D}_k D k as i = 1 , 2 , ⋯ , n i=1,2,\cdots,n i = 1 , 2 , ⋯ , n . It is immediate from the property of the projection matrix:
ν max 2 ( H X ) = λ max ( 1 p Γ X T P V X Γ X ) ≤ λ max ( 1 p Γ X T Γ X ) ≤ C Γ . \nu_{\max}^{2}(\mathbf{H}_X)=\lambda_{\max}\left(\frac{1}{p}\mathbf{\Gamma}_X^{\mathsf{T}}\mathbf{P}_{V_X}\mathbf{\Gamma}_X\right)\leq\lambda_{\max}\left(\frac{1}{p}\mathbf{\Gamma}_X^{\mathsf{T}}\mathbf{\Gamma}_X\right)\leq C_{\Gamma}. ν m a x 2 ( H X ) = λ m a x ( p 1 Γ X T P V X Γ X ) ≤ λ m a x ( p 1 Γ X T Γ X ) ≤ C Γ .
Hence, ν max ( H X ) ≤ C Γ \nu_{\max}(\mathbf{H}_X)\leq\sqrt{C_{\Gamma}} ν m a x ( H X ) ≤ C Γ . Next, we establish the lower bound. Towards that end, first, it is immediate from Assumption 3.1 (iii) and (iv):
Σ f = π Σ f 1 + ( 1 − π ) Σ f 0 + π ( 1 − π ) ( μ 0 − μ 1 ) ( μ 0 − μ 1 ) T ⟹ c f ≤ λ min ( Σ f ) ≤ λ max ( Σ f ) ≤ C f . \mathbf{\Sigma}_f=\pi\mathbf{\Sigma}_{f1}+(1-\pi)\mathbf{\Sigma}_{f0}+\pi(1-\pi)(\mu_0-\mu_1)(\mu_0-\mu_1)^{\mathsf{T}}\Longrightarrow c_f\leq\lambda_{\min}(\mathbf{\Sigma}_f)\leq\lambda_{\max}(\mathbf{\Sigma}_f)\leq C_f. Σ f = π Σ f 1 + ( 1 − π ) Σ f 0 + π ( 1 − π ) ( μ 0 − μ 1 ) ( μ 0 − μ 1 ) T ⟹ c f ≤ λ m i n ( Σ f ) ≤ λ m a x ( Σ f ) ≤ C f .
Hence, using the fact that f X f_X f X is the first p ˉ \bar p p ˉ elements of f f f , we have:
c f ≤ λ min ( Σ f X ) ≤ λ max ( Σ f X ) ≤ C f . (24) c_f \le\lambda_{\min}(\Sigma_{f_X}) \le\lambda_{\max}(\Sigma_{f_X}) \le C_f . \tag*{(24)} c f ≤ λ m i n ( Σ f X ) ≤ λ m a x ( Σ f X ) ≤ C f . (24)
Next, consider S X = Γ X Σ f X Γ X T = var ( Γ X f X ) S_X = \Gamma_X\Sigma_{f_X}\Gamma_X^{\mathsf{T}} = \operatorname{var}(\Gamma_Xf_X) S X = Γ X Σ f X Γ X T = var ( Γ X f X ) . Clearly rank ( S X ) ≤ rank ( Σ f X ) ≤ p ˉ \operatorname{rank}(S_X) \le\operatorname{rank}(\Sigma_{f_X}) \le\bar p rank ( S X ) ≤ rank ( Σ f X ) ≤ p ˉ . Furthermore, S X S_X S X and Σ f X 1 / 2 Γ X T Γ X Σ f X 1 / 2 \Sigma_{f_X}^{1/2}\Gamma_X^{\mathsf{T}}\Gamma_X\Sigma_{f_X}^{1/2} Σ f X 1/2 Γ X T Γ X Σ f X 1/2 has same set of non-zero eigenvalues. Furthermore, from Assumption 3.2 and Equation (C.1), we have:
p c Γ c f I p ˉ ⪯ p c Γ Σ f X ⪯ p Σ f X 1 / 2 Γ X T Γ X Σ f X 1 / 2 p = Σ f X 1 / 2 Γ X T Γ X Σ f X 1 / 2 ⪯ p C Γ Σ f X ⪯ p C Γ C f I p ˉ . p c_\Gamma c_f I_{\bar p} \preceq p c_\Gamma\Sigma_{f_X} \preceq p\frac{\Sigma_{f_X}^{1/2}\Gamma_X^{\mathsf{T}}\Gamma_X\Sigma_{f_X}^{1/2}}{p} = \Sigma_{f_X}^{1/2}\Gamma_X^{\mathsf{T}}\Gamma_X\Sigma_{f_X}^{1/2} \preceq p C_\Gamma\Sigma_{f_X} \preceq p C_\Gamma C_f I_{\bar p}. p c Γ c f I p ˉ ⪯ p c Γ Σ f X ⪯ p p Σ f X 1/2 Γ X T Γ X Σ f X 1/2 = Σ f X 1/2 Γ X T Γ X Σ f X 1/2 ⪯ p C Γ Σ f X ⪯ p C Γ C f I p ˉ .
Therefore, the eigengap at p ˉ \bar p p ˉ satisfies
λ p ˉ ( S X ) − λ p ˉ + 1 ( S X ) = λ p ˉ ( S X ) ≥ p c . (25) \lambda_{\bar p}(S_X)-\lambda_{\bar p+1}(S_X)=\lambda_{\bar p}(S_X)\ge pc. \tag*{(25)} λ p ˉ ( S X ) − λ p ˉ + 1 ( S X ) = λ p ˉ ( S X ) ≥ p c . (25)
Finally, since S X = Γ X ( Σ f X Γ X T ) S_X = \Gamma_X(\Sigma_{f_X}\Gamma_X^{\mathsf{T}}) S X = Γ X ( Σ f X Γ X T ) , we have Col ( S X ) ⊆ Col ( Γ X ) \operatorname{Col}(S_X) \subseteq\operatorname{Col}(\Gamma_X) Col ( S X ) ⊆ Col ( Γ X ) . Since both spaces have dimension p ˉ \bar p p ˉ , it follows that Col ( S X ) = Col ( Γ X ) \operatorname{Col}(S_X) = \operatorname{Col}(\Gamma_X) Col ( S X ) = Col ( Γ X ) . Hence, the leading p ˉ \bar p p ˉ -dimensional eigenspace of S X S_X S X is Col ( Γ X ) \operatorname{Col}(\Gamma_X) Col ( Γ X ) .
Next, we show ∥ Σ ^ X − S X ∥ o p = o p ( p ) \|\hat{\Sigma}_X-S_X\|_{\mathrm{op}}=o_p(p) ∥ Σ ^ X − S X ∥ op = o p ( p ) where Σ X \Sigma_X Σ X is the sample covariance matrix of { X i } 1 ≤ i ≤ n \{X_i\}_{1\le i\le n} { X i } 1 ≤ i ≤ n . Towards that end, recall that X i = Γ X f X , i + u X , i X_i=\Gamma_Xf_{X,i}+u_{X,i} X i = Γ X f X , i + u X , i where both f X , i f_{X,i} f X , i and u X , i u_{X,i} u X , i are centered random variable (Assumption 3.1). An expansion of Σ ^ X − S X \hat{\Sigma}_X-S_X Σ ^ X − S X yields:
Σ ^ X − S X = 1 n ∑ i = 1 n X i X i T − x ˉ x ˉ T − S X = 1 n ∑ i = 1 n ( Γ X f X , i + u X , i ) ( Γ X f X , i + u X , i ) T − x ˉ x ˉ T − S X = Γ X ( 1 n ∑ i = 1 n f X , i f X , i T − Σ f X ) Γ X T + ( 1 n ∑ i = 1 n u X , i u X , i T − Σ u X ) + Γ X 1 n ∑ i = 1 n f X , i u X , i T + ( Γ X 1 n ∑ i = 1 n f X , i u X , i T ) T + Σ u X − x ˉ x ˉ T = : S ( 1 ) + S ( 2 ) + S ( 3 ) + ( S ( 3 ) ) T + Σ u X − x ˉ x ˉ T . (26) \begin{aligned}
\hat{\Sigma}_X-S_X
&=\frac{1}{n}\sum_{i=1}^{n}X_iX_i^{\mathsf{T}}-\bar x\bar x^{\mathsf{T}}-S_X\\
&=\frac{1}{n}\sum_{i=1}^{n}(\Gamma_Xf_{X,i}+u_{X,i})(\Gamma_Xf_{X,i}+u_{X,i})^{\mathsf{T}}-\bar x\bar x^{\mathsf{T}}-S_X\\
&=\Gamma_X\left(\frac{1}{n}\sum_{i=1}^{n}f_{X,i}f_{X,i}^{\mathsf{T}}-\Sigma_{f_X}\right)\Gamma_X^{\mathsf{T}}
+\left(\frac{1}{n}\sum_{i=1}^{n}u_{X,i}u_{X,i}^{\mathsf{T}}-\Sigma_{u_X}\right)\\
&\quad+\Gamma_X\frac{1}{n}\sum_{i=1}^{n}f_{X,i}u_{X,i}^{\mathsf{T}}
+\left(\Gamma_X\frac{1}{n}\sum_{i=1}^{n}f_{X,i}u_{X,i}^{\mathsf{T}}\right)^{\mathsf{T}}
+\Sigma_{u_X}-\bar x\bar x^{\mathsf{T}}\\
&=:S^{(1)}+S^{(2)}+S^{(3)}+(S^{(3)})^{\mathsf{T}}+\Sigma_{u_X}-\bar x\bar x^{\mathsf{T}} . \tag*{(26)}
\end{aligned} Σ ^ X − S X = n 1 i = 1 ∑ n X i X i T − x ˉ x ˉ T − S X = n 1 i = 1 ∑ n ( Γ X f X , i + u X , i ) ( Γ X f X , i + u X , i ) T − x ˉ x ˉ T − S X = Γ X ( n 1 i = 1 ∑ n f X , i f X , i T − Σ f X ) Γ X T + ( n 1 i = 1 ∑ n u X , i u X , i T − Σ u X ) + Γ X n 1 i = 1 ∑ n f X , i u X , i T + ( Γ X n 1 i = 1 ∑ n f X , i u X , i T ) T + Σ u X − x ˉ x ˉ T =: S ( 1 ) + S ( 2 ) + S ( 3 ) + ( S ( 3 ) ) T + Σ u X − x ˉ x ˉ T . (26)
Let F X = [ f X , 1 , … , f X , n ] T F_X=[f_{X,1},\ldots,f_{X,n}]^{\mathsf{T}} F X = [ f X , 1 , … , f X , n ] T and U X = [ u X , 1 , … , u X , n ] T U_X=[u_{X,1},\ldots,u_{X,n}]^{\mathsf{T}} U X = [ u X , 1 , … , u X , n ] T . We bound each term in (C.3) separately.
Bound for S ( 1 ) S^{(1)} S ( 1 ) . Define k i = Σ f X − 1 / 2 f X , i k_i=\Sigma_{f_X}^{-1/2}f_{X,i} k i = Σ f X − 1/2 f X , i . By Assumption 3.1 (i) and (iii), k i k_i k i are independent, with E ( k i ) = 0 \mathbb{E}(k_i)=0 E ( k i ) = 0 and var ( k i ) = I p ˉ \operatorname{var}(k_i)=I_{\bar p} var ( k i ) = I p ˉ . To check sub-Gaussianity, for any unit vector v ∈ R p ˉ v\in\mathbb{R}^{\bar p} v ∈ R p ˉ ,
∥ v T k i ∥ ψ 2 = ∥ v T Σ f X − 1 / 2 f X , i ∥ ψ 2 = ∥ ( Σ f X − 1 / 2 ) T v ) T f X , i ∥ ψ 2 ≤ 1 c f ∥ f X ∥ ψ 2 ≤ C . \|v^{\mathsf{T}}k_i\|_{\psi_2}
=\|v^{\mathsf{T}}\Sigma_{f_X}^{-1/2}f_{X,i}\|_{\psi_2}
=\|(\Sigma_{f_X}^{-1/2})^{\mathsf{T}}v)^{\mathsf{T}}f_{X,i}\|_{\psi_2}
\le\frac{1}{\sqrt{c_f}}\|f_X\|_{\psi_2}\le C. ∥ v T k i ∥ ψ 2 = ∥ v T Σ f X − 1/2 f X , i ∥ ψ 2 = ∥ ( Σ f X − 1/2 ) T v ) T f X , i ∥ ψ 2 ≤ c f 1 ∥ f X ∥ ψ 2 ≤ C .
Here, in the second-to-last inequality, we use the bound from Equation (C.1), and in the last inequality we use the fact that f X f_X f X is sub-Gaussian (Assumption 5.1). Hence k i k_i k i ’s are i.i.d. centered isotropic sub-Gaussian random vectors. Let K X = [ k 1 , … , k n ] T K_X=[k_1,\ldots,k_n]^{\mathsf{T}} K X = [ k 1 , … , k n ] T . Since f X , i = Σ f X 1 / 2 k i f_{X,i}=\Sigma_{f_X}^{1/2}k_i f X , i = Σ f X 1/2 k i , we have F X = K X Σ f X 1 / 2 F_X=K_X\Sigma_{f_X}^{1/2} F X = K X Σ f X 1/2 . Hence, we have
∥ 1 n F X T F X − Σ f X ∥ o p = ∥ Σ f X 1 / 2 ( 1 n K X T K X − I p ˉ ) Σ f X 1 / 2 ∥ o p ≤ C f ∥ 1 n K X T K X − I p ˉ ∥ o p . (27) \left\|\frac{1}{n}F_X^{\mathsf{T}}F_X-\Sigma_{f_X}\right\|_{\mathrm{op}}
=\left\|\Sigma_{f_X}^{1/2}\left(\frac{1}{n}K_X^{\mathsf{T}}K_X-I_{\bar p}\right)\Sigma_{f_X}^{1/2}\right\|_{\mathrm{op}}
\le C_f\left\|\frac{1}{n}K_X^{\mathsf{T}}K_X-I_{\bar p}\right\|_{\mathrm{op}}. \tag*{(27)} n 1 F X T F X − Σ f X op = Σ f X 1/2 ( n 1 K X T K X − I p ˉ ) Σ f X 1/2 op ≤ C f n 1 K X T K X − I p ˉ op . (27)
Using the Equation (4.27) in the proof of Theorem 4.6.1 of Vershynin [39 ] applied to K X K_X K X , we have
P ( ∥ 1 n K X T K X − I p ˉ ∥ o p > C K δ t , 1 ) ≤ 2 e − t , δ t , 1 = C ( p ˉ + t n + p ˉ + t n ) . \mathbb{P}\left(\left\|\frac{1}{n}K_X^{\mathsf{T}}K_X-I_{\bar p}\right\|_{\mathrm{op}}>C_K\delta_{t,1}\right)\le2e^{-t},\qquad\delta_{t,1}=C\left(\sqrt{\frac{\bar p+t}{n}}+\frac{\bar p+t}{n}\right). P ( n 1 K X T K X − I p ˉ op > C K δ t , 1 ) ≤ 2 e − t , δ t , 1 = C ( n p ˉ + t + n p ˉ + t ) .
Call the complementary event A 1 , t A_{1,t} A 1 , t . One A 1 , t A_{1,t} A 1 , t , we have:
∥ S ( 1 ) ∥ o p = ∥ Γ X ( 1 n F X T F X − Σ f X ) Γ X T ∥ o p ≤ ∥ Γ X ∥ o p 2 ∥ 1 n F X T F X − Σ f X ∥ o p ≤ p C K C C f δ t , 1 : = C 1 p δ t , 1 . \begin{aligned}
\|S^{(1)}\|_{\mathrm{op}}
&=\left\|\Gamma_X\left(\frac{1}{n}F_X^{\mathsf{T}}F_X-\Sigma_{f_X}\right)\Gamma_X^{\mathsf{T}}\right\|_{\mathrm{op}}\\
&\le\|\Gamma_X\|_{\mathrm{op}}^2\left\|\frac{1}{n}F_X^{\mathsf{T}}F_X-\Sigma_{f_X}\right\|_{\mathrm{op}}\\
&\le p\,C_K C C_f\delta_{t,1}:=C_1p\delta_{t,1}.
\end{aligned} ∥ S ( 1 ) ∥ op = Γ X ( n 1 F X T F X − Σ f X ) Γ X T op ≤ ∥ Γ X ∥ op 2 n 1 F X T F X − Σ f X op ≤ p C K C C f δ t , 1 := C 1 p δ t , 1 .
Bound for S ( 2 ) S^{(2)} S ( 2 ) . Define l i = Σ u X − 1 / 2 u X , i l_i = \Sigma_{u_X}^{-1/2}u_{X,i} l i = Σ u X − 1/2 u X , i . By Assumptions 3.1(i)-(ii), 3.1(v), and 5.1(i), the vectors l i l_i l i are independent, mean-zero, isotropic sub-Gaussian vectors. Let L X = [ l 1 , … , l n ] ⊤ L_X = [l_1,\ldots,l_n]^\top L X = [ l 1 , … , l n ] ⊤ . Using this, we have:
∥ S ( 2 ) ∥ o p = ∥ 1 n U X ⊤ U X − Σ u X ∥ o p = ∥ Σ u X 1 / 2 ( 1 n L X ⊤ L X − I p ) Σ u X 1 / 2 ∥ o p ≤ ∥ Σ u X ∥ o p ∥ 1 n L X ⊤ L X − I p ∥ o p ≤ C U ∥ 1 n L X ⊤ L X − I p ∥ o p . (28) \begin{aligned}
\left\|S^{(2)}\right\|_{\mathrm{op}} &= \left\|\frac{1}{n}U_X^\top U_X-\Sigma_{u_X}\right\|_{\mathrm{op}} = \left\|\Sigma_{u_X}^{1/2}\left(\frac{1}{n}L_X^\top L_X-I_p\right)\Sigma_{u_X}^{1/2}\right\|_{\mathrm{op}} \\
&\le\left\|\Sigma_{u_X}\right\|_{\mathrm{op}}\left\|\frac{1}{n}L_X^\top L_X-I_p\right\|_{\mathrm{op}} \\
&\le C_U\left\|\frac{1}{n}L_X^\top L_X-I_p\right\|_{\mathrm{op}}. \tag*{(28)}
\end{aligned} S ( 2 ) op = n 1 U X ⊤ U X − Σ u X op = Σ u X 1/2 ( n 1 L X ⊤ L X − I p ) Σ u X 1/2 op ≤ ∥ Σ u X ∥ op n 1 L X ⊤ L X − I p op ≤ C U n 1 L X ⊤ L X − I p op . (28)
Another application of Equation (4.27) in the proof of Theorem 4.6.1 of Vershynin [39 ] to the n × p n \times p n × p matrix L X L_X L X yields, on an event A 2 , t A_{2,t} A 2 , t where P ( A 2 , t ) ≥ 1 − 2 e − t \mathbb{P}(A_{2,t}) \ge1-2e^{-t} P ( A 2 , t ) ≥ 1 − 2 e − t :
∥ 1 n L X ⊤ L X − I p ∥ o p ≤ C L ( p + t n + p + t n ) = : C L δ t , 2 . \left\|\frac{1}{n}L_X^\top L_X-I_p\right\|_{\mathrm{op}} \le C_L\left(\sqrt{\frac{p+t}{n}}+\frac{p+t}{n}\right) =: C_L\delta_{t,2}. n 1 L X ⊤ L X − I p op ≤ C L ( n p + t + n p + t ) =: C L δ t , 2 .
Consequently, on this event, we have ∥ S ( 2 ) ∥ o p ≤ C U C L δ t , 2 = : C 2 δ t , 2 \left\|S^{(2)}\right\|_{\mathrm{op}} \le C_U C_L\delta_{t,2}=:C_2\delta_{t,2} S ( 2 ) op ≤ C U C L δ t , 2 =: C 2 δ t , 2 .
Bound for S ( 3 ) S^{(3)} S ( 3 ) . Again, by applying Theorem 4.6.1 of Vershynin [39 ] on K X K_X K X and L X L_X L X (as they have isotropic, centered sub-Gaussian rows), we have, on an event A 3 , t A_{3,t} A 3 , t , with P ( A 3 , t ) ≥ 1 − C e − t \mathbb{P}(A_{3,t}) \ge1-Ce^{-t} P ( A 3 , t ) ≥ 1 − C e − t :
∥ K X ∥ o p ≤ C ( n + p ˉ + t ) , ∥ L X ∥ o p ≤ C ( n + p + t ) . \left\|K_X\right\|_{\mathrm{op}} \le C(\sqrt{n}+\sqrt{\bar p}+\sqrt{t}), \qquad\left\|L_X\right\|_{\mathrm{op}} \le C(\sqrt{n}+\sqrt{p}+\sqrt{t}). ∥ K X ∥ op ≤ C ( n + p ˉ + t ) , ∥ L X ∥ op ≤ C ( n + p + t ) .
Therefore, on this event:
∥ S ( 3 ) ∥ o p = ∥ Γ X 1 n F X ⊤ U X ∥ o p ≤ ∥ Γ X ∥ o p 1 n ∥ F X ∥ o p ∥ U X ∥ o p ≤ C 3 p n ( n + t ) ( n + p + t ) = C 3 p ( 1 + t n ) ( 1 + p n + t n ) = : C 3 δ t , 3 . (29) \begin{aligned}
\left\|S^{(3)}\right\|_{\mathrm{op}} &= \left\|\Gamma_X\frac{1}{n}F_X^\top U_X\right\|_{\mathrm{op}} \le\left\|\Gamma_X\right\|_{\mathrm{op}}\frac{1}{n}\left\|F_X\right\|_{\mathrm{op}}\left\|U_X\right\|_{\mathrm{op}} \le C_3\frac{\sqrt{p}}{n}(\sqrt{n}+\sqrt{t})(\sqrt{n}+\sqrt{p}+\sqrt{t}) \\
&= C_3\sqrt{p}\left(1+\sqrt{\frac{t}{n}}\right)\left(1+\sqrt{\frac{p}{n}}+\sqrt{\frac{t}{n}}\right)=:C_3\delta_{t,3}. \tag*{(29)}
\end{aligned} S ( 3 ) op = Γ X n 1 F X ⊤ U X op ≤ ∥ Γ X ∥ op n 1 ∥ F X ∥ op ∥ U X ∥ op ≤ C 3 n p ( n + t ) ( n + p + t ) = C 3 p ( 1 + n t ) ( 1 + n p + n t ) =: C 3 δ t , 3 . (29)
Therefore, going back to Equation (C.3), to bound ∥ Σ ^ X − S X ∥ o p \left\|\widehat{\Sigma}_X-S_X\right\|_{\mathrm{op}} Σ X − S X op , we need to bound ∥ Σ u X ∥ o p \left\|\Sigma_{u_X}\right\|_{\mathrm{op}} ∥ Σ u X ∥ op and ∥ x ˉ x ˉ ⊤ ∥ o p = ∥ x ˉ ∥ 2 2 \left\|\bar{x}\bar{x}^{\top}\right\|_{\mathrm{op}}=\|\bar{x}\|_2^2 x ˉ x ˉ ⊤ op = ∥ x ˉ ∥ 2 2 . For the former, we use ∥ Σ u X ∥ o p ≤ C u \left\|\Sigma_{u_X}\right\|_{\mathrm{op}}\le C_u ∥ Σ u X ∥ op ≤ C u (Assumption 3.1(v)). For the latter, note that, x ˉ = Γ X f ˉ X + u ˉ X \bar{x}=\Gamma_X\bar{f}_X+\bar{u}_X x ˉ = Γ X f ˉ X + u ˉ X . We therefore bound f ˉ X \bar{f}_X f ˉ X and u ˉ X \bar{u}_X u ˉ X separately. As f X , i ∈ R p ˉ f_{X,i}\in\mathbb{R}^{\bar p} f X , i ∈ R p ˉ are i.i.d., centered sub-Gaussian random variables, we have, on an event A 41 , t A_{41,t} A 41 , t , with P ( A 41 , t ) ≥ 1 − C e − t \mathbb{P}(A_{41,t})\ge1-Ce^{-t} P ( A 41 , t ) ≥ 1 − C e − t :
∥ f ˉ X ∥ 2 ≤ C p ˉ + t n . \|\bar{f}_X\|_2\le C\sqrt{\frac{\bar p+t}{n}}. ∥ f ˉ X ∥ 2 ≤ C n p ˉ + t .
Now consider u ˉ X \bar{u}_X u ˉ X . Now given any v ∈ S p − 1 v\in S^{p-1} v ∈ S p − 1 , we know v ⊤ u X v^\top u_X v ⊤ u X is a centered sub-Gaussian random variable. Therefore, we have,
P ( ∣ v ⊤ u ˉ X ∣ ≥ t ) ≤ 2 e − c n t 2 \mathbb{P}\left(\left|v^\top\bar{u}_X\right|\ge t\right)\le2e^{-cnt^2} P ( v ⊤ u ˉ X ≥ t ) ≤ 2 e − c n t 2
Next, consider A 1 / 2 A_{1/2} A 1/2 , a 1 / 2 1/2 1/2 -net of S p − 1 S^{p-1} S p − 1 , i.e., for any v ∈ S p − 1 v\in S^{p-1} v ∈ S p − 1 , there exists v i ∈ A 1 / 2 v_i\in A_{1/2} v i ∈ A 1/2 such that ∥ v − v i ∥ 2 ≤ 1 / 2 \|v-v_i\|_2\le1/2 ∥ v − v i ∥ 2 ≤ 1/2 . Then ∣ A 1 / 2 ∣ ≤ C 1 p |A_{1/2}|\le C_1^p ∣ A 1/2 ∣ ≤ C 1 p for some constant C 1 > 0 C_1>0 C 1 > 0 . Therefore,
P ( max v ∈ A 1 / 2 ∣ v ⊤ u ˉ X ∣ ≥ t ) ≤ 2 C 1 p e − c n t 2 = 2 e p log C 1 − c n t 2 . \mathbb{P}\left(\max_{v\in A_{1/2}}|v^\top\bar{u}_X|\ge t\right)\le2C_1^p e^{-cnt^2}=2e^{p\log C_1-cnt^2}. P ( v ∈ A 1/2 max ∣ v ⊤ u ˉ X ∣ ≥ t ) ≤ 2 C 1 p e − c n t 2 = 2 e p l o g C 1 − c n t 2 .
Finally, using that given v ∈ S p − 1 v\in S^{p-1} v ∈ S p − 1 , there exists ω ( v ) ∈ A 1 / 2 \omega(v)\in A_{1/2} ω ( v ) ∈ A 1/2 such that ∥ v − ω ( v ) ∥ 2 ≤ 1 / 2 \|v-\omega(v)\|_2\le1/2 ∥ v − ω ( v ) ∥ 2 ≤ 1/2 , we have:
∥ u ˉ X ∥ 2 = sup v ∈ S p − 1 ∣ v ⊤ u ˉ X ∣ = sup v ∈ S p − 1 ∣ ( v − ω ( v ) + ω ( v ) ) ⊤ u ˉ X ∣ ≤ 1 2 ∥ u ˉ X ∥ 2 + sup v ∈ A 1 / 2 ∣ v ⊤ u ˉ X ∣ . \|\bar{u}_X\|_2=\sup_{v\in S^{p-1}}|v^\top\bar{u}_X|=\sup_{v\in S^{p-1}}|(v-\omega(v)+\omega(v))^\top\bar{u}_X|\le\frac{1}{2}\|\bar{u}_X\|_2+\sup_{v\in A_{1/2}}|v^\top\bar{u}_X|. ∥ u ˉ X ∥ 2 = v ∈ S p − 1 sup ∣ v ⊤ u ˉ X ∣ = v ∈ S p − 1 sup ∣ ( v − ω ( v ) + ω ( v ) ) ⊤ u ˉ X ∣ ≤ 2 1 ∥ u ˉ X ∥ 2 + v ∈ A 1/2 sup ∣ v ⊤ u ˉ X ∣.
Hence, ∥ u ˉ X ∥ 2 ≤ 2 sup { ∣ v ⊤ u ˉ X ∣ : v ∈ A 1 / 2 } \|\bar{u}_X\|_2\le2\sup\{|v^\top\bar{u}_X|:v\in A_{1/2}\} ∥ u ˉ X ∥ 2 ≤ 2 sup { ∣ v ⊤ u ˉ X ∣ : v ∈ A 1/2 } . Therefore,
P ( ∥ u ˉ X ∥ 2 > t ) ≤ 2 e p log C 1 − 1 4 c n t 2 ⟹ P ( ∥ u ˉ X ∥ 2 > 2 t + p log C 1 c n ) ≤ 2 e − t . \mathbb{P}(\|\bar{u}_X\|_2>t)\le2e^{p\log C_1-\frac{1}{4}cnt^2}\ \Longrightarrow\ \mathbb{P}\left(\|\bar{u}_X\|_2>2\sqrt{\frac{t+p\log C_1}{cn}}\right)\le2e^{-t}. P ( ∥ u ˉ X ∥ 2 > t ) ≤ 2 e p l o g C 1 − 4 1 c n t 2 ⟹ P ( ∥ u ˉ X ∥ 2 > 2 c n t + p log C 1 ) ≤ 2 e − t .
Call the complementary event A 42 , t A_{42,t} A 42 , t . Now, using x ˉ = Γ X f ˉ X + u ˉ X \bar{x}=\Gamma_X\bar{f}_X+\bar{u}_X x ˉ = Γ X f ˉ X + u ˉ X , we have on A 4 , t = A 41 , t ∩ A 42 , t A_{4,t}=A_{41,t}\cap A_{42,t} A 4 , t = A 41 , t ∩ A 42 , t (with P ( A 4 , t ) ≥ 1 − C ′ e − t \mathbb{P}(A_{4,t})\ge1-C'e^{-t} P ( A 4 , t ) ≥ 1 − C ′ e − t for some constant C ′ > 0 C'>0 C ′ > 0 ):
∥ x ˉ x ˉ ⊤ ∥ o p = ∥ x ˉ ∥ 2 2 ≤ 2 ∥ Γ X f ˉ X ∥ 2 2 + 2 ∥ u ˉ X ∥ 2 2 ≤ 2 ∥ Γ X ∥ o p 2 ∥ f ˉ X ∥ 2 2 + 2 ∥ u ˉ X ∥ 2 2 ≤ C 4 ( p ( p ˉ + t ) n + p + t n ) ≤ C 4 p ( 1 + t ) n . \|\bar{x}\bar{x}^{\top}\|_{\mathrm{op}}=\|\bar{x}\|_2^2\le2\|\Gamma_X\bar{f}_X\|_2^2+2\|\bar{u}_X\|_2^2\le2\|\Gamma_X\|_{\mathrm{op}}^2\|\bar{f}_X\|_2^2+2\|\bar{u}_X\|_2^2\le C_4\left(\frac{p(\bar p+t)}{n}+\frac{p+t}{n}\right)\le C_4\frac{p(1+t)}{n}. ∥ x ˉ x ˉ ⊤ ∥ op = ∥ x ˉ ∥ 2 2 ≤ 2∥ Γ X f ˉ X ∥ 2 2 + 2∥ u ˉ X ∥ 2 2 ≤ 2∥ Γ X ∥ op 2 ∥ f ˉ X ∥ 2 2 + 2∥ u ˉ X ∥ 2 2 ≤ C 4 ( n p ( p ˉ + t ) + n p + t ) ≤ C 4 n p ( 1 + t ) .
Define A n = ⋂ j = 1 4 A j , t A_n=\bigcap_{j=1}^4 A_{j,t} A n = ⋂ j = 1 4 A j , t with t = K log n t=K\log n t = K log n for some large constant K > 0 K>0 K > 0 . It is immediate that P ( A n ) ≥ 1 − n − K 1 P(A_n)\ge1-n^{-K_1} P ( A n ) ≥ 1 − n − K 1 for some constant K 1 > 0 K_1>0 K 1 > 0 . Then, on the event A n A_n A n , we have, for C ≥ max { C j : 1 ≤ j ≤ 4 } C\ge\max\{C_j:1\le j\le4\} C ≥ max { C j : 1 ≤ j ≤ 4 } :
∥ Σ ^ X − S X ∥ o p ≤ C { p ˉ + K log n n + p ˉ + K log n n + p + K log n n + p + K log n n + p ( 1 + K log n n ) ( 1 + p ˉ n + K log n n ) + p ( 1 + K log n ) n } ≤ C p log n n , (30) \left\|\widehat{\Sigma}_X-S_X\right\|_{\mathrm{op}}\le C\left\{\sqrt{\frac{\bar p+K\log n}{n}}+\sqrt{\frac{\bar p+K\log n}{n}}+\sqrt{\frac{p+K\log n}{n}}+\sqrt{\frac{p+K\log n}{n}}+\sqrt p\left(1+\sqrt{\frac{K\log n}{n}}\right)\left(1+\sqrt{\frac{\bar p}{n}}+\sqrt{\frac{K\log n}{n}}\right)+\frac{p(1+K\log n)}{n}\right\}\le Cp\sqrt{\frac{\log n}{n}}, \tag*{(30)} Σ X − S X op ≤ C { n p ˉ + K log n + n p ˉ + K log n + n p + K log n + n p + K log n + p ( 1 + n K log n ) ( 1 + n p ˉ + n K log n ) + n p ( 1 + K log n ) } ≤ C p n log n , (30)
where we absorb all constants in C C C . This completes the proof of the upper bound on ∥ Σ ^ X − S X ∥ o p \left\|\widehat{\Sigma}_X-S_X\right\|_{\mathrm{op}} Σ X − S X op . For the rest of the proof, we use the notation P A P_A P A to denote the projection matrix on the column space of A A A . P V X , p ˉ P_{V_X,\bar p} P V X , p ˉ denotes the projection onto the leading p ˉ \bar p p ˉ -dimensional eigenspace of Σ ^ X \widehat{\Sigma}_X Σ X . Now using the fact that λ p ˉ ( S X ) − λ p ˉ + 1 ( S X ) ≥ p c Γ c f \lambda_{\bar p}(S_X)-\lambda_{\bar p+1}(S_X)\ge pc\Gamma c_f λ p ˉ ( S X ) − λ p ˉ + 1 ( S X ) ≥ p c Γ c f (Equation (C.2)), an application of Davis-Kahan sin Θ \Theta Θ theorem (Theorem 1 of Yu et al. (2015)) yields, on A n A_n A n :
∥ P V X , p ˉ − P S X ∥ o p = ∥ P V X , p ˉ − P Γ X ∥ o p ≤ 2 ∥ Σ ^ X − S X ∥ o p λ p ˉ ( S X ) − λ p ˉ + 1 ( S X ) ≤ 2 C p log n / n p c Γ c f = 2 C c Γ c f log n n . \left\|P_{V_X,\bar p}-P_{S_X}\right\|_{\mathrm{op}}=\left\|P_{V_X,\bar p}-P_{\Gamma_X}\right\|_{\mathrm{op}}\le\frac{2\left\|\widehat{\Sigma}_X-S_X\right\|_{\mathrm{op}}}{\lambda_{\bar p}(S_X)-\lambda_{\bar p+1}(S_X)}\le\frac{2Cp\sqrt{\log n/n}}{pc\Gamma c_f}=\frac{2C}{c\Gamma c_f}\sqrt{\frac{\log n}{n}}. ∥ P V X , p ˉ − P S X ∥ op = ∥ P V X , p ˉ − P Γ X ∥ op ≤ λ p ˉ ( S X ) − λ p ˉ + 1 ( S X ) 2 Σ X − S X op ≤ p c Γ c f 2 C p log n / n = c Γ c f 2 C n log n .
In the first equality, we have used the fact that columns space of S X S_X S X is same as that of Γ X \Gamma_X Γ X . As a consequence, we have, on A n A_n A n :
∥ 1 p Γ X ⊤ ( P V X , p ˉ − P Γ X ) Γ X ∥ o p ≤ λ max ( Γ X ⊤ Γ X p ) ∥ P V X , p ˉ − P Γ X ∥ o p ≤ 2 C C Γ c Γ c f log n n . \left\|\frac{1}{p}\Gamma_X^\top(P_{V_X,\bar p}-P_{\Gamma_X})\Gamma_X\right\|_{\mathrm{op}}\le\lambda_{\max}\left(\frac{\Gamma_X^\top\Gamma_X}{p}\right)\left\|P_{V_X,\bar p}-P_{\Gamma_X}\right\|_{\mathrm{op}}\le\frac{2CC_\Gamma}{c\Gamma c_f}\sqrt{\frac{\log n}{n}}. p 1 Γ X ⊤ ( P V X , p ˉ − P Γ X ) Γ X op ≤ λ m a x ( p Γ X ⊤ Γ X ) ∥ P V X , p ˉ − P Γ X ∥ op ≤ c Γ c f 2 C C Γ n log n .
Now, we present the lower bound on ν min ( H X ) \nu_{\min}(H_X) ν m i n ( H X ) .
ν min 2 ( H X ) = λ min ( 1 p Γ X ⊤ P V X Γ X ) ≥ λ min ( 1 p Γ X ⊤ P V X , p ˉ Γ X ) ≥ λ min ( 1 p Γ X ⊤ Γ X ) − ∥ 1 p Γ X ⊤ ( P V X , p ˉ − P Γ X ) Γ X ∥ o p ≥ c Γ − 2 C C Γ , X c Γ c f log n n ≥ c Γ 2 . \begin{aligned}
\nu_{\min}^2(H_X)=\lambda_{\min}\left(\frac{1}{p}\Gamma_X^\top P_{V_X}\Gamma_X\right)\ge\lambda_{\min}\left(\frac{1}{p}\Gamma_X^\top P_{V_X,\bar p}\Gamma_X\right) \\
&\ge\lambda_{\min}\left(\frac{1}{p}\Gamma_X^\top\Gamma_X\right)-\left\|\frac{1}{p}\Gamma_X^\top(P_{V_X,\bar p}-P_{\Gamma_X})\Gamma_X\right\|_{\mathrm{op}} \\
&\ge c\Gamma-\frac{2CC_{\Gamma,X}}{c\Gamma c_f}\sqrt{\frac{\log n}{n}}\ge\frac{c\Gamma}{2}.
\end{aligned} ν m i n 2 ( H X ) = λ m i n ( p 1 Γ X ⊤ P V X Γ X ) ≥ λ m i n ( p 1 Γ X ⊤ P V X , p ˉ Γ X ) ≥ λ m i n ( p 1 Γ X ⊤ Γ X ) − p 1 Γ X ⊤ ( P V X , p ˉ − P Γ X ) Γ X op ≥ c Γ − c Γ c f 2 C C Γ , X n log n ≥ 2 c Γ .
The last inequality holds for all large n n n . This completes the proof.
For the mediator block, E [ f M ] \mathbb{E}[f_M] E [ f M ] need not be zero. Since Σ ^ M \widehat{\Sigma}_M Σ M is computed after demeaning, we apply the same argument to f M − E [ f M ] f_M-\mathbb{E}[f_M] f M − E [ f M ] . By Assumption 3.1(iii)–(iv), the eigenvalues of Cov ( f M ) \operatorname{Cov}(f_M) Cov ( f M ) are bounded away from zero and infinity. Let us assume that A M , n A_{M,n} A M , n denote the event obtained by applying the preceding argument to the mediator block with ( q , Γ M , Cov ( f M ) , Σ u M , q ˉ ) (q,\Gamma_M,\operatorname{Cov}(f_M),\Sigma_{u_M},\bar q) ( q , Γ M , Cov ( f M ) , Σ u M , q ˉ ) in place of ( p , Γ X , Σ f X , Σ u X , p ˉ ) (p,\Gamma_X,\Sigma_{f_X},\Sigma_{u_X},\bar p) ( p , Γ X , Σ f X , Σ u X , p ˉ ) using t = K log n t=K\log n t = K log n . Then, for sufficiently large n n n , we have P ( A M , n ) ≥ 1 − C n − K 1 P(A_{M,n})\ge1-Cn^{-K_1} P ( A M , n ) ≥ 1 − C n − K 1 , and on A M , n A_{M,n} A M , n , c M ≤ ν min ( H M ) ≤ ν max ( H M ) ≤ C M c_M\le\nu_{\min}(H_M)\le\nu_{\max}(H_M)\le C_M c M ≤ ν m i n ( H M ) ≤ ν m a x ( H M ) ≤ C M for some positive constants c M c_M c M and C M C_M C M .
Recall that the corresponding bounds for H X H_X H X hold on the event A n A_n A n as above. By the union bound, P ( A n ∩ A M , n ) ≥ 1 − ( 1 + C ) n − K 1 P(A_n\cap A_{M,n})\ge1-(1+C)n^{-K_1} P ( A n ∩ A M , n ) ≥ 1 − ( 1 + C ) n − K 1 . Thus, we have that
c ≤ ν min ( H X ) ≤ ν max ( H X ) ≤ C , c ≤ ν min ( H M ) ≤ ν max ( H M ) ≤ C c\le\nu_{\min}(H_X)\le\nu_{\max}(H_X)\le C,\qquad c\le\nu_{\min}(H_M)\le\nu_{\max}(H_M)\le C c ≤ ν m i n ( H X ) ≤ ν m a x ( H X ) ≤ C , c ≤ ν m i n ( H M ) ≤ ν m a x ( H M ) ≤ C
hold with probability at least 1 − n − K 1 1-n^{-K_1} 1 − n − K 1 for some K 1 > 0 K_1>0 K 1 > 0 and all sufficiently large n n n . This completes the proof. □
Lemma C.1 (Operator norm of the weighting matrix). Let W = diag ( p − 1 W X , q − 1 W M ) \mathbf{W}=\operatorname{diag}(p^{-1}\mathbf{W}_X,q^{-1}\mathbf{W}_M) W = diag ( p − 1 W X , q − 1 W M ) , where W X = p V X \mathbf{W}_X=\sqrt p\mathbf{V}_X W X = p V X and W M = q V M \mathbf{W}_M=\sqrt q\mathbf{V}_M W M = q V M , with V X ⊤ V X = I p ~ \mathbf{V}_X^\top\mathbf{V}_X=I_{\tilde p} V X ⊤ V X = I p ~ and V M ⊤ V M = I q ~ \mathbf{V}_M^\top\mathbf{V}_M=I_{\tilde q} V M ⊤ V M = I q ~ . Then, ∥ W ∥ o p 2 = ( p ∧ q ) − 1 \|\mathbf{W}\|_{\mathrm{op}}^2=(p\wedge q)^{-1} ∥ W ∥ op 2 = ( p ∧ q ) − 1 .
Proof. Since W X = p V X \mathbf{W}_X=\sqrt p\mathbf{V}_X W X = p V X and W M = q V M \mathbf{W}_M=\sqrt q\mathbf{V}_M W M = q V M , we have W = diag ( p − 1 / 2 V X , q − 1 / 2 V M ) \mathbf{W}=\operatorname{diag}(p^{-1/2}\mathbf{V}_X,q^{-1/2}\mathbf{V}_M) W = diag ( p − 1/2 V X , q − 1/2 V M ) . Because V X \mathbf{V}_X V X and V M \mathbf{V}_M V M have orthonormal columns, we have that
∥ p − 1 / 2 V X ∥ o p 2 = 1 p , ∥ q − 1 / 2 V M ∥ o p 2 = 1 q . \left\|p^{-1/2}\mathbf{V}_X\right\|_{\mathrm{op}}^2=\frac{1}{p},\qquad\left\|q^{-1/2}\mathbf{V}_M\right\|_{\mathrm{op}}^2=\frac{1}{q}. p − 1/2 V X op 2 = p 1 , q − 1/2 V M op 2 = q 1 . As the operator norm of a block-diagonal matrix is the maximum of the operator norms of its diagonal blocks, so
∥ W ∥ o p 2 = max { p − 1 , q − 1 } = ( p ∧ q ) − 1 . \|\mathbf{W}\|_{\mathrm{op}}^2=\max\{p^{-1},q^{-1}\}=(p\wedge q)^{-1}. ∥ W ∥ op 2 = max { p − 1 , q − 1 } = ( p ∧ q ) − 1 .
Lemma C.2. Suppose Assumptions 3.1–3.2 and 5.1–5.2 hold. Then, conditional on the training fold, as n , p , q → ∞ n,p,q\to\infty n , p , q → ∞ ,
(i) ∥ 1 n E ( E 0 ⊤ E 0 ) ∥ o p = O ( 1 p ∧ q ) \left\|\frac{1}{n}\mathbb{E}(\mathbf{E}_0^{\top}\mathbf{E}_0)\right\|_{\mathrm{op}}=O\left(\frac{1}{p\wedge q}\right) n 1 E ( E 0 ⊤ E 0 ) op = O ( p ∧ q 1 ) , ∥ E 0 ∥ o p = O p ( n p ∧ q ) \|\mathbf{E}_0\|_{\mathrm{op}}=O_p\left(\sqrt{\frac{n}{p\wedge q}}\right) ∥ E 0 ∥ op = O p ( p ∧ q n ) .
(ii) ∥ 1 n F ⊤ E 0 ∥ o p = O p ( 1 p ∧ q ) \left\|\frac{1}{\sqrt{n}}\mathbf{F}^{\top}\mathbf{E}_0\right\|_{\mathrm{op}}=O_p\left(\frac{1}{\sqrt{p\wedge q}}\right) n 1 F ⊤ E 0 op = O p ( p ∧ q 1 ) , ∥ 1 n 1 ⊤ E 0 ∥ 2 = O p ( 1 n ( p ∧ q ) ) \left\|\frac{1}{n}\mathbf{1}^{\top}\mathbf{E}_0\right\|_2=O_p\left(\frac{1}{\sqrt{n(p\wedge q)}}\right) n 1 1 ⊤ E 0 2 = O p ( n ( p ∧ q ) 1 ) .
(iii) ∥ 1 n [ E 0 ⊤ E 0 − E ( E 0 ⊤ E 0 ) ] ∥ o p = O p ( 1 p ∧ q ) \left\|\frac{1}{\sqrt{n}}\left[\mathbf{E}_0^{\top}\mathbf{E}_0-\mathbb{E}(\mathbf{E}_0^{\top}\mathbf{E}_0)\right]\right\|_{\mathrm{op}}=O_p\left(\frac{1}{p\wedge q}\right) n 1 [ E 0 ⊤ E 0 − E ( E 0 ⊤ E 0 ) ] op = O p ( p ∧ q 1 ) , ∥ 1 n E 0 ⊤ 11 ⊤ E 0 ∥ o p = O p ( n p ∧ q ) \left\|\frac{1}{\sqrt{n}}\mathbf{E}_0^{\top}\mathbf{1}\mathbf{1}^{\top}\mathbf{E}_0\right\|_{\mathrm{op}}=O_p\left(\frac{\sqrt{n}}{p\wedge q}\right) n 1 E 0 ⊤ 1 1 ⊤ E 0 op = O p ( p ∧ q n ) .
(iv) ∥ 1 n E 0 ⊤ 1 ∥ 2 = O p ( 1 p ∧ q ) \left\|\frac{1}{\sqrt{n}}\mathbf{E}_0^{\top}\mathbf{1}\right\|_2=O_p\left(\frac{1}{\sqrt{p\wedge q}}\right) n 1 E 0 ⊤ 1 2 = O p ( p ∧ q 1 ) .
Here n n n denotes the number of rows of the relevant sub-sample. When the lemma is applied to the treated outcome regression, n n n is replaced by n k t n_k^t n k t , and when it is applied to the control bridge regression, n n n is replaced by n k c n_k^c n k c . Since n k t ≍ n k c ≍ n k ≍ n n_k^t\asymp n_k^c\asymp n_k\asymp n n k t ≍ n k c ≍ n k ≍ n , every rate above is order-equivalent under these substitutions.
Proof. Recall from Section A.1 that E 0 = ( 0 n , E ) \mathbf{E}_0=(\mathbf{0}_n,\mathbf{E}) E 0 = ( 0 n , E ) with E = U W \mathbf{E}=\mathbf{U}\mathbf{W} E = UW . Since the first column of E 0 \mathbf{E}_0 E 0 is zero, it is enough to prove the corresponding bounds for E \mathbf{E} E . We use the inequalities ∥ A ∥ o p ≤ ∥ A ∥ F \|\mathbf{A}\|_{\mathrm{op}}\leq\|\mathbf{A}\|_F ∥ A ∥ op ≤ ∥ A ∥ F , ∥ A B ∥ o p ≤ ∥ A ∥ o p ∥ B ∥ o p \|\mathbf{A}\mathbf{B}\|_{\mathrm{op}}\leq\|\mathbf{A}\|_{\mathrm{op}}\|\mathbf{B}\|_{\mathrm{op}} ∥ AB ∥ op ≤ ∥ A ∥ op ∥ B ∥ op , and tr ( A ⊤ B A ) ≤ ∥ B ∥ o p ∥ A ∥ F 2 \operatorname{tr}(\mathbf{A}^{\top}\mathbf{B}\mathbf{A})\leq\|\mathbf{B}\|_{\mathrm{op}}\|\mathbf{A}\|_F^2 tr ( A ⊤ BA ) ≤ ∥ B ∥ op ∥ A ∥ F 2 for positive semidefinite B \mathbf{B} B . By Lemma C.1, ∥ W ∥ o p 2 = 1 / ( p ∧ q ) \|\mathbf{W}\|_{\mathrm{op}}^2=1/(p\wedge q) ∥ W ∥ op 2 = 1/ ( p ∧ q ) . Since W \mathbf{W} W has at most p ~ + q ~ \widetilde{p}+\widetilde{q} p + q columns and p ~ , q ~ \widetilde{p},\widetilde{q} p , q are fixed,
∥ W ∥ F 2 ≤ ( p ~ + q ~ ) ∥ W ∥ o p 2 = O ( 1 p ∧ q ) . \|\mathbf{W}\|_F^2\leq(\widetilde{p}+\widetilde{q})\|\mathbf{W}\|_{\mathrm{op}}^2=O\left(\frac{1}{p\wedge q}\right). ∥ W ∥ F 2 ≤ ( p + q ) ∥ W ∥ op 2 = O ( p ∧ q 1 ) .
Because W \mathbf{W} W is fixed conditional on the training fold, the rows of E = U W \mathbf{E}=\mathbf{U}\mathbf{W} E = UW are independent across i i i within the regression fold.
Proof of part (i). Let Σ u = E ( u i u i ⊤ ) \boldsymbol{\Sigma}_u=\mathbb{E}(\mathbf{u}_i\mathbf{u}_i^{\top}) Σ u = E ( u i u i ⊤ ) . By Assumption 3.1(ii) and (v), ∥ Σ u ∥ o p ≤ C \|\boldsymbol{\Sigma}_u\|_{\mathrm{op}}\leq C ∥ Σ u ∥ op ≤ C . Since E = U W \mathbf{E}=\mathbf{U}\mathbf{W} E = UW , we have E ⊤ E = W ⊤ U ⊤ U W \mathbf{E}^{\top}\mathbf{E}=\mathbf{W}^{\top}\mathbf{U}^{\top}\mathbf{U}\mathbf{W} E ⊤ E = W ⊤ U ⊤ UW . The rows of U \mathbf{U} U are i.i.d., so E ( U ⊤ U ) = n Σ u \mathbb{E}(\mathbf{U}^{\top}\mathbf{U})=n\boldsymbol{\Sigma}_u E ( U ⊤ U ) = n Σ u , and therefore E ( E ⊤ E ) = n W ⊤ Σ u W \mathbb{E}(\mathbf{E}^{\top}\mathbf{E})=n\mathbf{W}^{\top}\boldsymbol{\Sigma}_u\mathbf{W} E ( E ⊤ E ) = n W ⊤ Σ u W . It follows that
∥ 1 n E ( E ⊤ E ) ∥ o p = ∥ W ⊤ Σ u W ∥ o p ≤ ∥ W ∥ o p 2 ∥ Σ u ∥ o p = O ( 1 p ∧ q ) . \left\|\frac{1}{n}\mathbb{E}(\mathbf{E}^{\top}\mathbf{E})\right\|_{\mathrm{op}}=\|\mathbf{W}^{\top}\boldsymbol{\Sigma}_u\mathbf{W}\|_{\mathrm{op}}\leq\|\mathbf{W}\|_{\mathrm{op}}^2\|\boldsymbol{\Sigma}_u\|_{\mathrm{op}}=O\left(\frac{1}{p\wedge q}\right). n 1 E ( E ⊤ E ) op = ∥ W ⊤ Σ u W ∥ op ≤ ∥ W ∥ op 2 ∥ Σ u ∥ op = O ( p ∧ q 1 ) .
Since E 0 \mathbf{E}_0 E 0 only adds a zero column to E \mathbf{E} E , the same bound holds for E 0 \mathbf{E}_0 E 0 .
Next, using ∥ E ∥ o p ≤ ∥ E ∥ F \|\mathbf{E}\|_{\mathrm{op}}\leq\|\mathbf{E}\|_F ∥ E ∥ op ≤ ∥ E ∥ F , we get
E ∥ E ∥ o p 2 ≤ E ∥ E ∥ F 2 = E tr ( E ⊤ E ) = n tr ( W ⊤ Σ u W ) ≤ n ∥ Σ u ∥ o p ∥ W ∥ F 2 = O ( n p ∧ q ) . \mathbb{E}\|\mathbf{E}\|_{\mathrm{op}}^2\leq\mathbb{E}\|\mathbf{E}\|_F^2=\mathbb{E}\operatorname{tr}(\mathbf{E}^{\top}\mathbf{E})=n\operatorname{tr}(\mathbf{W}^{\top}\boldsymbol{\Sigma}_u\mathbf{W})\leq n\|\boldsymbol{\Sigma}_u\|_{\mathrm{op}}\|\mathbf{W}\|_F^2=O\left(\frac{n}{p\wedge q}\right). E ∥ E ∥ op 2 ≤ E ∥ E ∥ F 2 = E tr ( E ⊤ E ) = n tr ( W ⊤ Σ u W ) ≤ n ∥ Σ u ∥ op ∥ W ∥ F 2 = O ( p ∧ q n ) .
Therefore, by Markov’s inequality, we have that ∥ E ∥ o p = O p ( n / ( p ∧ q ) ) \|\mathbf{E}\|_{\mathrm{op}}=O_p\left(\sqrt{n/(p\wedge q)}\right) ∥ E ∥ op = O p ( n / ( p ∧ q ) ) . Since adding the zero column does not change the operator norm, we have
∥ E 0 ∥ o p = ∥ E ∥ o p = O p ( n p ∧ q ) . \|\mathbf{E}_0\|_{\mathrm{op}}=\|\mathbf{E}\|_{\mathrm{op}}=O_p\left(\sqrt{\frac{n}{p\wedge q}}\right). ∥ E 0 ∥ op = ∥ E ∥ op = O p ( p ∧ q n ) .
This proves part (i).
Proof of part (ii). Since F 1 = ( 1 F ) \mathbf{F}_1=(\mathbf{1}\ \mathbf{F}) F 1 = ( 1 F ) , we first bound 1 n 1 ⊤ E \frac{1}{\sqrt{n}}\mathbf{1}^{\top}\mathbf{E} n 1 1 ⊤ E and 1 n F ⊤ E \frac{1}{\sqrt{n}}\mathbf{F}^{\top}\mathbf{E} n 1 F ⊤ E in order to find the bound of 1 n F 1 ⊤ E 0 \frac{1}{\sqrt{n}}\mathbf{F}_1^{\top}\mathbf{E}_0 n 1 F 1 ⊤ E 0 . For the first term,
E ∥ 1 n 1 ⊤ E ∥ 2 2 = E ∥ 1 n ∑ i = 1 n W ⊤ u i ∥ 2 2 = 1 n ∑ i = 1 n E ∥ W ⊤ u i ∥ 2 2 = tr ( W ⊤ Σ u W ) ≤ ∥ Σ u ∥ o p ∥ W ∥ F 2 = O ( 1 p ∧ q ) , \mathbb{E}\left\|\frac{1}{\sqrt{n}}\mathbf{1}^{\top}\mathbf{E}\right\|_2^2
=\mathbb{E}\left\|\frac{1}{\sqrt{n}}\sum_{i=1}^{n}\mathbf{W}^{\top}\mathbf{u}_i\right\|_2^2
=\frac{1}{n}\sum_{i=1}^{n}\mathbb{E}\|\mathbf{W}^{\top}\mathbf{u}_i\|_2^2
=\operatorname{tr}(\mathbf{W}^{\top}\boldsymbol{\Sigma}_u\mathbf{W})
\leq\|\boldsymbol{\Sigma}_u\|_{\mathrm{op}}\|\mathbf{W}\|_F^2
=O\left(\frac{1}{p\wedge q}\right), E n 1 1 ⊤ E 2 2 = E n 1 i = 1 ∑ n W ⊤ u i 2 2 = n 1 i = 1 ∑ n E ∥ W ⊤ u i ∥ 2 2 = tr ( W ⊤ Σ u W ) ≤ ∥ Σ u ∥ op ∥ W ∥ F 2 = O ( p ∧ q 1 ) ,
where the cross terms vanish because the observations are independent and E ( u i ) = 0 \mathbb{E}(\mathbf{u}_i)=0 E ( u i ) = 0 . Thus, we have
∥ 1 n 1 ⊤ E ∥ 2 = O p ( 1 p ∧ q ) . \left\|\frac{1}{\sqrt{n}}\mathbf{1}^{\top}\mathbf{E}\right\|_2=O_p\left(\frac{1}{\sqrt{p\wedge q}}\right). n 1 1 ⊤ E 2 = O p ( p ∧ q 1 ) .
For the second term, note that F ⊤ E = ∑ i = 1 n f i u i ⊤ W \mathbf{F}^{\top}\mathbf{E}=\sum_{i=1}^{n}\mathbf{f}_i\mathbf{u}_i^{\top}\mathbf{W} F ⊤ E = ∑ i = 1 n f i u i ⊤ W . By Assumption 3.1, E ( f i u i ⊤ ) = 0 \mathbb{E}(\mathbf{f}_i\mathbf{u}_i^{\top})=0 E ( f i u i ⊤ ) = 0 , so the cross terms vanish. Hence, we have
E ∥ 1 n F ⊤ E ∥ F 2 = 1 n ∑ i = 1 n E ∥ f i u i ⊤ W ∥ F 2 = E [ ∥ f i ∥ 2 2 ∥ W ⊤ u i ∥ 2 2 ] ≤ ( 1 ) { E ∥ f i ∥ 2 4 } 1 / 2 { E ∥ W ⊤ u i ∥ 2 4 } 1 / 2 = ( 2 ) O ( 1 p ∧ q ) , \mathbb{E}\left\|\frac{1}{\sqrt{n}}\mathbf{F}^{\top}\mathbf{E}\right\|_F^2
=\frac{1}{n}\sum_{i=1}^{n}\mathbb{E}\|\mathbf{f}_i\mathbf{u}_i^{\top}\mathbf{W}\|_F^2
=\mathbb{E}\left[\|\mathbf{f}_i\|_2^2\|\mathbf{W}^{\top}\mathbf{u}_i\|_2^2\right]
\overset{(1)}{\leq}\{\mathbb{E}\|\mathbf{f}_i\|_2^4\}^{1/2}\{\mathbb{E}\|\mathbf{W}^{\top}\mathbf{u}_i\|_2^4\}^{1/2}
\overset{(2)}{=}O\left(\frac{1}{p\wedge q}\right), E n 1 F ⊤ E F 2 = n 1 i = 1 ∑ n E ∥ f i u i ⊤ W ∥ F 2 = E [ ∥ f i ∥ 2 2 ∥ W ⊤ u i ∥ 2 2 ] ≤ ( 1 ) { E ∥ f i ∥ 2 4 } 1/2 { E ∥ W ⊤ u i ∥ 2 4 } 1/2 = ( 2 ) O ( p ∧ q 1 ) ,
where (1) uses Cauchy-Schwarz and (2) uses Assumption 5.1 and Lemma C.1. Since sub-Gaussian random variables have finite moments of all orders, the fourth moments above are finite. Now, combining the bounds for 1 T E \mathbf{1}^{\mathsf T}\mathbf{E} 1 T E and F T E \mathbf{F}^{\mathsf T}\mathbf{E} F T E , and using ∥ ⋅ ∥ o p ≤ ∥ ⋅ ∥ F \lVert\cdot\rVert_{\mathrm{op}}\le\lVert\cdot\rVert_{\mathrm{F}} ∥ ⋅ ∥ op ≤ ∥ ⋅ ∥ F , Markov’s inequality gives us
∥ 1 n F T E 0 ∥ o p = O p ( 1 p ∧ q ) . \left\lVert\frac{1}{\sqrt{n}}\mathbf{F}^{\mathsf T}\mathbf{E}_0\right\rVert_{\mathrm{op}}=O_{\mathrm{p}}\left(\frac{1}{\sqrt{p\wedge q}}\right). n 1 F T E 0 op = O p ( p ∧ q 1 ) .
Moreover, we have
E ∥ 1 n 1 T E ∥ 2 2 = 1 n E ∥ 1 n 1 T E ∥ 2 2 = O ( 1 n ( p ∧ q ) ) . \mathbb{E}\left\lVert\frac{1}{n}\mathbf{1}^{\mathsf T}\mathbf{E}\right\rVert_2^2=\frac{1}{n}\mathbb{E}\left\lVert\frac{1}{\sqrt{n}}\mathbf{1}^{\mathsf T}\mathbf{E}\right\rVert_2^2=O\left(\frac{1}{n(p\wedge q)}\right). E n 1 1 T E 2 2 = n 1 E n 1 1 T E 2 2 = O ( n ( p ∧ q ) 1 ) .
Thus, we simply have ∥ 1 T E 0 / n ∥ 2 = O p ( 1 / n ( p ∧ q ) ) \lVert\mathbf{1}^{\mathsf T}\mathbf{E}_0/n\rVert_2=O_{\mathrm{p}}\left(1/\sqrt{n(p\wedge q)}\right) ∥ 1 T E 0 / n ∥ 2 = O p ( 1/ n ( p ∧ q ) ) . This proves part (ii).
Proof of part (iii). Let w a \mathbf{w}_a w a denote the a a a th column of W \mathbf{W} W , for a = 1 , … , p ~ + q ~ a=1,\ldots,\tilde p+\tilde q a = 1 , … , p ~ + q ~ . Since E = U W \mathbf{E}=\mathbf{U}\mathbf{W} E = UW , the ( a , b ) (a,b) ( a , b ) entry of E T E \mathbf{E}^{\mathsf T}\mathbf{E} E T E is
( E T E ) a b = ∑ i = 1 n ( w a T u i ) ( w b T u i ) . (\mathbf{E}^{\mathsf T}\mathbf{E})_{ab}=\sum_{i=1}^{n}(\mathbf{w}_a^{\mathsf T}\mathbf{u}_i)(\mathbf{w}_b^{\mathsf T}\mathbf{u}_i). ( E T E ) ab = i = 1 ∑ n ( w a T u i ) ( w b T u i ) .
Hence, we have
1 n { ( E T E ) a b − E [ ( E T E ) a b ] } = 1 n ∑ i = 1 n { ( w a T u i ) ( w b T u i ) − E [ ( w a T u i ) ( w b T u i ) ] } . \frac{1}{\sqrt{n}}\left\{(\mathbf{E}^{\mathsf T}\mathbf{E})_{ab}-\mathbb{E}\left[(\mathbf{E}^{\mathsf T}\mathbf{E})_{ab}\right]\right\}
=\frac{1}{\sqrt{n}}\sum_{i=1}^{n}\left\{(\mathbf{w}_a^{\mathsf T}\mathbf{u}_i)(\mathbf{w}_b^{\mathsf T}\mathbf{u}_i)-\mathbb{E}\left[(\mathbf{w}_a^{\mathsf T}\mathbf{u}_i)(\mathbf{w}_b^{\mathsf T}\mathbf{u}_i)\right]\right\}. n 1 { ( E T E ) ab − E [ ( E T E ) ab ] } = n 1 i = 1 ∑ n { ( w a T u i ) ( w b T u i ) − E [ ( w a T u i ) ( w b T u i ) ] } .
The summands are independent and mean zero. Therefore,
Var [ 1 n { ( E T E ) a b − E [ ( E T E ) a b ] } ] = Var [ ( w a T u 1 ) ( w b T u 1 ) ] ≤ E [ ( w a T u 1 ) 2 ( w b T u 1 ) 2 ] ≤ { E ( w a T u 1 ) 4 } 1 / 2 { E ( w b T u 1 ) 4 } 1 / 2 ≤ C ∥ w a ∥ 2 2 ∥ w b ∥ 2 2 ≤ C ( p ∧ q ) 2 , \begin{aligned}
\operatorname{Var}\left[\frac{1}{\sqrt{n}}\left\{(\mathbf{E}^{\mathsf T}\mathbf{E})_{ab}-\mathbb{E}\left[(\mathbf{E}^{\mathsf T}\mathbf{E})_{ab}\right]\right\}\right]
&=\operatorname{Var}\left[(\mathbf{w}_a^{\mathsf T}\mathbf{u}_1)(\mathbf{w}_b^{\mathsf T}\mathbf{u}_1)\right]\\
&\le\mathbb{E}\left[(\mathbf{w}_a^{\mathsf T}\mathbf{u}_1)^2(\mathbf{w}_b^{\mathsf T}\mathbf{u}_1)^2\right]\\
&\le\left\{\mathbb{E}(\mathbf{w}_a^{\mathsf T}\mathbf{u}_1)^4\right\}^{1/2}\left\{\mathbb{E}(\mathbf{w}_b^{\mathsf T}\mathbf{u}_1)^4\right\}^{1/2}\\
&\le C\lVert\mathbf{w}_a\rVert_2^2\lVert\mathbf{w}_b\rVert_2^2\\
&\le\frac{C}{(p\wedge q)^2},
\end{aligned} Var [ n 1 { ( E T E ) ab − E [ ( E T E ) ab ] } ] = Var [ ( w a T u 1 ) ( w b T u 1 ) ] ≤ E [ ( w a T u 1 ) 2 ( w b T u 1 ) 2 ] ≤ { E ( w a T u 1 ) 4 } 1/2 { E ( w b T u 1 ) 4 } 1/2 ≤ C ∥ w a ∥ 2 2 ∥ w b ∥ 2 2 ≤ ( p ∧ q ) 2 C ,
where the fourth-moment bound follows from Assumption 5.1(i), and the last inequality uses ∥ w a ∥ 2 , ∥ w b ∥ 2 ≤ ∥ W ∥ o p \lVert\mathbf{w}_a\rVert_2,\lVert\mathbf{w}_b\rVert_2\le\lVert\mathbf{W}\rVert_{\mathrm{op}} ∥ w a ∥ 2 , ∥ w b ∥ 2 ≤ ∥ W ∥ op together with Lemma C.1. By Chebyshev’s inequality, for every a , b a,b a , b ,
1 n { ( E T E ) a b − E [ ( E T E ) a b ] } = O p ( 1 p ∧ q ) . \frac{1}{\sqrt{n}}\left\{(\mathbf{E}^{\mathsf T}\mathbf{E})_{ab}-\mathbb{E}\left[(\mathbf{E}^{\mathsf T}\mathbf{E})_{ab}\right]\right\}=O_{\mathrm{p}}\left(\frac{1}{p\wedge q}\right). n 1 { ( E T E ) ab − E [ ( E T E ) ab ] } = O p ( p ∧ q 1 ) .
Since p ~ + q ~ \tilde p+\tilde q p ~ + q ~ is fixed, the matrix has a fixed number of entries. Also, for a fixed-dimensional matrix A \mathbf{A} A ,
∥ A ∥ o p ≤ ∥ A ∥ F ≤ ( p ~ + q ~ ) max a , b ∣ A a b ∣ . \lVert\mathbf{A}\rVert_{\mathrm{op}}\le\lVert\mathbf{A}\rVert_{\mathrm{F}}\le(\tilde p+\tilde q)\max_{a,b}|A_{ab}|. ∥ A ∥ op ≤ ∥ A ∥ F ≤ ( p ~ + q ~ ) a , b max ∣ A ab ∣.
Therefore, we have that
∥ 1 n { E T E − E ( E T E ) } ∥ o p = O p ( 1 p ∧ q ) . \left\lVert\frac{1}{\sqrt{n}}\left\{\mathbf{E}^{\mathsf T}\mathbf{E}-\mathbb{E}(\mathbf{E}^{\mathsf T}\mathbf{E})\right\}\right\rVert_{\mathrm{op}}=O_{\mathrm{p}}\left(\frac{1}{p\wedge q}\right). n 1 { E T E − E ( E T E ) } op = O p ( p ∧ q 1 ) .
Since E 0 \mathbf{E}_0 E 0 only adds a zero column to E \mathbf{E} E , the same bound holds for E 0 \mathbf{E}_0 E 0 . This proves the first half of part (iii).
For the second part, note that E T 11 T E = ( E T 1 ) ( E T 1 ) T \mathbf{E}^{\mathsf T}\mathbf{1}\mathbf{1}^{\mathsf T}\mathbf{E}=(\mathbf{E}^{\mathsf T}\mathbf{1})(\mathbf{E}^{\mathsf T}\mathbf{1})^{\mathsf T} E T 1 1 T E = ( E T 1 ) ( E T 1 ) T is a rank-one matrix, so we have
∥ 1 n E T 11 T E ∥ o p = 1 n ∥ E T 1 ∥ 2 2 . \left\lVert\frac{1}{\sqrt{n}}\mathbf{E}^{\mathsf T}\mathbf{1}\mathbf{1}^{\mathsf T}\mathbf{E}\right\rVert_{\mathrm{op}}=\frac{1}{\sqrt{n}}\lVert\mathbf{E}^{\mathsf T}\mathbf{1}\rVert_2^2. n 1 E T 1 1 T E op = n 1 ∥ E T 1 ∥ 2 2 .
Now we connect ∥ E T 1 ∥ 2 \lVert\mathbf{E}^{\mathsf T}\mathbf{1}\rVert_2 ∥ E T 1 ∥ 2 to the quantity already bounded in part (ii). Since E T 1 = n ⋅ ( 1 T E / n ) T \mathbf{E}^{\mathsf T}\mathbf{1}=n\cdot(\mathbf{1}^{\mathsf T}\mathbf{E}/n)^{\mathsf T} E T 1 = n ⋅ ( 1 T E / n ) T , we get ∥ E T 1 ∥ 2 2 = n 2 ∥ 1 T E / n ∥ 2 2 \lVert\mathbf{E}^{\mathsf T}\mathbf{1}\rVert_2^2=n^2\lVert\mathbf{1}^{\mathsf T}\mathbf{E}/n\rVert_2^2 ∥ E T 1 ∥ 2 2 = n 2 ∥ 1 T E / n ∥ 2 2 . Substituting this, we get that
∥ 1 n E T 11 T E ∥ o p = n 2 n ∥ 1 n 1 T E ∥ 2 2 = n 3 / 2 ∥ 1 n 1 T E ∥ 2 2 . \left\lVert\frac{1}{\sqrt{n}}\mathbf{E}^{\mathsf T}\mathbf{1}\mathbf{1}^{\mathsf T}\mathbf{E}\right\rVert_{\mathrm{op}}
=\frac{n^2}{\sqrt{n}}\left\lVert\frac{1}{n}\mathbf{1}^{\mathsf T}\mathbf{E}\right\rVert_2^2
=n^{3/2}\left\lVert\frac{1}{n}\mathbf{1}^{\mathsf T}\mathbf{E}\right\rVert_2^2. n 1 E T 1 1 T E op = n n 2 n 1 1 T E 2 2 = n 3/2 n 1 1 T E 2 2 .
By part (ii), ∥ 1 ⊤ E / n ∥ 2 = O p ( 1 / n ( p ∧ q ) ) \lVert\mathbf{1}^{\top}\mathbf{E}/n\rVert_2=O_p\left(1/\sqrt{n(p\wedge q)}\right) ∥ 1 ⊤ E / n ∥ 2 = O p ( 1/ n ( p ∧ q ) ) , and hence ∥ 1 ⊤ E / n ∥ 2 2 = O p ( 1 / n ( p ∧ q ) ) \lVert\mathbf{1}^{\top}\mathbf{E}/n\rVert_2^2=O_p\left(1/n(p\wedge q)\right) ∥ 1 ⊤ E / n ∥ 2 2 = O p ( 1/ n ( p ∧ q ) ) . Therefore, we have
∥ 1 n E ⊤ 11 ⊤ E ∥ o p = n 3 / 2 O p ( 1 n ( p ∧ q ) ) = O p ( n p ∧ q ) . \left\lVert\frac{1}{\sqrt{n}}\mathbf{E}^{\top}\mathbf{1}\mathbf{1}^{\top}\mathbf{E}\right\rVert_{\mathrm{op}}=n^{3/2}O_p\left(\frac{1}{n(p\wedge q)}\right)=O_p\left(\frac{\sqrt{n}}{p\wedge q}\right). n 1 E ⊤ 1 1 ⊤ E op = n 3/2 O p ( n ( p ∧ q ) 1 ) = O p ( p ∧ q n ) .
Since E 0 \mathbf{E}_0 E 0 only adds a zero column to E \mathbf{E} E , the same bound holds for E 0 \mathbf{E}_0 E 0 . This proves part (iii).
Proof of part (iv). We have E ⊤ ϵ 1 = ∑ i = 1 n W ⊤ u i ϵ 1 , i \mathbf{E}^{\top}\epsilon_1=\sum_{i=1}^n\mathbf{W}^{\top}\mathbf{u}_i\epsilon_{1,i} E ⊤ ϵ 1 = ∑ i = 1 n W ⊤ u i ϵ 1 , i . Using independence across observations and the tower-property condition E ( u i ϵ 1 , i ) = 0 \mathbb{E}(\mathbf{u}_i\epsilon_{1,i})=0 E ( u i ϵ 1 , i ) = 0 , the cross terms vanish. Hence, we have
E ∥ 1 n E ⊤ ϵ 1 ∥ 2 2 = 1 n ∑ i = 1 n E ∥ W ⊤ u i ϵ 1 , i ∥ 2 2 = E [ ϵ 1 , i 2 ∥ W ⊤ u i ∥ 2 2 ] ≤ { E ∣ ϵ 1 , i ∣ 4 } 1 / 2 { E ∥ W ⊤ u i ∥ 2 4 } 1 / 2 = O ( 1 p ∧ q ) , \mathbb{E}\left\lVert\frac{1}{\sqrt{n}}\mathbf{E}^{\top}\epsilon_1\right\rVert_2^2=\frac{1}{n}\sum_{i=1}^n\mathbb{E}\left\lVert\mathbf{W}^{\top}\mathbf{u}_i\epsilon_{1,i}\right\rVert_2^2=\mathbb{E}\left[\epsilon_{1,i}^2\lVert\mathbf{W}^{\top}\mathbf{u}_i\rVert_2^2\right]\leq\{\mathbb{E}|\epsilon_{1,i}|^4\}^{1/2}\{\mathbb{E}\lVert\mathbf{W}^{\top}\mathbf{u}_i\rVert_2^4\}^{1/2}=O\left(\frac{1}{p\wedge q}\right), E n 1 E ⊤ ϵ 1 2 2 = n 1 i = 1 ∑ n E W ⊤ u i ϵ 1 , i 2 2 = E [ ϵ 1 , i 2 ∥ W ⊤ u i ∥ 2 2 ] ≤ { E ∣ ϵ 1 , i ∣ 4 } 1/2 { E ∥ W ⊤ u i ∥ 2 4 } 1/2 = O ( p ∧ q 1 ) ,
by Cauchy–Schwarz, Assumption 5.1(i), and Lemma C.1 . Therefore, by Markov’s inequality,
∥ 1 n E 0 ⊤ ϵ 1 ∥ 2 = O p ( 1 p ∧ q ) . \left\lVert\frac{1}{\sqrt{n}}\mathbf{E}_0^{\top}\epsilon_1\right\rVert_2=O_p\left(\frac{1}{\sqrt{p\wedge q}}\right). n 1 E 0 ⊤ ϵ 1 2 = O p ( p ∧ q 1 ) .
This proves part (iv).
Lemma C.3. Suppose Assumptions 3.1–3.2 and 5.1–5.2 hold. Then, conditional on the training fold, 1 ⊤ P S 1 = O p ( 1 ) \mathbf{1}^{\top}P_S\mathbf{1}=O_p(1) 1 ⊤ P S 1 = O p ( 1 ) , where P S = E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ P_S=\mathbf{E}_0S(S^{\top}\mathbf{E}_0^{\top}\mathbf{E}_0S)^{-1}S^{\top}\mathbf{E}_0^{\top} P S = E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ .
Proof. The idea is to use the special form of E 0 \mathbf{E}_0 E 0 . Since the first block of E 0 \mathbf{E}_0 E 0 is zero, E 0 S = E S ˉ \mathbf{E}_0S=\mathbf{E}\bar{S} E 0 S = E S ˉ , where S ˉ \bar{S} S ˉ is the lower block of S S S . We then normalize E S ˉ \mathbf{E}\bar{S} E S ˉ by its population covariance and work with the resulting whitened matrix. Let n n n be the sample size of the regression sub-sample. The quantities p = p n p=p_n p = p n and q = q n q=q_n q = q n may grow with n n n , while p ~ , q ~ , p ˉ , q ˉ \tilde{p},\tilde{q},\bar{p},\bar{q} p ~ , q ~ , p ˉ , q ˉ are fixed. Define d = ( p ~ − p ˉ ) + ( q ~ − q ˉ ) d=(\tilde{p}-\bar{p})+(\tilde{q}-\bar{q}) d = ( p ~ − p ˉ ) + ( q ~ − q ˉ ) , which is fixed. For the X X X part, let U X ∈ R n × p \mathbf{U}_X\in\mathbb{R}^{n\times p} U X ∈ R n × p and W X ∈ R p × p ~ \mathbf{W}_X\in\mathbb{R}^{p\times\tilde{p}} W X ∈ R p × p ~ , and recall W X = p V X \mathbf{W}_X=\sqrt{p}\mathbf{V}_X W X = p V X with V X ⊤ V X = I p ~ \mathbf{V}_X^{\top}\mathbf{V}_X=I_{\tilde{p}} V X ⊤ V X = I p ~ , so that
E X = 1 p U X W X = 1 p U X ( p V X ) = 1 p U X V X ∈ R n × p ~ . \mathbf{E}_X=\frac{1}{p}\mathbf{U}_X\mathbf{W}_X=\frac{1}{p}\mathbf{U}_X(\sqrt{p}\mathbf{V}_X)=\frac{1}{\sqrt{p}}\mathbf{U}_X\mathbf{V}_X\in\mathbb{R}^{n\times\tilde{p}}. E X = p 1 U X W X = p 1 U X ( p V X ) = p 1 U X V X ∈ R n × p ~ .
Similarly, for the M M M part,
E M = 1 q U M W M = 1 q U M ( q V M ) = 1 q U M V M ∈ R n × q ~ , \mathbf{E}_M=\frac{1}{q}\mathbf{U}_M\mathbf{W}_M=\frac{1}{q}\mathbf{U}_M(\sqrt{q}\mathbf{V}_M)=\frac{1}{\sqrt{q}}\mathbf{U}_M\mathbf{V}_M\in\mathbb{R}^{n\times\tilde{q}}, E M = q 1 U M W M = q 1 U M ( q V M ) = q 1 U M V M ∈ R n × q ~ ,
where W M = q V M \mathbf{W}_M=\sqrt{q}\mathbf{V}_M W M = q V M and V M ⊤ V M = I q ~ \mathbf{V}_M^{\top}\mathbf{V}_M=I_{\tilde{q}} V M ⊤ V M = I q ~ . Also, E = ( E X E M ) ∈ R n × ( p ~ + q ~ ) \mathbf{E}=(\mathbf{E}_X\ \mathbf{E}_M)\in\mathbb{R}^{n\times(\tilde{p}+\tilde{q})} E = ( E X E M ) ∈ R n × ( p ~ + q ~ ) and E 0 = ( 0 E ) ∈ R n × ( 1 + p ~ + q ~ ) \mathbf{E}_0=(0\ \mathbf{E})\in\mathbb{R}^{n\times(1+\tilde{p}+\tilde{q})} E 0 = ( 0 E ) ∈ R n × ( 1 + p ~ + q ~ ) . Let S X ∈ R p ~ × ( p ~ − p ˉ ) \mathbf{S}_X\in\mathbb{R}^{\tilde{p}\times(\tilde{p}-\bar{p})} S X ∈ R p ~ × ( p ~ − p ˉ ) be an orthonormal basis for the orthogonal complement of Col ( H X ) \operatorname{Col}(\mathbf{H}_X) Col ( H X ) , and let S M ∈ R q ~ × ( q ~ − q ˉ ) \mathbf{S}_M\in\mathbb{R}^{\tilde{q}\times(\tilde{q}-\bar{q})} S M ∈ R q ~ × ( q ~ − q ˉ ) be an orthonormal basis for the orthogonal complement of Col ( H M ) \operatorname{Col}(\mathbf{H}_M) Col ( H M ) . Hence S X ⊤ S X = I p ~ − p ˉ \mathbf{S}_X^{\top}\mathbf{S}_X=I_{\tilde{p}-\bar{p}} S X ⊤ S X = I p ~ − p ˉ and S M ⊤ S M = I q ~ − q ˉ \mathbf{S}_M^{\top}\mathbf{S}_M=I_{\tilde{q}-\bar{q}} S M ⊤ S M = I q ~ − q ˉ . We take S ˉ = diag ( S X S M ) ∈ R ( p ~ + q ~ ) × d \bar{S}=\operatorname{diag}(\mathbf{S}_X\ \mathbf{S}_M)\in\mathbb{R}^{(\tilde{p}+\tilde{q})\times d} S ˉ = diag ( S X S M ) ∈ R ( p ~ + q ~ ) × d . If a different orthonormal basis is used for the same space, the projection is unchanged because only the column space matters. By Assumption 3.1, the second moments Σ u X = E [ n − 1 U X ⊤ U X ] \Sigma_{uX}=\mathbb{E}[n^{-1}\mathbf{U}_X^{\top}\mathbf{U}_X] Σ u X = E [ n − 1 U X ⊤ U X ] and Σ u M = E [ n − 1 U M ⊤ U M ] \Sigma_{uM}=\mathbb{E}[n^{-1}\mathbf{U}_M^{\top}\mathbf{U}_M] Σ u M = E [ n − 1 U M ⊤ U M ] satisfy E [ U X ⊤ U M ] = 0 \mathbb{E}[\mathbf{U}_X^{\top}\mathbf{U}_M]=0 E [ U X ⊤ U M ] = 0 and
λ min ( Σ u X ) ≥ c X > 0 , λ min ( Σ u M ) ≥ c M > 0. \lambda_{\min}(\Sigma_{uX})\geq c_X>0,\qquad\lambda_{\min}(\Sigma_{uM})\geq c_M>0. λ m i n ( Σ u X ) ≥ c X > 0 , λ m i n ( Σ u M ) ≥ c M > 0.
Assumption 5.1 provides the fourth-moment bounds used below.
Step 1. Reduce E 0 S \mathbf{E}_0S E 0 S to E S ˉ \mathbf{E}\bar{S} E S ˉ . Write S S S by separating its first row from the lower block S = ( s 0 S ˉ ⊤ ) ⊤ S=(s_0\ \bar{S}^{\top})^{\top} S = ( s 0 S ˉ ⊤ ) ⊤ , s 0 ∈ R d s_0\in\mathbb{R}^{d} s 0 ∈ R d and S ˉ ∈ R ( p ~ + q ~ ) × d \bar{S}\in\mathbb{R}^{(\tilde{p}+\tilde{q})\times d} S ˉ ∈ R ( p ~ + q ~ ) × d . Since E 0 = ( 0 E ) \mathbf{E}_0=(0\ \mathbf{E}) E 0 = ( 0 E ) , we have
E 0 S = ( 0 E ) ( s 0 ⊤ S ˉ ) = 0 ⋅ s 0 ⊤ + E S ˉ = E S ˉ . \mathbf{E}_0S=(0\ \mathbf{E})\begin{pmatrix}s_0^{\top}\\\bar{S}\end{pmatrix}=0\cdot s_0^{\top}+\mathbf{E}\bar{S}=\mathbf{E}\bar{S}. E 0 S = ( 0 E ) ( s 0 ⊤ S ˉ ) = 0 ⋅ s 0 ⊤ + E S ˉ = E S ˉ .
So E 0 S \mathbf{E}_0S E 0 S and E S ˉ \mathbf{E}\bar{S} E S ˉ are the same matrix, giving P S = P E S ˉ P_S=P_{\mathbf{E}\bar{S}} P S = P E S ˉ and 1 ⊤ P S 1 = 1 ⊤ P E S ˉ 1 \mathbf{1}^{\top}P_S\mathbf{1}=\mathbf{1}^{\top}P_{\mathbf{E}\bar{S}}\mathbf{1} 1 ⊤ P S 1 = 1 ⊤ P E S ˉ 1 . It is therefore enough to prove 1 ⊤ P E S ˉ 1 = O p ( 1 ) \mathbf{1}^{\top}P_{\mathbf{E}\bar{S}}\mathbf{1}=O_p(1) 1 ⊤ P E S ˉ 1 = O p ( 1 ) .
Step 2. Population covariance matrix using block matrices. Define Σ = E [ S ˉ ⊤ E ⊤ E S ˉ / n ] \Sigma=\mathbb{E}[\bar{S}^{\top}\mathbf{E}^{\top}\mathbf{E}\bar{S}/n] Σ = E [ S ˉ ⊤ E ⊤ E S ˉ / n ] . We compute this directly from the block form of E \mathbf{E} E . Since E = ( E X E M ) \mathbf{E}=(\mathbf{E}_X\ \mathbf{E}_M) E = ( E X E M ) , we have
E ⊤ E = ( E X ⊤ E X E X ⊤ E M E M ⊤ E X E M ⊤ E M ) and S ˉ = ( S X 0 0 S M ) . (31) \mathbf{E}^{\top}\mathbf{E}=
\begin{pmatrix}
\mathbf{E}_X^{\top}\mathbf{E}_X & \mathbf{E}_X^{\top}\mathbf{E}_M\\
\mathbf{E}_M^{\top}\mathbf{E}_X & \mathbf{E}_M^{\top}\mathbf{E}_M
\end{pmatrix}
\quad\text{and}\quad
\bar{S}=
\begin{pmatrix}
\mathbf{S}_X & 0\\
0 & \mathbf{S}_M
\end{pmatrix}. \tag*{(31)} E ⊤ E = ( E X ⊤ E X E M ⊤ E X E X ⊤ E M E M ⊤ E M ) and S ˉ = ( S X 0 0 S M ) . (31)
we get
1 n S ˉ T E T E S ˉ = 1 n ( S X T 0 0 S M T ) ( E X T E X E X T E M E M T E X E M T E M ) ( S X 0 0 S M ) = ( 1 n S X T E X T E X S X 1 n S X T E X T E M S M 1 n S M T E M T E X S X 1 n S M T E M T E M S M ) . \frac{1}{n}\bar{S}^{\mathsf{T}}E^{\mathsf{T}}E\bar{S}
=
\frac{1}{n}
\begin{pmatrix}
S_X^{\mathsf{T}} & 0 \\
0 & S_M^{\mathsf{T}}
\end{pmatrix}
\begin{pmatrix}
E_X^{\mathsf{T}}E_X & E_X^{\mathsf{T}}E_M \\
E_M^{\mathsf{T}}E_X & E_M^{\mathsf{T}}E_M
\end{pmatrix}
\begin{pmatrix}
S_X & 0 \\
0 & S_M
\end{pmatrix}
=
\begin{pmatrix}
\frac{1}{n}S_X^{\mathsf{T}}E_X^{\mathsf{T}}E_XS_X & \frac{1}{n}S_X^{\mathsf{T}}E_X^{\mathsf{T}}E_MS_M \\
\frac{1}{n}S_M^{\mathsf{T}}E_M^{\mathsf{T}}E_XS_X & \frac{1}{n}S_M^{\mathsf{T}}E_M^{\mathsf{T}}E_MS_M
\end{pmatrix}. n 1 S ˉ T E T E S ˉ = n 1 ( S X T 0 0 S M T ) ( E X T E X E M T E X E X T E M E M T E M ) ( S X 0 0 S M ) = ( n 1 S X T E X T E X S X n 1 S M T E M T E X S X n 1 S X T E X T E M S M n 1 S M T E M T E M S M ) .
Now we compute each block. Since E X = 1 p U X V X E_X = \frac{1}{\sqrt{p}}U_XV_X E X = p 1 U X V X and E M = 1 q U M V M E_M = \frac{1}{\sqrt{q}}U_MV_M E M = q 1 U M V M , and taking expectations gives us
E [ 1 n E X T E X ] = 1 p V X T Σ u X V X , E [ 1 n E M T E M ] = 1 q V M T Σ u M V M , E [ 1 n E X T E M ] = 0. \mathbb{E}\left[\frac{1}{n}E_X^{\mathsf{T}}E_X\right] = \frac{1}{p}V_X^{\mathsf{T}}\Sigma_{u_X}V_X,\qquad
\mathbb{E}\left[\frac{1}{n}E_M^{\mathsf{T}}E_M\right] = \frac{1}{q}V_M^{\mathsf{T}}\Sigma_{u_M}V_M,\qquad
\mathbb{E}\left[\frac{1}{n}E_X^{\mathsf{T}}E_M\right] = 0. E [ n 1 E X T E X ] = p 1 V X T Σ u X V X , E [ n 1 E M T E M ] = q 1 V M T Σ u M V M , E [ n 1 E X T E M ] = 0.
Therefore, Σ = diag ( p − 1 Ω X , q − 1 Ω M ) \Sigma= \operatorname{diag}(p^{-1}\Omega_X,\ q^{-1}\Omega_M) Σ = diag ( p − 1 Ω X , q − 1 Ω M ) , where Ω X = S X T V X T Σ u X V X S X \Omega_X = S_X^{\mathsf{T}}V_X^{\mathsf{T}}\Sigma_{u_X}V_XS_X Ω X = S X T V X T Σ u X V X S X , and Ω M = S M T V M T Σ u M V M S M \Omega_M = S_M^{\mathsf{T}}V_M^{\mathsf{T}}\Sigma_{u_M}V_MS_M Ω M = S M T V M T Σ u M V M S M . We now show that Ω X \Omega_X Ω X and Ω M \Omega_M Ω M are uniformly positive definite. For any a ∈ R p ~ − p ˉ a \in\mathbb{R}^{\tilde{p}-\bar{p}} a ∈ R p ~ − p ˉ ,
a T Ω X a = ( V X S X a ) T Σ u X ( V X S X a ) ≥ c ∥ V X S X a ∥ 2 2 , a^{\mathsf{T}}\Omega_Xa = (V_XS_Xa)^{\mathsf{T}}\Sigma_{u_X}(V_XS_Xa) \ge c\lVert V_XS_Xa\rVert_2^2, a T Ω X a = ( V X S X a ) T Σ u X ( V X S X a ) ≥ c ∥ V X S X a ∥ 2 2 ,
where the last inequality follows from Assumption 3.1. Since V X T V X = I p ~ V_X^{\mathsf{T}}V_X = I_{\tilde{p}} V X T V X = I p ~ and S X T S X = I p ~ − p ˉ S_X^{\mathsf{T}}S_X = I_{\tilde{p}-\bar{p}} S X T S X = I p ~ − p ˉ ,
∥ V X S X a ∥ 2 2 = a T S X T V X T V X S X a = a T S X T S X a = ∥ a ∥ 2 2 . \lVert V_XS_Xa\rVert_2^2 = a^{\mathsf{T}}S_X^{\mathsf{T}}V_X^{\mathsf{T}}V_XS_Xa = a^{\mathsf{T}}S_X^{\mathsf{T}}S_Xa = \lVert a\rVert_2^2. ∥ V X S X a ∥ 2 2 = a T S X T V X T V X S X a = a T S X T S X a = ∥ a ∥ 2 2 .
Hence, a T Ω X a ≥ c ∥ a ∥ 2 2 a^{\mathsf{T}}\Omega_Xa \ge c\lVert a\rVert_2^2 a T Ω X a ≥ c ∥ a ∥ 2 2 , so λ min ( Ω X ) ≥ c \lambda_{\min}(\Omega_X) \ge c λ m i n ( Ω X ) ≥ c . The same argument gives λ min ( Ω M ) ≥ c \lambda_{\min}(\Omega_M) \ge c λ m i n ( Ω M ) ≥ c . Therefore, λ min ( p − 1 Ω X ) ≥ c / p \lambda_{\min}(p^{-1}\Omega_X) \ge c/p λ m i n ( p − 1 Ω X ) ≥ c / p , and λ min ( q − 1 Ω M ) ≥ c / q \lambda_{\min}(q^{-1}\Omega_M) \ge c/q λ m i n ( q − 1 Ω M ) ≥ c / q , and hence Σ \Sigma Σ is positive definite and invertible.
Step 3: Whiten the matrix and rewrite the projection. Define E ~ = E S ˉ Σ − 1 / 2 \widetilde{E} = E\bar{S}\Sigma^{-1/2} E = E S ˉ Σ − 1/2 . Since Σ \Sigma Σ is positive definite, Σ − 1 / 2 \Sigma^{-1/2} Σ − 1/2 is invertible. Therefore, multiplying E S ˉ E\bar{S} E S ˉ on the right by Σ − 1 / 2 \Sigma^{-1/2} Σ − 1/2 does not change its column space, so Col ( E ~ ) = Col ( E S ˉ ) \operatorname{Col}(\widetilde{E}) = \operatorname{Col}(E\bar{S}) Col ( E ) = Col ( E S ˉ ) and P E ~ = P E S ˉ P_{\widetilde{E}} = P_{E\bar{S}} P E = P E S ˉ . Hence, we have
1 T P E S ˉ 1 = 1 T P E ~ 1 = 1 T E ~ ( E ~ T E ~ ) − 1 E ~ T 1. \mathbf{1}^{\mathsf{T}}P_{E\bar{S}}\mathbf{1}
=
\mathbf{1}^{\mathsf{T}}P_{\widetilde{E}}\mathbf{1}
=
\mathbf{1}^{\mathsf{T}}\widetilde{E}(\widetilde{E}^{\mathsf{T}}\widetilde{E})^{-1}\widetilde{E}^{\mathsf{T}}\mathbf{1}. 1 T P E S ˉ 1 = 1 T P E 1 = 1 T E ( E T E ) − 1 E T 1 .
Now, using the normalization by n n n , we get
1 T P E S ˉ 1 = ( 1 n 1 T E ~ ) ( 1 n E ~ T E ~ ) − 1 ( 1 n E ~ T 1 ) . \mathbf{1}^{\mathsf{T}}P_{E\bar{S}}\mathbf{1}
=
\left(\frac{1}{\sqrt{n}}\mathbf{1}^{\mathsf{T}}\widetilde{E}\right)
\left(\frac{1}{n}\widetilde{E}^{\mathsf{T}}\widetilde{E}\right)^{-1}
\left(\frac{1}{\sqrt{n}}\widetilde{E}^{\mathsf{T}}\mathbf{1}\right). 1 T P E S ˉ 1 = ( n 1 1 T E ) ( n 1 E T E ) − 1 ( n 1 E T 1 ) .
Define A n = 1 T E ~ / n A_n = \mathbf{1}^{\mathsf{T}}\widetilde{E}/\sqrt{n} A n = 1 T E / n , and B n = E ~ T E ~ / n B_n = \widetilde{E}^{\mathsf{T}}\widetilde{E}/n B n = E T E / n . Then, we get 1 T P E S ˉ 1 = A n B n − 1 A n T \mathbf{1}^{\mathsf{T}}P_{E\bar{S}}\mathbf{1} = A_nB_n^{-1}A_n^{\mathsf{T}} 1 T P E S ˉ 1 = A n B n − 1 A n T . Thus, it is enough to show that ∥ A n ∥ 2 = O p ( 1 ) \lVert A_n\rVert_2 = O_p(1) ∥ A n ∥ 2 = O p ( 1 ) and ∥ B n − 1 ∥ op = O p ( 1 ) \lVert B_n^{-1}\rVert_{\operatorname{op}} = O_p(1) ∥ B n − 1 ∥ op = O p ( 1 ) .
Step 4: Whitened rows have covariance I d I_d I d . Let e ~ i \widetilde{e}_i e i denote the i i i th row of E ~ \widetilde{E} E and let e i T e_i^{\mathsf{T}} e i T denote the i i i th row of E E E . From the definition of E ~ \widetilde{E} E , e ~ i T = e i T S ˉ Σ − 1 / 2 \widetilde{e}_i^{\mathsf{T}} = e_i^{\mathsf{T}}\bar{S}\Sigma^{-1/2} e i T = e i T S ˉ Σ − 1/2 . Since E ( e i ) = 0 \mathbb{E}(e_i) = 0 E ( e i ) = 0 , we also have E ( e ~ i ) = 0 \mathbb{E}(\widetilde{e}_i) = 0 E ( e i ) = 0 . Recall that Σ = E [ ( 1 / n ) S ˉ T E T E S ˉ ] \Sigma= \mathbb{E}[(1/n)\bar{S}^{\mathsf{T}}E^{\mathsf{T}}E\bar{S}] Σ = E [( 1/ n ) S ˉ T E T E S ˉ ] . Since E T E = ∑ i = 1 n e i e i T E^{\mathsf{T}}E = \sum_{i=1}^{n}e_ie_i^{\mathsf{T}} E T E = ∑ i = 1 n e i e i T , and the rows are identically distributed within the regression subsample,
Σ = 1 n ∑ i = 1 n E [ S ˉ T e i e i T S ˉ ] = E [ S ˉ T e i e i T S ˉ ] . \Sigma= \frac{1}{n}\sum_{i=1}^{n}\mathbb{E}\left[\bar{S}^{\mathsf{T}}e_ie_i^{\mathsf{T}}\bar{S}\right]
= \mathbb{E}\left[\bar{S}^{\mathsf{T}}e_ie_i^{\mathsf{T}}\bar{S}\right]. Σ = n 1 i = 1 ∑ n E [ S ˉ T e i e i T S ˉ ] = E [ S ˉ T e i e i T S ˉ ] .
Therefore, we have
Cov ( e ~ i ) = E ( e ~ i e ~ i T ) = Σ − 1 / 2 E [ S ˉ T e i e i T S ˉ ] Σ − 1 / 2 = Σ − 1 / 2 Σ Σ − 1 / 2 = I d . \operatorname{Cov}(\widetilde{e}_i) = \mathbb{E}(\widetilde{e}_i\widetilde{e}_i^{\mathsf{T}}) = \Sigma^{-1/2}\mathbb{E}\left[\bar{S}^{\mathsf{T}}e_ie_i^{\mathsf{T}}\bar{S}\right]\Sigma^{-1/2} = \Sigma^{-1/2}\Sigma\Sigma^{-1/2} = I_d. Cov ( e i ) = E ( e i e i T ) = Σ − 1/2 E [ S ˉ T e i e i T S ˉ ] Σ − 1/2 = Σ − 1/2 Σ Σ − 1/2 = I d .
Thus, the rows of E ~ \widetilde{E} E are mean zero with covariance I d I_d I d .
Step 5: Fourth moments remain bounded after whitening. Since Σ = diag ( p − 1 Ω X , q − 1 Ω M ) \Sigma= \operatorname{diag}(p^{-1}\Omega_X,\ q^{-1}\Omega_M) Σ = diag ( p − 1 Ω X , q − 1 Ω M ) , and thus, Σ − 1 / 2 = diag ( p Ω X − 1 / 2 , q Ω M − 1 / 2 ) \Sigma^{-1/2} = \operatorname{diag}(\sqrt{p}\Omega_X^{-1/2},\ \sqrt{q}\Omega_M^{-1/2}) Σ − 1/2 = diag ( p Ω X − 1/2 , q Ω M − 1/2 ) . Also, we have
E S ˉ = ( E X S X E M S M ) = ( 1 p U X V X S X 1 q U M V M S M ) . E\bar{S} = (E_XS_X\quad E_MS_M)
=
\left(\frac{1}{\sqrt{p}}U_XV_XS_X\quad\frac{1}{\sqrt{q}}U_MV_MS_M\right). E S ˉ = ( E X S X E M S M ) = ( p 1 U X V X S X q 1 U M V M S M ) .
Therefore, we have
E ~ = E S ˉ Σ − 1 / 2 = ( 1 p U X V X S X 1 q U M V M S M ) ( p Ω X − 1 / 2 0 0 q Ω M − 1 / 2 ) = ( U X V X S X Ω X − 1 / 2 U M V M S M Ω M − 1 / 2 ) . \widetilde{E}
=
E\bar{S}\Sigma^{-1/2}
=
\left(\frac{1}{\sqrt{p}}U_XV_XS_X\quad\frac{1}{\sqrt{q}}U_MV_MS_M\right)
\begin{pmatrix}
\sqrt{p}\Omega_X^{-1/2} & 0 \\
0 & \sqrt{q}\Omega_M^{-1/2}
\end{pmatrix}
=
\left(U_XV_XS_X\Omega_X^{-1/2}\quad U_MV_MS_M\Omega_M^{-1/2}\right). E = E S ˉ Σ − 1/2 = ( p 1 U X V X S X q 1 U M V M S M ) ( p Ω X − 1/2 0 0 q Ω M − 1/2 ) = ( U X V X S X Ω X − 1/2 U M V M S M Ω M − 1/2 ) .
We write the i i i th whitened row as e ~ i = ( g ~ X , i T , g ~ M , i T ) T \widetilde{e}_i = \left(\widetilde{g}_{X,i}^{\mathsf{T}},\widetilde{g}_{M,i}^{\mathsf{T}}\right)^{\mathsf{T}} e i = ( g X , i T , g M , i T ) T , where g ~ X , i \widetilde{g}_{X,i} g X , i and g ~ M , i \widetilde{g}_{M,i} g M , i denote the X X X and M M M blocks, respectively. Consider one coordinate of g ~ X , i \widetilde{g}_{X,i} g X , i . It can be written as a T u X , i a^{\mathsf{T}}u_{X,i} a T u X , i , where a a a is a column of V X S X Ω X − 1 / 2 V_X S_X \Omega_X^{-1/2} V X S X Ω X − 1/2 . Since V X V_X V X and S X S_X S X have orthonormal columns,
∥ a ∥ 2 ≤ ∥ V X ∥ op ∥ S X ∥ op ∥ Ω X − 1 / 2 ∥ op = ∥ Ω X − 1 / 2 ∥ op = λ min ( Ω X ) − 1 / 2 ≤ C , \lVert a\rVert_2 \le\lVert V_X\rVert_{\operatorname{op}}\lVert S_X\rVert_{\operatorname{op}}\lVert\Omega_X^{-1/2}\rVert_{\operatorname{op}} = \lVert\Omega_X^{-1/2}\rVert_{\operatorname{op}} = \lambda_{\min}(\Omega_X)^{-1/2} \le C, ∥ a ∥ 2 ≤ ∥ V X ∥ op ∥ S X ∥ op ∥ Ω X − 1/2 ∥ op = ∥ Ω X − 1/2 ∥ op = λ m i n ( Ω X ) − 1/2 ≤ C ,
where the last inequality follows from Step 2.
By Assumption 5.1(i), linear forms of u X , i u_{X,i} u X , i have uniformly bounded fourth moments. Hence, E ( a T u X , i ) 4 ≤ C \mathbb{E}(a^{\mathsf{T}}u_{X,i})^4 \le C E ( a T u X , i ) 4 ≤ C . Since p ~ − p ‾ \widetilde{p}-\overline{p} p − p is fixed, it follows that E ∥ g ~ X , i ∥ 2 4 ≤ C \mathbb{E}\lVert\widetilde{g}_{X,i}\rVert_2^4 \le C E ∥ g X , i ∥ 2 4 ≤ C . The same argument applied to the M M M block gives E ∥ g ~ M , i ∥ 2 4 ≤ C \mathbb{E}\lVert\widetilde{g}_{M,i}\rVert_2^4 \le C E ∥ g M , i ∥ 2 4 ≤ C . Finally, since ∥ e ~ i ∥ 2 2 = ∥ g ~ X , i ∥ 2 2 + ∥ g ~ M , i ∥ 2 2 \lVert\widetilde{e}_i\rVert_2^2 = \lVert\widetilde{g}_{X,i}\rVert_2^2 + \lVert\widetilde{g}_{M,i}\rVert_2^2 ∥ e i ∥ 2 2 = ∥ g X , i ∥ 2 2 + ∥ g M , i ∥ 2 2 , we have
∥ e ~ i ∥ 2 4 ≤ 2 ∥ g ~ X , i ∥ 2 4 + 2 ∥ g ~ M , i ∥ 2 4 . \lVert\widetilde{e}_i\rVert_2^4 \le2\lVert\widetilde{g}_{X,i}\rVert_2^4 + 2\lVert\widetilde{g}_{M,i}\rVert_2^4. ∥ e i ∥ 2 4 ≤ 2 ∥ g X , i ∥ 2 4 + 2 ∥ g M , i ∥ 2 4 .
Therefore, E ∥ e ~ i ∥ 2 4 ≤ C \mathbb{E}\lVert\widetilde{e}_i\rVert_2^4 \le C E ∥ e i ∥ 2 4 ≤ C uniformly in n , p , q n,p,q n , p , q .
Step 6. B n − 1 = O P ( 1 ) B_n^{-1} = O_P(1) B n − 1 = O P ( 1 ) . Recall that
B n = 1 n E ~ T E ~ = 1 n ∑ i = 1 n e ~ i e ~ i T . B_n = \frac{1}{n}\widetilde{E}^{\mathsf{T}}\widetilde{E} = \frac{1}{n}\sum_{i=1}^{n}\widetilde{e}_i\widetilde{e}_i^{\mathsf{T}}. B n = n 1 E T E = n 1 i = 1 ∑ n e i e i T .
From Step 4, E [ e ~ i e ~ i T ] = I d \mathbb{E}[\widetilde{e}_i\widetilde{e}_i^{\mathsf{T}}] = I_d E [ e i e i T ] = I d . For the ( j , k ) (j,k) ( j , k ) entry, ( B n ) j k = 1 n ∑ i = 1 n e ~ i j e ~ i k (B_n)_{jk} = \frac{1}{n}\sum_{i=1}^{n}\widetilde{e}_{ij}\widetilde{e}_{ik} ( B n ) j k = n 1 ∑ i = 1 n e ij e ik . Hence, we have E [ ( B n ) j k ] = ( I d ) j k \mathbb{E}[(B_n)_{jk}] = (I_d)_{jk} E [( B n ) j k ] = ( I d ) j k . Also, using independence across i i i and the uniform fourth moment bound,
Var { ( B n ) j k } = Var ( 1 n ∑ i = 1 n e ~ i j e ~ i k ) = 1 n 2 ∑ i = 1 n Var ( e ~ i j e ~ i k ) ≤ 1 n 2 ∑ i = 1 n E [ e ~ i j 2 e ~ i k 2 ] ≤ 1 n 2 ∑ i = 1 n E ∥ e ~ i ∥ 2 4 ≤ C 4 n → 0. \operatorname{Var}\{(B_n)_{jk}\} = \operatorname{Var}\left(\frac{1}{n}\sum_{i=1}^{n}\widetilde{e}_{ij}\widetilde{e}_{ik}\right) = \frac{1}{n^2}\sum_{i=1}^{n}\operatorname{Var}(\widetilde{e}_{ij}\widetilde{e}_{ik}) \le\frac{1}{n^2}\sum_{i=1}^{n}\mathbb{E}[\widetilde{e}_{ij}^2\widetilde{e}_{ik}^2] \le\frac{1}{n^2}\sum_{i=1}^{n}\mathbb{E}\lVert\widetilde{e}_i\rVert_2^4 \le\frac{C_4}{n} \to0. Var {( B n ) j k } = Var ( n 1 i = 1 ∑ n e ij e ik ) = n 2 1 i = 1 ∑ n Var ( e ij e ik ) ≤ n 2 1 i = 1 ∑ n E [ e ij 2 e ik 2 ] ≤ n 2 1 i = 1 ∑ n E ∥ e i ∥ 2 4 ≤ n C 4 → 0.
Therefore, we have ( B n ) j k → p ( I d ) j k (B_n)_{jk} \xrightarrow{p} (I_d)_{jk} ( B n ) j k p ( I d ) j k for each fixed pair ( j , k ) (j,k) ( j , k ) . Since d d d is fixed, this gives B n → p I d B_n \xrightarrow{p} I_d B n p I d . By continuity of matrix inversion at I d I_d I d , B n − 1 → p I d B_n^{-1} \xrightarrow{p} I_d B n − 1 p I d . Therefore B n − 1 = O P ( 1 ) B_n^{-1} = O_P(1) B n − 1 = O P ( 1 ) .
Step 7. A n = O P ( 1 ) A_n = O_P(1) A n = O P ( 1 ) . Recall that
A n T = 1 n E ~ T 1 = 1 n ∑ i = 1 n e ~ i . A_n^{\mathsf{T}} = \frac{1}{\sqrt{n}}\widetilde{E}^{\mathsf{T}}\mathbf{1} = \frac{1}{\sqrt{n}}\sum_{i=1}^{n}\widetilde{e}_i. A n T = n 1 E T 1 = n 1 i = 1 ∑ n e i .
Since the rows are mean zero and Cov ( e ~ i ) = I d \operatorname{Cov}(\widetilde{e}_i) = I_d Cov ( e i ) = I d , we have
E ∥ A n ∥ 2 2 = E ∥ 1 n ∑ i = 1 n e ~ i ∥ 2 2 = tr [ Cov ( 1 n ∑ i = 1 n e ~ i ) ] = tr ( I d ) = d . \mathbb{E}\lVert A_n\rVert_2^2 = \mathbb{E}\left\lVert\frac{1}{\sqrt{n}}\sum_{i=1}^{n}\widetilde{e}_i\right\rVert_2^2 = \operatorname{tr}\left[\operatorname{Cov}\left(\frac{1}{\sqrt{n}}\sum_{i=1}^{n}\widetilde{e}_i\right)\right] = \operatorname{tr}(I_d) = d. E ∥ A n ∥ 2 2 = E n 1 i = 1 ∑ n e i 2 2 = tr [ Cov ( n 1 i = 1 ∑ n e i ) ] = tr ( I d ) = d .
Therefore, by Markov’s inequality applied to ∥ A n ∥ 2 2 \lVert A_n\rVert_2^2 ∥ A n ∥ 2 2 , we get
P ( ∥ A n ∥ > M ) = P ( ∥ A n ∥ 2 > M 2 ) ≤ E ∥ A n ∥ 2 M 2 = d M 2 . \mathbb{P}(\lVert A_n\rVert> M) = \mathbb{P}(\lVert A_n\rVert^2 > M^2) \le\frac{\mathbb{E}\lVert A_n\rVert^2}{M^2} = \frac{d}{M^2}. P (∥ A n ∥ > M ) = P (∥ A n ∥ 2 > M 2 ) ≤ M 2 E ∥ A n ∥ 2 = M 2 d .
Now, letting M → ∞ M \to\infty M → ∞ , we get A n = O P ( 1 ) A_n = O_P(1) A n = O P ( 1 ) . Using Step 3, we get
1 T P S 1 = 1 T P E S ‾ 1 = A n B n − 1 A n T ≤ ∥ A n ∥ 2 ∥ B n − 1 ∥ op . \mathbf{1}^{\mathsf{T}}P_{S1} = \mathbf{1}^{\mathsf{T}}P_E\overline{S}\mathbf{1} = A_n B_n^{-1} A_n^{\mathsf{T}} \le\lVert A_n\rVert^2\lVert B_n^{-1}\rVert_{\operatorname{op}}. 1 T P S 1 = 1 T P E S 1 = A n B n − 1 A n T ≤ ∥ A n ∥ 2 ∥ B n − 1 ∥ op .
From Step 6, B n − 1 = O P ( 1 ) B_n^{-1} = O_P(1) B n − 1 = O P ( 1 ) , and from Step 7, A n = O P ( 1 ) A_n = O_P(1) A n = O P ( 1 ) . Thus, we have that
∥ A n ∥ 2 ∥ B n − 1 ∥ op = O P ( 1 ) O P ( 1 ) = O P ( 1 ) . \lVert A_n\rVert^2\lVert B_n^{-1}\rVert_{\operatorname{op}} = O_P(1)O_P(1) = O_P(1). ∥ A n ∥ 2 ∥ B n − 1 ∥ op = O P ( 1 ) O P ( 1 ) = O P ( 1 ) .
Therefore, 1 T P S 1 = O P ( 1 ) \mathbf{1}^{\mathsf{T}}P_{S1} = O_P(1) 1 T P S 1 = O P ( 1 ) . This proves the result. □
Lemma C.4 (Trace bound for a fixed-rank projection). Suppose the conditions of Lemma C.3 hold. Let
P S ∗ = E ∗ S ∗ ( S ∗ T E ∗ T E ∗ S ∗ ) − 1 S ∗ T E ∗ T , P_{S^*} = E^*S^*(S^{*\mathsf{T}}E^{*\mathsf{T}}E^*S^*)^{-1}S^{*\mathsf{T}}E^{*\mathsf{T}}, P S ∗ = E ∗ S ∗ ( S ∗ T E ∗ T E ∗ S ∗ ) − 1 S ∗ T E ∗ T , be the projection onto Col ( E ∗ S ∗ ) \operatorname{Col}(E^*S^*) Col ( E ∗ S ∗ ) for an error matrix E ∗ E^* E ∗ and S ∗ S^* S ∗ has a fixed number of columns, and let F ~ ∗ \widetilde{F}^* F ∗ be centered with bounded second moments and independent of E ∗ E^* E ∗ . Then,
∥ F ~ ∗ T P S ∗ F ~ ∗ ∥ op = O P ( 1 ) . \lVert\widetilde{F}^{*\mathsf{T}}P_{S^*}\widetilde{F}^*\rVert_{\operatorname{op}} = O_P(1). ∥ F ∗ T P S ∗ F ∗ ∥ op = O P ( 1 ) .
Proof. From the same whitening argument as in Lemma C.3, write P S ∗ = E ~ ( E ~ T E ~ ) − 1 E ~ T P_{S^*}=\widetilde{E}(\widetilde{E}^{\mathsf T}\widetilde{E})^{-1}\widetilde{E}^{\mathsf T} P S ∗ = E ( E T E ) − 1 E T , where the rows e ~ i \widetilde{e}_i e i of E ~ \widetilde{E} E are mean zero with covariance I d I_d I d . Define C n = ( F ~ ∗ T E ~ ) / n C_n=(\widetilde{F}^{* \mathsf T}\widetilde{E})/\sqrt{n} C n = ( F ∗ T E ) / n and B n = ( E ~ T E ~ ) / n B_n=(\widetilde{E}^{\mathsf T}\widetilde{E})/n B n = ( E T E ) / n . Then, we have F ~ ∗ T P S ∗ F ~ ∗ = C n B n − 1 C n T \widetilde{F}^{* \mathsf T}P_{S^*}\widetilde{F}^*=C_nB_n^{-1}C_n^{\mathsf T} F ∗ T P S ∗ F ∗ = C n B n − 1 C n T . We first show that ∥ C n ∥ F = O p ( 1 ) \lVert C_n\rVert_F=O_p(1) ∥ C n ∥ F = O p ( 1 ) .
For each entry, we have
( C n ) j k = 1 n ∑ i = 1 n f ~ i j ∗ e ~ i k . (C_n)_{jk}=\frac{1}{\sqrt{n}}\sum_{i=1}^{n}\widetilde{f}_{ij}^{*}\widetilde{e}_{ik}. ( C n ) j k = n 1 i = 1 ∑ n f ij ∗ e ik .
Since F ~ ∗ \widetilde{F}^* F ∗ is centered and independent of E ~ \widetilde{E} E , E ( f ~ i j ∗ e ~ i k ) = 0 \mathbb{E}(\widetilde{f}_{ij}^{*}\widetilde{e}_{ik})=0 E ( f ij ∗ e ik ) = 0 . Also, using independence across i i i ,
Var { ( C n ) j k } = 1 n ∑ i = 1 n E [ ( f ~ i j ∗ ) 2 e ~ i k 2 ] = E ( f ~ i j ∗ ) 2 E ( e ~ i k 2 ) ≤ C , \operatorname{Var}\{(C_n)_{jk}\}=\frac{1}{n}\sum_{i=1}^{n}\mathbb{E}\left[(\widetilde{f}_{ij}^{*})^2\widetilde{e}_{ik}^2\right]=\mathbb{E}(\widetilde{f}_{ij}^{*})^2\mathbb{E}(\widetilde{e}_{ik}^2)\le C, Var {( C n ) j k } = n 1 i = 1 ∑ n E [ ( f ij ∗ ) 2 e ik 2 ] = E ( f ij ∗ ) 2 E ( e ik 2 ) ≤ C ,
where E ( e ~ i k 2 ) = 1 \mathbb{E}(\widetilde{e}_{ik}^2)=1 E ( e ik 2 ) = 1 by Lemma C.3. Hence ( C n ) j k = O p ( 1 ) (C_n)_{jk}=O_p(1) ( C n ) j k = O p ( 1 ) . Since both dimensions are fixed, ∥ C n ∥ F = O p ( 1 ) \lVert C_n\rVert_F=O_p(1) ∥ C n ∥ F = O p ( 1 ) . By Lemma C.3, ∥ B n − 1 ∥ op = O p ( 1 ) \lVert B_n^{-1}\rVert_{\operatorname{op}}=O_p(1) ∥ B n − 1 ∥ op = O p ( 1 ) . Therefore,
tr ( F ~ ∗ T P S ∗ F ~ ∗ ) = tr ( C n B n − 1 C n T ) ≤ ∥ C n ∥ F 2 ∥ B n − 1 ∥ op = O p ( 1 ) . \operatorname{tr}\left(\widetilde{F}^{* \mathsf T}P_{S^*}\widetilde{F}^*\right)=\operatorname{tr}\left(C_nB_n^{-1}C_n^{\mathsf T}\right)\le\lVert C_n\rVert_F^2\lVert B_n^{-1}\rVert_{\operatorname{op}}=O_p(1). tr ( F ∗ T P S ∗ F ∗ ) = tr ( C n B n − 1 C n T ) ≤ ∥ C n ∥ F 2 ∥ B n − 1 ∥ op = O p ( 1 ) .
Since F ~ ∗ T P S ∗ F ~ ∗ \widetilde{F}^{* \mathsf T}P_{S^*}\widetilde{F}^* F ∗ T P S ∗ F ∗ is positive semidefinite, we get
∥ F ~ ∗ T P S ∗ F ~ ∗ ∥ op ≤ tr ( F ~ ∗ T P S ∗ F ~ ∗ ) = O p ( 1 ) . \left\lVert\widetilde{F}^{* \mathsf T}P_{S^*}\widetilde{F}^*\right\rVert_{\operatorname{op}}\le\operatorname{tr}\left(\widetilde{F}^{* \mathsf T}P_{S^*}\widetilde{F}^*\right)=O_p(1). F ∗ T P S ∗ F ∗ op ≤ tr ( F ∗ T P S ∗ F ∗ ) = O p ( 1 ) .
Lemma C.5 (Change of basis for the bias terms). Let Z ^ \widehat{Z} Z be defined as in Equation A.1. Suppose Assumptions 3.1–3.2 and 5.1–5.2 hold. Then, conditional on the training fold,
∥ H 1 T ( 1 n t Z ^ T Z ^ ) − 1 H 1 ∥ op = O p ( 1 ) . \left\lVert\mathbf{H}_1^{\mathsf T}\left(\frac{1}{n_t}\widehat{Z}^{\mathsf T}\widehat{Z}\right)^{-1}\mathbf{H}_1\right\rVert_{\operatorname{op}}=O_p(1). H 1 T ( n t 1 Z T Z ) − 1 H 1 op = O p ( 1 ) .
Proof. Recall M = 1 n t Z ^ T Z ^ M=\frac{1}{n_t}\widehat{Z}^{\mathsf T}\widehat{Z} M = n t 1 Z T Z , with all matrices restricted to treated rows.
Step 1: Change of basis. Since H 1 \mathbf{H}_1 H 1 is full column rank, write H 1 = U R \mathbf{H}_1=UR H 1 = U R , where U ∈ R ( 1 + p ~ + q ~ ) × ( 1 + p ‾ + q ‾ ) U\in\mathbb{R}^{(1+\widetilde{p}+\widetilde{q})\times(1+\overline{p}+\overline{q})} U ∈ R ( 1 + p + q ) × ( 1 + p + q ) has orthonormal columns and R R R is invertible. By Proposition 5.1, ν min ( R ) ≥ c \nu_{\min}(R)\ge c ν m i n ( R ) ≥ c , and ∥ R ∥ op ≤ C \lVert R\rVert_{\operatorname{op}}\le C ∥ R ∥ op ≤ C . Now, we extend U U U to a full orthonormal basis of R 1 + p ~ + q ~ \mathbb{R}^{1+\widetilde{p}+\widetilde{q}} R 1 + p + q using a matrix S ∈ R ( 1 + p ~ + q ~ ) × ( p ~ − p ‾ + q ~ − q ‾ ) S\in\mathbb{R}^{(1+\widetilde{p}+\widetilde{q})\times(\widetilde{p}-\overline{p}+\widetilde{q}-\overline{q})} S ∈ R ( 1 + p + q ) × ( p − p + q − q ) whose columns are orthonormal to U U U , so that J = [ U S ] J=[U\ S] J = [ U S ] is square and orthogonal. Thus, S T H 1 = S T U R = 0 S^{\mathsf T}\mathbf{H}_1=S^{\mathsf T}UR=0 S T H 1 = S T U R = 0 .
Since J J J is orthogonal, J − 1 = J T J^{-1}=J^{\mathsf T} J − 1 = J T and ( J T M J ) − 1 = J T M − 1 J (J^{\mathsf T}MJ)^{-1}=J^{\mathsf T}M^{-1}J ( J T M J ) − 1 = J T M − 1 J , so M − 1 = J ( J T M J ) − 1 J T M^{-1}=J(J^{\mathsf T}MJ)^{-1}J^{\mathsf T} M − 1 = J ( J T M J ) − 1 J T . Also,
J T H 1 = J T U R = ( U T U S T U ) R = ( I 0 ) R = ( R 0 ) , J^{\mathsf T}\mathbf{H}_1=J^{\mathsf T}UR=
\begin{pmatrix}
U^{\mathsf T}U\\
S^{\mathsf T}U
\end{pmatrix}R=
\begin{pmatrix}
I\\
0
\end{pmatrix}R=
\begin{pmatrix}
R\\
0
\end{pmatrix}, J T H 1 = J T U R = ( U T U S T U ) R = ( I 0 ) R = ( R 0 ) ,
Similarly, we have that H 1 T J = ( R T 0 ) \mathbf{H}_1^{\mathsf T}J=(R^{\mathsf T}\ \ 0) H 1 T J = ( R T 0 ) .
Step 2: Matrix J T M J J^{\mathsf T}MJ J T M J . We write M = H 1 Σ F H 1 T + H 1 B + B T H 1 T + C M=\mathbf{H}_1\Sigma_F\mathbf{H}_1^{\mathsf T}+\mathbf{H}_1B+B^{\mathsf T}\mathbf{H}_1^{\mathsf T}+C M = H 1 Σ F H 1 T + H 1 B + B T H 1 T + C , where Σ F = n t − 1 F 1 T F 1 \Sigma_F=n_t^{-1}F_1^{\mathsf T}F_1 Σ F = n t − 1 F 1 T F 1 , B = n t − 1 F 1 T E 0 B=n_t^{-1}F_1^{\mathsf T}E_0 B = n t − 1 F 1 T E 0 , and C = E 0 T E 0 / n t C=E_0^{\mathsf T}E_0/n_t C = E 0 T E 0 / n t . Now, using H 1 = U R \mathbf{H}_1=UR H 1 = U R and the orthogonality of S T U = 0 S^{\mathsf T}U=0 S T U = 0 , we get that
J T M J = [ R Σ F R T ⏟ = D + R B U + U T B T R T + U T C U ⏟ = K 11 R B S + U T C S ⏟ = K 12 S T B T R T + S T C U ⏟ = K 21 S T C S ⏟ = K 22 ] . J^{\mathsf T}MJ=
\begin{bmatrix}
\underbrace{R\Sigma_FR^{\mathsf T}}_{=D}+
\underbrace{RBU+U^{\mathsf T}B^{\mathsf T}R^{\mathsf T}+U^{\mathsf T}CU}_{=K_{11}}&
\underbrace{RBS+U^{\mathsf T}CS}_{=K_{12}}\\
\underbrace{S^{\mathsf T}B^{\mathsf T}R^{\mathsf T}+S^{\mathsf T}CU}_{=K_{21}}&
\underbrace{S^{\mathsf T}CS}_{=K_{22}}
\end{bmatrix}. J T M J = = D R Σ F R T + = K 11 R B U + U T B T R T + U T C U = K 21 S T B T R T + S T C U = K 12 R B S + U T C S = K 22 S T C S .
Step 3: Schur complement and E n E_n E n . By the block matrix inversion formula, the ( 1 , 1 ) (1,1) ( 1 , 1 ) block of ( J T M J ) − 1 (J^{\mathsf T}MJ)^{-1} ( J T M J ) − 1 is the inverse of the Schur complement
D + K 11 − K 12 K 22 − 1 K 21 ⏟ = E n = D + E n . D+K_{11}-\underbrace{K_{12}K_{22}^{-1}K_{21}}_{=E_n}=D+E_n. D + K 11 − = E n K 12 K 22 − 1 K 21 = D + E n .
Now, substituting the explicit expressions for B B B and C C C , the cross term K 12 K 22 − 1 K 21 K_{12}K_{22}^{-1}K_{21} K 12 K 22 − 1 K 21 simplifies as follows. First, factor as
K 12 = 1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) E 0 S , K 21 = 1 n t S ⊤ E 0 ⊤ ( F 1 R ⊤ + E 0 U ) , K 22 = 1 n t S ⊤ E 0 ⊤ E 0 S . K_{12} = \frac{1}{n_t}(RF_1^{\top} + U^{\top}E_0^{\top})E_0S,\qquad K_{21} = \frac{1}{n_t}S^{\top}E_0^{\top}(F_1R^{\top} + E_0U),\qquad K_{22} = \frac{1}{n_t}S^{\top}E_0^{\top}E_0S. K 12 = n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) E 0 S , K 21 = n t 1 S ⊤ E 0 ⊤ ( F 1 R ⊤ + E 0 U ) , K 22 = n t 1 S ⊤ E 0 ⊤ E 0 S .
Therefore, we will get
K 12 K 22 − 1 K 21 = 1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ ( F 1 R ⊤ + E 0 U ) = 1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) P S ( F 1 R ⊤ + E 0 U ) , \begin{aligned}
K_{12}K_{22}^{-1}K_{21}
&= \frac{1}{n_t}(RF_1^{\top} + U^{\top}E_0^{\top})E_0S(S^{\top}E_0^{\top}E_0S)^{-1}S^{\top}E_0^{\top}(F_1R^{\top} + E_0U) \\
&= \frac{1}{n_t}(RF_1^{\top} + U^{\top}E_0^{\top})P_S(F_1R^{\top} + E_0U),
\end{aligned} K 12 K 22 − 1 K 21 = n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ ( F 1 R ⊤ + E 0 U ) = n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) P S ( F 1 R ⊤ + E 0 U ) ,
where P S = E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ P_S = E_0S(S^{\top}E_0^{\top}E_0S)^{-1}S^{\top}E_0^{\top} P S = E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ is the orthogonal projection onto the column space of E 0 S E_0S E 0 S . Thus,
E n = K 11 − K 12 K 22 − 1 K 21 = 1 n t R F 1 ⊤ E 0 U + 1 n t U ⊤ E 0 ⊤ F 1 R ⊤ + 1 n t U ⊤ E 0 ⊤ E 0 U E_n = K_{11} - K_{12}K_{22}^{-1}K_{21} = \frac{1}{n_t}RF_1^{\top}E_0U + \frac{1}{n_t}U^{\top}E_0^{\top}F_1R^{\top} + \frac{1}{n_t}U^{\top}E_0^{\top}E_0U E n = K 11 − K 12 K 22 − 1 K 21 = n t 1 R F 1 ⊤ E 0 U + n t 1 U ⊤ E 0 ⊤ F 1 R ⊤ + n t 1 U ⊤ E 0 ⊤ E 0 U
− 1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) P S ( F 1 R ⊤ + E 0 U ) . -\frac{1}{n_t}(RF_1^{\top} + U^{\top}E_0^{\top})P_S(F_1R^{\top} + E_0U). − n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) P S ( F 1 R ⊤ + E 0 U ) .
To simplify, we observe that the first three terms can be written as
1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) ( F 1 R ⊤ + E 0 U ) − 1 n t R F 1 ⊤ F 1 R ⊤ , \frac{1}{n_t}(RF_1^{\top} + U^{\top}E_0^{\top})(F_1R^{\top} + E_0U) - \frac{1}{n_t}RF_1^{\top}F_1R^{\top}, n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) ( F 1 R ⊤ + E 0 U ) − n t 1 R F 1 ⊤ F 1 R ⊤ ,
so that
E n = 1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) ( I − P S ) ( F 1 R ⊤ + E 0 U ) − 1 n t R F 1 ⊤ F 1 R ⊤ . E_n = \frac{1}{n_t}(RF_1^{\top} + U^{\top}E_0^{\top})(I-P_S)(F_1R^{\top} + E_0U) - \frac{1}{n_t}RF_1^{\top}F_1R^{\top}. E n = n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) ( I − P S ) ( F 1 R ⊤ + E 0 U ) − n t 1 R F 1 ⊤ F 1 R ⊤ .
Now, expanding ( I − P S ) (I-P_S) ( I − P S ) and collecting terms by whether they involve P S P_S P S or not, this becomes
E n = − 1 n t R F 1 ⊤ P S F 1 R ⊤ + 1 n t R F 1 ⊤ ( I − P S ) E 0 U + 1 n t U ⊤ E 0 ⊤ ( I − P S ) F 1 R ⊤ + 1 n t U ⊤ E 0 ⊤ ( I − P S ) E 0 U . (32) \begin{aligned}
E_n ={}& -\frac{1}{n_t}RF_1^{\top}P_SF_1R^{\top} + \frac{1}{n_t}RF_1^{\top}(I-P_S)E_0U \\
&+ \frac{1}{n_t}U^{\top}E_0^{\top}(I-P_S)F_1R^{\top} + \frac{1}{n_t}U^{\top}E_0^{\top}(I-P_S)E_0U. \tag*{(32)}
\end{aligned} E n = − n t 1 R F 1 ⊤ P S F 1 R ⊤ + n t 1 R F 1 ⊤ ( I − P S ) E 0 U + n t 1 U ⊤ E 0 ⊤ ( I − P S ) F 1 R ⊤ + n t 1 U ⊤ E 0 ⊤ ( I − P S ) E 0 U . (32)
Step 4: Invertibility of D + E n D + E_n D + E n . We show that λ min ( D + E n ) \lambda_{\min}(D + E_n) λ m i n ( D + E n ) is bounded away from zero with probability tending to one. Thus, we apply Weyl’s inequality
λ min ( D + E n ) ≥ λ min ( D ) − ∥ E n ∥ . \lambda_{\min}(D + E_n) \geq\lambda_{\min}(D) - \lVert E_n\rVert. λ m i n ( D + E n ) ≥ λ m i n ( D ) − ∥ E n ∥ .
The argument shows that D D D has smallest eigenvalue bounded away from zero, while ∥ E n ∥ = o p ( 1 ) \lVert E_n\rVert= o_p(1) ∥ E n ∥ = o p ( 1 ) .
Lower bound on λ min ( D ) \lambda_{\min}(D) λ m i n ( D ) . Since D = 1 n t R F 1 ⊤ F 1 R ⊤ D = \frac{1}{n_t}RF_1^{\top}F_1R^{\top} D = n t 1 R F 1 ⊤ F 1 R ⊤ ,
λ min ( D ) ≥ ν min 2 ( R ) λ min ( 1 n t F 1 ⊤ F 1 ) . \lambda_{\min}(D) \geq\nu_{\min}^{2}(R)\lambda_{\min}\left(\frac{1}{n_t}F_1^{\top}F_1\right). λ m i n ( D ) ≥ ν m i n 2 ( R ) λ m i n ( n t 1 F 1 ⊤ F 1 ) .
The treated-unit factor Gram matrix concentrates around the conditional second-moment matrix Ω 1 = E [ f 1 , i f 1 , i ⊤ ∣ A i = 1 ] \Omega_1 = \mathbb{E}[f_{1,i}f_{1,i}^{\top}\mid A_i = 1] Ω 1 = E [ f 1 , i f 1 , i ⊤ ∣ A i = 1 ] , which is positive definite by Assumption 3.1, so λ min ( 1 n t F 1 ⊤ F 1 ) ≥ c > 0 \lambda_{\min}\left(\frac{1}{n_t}F_1^{\top}F_1\right) \geq c > 0 λ m i n ( n t 1 F 1 ⊤ F 1 ) ≥ c > 0 with probability tending to one. With ν min ( R ) ≥ c R > 0 \nu_{\min}(R) \geq c_R > 0 ν m i n ( R ) ≥ c R > 0 by construction, so
λ min ( D ) ≥ c ⋅ c R 2 > 0 \lambda_{\min}(D) \geq c \cdot c_R^2 > 0 λ m i n ( D ) ≥ c ⋅ c R 2 > 0
with probability tending to one.
Upper bound on ∥ E n ∥ \lVert E_n\rVert ∥ E n ∥ . From the expansion (C.6), the triangle inequality gives
∥ E n ∥ ≤ ∥ 1 n t R F 1 ⊤ P S F 1 R ⊤ ∥ ⏟ T 1 + ∥ 1 n t R F 1 ⊤ ( I − P S ) E 0 U ∥ ⏟ T 2 + ∥ 1 n t U ⊤ E 0 ⊤ ( I − P S ) F 1 R ⊤ ∥ ⏟ T 3 + ∥ 1 n t U ⊤ E 0 ⊤ ( I − P S ) E 0 U ∥ ⏟ T 4 . \lVert E_n\rVert\leq\underbrace{\left\lVert\frac{1}{n_t}RF_1^{\top}P_SF_1R^{\top}\right\rVert}_{T_1} + \underbrace{\left\lVert\frac{1}{n_t}RF_1^{\top}(I-P_S)E_0U\right\rVert}_{T_2} + \underbrace{\left\lVert\frac{1}{n_t}U^{\top}E_0^{\top}(I-P_S)F_1R^{\top}\right\rVert}_{T_3} + \underbrace{\left\lVert\frac{1}{n_t}U^{\top}E_0^{\top}(I-P_S)E_0U\right\rVert}_{T_4}. ∥ E n ∥ ≤ T 1 n t 1 R F 1 ⊤ P S F 1 R ⊤ + T 2 n t 1 R F 1 ⊤ ( I − P S ) E 0 U + T 3 n t 1 U ⊤ E 0 ⊤ ( I − P S ) F 1 R ⊤ + T 4 n t 1 U ⊤ E 0 ⊤ ( I − P S ) E 0 U .
We bound each term in turn.
Bound on T 1 T_1 T 1 . Since R R R has bounded operator norm,
T 1 ≤ ∥ R ∥ 2 ∥ 1 n t F 1 ⊤ P S F 1 ∥ . T_1 \leq\lVert R\rVert^2\left\lVert\frac{1}{n_t}F_1^{\top}P_SF_1\right\rVert. T 1 ≤ ∥ R ∥ 2 n t 1 F 1 ⊤ P S F 1 .
Write F 1 = 1 μ F ⊤ + F ~ 1 F_1 = 1\mu_F^\top+ \widetilde{F}_1 F 1 = 1 μ F ⊤ + F 1 , where F ~ 1 \widetilde{F}_1 F 1 is the centred part. Then
F 1 ⊤ P S F 1 = μ F 1 ⊤ P S 1 μ F ⊤ + μ F 1 ⊤ P S F ~ 1 + F ~ 1 ⊤ P S 1 μ F ⊤ + F ~ 1 ⊤ P S F ~ 1 . F_1^\top P_S F_1 = \mu_F 1^\top P_S 1\mu_F^\top+ \mu_F 1^\top P_S\widetilde{F}_1 + \widetilde{F}_1^\top P_S 1\mu_F^\top+ \widetilde{F}_1^\top P_S\widetilde{F}_1. F 1 ⊤ P S F 1 = μ F 1 ⊤ P S 1 μ F ⊤ + μ F 1 ⊤ P S F 1 + F 1 ⊤ P S 1 μ F ⊤ + F 1 ⊤ P S F 1 .
By the triangle inequality,
∥ 1 n t F 1 ⊤ P S F 1 ∥ o p ≤ 1 n t ∥ μ F 1 ⊤ P S 1 μ F ⊤ ∥ o p ⏟ A 1 + 1 n t ∥ μ F 1 ⊤ P S F ~ 1 ∥ o p ⏟ A 2 + 1 n t ∥ F ~ 1 ⊤ P S 1 μ F ⊤ ∥ o p ⏟ A 3 + 1 n t ∥ F ~ 1 ⊤ P S F ~ 1 ∥ o p ⏟ A 4 . \left\|\frac{1}{n_t}F_1^\top P_S F_1\right\|_{\mathrm{op}} \leq\underbrace{\frac{1}{n_t}\left\|\mu_F1^\top P_S1\mu_F^\top\right\|_{\mathrm{op}}}_{A_1}+\underbrace{\frac{1}{n_t}\left\|\mu_F1^\top P_S\widetilde{F}_1\right\|_{\mathrm{op}}}_{A_2}+\underbrace{\frac{1}{n_t}\left\|\widetilde{F}_1^\top P_S1\mu_F^\top\right\|_{\mathrm{op}}}_{A_3}+\underbrace{\frac{1}{n_t}\left\|\widetilde{F}_1^\top P_S\widetilde{F}_1\right\|_{\mathrm{op}}}_{A_4}. n t 1 F 1 ⊤ P S F 1 op ≤ A 1 n t 1 μ F 1 ⊤ P S 1 μ F ⊤ op + A 2 n t 1 μ F 1 ⊤ P S F 1 op + A 3 n t 1 F 1 ⊤ P S 1 μ F ⊤ op + A 4 n t 1 F 1 ⊤ P S F 1 op .
For A 1 A_1 A 1 , by Lemma C.3, 1 ⊤ P S 1 = O p ( 1 ) 1^\top P_S1 = O_p(1) 1 ⊤ P S 1 = O p ( 1 ) . Thus,
A 1 = 1 n t ∥ μ F 1 ⊤ P S 1 μ F ⊤ ∥ o p = 1 n t ∥ μ F ∥ 2 2 1 ⊤ P S 1 = O p ( ∥ μ F ∥ 2 2 n t ) . A_1=\frac{1}{n_t}\left\|\mu_F1^\top P_S1\mu_F^\top\right\|_{\mathrm{op}}=\frac{1}{n_t}\|\mu_F\|_2^2 1^\top P_S1=O_p\left(\frac{\|\mu_F\|_2^2}{n_t}\right). A 1 = n t 1 μ F 1 ⊤ P S 1 μ F ⊤ op = n t 1 ∥ μ F ∥ 2 2 1 ⊤ P S 1 = O p ( n t ∥ μ F ∥ 2 2 ) .
For A 2 A_2 A 2 , since P S P_S P S is an orthogonal projection, 1 ⊤ P S F ~ 1 = ( P S 1 ) ⊤ ( P S F ~ 1 ) 1^\top P_S\widetilde{F}_1=(P_S1)^\top(P_S\widetilde{F}_1) 1 ⊤ P S F 1 = ( P S 1 ) ⊤ ( P S F 1 ) , so
A 2 ≤ 1 n t ∥ μ F ∥ 2 ∥ P S 1 ∥ 2 ∥ P S F ~ 1 ∥ o p = 1 n t ∥ μ F ∥ 2 ( 1 ⊤ P S 1 ) 1 / 2 ∥ F ~ 1 ⊤ P S F ~ 1 ∥ o p 1 / 2 = O p ( ∥ μ F ∥ 2 n t ) , A_2\leq\frac{1}{n_t}\|\mu_F\|_2\|P_S1\|_2\|P_S\widetilde{F}_1\|_{\mathrm{op}}=\frac{1}{n_t}\|\mu_F\|_2(1^\top P_S1)^{1/2}\|\widetilde{F}_1^\top P_S\widetilde{F}_1\|_{\mathrm{op}}^{1/2}=O_p\left(\frac{\|\mu_F\|_2}{n_t}\right), A 2 ≤ n t 1 ∥ μ F ∥ 2 ∥ P S 1 ∥ 2 ∥ P S F 1 ∥ op = n t 1 ∥ μ F ∥ 2 ( 1 ⊤ P S 1 ) 1/2 ∥ F 1 ⊤ P S F 1 ∥ op 1/2 = O p ( n t ∥ μ F ∥ 2 ) ,
where the last equality uses A 1 A_1 A 1 and Lemma C.4 . Since the term A 3 A_3 A 3 is the transpose of the term in A 2 A_2 A 2 , A 3 = O p ( ∥ μ F ∥ 2 / n t ) A_3=O_p(\|\mu_F\|_2/n_t) A 3 = O p ( ∥ μ F ∥ 2 / n t ) . Lastly, for A 4 A_4 A 4 , Lemma C.4 gives ∥ F ~ 1 ⊤ P S F ~ 1 ∥ o p = O p ( 1 ) \|\widetilde{F}_1^\top P_S\widetilde{F}_1\|_{\mathrm{op}}=O_p(1) ∥ F 1 ⊤ P S F 1 ∥ op = O p ( 1 ) , so A 4 = O p ( 1 / n t ) A_4=O_p(1/n_t) A 4 = O p ( 1/ n t ) . Finally, combining the four terms, we get that
∥ 1 n t F 1 ⊤ P S F 1 ∥ o p ≤ A 1 + A 2 + A 3 + A 4 = O p ( 1 + ∥ μ F ∥ 2 + ∥ μ F ∥ 2 2 n t ) . (33) \left\|\frac{1}{n_t}F_1^\top P_SF_1\right\|_{\mathrm{op}}\leq A_1+A_2+A_3+A_4=O_p\left(\frac{1+\|\mu_F\|_2+\|\mu_F\|_2^2}{n_t}\right). \tag*{(33)} n t 1 F 1 ⊤ P S F 1 op ≤ A 1 + A 2 + A 3 + A 4 = O p ( n t 1 + ∥ μ F ∥ 2 + ∥ μ F ∥ 2 2 ) . (33)
Since ∥ R ∥ o p ≤ C \|R\|_{\mathrm{op}}\leq C ∥ R ∥ op ≤ C , it follows that T 1 = O p ( n t − 1 ( 1 + ∥ μ F ∥ 2 + ∥ μ F ∥ 2 2 ) ) T_1=O_p(n_t^{-1}(1+\|\mu_F\|_2+\|\mu_F\|_2^2)) T 1 = O p ( n t − 1 ( 1 + ∥ μ F ∥ 2 + ∥ μ F ∥ 2 2 )) .
*Bound on T 2 T_2 T 2 and T 3 . ∗ T_3.* T 3 . ∗ Since ∥ U ∥ = 1 \|U\|=1 ∥ U ∥ = 1 , ∥ R ∥ = O ( 1 ) \|R\|=O(1) ∥ R ∥ = O ( 1 ) , we get
T 2 ≤ 1 n t ∥ R F ⊤ ( I − P S ) E 0 U ∥ ≤ 1 n t ∥ R ∥ ( ∥ F ⊤ E 0 ∥ + ∥ F ⊤ P S ∥ ∥ E 0 ∥ ) ∥ U ∥ ≤ C n t ( ∥ F ⊤ E 0 ∥ + ∥ F ⊤ P S ∥ ∥ E 0 ∥ ) . T_2\leq\frac{1}{n_t}\|RF^\top(I-P_S)E_0U\|\leq\frac{1}{n_t}\|R\|(\|F^\top E_0\|+\|F^\top P_S\|\|E_0\|)\|U\|\leq\frac{C}{n_t}(\|F^\top E_0\|+\|F^\top P_S\|\|E_0\|). T 2 ≤ n t 1 ∥ R F ⊤ ( I − P S ) E 0 U ∥ ≤ n t 1 ∥ R ∥ ( ∥ F ⊤ E 0 ∥ + ∥ F ⊤ P S ∥∥ E 0 ∥ ) ∥ U ∥ ≤ n t C ( ∥ F ⊤ E 0 ∥ + ∥ F ⊤ P S ∥∥ E 0 ∥ ) .
By Lemma C.2 (ii), ∥ 1 n t F ⊤ E 0 ∥ = O p { ( p ∧ q ) − 1 / 2 } \left\|\frac{1}{\sqrt{n_t}}F^\top E_0\right\|=O_p\{(p\wedge q)^{-1/2}\} n t 1 F ⊤ E 0 = O p {( p ∧ q ) − 1/2 } , by Lemmas C.3–C.4 , ∥ F ⊤ P S F ∥ o p = O P ( 1 ) \|F^\top P_SF\|_{\mathrm{op}}=O_P(1) ∥ F ⊤ P S F ∥ op = O P ( 1 ) and by Lemma C.2 (i), we have ∥ E 0 ∥ o p = O P ( n t / ( p ∧ q ) ) \|E_0\|_{\mathrm{op}}=O_P(\sqrt{n_t/(p\wedge q)}) ∥ E 0 ∥ op = O P ( n t / ( p ∧ q ) ) . So, we have
T 2 = O P ( 1 n t n t p ∧ q ) = O P ( 1 n t ( p ∧ q ) ) , T_2=O_P\left(\frac{1}{n_t}\sqrt{\frac{n_t}{p\wedge q}}\right)=O_P\left(\frac{1}{\sqrt{n_t(p\wedge q)}}\right), T 2 = O P ( n t 1 p ∧ q n t ) = O P ( n t ( p ∧ q ) 1 ) ,
so we have T 2 , T 3 = O p ( 1 / n t ( p ∧ q ) ) T_2,T_3=O_p(1/\sqrt{n_t(p\wedge q)}) T 2 , T 3 = O p ( 1/ n t ( p ∧ q ) ) .
*Bound on T 4 . ∗ T_4.* T 4 . ∗ Using ∥ U ∥ = 1 \|U\|=1 ∥ U ∥ = 1 and ∥ I − P S ∥ ≤ 1 \|I-P_S\|\leq1 ∥ I − P S ∥ ≤ 1 ,
T 4 ≤ ∥ 1 n t E 0 ⊤ E 0 ∥ = O p ( 1 p ∧ q ) . (34) T_4\leq\left\|\frac{1}{n_t}E_0^\top E_0\right\|=O_p\left(\frac{1}{p\wedge q}\right). \tag*{(34)} T 4 ≤ n t 1 E 0 ⊤ E 0 = O p ( p ∧ q 1 ) . (34)
where the last equality follows from Lemma C.2 . Hence, T 4 = O p ( 1 / ( p ∧ q ) ) T_4=O_p(1/(p\wedge q)) T 4 = O p ( 1/ ( p ∧ q )) .
Combining the bounds. Now, collecting Equations (C.7) and (C.8), we get
∥ E n ∥ = O p ( 1 + ∥ μ F ∥ 2 + ∥ μ F ∥ 2 2 n t + 1 n t ( p ∧ q ) + 1 p ∧ q ) . (35) \|E_n\|=O_p\left(\frac{1+\|\mu_F\|_2+\|\mu_F\|_2^2}{n_t}+\frac{1}{\sqrt{n_t(p\wedge q)}}+\frac{1}{p\wedge q}\right). \tag*{(35)} ∥ E n ∥ = O p ( n t 1 + ∥ μ F ∥ 2 + ∥ μ F ∥ 2 2 + n t ( p ∧ q ) 1 + p ∧ q 1 ) . (35)
Each term vanishes once n t → ∞ n_t\to\infty n t → ∞ and p ∧ q → ∞ p\wedge q\to\infty p ∧ q → ∞ , so ∥ E n ∥ = o p ( 1 ) \|E_n\|=o_p(1) ∥ E n ∥ = o p ( 1 ) under the growth conditions of the theorem, with no relative rate between n t n_t n t and p ∧ q p\wedge q p ∧ q required. Weyl’s inequality then gives
λ min ( D + E n ) ≥ c R 2 − ∥ E n ∥ ≥ c R 2 − o p ( 1 ) ≥ c R 2 2 > 0 \lambda_{\min}(D+E_n)\geq c_R^2-\|E_n\|\geq c_R^2-o_p(1)\geq\frac{c_R^2}{2}>0 λ m i n ( D + E n ) ≥ c R 2 − ∥ E n ∥ ≥ c R 2 − o p ( 1 ) ≥ 2 c R 2 > 0
with probability tending to one, and therefore
∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) . (36) \|(D+E_n)^{-1}\|_{\mathrm{op}}=O_p(1). \tag*{(36)} ∥ ( D + E n ) − 1 ∥ op = O p ( 1 ) . (36)
In conclusion, the change of basis gives M − 1 = J ( J T M J ) − 1 J T M^{-1}=J(J^{\mathsf T}MJ)^{-1}J^{\mathsf T} M − 1 = J ( J T M J ) − 1 J T and H 1 T J = ( R T 0 ) H_1^{\mathsf T}J=(R^{\mathsf T}\ \ 0) H 1 T J = ( R T 0 ) , and the ( 1 , 1 ) (1,1) ( 1 , 1 ) block of ( J T M J ) − 1 (J^{\mathsf T}MJ)^{-1} ( J T M J ) − 1 is the inverse Schur complement ( D + E n ) − 1 (D+E_n)^{-1} ( D + E n ) − 1 . Putting these together,
H 1 T M − 1 H 1 = H 1 T J ( J T M J ) − 1 J T H 1 = ( R T 0 ) ( J T M J ) − 1 ( R 0 ) = R T ( D + E n ) − 1 R . H_1^{\mathsf T}M^{-1}H_1=H_1^{\mathsf T}J(J^{\mathsf T}MJ)^{-1}J^{\mathsf T}H_1=(R^{\mathsf T}\ \ 0)(J^{\mathsf T}MJ)^{-1}\begin{pmatrix}R\\0\end{pmatrix}=R^{\mathsf T}(D+E_n)^{-1}R. H 1 T M − 1 H 1 = H 1 T J ( J T M J ) − 1 J T H 1 = ( R T 0 ) ( J T M J ) − 1 ( R 0 ) = R T ( D + E n ) − 1 R .
Since ∥ R ∥ o p = O ( 1 ) \lVert R\rVert_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) and ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) \lVert(D+E_n)^{-1}\rVert_{\mathrm{op}}=O_p(1) ∥( D + E n ) − 1 ∥ op = O p ( 1 ) by Equation (C.10),
∥ H 1 T M − 1 H 1 ∥ o p ≤ ∥ R ∥ o p 2 ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) , \left\lVert H_1^{\mathsf T}M^{-1}H_1\right\rVert_{\mathrm{op}}\leq\lVert R\rVert_{\mathrm{op}}^2\lVert(D+E_n)^{-1}\rVert_{\mathrm{op}}=O_p(1), H 1 T M − 1 H 1 op ≤ ∥ R ∥ op 2 ∥( D + E n ) − 1 ∥ op = O p ( 1 ) ,
which is what the lemma claims. The proof also gives two facts we use later, the bound ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) \lVert(D+E_n)^{-1}\rVert_{\mathrm{op}}=O_p(1) ∥( D + E n ) − 1 ∥ op = O p ( 1 ) and the orthogonality e 1 T S = 0 e_1^{\mathsf T}S=0 e 1 T S = 0 . The second holds because the first column of H 1 = diag ( 1 , H X , H M ) H_1=\operatorname{diag}(1,H_X,H_M) H 1 = diag ( 1 , H X , H M ) is e 1 e_1 e 1 , so e 1 e_1 e 1 lies in Col ( H 1 ) = Col ( U ) \operatorname{Col}(H_1)=\operatorname{Col}(U) Col ( H 1 ) = Col ( U ) , and the columns of S S S are orthogonal to that space by construction.
Consistency and linear expansion of γ ^ 1 \hat{\gamma}_1 γ ^ 1
We next establish the linear expansion of the first-stage mediator coefficient γ ^ 1 \hat{\gamma}_1 γ ^ 1 . The quantity H M T γ ^ 1 H_M^{\mathsf T}\hat{\gamma}_1 H M T γ ^ 1 enters the second-stage bridge regression, so we need both its convergence rate and its leading term.
For this lemma and its proof, every sum over i i i runs over the treated units { i : A i = 1 } \{i:A_i=1\} { i : A i = 1 } , the matrices Z ^ , F 1 , E 0 , ϵ 1 \hat{Z},F_1,E_0,\epsilon_1 Z ^ , F 1 , E 0 , ϵ 1 collect treated rows only, and M = 1 n t Z ^ T Z ^ M=\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z} M = n t 1 Z ^ T Z ^ . The treated regression involves the conditional second-moment matrix Ω 1 = E [ f 1 , i f 1 , i T ∣ A i = 1 ] \Omega_1=\mathbb{E}[f_{1,i}f_{1,i}^{\mathsf T}\mid A_i=1] Ω 1 = E [ f 1 , i f 1 , i T ∣ A i = 1 ] , positive definite by Assumption 3.1(iii)–(iv).
Lemma C.6. Suppose Assumptions 3.1–3.2 and 5.1–5.2 hold. Then,
H M T γ ^ 1 − γ 1 = P q ˉ Ω 1 − 1 1 n t ∑ i : A i = 1 f 1 , i ϵ 1 , i + r γ , ∥ r γ ∥ 2 = o p ( n t − 1 / 2 ) . H_M^{\mathsf T}\hat{\gamma}_1-\gamma_1=P_{\bar{q}}\Omega_1^{-1}\frac{1}{n_t}\sum_{i:A_i=1}f_{1,i}\epsilon_{1,i}+r_\gamma,\qquad\lVert r_\gamma\rVert_2=o_p(n_t^{-1/2}). H M T γ ^ 1 − γ 1 = P q ˉ Ω 1 − 1 n t 1 i : A i = 1 ∑ f 1 , i ϵ 1 , i + r γ , ∥ r γ ∥ 2 = o p ( n t − 1/2 ) .
Proof. We want to show that
n t ( H M T γ ^ 1 − γ 1 ) = O p ( 1 ) , \sqrt{n_t}\left(H_M^{\mathsf T}\hat{\gamma}_1-\gamma_1\right)=O_p(1), n t ( H M T γ ^ 1 − γ 1 ) = O p ( 1 ) ,
Let S q ~ S_{\tilde{q}} S q ~ be the projected mediator selector and P q ˉ P_{\bar{q}} P q ˉ be the true mediator selector defined in the notation section, so that H M T S q ~ = P q ˉ H 1 T H_M^{\mathsf T}S_{\tilde{q}}=P_{\bar{q}}H_1^{\mathsf T} H M T S q ~ = P q ˉ H 1 T . From γ ^ 1 \hat{\gamma}_1 γ ^ 1 on the treated units, we have
H M T γ ^ 1 = H M T S q ~ ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T Y . H_M^{\mathsf T}\hat{\gamma}_1=H_M^{\mathsf T}S_{\tilde{q}}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\mathsf T}Y. H M T γ ^ 1 = H M T S q ~ ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T Y .
Now, using the outcome model Y = Z δ + ϵ 1 Y=Z\delta+\epsilon_1 Y = Z δ + ϵ 1 on the treated units, we get that
H M T γ ^ 1 = H M T S q ~ ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T ( Z δ + ϵ 1 ) = H M T S q ~ ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T { Z ^ δ + ( Z − Z ^ ) δ + ϵ 1 } = γ 1 + H M T S q ~ ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T ( Z − Z ^ ) δ + H M T S q ~ ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T ϵ 1 . \begin{aligned}
H_M^{\mathsf T}\hat{\gamma}_1
&=H_M^{\mathsf T}S_{\tilde{q}}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\mathsf T}(Z\delta+\epsilon_1)\\
&=H_M^{\mathsf T}S_{\tilde{q}}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\mathsf T}\{\hat{Z}\delta+(Z-\hat{Z})\delta+\epsilon_1\}\\
&=\gamma_1+H_M^{\mathsf T}S_{\tilde{q}}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\mathsf T}(Z-\hat{Z})\delta+H_M^{\mathsf T}S_{\tilde{q}}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\mathsf T}\epsilon_1.
\end{aligned} H M T γ ^ 1 = H M T S q ~ ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T ( Z δ + ϵ 1 ) = H M T S q ~ ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T { Z ^ δ + ( Z − Z ^ ) δ + ϵ 1 } = γ 1 + H M T S q ~ ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T ( Z − Z ^ ) δ + H M T S q ~ ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T ϵ 1 .
Since Z − Z ^ = − E 0 Z-\hat{Z}=-E_0 Z − Z ^ = − E 0 , we have
n t ( H M T γ ^ 1 − γ 1 ) = − H M T S q ~ ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T E 0 δ + H M T S q ~ ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T ϵ 1 = − P q ˉ H 1 T ( 1 n t Z ^ T Z ^ ) − 1 1 n t ( H 1 F 1 T + E 0 T ) E 0 δ + P q ˉ H 1 T ( 1 n t Z ^ T Z ^ ) − 1 1 n t ( H 1 F 1 T + E 0 T ) ϵ 1 = − P q ˉ H 1 T ( 1 n t Z ^ T Z ^ ) − 1 H 1 1 n t F 1 T E 0 δ − P q ˉ H 1 T ( 1 n t Z ^ T Z ^ ) − 1 1 n t E 0 T E 0 δ ⏟ = J 1 ⏟ = J 2 . + P q ˉ H 1 T ( 1 n t Z ^ T Z ^ ) − 1 H 1 1 n t F 1 T ϵ 1 + P q ˉ H 1 T ( 1 n t Z ^ T Z ^ ) − 1 1 n t E 0 T ϵ 1 . (37) \begin{aligned}
\sqrt{n_t}(H_M^{\mathsf T}\hat{\gamma}_1-\gamma_1)
&=-H_M^{\mathsf T}S_{\tilde{q}}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}\hat{Z}^{\mathsf T}E_0\delta
+H_M^{\mathsf T}S_{\tilde{q}}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}\hat{Z}^{\mathsf T}\epsilon_1\\
&=-P_{\bar{q}}H_1^{\mathsf T}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}(H_1F_1^{\mathsf T}+E_0^{\mathsf T})E_0\delta
+P_{\bar{q}}H_1^{\mathsf T}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}(H_1F_1^{\mathsf T}+E_0^{\mathsf T})\epsilon_1\\
&=-P_{\bar{q}}H_1^{\mathsf T}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}H_1\frac{1}{\sqrt{n_t}}F_1^{\mathsf T}E_0\delta
-P_{\bar{q}}H_1^{\mathsf T}\left(\frac{1}{n_t}\hat{Z}^{\mathsf T}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}E_0^{\mathsf T}E_0\delta\\
&\qquad\underbrace{\hspace{5.1cm}}_{=J_1}
\underbrace{\hspace{5.1cm}}_{=J_2}. \\
&+ \mathbf{P}_{\bar q}\mathbf{H}_1^{\mathsf T}\left(\frac{1}{n_t}\widehat{\mathbf{Z}}^{\mathsf T}\widehat{\mathbf{Z}}\right)^{-1}\mathbf{H}_1\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf T}\epsilon_1
+ \mathbf{P}_{\bar q}\mathbf{H}_1^{\mathsf T}\left(\frac{1}{n_t}\widehat{\mathbf{Z}}^{\mathsf T}\widehat{\mathbf{Z}}\right)^{-1}\frac{1}{\sqrt{n_t}}\mathbf{E}_0^{\mathsf T}\epsilon_1 . \tag*{(37)}
\end{aligned} n t ( H M T γ ^ 1 − γ 1 ) = − H M T S q ~ ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T E 0 δ + H M T S q ~ ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T ϵ 1 = − P q ˉ H 1 T ( n t 1 Z ^ T Z ^ ) − 1 n t 1 ( H 1 F 1 T + E 0 T ) E 0 δ + P q ˉ H 1 T ( n t 1 Z ^ T Z ^ ) − 1 n t 1 ( H 1 F 1 T + E 0 T ) ϵ 1 = − P q ˉ H 1 T ( n t 1 Z ^ T Z ^ ) − 1 H 1 n t 1 F 1 T E 0 δ − P q ˉ H 1 T ( n t 1 Z ^ T Z ^ ) − 1 n t 1 E 0 T E 0 δ = J 1 = J 2 . + P q ˉ H 1 T ( n t 1 Z T Z ) − 1 H 1 n t 1 F 1 T ϵ 1 + P q ˉ H 1 T ( n t 1 Z T Z ) − 1 n t 1 E 0 T ϵ 1 . (37)
write M = 1 n t Z ^ T Z ^ M=\frac{1}{n_t}\widehat{\mathbf{Z}}^{\mathsf T}\widehat{\mathbf{Z}} M = n t 1 Z T Z .
Term J 1 J_1 J 1 . We have
J 1 = P q ˉ H 1 T M − 1 H 1 1 n t F 1 T E 0 δ . J_1=\mathbf{P}_{\bar q}\mathbf{H}_1^{\mathsf T}M^{-1}\mathbf{H}_1\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf T}\mathbf{E}_0\delta. J 1 = P q ˉ H 1 T M − 1 H 1 n t 1 F 1 T E 0 δ .
By Lemma C.5, ∥ H 1 T M − 1 H 1 ∥ o p = O p ( 1 ) \|\mathbf{H}_1^{\mathsf T}M^{-1}\mathbf{H}_1\|_{\mathrm{op}}=O_p(1) ∥ H 1 T M − 1 H 1 ∥ op = O p ( 1 ) , so we have
∥ J 1 ∥ ≤ ∥ P q ˉ ∥ o p ∥ H 1 T M − 1 H 1 ∥ o p ∥ 1 n t F 1 T E 0 δ ∥ = O p ( 1 ) ∥ 1 n t F 1 T E 0 δ ∥ . \|J_1\|\leq\|\mathbf{P}_{\bar q}\|_{\mathrm{op}}\|\mathbf{H}_1^{\mathsf T}M^{-1}\mathbf{H}_1\|_{\mathrm{op}}\left\|\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf T}\mathbf{E}_0\delta\right\|=O_p(1)\left\|\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf T}\mathbf{E}_0\delta\right\|. ∥ J 1 ∥ ≤ ∥ P q ˉ ∥ op ∥ H 1 T M − 1 H 1 ∥ op n t 1 F 1 T E 0 δ = O p ( 1 ) n t 1 F 1 T E 0 δ .
By Lemma C.2(ii) and ∥ δ ∥ = O ( 1 ) \|\delta\|=O(1) ∥ δ ∥ = O ( 1 ) , we get
∥ 1 n t F 1 T E 0 δ ∥ ≤ ∥ 1 n t F 1 T E 0 ∥ o p ∥ δ ∥ = O p { ( 1 p ∧ q ) 1 / 2 } , \left\|\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf T}\mathbf{E}_0\delta\right\|
\leq\left\|\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf T}\mathbf{E}_0\right\|_{\mathrm{op}}\|\delta\|
=O_p\left\{\left(\frac{1}{p\wedge q}\right)^{1/2}\right\}, n t 1 F 1 T E 0 δ ≤ n t 1 F 1 T E 0 op ∥ δ ∥ = O p { ( p ∧ q 1 ) 1/2 } ,
Thus J 1 = o p ( 1 ) J_1=o_p(1) J 1 = o p ( 1 ) as p ∧ q → ∞ p\wedge q\to\infty p ∧ q → ∞ .
Term J 2 J_2 J 2 .
J 2 = P q ˉ H 1 T M − 1 1 n t E 0 T E 0 δ . J_2=\mathbf{P}_{\bar q}\mathbf{H}_1^{\mathsf T}M^{-1}\frac{1}{\sqrt{n_t}}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\delta. J 2 = P q ˉ H 1 T M − 1 n t 1 E 0 T E 0 δ .
This term differs from J 1 J_1 J 1 because there is no H 1 \mathbf{H}_1 H 1 on the right of M − 1 M^{-1} M − 1 . After the change of basis the left S S S -block disappears, but the right side keeps an S S S -part, so we use the block-inverse identity directly. As in Lemma C.5, write H 1 = U R \mathbf{H}_1=\mathbf{U}R H 1 = U R with U T U = I \mathbf{U}^{\mathsf T}\mathbf{U}=I U T U = I and complete U \mathbf{U} U to an orthogonal J = [ U S ] J=[\mathbf{U}\ \mathbf{S}] J = [ U S ] , so that H 1 T J = ( R T 0 ) \mathbf{H}_1^{\mathsf T}J=(R^{\mathsf T}\ 0) H 1 T J = ( R T 0 ) and M − 1 = J ( J T M J ) − 1 J T M^{-1}=J(J^{\mathsf T}MJ)^{-1}J^{\mathsf T} M − 1 = J ( J T M J ) − 1 J T . From the block inverse formula, the first block row of ( J T M J ) − 1 (J^{\mathsf T}MJ)^{-1} ( J T M J ) − 1 is
( ( D + E n ) − 1 − ( D + E n ) − 1 K 12 K 22 − 1 ) . \left((D+E_n)^{-1}\quad-(D+E_n)^{-1}K_{12}K_{22}^{-1}\right). ( ( D + E n ) − 1 − ( D + E n ) − 1 K 12 K 22 − 1 ) .
Therefore, using H 1 T J = ( R T 0 ) \mathbf{H}_1^{\mathsf T}J=(R^{\mathsf T}\ 0) H 1 T J = ( R T 0 ) and J T = ( U T S T ) J^{\mathsf T}=\begin{pmatrix}\mathbf{U}^{\mathsf T}\\ \mathbf{S}^{\mathsf T}\end{pmatrix} J T = ( U T S T ) , we have
H 1 T M − 1 = R T ( D + E n ) − 1 ( U T − K 12 K 22 − 1 S T ) = R T ( D + E n ) − 1 [ U T − { 1 n t R F 1 T E 0 S + 1 n t U T E 0 T E 0 S } { 1 n t S T E 0 T E 0 S } − 1 S T ] . \begin{aligned}
\mathbf{H}_1^{\mathsf T}M^{-1}
=R^{\mathsf T}(D+E_n)^{-1}\left(\mathbf{U}^{\mathsf T}-K_{12}K_{22}^{-1}\mathbf{S}^{\mathsf T}\right) \\
&=R^{\mathsf T}(D+E_n)^{-1}\left[\mathbf{U}^{\mathsf T}
-\left\{\frac{1}{n_t}R\mathbf{F}_1^{\mathsf T}\mathbf{E}_0\mathbf{S}
+\frac{1}{n_t}\mathbf{U}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\mathbf{S}\right\}
\left\{\frac{1}{n_t}\mathbf{S}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\mathbf{S}\right\}^{-1}\mathbf{S}^{\mathsf T}\right].
\end{aligned} H 1 T M − 1 = R T ( D + E n ) − 1 ( U T − K 12 K 22 − 1 S T ) = R T ( D + E n ) − 1 [ U T − { n t 1 R F 1 T E 0 S + n t 1 U T E 0 T E 0 S } { n t 1 S T E 0 T E 0 S } − 1 S T ] .
with ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) \|(D+E_n)^{-1}\|_{\mathrm{op}}=O_p(1) ∥ ( D + E n ) − 1 ∥ op = O p ( 1 ) by Lemma C.5. We apply this identity to the ( 1 / n t ) E 0 T E 0 δ (1/\sqrt{n_t})\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\delta ( 1/ n t ) E 0 T E 0 δ and use P S = E 0 S ( S T E 0 T E 0 S ) − 1 S T E 0 T P_S=\mathbf{E}_0\mathbf{S}(\mathbf{S}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\mathbf{S})^{-1}\mathbf{S}^{\mathsf T}\mathbf{E}_0^{\mathsf T} P S = E 0 S ( S T E 0 T E 0 S ) − 1 S T E 0 T . Then,
J 2 = P q ˉ R T ( D + E n ) − 1 [ 1 n t U T E 0 T E 0 δ − ( 1 n t R F 1 T E 0 S + 1 n t U T E 0 T E 0 S ) ( 1 n t S T E 0 T E 0 S ) − 1 1 n t S T E 0 T E 0 δ ] = P q ˉ R T ( D + E n ) − 1 [ 1 n t U T E 0 T E 0 δ − 1 n t ( R F 1 T + U T E 0 T ) P S E 0 δ ] = P q ˉ R T ( D + E n ) − 1 [ 1 n t U T E 0 T ( I − P S ) E 0 δ − 1 n t R F 1 T P S E 0 δ ] . \begin{aligned}
J_2=\mathbf{P}_{\bar q}R^{\mathsf T}(D+E_n)^{-1}\left[\frac{1}{\sqrt{n_t}}\mathbf{U}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\delta
-\left(\frac{1}{n_t}R\mathbf{F}_1^{\mathsf T}\mathbf{E}_0\mathbf{S}
+\frac{1}{n_t}\mathbf{U}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\mathbf{S}\right)
\left(\frac{1}{n_t}\mathbf{S}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\mathbf{S}\right)^{-1}
\frac{1}{\sqrt{n_t}}\mathbf{S}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\delta\right] \\
&=\mathbf{P}_{\bar q}R^{\mathsf T}(D+E_n)^{-1}\left[\frac{1}{\sqrt{n_t}}\mathbf{U}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\delta
-\frac{1}{\sqrt{n_t}}\left(R\mathbf{F}_1^{\mathsf T}+\mathbf{U}^{\mathsf T}\mathbf{E}_0^{\mathsf T}\right)P_S\mathbf{E}_0\delta\right] \\
&=\mathbf{P}_{\bar q}R^{\mathsf T}(D+E_n)^{-1}\left[\frac{1}{\sqrt{n_t}}\mathbf{U}^{\mathsf T}\mathbf{E}_0^{\mathsf T}(I-P_S)\mathbf{E}_0\delta
-\frac{1}{\sqrt{n_t}}R\mathbf{F}_1^{\mathsf T}P_S\mathbf{E}_0\delta\right].
\end{aligned} J 2 = P q ˉ R T ( D + E n ) − 1 [ n t 1 U T E 0 T E 0 δ − ( n t 1 R F 1 T E 0 S + n t 1 U T E 0 T E 0 S ) ( n t 1 S T E 0 T E 0 S ) − 1 n t 1 S T E 0 T E 0 δ ] = P q ˉ R T ( D + E n ) − 1 [ n t 1 U T E 0 T E 0 δ − n t 1 ( R F 1 T + U T E 0 T ) P S E 0 δ ] = P q ˉ R T ( D + E n ) − 1 [ n t 1 U T E 0 T ( I − P S ) E 0 δ − n t 1 R F 1 T P S E 0 δ ] .
The outside factor is bounded because ∥ P q ˉ ∥ = 1 \|\mathbf{P}_{\bar q}\|=1 ∥ P q ˉ ∥ = 1 , ∥ R ∥ o p = O ( 1 ) \|R\|_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) , and ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) \|(D+E_n)^{-1}\|_{\mathrm{op}}=O_p(1) ∥ ( D + E n ) − 1 ∥ op = O p ( 1 ) . Thus it is enough to bound the two terms inside the square bracket.
For the first term, using ∥ U ∥ o p = 1 \|\mathbf{U}\|_{\mathrm{op}}=1 ∥ U ∥ op = 1 and ∥ I − P S ∥ o p ≤ 1 \|I-P_S\|_{\mathrm{op}}\leq1 ∥ I − P S ∥ op ≤ 1 , we get that
∥ 1 n t U T E 0 T ( I − P S ) E 0 δ ∥ ≤ 1 n t ∥ E 0 T ( I − P S ) E 0 ∥ o p ∥ δ ∥ ≤ n t ∥ 1 n t E 0 T E 0 ∥ o p ∥ δ ∥ . \left\|\frac{1}{\sqrt{n_t}}\mathbf{U}^{\mathsf T}\mathbf{E}_0^{\mathsf T}(I-P_S)\mathbf{E}_0\delta\right\|
\leq\frac{1}{\sqrt{n_t}}\|\mathbf{E}_0^{\mathsf T}(I-P_S)\mathbf{E}_0\|_{\mathrm{op}}\|\delta\|
\leq\sqrt{n_t}\left\|\frac{1}{n_t}\mathbf{E}_0^{\mathsf T}\mathbf{E}_0\right\|_{\mathrm{op}}\|\delta\|. n t 1 U T E 0 T ( I − P S ) E 0 δ ≤ n t 1 ∥ E 0 T ( I − P S ) E 0 ∥ op ∥ δ ∥ ≤ n t n t 1 E 0 T E 0 op ∥ δ ∥.
Since ∥ 1 n t E 0 ⊤ E 0 ∥ op = O p ( 1 p ∧ q ) \left\|\frac{1}{n_t}\mathbf{E}_0^{\top}\mathbf{E}_0\right\|_{\operatorname{op}}=O_p\left(\frac{1}{p\wedge q}\right) n t 1 E 0 ⊤ E 0 op = O p ( p ∧ q 1 ) , from Lemma C.2(i) the first term is O p ( n t p ∧ q ) O_p\left(\frac{\sqrt{n_t}}{p\wedge q}\right) O p ( p ∧ q n t ) . For the second term, we have
∥ 1 n t R F 1 ⊤ P S E 0 δ ∥ ≤ ∥ R ∥ op 1 n t ∥ F 1 ⊤ P S ∥ op ∥ E 0 δ ∥ . \left\|\frac{1}{\sqrt{n_t}}\mathbf{R}\mathbf{F}_1^{\top}\mathbf{P}_S\mathbf{E}_0\boldsymbol{\delta}\right\|\leq\|\mathbf{R}\|_{\operatorname{op}}\frac{1}{\sqrt{n_t}}\|\mathbf{F}_1^{\top}\mathbf{P}_S\|_{\operatorname{op}}\|\mathbf{E}_0\boldsymbol{\delta}\|. n t 1 R F 1 ⊤ P S E 0 δ ≤ ∥ R ∥ op n t 1 ∥ F 1 ⊤ P S ∥ op ∥ E 0 δ ∥.
Here ∥ R ∥ op = O ( 1 ) \|\mathbf{R}\|_{\operatorname{op}}=O(1) ∥ R ∥ op = O ( 1 ) . We write F 1 = 1 μ F ⊤ + F ~ 1 \mathbf{F}_1=\mathbf{1}\mu_F^{\top}+\widetilde{\mathbf{F}}_1 F 1 = 1 μ F ⊤ + F 1 . By Lemma C.3, ∥ P S 1 ∥ 2 = 1 ⊤ P S 1 = O p ( 1 ) \|\mathbf{P}_S\mathbf{1}\|^2=\mathbf{1}^{\top}\mathbf{P}_S\mathbf{1}=O_p(1) ∥ P S 1 ∥ 2 = 1 ⊤ P S 1 = O p ( 1 ) , and by Lemma C.4, ∥ F ~ 1 ⊤ P S ∥ op = ∥ F ~ 1 ⊤ P S F ~ 1 ∥ op = O p ( 1 ) \|\widetilde{\mathbf{F}}_1^{\top}\mathbf{P}_S\|_{\operatorname{op}}=\|\widetilde{\mathbf{F}}_1^{\top}\mathbf{P}_S\widetilde{\mathbf{F}}_1\|_{\operatorname{op}}=O_p(1) ∥ F 1 ⊤ P S ∥ op = ∥ F 1 ⊤ P S F 1 ∥ op = O p ( 1 ) . Since ∥ μ F ∥ = O ( 1 ) \|\mu_F\|=O(1) ∥ μ F ∥ = O ( 1 ) by Assumption 3.1(iii), we have ∥ F 1 ⊤ P S ∥ op ≤ ∥ μ F ∥ ∥ P S 1 ∥ 2 + ∥ F ~ 1 ⊤ P S ∥ op = O p ( 1 ) \|\mathbf{F}_1^{\top}\mathbf{P}_S\|_{\operatorname{op}}\leq\|\mu_F\|\|\mathbf{P}_S\mathbf{1}\|^2+\|\widetilde{\mathbf{F}}_1^{\top}\mathbf{P}_S\|_{\operatorname{op}}=O_p(1) ∥ F 1 ⊤ P S ∥ op ≤ ∥ μ F ∥∥ P S 1 ∥ 2 + ∥ F 1 ⊤ P S ∥ op = O p ( 1 ) . Also,
∥ E 0 δ ∥ ≤ ∥ E 0 ⊤ E 0 ∥ op 1 / 2 ∥ δ ∥ = n t ∥ 1 n t E 0 ⊤ E 0 ∥ op 1 / 2 ∥ δ ∥ = O p ( n t p ∧ q ) . \|\mathbf{E}_0\boldsymbol{\delta}\|\leq\|\mathbf{E}_0^{\top}\mathbf{E}_0\|_{\operatorname{op}}^{1/2}\|\boldsymbol{\delta}\|=\sqrt{n_t}\left\|\frac{1}{n_t}\mathbf{E}_0^{\top}\mathbf{E}_0\right\|_{\operatorname{op}}^{1/2}\|\boldsymbol{\delta}\|=O_p\left(\sqrt{\frac{n_t}{p\wedge q}}\right). ∥ E 0 δ ∥ ≤ ∥ E 0 ⊤ E 0 ∥ op 1/2 ∥ δ ∥ = n t n t 1 E 0 ⊤ E 0 op 1/2 ∥ δ ∥ = O p ( p ∧ q n t ) .
Therefore, the second term is O p ( 1 p ∧ q ) O_p\left(\frac{1}{\sqrt{p\wedge q}}\right) O p ( p ∧ q 1 ) . Now, combining the two pieces inside the bracket and using the bounded outside factor, we get
∥ J 2 ∥ = O p ( n t p ∧ q + 1 p ∧ q ) . \|J_2\|=O_p\left(\frac{\sqrt{n_t}}{p\wedge q}+\frac{1}{\sqrt{p\wedge q}}\right). ∥ J 2 ∥ = O p ( p ∧ q n t + p ∧ q 1 ) .
Thus J 2 = o p ( 1 ) J_2=o_p(1) J 2 = o p ( 1 ) under Assumption 5.2(ii), since ( p ∧ q ) / n t → ∞ (p\wedge q)/n_t\to\infty ( p ∧ q ) / n t → ∞ gives n t / ( p ∧ q ) → 0 \sqrt{n_t}/(p\wedge q)\to0 n t / ( p ∧ q ) → 0 .
Term J 3 J_3 J 3 . We have
J 3 = P q ˉ H 1 ⊤ M − 1 H 1 1 n t F 1 ⊤ ϵ 1 . J_3=\mathbf{P}_{\bar q}\mathbf{H}_1^{\top}\mathbf{M}^{-1}\mathbf{H}_1\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1. J 3 = P q ˉ H 1 ⊤ M − 1 H 1 n t 1 F 1 ⊤ ϵ 1 .
By the treated-arm exogeneity and mean zero condition E ( ϵ 1 , i ) = E ( ϵ 1 , i ∣ f X , i , f M , i , A i = 1 ) = 0 \mathbb{E}(\epsilon_{1,i})=\mathbb{E}(\epsilon_{1,i}\mid\mathbf{f}_{X,i},\mathbf{f}_{M,i},A_i=1)=0 E ( ϵ 1 , i ) = E ( ϵ 1 , i ∣ f X , i , f M , i , A i = 1 ) = 0 of Assumption 3.1(ii), we have
E ( 1 n t F 1 ⊤ ϵ 1 ∣ F 1 ) = 0. \mathbb{E}\left(\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1\mid\mathbf{F}_1\right)=0. E ( n t 1 F 1 ⊤ ϵ 1 ∣ F 1 ) = 0.
Also, using the bounded conditional variance of Assumption 5.1(i), we get
E [ ∥ 1 n t F 1 ⊤ ϵ 1 ∥ 2 | F 1 ] = tr { 1 n t F 1 ⊤ E ( ϵ 1 ϵ 1 ⊤ ∣ F 1 ) F 1 } ≤ C tr ( 1 n t F 1 ⊤ F 1 ) . \mathbb{E}\left[\left\|\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1\right\|^2\middle|\mathbf{F}_1\right]=\operatorname{tr}\left\{\frac{1}{n_t}\mathbf{F}_1^{\top}\mathbb{E}(\boldsymbol{\epsilon}_1\boldsymbol{\epsilon}_1^{\top}\mid\mathbf{F}_1)\mathbf{F}_1\right\}\leq C\operatorname{tr}\left(\frac{1}{n_t}\mathbf{F}_1^{\top}\mathbf{F}_1\right). E [ n t 1 F 1 ⊤ ϵ 1 2 F 1 ] = tr { n t 1 F 1 ⊤ E ( ϵ 1 ϵ 1 ⊤ ∣ F 1 ) F 1 } ≤ C tr ( n t 1 F 1 ⊤ F 1 ) .
The last term is O p ( 1 ) O_p(1) O p ( 1 ) by the bounded factor second moments of Assumption 3.1(iii)–(iv). Chebyshev’s inequality then gives ∥ 1 n t F 1 ⊤ ϵ 1 ∥ = O p ( 1 ) \left\|\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1\right\|=O_p(1) n t 1 F 1 ⊤ ϵ 1 = O p ( 1 ) . Note that H 1 ⊤ M − 1 H 1 = R ⊤ ( D + E n ) − 1 R \mathbf{H}_1^{\top}\mathbf{M}^{-1}\mathbf{H}_1=\mathbf{R}^{\top}(\mathbf{D}+\mathbf{E}_n)^{-1}\mathbf{R} H 1 ⊤ M − 1 H 1 = R ⊤ ( D + E n ) − 1 R from Lemma C.5, where D = R Σ F R ⊤ \mathbf{D}=\mathbf{R}\Sigma_F\mathbf{R}^{\top} D = R Σ F R ⊤ with Σ F = 1 n t F 1 ⊤ F 1 → p Ω 1 \Sigma_F=\frac{1}{n_t}\mathbf{F}_1^{\top}\mathbf{F}_1\to_p\Omega_1 Σ F = n t 1 F 1 ⊤ F 1 → p Ω 1 and ∥ E n ∥ = o p ( 1 ) \|\mathbf{E}_n\|=o_p(1) ∥ E n ∥ = o p ( 1 ) . Hence, we have
H 1 ⊤ M − 1 H 1 = R ⊤ ( D + E n ) − 1 R → p R ⊤ ( R Ω 1 R ⊤ ) − 1 R = Ω 1 − 1 . \mathbf{H}_1^{\top}\mathbf{M}^{-1}\mathbf{H}_1=\mathbf{R}^{\top}(\mathbf{D}+\mathbf{E}_n)^{-1}\mathbf{R}\xrightarrow{p}\mathbf{R}^{\top}(\mathbf{R}\Omega_1\mathbf{R}^{\top})^{-1}\mathbf{R}=\Omega_1^{-1}. H 1 ⊤ M − 1 H 1 = R ⊤ ( D + E n ) − 1 R p R ⊤ ( R Ω 1 R ⊤ ) − 1 R = Ω 1 − 1 .
Therefore, we get
J 3 = P q ˉ Ω 1 − 1 1 n t F 1 ⊤ ϵ 1 + P q ˉ ( H 1 ⊤ M − 1 H 1 − Ω 1 − 1 ) 1 n t F 1 ⊤ ϵ 1 = P q ˉ Ω 1 − 1 1 n t ∑ i : A i = 1 f 1 , i ϵ 1 , i + o p ( 1 ) , \begin{aligned}
J_3=\mathbf{P}_{\bar q}\Omega_1^{-1}\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1+\mathbf{P}_{\bar q}(\mathbf{H}_1^{\top}\mathbf{M}^{-1}\mathbf{H}_1-\Omega_1^{-1})\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1 \\
&=\mathbf{P}_{\bar q}\Omega_1^{-1}\frac{1}{\sqrt{n_t}}\sum_{i:A_i=1}\mathbf{f}_{1,i}\epsilon_{1,i}+o_p(1),
\end{aligned} J 3 = P q ˉ Ω 1 − 1 n t 1 F 1 ⊤ ϵ 1 + P q ˉ ( H 1 ⊤ M − 1 H 1 − Ω 1 − 1 ) n t 1 F 1 ⊤ ϵ 1 = P q ˉ Ω 1 − 1 n t 1 i : A i = 1 ∑ f 1 , i ϵ 1 , i + o p ( 1 ) ,
since the first factor of the second term is o p ( 1 ) o_p(1) o p ( 1 ) in operator norm and the second factor is O p ( 1 ) O_p(1) O p ( 1 ) .
Term J 4 J_4 J 4 .
J 4 = P q ˉ H 1 ⊤ M − 1 1 n t E 0 ⊤ ϵ 1 . J_4=\mathbf{P}_{\bar q}\mathbf{H}_1^{\top}\mathbf{M}^{-1}\frac{1}{\sqrt{n_t}}\mathbf{E}_0^{\top}\boldsymbol{\epsilon}_1. J 4 = P q ˉ H 1 ⊤ M − 1 n t 1 E 0 ⊤ ϵ 1 .
Similar to J 2 J_2 J 2 , this is a one-sided term because there is no H 1 \mathbf{H}_1 H 1 on the right. So, the block-inverse identity gives
H 1 ⊤ M − 1 1 n t E 0 ⊤ ϵ 1 = R ⊤ ( D + E n ) − 1 [ 1 n t U ⊤ E 0 ⊤ ( I − P S ) ϵ 1 − 1 n t R F 1 ⊤ P S ϵ 1 ] . \mathbf{H}_1^{\top}\mathbf{M}^{-1}\frac{1}{\sqrt{n_t}}\mathbf{E}_0^{\top}\boldsymbol{\epsilon}_1=\mathbf{R}^{\top}(\mathbf{D}+\mathbf{E}_n)^{-1}\left[\frac{1}{\sqrt{n_t}}\mathbf{U}^{\top}\mathbf{E}_0^{\top}(\mathbf{I}-\mathbf{P}_S)\boldsymbol{\epsilon}_1-\frac{1}{\sqrt{n_t}}\mathbf{R}\mathbf{F}_1^{\top}\mathbf{P}_S\boldsymbol{\epsilon}_1\right]. H 1 ⊤ M − 1 n t 1 E 0 ⊤ ϵ 1 = R ⊤ ( D + E n ) − 1 [ n t 1 U ⊤ E 0 ⊤ ( I − P S ) ϵ 1 − n t 1 R F 1 ⊤ P S ϵ 1 ] .
For the first term, conditional on E 0 \mathcal{E}_0 E 0 , the matrix P S \mathbf{P}_S P S is fixed. Also, by the independence and moment conditions on ϵ 1 \epsilon_1 ϵ 1 in Assumptions 3.1(i)–(ii) and 5.1(i), we have E ( ϵ 1 ∣ E 0 ) = 0 \mathbb{E}(\epsilon_1\mid\mathcal{E}_0)=0 E ( ϵ 1 ∣ E 0 ) = 0 and E ( ϵ 1 ϵ 1 ⊤ ∣ E 0 ) ⪯ C I \mathbb{E}(\epsilon_1\epsilon_1^{\top}\mid\mathcal{E}_0)\preceq C I E ( ϵ 1 ϵ 1 ⊤ ∣ E 0 ) ⪯ C I . Therefore, we have
E [ ∥ 1 n t U ⊤ E 0 ⊤ ( I − P S ) ϵ 1 ∥ 2 2 | E 0 ] = 1 n t tr { U ⊤ E 0 ⊤ ( I − P S ) E ( ϵ 1 ϵ 1 ⊤ ∣ E 0 ) ( I − P S ) E 0 U } ≤ C n t tr { U ⊤ E 0 ⊤ ( I − P S ) E 0 U } ≤ C n t tr ( U ⊤ E 0 ⊤ E 0 U ) . \begin{aligned}
\mathbb{E}\left[\left\|\frac{1}{\sqrt{n_t}}\mathbf{U}^{\top}\mathbf{E}_0^{\top}(I-\mathbf{P}_S)\epsilon_1\right\|_2^2\middle|\mathcal{E}_0\right]
=\frac{1}{n_t}\operatorname{tr}\left\{\mathbf{U}^{\top}\mathbf{E}_0^{\top}(I-\mathbf{P}_S)\mathbb{E}(\epsilon_1\epsilon_1^{\top}\mid\mathcal{E}_0)(I-\mathbf{P}_S)\mathbf{E}_0\mathbf{U}\right\} \\
&\leq\frac{C}{n_t}\operatorname{tr}\left\{\mathbf{U}^{\top}\mathbf{E}_0^{\top}(I-\mathbf{P}_S)\mathbf{E}_0\mathbf{U}\right\} \\
&\leq\frac{C}{n_t}\operatorname{tr}\left(\mathbf{U}^{\top}\mathbf{E}_0^{\top}\mathbf{E}_0\mathbf{U}\right).
\end{aligned} E [ n t 1 U ⊤ E 0 ⊤ ( I − P S ) ϵ 1 2 2 E 0 ] = n t 1 tr { U ⊤ E 0 ⊤ ( I − P S ) E ( ϵ 1 ϵ 1 ⊤ ∣ E 0 ) ( I − P S ) E 0 U } ≤ n t C tr { U ⊤ E 0 ⊤ ( I − P S ) E 0 U } ≤ n t C tr ( U ⊤ E 0 ⊤ E 0 U ) .
Since U \mathbf{U} U has a fixed number of orthonormal columns,
1 n t tr ( U ⊤ E 0 ⊤ E 0 U ) ≤ C ∥ 1 n t E 0 ⊤ E 0 ∥ o p = O p ( 1 p ∧ q ) \frac{1}{n_t}\operatorname{tr}\left(\mathbf{U}^{\top}\mathbf{E}_0^{\top}\mathbf{E}_0\mathbf{U}\right)
\leq C\left\|\frac{1}{n_t}\mathbf{E}_0^{\top}\mathbf{E}_0\right\|_{\mathrm{op}}
=O_p\left(\frac{1}{p\wedge q}\right) n t 1 tr ( U ⊤ E 0 ⊤ E 0 U ) ≤ C n t 1 E 0 ⊤ E 0 op = O p ( p ∧ q 1 )
by Lemma C.2(i). Hence, we have
∥ 1 n t U ⊤ E 0 ⊤ ( I − P S ) ϵ 1 ∥ 2 = O p ( 1 p ∧ q ) . \left\|\frac{1}{\sqrt{n_t}}\mathbf{U}^{\top}\mathbf{E}_0^{\top}(I-\mathbf{P}_S)\epsilon_1\right\|_2
=O_p\left(\frac{1}{\sqrt{p\wedge q}}\right). n t 1 U ⊤ E 0 ⊤ ( I − P S ) ϵ 1 2 = O p ( p ∧ q 1 ) .
For the second term 1 n t R F 1 ⊤ P S ϵ 1 \frac{1}{\sqrt{n_t}}\mathbf{R}\mathbf{F}_1^{\top}\mathbf{P}_S\epsilon_1 n t 1 R F 1 ⊤ P S ϵ 1 , we again write F 1 = 1 μ F ⊤ + F ~ 1 \mathbf{F}_1=\mathbf{1}\mu_F^{\top}+\widetilde{\mathbf{F}}_1 F 1 = 1 μ F ⊤ + F 1 . The mean part is 1 n t R μ F 1 ⊤ P S ϵ 1 \frac{1}{\sqrt{n_t}}\mathbf{R}\mu_F\mathbf{1}^{\top}\mathbf{P}_S\epsilon_1 n t 1 R μ F 1 ⊤ P S ϵ 1 . By Assumptions 3.1(i)–(ii), ϵ 1 , i \epsilon_{1,i} ϵ 1 , i is independent of the latent factors and proxy errors generating f 1 , i f_{1,i} f 1 , i and E 0 \mathcal{E}_0 E 0 , and E ( ϵ 1 , i ) = 0 \mathbb{E}(\epsilon_{1,i})=0 E ( ϵ 1 , i ) = 0 . Hence, E ( ϵ 1 , i ∣ f 1 , i , E 0 , A i = 1 ) = E ( ϵ 1 , i ) = 0 \mathbb{E}(\epsilon_{1,i}\mid f_{1,i},\mathcal{E}_0,A_i=1)=\mathbb{E}(\epsilon_{1,i})=0 E ( ϵ 1 , i ∣ f 1 , i , E 0 , A i = 1 ) = E ( ϵ 1 , i ) = 0 . Since P S \mathbf{P}_S P S is a function of E 0 \mathcal{E}_0 E 0 , we have E ( ϵ 1 ∣ P S ) = 0 \mathbb{E}(\epsilon_1\mid\mathbf{P}_S)=0 E ( ϵ 1 ∣ P S ) = 0 , hence E ( 1 ⊤ P S ϵ 1 ∣ P S ) = 0 \mathbb{E}(\mathbf{1}^{\top}\mathbf{P}_S\epsilon_1\mid\mathbf{P}_S)=0 E ( 1 ⊤ P S ϵ 1 ∣ P S ) = 0 , and
E [ ( 1 ⊤ P S ϵ 1 ) 2 | P S ] = 1 ⊤ P S E ( ϵ 1 ϵ 1 ⊤ ∣ P S ) P S 1 ≤ C 1 ⊤ P S 2 1 = C 1 ⊤ P S 1. \mathbb{E}\left[\left(\mathbf{1}^{\top}\mathbf{P}_S\epsilon_1\right)^2\middle|\mathbf{P}_S\right]
=\mathbf{1}^{\top}\mathbf{P}_S\mathbb{E}(\epsilon_1\epsilon_1^{\top}\mid\mathbf{P}_S)\mathbf{P}_S\mathbf{1}
\leq C\mathbf{1}^{\top}\mathbf{P}_S^2\mathbf{1}
=C\mathbf{1}^{\top}\mathbf{P}_S\mathbf{1}. E [ ( 1 ⊤ P S ϵ 1 ) 2 P S ] = 1 ⊤ P S E ( ϵ 1 ϵ 1 ⊤ ∣ P S ) P S 1 ≤ C 1 ⊤ P S 2 1 = C 1 ⊤ P S 1 .
By Lemma C.3, 1 ⊤ P S 1 = O p ( 1 ) \mathbf{1}^{\top}\mathbf{P}_S\mathbf{1}=O_p(1) 1 ⊤ P S 1 = O p ( 1 ) . Therefore, we have 1 ⊤ P S ϵ 1 = O p ( 1 ) \mathbf{1}^{\top}\mathbf{P}_S\epsilon_1=O_p(1) 1 ⊤ P S ϵ 1 = O p ( 1 ) , and so
∥ 1 n t R μ F 1 ⊤ P S ϵ 1 ∥ 2 = O p ( 1 n t ) . \left\|\frac{1}{\sqrt{n_t}}\mathbf{R}\mu_F\mathbf{1}^{\top}\mathbf{P}_S\epsilon_1\right\|_2
=O_p\left(\frac{1}{\sqrt{n_t}}\right). n t 1 R μ F 1 ⊤ P S ϵ 1 2 = O p ( n t 1 ) .
For the centered part, conditional on F ~ 1 \widetilde{\mathbf{F}}_1 F 1 and E 0 \mathcal{E}_0 E 0 , we get that
E [ ∥ 1 n t R F ~ 1 ⊤ P S ϵ 1 ∥ 2 2 | F ~ 1 , E 0 ] ≤ C n t tr ( F ~ 1 ⊤ P S F ~ 1 ) . \mathbb{E}\left[\left\|\frac{1}{\sqrt{n_t}}\mathbf{R}\widetilde{\mathbf{F}}_1^{\top}\mathbf{P}_S\epsilon_1\right\|_2^2\middle|\widetilde{\mathbf{F}}_1,\mathcal{E}_0\right]
\leq\frac{C}{n_t}\operatorname{tr}\left(\widetilde{\mathbf{F}}_1^{\top}\mathbf{P}_S\widetilde{\mathbf{F}}_1\right). E [ n t 1 R F 1 ⊤ P S ϵ 1 2 2 F 1 , E 0 ] ≤ n t C tr ( F 1 ⊤ P S F 1 ) .
By Lemma C.4, we have ∥ F ~ 1 ⊤ P S F ~ 1 ∥ o p = O p ( 1 ) \|\widetilde{\mathbf{F}}_1^{\top}\mathbf{P}_S\widetilde{\mathbf{F}}_1\|_{\mathrm{op}}=O_p(1) ∥ F 1 ⊤ P S F 1 ∥ op = O p ( 1 ) . Since the factor dimension is fixed, its trace is also O p ( 1 ) O_p(1) O p ( 1 ) . Hence,
∥ 1 n t R F ~ 1 ⊤ P S ϵ 1 ∥ 2 = O p ( 1 n t ) . \left\|\frac{1}{\sqrt{n_t}}\mathbf{R}\widetilde{\mathbf{F}}_1^{\top}\mathbf{P}_S\epsilon_1\right\|_2
=O_p\left(\frac{1}{\sqrt{n_t}}\right). n t 1 R F 1 ⊤ P S ϵ 1 2 = O p ( n t 1 ) .
Therefore, we have
∥ J 4 ∥ = O p { ( 1 p ∧ q ) + 1 n t } . \|J_4\|=O_p\left\{\left(\frac{1}{\sqrt{p\wedge q}}\right)+\frac{1}{\sqrt{n_t}}\right\}. ∥ J 4 ∥ = O p { ( p ∧ q 1 ) + n t 1 } .
Thus, J 1 J_1 J 1 , J 2 J_2 J 2 and J 4 J_4 J 4 are o p ( 1 ) o_p(1) o p ( 1 ) . Now, combining these with the expansion of J 3 J_3 J 3 , we get that
n t ( H M ⊤ γ ^ 1 − γ 1 ) = P q ˉ Ω 1 − 1 1 n t ∑ i : A i = 1 f 1 , i ϵ 1 , i + o p ( 1 ) = O p ( 1 ) . \sqrt{n_t}\left(\mathbf{H}_M^{\top}\widehat{\gamma}_1-\gamma_1\right)
=\mathbf{P}_{\bar q}\boldsymbol{\Omega}_1^{-1}\frac{1}{\sqrt{n_t}}\sum_{i:A_i=1}f_{1,i}\epsilon_{1,i}+o_p(1)
=O_p(1). n t ( H M ⊤ γ 1 − γ 1 ) = P q ˉ Ω 1 − 1 n t 1 i : A i = 1 ∑ f 1 , i ϵ 1 , i + o p ( 1 ) = O p ( 1 ) .
Now, dividing by n t \sqrt{n_t} n t gives the stated linear expansion with r γ = o p ( n t − 1 / 2 ) r_\gamma=o_p(n_t^{-1/2}) r γ = o p ( n t − 1/2 ) , and thus, H M ⊤ γ ^ 1 − γ 1 = O p ( n t − 1 / 2 ) \mathbf{H}_M^{\top}\widehat{\gamma}_1-\gamma_1=O_p(n_t^{-1/2}) H M ⊤ γ 1 − γ 1 = O p ( n t − 1/2 ) . □ \square □
Lemma C.7. Suppose Assumptions 3.1–3.2 and 5.1–5.2 hold. Let P M = H M ( H M ⊤ H M ) − 1 H M ⊤ \mathbf{P}_M=\mathbf{H}_M(\mathbf{H}_M^{\top}\mathbf{H}_M)^{-1}\mathbf{H}_M^{\top} P M = H M ( H M ⊤ H M ) − 1 H M ⊤ and γ ^ 1 , ⊥ = ( I − P M ) γ ^ 1 \widehat{\gamma}_{1,\perp}=(I-\mathbf{P}_M)\widehat{\gamma}_1 γ 1 , ⊥ = ( I − P M ) γ 1 . Then
∥ γ ^ 1 , ⊥ ∥ 2 = O p ( q n t ) . \|\widehat{\gamma}_{1,\perp}\|_2=O_p\left(\sqrt{\frac{q}{n_t}}\right). ∥ γ 1 , ⊥ ∥ 2 = O p ( n t q ) .
Proof. We write the treated regression in coordinates that separate Col ( H 1 ) \operatorname{Col}(\mathbf{H}_1) Col ( H 1 ) from its orthogonal complement. Step 1 sets up these coordinates and shows that the complement directions of the design contain only proxy errors. Step 2 shows that the Gram matrix is well conditioned. Step 3 expands the rescaled null-space coefficient into four terms, Step 4 and 5 bounds them for γ ^ 1 , ⊥ \hat{\gamma}_{1,\perp} γ ^ 1 , ⊥ .
Step 1: Coordinates. We begin with the least-squares representation of the treated regression,
δ ^ = ( 1 n t Z ^ T Z ^ ) − 1 1 n t Z ^ T Y . \hat{\delta}=\left(\frac{1}{n_t}\hat{\mathbf{Z}}^{\mathsf{T}}\hat{\mathbf{Z}}\right)^{-1}\frac{1}{n_t}\hat{\mathbf{Z}}^{\mathsf{T}}\mathbf{Y}. δ ^ = ( n t 1 Z ^ T Z ^ ) − 1 n t 1 Z ^ T Y .
As in Lemma C.5 , write H 1 = U R \mathbf{H}_1=\mathbf{U}\mathbf{R} H 1 = UR with U T U = I \mathbf{U}^{\mathsf{T}}\mathbf{U}=\mathbf{I} U T U = I , and complete U \mathbf{U} U to the orthogonal matrix J = [ U S ] \mathbf{J}=[\mathbf{U}\ \mathbf{S}] J = [ U S ] . Since H 1 = diag ( 1 , H X , H M ) \mathbf{H}_1=\operatorname{diag}(1,\mathbf{H}_X,\mathbf{H}_M) H 1 = diag ( 1 , H X , H M ) , we may choose
S = ( 0 0 S X 0 0 S M ) . \mathbf{S}=
\begin{pmatrix}
0 & 0\\
\mathbf{S}_X & 0\\
0 & \mathbf{S}_M
\end{pmatrix}. S = 0 S X 0 0 0 S M .
where the columns of S X \mathbf{S}_X S X and S M \mathbf{S}_M S M form orthonormal bases for ker ( H X T ) \operatorname{ker}(\mathbf{H}_X^{\mathsf{T}}) ker ( H X T ) and ker ( H M T ) \operatorname{ker}(\mathbf{H}_M^{\mathsf{T}}) ker ( H M T ) , respectively. Let d X = p ~ − p ˉ d_X=\tilde{p}-\bar{p} d X = p ~ − p ˉ , d M = q ~ − q ˉ d_M=\tilde{q}-\bar{q} d M = q ~ − q ˉ , and d = d X + d M d=d_X+d_M d = d X + d M . Since δ = ( H 1 T ) † Δ \delta=(\mathbf{H}_1^{\mathsf{T}})^{\dagger}\Delta δ = ( H 1 T ) † Δ , we have δ ∈ Col ( H 1 ) = Col ( U ) \delta\in\operatorname{Col}(\mathbf{H}_1)=\operatorname{Col}(\mathbf{U}) δ ∈ Col ( H 1 ) = Col ( U ) . We write
J T δ ^ = ( a ^ κ ^ ) = ( U T δ ^ S T δ ^ ) , κ ^ = ( κ ^ X κ ^ M ) . \mathbf{J}^{\mathsf{T}}\hat{\delta}
=
\begin{pmatrix}
\hat{a}\\
\hat{\kappa}
\end{pmatrix}
=
\begin{pmatrix}
\mathbf{U}^{\mathsf{T}}\hat{\delta}\\
\mathbf{S}^{\mathsf{T}}\hat{\delta}
\end{pmatrix},
\qquad
\hat{\kappa}=
\begin{pmatrix}
\hat{\kappa}_X\\
\hat{\kappa}_M
\end{pmatrix}. J T δ ^ = ( a ^ κ ^ ) = ( U T δ ^ S T δ ^ ) , κ ^ = ( κ ^ X κ ^ M ) .
so that δ ^ = U a ^ + S κ ^ \hat{\delta}=\mathbf{U}\hat{a}+\mathbf{S}\hat{\kappa} δ ^ = U a ^ + S κ ^ . Moreover, since S M S M T = I − P M \mathbf{S}_M\mathbf{S}_M^{\mathsf{T}}=\mathbf{I}-\mathbf{P}_M S M S M T = I − P M and κ ^ M = S M T γ ^ 1 \hat{\kappa}_M=\mathbf{S}_M^{\mathsf{T}}\hat{\gamma}_1 κ ^ M = S M T γ ^ 1 , we have
S M κ ^ M = ( I − P M ) γ ^ 1 = γ ^ 1 , ⊥ . \mathbf{S}_M\hat{\kappa}_M=(\mathbf{I}-\mathbf{P}_M)\hat{\gamma}_1=\hat{\gamma}_{1,\perp}. S M κ ^ M = ( I − P M ) γ ^ 1 = γ ^ 1 , ⊥ .
Next, Z ^ J = [ Z ^ U Z ^ S ] \hat{\mathbf{Z}}\mathbf{J}=[\hat{\mathbf{Z}}\mathbf{U}\ \hat{\mathbf{Z}}\mathbf{S}] Z ^ J = [ Z ^ U Z ^ S ] . Since Z S = F 1 H 1 T S = 0 \mathbf{Z}\mathbf{S}=\mathbf{F}_1\mathbf{H}_1^{\mathsf{T}}\mathbf{S}=0 ZS = F 1 H 1 T S = 0 , Equation (A.1) gives Z ^ S = E 0 S \hat{\mathbf{Z}}\mathbf{S}=\mathbf{E}_0\mathbf{S} Z ^ S = E 0 S . Thus, the directions orthogonal to Col ( H 1 ) \operatorname{Col}(\mathbf{H}_1) Col ( H 1 ) contain only projected proxy errors. Since E X = p − 1 / 2 U X V X \mathbf{E}_X=p^{-1/2}\mathbf{U}_X\mathbf{V}_X E X = p − 1/2 U X V X and E M = q − 1 / 2 U M V M \mathbf{E}_M=q^{-1/2}\mathbf{U}_M\mathbf{V}_M E M = q − 1/2 U M V M , their corresponding covariance scales are p − 1 p^{-1} p − 1 and q − 1 q^{-1} q − 1 . We therefore rescale these directions in the next step.
Step 2: Normalization and Gram matrix. Define Σ S = E [ n t − 1 S T E 0 T E 0 S ] \boldsymbol{\Sigma}_S=\mathbb{E}[n_t^{-1}\mathbf{S}^{\mathsf{T}}\mathbf{E}_0^{\mathsf{T}}\mathbf{E}_0\mathbf{S}] Σ S = E [ n t − 1 S T E 0 T E 0 S ] conditional on the training fold. Using the block form of S \mathbf{S} S and E 0 \mathbf{E}_0 E 0 , and the independence of u X \mathbf{u}_X u X and u M \mathbf{u}_M u M in Assumption 3.1(ii), we have
Σ S = diag ( p − 1 Ω X , q − 1 Ω M ) , Ω X = S X T V X T Σ u X V X S X , Ω M = S M T V M T Σ u M V M S M . \boldsymbol{\Sigma}_S=\operatorname{diag}(p^{-1}\boldsymbol{\Omega}_X,q^{-1}\boldsymbol{\Omega}_M),
\qquad
\boldsymbol{\Omega}_X=\mathbf{S}_X^{\mathsf{T}}\mathbf{V}_X^{\mathsf{T}}\boldsymbol{\Sigma}_{u_X}\mathbf{V}_X\mathbf{S}_X,
\qquad
\boldsymbol{\Omega}_M=\mathbf{S}_M^{\mathsf{T}}\mathbf{V}_M^{\mathsf{T}}\boldsymbol{\Sigma}_{u_M}\mathbf{V}_M\mathbf{S}_M. Σ S = diag ( p − 1 Ω X , q − 1 Ω M ) , Ω X = S X T V X T Σ u X V X S X , Ω M = S M T V M T Σ u M V M S M .
By Assumption 3.1(v), the eigenvalues of Ω X \boldsymbol{\Omega}_X Ω X and Ω M \boldsymbol{\Omega}_M Ω M are bounded above and away from zero, so Σ S \boldsymbol{\Sigma}_S Σ S is invertible. We then define the normalized error matrix E ~ S = E 0 S Σ S − 1 / 2 \widetilde{\mathbf{E}}_S=\mathbf{E}_0\mathbf{S}\boldsymbol{\Sigma}_S^{-1/2} E S = E 0 S Σ S − 1/2 . Lemma C.3 gives n t − 1 E ~ S T E ~ S → p I d n_t^{-1}\widetilde{\mathbf{E}}_S^{\mathsf{T}}\widetilde{\mathbf{E}}_S\xrightarrow{p}\mathbf{I}_d n t − 1 E S T E S p I d . We use this normalization only as an invertible reparameterization of the same least-squares problem. Since Z ^ U = F 1 R T + E 0 U \hat{\mathbf{Z}}\mathbf{U}=\mathbf{F}_1\mathbf{R}^{\mathsf{T}}+\mathbf{E}_0\mathbf{U} Z ^ U = F 1 R T + E 0 U and Z ^ S = E ~ S Σ S 1 / 2 \hat{\mathbf{Z}}\mathbf{S}=\widetilde{\mathbf{E}}_S\boldsymbol{\Sigma}_S^{1/2} Z ^ S = E S Σ S 1/2 , we have
Z ^ J = [ Z ^ U , E ~ S ] ( I 0 0 Σ S 1 / 2 ) . \hat{\mathbf{Z}}\mathbf{J}
=
[\hat{\mathbf{Z}}\mathbf{U},\widetilde{\mathbf{E}}_S]
\begin{pmatrix}
\mathbf{I} & 0\\
0 & \boldsymbol{\Sigma}_S^{1/2}
\end{pmatrix}. Z ^ J = [ Z ^ U , E S ] ( I 0 0 Σ S 1/2 ) .
Thus, define Z ˉ = [ Z ^ U , E ~ S ] \bar{\mathbf{Z}}=[\hat{\mathbf{Z}}\mathbf{U},\widetilde{\mathbf{E}}_S] Z ˉ = [ Z ^ U , E S ] , which gives the treated regression of Algorithm 1 in rescaled J \mathbf{J} J -coordinates. Before expanding the least-squares estimator, let M ˉ = n t − 1 Z ˉ T Z ˉ \bar{\mathbf{M}}=n_t^{-1}\bar{\mathbf{Z}}^{\mathsf{T}}\bar{\mathbf{Z}} M ˉ = n t − 1 Z ˉ T Z ˉ and first show that the normalized Gram matrix is well conditioned. Its upper-left block is
1 n t ( Z ^ U ) T ( Z ^ U ) = R ( 1 n t F 1 T F 1 ) R T + R 1 n t F 1 T E 0 U + U T 1 n t E 0 T F 1 R T + U T 1 n t E 0 T E 0 U . \frac{1}{n_t}(\hat{\mathbf{Z}}\mathbf{U})^{\mathsf{T}}(\hat{\mathbf{Z}}\mathbf{U})
=
\mathbf{R}\left(\frac{1}{n_t}\mathbf{F}_1^{\mathsf{T}}\mathbf{F}_1\right)\mathbf{R}^{\mathsf{T}}
+\mathbf{R}\frac{1}{n_t}\mathbf{F}_1^{\mathsf{T}}\mathbf{E}_0\mathbf{U}
+\mathbf{U}^{\mathsf{T}}\frac{1}{n_t}\mathbf{E}_0^{\mathsf{T}}\mathbf{F}_1\mathbf{R}^{\mathsf{T}}
+\mathbf{U}^{\mathsf{T}}\frac{1}{n_t}\mathbf{E}_0^{\mathsf{T}}\mathbf{E}_0\mathbf{U}. n t 1 ( Z ^ U ) T ( Z ^ U ) = R ( n t 1 F 1 T F 1 ) R T + R n t 1 F 1 T E 0 U + U T n t 1 E 0 T F 1 R T + U T n t 1 E 0 T E 0 U .
By Lemma C.2 (i)–(ii), the last three terms are o p ( 1 ) o_p(1) o p ( 1 ) . Therefore, we have
1 n t ( Z ^ U ) T ( Z ^ U ) = R ( 1 n t F 1 T F 1 ) R T + o p ( 1 ) → p R Ω 1 R T . \frac{1}{n_t}(\hat{\mathbf{Z}}\mathbf{U})^{\mathsf{T}}(\hat{\mathbf{Z}}\mathbf{U})
=
\mathbf{R}\left(\frac{1}{n_t}\mathbf{F}_1^{\mathsf{T}}\mathbf{F}_1\right)\mathbf{R}^{\mathsf{T}}+o_p(1)
\xrightarrow{p}
\mathbf{R}\boldsymbol{\Omega}_1\mathbf{R}^{\mathsf{T}}. n t 1 ( Z ^ U ) T ( Z ^ U ) = R ( n t 1 F 1 T F 1 ) R T + o p ( 1 ) p R Ω 1 R T .
For the lower-right block, Lemma C.3 gives n t − 1 E ~ S T E ~ S = I d + o p ( 1 ) n_t^{-1}\widetilde{\mathbf{E}}_S^{\mathsf{T}}\widetilde{\mathbf{E}}_S=\mathbf{I}_d+o_p(1) n t − 1 E S T E S = I d + o p ( 1 ) . For the off-diagonal block,
1 n t ( Z ^ U ) T E ~ S = R 1 n t F 1 T E ~ S + U T 1 n t E 0 T E ~ S . \frac{1}{n_t}(\hat{\mathbf{Z}}\mathbf{U})^{\mathsf{T}}\widetilde{\mathbf{E}}_S
=
\mathbf{R}\frac{1}{n_t}\mathbf{F}_1^{\mathsf{T}}\widetilde{\mathbf{E}}_S
+\mathbf{U}^{\mathsf{T}}\frac{1}{n_t}\mathbf{E}_0^{\mathsf{T}}\widetilde{\mathbf{E}}_S. n t 1 ( Z ^ U ) T E S = R n t 1 F 1 T E S + U T n t 1 E 0 T E S .
The first term is O p ( n t − 1 / 2 ) O_p(n_t^{-1/2}) O p ( n t − 1/2 ) because the normalized error rows are mean zero, have bounded second moments, and are independent of the true factors. For the second term, if ε ~ S , i \tilde{\varepsilon}_{S,i} ε ~ S , i denotes the i i i th row of E ~ S \widetilde{\mathbf{E}}_S E S and e 0 , i e_{0,i} e 0 , i the i i i th row of E 0 \mathbf{E}_0 E 0 , then E ∥ e 0 , i ∥ 2 = O ( 1 / ( p ∧ q ) ) \mathbb{E}\lVert e_{0,i}\rVert^2=O(1/(p\wedge q)) E ∥ e 0 , i ∥ 2 = O ( 1/ ( p ∧ q )) and E ∥ ε ~ S , i ∥ 2 = O ( 1 ) \mathbb{E}\lVert\tilde{\varepsilon}_{S,i}\rVert^2=O(1) E ∥ ε ~ S , i ∥ 2 = O ( 1 ) . Hence, by Cauchy–Schwarz, ∥ E ( e 0 , i ε ~ S , i T ) ∥ o p = O ( ( p ∧ q ) − 1 / 2 ) = o ( 1 ) \lVert\mathbb{E}(e_{0,i}\tilde{\varepsilon}_{S,i}^{\mathsf{T}})\rVert_{\mathrm{op}}=O((p\wedge q)^{-1/2})=o(1) ∥ E ( e 0 , i ε ~ S , i T ) ∥ op = O (( p ∧ q ) − 1/2 ) = o ( 1 ) , and the centered fluctuation is also o p ( 1 ) o_p(1) o p ( 1 ) since the dimension is fixed. Thus, ( 1 / n t ) ( Z ^ U ) ⊤ E ~ S = o p ( 1 ) (1/\sqrt{n_t})(\widehat{Z}U)^\top\widetilde{E}_S=o_p(1) ( 1/ n t ) ( Z U ) ⊤ E S = o p ( 1 ) . Now, combining the three blocks,
M ‾ → p ( R Ω 1 R ⊤ 0 0 I d ) . \overline{M}\xrightarrow{p}\begin{pmatrix}R\Omega_1R^\top& 0\\ 0 & I_d\end{pmatrix}. M p ( R Ω 1 R ⊤ 0 0 I d ) .
The limit is positive definite since λ min ( Ω 1 ) \lambda_{\min}(\Omega_1) λ m i n ( Ω 1 ) is bounded away from zero by Assumption 3.1(iii)–(iv) and ν min ( R ) ≥ c R > 0 \nu_{\min}(R)\ge c_R>0 ν m i n ( R ) ≥ c R > 0 by Lemma C.5 . Therefore, ∥ M ‾ − 1 ∥ o p = O p ( 1 ) \|\overline{M}^{-1}\|_{\mathrm{op}}=O_p(1) ∥ M − 1 ∥ op = O p ( 1 ) .
Step 3: Expansion of the null-space coefficient. We expand the null-space coefficient in the same way as the terms J 1 , … , J 4 J_1,\ldots,J_4 J 1 , … , J 4 in Lemma C.6. From Step 2, the least-squares estimator in the normalized coordinates satisfies
( a ^ Σ S 1 / 2 κ ^ ) = M ‾ − 1 1 n t Z ‾ ⊤ Y . \begin{pmatrix}\widehat{a}\\ \Sigma_S^{1/2}\widehat{\kappa}\end{pmatrix}
=\overline{M}^{-1}\frac{1}{n_t}\overline{Z}^{\top}Y. ( a Σ S 1/2 κ ) = M − 1 n t 1 Z ⊤ Y .
Since δ ∈ Col ( U ) \delta\in\operatorname{Col}(U) δ ∈ Col ( U ) , we have δ = U U ⊤ δ \delta=UU^\top\delta δ = U U ⊤ δ , so Z ‾ ( δ ⊤ U , 0 ⊤ ) ⊤ = Z ^ δ = Z δ + E 0 δ \overline{Z}(\delta^\top U,0^\top)^\top=\widehat{Z}\delta=Z\delta+E_0\delta Z ( δ ⊤ U , 0 ⊤ ) ⊤ = Z δ = Z δ + E 0 δ . Thus, by Equation (A.2), we have
Y = Z ‾ ( U ⊤ δ 0 ) − E 0 δ + ϵ 1 . Y=\overline{Z}\begin{pmatrix}U^\top\delta\\0\end{pmatrix}-E_0\delta+\epsilon_1. Y = Z ( U ⊤ δ 0 ) − E 0 δ + ϵ 1 .
Now, substituting this into the least-squares expression gives
( a ^ − U ⊤ δ Σ S 1 / 2 κ ^ ) = − M ‾ − 1 1 n t Z ‾ ⊤ E 0 δ + M ‾ − 1 1 n t Z ‾ ⊤ ϵ 1 . \begin{pmatrix}\widehat{a}-U^\top\delta\\ \Sigma_S^{1/2}\widehat{\kappa}\end{pmatrix}
=-\overline{M}^{-1}\frac{1}{n_t}\overline{Z}^{\top}E_0\delta+\overline{M}^{-1}\frac{1}{n_t}\overline{Z}^{\top}\epsilon_1. ( a − U ⊤ δ Σ S 1/2 κ ) = − M − 1 n t 1 Z ⊤ E 0 δ + M − 1 n t 1 Z ⊤ ϵ 1 .
Since Z ‾ = [ R F 1 ⊤ + E 0 U , E ~ S ] \overline{Z}=[R F_1^\top+E_0U,\widetilde{E}_S] Z = [ R F 1 ⊤ + E 0 U , E S ] , we have
Z ‾ ⊤ E 0 δ = ( R F 1 ⊤ E 0 δ + U ⊤ E 0 ⊤ E 0 δ E ~ S ⊤ E 0 δ ) , Z ‾ ⊤ ϵ 1 = ( R F 1 ⊤ ϵ 1 + U ⊤ E 0 ⊤ ϵ 1 E ~ S ⊤ ϵ 1 ) . \overline{Z}^{\top}E_0\delta=
\begin{pmatrix}
R F_1^\top E_0\delta+U^\top E_0^\top E_0\delta\\
\widetilde{E}_S^\top E_0\delta
\end{pmatrix},
\qquad
\overline{Z}^{\top}\epsilon_1=
\begin{pmatrix}
R F_1^\top\epsilon_1+U^\top E_0^\top\epsilon_1\\
\widetilde{E}_S^\top\epsilon_1
\end{pmatrix}. Z ⊤ E 0 δ = ( R F 1 ⊤ E 0 δ + U ⊤ E 0 ⊤ E 0 δ E S ⊤ E 0 δ ) , Z ⊤ ϵ 1 = ( R F 1 ⊤ ϵ 1 + U ⊤ E 0 ⊤ ϵ 1 E S ⊤ ϵ 1 ) .
Let P d = ( 0 d × ( 1 + p ˉ + q ˉ ) I d ) P_d=(0_{d\times(1+\bar p+\bar q)}\ I_d) P d = ( 0 d × ( 1 + p ˉ + q ˉ ) I d ) select the last d d d coordinates. Now, taking the null-space coordinates and multiplying by n t \sqrt{n_t} n t gives
n t Σ S 1 / 2 κ ^ = − P d M ‾ − 1 ( R 1 n t F 1 ⊤ E 0 δ 0 ) − P d M ‾ − 1 ( 1 n t U ⊤ E 0 ⊤ E 0 δ 1 n t E ~ S ⊤ E 0 δ ) + P d M ‾ − 1 ( R 1 n t F 1 ⊤ ϵ 1 0 ) + P d M ‾ − 1 ( 1 n t U ⊤ E 0 ⊤ ϵ 1 1 n t E ~ S ⊤ ϵ 1 ) . (38) \begin{aligned}
\sqrt{n_t}\Sigma_S^{1/2}\widehat{\kappa}
={}&-P_d\overline{M}^{-1}
\begin{pmatrix}
R\frac{1}{\sqrt{n_t}}F_1^\top E_0\delta\\
0
\end{pmatrix}
-P_d\overline{M}^{-1}
\begin{pmatrix}
\frac{1}{\sqrt{n_t}}U^\top E_0^\top E_0\delta\\
\frac{1}{\sqrt{n_t}}\widetilde{E}_S^\top E_0\delta
\end{pmatrix}\\
&+P_d\overline{M}^{-1}
\begin{pmatrix}
R\frac{1}{\sqrt{n_t}}F_1^\top\epsilon_1\\
0
\end{pmatrix}
+P_d\overline{M}^{-1}
\begin{pmatrix}
\frac{1}{\sqrt{n_t}}U^\top E_0^\top\epsilon_1\\
\frac{1}{\sqrt{n_t}}\widetilde{E}_S^\top\epsilon_1
\end{pmatrix}. \tag*{(38)}
\end{aligned} n t Σ S 1/2 κ = − P d M − 1 ( R n t 1 F 1 ⊤ E 0 δ 0 ) − P d M − 1 ( n t 1 U ⊤ E 0 ⊤ E 0 δ n t 1 E S ⊤ E 0 δ ) + P d M − 1 ( R n t 1 F 1 ⊤ ϵ 1 0 ) + P d M − 1 ( n t 1 U ⊤ E 0 ⊤ ϵ 1 n t 1 E S ⊤ ϵ 1 ) . (38)
Step 4: Bounds on K 1 , … , K 4 K_1,\ldots,K_4 K 1 , … , K 4 .
Term K 1 K_1 K 1 . Using ∥ M ‾ − 1 ∥ o p = O p ( 1 ) \|\overline{M}^{-1}\|_{\mathrm{op}}=O_p(1) ∥ M − 1 ∥ op = O p ( 1 ) , the bounded operator norm of R R R , ∥ δ ∥ = O p ( 1 ) \|\delta\|=O_p(1) ∥ δ ∥ = O p ( 1 ) , and Lemma C.2 (ii),
∥ K 1 ∥ ≤ O p ( 1 ) ∥ 1 n t F 1 ⊤ E 0 δ ∥ ≤ O p ( 1 ) ∥ 1 n t F 1 ⊤ E 0 ∥ o p ∥ δ ∥ = O p ( 1 p ∧ q ) = o p ( 1 ) . \|K_1\|\le O_p(1)\left\|\frac{1}{\sqrt{n_t}}F_1^\top E_0\delta\right\|
\le O_p(1)\left\|\frac{1}{\sqrt{n_t}}F_1^\top E_0\right\|_{\mathrm{op}}\|\delta\|
=O_p\left(\frac{1}{\sqrt{p\wedge q}}\right)=o_p(1). ∥ K 1 ∥ ≤ O p ( 1 ) n t 1 F 1 ⊤ E 0 δ ≤ O p ( 1 ) n t 1 F 1 ⊤ E 0 op ∥ δ ∥ = O p ( p ∧ q 1 ) = o p ( 1 ) .
Term K 2 K_2 K 2 . By Lemma C.2 (i), the first block of K 2 K_2 K 2 satisfies
∥ 1 n t U ⊤ E 0 ⊤ E 0 δ ∥ ≤ n t ∥ 1 n t E 0 ⊤ E 0 ∥ o p ∥ δ ∥ = O p ( n t p ∧ q ) = o p ( 1 ) . \left\|\frac{1}{\sqrt{n_t}}U^\top E_0^\top E_0\delta\right\|
\le\sqrt{n_t}\left\|\frac{1}{n_t}E_0^\top E_0\right\|_{\mathrm{op}}\|\delta\|
=O_p\left(\frac{\sqrt{n_t}}{p\wedge q}\right)=o_p(1). n t 1 U ⊤ E 0 ⊤ E 0 δ ≤ n t n t 1 E 0 ⊤ E 0 op ∥ δ ∥ = O p ( p ∧ q n t ) = o p ( 1 ) .
For the second block of K 2 K_2 K 2 , we expand the normalized null-space error directly. By definition, ( 1 / n t ) E ~ S ⊤ E 0 δ = ( 1 / n t ) Σ S − 1 / 2 S ⊤ E 0 ⊤ E 0 δ (1/\sqrt{n_t})\widetilde{E}_S^\top E_0\delta=(1/\sqrt{n_t})\Sigma_S^{-1/2}S^\top E_0^\top E_0\delta ( 1/ n t ) E S ⊤ E 0 δ = ( 1/ n t ) Σ S − 1/2 S ⊤ E 0 ⊤ E 0 δ . Since E 0 = ( 0 n E X E M ) E_0=(0_n\ E_X\ E_M) E 0 = ( 0 n E X E M ) , we have E 0 δ = E X ( H X ⊤ β 1 ) + E M ( H M ⊤ γ 1 ) E_0\delta=E_X(H_X^\top\beta_1)+E_M(H_M^\top\gamma_1) E 0 δ = E X ( H X ⊤ β 1 ) + E M ( H M ⊤ γ 1 ) . Hence, using the block forms of S S S and Σ S − 1 / 2 \Sigma_S^{-1/2} Σ S − 1/2 , we have
1 n t E ~ S ⊤ E 0 δ = ( p ˉ n t Ω X − 1 / 2 S X ⊤ E X ⊤ E X ( H X ⊤ ) β 1 + p ˉ n t Ω X − 1 / 2 S X ⊤ E X ⊤ E M ( H M ⊤ ) γ 1 q ˉ n t Ω M − 1 / 2 S M ⊤ E M ⊤ E X ( H X ⊤ ) β 1 + q ˉ n t Ω M − 1 / 2 S M ⊤ E M ⊤ E M ( H M ⊤ ) γ 1 ) . \frac{1}{\sqrt{n_t}}\widetilde{E}_S^\top E_0\delta=
\begin{pmatrix}
\frac{\sqrt{\bar p}}{\sqrt{n_t}}\Omega_X^{-1/2}S_X^\top E_X^\top E_X(H_X^\top)\beta_1+
\frac{\sqrt{\bar p}}{\sqrt{n_t}}\Omega_X^{-1/2}S_X^\top E_X^\top E_M(H_M^\top)\gamma_1\\
\frac{\sqrt{\bar q}}{\sqrt{n_t}}\Omega_M^{-1/2}S_M^\top E_M^\top E_X(H_X^\top)\beta_1+
\frac{\sqrt{\bar q}}{\sqrt{n_t}}\Omega_M^{-1/2}S_M^\top E_M^\top E_M(H_M^\top)\gamma_1
\end{pmatrix}. n t 1 E S ⊤ E 0 δ = ( n t p ˉ Ω X − 1/2 S X ⊤ E X ⊤ E X ( H X ⊤ ) β 1 + n t p ˉ Ω X − 1/2 S X ⊤ E X ⊤ E M ( H M ⊤ ) γ 1 n t q ˉ Ω M − 1/2 S M ⊤ E M ⊤ E X ( H X ⊤ ) β 1 + n t q ˉ Ω M − 1/2 S M ⊤ E M ⊤ E M ( H M ⊤ ) γ 1 ) .
Proof of Theorem 5.2
For these four terms, we have
E ( E X ⊤ E X ) = n t p V X ⊤ Σ u X V X , E ( E M ⊤ E M ) = n t q V M ⊤ Σ u M V M . \mathbb{E}(\mathbf{E}_{X}^{\top}\mathbf{E}_{X})=\frac{n_t}{p}\mathbf{V}_{X}^{\top}\boldsymbol{\Sigma}_{u_X}\mathbf{V}_{X},\qquad\mathbb{E}(\mathbf{E}_{M}^{\top}\mathbf{E}_{M})=\frac{n_t}{q}\mathbf{V}_{M}^{\top}\boldsymbol{\Sigma}_{u_M}\mathbf{V}_{M}. E ( E X ⊤ E X ) = p n t V X ⊤ Σ u X V X , E ( E M ⊤ E M ) = q n t V M ⊤ Σ u M V M .
Moreover, from Assumption 3.1(ii), E ( E X ⊤ E M ) = 0 \mathbb{E}(\mathbf{E}_{X}^{\top}\mathbf{E}_{M})=0 E ( E X ⊤ E M ) = 0 . Since the projected dimensions are fixed and the proxy errors have uniformly bounded fourth moments by Assumption 5.1(i), we get
∥ E X ⊤ E X − E ( E X ⊤ E X ) ∥ o p = O p ( n t p ) , ∥ E M ⊤ E M − E ( E M ⊤ E M ) ∥ o p = O p ( n t q ) . \left\|\mathbf{E}_{X}^{\top}\mathbf{E}_{X}-\mathbb{E}(\mathbf{E}_{X}^{\top}\mathbf{E}_{X})\right\|_{\mathrm{op}}=O_p\left(\frac{\sqrt{n_t}}{p}\right),\qquad\left\|\mathbf{E}_{M}^{\top}\mathbf{E}_{M}-\mathbb{E}(\mathbf{E}_{M}^{\top}\mathbf{E}_{M})\right\|_{\mathrm{op}}=O_p\left(\frac{\sqrt{n_t}}{q}\right). E X ⊤ E X − E ( E X ⊤ E X ) op = O p ( p n t ) , E M ⊤ E M − E ( E M ⊤ E M ) op = O p ( q n t ) .
and the cross-product satisfies ∥ E X ⊤ E M ∥ o p = O p ( n t / ( p q ) ) \|\mathbf{E}_{X}^{\top}\mathbf{E}_{M}\|_{\mathrm{op}}=O_p(\sqrt{n_t/(pq)}) ∥ E X ⊤ E M ∥ op = O p ( n t / ( pq ) ) . Consider first the E X ⊤ E X \mathbf{E}_{X}^{\top}\mathbf{E}_{X} E X ⊤ E X term. Splitting it into its mean and centered parts,
p n t Ω X − 1 / 2 S X ⊤ E X ⊤ E X ( H X † ) ⊤ β 1 = p n t Ω X − 1 / 2 S X ⊤ { E X ⊤ E X − E ( E X ⊤ E X ) } ( H X † ) ⊤ β 1 + p n t Ω X − 1 / 2 S X ⊤ E ( E X ⊤ E X ) ( H X † ) ⊤ β 1 . \begin{aligned}
\frac{\sqrt{p}}{\sqrt{n_t}}\boldsymbol{\Omega}_{X}^{-1/2}\mathbf{S}_{X}^{\top}\mathbf{E}_{X}^{\top}\mathbf{E}_{X}(\mathbf{H}_{X}^{\dagger})^{\top}\boldsymbol{\beta}_{1} \\
&=\frac{\sqrt{p}}{\sqrt{n_t}}\boldsymbol{\Omega}_{X}^{-1/2}\mathbf{S}_{X}^{\top}\{\mathbf{E}_{X}^{\top}\mathbf{E}_{X}-\mathbb{E}(\mathbf{E}_{X}^{\top}\mathbf{E}_{X})\}(\mathbf{H}_{X}^{\dagger})^{\top}\boldsymbol{\beta}_{1}
+\frac{\sqrt{p}}{\sqrt{n_t}}\boldsymbol{\Omega}_{X}^{-1/2}\mathbf{S}_{X}^{\top}\mathbb{E}(\mathbf{E}_{X}^{\top}\mathbf{E}_{X})(\mathbf{H}_{X}^{\dagger})^{\top}\boldsymbol{\beta}_{1}.
\end{aligned} n t p Ω X − 1/2 S X ⊤ E X ⊤ E X ( H X † ) ⊤ β 1 = n t p Ω X − 1/2 S X ⊤ { E X ⊤ E X − E ( E X ⊤ E X )} ( H X † ) ⊤ β 1 + n t p Ω X − 1/2 S X ⊤ E ( E X ⊤ E X ) ( H X † ) ⊤ β 1 .
Since ∥ Ω X − 1 / 2 ∥ o p = O ( 1 ) \|\boldsymbol{\Omega}_{X}^{-1/2}\|_{\mathrm{op}}=O(1) ∥ Ω X − 1/2 ∥ op = O ( 1 ) , ∥ S X ∥ o p = 1 \|\mathbf{S}_{X}\|_{\mathrm{op}}=1 ∥ S X ∥ op = 1 , and ∥ H X † ∥ o p = O p ( 1 ) \|\mathbf{H}_{X}^{\dagger}\|_{\mathrm{op}}=O_p(1) ∥ H X † ∥ op = O p ( 1 ) by Proposition 5.1, the centered part is O p ( p − 1 / 2 ) O_p(p^{-1/2}) O p ( p − 1/2 ) and the mean part is O p ( n t / p ) O_p(\sqrt{n_t}/p) O p ( n t / p ) . The same argument applies to the E M ⊤ E M \mathbf{E}_{M}^{\top}\mathbf{E}_{M} E M ⊤ E M term, so
p n t Ω X − 1 / 2 S X ⊤ E X ⊤ E X ( H X † ) ⊤ β 1 = O p ( n t p + 1 p ) , q n t Ω M − 1 / 2 S M ⊤ E M ⊤ E M ( H M † ) ⊤ γ 1 = O p ( n t q + 1 q ) . \frac{\sqrt{p}}{\sqrt{n_t}}\boldsymbol{\Omega}_{X}^{-1/2}\mathbf{S}_{X}^{\top}\mathbf{E}_{X}^{\top}\mathbf{E}_{X}(\mathbf{H}_{X}^{\dagger})^{\top}\boldsymbol{\beta}_{1}
=O_p\left(\sqrt{\frac{n_t}{p}}+\frac{1}{\sqrt{p}}\right),\qquad
\frac{\sqrt{q}}{\sqrt{n_t}}\boldsymbol{\Omega}_{M}^{-1/2}\mathbf{S}_{M}^{\top}\mathbf{E}_{M}^{\top}\mathbf{E}_{M}(\mathbf{H}_{M}^{\dagger})^{\top}\boldsymbol{\gamma}_{1}
=O_p\left(\sqrt{\frac{n_t}{q}}+\frac{1}{\sqrt{q}}\right). n t p Ω X − 1/2 S X ⊤ E X ⊤ E X ( H X † ) ⊤ β 1 = O p ( p n t + p 1 ) , n t q Ω M − 1/2 S M ⊤ E M ⊤ E M ( H M † ) ⊤ γ 1 = O p ( q n t + q 1 ) .
For the first cross-product term, we have that
∥ p n t Ω X − 1 / 2 S X ⊤ E X ⊤ E M ( H M † ) ⊤ γ 1 ∥ ≤ O p ( 1 ) p n t ∥ E X ⊤ E M ∥ o p = O p ( 1 ) p n t O p ( n t p q ) = O p ( q − 1 / 2 ) , \left\|\frac{\sqrt{p}}{\sqrt{n_t}}\boldsymbol{\Omega}_{X}^{-1/2}\mathbf{S}_{X}^{\top}\mathbf{E}_{X}^{\top}\mathbf{E}_{M}(\mathbf{H}_{M}^{\dagger})^{\top}\boldsymbol{\gamma}_{1}\right\|
\le O_p(1)\frac{\sqrt{p}}{\sqrt{n_t}}\|\mathbf{E}_{X}^{\top}\mathbf{E}_{M}\|_{\mathrm{op}}
=O_p(1)\frac{\sqrt{p}}{\sqrt{n_t}}O_p\left(\sqrt{\frac{n_t}{pq}}\right)
=O_p(q^{-1/2}), n t p Ω X − 1/2 S X ⊤ E X ⊤ E M ( H M † ) ⊤ γ 1 ≤ O p ( 1 ) n t p ∥ E X ⊤ E M ∥ op = O p ( 1 ) n t p O p ( pq n t ) = O p ( q − 1/2 ) ,
and similarly the second cross-product term is O p ( p − 1 / 2 ) O_p(p^{-1/2}) O p ( p − 1/2 ) . Now, combining the four terms gives us
∥ 1 n t E ~ S E 0 δ ∥ = O p ( n t p + n t q + 1 p + 1 q ) . \left\|\frac{1}{\sqrt{n_t}}\widetilde{\mathbf{E}}_{\mathbf{S}}\mathbf{E}_{0}\boldsymbol{\delta}\right\|
=O_p\left(\sqrt{\frac{n_t}{p}}+\sqrt{\frac{n_t}{q}}+\frac{1}{\sqrt{p}}+\frac{1}{\sqrt{q}}\right). n t 1 E S E 0 δ = O p ( p n t + q n t + p 1 + q 1 ) .
Under Assumption 5.2(ii), this is o p ( 1 ) o_p(1) o p ( 1 ) . Therefore, together with the bound for the first block, K 2 = o p ( 1 ) K_2=o_p(1) K 2 = o p ( 1 ) .
Term K 3 K_3 K 3 . By the same conditional second-moment argument used for J 3 J_3 J 3 in Lemma C.6, ∥ n t − 1 / 2 F 1 ⊤ ϵ 1 ∥ = O p ( 1 ) \|n_t^{-1/2}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1\|=O_p(1) ∥ n t − 1/2 F 1 ⊤ ϵ 1 ∥ = O p ( 1 ) . Since ∥ P d ∥ o p = 1 \|\mathbf{P}_d\|_{\mathrm{op}}=1 ∥ P d ∥ op = 1 , ∥ M ‾ − 1 ∥ o p = O p ( 1 ) \|\overline{\mathbf{M}}^{-1}\|_{\mathrm{op}}=O_p(1) ∥ M − 1 ∥ op = O p ( 1 ) and ∥ R ∥ o p = O ( 1 ) \|\mathbf{R}\|_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) , it follows that ∥ K 3 ∥ = O p ( 1 ) \|K_3\|=O_p(1) ∥ K 3 ∥ = O p ( 1 ) .
Term K 4 K_4 K 4 . For the first block, Lemma C.2(iv) gives
∥ 1 n t U ⊤ E 0 ϵ 1 ∥ = O p ( ( p ∧ q ) − 1 / 2 ) . \left\|\frac{1}{\sqrt{n_t}}\mathbf{U}^{\top}\mathbf{E}_{0}\boldsymbol{\epsilon}_{1}\right\|=O_p\left((p\wedge q)^{-1/2}\right). n t 1 U ⊤ E 0 ϵ 1 = O p ( ( p ∧ q ) − 1/2 ) .
For the second block, using E ~ S = E 0 S Σ S − 1 / 2 \widetilde{\mathbf{E}}_{\mathbf{S}}=\mathbf{E}_{0}\mathbf{S}\boldsymbol{\Sigma}_{\mathbf{S}}^{-1/2} E S = E 0 S Σ S − 1/2 , the block forms of S \mathbf{S} S and Σ S − 1 / 2 \boldsymbol{\Sigma}_{\mathbf{S}}^{-1/2} Σ S − 1/2 , and the forms of E X \mathbf{E}_{X} E X and E M \mathbf{E}_{M} E M in Step 1, we get that
1 n t E ~ S ⊤ ϵ 1 = ( 1 n t Ω X − 1 / 2 S X ⊤ V X ⊤ U X ⊤ ϵ 1 1 n t Ω M − 1 / 2 S M ⊤ V M ⊤ U M ⊤ ϵ 1 ) . \frac{1}{\sqrt{n_t}}\widetilde{\mathbf{E}}_{\mathbf{S}}^{\top}\boldsymbol{\epsilon}_{1}
=
\begin{pmatrix}
\frac{1}{\sqrt{n_t}}\boldsymbol{\Omega}_{X}^{-1/2}\mathbf{S}_{X}^{\top}\mathbf{V}_{X}^{\top}\mathbf{U}_{X}^{\top}\boldsymbol{\epsilon}_{1}\\
\frac{1}{\sqrt{n_t}}\boldsymbol{\Omega}_{M}^{-1/2}\mathbf{S}_{M}^{\top}\mathbf{V}_{M}^{\top}\mathbf{U}_{M}^{\top}\boldsymbol{\epsilon}_{1}
\end{pmatrix}. n t 1 E S ⊤ ϵ 1 = ( n t 1 Ω X − 1/2 S X ⊤ V X ⊤ U X ⊤ ϵ 1 n t 1 Ω M − 1/2 S M ⊤ V M ⊤ U M ⊤ ϵ 1 ) .
Using Assumption 3.1(ii), together with the bounded second moments and the bounded eigenvalues of Ω X − 1 \boldsymbol{\Omega}_{X}^{-1} Ω X − 1 and Ω M − 1 \boldsymbol{\Omega}_{M}^{-1} Ω M − 1 , both blocks are O p ( 1 ) O_p(1) O p ( 1 ) , so ∥ n t − 1 / 2 E ~ S ⊤ ϵ 1 ∥ = O p ( 1 ) \|n_t^{-1/2}\widetilde{\mathbf{E}}_{\mathbf{S}}^{\top}\boldsymbol{\epsilon}_{1}\|=O_p(1) ∥ n t − 1/2 E S ⊤ ϵ 1 ∥ = O p ( 1 ) . Since ∥ P d ∥ o p = 1 \|\mathbf{P}_d\|_{\mathrm{op}}=1 ∥ P d ∥ op = 1 and ∥ M ‾ − 1 ∥ o p = O p ( 1 ) \|\overline{\mathbf{M}}^{-1}\|_{\mathrm{op}}=O_p(1) ∥ M − 1 ∥ op = O p ( 1 ) , it follows that K 4 = O p ( 1 ) K_4=O_p(1) K 4 = O p ( 1 ) . Now, combining the four terms in Equation (C.12), we have n t ∥ Σ S 1 / 2 κ ^ ∥ = O p ( 1 ) \sqrt{n_t}\|\boldsymbol{\Sigma}_{\mathbf{S}}^{1/2}\widehat{\boldsymbol{\kappa}}\|=O_p(1) n t ∥ Σ S 1/2 κ ∥ = O p ( 1 ) , and hence, we have ∥ Σ S 1 / 2 κ ^ ∥ = O p ( n t − 1 / 2 ) \|\boldsymbol{\Sigma}_{\mathbf{S}}^{1/2}\widehat{\boldsymbol{\kappa}}\|=O_p(n_t^{-1/2}) ∥ Σ S 1/2 κ ∥ = O p ( n t − 1/2 ) .
Step 5: Rate for γ ^ 1 , ⊥ \widehat{\gamma}_{1,\perp} γ 1 , ⊥ . Since we have Σ S 1 / 2 = diag ( p − 1 / 2 Ω X 1 / 2 , q − 1 / 2 Ω M 1 / 2 ) \boldsymbol{\Sigma}_{\mathbf{S}}^{1/2}=\operatorname{diag}(p^{-1/2}\boldsymbol{\Omega}_{X}^{1/2},q^{-1/2}\boldsymbol{\Omega}_{M}^{1/2}) Σ S 1/2 = diag ( p − 1/2 Ω X 1/2 , q − 1/2 Ω M 1/2 ) , the mediator null-space block satisfies that ∥ q − 1 / 2 Ω M 1 / 2 κ ^ M ∥ = O p ( n t − 1 / 2 ) \|q^{-1/2}\boldsymbol{\Omega}_{M}^{1/2}\widehat{\boldsymbol{\kappa}}_{M}\|=O_p(n_t^{-1/2}) ∥ q − 1/2 Ω M 1/2 κ M ∥ = O p ( n t − 1/2 ) . Since the eigenvalues of Ω M \boldsymbol{\Omega}_{M} Ω M are bounded above and away from zero, ∥ κ ^ M ∥ = O p ( q / n t ) \|\widehat{\boldsymbol{\kappa}}_{M}\|=O_p(\sqrt{q/n_t}) ∥ κ M ∥ = O p ( q / n t ) . Since S M \mathbf{S}_{M} S M has orthonormal columns, we have
∥ γ ^ 1 , ⊥ ∥ = ∥ S M κ ^ M ∥ = O p ( q n t ) . (39) \|\widehat{\gamma}_{1,\perp}\|=\|\mathbf{S}_{M}\widehat{\boldsymbol{\kappa}}_{M}\|=O_p\left(\sqrt{\frac{q}{n_t}}\right). \tag*{(39)} ∥ γ 1 , ⊥ ∥ = ∥ S M κ M ∥ = O p ( n t q ) . (39)
Proof of Theorem 5.2
Proof. Recall that θ ^ 0 = α ^ 1 + γ ^ 1 ⊤ δ 0 \hat{\theta}_0 = \hat{\alpha}_1 + \hat{\gamma}_1^{\top}\delta_0 θ ^ 0 = α ^ 1 + γ ^ 1 ⊤ δ 0 and θ 0 = α 1 + γ 1 ⊤ δ 0 \theta_0 = \alpha_1 + \gamma_1^{\top}\delta_0 θ 0 = α 1 + γ 1 ⊤ δ 0 . Since the second-stage response depends on the first-stage estimator γ ^ 1 \hat{\gamma}_1 γ ^ 1 , we separate the bridge estimation error from the error due to estimating γ 1 \gamma_1 γ 1 . For one regression fold, α ^ 1 \hat{\alpha}_1 α ^ 1 and γ ^ 1 \hat{\gamma}_1 γ ^ 1 are estimated using the treated units, while γ ^ 1 ⊤ δ 0 \hat{\gamma}_1^{\top}\delta_0 γ ^ 1 ⊤ δ 0 is estimated using the control units. The whitening matrices are estimated on the other fold and are therefore fixed conditional on the training fold. We write n t n_t n t and n c n_c n c for the treated and control sample sizes in the regression fold. Since n t , n c ≍ n n_t,n_c \asymp n n t , n c ≍ n , the ratios n / n t n/n_t n / n t and n / n c n/n_c n / n c are bounded in probability.
Since γ ^ 1 \hat{\gamma}_1 γ ^ 1 is the coefficient on the projected mediator factors, it is a q ~ \tilde{q} q ~ -dimensional vector, while γ 1 \gamma_1 γ 1 is recovered through H M ⊤ γ ^ 1 H_M^{\top}\hat{\gamma}_1 H M ⊤ γ ^ 1 . We write Δ γ , n : = H M ⊤ γ ^ 1 − γ 1 \Delta_{\gamma,n} := H_M^{\top}\hat{\gamma}_1 - \gamma_1 Δ γ , n := H M ⊤ γ ^ 1 − γ 1 . The population bridge intercept conditional on γ ^ 1 \hat{\gamma}_1 γ ^ 1 is γ ^ 1 ⊤ H M δ 0 \hat{\gamma}_1^{\top}H_M\delta_0 γ ^ 1 ⊤ H M δ 0 . Also, γ ^ 1 ⊤ H M δ 0 − γ 1 ⊤ δ 0 = δ 0 ⊤ ( H M ⊤ γ ^ 1 − γ 1 ) \hat{\gamma}_1^{\top}H_M\delta_0 - \gamma_1^{\top}\delta_0 = \delta_0^{\top}(H_M^{\top}\hat{\gamma}_1 - \gamma_1) γ ^ 1 ⊤ H M δ 0 − γ 1 ⊤ δ 0 = δ 0 ⊤ ( H M ⊤ γ ^ 1 − γ 1 ) . Therefore, we have
n ( θ ^ 0 − θ 0 ) = n ( α ^ 1 − α 1 ) + n ( γ ^ 1 ⊤ δ 0 − γ 1 ⊤ δ 0 ) = n ( α ^ 1 − α 1 ) + n ( γ ^ 1 ⊤ δ 0 − γ ^ 1 ⊤ H M δ 0 ) + n ( γ ^ 1 ⊤ H M δ 0 − γ 1 ⊤ δ 0 ) = n ( α ^ 1 − α 1 ) + n ( γ ^ 1 ⊤ δ 0 − γ ^ 1 ⊤ H M δ 0 ) + n δ 0 ⊤ ( H M ⊤ γ ^ 1 − γ 1 ) . (40) \begin{aligned}
\sqrt{n}(\hat{\theta}_0-\theta_0)=\sqrt{n}(\hat{\alpha}_1-\alpha_1)+\sqrt{n}(\hat{\gamma}_1^{\top}\delta_0-\gamma_1^{\top}\delta_0) \\
&=\sqrt{n}(\hat{\alpha}_1-\alpha_1)+\sqrt{n}(\hat{\gamma}_1^{\top}\delta_0-\hat{\gamma}_1^{\top}H_M\delta_0)+\sqrt{n}(\hat{\gamma}_1^{\top}H_M\delta_0-\gamma_1^{\top}\delta_0) \\
&=\sqrt{n}(\hat{\alpha}_1-\alpha_1)+\sqrt{n}(\hat{\gamma}_1^{\top}\delta_0-\hat{\gamma}_1^{\top}H_M\delta_0)+\sqrt{n}\delta_0^{\top}(H_M^{\top}\hat{\gamma}_1-\gamma_1). \tag*{(40)}
\end{aligned} n ( θ ^ 0 − θ 0 ) = n ( α ^ 1 − α 1 ) + n ( γ ^ 1 ⊤ δ 0 − γ 1 ⊤ δ 0 ) = n ( α ^ 1 − α 1 ) + n ( γ ^ 1 ⊤ δ 0 − γ ^ 1 ⊤ H M δ 0 ) + n ( γ ^ 1 ⊤ H M δ 0 − γ 1 ⊤ δ 0 ) = n ( α ^ 1 − α 1 ) + n ( γ ^ 1 ⊤ δ 0 − γ ^ 1 ⊤ H M δ 0 ) + n δ 0 ⊤ ( H M ⊤ γ ^ 1 − γ 1 ) . (40)
We consider the three terms in Equation (C.14) separately. For the first term,
n ( α ^ 1 − α 1 ) = n n t ( − G 1 − G 2 + G 3 + G 4 ) . \sqrt{n}(\hat{\alpha}_1-\alpha_1)=\sqrt{\frac{n}{n_t}}(-G_1-G_2+G_3+G_4). n ( α ^ 1 − α 1 ) = n t n ( − G 1 − G 2 + G 3 + G 4 ) .
The second term is expanded over the control units on the n c \sqrt{n_c} n c scale into the terms L 1 , … , L 6 L_1,\ldots,L_6 L 1 , … , L 6 . For the third term, Lemma C.6 gives Δ γ , n = O p ( n t − 1 / 2 ) \Delta_{\gamma,n}=O_p(n_t^{-1/2}) Δ γ , n = O p ( n t − 1/2 ) , so n Δ γ , n ⊤ δ 0 = O p ( 1 ) \sqrt{n}\Delta_{\gamma,n}^{\top}\delta_0=O_p(1) n Δ γ , n ⊤ δ 0 = O p ( 1 ) . Write this term as n / n c L 7 \sqrt{n/n_c}L_7 n / n c L 7 where L 7 = n c Δ γ , n ⊤ δ 0 L_7=\sqrt{n_c}\Delta_{\gamma,n}^{\top}\delta_0 L 7 = n c Δ γ , n ⊤ δ 0 .
Part 1: Linear Expansions. We first expand the two estimation errors into their bias and first-order terms.
Expansion of α ^ 1 \hat{\alpha}_1 α ^ 1 . Under A = 1 A=1 A = 1 , the outcome model in (2.1) can be written as Y = Z δ + ϵ 1 Y=Z\delta+\epsilon_1 Y = Z δ + ϵ 1 . Recall that α ^ 1 \hat{\alpha}_1 α ^ 1 is the first coordinate of the least-squares coefficient from regressing Y Y Y on Z ^ \hat{Z} Z ^ using the treated units. Let e 1 = ( 1 , 0 , … , 0 ) ⊤ e_1=(1,0,\ldots,0)^{\top} e 1 = ( 1 , 0 , … , 0 ) ⊤ . Then, we have that
α ^ 1 = e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t Z ^ ⊤ Y = e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t Z ^ ⊤ ( Z δ + ϵ 1 ) = e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t Z ^ ⊤ ( Z ^ δ + Z δ − Z ^ δ + ϵ 1 ) = e 1 ⊤ δ + e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t Z ^ ⊤ ( Z − Z ^ ) δ + e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t Z ^ ⊤ ϵ 1 . \begin{aligned}
\hat{\alpha}_1=e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\top}Y \\
&=e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\top}(Z\delta+\epsilon_1) \\
&=e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\top}(\hat{Z}\delta+Z\delta-\hat{Z}\delta+\epsilon_1) \\
&=e_1^{\top}\delta+e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\top}(Z-\hat{Z})\delta+e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{n_t}\hat{Z}^{\top}\epsilon_1.
\end{aligned} α ^ 1 = e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 Z ^ ⊤ Y = e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 Z ^ ⊤ ( Z δ + ϵ 1 ) = e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 Z ^ ⊤ ( Z ^ δ + Z δ − Z ^ δ + ϵ 1 ) = e 1 ⊤ δ + e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 Z ^ ⊤ ( Z − Z ^ ) δ + e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 Z ^ ⊤ ϵ 1 .
The first term is e 1 ⊤ δ = α 1 e_1^{\top}\delta=\alpha_1 e 1 ⊤ δ = α 1 . Recall that Z ^ = Z + E 0 \hat{Z}=Z+E_0 Z ^ = Z + E 0 , so Z − Z ^ = − E 0 Z-\hat{Z}=-E_0 Z − Z ^ = − E 0 . Now, taking α 1 \alpha_1 α 1 on the left side and multiplying the whole equation by n t \sqrt{n_t} n t gives
n t ( α ^ 1 − α 1 ) = − e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t Z ^ ⊤ E 0 δ + e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t Z ^ ⊤ ϵ 1 . (41) \sqrt{n_t}(\hat{\alpha}_1-\alpha_1)=-e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}\hat{Z}^{\top}E_0\delta+e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}\hat{Z}^{\top}\epsilon_1. \tag*{(41)} n t ( α ^ 1 − α 1 ) = − e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 Z ^ ⊤ E 0 δ + e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 Z ^ ⊤ ϵ 1 . (41)
Also, since Z = F 1 H 1 ⊤ Z=F_1H_1^{\top} Z = F 1 H 1 ⊤ , we have Z ^ ⊤ = H 1 F 1 ⊤ + E 0 ⊤ \hat{Z}^{\top}=H_1F_1^{\top}+E_0^{\top} Z ^ ⊤ = H 1 F 1 ⊤ + E 0 ⊤ . Therefore, we have
n t ( α ^ 1 − α 1 ) = − e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 H 1 1 n t F 1 ⊤ E 0 δ − e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t E 0 ⊤ E 0 δ + e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 H 1 1 n t F 1 ⊤ ϵ 1 + e 1 ⊤ ( 1 n t Z ^ ⊤ Z ^ ) − 1 1 n t E 0 ⊤ ϵ 1 . \begin{aligned}
\sqrt{n_t}(\hat{\alpha}_1-\alpha_1)
={}&-e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}H_1\frac{1}{\sqrt{n_t}}F_1^{\top}E_0\delta
-e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}E_0^{\top}E_0\delta\\
&+e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}H_1\frac{1}{\sqrt{n_t}}F_1^{\top}\epsilon_1
+e_1^{\top}\left(\frac{1}{n_t}\hat{Z}^{\top}\hat{Z}\right)^{-1}\frac{1}{\sqrt{n_t}}E_0^{\top}\epsilon_1.
\end{aligned} n t ( α ^ 1 − α 1 ) = − e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 H 1 n t 1 F 1 ⊤ E 0 δ − e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 E 0 ⊤ E 0 δ + e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 H 1 n t 1 F 1 ⊤ ϵ 1 + e 1 ⊤ ( n t 1 Z ^ ⊤ Z ^ ) − 1 n t 1 E 0 ⊤ ϵ 1 .
Here, G 3 G_3 G 3 is the signal term, while G 1 G_1 G 1 , G 2 G_2 G 2 , and G 4 G_4 G 4 involve the estimation error E 0 E_0 E 0 . In Part 2, we show that G 1 , G 2 , G 4 = o p ( 1 ) G_1,G_2,G_4=o_p(1) G 1 , G 2 , G 4 = o p ( 1 ) , while G 3 G_3 G 3 remains.
Bridge equation for the second stage. By Equation (10) , f ^ M = H M f M + 1 q W M ⊤ u M \hat{f}_{M} = H_{M}f_{M} + \frac{1}{q}W_{M}^{\top}u_{M} f ^ M = H M f M + q 1 W M ⊤ u M , and since γ ^ 1 ⊤ H M = γ 1 ⊤ + Δ γ , n ⊤ \hat{\gamma}_{1}^{\top}H_{M} = \gamma_{1}^{\top} + \Delta_{\gamma,n}^{\top} γ ^ 1 ⊤ H M = γ 1 ⊤ + Δ γ , n ⊤ , we have
b = ( γ 1 ⊤ + Δ γ , n ⊤ ) f M + γ ^ 1 ⊤ 1 q W M ⊤ u M . (42) b = \left(\gamma_{1}^{\top} + \Delta_{\gamma,n}^{\top}\right)f_{M} + \hat{\gamma}_{1}^{\top}\frac{1}{q}W_{M}^{\top}u_{M}. \tag*{(42)} b = ( γ 1 ⊤ + Δ γ , n ⊤ ) f M + γ ^ 1 ⊤ q 1 W M ⊤ u M . (42)
To control the mediator-whitening term, Lemma C.6 controls H M ⊤ γ ^ 1 − γ 1 H_{M}^{\top}\hat{\gamma}_{1} - \gamma_{1} H M ⊤ γ ^ 1 − γ 1 but not the full vector γ ^ 1 \hat{\gamma}_{1} γ ^ 1 , so we split γ ^ 1 \hat{\gamma}_{1} γ ^ 1 into its row-space and null-space parts. Let P M = H M ( H M ⊤ H M ) − 1 H M ⊤ P_{M} = H_{M}(H_{M}^{\top}H_{M})^{-1}H_{M}^{\top} P M = H M ( H M ⊤ H M ) − 1 H M ⊤ be the projection onto Col ( H M ) \operatorname{Col}(H_{M}) Col ( H M ) , and write
γ ^ 1 = P M γ ^ 1 + ( I − P M ) γ ^ 1 = γ ^ 1 , ∥ + γ ^ 1 , ⊥ . \hat{\gamma}_{1} = P_{M}\hat{\gamma}_{1} + (I-P_{M})\hat{\gamma}_{1} = \hat{\gamma}_{1,\parallel} + \hat{\gamma}_{1,\perp}. γ ^ 1 = P M γ ^ 1 + ( I − P M ) γ ^ 1 = γ ^ 1 , ∥ + γ ^ 1 , ⊥ .
Since H M ⊤ γ ^ 1 = γ 1 + Δ γ , n H_{M}^{\top}\hat{\gamma}_{1} = \gamma_{1} + \Delta_{\gamma,n} H M ⊤ γ ^ 1 = γ 1 + Δ γ , n , the row-space part is γ ^ 1 , ∥ = ( H M ⊤ ) † ( γ 1 + Δ γ , n ) \hat{\gamma}_{1,\parallel} = (H_{M}^{\top})^{\dagger}(\gamma_{1} + \Delta_{\gamma,n}) γ ^ 1 , ∥ = ( H M ⊤ ) † ( γ 1 + Δ γ , n ) . Hence, the whitening term splits as
γ ^ 1 ⊤ 1 q W M ⊤ u M = γ 1 ⊤ H M † 1 q W M ⊤ u M + Δ γ , n ⊤ H M † 1 q W M ⊤ u M + γ ^ 1 , ⊥ ⊤ 1 q W M ⊤ u M . (43) \hat{\gamma}_{1}^{\top}\frac{1}{q}W_{M}^{\top}u_{M} = \gamma_{1}^{\top}H_{M}^{\dagger}\frac{1}{q}W_{M}^{\top}u_{M} + \Delta_{\gamma,n}^{\top}H_{M}^{\dagger}\frac{1}{q}W_{M}^{\top}u_{M} + \hat{\gamma}_{1,\perp}^{\top}\frac{1}{q}W_{M}^{\top}u_{M}. \tag*{(43)} γ ^ 1 ⊤ q 1 W M ⊤ u M = γ 1 ⊤ H M † q 1 W M ⊤ u M + Δ γ , n ⊤ H M † q 1 W M ⊤ u M + γ ^ 1 , ⊥ ⊤ q 1 W M ⊤ u M . (43)
By Proposition 5.1, ∥ H M † ∥ o p = O p ( 1 ) \lVert H_{M}^{\dagger}\rVert_{\mathrm{op}} = O_{p}(1) ∥ H M † ∥ op = O p ( 1 ) , while 1 q W M ⊤ u M = O p ( q − 1 / 2 ) \frac{1}{q}W_{M}^{\top}u_{M} = O_{p}(q^{-1/2}) q 1 W M ⊤ u M = O p ( q − 1/2 ) . Therefore, the two row-space terms in (C.17) have orders O P ( q − 1 / 2 ) O_{P}(q^{-1/2}) O P ( q − 1/2 ) and O P ( ( n t q ) − 1 / 2 ) O_{P}((n_{t}q)^{-1/2}) O P (( n t q ) − 1/2 ) , respectively.
For the null-space term, Lemma C.7 gives ∥ γ ^ 1 , ⊥ ∥ = O p ( q / n t ) \lVert\hat{\gamma}_{1,\perp}\rVert= O_{p}(\sqrt{q/n_{t}}) ∥ γ ^ 1 , ⊥ ∥ = O p ( q / n t ) . Let G t \mathcal{G}_{t} G t denote the sigma-field generated by the training fold and the treated observations used in the first-stage regression. When we condition on G t \mathcal{G}_{t} G t , γ ^ 1 , ⊥ \hat{\gamma}_{1,\perp} γ ^ 1 , ⊥ and W M W_{M} W M are fixed, while the control proxy errors { u M , i : A i = 0 } \{u_{M,i}: A_{i}=0\} { u M , i : A i = 0 } are independent, mean zero, and independent of the treated sample. For a control observation, define h i = γ ^ 1 , ⊥ ⊤ 1 q W M ⊤ u M , i h_{i} = \hat{\gamma}_{1,\perp}^{\top}\frac{1}{q}W_{M}^{\top}u_{M,i} h i = γ ^ 1 , ⊥ ⊤ q 1 W M ⊤ u M , i . Using ∥ Σ u M ∥ o p ≤ C \lVert\Sigma_{u_{M}}\rVert_{\mathrm{op}} \le C ∥ Σ u M ∥ op ≤ C from Assumption 3.1(v) and W M ⊤ W M = q I q ~ W_{M}^{\top}W_{M} = qI_{\tilde{q}} W M ⊤ W M = q I q ~ , we obtain
Var ( h i ∣ G t ) = 1 q 2 γ ^ 1 , ⊥ ⊤ W M ⊤ Σ u M W M γ ^ 1 , ⊥ ≤ C q 2 ∥ W M γ ^ 1 , ⊥ ∥ 2 = C q ∥ γ ^ 1 , ⊥ ∥ 2 = O p ( 1 n t ) . (44) \operatorname{Var}(h_{i}\mid\mathcal{G}_{t}) = \frac{1}{q^{2}}\hat{\gamma}_{1,\perp}^{\top}W_{M}^{\top}\Sigma_{u_{M}}W_{M}\hat{\gamma}_{1,\perp} \le\frac{C}{q^{2}}\lVert W_{M}\hat{\gamma}_{1,\perp}\rVert^{2} = \frac{C}{q}\lVert\hat{\gamma}_{1,\perp}\rVert^{2} = O_{p}\left(\frac{1}{n_{t}}\right). \tag*{(44)} Var ( h i ∣ G t ) = q 2 1 γ ^ 1 , ⊥ ⊤ W M ⊤ Σ u M W M γ ^ 1 , ⊥ ≤ q 2 C ∥ W M γ ^ 1 , ⊥ ∥ 2 = q C ∥ γ ^ 1 , ⊥ ∥ 2 = O p ( n t 1 ) . (44)
Therefore, using the bounded second moments of the fixed-dimensional control factors and the independence of f X 1 , i f_{X1,i} f X 1 , i from u M , i u_{M,i} u M , i ,
E [ ∥ 1 n c ∑ i : A i = 0 f X 1 , i h i ∥ 2 | G t ] = E ∥ f X 1 , i ∥ 2 Var ( h i ∣ G t ) ≤ C Var ( h i ∣ G t ) = O p ( 1 n t ) . \mathbb{E}\left[\left\lVert\frac{1}{\sqrt{n_{c}}}\sum_{i:A_{i}=0}f_{X1,i}h_{i}\right\rVert^{2}\middle|\mathcal{G}_{t}\right] = \mathbb{E}\lVert f_{X1,i}\rVert^{2}\operatorname{Var}(h_{i}\mid\mathcal{G}_{t}) \le C\operatorname{Var}(h_{i}\mid\mathcal{G}_{t}) = O_{p}\left(\frac{1}{n_{t}}\right). E n c 1 i : A i = 0 ∑ f X 1 , i h i 2 G t = E ∥ f X 1 , i ∥ 2 Var ( h i ∣ G t ) ≤ C Var ( h i ∣ G t ) = O p ( n t 1 ) .
Conditional on G t \mathcal{G}_{t} G t , the summands are independent with mean zero, and h i h_{i} h i is independent of f X 1 , i f_{X1,i} f X 1 , i . Assumption 3.1(iii)–(iv), then gives us
1 n c ∑ i : A i = 0 f X 1 , i γ ^ 1 , ⊥ ⊤ 1 q W M ⊤ u M , i = O p ( 1 n t ) = o p ( 1 ) . (45) \frac{1}{\sqrt{n_{c}}}\sum_{i:A_{i}=0}f_{X1,i}\hat{\gamma}_{1,\perp}^{\top}\frac{1}{q}W_{M}^{\top}u_{M,i} = O_{p}\left(\frac{1}{\sqrt{n_{t}}}\right) = o_{p}(1). \tag*{(45)} n c 1 i : A i = 0 ∑ f X 1 , i γ ^ 1 , ⊥ ⊤ q 1 W M ⊤ u M , i = O p ( n t 1 ) = o p ( 1 ) . (45)
Since E ∥ e X , i ∥ 2 = O ( 1 / p ) \mathbb{E}\lVert e_{X,i}\rVert^{2} = O(1/p) E ∥ e X , i ∥ 2 = O ( 1/ p ) and u X , i u_{X,i} u X , i is independent of u M , i u_{M,i} u M , i by Assumption 3.1(ii), the e X , i h i e_{X,i}h_{i} e X , i h i are mean zero across the control units. Moreover, conditional on G t \mathcal{G}_{t} G t , we have that
E [ ∥ e X , i h i ∥ 2 ∣ G t ] = E ∥ e X , i ∥ 2 E [ h i 2 ∣ G t ] = O ( 1 p ) O p ( 1 n t ) = O p ( 1 p n t ) . \mathbb{E}\left[\lVert e_{X,i}h_{i}\rVert^{2}\mid\mathcal{G}_{t}\right] = \mathbb{E}\lVert e_{X,i}\rVert^{2}\mathbb{E}[h_{i}^{2}\mid\mathcal{G}_{t}] = O\left(\frac{1}{p}\right)O_{p}\left(\frac{1}{n_{t}}\right) = O_{p}\left(\frac{1}{pn_{t}}\right). E [ ∥ e X , i h i ∥ 2 ∣ G t ] = E ∥ e X , i ∥ 2 E [ h i 2 ∣ G t ] = O ( p 1 ) O p ( n t 1 ) = O p ( p n t 1 ) .
Therefore, we have
1 n c E X ⊤ ( 1 q U M W M γ ^ 1 , ⊥ ) = O p ( 1 p n t ) = o p ( 1 ) . (46) \frac{1}{\sqrt{n_{c}}}E_{X}^{\top}\left(\frac{1}{q}U_{M}W_{M}\hat{\gamma}_{1,\perp}\right) = O_{p}\left(\frac{1}{\sqrt{pn_{t}}}\right) = o_{p}(1). \tag*{(46)} n c 1 E X ⊤ ( q 1 U M W M γ ^ 1 , ⊥ ) = O p ( p n t 1 ) = o p ( 1 ) . (46)
Now, combining Equations (C.19) and (C.20) with the two row-space terms in Equation (C.17), the complete mediator-whitening contribution has order o P ( 1 ) o_{P}(1) o P ( 1 ) under the normalized contractions used in the second-stage regression. Lastly, substituting the mediator equation f M = δ 0 + B 0 f X + u X M , 0 f_{M} = \delta_{0} + B_{0}f_{X} + u_{XM,0} f M = δ 0 + B 0 f X + u X M , 0 into Equation (C.16), we obtain
b = γ 1 ⊤ δ 0 + Δ γ , n ⊤ δ 0 + γ 1 ⊤ B 0 f X + γ 1 ⊤ u X M , 0 + Δ γ , n ⊤ B 0 f X + Δ γ , n ⊤ u X M , 0 + γ ^ 1 , ⊥ ⊤ 1 q W M ⊤ u M , (47) b = \gamma_{1}^{\top}\delta_{0} + \Delta_{\gamma,n}^{\top}\delta_{0} + \gamma_{1}^{\top}B_{0}f_{X} + \gamma_{1}^{\top}u_{XM,0} + \Delta_{\gamma,n}^{\top}B_{0}f_{X} + \Delta_{\gamma,n}^{\top}u_{XM,0} + \hat{\gamma}_{1,\perp}^{\top}\frac{1}{q}W_{M}^{\top}u_{M}, \tag*{(47)} b = γ 1 ⊤ δ 0 + Δ γ , n ⊤ δ 0 + γ 1 ⊤ B 0 f X + γ 1 ⊤ u X M , 0 + Δ γ , n ⊤ B 0 f X + Δ γ , n ⊤ u X M , 0 + γ ^ 1 , ⊥ ⊤ q 1 W M ⊤ u M , (47)
where the last term is the whitening term shown above to be negligible.
Expansion of γ 1 ⊤ δ 0 \gamma_{1}^{\top}\delta_{0} γ 1 ⊤ δ 0 . With the bridge equation in hand, the expansion is as it was for α ^ 1 \hat{\alpha}_{1} α ^ 1 except that the term Δ γ , n ⊤ B 0 f X \Delta_{\gamma,n}^{\top}B_{0}f_{X} Δ γ , n ⊤ B 0 f X needs care. Since f ^ X , i = H X f X , i + e X , i \hat{f}_{X,i} = H_{X}f_{X,i} + e_{X,i} f ^ X , i = H X f X , i + e X , i , we have
Δ γ , n ⊤ B 0 f X , i = c ~ ⊤ R ~ i = Δ γ , n ⊤ B 0 H X † e X , i , c ~ = ( 0 , Δ γ , n ⊤ B 0 H X † ) ⊤ . \Delta_{\gamma,n}^{\top}B_{0}f_{X,i} = \tilde{c}^{\top}\tilde{R}_{i} = \Delta_{\gamma,n}^{\top}B_{0}H_{X}^{\dagger}e_{X,i}, \qquad\tilde{c} = (0,\Delta_{\gamma,n}^{\top}B_{0}H_{X}^{\dagger})^{\top}. Δ γ , n ⊤ B 0 f X , i = c ~ ⊤ R ~ i = Δ γ , n ⊤ B 0 H X † e X , i , c ~ = ( 0 , Δ γ , n ⊤ B 0 H X † ) ⊤ .
e n d s m i d = 1 {ends_mid=1} e n d s m i d = 1
Since c ~ \tilde{c} c ~ is constant across the control units with zero intercept, the least squares fits R ^ c ~ \widehat{R}\tilde{c} R c ~ exactly through the slope, and its contribution to the intercept is e 1 ⊤ c ~ = 0 e_1^{\top}\tilde{c}=0 e 1 ⊤ c ~ = 0 . We therefore omit it from b \mathbf{b} b , and collect the remaining noise in R n \mathcal{R}_n R n , whose i i i th entry is
( R n ) i = Δ γ , n ⊤ u X M , 0 , i − Δ γ , n ⊤ B 0 H X ⊤ e X i + γ ^ 1 ⊤ e M i . (\mathcal{R}_n)_i=\Delta_{\gamma,n}^{\top}\mathbf{u}_{XM,0,i}-\Delta_{\gamma,n}^{\top}\mathbf{B}_0\mathbf{H}_{X}^{\top}\mathbf{e}_{X_i}+\widehat{\gamma}_1^{\top}e_{M_i}. ( R n ) i = Δ γ , n ⊤ u X M , 0 , i − Δ γ , n ⊤ B 0 H X ⊤ e X i + γ 1 ⊤ e M i .
We estimate γ 1 ⊤ δ 0 \gamma_1^{\top}\delta_0 γ 1 ⊤ δ 0 by regressing b \mathbf{b} b on R ^ \widehat{\mathbf{R}} R over the control units, using the decomposition of Equation (C.21),
γ ^ 1 ⊤ δ ^ 0 = e 1 ⊤ ( R ^ ⊤ R ^ ) − 1 R ^ ⊤ b = e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ b = e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ ( R ϕ + Δ γ , n ⊤ δ 0 ⋅ 1 n c + η + R n ) = e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ ( R ^ ϕ + R ϕ − R ^ ϕ + Δ γ , n ⊤ δ 0 ⋅ 1 n c + η + R n ) = e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ R ^ ϕ + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ ( R − R ^ ) ϕ + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ ( Δ γ , n ⊤ δ 0 ⋅ 1 n c ) \begin{aligned}
\widehat{\gamma}_1^{\top}\widehat{\delta}_0=e_1^{\top}(\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}})^{-1}\widehat{\mathbf{R}}^{\top}\mathbf{b} \\
&=e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\mathbf{b} \\
&=e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\left(\mathbf{R}\phi+\Delta_{\gamma,n}^{\top}\delta_0\cdot\mathbf{1}_{n_c}+\eta+\mathcal{R}_n\right) \\
&=e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\left(\widehat{\mathbf{R}}\phi+\mathbf{R}\phi-\widehat{\mathbf{R}}\phi+\Delta_{\gamma,n}^{\top}\delta_0\cdot\mathbf{1}_{n_c}+\eta+\mathcal{R}_n\right) \\
&=e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\phi+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}(\mathbf{R}-\widehat{\mathbf{R}})\phi+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\left(\Delta_{\gamma,n}^{\top}\delta_0\cdot\mathbf{1}_{n_c}\right)
\end{aligned} γ 1 ⊤ δ 0 = e 1 ⊤ ( R ⊤ R ) − 1 R ⊤ b = e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ b = e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ ( R ϕ + Δ γ , n ⊤ δ 0 ⋅ 1 n c + η + R n ) = e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ ( R ϕ + R ϕ − R ϕ + Δ γ , n ⊤ δ 0 ⋅ 1 n c + η + R n ) = e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ R ϕ + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ ( R − R ) ϕ + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ ( Δ γ , n ⊤ δ 0 ⋅ 1 n c )
+ e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ η + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ R n . \qquad+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\eta+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\mathcal{R}_n. + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ η + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ R n .
The first term is ϕ 1 = γ 1 ⊤ δ 0 \phi_1=\gamma_1^{\top}\delta_0 ϕ 1 = γ 1 ⊤ δ 0 , since ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ R ^ = I \left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}=I ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ R = I . Since 1 n c = R ^ e 1 \mathbf{1}_{n_c}=\widehat{\mathbf{R}}e_1 1 n c = R e 1 , the third term simplifies exactly as Δ γ , n ⊤ δ 0 \Delta_{\gamma,n}^{\top}\delta_0 Δ γ , n ⊤ δ 0 , so a constant added to every response of a regression with an intercept column is absorbed entirely and exactly into the fitted intercept. Hence
γ ^ 1 ⊤ δ ^ 0 = γ 1 ⊤ δ 0 + Δ γ , n ⊤ δ 0 + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ ( R − R ^ ) ϕ \widehat{\gamma}_1^{\top}\widehat{\delta}_0=\gamma_1^{\top}\delta_0+\Delta_{\gamma,n}^{\top}\delta_0+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}(\mathbf{R}-\widehat{\mathbf{R}})\phi γ 1 ⊤ δ 0 = γ 1 ⊤ δ 0 + Δ γ , n ⊤ δ 0 + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ ( R − R ) ϕ
+ e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ η + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ R n = γ 1 ⊤ δ 0 + Δ γ , n ⊤ δ 0 − e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ E X 0 ϕ \begin{aligned}
\qquad+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\eta+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\mathcal{R}_n \\
&=\gamma_1^{\top}\delta_0+\Delta_{\gamma,n}^{\top}\delta_0-e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\mathbf{E}_{X0}\phi
\end{aligned} + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ η + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ R n = γ 1 ⊤ δ 0 + Δ γ , n ⊤ δ 0 − e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ E X 0 ϕ
+ e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ η + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c R ^ ⊤ R n , \qquad+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\eta+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\mathcal{R}_n, + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ η + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 R ⊤ R n ,
where the last equality uses R − R ^ = − E X 0 \mathbf{R}-\widehat{\mathbf{R}}=-\mathbf{E}_{X0} R − R = − E X 0 . Now, substituting R ^ ⊤ = R ⊤ + E X 0 ⊤ = H X 1 F X 1 ⊤ + E X 0 ⊤ \widehat{\mathbf{R}}^{\top}=\mathbf{R}^{\top}+\mathbf{E}_{X0}^{\top}=\mathbf{H}_{X1}\mathbf{F}_{X1}^{\top}+\mathbf{E}_{X0}^{\top} R ⊤ = R ⊤ + E X 0 ⊤ = H X 1 F X 1 ⊤ + E X 0 ⊤ exactly as for α ^ 1 \widehat{\alpha}_1 α 1 , and scaling by n c \sqrt{n_c} n c ,
n c ( γ ^ 1 ⊤ δ ^ 0 − γ 1 ⊤ δ 0 ) (48) \sqrt{n_c}\left(\widehat{\gamma}_1^{\top}\widehat{\delta}_0-\gamma_1^{\top}\delta_0\right) \tag*{(48)} n c ( γ 1 ⊤ δ 0 − γ 1 ⊤ δ 0 ) (48)
= n c Δ γ , n ⊤ δ 0 − e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 H X 1 1 n c F X 1 ⊤ E X 0 ϕ − e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c E X 0 ⊤ E X 0 ϕ + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 H X 1 1 n c F X 1 ⊤ η + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c E X 0 ⊤ η + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 H X 1 1 n c F X 1 ⊤ R n + e 1 ⊤ ( 1 n c R ^ ⊤ R ^ ) − 1 1 n c E X 0 ⊤ R n . \begin{aligned}
={}&\sqrt{n_c}\Delta_{\gamma,n}^{\top}\delta_0
-e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\mathbf{H}_{X1}\frac{1}{\sqrt{n_c}}\mathbf{F}_{X1}^{\top}\mathbf{E}_{X0}\phi
-e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{\sqrt{n_c}}\mathbf{E}_{X0}^{\top}\mathbf{E}_{X0}\phi\\
&+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\mathbf{H}_{X1}\frac{1}{\sqrt{n_c}}\mathbf{F}_{X1}^{\top}\eta
+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{\sqrt{n_c}}\mathbf{E}_{X0}^{\top}\eta\\
&+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\mathbf{H}_{X1}\frac{1}{\sqrt{n_c}}\mathbf{F}_{X1}^{\top}\mathcal{R}_n
+e_1^{\top}\left(\frac{1}{n_c}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}}\right)^{-1}\frac{1}{\sqrt{n_c}}\mathbf{E}_{X0}^{\top}\mathcal{R}_n.
\end{aligned} = n c Δ γ , n ⊤ δ 0 − e 1 ⊤ ( n c 1 R ⊤ R ) − 1 H X 1 n c 1 F X 1 ⊤ E X 0 ϕ − e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 E X 0 ⊤ E X 0 ϕ + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 H X 1 n c 1 F X 1 ⊤ η + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 E X 0 ⊤ η + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 H X 1 n c 1 F X 1 ⊤ R n + e 1 ⊤ ( n c 1 R ⊤ R ) − 1 n c 1 E X 0 ⊤ R n .
We write L 7 = n c Δ γ , n ⊤ δ 0 = n c δ 0 ⊤ ( H M γ ^ 1 − γ 1 ) L_7=\sqrt{n_c}\Delta_{\gamma,n}^{\top}\delta_0=\sqrt{n_c}\delta_0^{\top}(\mathbf{H}_{M}\widehat{\gamma}_1-\gamma_1) L 7 = n c Δ γ , n ⊤ δ 0 = n c δ 0 ⊤ ( H M γ 1 − γ 1 ) ,
n c ( γ ^ 1 ⊤ δ ^ 0 − γ 1 ⊤ δ 0 ) = L 7 − L 1 − L 2 + L 3 + L 4 + L 5 + L 6 . \sqrt{n_c}\left(\widehat{\gamma}_1^{\top}\widehat{\delta}_0-\gamma_1^{\top}\delta_0\right)=L_7-L_1-L_2+L_3+L_4+L_5+L_6. n c ( γ 1 ⊤ δ 0 − γ 1 ⊤ δ 0 ) = L 7 − L 1 − L 2 + L 3 + L 4 + L 5 + L 6 .
The terms L 1 , … , L 4 L_1,\ldots,L_4 L 1 , … , L 4 are the analogues of G 1 , … , G 4 G_1,\ldots,G_4 G 1 , … , G 4 under
( Z , H 1 , δ , ϵ 1 , F 1 , E 0 , p ∧ q ) ↦ ( R , H X 1 , ϕ , η , F X 1 , E X 0 , p ) , (\mathbf{Z},\mathbf{H}_1,\delta,\epsilon_1,\mathbf{F}_1,\mathbf{E}_0,p\wedge q)\mapsto(\mathbf{R},\mathbf{H}_{X1},\phi,\eta,\mathbf{F}_{X1},\mathbf{E}_{X0},p), ( Z , H 1 , δ , ϵ 1 , F 1 , E 0 , p ∧ q ) ↦ ( R , H X 1 , ϕ , η , F X 1 , E X 0 , p ) ,
the terms L 5 L_5 L 5 , L 6 L_6 L 6 come from the remainder R n \mathcal{R}_n R n , and L 7 L_7 L 7 is the first-order cost of estimating γ 1 \gamma_1 γ 1 .
Part 2: Asymptotic Negligibility of the Bias Terms.
We prove that G 1 , G 2 , G 4 , L 1 , L 2 , L 4 , L 5 , L 6 G_1,G_2,G_4,L_1,L_2,L_4,L_5,L_6 G 1 , G 2 , G 4 , L 1 , L 2 , L 4 , L 5 , L 6 are each o p ( 1 ) o_p(1) o p ( 1 ) , and that L 7 = n c / n t δ 0 ⊤ J 3 + o p ( 1 ) L_7 = \sqrt{n_c/n_t}\delta_0^\top J_3 + o_p(1) L 7 = n c / n t δ 0 ⊤ J 3 + o p ( 1 ) . Throughout, M = 1 n t Z ^ ⊤ Z ^ M = \frac{1}{n_t}\widehat{Z}^{\top}\widehat{Z} M = n t 1 Z ⊤ Z denotes the treated Gram matrix and M ~ = 1 n c R ^ ⊤ R ^ \widetilde{M} = \frac{1}{n_c}\widehat{R}^{\top}\widehat{R} M = n c 1 R ⊤ R the control Gram matrix, and every operator-norm bound is conditional on the training fold on which the whitening matrices are fixed, so that the rows of E 0 E_0 E 0 and E X 0 E_{X_0} E X 0 are independent within each stratum. Since n k t ≍ n k c ≍ n k ≍ n n_k^t \asymp n_k^c \asymp n_k \asymp n n k t ≍ n k c ≍ n k ≍ n , every rate written in n k t n_k^t n k t or n k c n_k^c n k c is order equivalent to the corresponding rate in n n n . Here, the bias terms fall into two structural patterns. The two-sided terms G 1 G_1 G 1 and L 1 L_1 L 1 carry a loading matrix on both sides of the Gram inverse, while the one-sided terms G 2 G_2 G 2 , G 4 G_4 G 4 , L 2 L_2 L 2 , and L 4 L_4 L 4 carry a loading matrix only on the left. We record the two block inverse identities used below.
(BI-1) Two-sided identity. Since J = [ U S ] J=[U\ S] J = [ U S ] is orthogonal, M − 1 = J ( J ⊤ M J ) − 1 J ⊤ M^{-1}=J(J^\top M J)^{-1}J^\top M − 1 = J ( J ⊤ M J ) − 1 J ⊤ , and from J ⊤ H 1 = ( R 0 ) J^\top H_1=\begin{pmatrix}R\\0\end{pmatrix} J ⊤ H 1 = ( R 0 ) and H 1 ⊤ J = ( R ⊤ 0 ) H_1^\top J=(R^\top\ 0) H 1 ⊤ J = ( R ⊤ 0 ) ,
H 1 ⊤ M − 1 H 1 = ( R ⊤ 0 ) ( J ⊤ M J ) − 1 ( R 0 ) = R ⊤ [ ( J ⊤ M J ) − 1 ] 11 R = R ⊤ ( D + E n ) − 1 R , (49) H_1^\top M^{-1}H_1=(R^\top\ 0)(J^\top M J)^{-1}\begin{pmatrix}R\\0\end{pmatrix}
=R^\top\left[(J^\top M J)^{-1}\right]_{11}R
=R^\top(D+E_n)^{-1}R, \tag*{(49)} H 1 ⊤ M − 1 H 1 = ( R ⊤ 0 ) ( J ⊤ M J ) − 1 ( R 0 ) = R ⊤ [ ( J ⊤ M J ) − 1 ] 11 R = R ⊤ ( D + E n ) − 1 R , (49)
where ( D + E n ) − 1 (D+E_n)^{-1} ( D + E n ) − 1 is the upper-left block of the inverse from the Schur complement of D + E n D+E_n D + E n . With ∥ R ∥ op = O ( 1 ) \lVert R\rVert_{\operatorname{op}}=O(1) ∥ R ∥ op = O ( 1 ) and ∥ ( D + E n ) − 1 ∥ op = O p ( 1 ) \lVert(D+E_n)^{-1}\rVert_{\operatorname{op}}=O_p(1) ∥( D + E n ) − 1 ∥ op = O p ( 1 ) from Lemma C.5,
∥ H 1 ⊤ M − 1 H 1 ∥ op ≤ ∥ R ∥ op 2 ∥ ( D + E n ) − 1 ∥ op = O p ( 1 ) . (50) \lVert H_1^\top M^{-1}H_1\rVert_{\operatorname{op}}\leq\lVert R\rVert_{\operatorname{op}}^2\lVert(D+E_n)^{-1}\rVert_{\operatorname{op}}=O_p(1). \tag*{(50)} ∥ H 1 ⊤ M − 1 H 1 ∥ op ≤ ∥ R ∥ op 2 ∥( D + E n ) − 1 ∥ op = O p ( 1 ) . (50)
(BI-2) One-sided identity. For the one-sided pattern we need the full first block-row of ( J ⊤ M J ) − 1 (J^\top M J)^{-1} ( J ⊤ M J ) − 1 . We write the partitioned matrix as follows:
J ⊤ M J = ( K 11 K 12 K 21 K 22 ) , J^\top M J=
\begin{pmatrix}
K_{11} & K_{12}\\
K_{21} & K_{22}
\end{pmatrix}, J ⊤ M J = ( K 11 K 21 K 12 K 22 ) ,
the standard block-inverse formula gives, for the first block-row,
[ ( J ⊤ M J ) − 1 ] 1 ∗ = ( ( D + E n ) − 1 , − ( D + E n ) − 1 K 12 K 22 − 1 ) , \left[(J^\top M J)^{-1}\right]_{1*}
=\left((D+E_n)^{-1},\;-(D+E_n)^{-1}K_{12}K_{22}^{-1}\right), [ ( J ⊤ M J ) − 1 ] 1 ∗ = ( ( D + E n ) − 1 , − ( D + E n ) − 1 K 12 K 22 − 1 ) ,
where D + E n = K 11 − K 12 K 22 − 1 K 21 D+E_n=K_{11}-K_{12}K_{22}^{-1}K_{21} D + E n = K 11 − K 12 K 22 − 1 K 21 . Therefore, using H 1 ⊤ J = ( R ⊤ 0 ) H_1^\top J=(R^\top\ 0) H 1 ⊤ J = ( R ⊤ 0 ) ,
H 1 ⊤ M − 1 = ( R ⊤ 0 ) ( J ⊤ M J ) − 1 J ⊤ = R ⊤ ( D + E n ) − 1 ( I , − K 12 K 22 − 1 ) J ⊤ = R ⊤ ( D + E n ) − 1 [ U ⊤ − K 12 K 22 − 1 S ⊤ ] . (51) \begin{aligned}
H_1^\top M^{-1}
&=(R^\top\ 0)(J^\top M J)^{-1}J^\top\\
&=R^\top(D+E_n)^{-1}(I,\,-K_{12}K_{22}^{-1})J^\top\\
&=R^\top(D+E_n)^{-1}[U^\top-K_{12}K_{22}^{-1}S^\top]. \tag*{(51)}
\end{aligned} H 1 ⊤ M − 1 = ( R ⊤ 0 ) ( J ⊤ M J ) − 1 J ⊤ = R ⊤ ( D + E n ) − 1 ( I , − K 12 K 22 − 1 ) J ⊤ = R ⊤ ( D + E n ) − 1 [ U ⊤ − K 12 K 22 − 1 S ⊤ ] . (51)
Now, substituting the blocks K 12 = 1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) E 0 S K_{12}=\frac{1}{n_t}(RF_1^\top+U^\top E_0^\top)E_0S K 12 = n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) E 0 S and K 22 = 1 n t S ⊤ E 0 ⊤ E 0 S K_{22}=\frac{1}{n_t}S^\top E_0^\top E_0S K 22 = n t 1 S ⊤ E 0 ⊤ E 0 S , we get that
H 1 ⊤ M − 1 = R ⊤ ( D + E n ) − 1 [ U ⊤ − ( 1 n t R F 1 ⊤ E 0 S + 1 n t U ⊤ E 0 ⊤ E 0 S ) ( 1 n t S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ ] . (52) H_1^\top M^{-1}
=R^\top(D+E_n)^{-1}\left[U^\top-\left(\frac{1}{n_t}RF_1^\top E_0S+\frac{1}{n_t}U^\top E_0^\top E_0S\right)\left(\frac{1}{n_t}S^\top E_0^\top E_0S\right)^{-1}S^\top\right]. \tag*{(52)} H 1 ⊤ M − 1 = R ⊤ ( D + E n ) − 1 [ U ⊤ − ( n t 1 R F 1 ⊤ E 0 S + n t 1 U ⊤ E 0 ⊤ E 0 S ) ( n t 1 S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ ] . (52)
The two S S S -dependent factors combine into the projection P S P_S P S , so for any conformable vector w w w ,
( 1 n t R F 1 ⊤ E 0 S + 1 n t U ⊤ E 0 ⊤ E 0 S ) ( 1 n t S ⊤ E 0 ⊤ E 0 S ) − 1 1 n t S ⊤ E 0 ⊤ w = 1 n t ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) P S w , (53) \left(\frac{1}{n_t}RF_1^\top E_0S+\frac{1}{n_t}U^\top E_0^\top E_0S\right)\left(\frac{1}{n_t}S^\top E_0^\top E_0S\right)^{-1}\frac{1}{\sqrt{n_t}}S^\top E_0^\top w
=\frac{1}{\sqrt{n_t}}(RF_1^\top+U^\top E_0^\top)P_Sw, \tag*{(53)} ( n t 1 R F 1 ⊤ E 0 S + n t 1 U ⊤ E 0 ⊤ E 0 S ) ( n t 1 S ⊤ E 0 ⊤ E 0 S ) − 1 n t 1 S ⊤ E 0 ⊤ w = n t 1 ( R F 1 ⊤ + U ⊤ E 0 ⊤ ) P S w , (53)
because E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ = P S E_0S(S^\top E_0^\top E_0S)^{-1}S^\top E_0^\top=P_S E 0 S ( S ⊤ E 0 ⊤ E 0 S ) − 1 S ⊤ E 0 ⊤ = P S and the factors of n t n_t n t cancel. Both identities have exact analogues on the control side, with ( H X 1 , U ~ , R ~ , S ~ , M ~ , F X 1 , E X 0 , P ~ S , D ~ + E ~ n , n c ) (H_{X_1},\widetilde{U},\widetilde{R},\widetilde{S},\widetilde{M},F_{X_1},E_{X_0},\widetilde{P}_S,\widetilde{D}+\widetilde{E}_n,n_c) ( H X 1 , U , R , S , M , F X 1 , E X 0 , P S , D + E n , n c ) in place of ( H 1 , U , R , S , M , F 1 , E 0 , P S , D + E n , n t ) (H_1,U,R,S,M,F_1,E_0,P_S,D+E_n,n_t) ( H 1 , U , R , S , M , F 1 , E 0 , P S , D + E n , n t ) .
Terms from α ^ 1 \widehat{\alpha}_1 α 1 (treated units).
G 1 = o p ( 1 ) ‾ \underline{G_1=o_p(1)} G 1 = o p ( 1 ) . Let v = 1 n t F 1 ⊤ E 0 δ v=\frac{1}{\sqrt{n_t}}F_1^\top E_0\delta v = n t 1 F 1 ⊤ E 0 δ . Since the first column of H 1 = diag ( 1 , H X , H M ) H_1=\operatorname{diag}(1,H_X,H_M) H 1 = diag ( 1 , H X , H M ) is e 1 e_1 e 1 , we have e 1 ∈ Col ( H 1 ) = Col ( U ) e_1\in\operatorname{Col}(H_1)=\operatorname{Col}(U) e 1 ∈ Col ( H 1 ) = Col ( U ) . Thus, e 1 ⊤ S = 0 e_1^\top S=0 e 1 ⊤ S = 0 . Writing a ⊤ = e 1 ⊤ U a^\top=e_1^\top U a ⊤ = e 1 ⊤ U and using M − 1 = J ( J ⊤ M J ) − 1 J ⊤ M^{-1}=J(J^\top M J)^{-1}J^\top M − 1 = J ( J ⊤ M J ) − 1 J ⊤ , we obtain
G 1 = e 1 ⊤ M − 1 H 1 v = ( a ⊤ , 0 ) ( J ⊤ M J ) − 1 ( R 0 ) v = a ⊤ ( D + E n ) − 1 R v . G_1=e_1^\top M^{-1}H_1v=(a^\top,0)(J^\top M J)^{-1}\begin{pmatrix}R\\0\end{pmatrix}v=a^\top(D+E_n)^{-1}Rv. G 1 = e 1 ⊤ M − 1 H 1 v = ( a ⊤ , 0 ) ( J ⊤ M J ) − 1 ( R 0 ) v = a ⊤ ( D + E n ) − 1 R v .
It remains to bound ∥ v ∥ \lVert v\rVert ∥ v ∥ . By Lemma C.2(ii) and ∥ δ ∥ = O p ( 1 ) \lVert\delta\rVert=O_p(1) ∥ δ ∥ = O p ( 1 ) , we have
∥ v ∥ = ∥ 1 n t F 1 T E 0 δ ∥ ≤ ∥ 1 n t F 1 T E 0 ∥ o p ∥ δ ∥ = O p ( ( p ∧ q ) − 1 / 2 ) . \lVert v\rVert=\left\lVert\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf{T}}\mathbf{E}_0\delta\right\rVert\leq\left\lVert\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf{T}}\mathbf{E}_0\right\rVert_{\mathrm{op}}\lVert\delta\rVert=O_p\left((p\wedge q)^{-1/2}\right). ∥ v ∥ = n t 1 F 1 T E 0 δ ≤ n t 1 F 1 T E 0 op ∥ δ ∥ = O p ( ( p ∧ q ) − 1/2 ) .
Now, combining this with ∥ a ∥ ≤ 1 \lVert a\rVert\leq1 ∥ a ∥ ≤ 1 , ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) \lVert(D+E_n)^{-1}\rVert_{\mathrm{op}}=O_p(1) ∥( D + E n ) − 1 ∥ op = O p ( 1 ) , and ∥ R ∥ o p = O ( 1 ) \lVert R\rVert_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) , we have
∣ G 1 ∣ ≤ ∥ a ∥ ∥ ( D + E n ) − 1 ∥ o p ∥ R ∥ o p ∥ v ∥ = O p ( ( p ∧ q ) − 1 / 2 ) = o p ( 1 ) , \lvert G_1\rvert\leq\lVert a\rVert\lVert(D+E_n)^{-1}\rVert_{\mathrm{op}}\lVert R\rVert_{\mathrm{op}}\lVert v\rVert=O_p\left((p\wedge q)^{-1/2}\right)=o_p(1), ∣ G 1 ∣ ≤ ∥ a ∥ ∥( D + E n ) − 1 ∥ op ∥ R ∥ op ∥ v ∥ = O p ( ( p ∧ q ) − 1/2 ) = o p ( 1 ) ,
as p ∧ q → ∞ p\wedge q\to\infty p ∧ q → ∞ .
G 2 = o p ( 1 ) G_2=o_p(1) G 2 = o p ( 1 ) . By definition, G 2 = e 1 T M − 1 1 n t E 0 δ G_2=e_1^{\mathsf{T}}M^{-1}\frac{1}{\sqrt{n_t}}\mathbf{E}_0\delta G 2 = e 1 T M − 1 n t 1 E 0 δ . Using the block-inverse identity and (C.27) with w = E 0 δ w=\mathbf{E}_0\delta w = E 0 δ , together with e 1 T S = 0 e_1^{\mathsf{T}}S=0 e 1 T S = 0 , we obtain
G 2 = a T ( D + E n ) − 1 [ 1 n t U T E 0 T ( I − P S ) E 0 δ ⏟ = : G 2 , 1 − 1 n t R F 1 T P S E 0 δ ⏟ = : G 2 , 2 ] . (54) G_2=a^{\mathsf{T}}(D+E_n)^{-1}\left[\underbrace{\frac{1}{\sqrt{n_t}}U^{\mathsf{T}}\mathbf{E}_0^{\mathsf{T}}(I-P_S)\mathbf{E}_0\delta}_{=:G_{2,1}}-\underbrace{\frac{1}{\sqrt{n_t}}R\mathbf{F}_1^{\mathsf{T}}P_S\mathbf{E}_0\delta}_{=:G_{2,2}}\right]. \tag*{(54)} G 2 = a T ( D + E n ) − 1 =: G 2 , 1 n t 1 U T E 0 T ( I − P S ) E 0 δ − =: G 2 , 2 n t 1 R F 1 T P S E 0 δ . (54)
Since ∥ a ∥ ≤ 1 \lVert a\rVert\leq1 ∥ a ∥ ≤ 1 and ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) \lVert(D+E_n)^{-1}\rVert_{\mathrm{op}}=O_p(1) ∥( D + E n ) − 1 ∥ op = O p ( 1 ) , it suffices to bound ∥ G 2 , 1 ∥ \lVert G_{2,1}\rVert ∥ G 2 , 1 ∥ and ∥ G 2 , 2 ∥ \lVert G_{2,2}\rVert ∥ G 2 , 2 ∥ . For G 2 , 1 G_{2,1} G 2 , 1 , using ∥ U ∥ o p = 1 \lVert U\rVert_{\mathrm{op}}=1 ∥ U ∥ op = 1 , ∥ I − P S ∥ o p ≤ 1 \lVert I-P_S\rVert_{\mathrm{op}}\leq1 ∥ I − P S ∥ op ≤ 1 , and Lemma C.2(i), (iii), we have
∥ G 2 , 1 ∥ ≤ 1 n t ∥ E 0 T ( I − P S ) E 0 ∥ o p ∥ δ ∥ ≤ n t ∥ 1 n t E 0 T E 0 ∥ o p ∥ δ ∥ = O p ( n t p ∧ q ) . (55) \lVert G_{2,1}\rVert\leq\frac{1}{\sqrt{n_t}}\lVert\mathbf{E}_0^{\mathsf{T}}(I-P_S)\mathbf{E}_0\rVert_{\mathrm{op}}\lVert\delta\rVert\leq\sqrt{n_t}\left\lVert\frac{1}{n_t}\mathbf{E}_0^{\mathsf{T}}\mathbf{E}_0\right\rVert_{\mathrm{op}}\lVert\delta\rVert=O_p\left(\sqrt{\frac{n_t}{p\wedge q}}\right). \tag*{(55)} ∥ G 2 , 1 ∥ ≤ n t 1 ∥ E 0 T ( I − P S ) E 0 ∥ op ∥ δ ∥ ≤ n t n t 1 E 0 T E 0 op ∥ δ ∥ = O p ( p ∧ q n t ) . (55)
For G 2 , 2 G_{2,2} G 2 , 2 , we use ∥ R ∥ o p = O ( 1 ) \lVert R\rVert_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) , ∥ P S ∥ o p ≤ 1 \lVert P_S\rVert_{\mathrm{op}}\leq1 ∥ P S ∥ op ≤ 1 , and ∥ 1 n t F 1 T ∥ o p = O p ( 1 ) \left\lVert\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf{T}}\right\rVert_{\mathrm{op}}=O_p(1) n t 1 F 1 T op = O p ( 1 ) by Assumption 3.1(iii)–(iv). Moreover,
∥ E 0 δ ∥ ≤ ∥ E 0 T E 0 ∥ o p 1 / 2 ∥ δ ∥ = n t ∥ 1 n t E 0 T E 0 ∥ o p 1 / 2 ∥ δ ∥ = O p ( n t p ∧ q ) . \lVert\mathbf{E}_0\delta\rVert\leq\lVert\mathbf{E}_0^{\mathsf{T}}\mathbf{E}_0\rVert_{\mathrm{op}}^{1/2}\lVert\delta\rVert=\sqrt{n_t}\left\lVert\frac{1}{n_t}\mathbf{E}_0^{\mathsf{T}}\mathbf{E}_0\right\rVert_{\mathrm{op}}^{1/2}\lVert\delta\rVert=O_p\left(\sqrt{\frac{n_t}{p\wedge q}}\right). ∥ E 0 δ ∥ ≤ ∥ E 0 T E 0 ∥ op 1/2 ∥ δ ∥ = n t n t 1 E 0 T E 0 op 1/2 ∥ δ ∥ = O p ( p ∧ q n t ) .
Therefore, we have
∥ G 2 , 2 ∥ ≤ ∥ R ∥ o p ∥ 1 n t F 1 T ∥ o p ∥ P S ∥ o p ∥ E 0 δ ∥ = O p ( n t p ∧ q ) . (56) \lVert G_{2,2}\rVert\leq\lVert R\rVert_{\mathrm{op}}\left\lVert\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\mathsf{T}}\right\rVert_{\mathrm{op}}\lVert P_S\rVert_{\mathrm{op}}\lVert\mathbf{E}_0\delta\rVert=O_p\left(\sqrt{\frac{n_t}{p\wedge q}}\right). \tag*{(56)} ∥ G 2 , 2 ∥ ≤ ∥ R ∥ op n t 1 F 1 T op ∥ P S ∥ op ∥ E 0 δ ∥ = O p ( p ∧ q n t ) . (56)
Now, combining Equations (C.29) and (C.30), the second rate dominates as p ∧ q → ∞ p\wedge q\to\infty p ∧ q → ∞ . Hence, we get
∣ G 2 ∣ = O p ( n t p ∧ q + n t p ∧ q ) = O p ( n t p ∧ q ) = o p ( 1 ) , \lvert G_2\rvert=O_p\left(\sqrt{\frac{n_t}{p\wedge q}}+\sqrt{\frac{n_t}{p\wedge q}}\right)=O_p\left(\sqrt{\frac{n_t}{p\wedge q}}\right)=o_p(1), ∣ G 2 ∣ = O p ( p ∧ q n t + p ∧ q n t ) = O p ( p ∧ q n t ) = o p ( 1 ) ,
since n t / ( p ∧ q ) → 0 n_t/(p\wedge q)\to0 n t / ( p ∧ q ) → 0 .
G 4 = o p ( 1 ) G_4=o_p(1) G 4 = o p ( 1 ) . By definition, we have G 4 = e 1 T H 1 T M − 1 1 n t E 0 T ϵ 1 G_4=e_1^{\mathsf{T}}H_1^{\mathsf{T}}M^{-1}\frac{1}{\sqrt{n_t}}\mathbf{E}_0^{\mathsf{T}}\epsilon_1 G 4 = e 1 T H 1 T M − 1 n t 1 E 0 T ϵ 1 . Applying the one-sided identity (C.26) and using Equation (C.27) with w = ϵ 1 w=\epsilon_1 w = ϵ 1 , we obtain
G 4 = e 1 T R T ( D + E n ) − 1 [ 1 n t U T E 0 T ( I − P S ) ϵ 1 ⏟ = : G 4 , 1 − 1 n t R F 1 T P S ϵ 1 ⏟ = : G 4 , 2 ] . (57) G_4=e_1^{\mathsf{T}}R^{\mathsf{T}}(D+E_n)^{-1}\left[\underbrace{\frac{1}{\sqrt{n_t}}U^{\mathsf{T}}\mathbf{E}_0^{\mathsf{T}}(I-P_S)\epsilon_1}_{=:G_{4,1}}-\underbrace{\frac{1}{\sqrt{n_t}}R\mathbf{F}_1^{\mathsf{T}}P_S\epsilon_1}_{=:G_{4,2}}\right]. \tag*{(57)} G 4 = e 1 T R T ( D + E n ) − 1 =: G 4 , 1 n t 1 U T E 0 T ( I − P S ) ϵ 1 − =: G 4 , 2 n t 1 R F 1 T P S ϵ 1 . (57)
The outside factor is O p ( 1 ) O_p(1) O p ( 1 ) as shown before. By Assumption 3.1(i)–(ii), conditional on the training fold, ϵ 1 \epsilon_1 ϵ 1 is independent of ( F 1 , E 0 ) (\mathbf{F}_1,\mathbf{E}_0) ( F 1 , E 0 ) and has mean zero. Moreover, Assumption 5.1(i) gives E ( ϵ 1 ϵ 1 T ∣ F 1 , E 0 ) ⪯ C I n t \mathbb{E}(\epsilon_1\epsilon_1^{\mathsf{T}}\mid\mathbf{F}_1,\mathbf{E}_0)\preceq C I_{n_t} E ( ϵ 1 ϵ 1 T ∣ F 1 , E 0 ) ⪯ C I n t , where the training fold is held fixed throughout.
For G 4 , 1 G_{4,1} G 4 , 1 , since I − P S I-P_S I − P S is an orthogonal projection, we have
E [ ∥ G 4 , 1 ∥ 2 ∣ F 1 , E 0 ] ≤ C n t tr ( U T E 0 T ( I − P S ) E 0 U ) ≤ C n t tr ( U T E 0 T E 0 U ) = O p ( 1 p ∧ q ) . (58) \mathbb{E}\left[\lVert G_{4,1}\rVert^2\mid\mathbf{F}_1,\mathbf{E}_0\right]\leq\frac{C}{n_t}\operatorname{tr}\left(U^{\mathsf{T}}\mathbf{E}_0^{\mathsf{T}}(I-P_S)\mathbf{E}_0U\right)\leq\frac{C}{n_t}\operatorname{tr}\left(U^{\mathsf{T}}\mathbf{E}_0^{\mathsf{T}}\mathbf{E}_0U\right)=O_p\left(\frac{1}{p\wedge q}\right). \tag*{(58)} E [ ∥ G 4 , 1 ∥ 2 ∣ F 1 , E 0 ] ≤ n t C tr ( U T E 0 T ( I − P S ) E 0 U ) ≤ n t C tr ( U T E 0 T E 0 U ) = O p ( p ∧ q 1 ) . (58)
where the last bound follows from Lemma C.2(i) and the fixed projected dimension. Therefore, ∥ G 4 , 1 ∥ = O p ( ( p ∧ q ) − 1 / 2 ) \lVert G_{4,1}\rVert=O_p((p\wedge q)^{-1/2}) ∥ G 4 , 1 ∥ = O p (( p ∧ q ) − 1/2 ) . For G 4 , 2 G_{4,2} G 4 , 2 , we first decompose F 1 = 1 μ F T + F ~ 1 \mathbf{F}_1=\mathbf{1}\mu_F^{\mathsf{T}}+\widetilde{\mathbf{F}}_1 F 1 = 1 μ F T + F 1 into mean and centered parts, so
1 n t R F 1 T P S ϵ 1 = 1 n t R μ F 1 T P S ϵ 1 + 1 n t R F ~ 1 T P S ϵ 1 . \frac{1}{\sqrt{n_t}}R\mathbf{F}_1^{\mathsf{T}}P_S\epsilon_1=\frac{1}{\sqrt{n_t}}R\mu_F\mathbf{1}^{\mathsf{T}}P_S\epsilon_1+\frac{1}{\sqrt{n_t}}R\widetilde{\mathbf{F}}_1^{\mathsf{T}}P_S\epsilon_1. n t 1 R F 1 T P S ϵ 1 = n t 1 R μ F 1 T P S ϵ 1 + n t 1 R F 1 T P S ϵ 1 .
For the mean part, using the conditional mean-zero property and bounded variance of ϵ 1 \epsilon_1 ϵ 1 , we have
E [ ( 1 T P S ϵ 1 ) 2 ∣ F 1 , E 0 ] ≤ C 1 T P S 2 1 = C 1 T P S 1 = O p ( 1 ) . (59) \mathbb{E}\left[\left(\mathbf{1}^{\mathsf{T}}P_S\epsilon_1\right)^2\mid\mathbf{F}_1,\mathbf{E}_0\right]\leq C\mathbf{1}^{\mathsf{T}}P_S^2\mathbf{1}=C\mathbf{1}^{\mathsf{T}}P_S\mathbf{1}=O_p(1). \tag*{(59)} E [ ( 1 T P S ϵ 1 ) 2 ∣ F 1 , E 0 ] ≤ C 1 T P S 2 1 = C 1 T P S 1 = O p ( 1 ) . (59)
where the last equality follows from Lemma C.3 and P S 2 = P S P_{S}^{2}=P_{S} P S 2 = P S . Hence, 1 ⊤ P S ϵ 1 = O p ( 1 ) 1^{\top}P_{S}\epsilon_{1}=O_{p}(1) 1 ⊤ P S ϵ 1 = O p ( 1 ) . Since ∥ R ∥ o p = O ( 1 ) \lVert R\rVert_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) and ∥ μ F ∥ 2 = O ( 1 ) \lVert\mu_{F}\rVert_{2}=O(1) ∥ μ F ∥ 2 = O ( 1 ) by Assumption 3.1(iii),
∥ 1 n t R μ F 1 ⊤ P S ϵ 1 ∥ ≤ 1 n t ∥ R ∥ o p ∥ μ F ∥ 2 ∣ 1 ⊤ P S ϵ 1 ∣ = O p ( n t − 1 / 2 ) . (60) \left\lVert\frac{1}{\sqrt{n_{t}}}R\mu_{F}1^{\top}P_{S}\epsilon_{1}\right\rVert\leq\frac{1}{\sqrt{n_{t}}}\lVert R\rVert_{\mathrm{op}}\lVert\mu_{F}\rVert_{2}\lvert1^{\top}P_{S}\epsilon_{1}\rvert=O_{p}(n_{t}^{-1/2}). \tag*{(60)} n t 1 R μ F 1 ⊤ P S ϵ 1 ≤ n t 1 ∥ R ∥ op ∥ μ F ∥ 2 ∣ 1 ⊤ P S ϵ 1 ∣ = O p ( n t − 1/2 ) . (60)
For the centered part, conditional on ( F ~ 1 , E 0 ) (\widetilde{F}_{1},E_{0}) ( F 1 , E 0 ) , we have
E [ ∥ 1 n t R F ~ 1 ⊤ P S ϵ 1 ∥ 2 ∣ F ~ 1 , E 0 ] = 1 n t tr ( R F ~ 1 ⊤ P S E ( ϵ 1 ϵ 1 ⊤ ∣ F ~ 1 , E 0 ) P S F ~ 1 R ⊤ ) ≤ c n n t ∥ R ∥ o p 2 tr ( F ~ 1 ⊤ P S F ~ 1 ) = O p ( n t − 1 ) , (61) \mathbb{E}\left[\left.\left\lVert\frac{1}{\sqrt{n_{t}}}R\widetilde{F}_{1}^{\top}P_{S}\epsilon_{1}\right\rVert^{2}\right|\widetilde{F}_{1},E_{0}\right]=\frac{1}{n_{t}}\operatorname{tr}\left(R\widetilde{F}_{1}^{\top}P_{S}\mathbb{E}(\epsilon_{1}\epsilon_{1}^{\top}\mid\widetilde{F}_{1},E_{0})P_{S}\widetilde{F}_{1}R^{\top}\right)\leq\frac{c_{n}}{n_{t}}\lVert R\rVert_{\mathrm{op}}^{2}\operatorname{tr}\left(\widetilde{F}_{1}^{\top}P_{S}\widetilde{F}_{1}\right)=O_{p}(n_{t}^{-1}), \tag*{(61)} E [ n t 1 R F 1 ⊤ P S ϵ 1 2 F 1 , E 0 ] = n t 1 tr ( R F 1 ⊤ P S E ( ϵ 1 ϵ 1 ⊤ ∣ F 1 , E 0 ) P S F 1 R ⊤ ) ≤ n t c n ∥ R ∥ op 2 tr ( F 1 ⊤ P S F 1 ) = O p ( n t − 1 ) , (61)
where tr ( F ~ 1 ⊤ P S F ~ 1 ) = O p ( 1 ) \operatorname{tr}(\widetilde{F}_{1}^{\top}P_{S}\widetilde{F}_{1})=O_{p}(1) tr ( F 1 ⊤ P S F 1 ) = O p ( 1 ) by Lemma C.4. Thus, ∥ 1 n t R F ~ 1 ⊤ P S ϵ 1 ∥ = O p ( n t − 1 / 2 ) \left\lVert\frac{1}{\sqrt{n_{t}}}R\widetilde{F}_{1}^{\top}P_{S}\epsilon_{1}\right\rVert=O_{p}(n_{t}^{-1/2}) n t 1 R F 1 ⊤ P S ϵ 1 = O p ( n t − 1/2 ) . Now, combining the mean and centered parts, ∥ G 4 , 2 ∥ = O p ( n t − 1 / 2 ) \lVert G_{4,2}\rVert=O_{p}(n_{t}^{-1/2}) ∥ G 4 , 2 ∥ = O p ( n t − 1/2 ) . Together with Equation (C.32) and the O p ( 1 ) O_{p}(1) O p ( 1 ) outside factor, we obtain
∣ G 4 ∣ = O p ( 1 p ∧ q + 1 n t ) = o p ( 1 ) , \lvert G_{4}\rvert=O_{p}\left(\frac{1}{\sqrt{p\wedge q}}+\frac{1}{\sqrt{n_{t}}}\right)=o_{p}(1), ∣ G 4 ∣ = O p ( p ∧ q 1 + n t 1 ) = o p ( 1 ) ,
as p ∧ q → ∞ p\wedge q\to\infty p ∧ q → ∞ and n t → ∞ n_{t}\to\infty n t → ∞ .
Terms from γ 1 ⊤ δ 0 \gamma_{1}^{\top}\delta_{0} γ 1 ⊤ δ 0 (control units).
Before bounding L 1 , L 2 , L 4 L_{1},L_{2},L_{4} L 1 , L 2 , L 4 , we first obtain the control-side versions of the results used for G 1 , G 2 , G 4 G_{1},G_{2},G_{4} G 1 , G 2 , G 4 under the substitution of ( F 1 , E 0 , S , M , P S , p ∧ q ) (F_{1},E_{0},S,M,P_{S},p\wedge q) ( F 1 , E 0 , S , M , P S , p ∧ q ) to ( F X 1 , E X 0 , S ~ , M ~ , P ~ S , p ) (F_{X1},E_{X0},\widetilde{S},\widetilde{M},\widetilde{P}_{S},p) ( F X 1 , E X 0 , S , M , P S , p ) , where p p p replaces p ∧ q p\wedge q p ∧ q because the second-stage regression involves only the X X X -side error block E X E_{X} E X . Repeating the proof of Lemma C.5 gives the control Schur complement D ~ + E ~ n \widetilde{D}+\widetilde{E}_{n} D + E n of J ~ ⊤ M ~ J ~ \widetilde{J}^{\top}\widetilde{M}\widetilde{J} J ⊤ M J , where D ~ = n c − 1 R ~ F X 1 ⊤ F X 1 R ~ ⊤ \widetilde{D}=n_{c}^{-1}\widetilde{R}F_{X1}^{\top}F_{X1}\widetilde{R}^{\top} D = n c − 1 R F X 1 ⊤ F X 1 R ⊤ . As before, λ min ( D ~ ) ≥ c c ~ R 2 > 0 \lambda_{\min}(\widetilde{D})\geq c\widetilde{c}_{R}^{2}>0 λ m i n ( D ) ≥ c c R 2 > 0 by Assumption 3.1(iii)–(iv). The four-piece bound in Equation (C.6) then gives
∥ E ~ n ∥ = O p ( 1 + ∥ μ F X ∥ 2 + ∥ μ F X ∥ 2 2 n c + 1 n c p + 1 p ) ⟹ ∥ ( D ~ + E ~ n ) − 1 ∥ o p = O p ( 1 ) . (62) \lVert\widetilde{E}_{n}\rVert=O_{p}\left(\frac{1+\lVert\mu_{F_{X}}\rVert_{2}+\lVert\mu_{F_{X}}\rVert_{2}^{2}}{n_{c}}+\frac{1}{\sqrt{n_{c}p}}+\frac{1}{p}\right)\Longrightarrow\left\lVert(\widetilde{D}+\widetilde{E}_{n})^{-1}\right\rVert_{\mathrm{op}}=O_{p}(1). \tag*{(62)} ∥ E n ∥ = O p ( n c 1 + ∥ μ F X ∥ 2 + ∥ μ F X ∥ 2 2 + n c p 1 + p 1 ) ⟹ ( D + E n ) − 1 op = O p ( 1 ) . (62)
The block-inverse identities (C.23)–(C.27) also hold under this substitution. Similarly, Lemma C.3 applies to P ~ S \widetilde{P}_{S} P S , and the rates in Lemma C.2 hold with p p p in place of p ∧ q p\wedge q p ∧ q . Finally, ∥ ϕ ∥ = O p ( 1 ) \lVert\phi\rVert=O_{p}(1) ∥ ϕ ∥ = O p ( 1 ) since ϕ = ( γ 1 ⊤ δ 0 , γ 1 ⊤ B 0 H X ⊤ ) ⊤ \phi=(\gamma_{1}^{\top}\delta_{0},\gamma_{1}^{\top}B_{0}H_{X}^{\top})^{\top} ϕ = ( γ 1 ⊤ δ 0 , γ 1 ⊤ B 0 H X ⊤ ) ⊤ , where the structural parameters are bounded by Assumption 3.2(i) and ∥ H X ∥ o p = O p ( 1 ) \lVert H_{X}\rVert_{\mathrm{op}}=O_{p}(1) ∥ H X ∥ op = O p ( 1 ) by Proposition 5.1.
L 1 = o p ( 1 ) L_{1}=o_{p}(1) L 1 = o p ( 1 ) . Let v ~ = 1 n c F X 1 ⊤ E X 0 ϕ \widetilde{v}=\frac{1}{\sqrt{n_{c}}}F_{X1}^{\top}E_{X0}\phi v = n c 1 F X 1 ⊤ E X 0 ϕ , so that L 1 = e ~ 1 ⊤ M ~ − 1 H X 1 v ~ L_{1}=\widetilde{e}_{1}^{\top}\widetilde{M}^{-1}H_{X1}\widetilde{v} L 1 = e 1 ⊤ M − 1 H X 1 v . Since the first column of H X 1 = diag ( 1 , H X ) H_{X1}=\operatorname{diag}(1,H_{X}) H X 1 = diag ( 1 , H X ) is e 1 e_{1} e 1 , we have e 1 ∈ Col ( H X 1 ) = Col ( U ~ ) e_{1}\in\operatorname{Col}(H_{X1})=\operatorname{Col}(\widetilde{U}) e 1 ∈ Col ( H X 1 ) = Col ( U ) . Thus, e ~ 1 ⊤ S ~ = 0 \widetilde{e}_{1}^{\top}\widetilde{S}=0 e 1 ⊤ S = 0 . Writing a ~ ⊤ = e ~ 1 ⊤ U ~ \widetilde{a}^{\top}=\widetilde{e}_{1}^{\top}\widetilde{U} a ⊤ = e 1 ⊤ U and using the control-side block-inverse identity, we obtain
L 1 = ( a ~ ⊤ , 0 ) ( J ~ ⊤ M ~ J ~ ) − 1 ( R ~ 0 ) v ~ = a ~ ⊤ ( D ~ + E ~ n ) − 1 R ~ v ~ . L_{1}=(\widetilde{a}^{\top},0)(\widetilde{J}^{\top}\widetilde{M}\widetilde{J})^{-1}\begin{pmatrix}\widetilde{R}\\0\end{pmatrix}\widetilde{v}=\widetilde{a}^{\top}(\widetilde{D}+\widetilde{E}_{n})^{-1}\widetilde{R}\widetilde{v}. L 1 = ( a ⊤ , 0 ) ( J ⊤ M J ) − 1 ( R 0 ) v = a ⊤ ( D + E n ) − 1 R v .
By the X X X -only version of Lemma C.2(ii) and ∥ ϕ ∥ = O p ( 1 ) \lVert\phi\rVert=O_{p}(1) ∥ ϕ ∥ = O p ( 1 ) , we have
∥ v ~ ∥ ≤ ∥ 1 n c F X 1 ⊤ E X 0 ∥ o p ∥ ϕ ∥ = O p ( 1 p ) . \lVert\widetilde{v}\rVert\leq\left\lVert\frac{1}{\sqrt{n_{c}}}F_{X1}^{\top}E_{X0}\right\rVert_{\mathrm{op}}\lVert\phi\rVert=O_{p}\left(\frac{1}{\sqrt{p}}\right). ∥ v ∥ ≤ n c 1 F X 1 ⊤ E X 0 op ∥ ϕ ∥ = O p ( p 1 ) .
Now, combining this with ∥ a ~ ∥ ≤ 1 \lVert\widetilde{a}\rVert\leq1 ∥ a ∥ ≤ 1 , ∥ ( D ~ + E ~ n ) − 1 ∥ o p = O p ( 1 ) \lVert(\widetilde{D}+\widetilde{E}_{n})^{-1}\rVert_{\mathrm{op}}=O_{p}(1) ∥( D + E n ) − 1 ∥ op = O p ( 1 ) , and ∥ R ~ ∥ o p = O ( 1 ) \lVert\widetilde{R}\rVert_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) , we have as p → ∞ p\to\infty p → ∞ ,
∣ L 1 ∣ ≤ ∥ a ~ ∥ ∥ ( D ~ + E ~ n ) − 1 ∥ o p ∥ R ~ ∥ o p ∥ v ~ ∥ = O p ( 1 p ) = o p ( 1 ) . \lvert L_{1}\rvert\leq\lVert\widetilde{a}\rVert\lVert(\widetilde{D}+\widetilde{E}_{n})^{-1}\rVert_{\mathrm{op}}\lVert\widetilde{R}\rVert_{\mathrm{op}}\lVert\widetilde{v}\rVert=O_{p}\left(\frac{1}{\sqrt{p}}\right)=o_{p}(1). ∣ L 1 ∣ ≤ ∥ a ∥ ∥( D + E n ) − 1 ∥ op ∥ R ∥ op ∥ v ∥ = O p ( p 1 ) = o p ( 1 ) .
L 2 = o p ( 1 ) L_{2}=o_{p}(1) L 2 = o p ( 1 ) . By definition, L 2 = e ~ 1 ⊤ H X 1 ⊤ M ~ − 1 1 n c E X 0 ⊤ E X 0 ϕ L_{2}=\widetilde{e}_{1}^{\top}H_{X1}^{\top}\widetilde{M}^{-1}\frac{1}{\sqrt{n_{c}}}E_{X0}^{\top}E_{X0}\phi L 2 = e 1 ⊤ H X 1 ⊤ M − 1 n c 1 E X 0 ⊤ E X 0 ϕ . This has the same structure as G 2 G_{2} G 2 , with H X 1 H_{X1} H X 1 on the left only. Applying the control analogue of Equation (C.27) with w = E X 0 ϕ w=E_{X0}\phi w = E X 0 ϕ , we obtain
L 2 = e ~ 1 ⊤ R ~ ⊤ ( D ~ + E ~ n ) − 1 [ 1 n c U ~ ⊤ E X 0 ⊤ ( I − P ~ S ) E X 0 ϕ − 1 n c R ~ F X 1 ⊤ P ~ S E X 0 ϕ ] . L_{2}=\widetilde{e}_{1}^{\top}\widetilde{R}^{\top}(\widetilde{D}+\widetilde{E}_{n})^{-1}\left[\frac{1}{\sqrt{n_{c}}}\widetilde{U}^{\top}E_{X0}^{\top}(I-\widetilde{P}_{S})E_{X0}\phi-\frac{1}{\sqrt{n_{c}}\!}\widetilde{R}F_{X1}^{\top}\widetilde{P}_{S}E_{X0}\phi\right]. L 2 = e 1 ⊤ R ⊤ ( D + E n ) − 1 [ n c 1 U ⊤ E X 0 ⊤ ( I − P S ) E X 0 ϕ − n c 1 R F X 1 ⊤ P S E X 0 ϕ ] .
The outside factor is O p ( 1 ) O_{p}(1) O p ( 1 ) , so it suffices to bound ∥ L 2 , 1 ∥ \lVert L_{2,1}\rVert ∥ L 2 , 1 ∥ and ∥ L 2 , 2 ∥ \lVert L_{2,2}\rVert ∥ L 2 , 2 ∥ . By the X X X -only version of Lemma C.2(iii), ∥ n c − 1 E X 0 ⊤ E X 0 ∥ o p = O p ( p − 1 ) \left\lVert n_{c}^{-1}E_{X0}^{\top}E_{X0}\right\rVert_{\mathrm{op}}=O_{p}(p^{-1}) n c − 1 E X 0 ⊤ E X 0 op = O p ( p − 1 ) . For L 2 , 1 L_{2,1} L 2 , 1 , using ∥ U ~ ∥ o p = 1 \lVert\widetilde{U}\rVert_{\mathrm{op}}=1 ∥ U ∥ op = 1 , ∥ I − P ~ S ∥ o p ≤ 1 \lVert I-\widetilde{P}_{S}\rVert_{\mathrm{op}}\leq1 ∥ I − P S ∥ op ≤ 1 , and ∥ ϕ ∥ = O p ( 1 ) \lVert\phi\rVert=O_{p}(1) ∥ ϕ ∥ = O p ( 1 ) , we have
∥ L 2 , 1 ∥ ≤ 1 n c ∥ E X 0 ⊤ ( I − P ~ S ) E X 0 ∥ o p ∥ ϕ ∥ ≤ n c ∥ 1 n c E X 0 ⊤ E X 0 ∥ o p ∥ ϕ ∥ = O p ( n c p ) , \lVert L_{2,1}\rVert\leq\frac{1}{\sqrt{n_{c}}}\lVert E_{X0}^{\top}(I-\widetilde{P}_{S})E_{X0}\rVert_{\mathrm{op}}\lVert\phi\rVert\leq\sqrt{n_{c}}\left\lVert\frac{1}{n_{c}}E_{X0}^{\top}E_{X0}\right\rVert_{\mathrm{op}}\lVert\phi\rVert=O_{p}\left(\sqrt{\frac{n_{c}}{p}}\right), ∥ L 2 , 1 ∥ ≤ n c 1 ∥ E X 0 ⊤ ( I − P S ) E X 0 ∥ op ∥ ϕ ∥ ≤ n c n c 1 E X 0 ⊤ E X 0 op ∥ ϕ ∥ = O p ( p n c ) ,
exactly as in Equation (C.29). For L 2 , 2 L_{2,2} L 2 , 2 , we use ∥ R ~ ∥ o p = O ( 1 ) \|\widetilde{R}\|_{\mathrm{op}} = O(1) ∥ R ∥ op = O ( 1 ) , ∥ 1 n c F ~ X 1 ∥ o p = O p ( 1 ) \left\|\frac{1}{\sqrt{n_c}}\widetilde{F}_{X1}\right\|_{\mathrm{op}} = O_p(1) n c 1 F X 1 op = O p ( 1 ) , and ∥ P ~ S ∥ o p ≤ 1 \|\widetilde{P}_S\|_{\mathrm{op}} \le1 ∥ P S ∥ op ≤ 1 . Moreover, we have
∥ E X 0 ϕ ∥ ≤ ∥ E X 0 ⊤ E X 0 ∥ o p 1 / 2 ∥ ϕ ∥ = n c ∥ 1 n c E X 0 ⊤ E X 0 ∥ o p 1 / 2 ∥ ϕ ∥ = O p ( n c p ) . \|\mathbb{E}_{X0}\phi\| \le\|\mathbb{E}_{X0}^{\top}\mathbb{E}_{X0}\|_{\mathrm{op}}^{1/2}\|\phi\| = \sqrt{n_c}\left\|\frac{1}{n_c}\mathbb{E}_{X0}^{\top}\mathbb{E}_{X0}\right\|_{\mathrm{op}}^{1/2}\|\phi\| = O_p\left(\sqrt{\frac{n_c}{p}}\right). ∥ E X 0 ϕ ∥ ≤ ∥ E X 0 ⊤ E X 0 ∥ op 1/2 ∥ ϕ ∥ = n c n c 1 E X 0 ⊤ E X 0 op 1/2 ∥ ϕ ∥ = O p ( p n c ) .
Therefore,
∥ L 2 , 2 ∥ ≤ ∥ R ~ ∥ o p ∥ 1 n c F ~ X 1 ∥ o p ∥ P ~ S ∥ o p ∥ E X 0 ϕ ∥ = O p ( n c p ) . \|L_{2,2}\| \le\|\widetilde{R}\|_{\mathrm{op}}\left\|\frac{1}{\sqrt{n_c}}\widetilde{F}_{X1}\right\|_{\mathrm{op}}\|\widetilde{P}_S\|_{\mathrm{op}}\|\mathbb{E}_{X0}\phi\| = O_p\left(\sqrt{\frac{n_c}{p}}\right). ∥ L 2 , 2 ∥ ≤ ∥ R ∥ op n c 1 F X 1 op ∥ P S ∥ op ∥ E X 0 ϕ ∥ = O p ( p n c ) .
Now, combining the two bounds, the second rate dominates as p → ∞ p \to\infty p → ∞ . Hence, we have
∣ L 2 ∣ = O p ( n c p + n c p ) = O p ( n c p ) = o p ( 1 ) , |L_2| = O_p\left(\sqrt{\frac{n_c}{p}}+\sqrt{\frac{n_c}{p}}\right) = O_p\left(\sqrt{\frac{n_c}{p}}\right) = o_p(1), ∣ L 2 ∣ = O p ( p n c + p n c ) = O p ( p n c ) = o p ( 1 ) ,
since n c / p → 0 n_c/p \to0 n c / p → 0 .
L 4 = o p ( 1 ) L_4 = o_p(1) L 4 = o p ( 1 ) . By definition, L 4 = e ~ 1 ⊤ H ~ X 1 M ~ − 1 1 n c E X 0 η L_4 = \widetilde{e}_1^{\top}\widetilde{H}_{X1}\widetilde{M}^{-1}\frac{1}{\sqrt{n_c}}\mathbb{E}_{X0}\eta L 4 = e 1 ⊤ H X 1 M − 1 n c 1 E X 0 η , where η i = γ 1 ⊤ u X M , 0 , i \eta_i = \gamma_1^{\top}u_{XM,0,i} η i = γ 1 ⊤ u X M , 0 , i for the control units. This has the same structure as G 4 G_4 G 4 , with η \eta η in place of ϵ 1 \epsilon_1 ϵ 1 . Applying the control one-sided identity and Equation (C.27) with w = η w=\eta w = η , we obtain
L 4 = e ~ 1 ⊤ R ~ ⊤ ( D ~ + E ~ n ) − 1 [ 1 n c U ~ ⊤ E X 0 ( I − P ~ S ) η − 1 n c R ~ F ~ X 1 ⊤ P ~ S η ] . L_4 = \widetilde{e}_1^{\top}\widetilde{R}^{\top}(\widetilde{D}+\widetilde{E}_n)^{-1}\left[\frac{1}{\sqrt{n_c}}\widetilde{U}^{\top}\mathbb{E}_{X0}(I-\widetilde{P}_S)\eta-\frac{1}{\sqrt{n_c}}\widetilde{R}\widetilde{F}_{X1}^{\top}\widetilde{P}_S\eta\right]. L 4 = e 1 ⊤ R ⊤ ( D + E n ) − 1 [ n c 1 U ⊤ E X 0 ( I − P S ) η − n c 1 R F X 1 ⊤ P S η ] .
The outside factor is O p ( 1 ) O_p(1) O p ( 1 ) , so it suffices to bound ∥ L 4 , 1 ∥ \|L_{4,1}\| ∥ L 4 , 1 ∥ and ∥ L 4 , 2 ∥ \|L_{4,2}\| ∥ L 4 , 2 ∥ . By Assumption 3.1(i)--(ii), η \eta η is independent of ( F X 1 , E X 0 ) (F_{X1},\mathbb{E}_{X0}) ( F X 1 , E X 0 ) and has mean zero, conditional on the training fold. Moreover, Assumptions 3.1(v) and 3.2(i) give Var ( η i ) = γ 1 ⊤ Σ u X M , 0 γ 1 ≤ C \operatorname{Var}(\eta_i)=\gamma_1^{\top}\Sigma_{uXM,0}\gamma_1\le C Var ( η i ) = γ 1 ⊤ Σ u X M , 0 γ 1 ≤ C .
For L 4 , 1 L_{4,1} L 4 , 1 , conditional on E X 0 \mathbb{E}_{X0} E X 0 , and using that I − P ~ S I-\widetilde{P}_S I − P S is an orthogonal projection, we have
E [ ∥ L 4 , 1 ∥ 2 ∣ E X 0 ] ≤ C n c tr ( U ~ ⊤ E X 0 ( I − P ~ S ) E X 0 U ~ ) ≤ C n c ∥ E X 0 ∥ o p 2 = O p ( p − 1 ) , \mathbb{E}\left[\|L_{4,1}\|^2\mid\mathbb{E}_{X0}\right]\le\frac{C}{n_c}\operatorname{tr}\left(\widetilde{U}^{\top}\mathbb{E}_{X0}(I-\widetilde{P}_S)\mathbb{E}_{X0}\widetilde{U}\right)\le\frac{C}{n_c}\|\mathbb{E}_{X0}\|_{\mathrm{op}}^2=O_p(p^{-1}), E [ ∥ L 4 , 1 ∥ 2 ∣ E X 0 ] ≤ n c C tr ( U ⊤ E X 0 ( I − P S ) E X 0 U ) ≤ n c C ∥ E X 0 ∥ op 2 = O p ( p − 1 ) ,
where the last bound follows from the X X X -only version of Lemma C.2 (iii), since the projected dimension is fixed. Thus, ∥ L 4 , 1 ∥ = O p ( p − 1 / 2 ) \|L_{4,1}\|=O_p(p^{-1/2}) ∥ L 4 , 1 ∥ = O p ( p − 1/2 ) .
For L 4 , 2 L_{4,2} L 4 , 2 , we split F ~ X 1 = 1 μ F X ⊤ + F ~ X 1 \widetilde{F}_{X1}=1\mu_{F_X}^{\top}+\widetilde{F}_{X1} F X 1 = 1 μ F X ⊤ + F X 1 into mean and centered parts:
1 n c R ~ F ~ X 1 ⊤ P ~ S η = 1 n c R ~ μ F X 1 ⊤ P ~ S η + 1 n c R ~ F ~ X 1 ⊤ P ~ S η . \frac{1}{\sqrt{n_c}}\widetilde{R}\widetilde{F}_{X1}^{\top}\widetilde{P}_S\eta=\frac{1}{\sqrt{n_c}}\widetilde{R}\mu_{F_X}1^{\top}\widetilde{P}_S\eta+\frac{1}{\sqrt{n_c}}\widetilde{R}\widetilde{F}_{X1}^{\top}\widetilde{P}_S\eta. n c 1 R F X 1 ⊤ P S η = n c 1 R μ F X 1 ⊤ P S η + n c 1 R F X 1 ⊤ P S η .
For the mean part, the conditional mean-zero property and bounded variance of η \eta η give, as in Equation (C.33),
E [ ( 1 ⊤ P ~ S η ) 2 | P ~ S ] ≤ C 1 ⊤ P ~ S 2 1 = C 1 ⊤ P ~ S 1 = O p ( 1 ) , \mathbb{E}\left[\left(1^{\top}\widetilde{P}_S\eta\right)^2\middle|\widetilde{P}_S\right]\le C1^{\top}\widetilde{P}_S^2 1=C1^{\top}\widetilde{P}_S1=O_p(1), E [ ( 1 ⊤ P S η ) 2 P S ] ≤ C 1 ⊤ P S 2 1 = C 1 ⊤ P S 1 = O p ( 1 ) ,
where the last equality follows from Lemma C.3. Hence, 1 ⊤ P ~ S η = O p ( 1 ) 1^{\top}\widetilde{P}_S\eta=O_p(1) 1 ⊤ P S η = O p ( 1 ) . Since ∥ R ~ ∥ o p = O ( 1 ) \|\widetilde{R}\|_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) and ∥ μ F X ∥ 2 = O ( 1 ) \|\mu_{F_X}\|_2=O(1) ∥ μ F X ∥ 2 = O ( 1 ) by Assumption 3.1(iii), we have
∥ 1 n c R ~ μ F X 1 ⊤ P ~ S η ∥ ≤ 1 n c ∥ R ~ ∥ o p ∥ μ F X ∥ 2 ∣ 1 ⊤ P ~ S η ∣ = O p ( 1 n c ) . \left\|\frac{1}{\sqrt{n_c}}\widetilde{R}\mu_{F_X}1^{\top}\widetilde{P}_S\eta\right\|\le\frac{1}{\sqrt{n_c}}\|\widetilde{R}\|_{\mathrm{op}}\|\mu_{F_X}\|_2|1^{\top}\widetilde{P}_S\eta|=O_p\left(\frac{1}{\sqrt{n_c}}\right). n c 1 R μ F X 1 ⊤ P S η ≤ n c 1 ∥ R ∥ op ∥ μ F X ∥ 2 ∣ 1 ⊤ P S η ∣ = O p ( n c 1 ) .
For the centered part, conditional on ( F ~ X 1 , E X 0 ) (\widetilde{F}_{X1},\mathbb{E}_{X0}) ( F X 1 , E X 0 ) , the same argument as in Equation (C.35) gives us that
E [ ∥ 1 n c R ~ F ~ X 1 ⊤ P ~ S η ∥ 2 | F ~ X 1 , E X 0 ] ≤ C n c ∥ R ~ ∥ o p 2 tr ( F ~ X 1 ⊤ P ~ S F ~ X 1 ) = O p ( 1 n c ) , \mathbb{E}\left[\left\|\frac{1}{\sqrt{n_c}}\widetilde{R}\widetilde{F}_{X1}^{\top}\widetilde{P}_S\eta\right\|^2\middle|\widetilde{F}_{X1},\mathbb{E}_{X0}\right]\le\frac{C}{n_c}\|\widetilde{R}\|_{\mathrm{op}}^2\operatorname{tr}\left(\widetilde{F}_{X1}^{\top}\widetilde{P}_S\widetilde{F}_{X1}\right)=O_p\left(\frac{1}{n_c}\right), E [ n c 1 R F X 1 ⊤ P S η 2 F X 1 , E X 0 ] ≤ n c C ∥ R ∥ op 2 tr ( F X 1 ⊤ P S F X 1 ) = O p ( n c 1 ) ,
where tr ( F ~ X 1 ⊤ P ~ S F ~ X 1 ) = O p ( 1 ) \operatorname{tr}(\widetilde{F}_{X1}^{\top}\widetilde{P}_S\widetilde{F}_{X1})=O_p(1) tr ( F X 1 ⊤ P S F X 1 ) = O p ( 1 ) by Lemma C.4 . Thus, the centered part is also O p ( n c − 1 / 2 ) O_p(n_c^{-1/2}) O p ( n c − 1/2 ) . Now, combining the mean and centered parts, ∥ L 4 , 2 ∥ = O p ( n c − 1 / 2 ) \|L_{4,2}\|=O_p(n_c^{-1/2}) ∥ L 4 , 2 ∥ = O p ( n c − 1/2 ) . Together with the bound for L 4 , 1 L_{4,1} L 4 , 1 and the O p ( 1 ) O_p(1) O p ( 1 ) outside factor, we obtain
∣ L 4 ∣ = O p ( p − 1 / 2 + n c − 1 / 2 ) = o p ( 1 ) . |L_4|=O_p\left(p^{-1/2}+n_c^{-1/2}\right)=o_p(1). ∣ L 4 ∣ = O p ( p − 1/2 + n c − 1/2 ) = o p ( 1 ) .
L 5 = o p ( 1 ) L_5=o_p(1) L 5 = o p ( 1 ) . We have
L 5 = e ~ 1 ⊤ H ~ X 1 M ~ − 1 H ~ X 1 1 n c F ~ X 1 R n . L_5=\widetilde{e}_1^{\top}\widetilde{H}_{X1}\widetilde{M}^{-1}\widetilde{H}_{X1}\frac{1}{\sqrt{n_c}}\widetilde{F}_{X1}\mathcal{R}_n. L 5 = e 1 ⊤ H X 1 M − 1 H X 1 n c 1 F X 1 R n .
By the control analogue of (C.24), the left factor has operator norm O p ( 1 ) O_p(1) O p ( 1 ) , so it suffices to bound 1 n c F X 1 ⊤ R n \frac{1}{\sqrt{n_c}}\mathbf{F}_{X1}^{\top}R_n n c 1 F X 1 ⊤ R n . We first split the remainder into its covariate and mediator parts, we get
R n = E X 0 a n + R n M , a n = ( 0 − ( H X ⊤ ) − 1 B 0 ⊤ Δ γ , n ) ⊤ , ( R n M ) i = Δ γ , n ⊤ x M , 0 , i + γ ^ 1 ⊤ e M i . (63) R_n=\mathbf{E}_{X0}a_n+R_n^M,\qquad a_n=\left(0\ \ -(\mathbf{H}_{X}^{\top})^{-1}\mathbf{B}_0^{\top}\Delta_{\gamma,n}\right)^{\top},\qquad(R_n^M)_i=\Delta_{\gamma,n}^{\top}\mathbf{x}_{M,0,i}+\hat{\gamma}_1^{\top}e_{M_i}. \tag*{(63)} R n = E X 0 a n + R n M , a n = ( 0 − ( H X ⊤ ) − 1 B 0 ⊤ Δ γ , n ) ⊤ , ( R n M ) i = Δ γ , n ⊤ x M , 0 , i + γ ^ 1 ⊤ e M i . (63)
By Proposition 5.1 and Lemma C.6, ∥ a n ∥ = O p ( n t − 1 / 2 ) = O p ( 1 ) \lVert a_n\rVert=O_p(n_t^{-1/2})=O_p(1) ∥ a n ∥ = O p ( n t − 1/2 ) = O p ( 1 ) . Let G t \mathcal{G}_t G t denote the training-fold and treated-sample information, as defined earlier. Conditional on G t \mathcal{G}_t G t , the coefficients are fixed and the control errors are independent and mean zero. We first consider the covariate part. Write F X 1 = 1 μ X ⊤ + F X \mathbf{F}_{X1}=\mathbf{1}\mu_X^{\top}+\mathbf{F}_X F X 1 = 1 μ X ⊤ + F X , where F X \mathbf{F}_X F X contains the centered factors. For the mean part, since the rows of E X 0 \mathbf{E}_{X0} E X 0 are independent and mean zero conditional on G t \mathcal{G}_t G t , we have
E [ ∥ 1 n c μ X 1 ⊤ E X 0 a n ∥ 2 | G t ] ≤ C p ∥ μ X ∥ 2 ∥ a n ∥ 2 = O p ( 1 p ) , \mathbb{E}\left[\left\lVert\frac{1}{\sqrt{n_c}}\mu_X\mathbf{1}^{\top}\mathbf{E}_{X0}a_n\right\rVert^2\middle|\mathcal{G}_t\right]\leq\frac{C}{p}\lVert\mu_X\rVert^2\lVert a_n\rVert^2=O_p\left(\frac{1}{p}\right), E [ n c 1 μ X 1 ⊤ E X 0 a n 2 G t ] ≤ p C ∥ μ X ∥ 2 ∥ a n ∥ 2 = O p ( p 1 ) ,
using the bounded covariance of u X u_X u X and ∥ μ X ∥ = O ( 1 ) \lVert\mu_X\rVert=O(1) ∥ μ X ∥ = O ( 1 ) . For the fluctuation part, the centered factors are independent of the control proxy errors and have mean zero. Conditional on ( G t , E X 0 ) (\mathcal{G}_t,\mathbf{E}_{X0}) ( G t , E X 0 ) , we have
E [ ∥ 1 n c F X ⊤ E X 0 a n ∥ 2 | G t , E X 0 ] ≤ C n c ∥ E X 0 a n ∥ 2 ≤ C ∥ 1 n c E X 0 ⊤ E X 0 ∥ o p ∥ a n ∥ 2 = O p ( 1 p ) , \mathbb{E}\left[\left\lVert\frac{1}{\sqrt{n_c}}\mathbf{F}_X^{\top}\mathbf{E}_{X0}a_n\right\rVert^2\middle|\mathcal{G}_t,\mathbf{E}_{X0}\right]\leq\frac{C}{n_c}\lVert\mathbf{E}_{X0}a_n\rVert^2\leq C\left\lVert\frac{1}{n_c}\mathbf{E}_{X0}^{\top}\mathbf{E}_{X0}\right\rVert_{\mathrm{op}}\lVert a_n\rVert^2=O_p\left(\frac{1}{p}\right), E [ n c 1 F X ⊤ E X 0 a n 2 G t , E X 0 ] ≤ n c C ∥ E X 0 a n ∥ 2 ≤ C n c 1 E X 0 ⊤ E X 0 op ∥ a n ∥ 2 = O p ( p 1 ) ,
where the last equality follows from Lemma C.2 (iii). Now, for the mediator part, Assumption 3.1(ii) gives that R n M R_n^M R n M is mean zero and independent of the control factors, conditional on G t \mathcal{G}_t G t . Moreover, Lemmas C.6 and C.7, together with Proposition 5.1, give ∥ γ ^ 1 ∥ = O p ( 1 + q / n t ) \lVert\hat{\gamma}_1\rVert=O_p(1+\sqrt{q/n_t}) ∥ γ ^ 1 ∥ = O p ( 1 + q / n t ) . Using the bounded error covariances, we obtain
E [ ( ( R n M ) i ) 2 ∣ G t ] ≤ C ( ∥ Δ γ , n ∥ 2 + 1 q ∥ γ ^ 1 ∥ 2 ) = O p ( 1 n t + 1 q ) . \mathbb{E}\left[((R_n^M)_i)^2\mid\mathcal{G}_t\right]\leq C\left(\lVert\Delta_{\gamma,n}\rVert^2+\frac{1}{q}\lVert\hat{\gamma}_1\rVert^2\right)=O_p\left(\frac{1}{n_t}+\frac{1}{q}\right). E [ (( R n M ) i ) 2 ∣ G t ] ≤ C ( ∥ Δ γ , n ∥ 2 + q 1 ∥ γ ^ 1 ∥ 2 ) = O p ( n t 1 + q 1 ) .
Since the control observations are independent and E ∥ f X 1 , i ∥ 2 ≤ C \mathbb{E}\lVert f_{X1,i}\rVert^2\leq C E ∥ f X 1 , i ∥ 2 ≤ C , we have
E [ ∥ 1 n c F X 1 ⊤ R n M ∥ 2 | G t ] ≤ C max i : A i = 0 E [ ( ( R n M ) i ) 2 ∣ G t ] = O p ( 1 q + 1 n t ) . \mathbb{E}\left[\left\lVert\frac{1}{\sqrt{n_c}}\mathbf{F}_{X1}^{\top}R_n^M\right\rVert^2\middle|\mathcal{G}_t\right]\leq C\max_{i:A_i=0}\mathbb{E}\left[((R_n^M)_i)^2\mid\mathcal{G}_t\right]=O_p\left(\frac{1}{q}+\frac{1}{n_t}\right). E [ n c 1 F X 1 ⊤ R n M 2 G t ] ≤ C i : A i = 0 max E [ (( R n M ) i ) 2 ∣ G t ] = O p ( q 1 + n t 1 ) .
Thus, the mediator contribution is O p ( q − 1 / 2 + n t − 1 / 2 ) O_p(q^{-1/2}+n_t^{-1/2}) O p ( q − 1/2 + n t − 1/2 ) . Combining the covariate and mediator parts gives
∥ 1 n c F X 1 ⊤ R n ∥ = O p ( 1 p + 1 q + 1 n t ) . \left\lVert\frac{1}{\sqrt{n_c}}\mathbf{F}_{X1}^{\top}R_n\right\rVert=O_p\left(\frac{1}{\sqrt{p}}+\frac{1}{\sqrt{q}}+\frac{1}{\sqrt{n_t}}\right). n c 1 F X 1 ⊤ R n = O p ( p 1 + q 1 + n t 1 ) .
Therefore, together with the O p ( 1 ) O_p(1) O p ( 1 ) , we get that
∣ L 5 ∣ = O p ( 1 p + 1 q + 1 n t ) = o p ( 1 ) . |L_5|=O_p\left(\frac{1}{\sqrt{p}}+\frac{1}{\sqrt{q}}+\frac{1}{\sqrt{n_t}}\right)=o_p(1). ∣ L 5 ∣ = O p ( p 1 + q 1 + n t 1 ) = o p ( 1 ) .
L 6 = O p ( 1 ) . ‾ \underline{L_6=O_p(1).} L 6 = O p ( 1 ) . By definition, L 6 = e 1 ⊤ H X 1 ⊤ M − 1 1 n c E X 0 R n L_6=e_1^{\top}\mathbf{H}_{X1}^{\top}\mathbf{M}^{-1}\frac{1}{\sqrt{n_c}}\mathbf{E}_{X0}R_n L 6 = e 1 ⊤ H X 1 ⊤ M − 1 n c 1 E X 0 R n . This has the same structure as L 4 L_4 L 4 , with R n R_n R n in place of η \eta η . Applying the control one-sided identity and Equation (C.27) with w = R n w=R_n w = R n , we obtain
L 6 = e 1 ⊤ R ~ ⊤ ( D ~ + E ~ n ) − 1 [ 1 n c U ~ ⊤ E X 0 ( I − P ~ S ) R n ⏟ = : L 6 , 1 − 1 n c R ~ F X 1 ⊤ P ~ S R n ⏟ = : L 6 , 2 ] . L_6=e_1^{\top}\widetilde{\mathbf{R}}^{\top}(\widetilde{\mathbf{D}}+\widetilde{\mathbf{E}}_n)^{-1}\left[\underbrace{\frac{1}{\sqrt{n_c}}\widetilde{\mathbf{U}}^{\top}\mathbf{E}_{X0}(I-\widetilde{P}_S)R_n}_{=:L_{6,1}}-\underbrace{\frac{1}{\sqrt{n_c}}\widetilde{\mathbf{R}}\mathbf{F}_{X1}^{\top}\widetilde{P}_SR_n}_{=:L_{6,2}}\right]. L 6 = e 1 ⊤ R ⊤ ( D + E n ) − 1 =: L 6 , 1 n c 1 U ⊤ E X 0 ( I − P S ) R n − =: L 6 , 2 n c 1 R F X 1 ⊤ P S R n .
The outside factor is O p ( 1 ) O_p(1) O p ( 1 ) by Equation (C.36), so it suffices to bound L 6 , 1 L_{6,1} L 6 , 1 and L 6 , 2 L_{6,2} L 6 , 2 . In (C.37), we have that by Lemma C.6 and Proposition 5.1, ∥ a n ∥ = O p ( n t − 1 / 2 ) = O p ( 1 ) \lVert a_n\rVert=O_p(n_t^{-1/2})=O_p(1) ∥ a n ∥ = O p ( n t − 1/2 ) = O p ( 1 ) . Let G t \mathcal{G}_t G t denote the training-fold and treated-sample information defined earlier. Conditional on G t \mathcal{G}_t G t , the coefficients are fixed, and R n M R_n^M R n M is independent of E X 0 \mathbf{E}_{X0} E X 0 and has mean zero. Moreover, the bounds for γ ^ 1 \hat{\gamma}_1 γ ^ 1 and Δ γ , n \Delta_{\gamma,n} Δ γ , n give
r M , n 2 : = max i : A i = 0 E [ ( ( R n M ) i ) 2 ∣ G t ] = O p ( 1 q + 1 n t ) . r_{M,n}^2:=\max_{i:A_i=0}\mathbb{E}\left[((R_n^M)_i)^2\mid\mathcal{G}_t\right]=O_p\left(\frac{1}{q}+\frac{1}{n_t}\right). r M , n 2 := i : A i = 0 max E [ (( R n M ) i ) 2 ∣ G t ] = O p ( q 1 + n t 1 ) .
For L 6 , 1 L_{6,1} L 6 , 1 , we first consider the covariate part. Since ∥ U ~ ∥ o p = 1 \lVert\widetilde{\mathbf{U}}\rVert_{\mathrm{op}}=1 ∥ U ∥ op = 1 and ∥ I − P ~ S ∥ o p ≤ 1 \lVert I-\widetilde{P}_S\rVert_{\mathrm{op}}\leq1 ∥ I − P S ∥ op ≤ 1 , we have
∥ 1 n c U ~ ⊤ E X 0 ( I − P ~ S ) E X 0 a n ∥ ≤ 1 n c ∥ E X 0 ∥ o p 2 ∥ a n ∥ = O p ( n c p ) , \left\lVert\frac{1}{\sqrt{n_c}}\widetilde{\mathbf{U}}^{\top}\mathbf{E}_{X0}(I-\widetilde{P}_S)\mathbf{E}_{X0}a_n\right\rVert\leq\frac{1}{\sqrt{n_c}}\lVert\mathbf{E}_{X0}\rVert_{\mathrm{op}}^2\lVert a_n\rVert=O_p\left(\frac{\sqrt{n_c}}{p}\right), n c 1 U ⊤ E X 0 ( I − P S ) E X 0 a n ≤ n c 1 ∥ E X 0 ∥ op 2 ∥ a n ∥ = O p ( p n c ) ,
where ∥ E X 0 ∥ o p 2 = O p ( n c / p ) \lVert\mathbf{E}_{X0}\rVert_{\mathrm{op}}^2=O_p(n_c/p) ∥ E X 0 ∥ op 2 = O p ( n c / p ) by Lemma C.2 (iii). For the mediator part, conditional on ( G t , E X 0 ) (\mathcal{G}_t,\mathbf{E}_{X0}) ( G t , E X 0 ) , the errors in R n M R_n^M R n M are independent and mean zero. Hence,
E [ ∥ 1 n c U ~ ⊤ E X 0 ( I − P ~ S ) R n M ∥ 2 | G t , E X 0 ] ≤ c n c ∥ E X 0 ∥ o p 2 r M , n 2 = O p ( 1 p ) O p ( 1 q + 1 n t ) . \mathbb{E}\left[\left\lVert\frac{1}{\sqrt{n_c}}\widetilde{\mathbf{U}}^{\top}\mathbf{E}_{X0}(I-\widetilde{P}_S)R_n^M\right\rVert^2\middle|\mathcal{G}_t,\mathbf{E}_{X0}\right]\leq\frac{c}{n_c}\lVert\mathbf{E}_{X0}\rVert_{\mathrm{op}}^2r_{M,n}^2=O_p\left(\frac{1}{p}\right)O_p\left(\frac{1}{q}+\frac{1}{n_t}\right). E [ n c 1 U ⊤ E X 0 ( I − P S ) R n M 2 G t , E X 0 ] ≤ n c c ∥ E X 0 ∥ op 2 r M , n 2 = O p ( p 1 ) O p ( q 1 + n t 1 ) .
Thus, combining the two parts, we get
∥ L 6 , 1 ∥ = O p ( n c p + 1 p ( 1 q + 1 n t ) ) = o p ( 1 ) , \lVert L_{6,1}\rVert= O_p\left(\frac{\sqrt{n_c}}{p}+\frac{1}{\sqrt{p}}\left(\frac{1}{\sqrt{q}}+\frac{1}{\sqrt{n_t}}\right)\right)=o_p(1), ∥ L 6 , 1 ∥ = O p ( p n c + p 1 ( q 1 + n t 1 ) ) = o p ( 1 ) ,
under Assumption 5.2(ii). For L 6 , 2 L_{6,2} L 6 , 2 , we again consider the covariate and mediator parts separately. Write F X 1 = 1 μ X ⊤ + F X \mathbf{F}_{X1}=\mathbf{1}\mu_X^{\top}+\mathbf{F}_X F X 1 = 1 μ X ⊤ + F X , where F X \mathbf{F}_X F X contains the centered factors. For the mean contribution, Cauchy–Schwarz gives
∥ 1 n c μ X 1 ⊤ P ~ S E X 0 a n ∥ ≤ ∥ μ X ∥ n c ( 1 ⊤ P ~ S 1 ) 1 / 2 ∥ E X 0 ∥ o p ∥ a n ∥ = O p ( p − 1 / 2 ) , \left\lVert\frac{1}{\sqrt{n_c}}\mu_X\mathbf{1}^{\top}\widetilde{\mathbf{P}}_S\mathbf{E}_{X0}\mathbf{a}_n\right\rVert\leq\frac{\lVert\mu_X\rVert}{\sqrt{n_c}}\left(\mathbf{1}^{\top}\widetilde{\mathbf{P}}_S\mathbf{1}\right)^{1/2}\lVert\mathbf{E}_{X0}\rVert_{\mathrm{op}}\lVert\mathbf{a}_n\rVert=O_p(p^{-1/2}), n c 1 μ X 1 ⊤ P S E X 0 a n ≤ n c ∥ μ X ∥ ( 1 ⊤ P S 1 ) 1/2 ∥ E X 0 ∥ op ∥ a n ∥ = O p ( p − 1/2 ) ,
where we use 1 ⊤ P ~ S 1 = O p ( 1 ) \mathbf{1}^{\top}\widetilde{\mathbf{P}}_S\mathbf{1}=O_p(1) 1 ⊤ P S 1 = O p ( 1 ) by Lemma C.3, together with ∥ E X 0 ∥ o p = O p ( n c / p ) \lVert\mathbf{E}_{X0}\rVert_{\mathrm{op}}=O_p(\sqrt{n_c/p}) ∥ E X 0 ∥ op = O p ( n c / p ) . For the fluctuation contribution, conditioning on ( G t , E X 0 ) (\mathcal{G}_t,\mathbf{E}_{X0}) ( G t , E X 0 ) gives
E [ ∥ 1 n c F X ⊤ P ~ S E X 0 a n ∥ 2 ∣ G t , E X 0 ] ≤ c n c ∥ P ~ S E X 0 a n ∥ 2 ≤ c n c ∥ E X 0 ∥ o p 2 ∥ a n ∥ 2 = O p ( p − 1 ) , \mathbb{E}\left[\left.\left\lVert\frac{1}{\sqrt{n_c}}\mathbf{F}_X^{\top}\widetilde{\mathbf{P}}_S\mathbf{E}_{X0}\mathbf{a}_n\right\rVert^2\right|\mathcal{G}_t,\mathbf{E}_{X0}\right]\leq\frac{c}{n_c}\lVert\widetilde{\mathbf{P}}_S\mathbf{E}_{X0}\mathbf{a}_n\rVert^2\leq\frac{c}{n_c}\lVert\mathbf{E}_{X0}\rVert_{\mathrm{op}}^2\lVert\mathbf{a}_n\rVert^2=O_p(p^{-1}), E [ n c 1 F X ⊤ P S E X 0 a n 2 G t , E X 0 ] ≤ n c c ∥ P S E X 0 a n ∥ 2 ≤ n c c ∥ E X 0 ∥ op 2 ∥ a n ∥ 2 = O p ( p − 1 ) ,
since the centered factors are independent of the control proxy errors and have bounded covariance. Thus, the covariate contribution is O p ( p − 1 / 2 ) O_p(p^{-1/2}) O p ( p − 1/2 ) . For the mediator part, conditional on ( G t , F X 1 , E X 0 ) (\mathcal{G}_t,\mathbf{F}_{X1},\mathbf{E}_{X0}) ( G t , F X 1 , E X 0 ) , the vector R n M \mathbf{R}_n^M R n M has mean zero and covariance bounded by r M , n 2 I n c r_{M,n}^2\mathbf{I}_{n_c} r M , n 2 I n c . Therefore,
E [ ∥ 1 n c R ~ F X 1 ⊤ P ~ S R n M ∥ 2 ∣ G t , F X 1 , E X 0 ] ≤ c n c ∥ R ~ ∥ o p 2 tr ( F X 1 ⊤ P ~ S F X 1 ) r M , n 2 = O p ( 1 q + 1 n t ) , \mathbb{E}\left[\left.\left\lVert\frac{1}{\sqrt{n_c}}\widetilde{\mathbf{R}}\mathbf{F}_{X1}^{\top}\widetilde{\mathbf{P}}_S\mathbf{R}_n^M\right\rVert^2\right|\mathcal{G}_t,\mathbf{F}_{X1},\mathbf{E}_{X0}\right]\leq\frac{c}{n_c}\lVert\widetilde{\mathbf{R}}\rVert_{\mathrm{op}}^2\operatorname{tr}(\mathbf{F}_{X1}^{\top}\widetilde{\mathbf{P}}_S\mathbf{F}_{X1})r_{M,n}^2=O_p\left(\frac{1}{q}+\frac{1}{n_t}\right), E [ n c 1 R F X 1 ⊤ P S R n M 2 G t , F X 1 , E X 0 ] ≤ n c c ∥ R ∥ op 2 tr ( F X 1 ⊤ P S F X 1 ) r M , n 2 = O p ( q 1 + n t 1 ) ,
using ∥ R ~ ∥ o p = O ( 1 ) \lVert\widetilde{\mathbf{R}}\rVert_{\mathrm{op}}=O(1) ∥ R ∥ op = O ( 1 ) , ∥ P ~ S ∥ o p ≤ 1 \lVert\widetilde{\mathbf{P}}_S\rVert_{\mathrm{op}}\leq1 ∥ P S ∥ op ≤ 1 , and n c − 1 ∥ F X 1 ∥ F 2 = O p ( 1 ) n_c^{-1}\lVert\mathbf{F}_{X1}\rVert_F^2=O_p(1) n c − 1 ∥ F X 1 ∥ F 2 = O p ( 1 ) . Hence, the mediator contribution is O p ( q − 1 / 2 + n t − 1 / 2 ) O_p(q^{-1/2}+n_t^{-1/2}) O p ( q − 1/2 + n t − 1/2 ) . Thus, combining the covariate and mediator parts gives us
∥ L 6 , 2 ∥ = O p ( 1 p + 1 q + 1 n t ) = o p ( 1 ) . \lVert L_{6,2}\rVert=O_p\left(\frac{1}{\sqrt{p}}+\frac{1}{\sqrt{q}}+\frac{1}{\sqrt{n_t}}\right)=o_p(1). ∥ L 6 , 2 ∥ = O p ( p 1 + q 1 + n t 1 ) = o p ( 1 ) .
Now, combining the two bounds with the O p ( 1 ) O_p(1) O p ( 1 ) outside factor, and noting that n c / p = O ( p − 1 / 2 ) \sqrt{n_c}/p=O(p^{-1/2}) n c / p = O ( p − 1/2 ) under Assumption 5.2(ii), we obtain
∣ L 6 ∣ = O p ( 1 n t + 1 p + 1 q ) = o p ( 1 ) . \lvert L_6\rvert=O_p\left(\frac{1}{\sqrt{n_t}}+\frac{1}{\sqrt{p}}+\frac{1}{\sqrt{q}}\right)=o_p(1). ∣ L 6 ∣ = O p ( n t 1 + p 1 + q 1 ) = o p ( 1 ) .
L 7 = n c / n t δ 0 ⊤ J 3 + o p ( 1 ) L_7=\sqrt{n_c/n_t}\,\delta_0^{\top}J_3+o_p(1) L 7 = n c / n t δ 0 ⊤ J 3 + o p ( 1 ) . Unlike the bias terms above, L 7 L_7 L 7 does not vanish, so we identify its first-order form. Recall that L 7 = n c δ 0 ⊤ ( H M ⊤ γ ^ 1 − γ 1 ) L_7=\sqrt{n_c}\,\delta_0^{\top}(\mathbf{H}_M^{\top}\widehat{\gamma}_1-\gamma_1) L 7 = n c δ 0 ⊤ ( H M ⊤ γ 1 − γ 1 ) . By Lemma C.6, we have
n t ( H M ⊤ γ ^ 1 − γ 1 ) = − J 1 − J 2 + J 3 + J 4 , J 1 , J 2 , J 4 = o p ( 1 ) , \sqrt{n_t}(\mathbf{H}_M^{\top}\widehat{\gamma}_1-\gamma_1)=-J_1-J_2+J_3+J_4,\qquad J_1,J_2,J_4=o_p(1), n t ( H M ⊤ γ 1 − γ 1 ) = − J 1 − J 2 + J 3 + J 4 , J 1 , J 2 , J 4 = o p ( 1 ) ,
where the remaining term is
J 3 = P q ˉ H 1 ⊤ M − 1 H 1 1 n t F 1 ⊤ ϵ 1 = P q ˉ Ω 1 − 1 1 n t ∑ i : A i = 1 f 1 , i ϵ 1 , i + o p ( 1 ) , J_3=\mathbf{P}_{\bar{q}}\mathbf{H}_1^{\top}\mathbf{M}^{-1}\mathbf{H}_1\frac{1}{\sqrt{n_t}}\mathbf{F}_1^{\top}\boldsymbol{\epsilon}_1=\mathbf{P}_{\bar{q}}\boldsymbol{\Omega}_1^{-1}\frac{1}{\sqrt{n_t}}\sum_{i:A_i=1}\mathbf{f}_{1,i}\epsilon_{1,i}+o_p(1), J 3 = P q ˉ H 1 ⊤ M − 1 H 1 n t 1 F 1 ⊤ ϵ 1 = P q ˉ Ω 1 − 1 n t 1 i : A i = 1 ∑ f 1 , i ϵ 1 , i + o p ( 1 ) ,
using H 1 ⊤ M − 1 H 1 − Ω 1 − 1 = o p ( 1 ) \mathbf{H}_1^{\top}\mathbf{M}^{-1}\mathbf{H}_1-\boldsymbol{\Omega}_1^{-1}=o_p(1) H 1 ⊤ M − 1 H 1 − Ω 1 − 1 = o p ( 1 ) from Lemma C.6. Since L 7 L_7 L 7 is on the control n c \sqrt{n_c} n c scale, while the expansion above is on the treated n t \sqrt{n_t} n t scale, we keep the ratio when substituting:
L 7 = n c n t δ 0 ⊤ ( − J 1 − J 2 + J 3 + J 4 ) = n c n t δ 0 ⊤ J 3 + o p ( 1 ) . L_7=\sqrt{\frac{n_c}{n_t}}\,\delta_0^{\top}(-J_1-J_2+J_3+J_4)=\sqrt{\frac{n_c}{n_t}}\,\delta_0^{\top}J_3+o_p(1). L 7 = n t n c δ 0 ⊤ ( − J 1 − J 2 + J 3 + J 4 ) = n t n c δ 0 ⊤ J 3 + o p ( 1 ) .
Here, ∣ δ 0 ⊤ J j ∣ ≤ ∥ δ 0 ∥ ∥ J j ∥ = o p ( 1 ) \lvert\delta_0^{\top}J_j\rvert\leq\lVert\delta_0\rVert\lVert J_j\rVert=o_p(1) ∣ δ 0 ⊤ J j ∣ ≤ ∥ δ 0 ∥ ∥ J j ∥ = o p ( 1 ) for j = 1 , 2 , 4 j=1,2,4 j = 1 , 2 , 4 , since ∥ δ 0 ∥ = O ( 1 ) \lVert\delta_0\rVert=O(1) ∥ δ 0 ∥ = O ( 1 ) by Assumption 3.2(i). Also, n c / n t = O p ( 1 ) n_c/n_t=O_p(1) n c / n t = O p ( 1 ) since the treated and control sample proportions converge to positive limits. In particular,
δ 0 ⊤ J 3 = ( P q ˉ ⊤ δ 0 ) ⊤ Ω 1 − 1 1 n t ∑ i : A i = 1 f 1 , i ϵ 1 , i + o p ( 1 ) . \delta_0^{\top}J_3=(\mathbf{P}_{\bar{q}}^{\top}\delta_0)^{\top}\boldsymbol{\Omega}_1^{-1}\frac{1}{\sqrt{n_t}}\sum_{i:A_i=1}\mathbf{f}_{1,i}\epsilon_{1,i}+o_p(1). δ 0 ⊤ J 3 = ( P q ˉ ⊤ δ 0 ) ⊤ Ω 1 − 1 n t 1 i : A i = 1 ∑ f 1 , i ϵ 1 , i + o p ( 1 ) .
For regression fold k k k , let n k n_k n k denote the fold size, with treated and control counts n k t n_k^t n k t and n k c n_k^c n k c . Since
n k t n k ⟶ p π 1 , n k c n k ⟶ p π 0 , \frac{n_k^t}{n_k}\overset{p}{\longrightarrow}\pi_1,\qquad\frac{n_k^c}{n_k}\overset{p}{\longrightarrow}\pi_0, n k n k t ⟶ p π 1 , n k n k c ⟶ p π 0 ,
we place the treated and control expansions on the common n k \sqrt{n_k} n k scale. Now, combining the bounds above, we have
G 1 = G 2 = G 4 = o p ( 1 ) , L 1 = L 2 = L 4 = L 5 = L 6 = o p ( 1 ) , L 7 = n c n t δ 0 T J 3 + o p ( 1 ) . G_1 = G_2 = G_4 = o_p(1), \qquad L_1 = L_2 = L_4 = L_5 = L_6 = o_p(1), \qquad L_7 = \sqrt{\frac{n_c}{n_t}}\,\delta_0^{\mathsf T}J_3 + o_p(1). G 1 = G 2 = G 4 = o p ( 1 ) , L 1 = L 2 = L 4 = L 5 = L 6 = o p ( 1 ) , L 7 = n t n c δ 0 T J 3 + o p ( 1 ) .
Combining the bounds above, we get that
n k ( α ^ 1 − α 1 ) = n k n k t G 3 + o p ( 1 ) , \sqrt{n_k}(\hat{\alpha}_1-\alpha_1)=\sqrt{\frac{n_k}{n_k^t}}G_3+o_p(1), n k ( α ^ 1 − α 1 ) = n k t n k G 3 + o p ( 1 ) ,
n k ( γ ^ 1 T δ 0 − γ 1 T δ 0 ) = n k n k c L 3 + n k n k c δ 0 T J 3 + o p ( 1 ) . (64) \sqrt{n_k}\left(\hat{\gamma}_1^{\mathsf T}\delta_0-\gamma_1^{\mathsf T}\delta_0\right)=\sqrt{\frac{n_k}{n_k^c}}L_3+\sqrt{\frac{n_k}{n_k^c}}\delta_0^{\mathsf T}J_3+o_p(1). \tag*{(64)} n k ( γ ^ 1 T δ 0 − γ 1 T δ 0 ) = n k c n k L 3 + n k c n k δ 0 T J 3 + o p ( 1 ) . (64)
Therefore, we have that
n k ( θ ^ 0 , k − θ 0 ) = n k n k t ( G 3 + δ 0 T J 3 ) + n k n k c L 3 + o p ( 1 ) . \sqrt{n_k}(\hat{\theta}_{0,k}-\theta_0)=\sqrt{\frac{n_k}{n_k^t}}\left(G_3+\delta_0^{\mathsf T}J_3\right)+\sqrt{\frac{n_k}{n_k^c}}L_3+o_p(1). n k ( θ ^ 0 , k − θ 0 ) = n k t n k ( G 3 + δ 0 T J 3 ) + n k c n k L 3 + o p ( 1 ) .
The remaining terms are G 3 G_3 G 3 , L 3 L_3 L 3 , and δ 0 T J 3 \delta_0^{\mathsf T}J_3 δ 0 T J 3 . We next derive their joint asymptotic distribution.
Asymptotic Normality of θ ^ 0 \hat{\theta}_0 θ ^ 0
The remaining terms involve the sandwich matrices H 1 T M − 1 H 1 H_1^{\mathsf T}M^{-1}H_1 H 1 T M − 1 H 1 for G 3 G_3 G 3 and δ 0 T J 3 \delta_0^{\mathsf T}J_3 δ 0 T J 3 , and H ~ X 1 T M ~ − 1 H ~ X 1 \widetilde{H}_{X_1}^{\mathsf T}\widetilde{M}^{-1}\widetilde{H}_{X_1} H X 1 T M − 1 H X 1 for L 3 L_3 L 3 . We proceed in six steps. Step 1 shows that these matrices converge to Ω 1 − 1 \Omega_1^{-1} Ω 1 − 1 and Ω X 0 − 1 \Omega_{X_0}^{-1} Ω X 0 − 1 . Steps 2–3 express the remaining terms as sums of i.i.d. mean-zero variables. Step 4 combines these terms into a single influence function and derives its variance. Step 5 establishes asymptotic normality for one fold, while Step 6 extends the result to the cross-fitted estimator. We then show that σ 2 \sigma^2 σ 2 is bounded above and below.
Throughout this part, we work on one regression fold D D D of size m = ∣ D ∣ m=|D| m = ∣ D ∣ , with treated and control counts n t = ∣ { i ∈ D : A i = 1 } ∣ n_t=|\{i\in D:A_i=1\}| n t = ∣ { i ∈ D : A i = 1 } ∣ and n c = ∣ { i ∈ D : A i = 0 } ∣ n_c=|\{i\in D:A_i=0\}| n c = ∣ { i ∈ D : A i = 0 } ∣ . Under an approximately equal split, we have that n t / m → p π 1 n_t/m\to_p\pi_1 n t / m → p π 1 and n c / m → p π 0 n_c/m\to_p\pi_0 n c / m → p π 0 . We consider the full-sample estimator in Step 6.
Convergence of sandwich matrices
By Lemma C.5 , H 1 = U R H_1=UR H 1 = U R , where U T U = I U^{\mathsf T}U=I U T U = I and R R R is square and invertible, with ν min ( R ) ≥ c R > 0 \nu_{\min}(R)\ge c_R>0 ν m i n ( R ) ≥ c R > 0 . Moreover, we have
H 1 T M − 1 H 1 = R T ( D + E n ) − 1 R , D = 1 n t R F 1 T F 1 R T . H_1^{\mathsf T}M^{-1}H_1=R^{\mathsf T}(D+E_n)^{-1}R,\qquad D=\frac{1}{n_t}RF_1^{\mathsf T}F_1R^{\mathsf T}. H 1 T M − 1 H 1 = R T ( D + E n ) − 1 R , D = n t 1 R F 1 T F 1 R T .
Now, conditional on the training fold, define D ∞ = R Ω 1 R T D_\infty=R\Omega_1R^{\mathsf T} D ∞ = R Ω 1 R T . Since R R R is invertible and Ω 1 ≻ 0 \Omega_1\succ0 Ω 1 ≻ 0 , we have λ min ( D ∞ ) ≥ ν min 2 ( R ) λ min ( Ω 1 ) ≥ c c R 2 > 0 \lambda_{\min}(D_\infty)\ge\nu_{\min}^2(R)\lambda_{\min}(\Omega_1)\ge c c_R^2>0 λ m i n ( D ∞ ) ≥ ν m i n 2 ( R ) λ m i n ( Ω 1 ) ≥ c c R 2 > 0 . Furthermore, we have
S 1 : = R T D ∞ − 1 R = R T ( R Ω 1 R T ) − 1 R = R T R − T Ω 1 − 1 R − 1 R = Ω 1 − 1 . (65) S_1:=R^{\mathsf T}D_\infty^{-1}R=R^{\mathsf T}(R\Omega_1R^{\mathsf T})^{-1}R=R^{\mathsf T}R^{-\mathsf T}\Omega_1^{-1}R^{-1}R=\Omega_1^{-1}. \tag*{(65)} S 1 := R T D ∞ − 1 R = R T ( R Ω 1 R T ) − 1 R = R T R − T Ω 1 − 1 R − 1 R = Ω 1 − 1 . (65)
This is for square invertible R R R , and we now show that the random sandwich converges to this.
(a) ∥ D − D ∞ ∥ o p = o p ( 1 ) \|D-D_\infty\|_{\mathrm{op}}=o_p(1) ∥ D − D ∞ ∥ op = o p ( 1 ) . The treated outer products f 1 , i f 1 , i T f_{1,i}f_{1,i}^{\mathsf T} f 1 , i f 1 , i T are i.i.d. with conditional mean Ω 1 \Omega_1 Ω 1 and finite fourth moments by Assumption 5.1(i). For each fixed pair ( j , k ) (j,k) ( j , k ) , applying the central limit theorem entrywise gives
n t { ( 1 n t F 1 T F 1 ) j k − ( Ω 1 ) j k } = O p ( 1 ) . \sqrt{n_t}\left\{\left(\frac{1}{n_t}F_1^{\mathsf T}F_1\right)_{jk}-(\Omega_1)_{jk}\right\}=O_p(1). n t { ( n t 1 F 1 T F 1 ) j k − ( Ω 1 ) j k } = O p ( 1 ) .
Since the factor dimension is fixed, entrywise convergence also gives ∥ 1 n t F 1 T F 1 − Ω 1 ∥ o p = O p ( n t − 1 / 2 ) \left\|\frac{1}{n_t}F_1^{\mathsf T}F_1-\Omega_1\right\|_{\mathrm{op}}=O_p(n_t^{-1/2}) n t 1 F 1 T F 1 − Ω 1 op = O p ( n t − 1/2 ) . Therefore,
∥ D − D ∞ ∥ o p = ∥ R ( 1 n t F 1 T F 1 − Ω 1 ) R T ∥ o p ≤ ∥ R ∥ o p 2 O p ( n t − 1 / 2 ) = O p ( n t − 1 / 2 ) , \|D-D_\infty\|_{\mathrm{op}}=\left\|R\left(\frac{1}{n_t}F_1^{\mathsf T}F_1-\Omega_1\right)R^{\mathsf T}\right\|_{\mathrm{op}}\le\|R\|_{\mathrm{op}}^2O_p(n_t^{-1/2})=O_p(n_t^{-1/2}), ∥ D − D ∞ ∥ op = R ( n t 1 F 1 T F 1 − Ω 1 ) R T op ≤ ∥ R ∥ op 2 O p ( n t − 1/2 ) = O p ( n t − 1/2 ) ,
using ∥ R ∥ o p = O p ( 1 ) \|R\|_{\mathrm{op}}=O_p(1) ∥ R ∥ op = O p ( 1 ) from Lemma C.5 .
(b) ∥ ( D + E n ) − 1 − D ∞ − 1 ∥ o p = o p ( 1 ) \|(D+E_n)^{-1}-D_\infty^{-1}\|_{\mathrm{op}}=o_p(1) ∥ ( D + E n ) − 1 − D ∞ − 1 ∥ op = o p ( 1 ) . Using the identity A − 1 − B − 1 = A − 1 ( B − A ) B − 1 A^{-1}-B^{-1}=A^{-1}(B-A)B^{-1} A − 1 − B − 1 = A − 1 ( B − A ) B − 1 with A = D + E n A=D+E_n A = D + E n and B = D ∞ B=D_\infty B = D ∞ , we have ( D + E n ) − 1 − D ∞ − 1 = ( D + E n ) − 1 ( D ∞ − D − E n ) D ∞ − 1 (D+E_n)^{-1}-D_\infty^{-1}=(D+E_n)^{-1}(D_\infty-D-E_n)D_\infty^{-1} ( D + E n ) − 1 − D ∞ − 1 = ( D + E n ) − 1 ( D ∞ − D − E n ) D ∞ − 1 . Taking operator norms and using sub-multiplicativity, we obtain
∥ ( D + E n ) − 1 − D ∞ − 1 ∥ o p ≤ ∥ ( D + E n ) − 1 ∥ o p ( ∥ D − D ∞ ∥ o p + ∥ E n ∥ o p ) ∥ D ∞ − 1 ∥ o p = o p ( 1 ) . (66) \|(D+E_n)^{-1}-D_\infty^{-1}\|_{\mathrm{op}}\le\|(D+E_n)^{-1}\|_{\mathrm{op}}(\|D-D_\infty\|_{\mathrm{op}}+\|E_n\|_{\mathrm{op}})\|D_\infty^{-1}\|_{\mathrm{op}}=o_p(1). \tag*{(66)} ∥ ( D + E n ) − 1 − D ∞ − 1 ∥ op ≤ ∥ ( D + E n ) − 1 ∥ op ( ∥ D − D ∞ ∥ op + ∥ E n ∥ op ) ∥ D ∞ − 1 ∥ op = o p ( 1 ) . (66)
since ∥ ( D + E n ) − 1 ∥ o p = O p ( 1 ) \|(D+E_n)^{-1}\|_{\mathrm{op}}=O_p(1) ∥ ( D + E n ) − 1 ∥ op = O p ( 1 ) by Lemma C.5 , ∥ D ∞ − 1 ∥ o p = O p ( 1 ) \|D_\infty^{-1}\|_{\mathrm{op}}=O_p(1) ∥ D ∞ − 1 ∥ op = O p ( 1 ) , ∥ D − D ∞ ∥ o p = O p ( n t − 1 / 2 ) \|D-D_\infty\|_{\mathrm{op}}=O_p(n_t^{-1/2}) ∥ D − D ∞ ∥ op = O p ( n t − 1/2 ) , and ∥ E n ∥ o p = o p ( 1 ) \|E_n\|_{\mathrm{op}}=o_p(1) ∥ E n ∥ op = o p ( 1 ) by (C.9). Therefore, combining this with Equation (C.39), and using ∥ R ∥ o p = O p ( 1 ) \|R\|_{\mathrm{op}}=O_p(1) ∥ R ∥ op = O p ( 1 ) , we get that
∥ H 1 T M − 1 H 1 − Ω 1 − 1 ∥ o p = ∥ R T [ ( D + E n ) − 1 − D ∞ − 1 ] R ∥ o p ≤ ∥ R ∥ o p 2 o p ( 1 ) = o p ( 1 ) . \left\|H_1^{\mathsf T}M^{-1}H_1-\Omega_1^{-1}\right\|_{\mathrm{op}}=\left\|R^{\mathsf T}\left[(D+E_n)^{-1}-D_\infty^{-1}\right]R\right\|_{\mathrm{op}}\le\|R\|_{\mathrm{op}}^2o_p(1)=o_p(1). H 1 T M − 1 H 1 − Ω 1 − 1 op = R T [ ( D + E n ) − 1 − D ∞ − 1 ] R op ≤ ∥ R ∥ op 2 o p ( 1 ) = o p ( 1 ) .
The same argument applies to the control side with H X 1 = U ~ R ~ \mathbf{H}_{X1}=\widetilde{\mathbf{U}}\widetilde{\mathbf{R}} H X 1 = U R and D ~ ∞ = R ~ Σ X 0 R ~ ⊤ \widetilde{\mathbf{D}}_{\infty}=\widetilde{\mathbf{R}}\mathbf{\Sigma}_{X0}\widetilde{\mathbf{R}}^{\top} D ∞ = R Σ X 0 R ⊤ , for which R ~ ⊤ D ~ ∞ − 1 R ~ = Ω X 0 − 1 \widetilde{\mathbf{R}}^{\top}\widetilde{\mathbf{D}}_{\infty}^{-1}\widetilde{\mathbf{R}}=\mathbf{\Omega}_{X0}^{-1} R ⊤ D ∞ − 1 R = Ω X 0 − 1 . Thus,
∥ H 1 ⊤ M − 1 H 1 − Ω 1 − 1 ∥ o p = o p ( 1 ) , ∥ H X 1 ⊤ M ~ − 1 H X 1 − Ω X 0 − 1 ∥ o p = o p ( 1 ) . (67) \left\|\mathbf{H}_{1}^{\top}M^{-1}\mathbf{H}_{1}-\mathbf{\Omega}_{1}^{-1}\right\|_{\mathrm{op}}=o_{p}(1),\qquad\left\|\mathbf{H}_{X1}^{\top}\widetilde{M}^{-1}\mathbf{H}_{X1}-\mathbf{\Omega}_{X0}^{-1}\right\|_{\mathrm{op}}=o_{p}(1). \tag*{(67)} H 1 ⊤ M − 1 H 1 − Ω 1 − 1 op = o p ( 1 ) , H X 1 ⊤ M − 1 H X 1 − Ω X 0 − 1 op = o p ( 1 ) . (67)
Step 2: G 3 + δ 0 ⊤ J 3 G_{3}+\delta_{0}^{\top}J_{3} G 3 + δ 0 ⊤ J 3 as a treated i.i.d. average. Recall that δ 0 ⊤ J 3 = ( P q ˉ ⊤ δ 0 ) ⊤ H 1 ⊤ M − 1 H 1 1 n t F 1 ⊤ ϵ 1 \delta_{0}^{\top}J_{3}=(\mathbf{P}_{\bar{q}}^{\top}\delta_{0})^{\top}\mathbf{H}_{1}^{\top}M^{-1}\mathbf{H}_{1}\frac{1}{\sqrt{n_{t}}}\mathbf{F}_{1}^{\top}\epsilon_{1} δ 0 ⊤ J 3 = ( P q ˉ ⊤ δ 0 ) ⊤ H 1 ⊤ M − 1 H 1 n t 1 F 1 ⊤ ϵ 1 has the same structure as G 3 = e 1 ⊤ H 1 ⊤ M − 1 H 1 1 n t F 1 ⊤ ϵ 1 G_{3}=\mathbf{e}_{1}^{\top}\mathbf{H}_{1}^{\top}M^{-1}\mathbf{H}_{1}\frac{1}{\sqrt{n_{t}}}\mathbf{F}_{1}^{\top}\epsilon_{1} G 3 = e 1 ⊤ H 1 ⊤ M − 1 H 1 n t 1 F 1 ⊤ ϵ 1 . The two terms can therefore be combined using a 1 = e 1 + P q ˉ ⊤ δ 0 \mathbf{a}_{1}=\mathbf{e}_{1}+\mathbf{P}_{\bar{q}}^{\top}\delta_{0} a 1 = e 1 + P q ˉ ⊤ δ 0 , as defined before Theorem 5.2. Since P q ˉ ⊤ δ 0 \mathbf{P}_{\bar{q}}^{\top}\delta_{0} P q ˉ ⊤ δ 0 lies in the mediator block, its intercept coordinate is zero, so
∥ a 1 ∥ 2 = 1 + ∥ P q ˉ ⊤ δ 0 ∥ 2 , 1 ≤ ∥ a 1 ∥ = O ( 1 ) , (68) \|\mathbf{a}_{1}\|^{2}=1+\|\mathbf{P}_{\bar{q}}^{\top}\delta_{0}\|^{2},\qquad1\leq\|\mathbf{a}_{1}\|=O(1), \tag*{(68)} ∥ a 1 ∥ 2 = 1 + ∥ P q ˉ ⊤ δ 0 ∥ 2 , 1 ≤ ∥ a 1 ∥ = O ( 1 ) , (68)
where ∥ δ 0 ∥ = O ( 1 ) \|\delta_{0}\|=O(1) ∥ δ 0 ∥ = O ( 1 ) by Assumption 3.2(i). Combining the two terms, we have
G 3 + δ 0 ⊤ J 3 = a 1 ⊤ H 1 ⊤ M − 1 H 1 1 n t F 1 ⊤ ϵ 1 = a 1 ⊤ Ω 1 − 1 1 n t F 1 ⊤ ϵ 1 + a 1 ⊤ ( H 1 ⊤ M − 1 H 1 − Ω 1 − 1 ) 1 n t F 1 ⊤ ϵ 1 . \begin{aligned}
G_{3}+\delta_{0}^{\top}J_{3}
&=\mathbf{a}_{1}^{\top}\mathbf{H}_{1}^{\top}M^{-1}\mathbf{H}_{1}\frac{1}{\sqrt{n_{t}}}\mathbf{F}_{1}^{\top}\epsilon_{1}\\
&=\mathbf{a}_{1}^{\top}\mathbf{\Omega}_{1}^{-1}\frac{1}{\sqrt{n_{t}}}\mathbf{F}_{1}^{\top}\epsilon_{1}+\mathbf{a}_{1}^{\top}\left(\mathbf{H}_{1}^{\top}M^{-1}\mathbf{H}_{1}-\mathbf{\Omega}_{1}^{-1}\right)\frac{1}{\sqrt{n_{t}}}\mathbf{F}_{1}^{\top}\epsilon_{1}.
\end{aligned} G 3 + δ 0 ⊤ J 3 = a 1 ⊤ H 1 ⊤ M − 1 H 1 n t 1 F 1 ⊤ ϵ 1 = a 1 ⊤ Ω 1 − 1 n t 1 F 1 ⊤ ϵ 1 + a 1 ⊤ ( H 1 ⊤ M − 1 H 1 − Ω 1 − 1 ) n t 1 F 1 ⊤ ϵ 1 .
The second term is o p ( 1 ) o_{p}(1) o p ( 1 ) by (C.41), provided ∥ n t − 1 / 2 F 1 ⊤ ϵ 1 ∥ = O p ( 1 ) \|n_{t}^{-1/2}\mathbf{F}_{1}^{\top}\epsilon_{1}\|=O_{p}(1) ∥ n t − 1/2 F 1 ⊤ ϵ 1 ∥ = O p ( 1 ) . By Assumption 3.1(ii), ϵ 1 \epsilon_{1} ϵ 1 is mean zero and independent of F 1 \mathbf{F}_{1} F 1 , while Assumption 5.1(i) gives uniformly bounded second moments. Therefore,
E [ ∥ 1 n t F 1 ⊤ ϵ 1 ∥ 2 | F 1 ] = tr ( 1 n t F 1 ⊤ E ( ϵ 1 ϵ 1 ⊤ ∣ F 1 ) F 1 ) ≤ C tr ( 1 n t F 1 ⊤ F 1 ) = O p ( 1 ) . (69) \mathbb{E}\left[\left\|\frac{1}{\sqrt{n_{t}}}\mathbf{F}_{1}^{\top}\epsilon_{1}\right\|^{2}\middle|\mathbf{F}_{1}\right]=\operatorname{tr}\left(\frac{1}{n_{t}}\mathbf{F}_{1}^{\top}\mathbb{E}(\epsilon_{1}\epsilon_{1}^{\top}\mid\mathbf{F}_{1})\mathbf{F}_{1}\right)\leq C\operatorname{tr}\left(\frac{1}{n_{t}}\mathbf{F}_{1}^{\top}\mathbf{F}_{1}\right)=O_{p}(1). \tag*{(69)} E [ n t 1 F 1 ⊤ ϵ 1 2 F 1 ] = tr ( n t 1 F 1 ⊤ E ( ϵ 1 ϵ 1 ⊤ ∣ F 1 ) F 1 ) ≤ C tr ( n t 1 F 1 ⊤ F 1 ) = O p ( 1 ) . (69)
Hence ∥ n t − 1 / 2 F 1 ⊤ ϵ 1 ∥ = O p ( 1 ) \|n_{t}^{-1/2}\mathbf{F}_{1}^{\top}\epsilon_{1}\|=O_{p}(1) ∥ n t − 1/2 F 1 ⊤ ϵ 1 ∥ = O p ( 1 ) by the second-moment bound. Together with ∥ a 1 ∥ = O ( 1 ) \|\mathbf{a}_{1}\|=O(1) ∥ a 1 ∥ = O ( 1 ) , this shows that the second term above is o p ( 1 ) o_{p}(1) o p ( 1 ) . We therefore obtain
G 3 + δ 0 ⊤ J 3 = 1 n t ∑ i : A i = 1 ξ 1 , i + o p ( 1 ) , ξ 1 , i = ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i . (70) G_{3}+\delta_{0}^{\top}J_{3}=\frac{1}{\sqrt{n_{t}}}\sum_{i:A_{i}=1}\xi_{1,i}+o_{p}(1),\qquad\xi_{1,i}=(\mathbf{\Omega}_{1}^{-1}\mathbf{a}_{1})^{\top}\mathbf{f}_{1,i}\epsilon_{1,i}. \tag*{(70)} G 3 + δ 0 ⊤ J 3 = n t 1 i : A i = 1 ∑ ξ 1 , i + o p ( 1 ) , ξ 1 , i = ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i . (70)
By Assumption 3.1(i)–(ii), the ξ 1 , i \xi_{1,i} ξ 1 , i are i.i.d. across treated observations and have mean zero. In particular, E [ ϵ 1 , i ∣ f 1 , i , A i = 1 ] = 0 \mathbb{E}[\epsilon_{1,i}\mid\mathbf{f}_{1,i},A_{i}=1]=0 E [ ϵ 1 , i ∣ f 1 , i , A i = 1 ] = 0 implies E [ ξ 1 , i ∣ A i = 1 ] = 0 \mathbb{E}[\xi_{1,i}\mid A_{i}=1]=0 E [ ξ 1 , i ∣ A i = 1 ] = 0 . Their variance is
σ 1 2 : = Var ( ξ 1 , i ∣ A i = 1 ) = E [ ϵ 1 , i 2 { ( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] = σ ϵ 1 , 1 2 a 1 ⊤ Ω 1 − 1 a 1 , (71) \sigma_{1}^{2}:=\operatorname{Var}(\xi_{1,i}\mid A_{i}=1)=\mathbb{E}\left[\epsilon_{1,i}^{2}\{(\mathbf{\Omega}_{1}^{-1}\mathbf{a}_{1})^{\top}\mathbf{f}_{1,i}\}^{2}\mid A_{i}=1\right]=\sigma_{\epsilon_{1,1}}^{2}\mathbf{a}_{1}^{\top}\mathbf{\Omega}_{1}^{-1}\mathbf{a}_{1}, \tag*{(71)} σ 1 2 := Var ( ξ 1 , i ∣ A i = 1 ) = E [ ϵ 1 , i 2 {( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] = σ ϵ 1 , 1 2 a 1 ⊤ Ω 1 − 1 a 1 , (71)
where σ ϵ 1 , 1 2 = E [ ϵ 1 , i 2 ∣ A i = 1 ] \sigma_{\epsilon_{1,1}}^{2}=\mathbb{E}[\epsilon_{1,i}^{2}\mid A_{i}=1] σ ϵ 1 , 1 2 = E [ ϵ 1 , i 2 ∣ A i = 1 ] . The last equality follows from the independence of ϵ 1 , i \epsilon_{1,i} ϵ 1 , i and f 1 , i \mathbf{f}_{1,i} f 1 , i under Assumption 3.1(ii). The variance is finite because ∥ Ω 1 − 1 ∥ o p = O ( 1 ) \|\mathbf{\Omega}_{1}^{-1}\|_{\mathrm{op}}=O(1) ∥ Ω 1 − 1 ∥ op = O ( 1 ) , ∥ a 1 ∥ = O ( 1 ) \|\mathbf{a}_{1}\|=O(1) ∥ a 1 ∥ = O ( 1 ) , and the relevant second moments are bounded by Assumption 5.1(i).
Step 3: L 3 L_{3} L 3 as a control i.i.d. average. Repeating Step 2 with ( M ~ , H X 1 , F X 1 , η , Ω X 0 ) (\widetilde{M},\mathbf{H}_{X1},\mathbf{F}_{X1},\eta,\mathbf{\Omega}_{X0}) ( M , H X 1 , F X 1 , η , Ω X 0 ) in place of ( M , H 1 , F 1 , ϵ 1 , Ω 1 ) (M,\mathbf{H}_{1},\mathbf{F}_{1},\epsilon_{1},\mathbf{\Omega}_{1}) ( M , H 1 , F 1 , ϵ 1 , Ω 1 ) , and using the second bound in (C.41) together with the control analogue of (C.43), we obtain
L 3 = 1 n c ∑ i : A i = 0 ξ 2 , i + o p ( 1 ) , (72) L_{3}=\frac{1}{\sqrt{n_{c}}}\sum_{i:A_{i}=0}\xi_{2,i}+o_{p}(1), \tag*{(72)} L 3 = n c 1 i : A i = 0 ∑ ξ 2 , i + o p ( 1 ) , (72)
where ξ 2 , i = ( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i η i \xi_{2,i}=(\mathbf{\Omega}_{X0}^{-1}\mathbf{e}_{1})^{\top}\mathbf{f}_{X1,i}\eta_{i} ξ 2 , i = ( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i η i and η i = γ 1 ⊤ u X M , 0 , i \eta_{i}=\boldsymbol{\gamma}_{1}^{\top}\mathbf{u}_{XM,0,i} η i = γ 1 ⊤ u X M , 0 , i . Here, e 1 \mathbf{e}_{1} e 1 denotes the intercept coordinate vector e 1 , 1 + p ˉ \mathbf{e}_{1,1+\bar{p}} e 1 , 1 + p ˉ defined before Theorem 5.2. By Assumption 3.1(ii), u X M , 0 , i \mathbf{u}_{XM,0,i} u X M , 0 , i is mean zero and independent of ( f X , i , A i ) (\mathbf{f}_{X,i},A_{i}) ( f X , i , A i ) , so E [ η i ∣ f X 1 , i , A i = 0 ] = 0 \mathbb{E}[\eta_{i}\mid\mathbf{f}_{X1,i},A_{i}=0]=0 E [ η i ∣ f X 1 , i , A i = 0 ] = 0 . Thus, the ξ 2 , i \xi_{2,i} ξ 2 , i are i.i.d. mean-zero across control observations with conditional variance
σ 2 2 : = Var ( ξ 2 , i ∣ A i = 0 ) = E [ η i 2 { ( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i } 2 ∣ A i = 0 ] < ∞ . (73) \sigma_{2}^{2}:=\operatorname{Var}(\xi_{2,i}\mid A_{i}=0)=\mathbb{E}\left[\eta_{i}^{2}\{(\mathbf{\Omega}_{X0}^{-1}\mathbf{e}_{1})^{\top}\mathbf{f}_{X1,i}\}^{2}\mid A_{i}=0\right]<\infty. \tag*{(73)} σ 2 2 := Var ( ξ 2 , i ∣ A i = 0 ) = E [ η i 2 {( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i } 2 ∣ A i = 0 ] < ∞. (73)
To see that this variance is finite, we have
E [ η i 2 ∣ A i = 0 ] = γ 1 ⊤ Σ u X M , 0 γ 1 ≤ ∥ γ 1 ∥ 2 ∥ Σ u X M , 0 ∥ o p ≤ C , \mathbb{E}[\eta_{i}^{2}\mid A_{i}=0]=\boldsymbol{\gamma}_{1}^{\top}\mathbf{\Sigma}_{u_{XM,0}}\boldsymbol{\gamma}_{1}\leq\|\boldsymbol{\gamma}_{1}\|^{2}\|\mathbf{\Sigma}_{u_{XM,0}}\|_{\mathrm{op}}\leq C, E [ η i 2 ∣ A i = 0 ] = γ 1 ⊤ Σ u X M , 0 γ 1 ≤ ∥ γ 1 ∥ 2 ∥ Σ u X M , 0 ∥ op ≤ C ,
using Assumption 3.2(i) for ∥ γ 1 ∥ = O ( 1 ) \|\boldsymbol{\gamma}_{1}\|=O(1) ∥ γ 1 ∥ = O ( 1 ) and Assumption 3.1(v) for ∥ Σ u X M , 0 ∥ o p ≤ C \|\mathbf{\Sigma}_{u_{XM,0}}\|_{\mathrm{op}}\leq C ∥ Σ u X M , 0 ∥ op ≤ C . Together with the bounded second moments of f X 1 , i \mathbf{f}_{X1,i} f X 1 , i and ∥ Ω X 0 − 1 ∥ o p = O ( 1 ) \|\mathbf{\Omega}_{X0}^{-1}\|_{\mathrm{op}}=O(1) ∥ Ω X 0 − 1 ∥ op = O ( 1 ) , this establishes the claimed finiteness.
Step 4: Influence function and vanishing cross term. Substituting (C.38), (C.44), and (C.46) into the fold decomposition (C.14), and placing the terms on the common fold scale m \sqrt{m} m , we have
m ( θ ^ D − θ 0 ) = m n t [ 1 n t ∑ i : A i = 1 ξ 1 , i ] + m n c [ 1 n c ∑ i : A i = 0 ξ 2 , i ] + o p ( 1 ) . \sqrt{m}(\hat{\theta}_{D}-\theta_{0})=\sqrt{\frac{m}{n_{t}}}\left[\frac{1}{\sqrt{n_{t}}}\sum_{i:A_{i}=1}\xi_{1,i}\right]+\sqrt{\frac{m}{n_{c}}}\left[\frac{1}{\sqrt{n_{c}}}\sum_{i:A_{i}=0}\xi_{2,i}\right]+o_{p}(1). m ( θ ^ D − θ 0 ) = n t m [ n t 1 i : A i = 1 ∑ ξ 1 , i ] + n c m [ n c 1 i : A i = 0 ∑ ξ 2 , i ] + o p ( 1 ) .
For the treated group, regrouping the constants gives
m n t ⋅ 1 m ∑ i : A i = 1 ξ 1 , i = 1 m ⋅ m n t ∑ i : A i = 1 ξ 1 , i = 1 m ∑ i ∈ D 1 ( A i = 1 ) m n t ξ 1 , i . \sqrt{\frac{m}{n_t}} \cdot\frac{1}{\sqrt{m}} \sum_{i:A_i=1} \xi_{1,i} = \frac{1}{\sqrt{m}} \cdot\frac{m}{n_t} \sum_{i:A_i=1} \xi_{1,i}
= \frac{1}{\sqrt{m}} \sum_{i\in D} \mathbf{1}(A_i=1)\frac{m}{n_t}\xi_{1,i}. n t m ⋅ m 1 i : A i = 1 ∑ ξ 1 , i = m 1 ⋅ n t m i : A i = 1 ∑ ξ 1 , i = m 1 i ∈ D ∑ 1 ( A i = 1 ) n t m ξ 1 , i .
Since m / n t → p 1 / π 1 m/n_t \to_p 1/\pi_1 m / n t → p 1/ π 1 and m − 1 / 2 ∑ i ∈ D 1 ( A i = 1 ) ξ 1 , i = O p ( 1 ) m^{-1/2}\sum_{i\in D}\mathbf{1}(A_i=1)\xi_{1,i}=O_p(1) m − 1/2 ∑ i ∈ D 1 ( A i = 1 ) ξ 1 , i = O p ( 1 ) , replacing m / n t m/n_t m / n t by 1 / π 1 1/\pi_1 1/ π 1 introduces an error of ( m / n t − 1 / π 1 ) ⋅ O p ( 1 ) = o p ( 1 ) (m/n_t-1/\pi_1)\cdot O_p(1)=o_p(1) ( m / n t − 1/ π 1 ) ⋅ O p ( 1 ) = o p ( 1 ) by Slutsky’s theorem. The control group is analogous, with m / n c → p 1 / π 0 m/n_c\to_p 1/\pi_0 m / n c → p 1/ π 0 . Hence,
m ( θ ^ D − θ 0 ) = 1 m ∑ i ∈ D ψ i + o p ( 1 ) , (74) \sqrt{m}(\hat{\theta}_D-\theta_0)=\frac{1}{\sqrt{m}}\sum_{i\in D}\psi_i+o_p(1), \tag*{(74)} m ( θ ^ D − θ 0 ) = m 1 i ∈ D ∑ ψ i + o p ( 1 ) , (74)
where
ψ i = 1 ( A i = 1 ) π 1 ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i + 1 ( A i = 0 ) π 0 ( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i η i . (75) \psi_i=\frac{\mathbf{1}(A_i=1)}{\pi_1}(\Omega_1^{-1}a_1)^\top f_{1,i}\epsilon_{1,i}+\frac{\mathbf{1}(A_i=0)}{\pi_0}(\Omega_{X_0}^{-1}e_1)^\top f_{X_1,i}\eta_i. \tag*{(75)} ψ i = π 1 1 ( A i = 1 ) ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i + π 0 1 ( A i = 0 ) ( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i η i . (75)
By the conditional mean-zero properties established in Steps 2–3, we have E [ ψ i ] = 0 \mathbb{E}[\psi_i]=0 E [ ψ i ] = 0 .
Now, write ψ i = ψ i ( 1 ) + ψ i ( 0 ) \psi_i=\psi_i^{(1)}+\psi_i^{(0)} ψ i = ψ i ( 1 ) + ψ i ( 0 ) for the treated and control contributions. Their product contains the factor 1 ( A i = 1 ) 1 ( A i = 0 ) = 0 \mathbf{1}(A_i=1)\mathbf{1}(A_i=0)=0 1 ( A i = 1 ) 1 ( A i = 0 ) = 0 , since each observation belongs to exactly one treatment group. Thus, ψ i ( 1 ) ψ i ( 0 ) = 0 \psi_i^{(1)}\psi_i^{(0)}=0 ψ i ( 1 ) ψ i ( 0 ) = 0 for every i i i , and
σ 2 : = Var ( ψ i ) = E [ ( ψ i ( 1 ) ) 2 ] + E [ ( ψ i ( 0 ) ) 2 ] . \sigma^2:=\operatorname{Var}(\psi_i)=\mathbb{E}[(\psi_i^{(1)})^2]+\mathbb{E}[(\psi_i^{(0)})^2]. σ 2 := Var ( ψ i ) = E [( ψ i ( 1 ) ) 2 ] + E [( ψ i ( 0 ) ) 2 ] .
Now, evaluating each term using E [ 1 ( A i = 1 ) ] = π 1 \mathbb{E}[\mathbf{1}(A_i=1)]=\pi_1 E [ 1 ( A i = 1 )] = π 1 and the conditional variances in (C.45) and (C.47), we obtain
E [ ( ψ i ( 1 ) ) 2 ] = 1 π 1 2 E [ 1 ( A i = 1 ) ] E [ { ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i } 2 ∣ A i = 1 ] = σ 1 2 π 1 , E [ ( ψ i ( 0 ) ) 2 ] = σ 0 2 π 0 . \mathbb{E}[(\psi_i^{(1)})^2]=\frac{1}{\pi_1^2}\mathbb{E}[\mathbf{1}(A_i=1)]\mathbb{E}\left[\{(\Omega_1^{-1}a_1)^\top f_{1,i}\epsilon_{1,i}\}^2\mid A_i=1\right]=\frac{\sigma_1^2}{\pi_1},\qquad\mathbb{E}[(\psi_i^{(0)})^2]=\frac{\sigma_0^2}{\pi_0}. E [( ψ i ( 1 ) ) 2 ] = π 1 2 1 E [ 1 ( A i = 1 )] E [ {( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i } 2 ∣ A i = 1 ] = π 1 σ 1 2 , E [( ψ i ( 0 ) ) 2 ] = π 0 σ 0 2 .
Therefore, we have
σ 2 = σ 1 2 π 1 + σ 0 2 π 0 . (76) \sigma^2=\frac{\sigma_1^2}{\pi_1}+\frac{\sigma_0^2}{\pi_0}. \tag*{(76)} σ 2 = π 1 σ 1 2 + π 0 σ 0 2 . (76)
Step 5: Lyapunov central limit theorem. The { ψ i } i ∈ D \{\psi_i\}_{i\in D} { ψ i } i ∈ D are i.i.d. and mean zero. Fix ω ∈ ( 0 , 1 ] \omega\in(0,1] ω ∈ ( 0 , 1 ] . Each part of ψ i \psi_i ψ i is a fixed scalar (1 / π 1 1/\pi_1 1/ π 1 or 1 / π 0 1/\pi_0 1/ π 0 ) times the product of a bounded linear form in a sub-Gaussian factor vector and a sub-Gaussian noise (ϵ 1 , i \epsilon_{1,i} ϵ 1 , i or η i = γ 1 ⊤ u X M , 0 , i \eta_i=\gamma_1^\top u_{X_M,0,i} η i = γ 1 ⊤ u X M , 0 , i ). By the bound ∣ x + y ∣ 2 + ω ≤ 2 1 + ω ( ∣ x ∣ 2 + ω + ∣ y ∣ 2 + ω ) |x+y|^{2+\omega}\leq2^{1+\omega}(|x|^{2+\omega}+|y|^{2+\omega}) ∣ x + y ∣ 2 + ω ≤ 2 1 + ω ( ∣ x ∣ 2 + ω + ∣ y ∣ 2 + ω ) , the Cauchy–Schwarz inequality, and the finiteness of all moments of sub-Gaussian variables under Assumption 5.1(i), we have
E ∣ ψ i ∣ 2 + ω ≤ 2 1 + ω ( 1 π 1 2 + ω E ∣ ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i ∣ 2 + ω + 1 π 0 2 + ω E ∣ ( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i η i ∣ 2 + ω ) ≤ C < ∞ , \mathbb{E}|\psi_i|^{2+\omega}\leq2^{1+\omega}\left(\frac{1}{\pi_1^{2+\omega}}\mathbb{E}|(\Omega_1^{-1}a_1)^\top f_{1,i}\epsilon_{1,i}|^{2+\omega}+\frac{1}{\pi_0^{2+\omega}}\mathbb{E}|(\Omega_{X_0}^{-1}e_1)^\top f_{X_1,i}\eta_i|^{2+\omega}\right)\leq C<\infty, E ∣ ψ i ∣ 2 + ω ≤ 2 1 + ω ( π 1 2 + ω 1 E ∣ ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i ∣ 2 + ω + π 0 2 + ω 1 E ∣ ( Ω X 0 − 1 e 1 ) ⊤ f X 1 , i η i ∣ 2 + ω ) ≤ C < ∞ ,
uniformly in i i i . Using the lower bound σ 2 ≥ c > 0 \sigma^2\geq c>0 σ 2 ≥ c > 0 , established below, the Lyapunov ratio satisfies
∑ i ∈ D E ∣ ψ i ∣ 2 + ω ( ∑ i ∈ D Var ( ψ i ) ) 1 + ω / 2 = m E ∣ ψ 1 ∣ 2 + ω ( m σ 2 ) 1 + ω / 2 ≤ C m ( m c ) 1 + ω / 2 = O ( m − ω / 2 ) → 0. \frac{\sum_{i\in D}\mathbb{E}|\psi_i|^{2+\omega}}{\left(\sum_{i\in D}\operatorname{Var}(\psi_i)\right)^{1+\omega/2}}=\frac{m\mathbb{E}|\psi_1|^{2+\omega}}{(m\sigma^2)^{1+\omega/2}}\leq\frac{Cm}{(mc)^{1+\omega/2}}=O(m^{-\omega/2})\to0. ( ∑ i ∈ D Var ( ψ i ) ) 1 + ω /2 ∑ i ∈ D E ∣ ψ i ∣ 2 + ω = ( m σ 2 ) 1 + ω /2 m E ∣ ψ 1 ∣ 2 + ω ≤ ( m c ) 1 + ω /2 C m = O ( m − ω /2 ) → 0.
This verifies the Lyapunov condition. Therefore, we have by Lyapunov central limit theorem that
1 m σ ∑ i ∈ D ψ i → d N ( 0 , 1 ) . \frac{1}{\sqrt{m}\sigma}\sum_{i\in D}\psi_i\xrightarrow{d}N(0,1). m σ 1 i ∈ D ∑ ψ i d N ( 0 , 1 ) .
Now, combining this with (C.48) and Slutsky’s theorem gives us
m ( θ ^ D − θ 0 ) σ → d N ( 0 , 1 ) . \frac{\sqrt{m}(\hat{\theta}_D-\theta_0)}{\sigma}\xrightarrow{d}N(0,1). σ m ( θ ^ D − θ 0 ) d N ( 0 , 1 ) .
Step 6: Cross-fitting. The expansion above is for one regression fold. Let D 1 D_1 D 1 and D 2 D_2 D 2 be the two folds, with ∣ D 1 ∣ = ∣ D 2 ∣ = n / 2 |D_1|=|D_2|=n/2 ∣ D 1 ∣ = ∣ D 2 ∣ = n /2 , and recall that the projection directions for each fold are estimated using its complement. The cross-fitted estimator is θ ^ 0 c f = 1 2 ( θ ^ D 1 + θ ^ D 2 ) \hat{\theta}_0^{\mathrm{cf}}=\frac{1}{2}(\hat{\theta}_{D_1}+\hat{\theta}_{D_2}) θ ^ 0 cf = 2 1 ( θ ^ D 1 + θ ^ D 2 ) . Applying Steps 1 - 5 to each fold D k D_k D k gives
θ ^ D k − θ 0 = 1 ∣ D k ∣ ∑ i ∈ D k ψ i + o p ( ∣ D k ∣ − 1 / 2 ) , (77) \hat{\theta}_{D_k}-\theta_0=\frac{1}{|D_k|}\sum_{i\in D_k}\psi_i+o_p(|D_k|^{-1/2}), \tag*{(77)} θ ^ D k − θ 0 = ∣ D k ∣ 1 i ∈ D k ∑ ψ i + o p ( ∣ D k ∣ − 1/2 ) , (77)
with the same influence function ψ i \psi_i ψ i from (C.48). Although the training-fold projection directions differ across folds, Step 1 shows that the corresponding sandwich matrices converge to the same population limits Ω 1 − 1 \Omega_1^{-1} Ω 1 − 1 and Ω X 0 − 1 \Omega_{X_0}^{-1} Ω X 0 − 1 . Together with the negligible factor estimation errors established in Part 2, this gives the same leading influence function for both folds, with the differences absorbed into the o p o_p o p remainder. The two fold sums are over disjoint sets D 1 \mathcal{D}_1 D 1 and D 2 \mathcal{D}_2 D 2 . Since the leading summands ψ i \psi_i ψ i depend only on the individual observations and fixed population quantities, they are i.i.d. across the full sample. The dependence introduced by estimating the projection directions on the opposite fold enters through the remainders in (C.51). Therefore, using 2 ∣ D k ∣ = n 2|\mathcal{D}_k|=n 2∣ D k ∣ = n , we have
n ( θ ^ 0 c f − θ 0 ) = n 2 ∑ k = 1 2 ( θ ^ D k − θ 0 ) = n 2 ∑ k = 1 2 1 ∣ D k ∣ ∑ i ∈ D k ψ i + o p ( 1 ) = 1 n ∑ i = 1 n ψ i + o p ( 1 ) . \sqrt{n}(\hat{\theta}_0^{\mathrm{cf}}-\theta_0)=\frac{\sqrt{n}}{2}\sum_{k=1}^{2}(\hat{\theta}_{\mathcal{D}_k}-\theta_0)
=\frac{\sqrt{n}}{2}\sum_{k=1}^{2}\frac{1}{|\mathcal{D}_k|}\sum_{i\in\mathcal{D}_k}\psi_i+o_p(1)
=\frac{1}{\sqrt{n}}\sum_{i=1}^{n}\psi_i+o_p(1). n ( θ ^ 0 cf − θ 0 ) = 2 n k = 1 ∑ 2 ( θ ^ D k − θ 0 ) = 2 n k = 1 ∑ 2 ∣ D k ∣ 1 i ∈ D k ∑ ψ i + o p ( 1 ) = n 1 i = 1 ∑ n ψ i + o p ( 1 ) .
The { ψ i } i = 1 n \{\psi_i\}_{i=1}^{n} { ψ i } i = 1 n are i.i.d. mean zero with variance σ 2 \sigma^2 σ 2 . Thus, the Lyapunov argument in Step 5 applies with m m m replaced by n n n and gives us
n ( θ ^ 0 c f − θ 0 ) σ → d N ( 0 , 1 ) , \frac{\sqrt{n}(\hat{\theta}_0^{\mathrm{cf}}-\theta_0)}{\sigma}\xrightarrow{d}N(0,1), σ n ( θ ^ 0 cf − θ 0 ) d N ( 0 , 1 ) ,
It remains to show 0 < c ≤ σ 2 ≤ C < ∞ 0<c\leq\sigma^2\leq C<\infty 0 < c ≤ σ 2 ≤ C < ∞ . The upper bound follows from Equation (C.50), since σ 1 2 , σ 2 2 = O ( 1 ) \sigma_1^2,\sigma_2^2=O(1) σ 1 2 , σ 2 2 = O ( 1 ) by Steps 2–3 and π 1 , π 0 \pi_1,\pi_0 π 1 , π 0 are fixed positive probabilities. For the lower bound, σ 2 \sigma^2 σ 2 is a sum of two nonnegative terms, so it suffices to bound one of them below. By Assumption 3.1(ii), ϵ 1 , i \epsilon_{1,i} ϵ 1 , i is independent of f 1 , i f_{1,i} f 1 , i and A i A_i A i . Thus, Assumption 5.1(ii) gives Var ( ϵ 1 , i ∣ f 1 , i , A i = 1 ) = Var ( ϵ 1 , i ) ≥ σ ‾ 2 > 0 \operatorname{Var}(\epsilon_{1,i}\mid f_{1,i},A_i=1)=\operatorname{Var}(\epsilon_{1,i})\geq\underline{\sigma}^2>0 Var ( ϵ 1 , i ∣ f 1 , i , A i = 1 ) = Var ( ϵ 1 , i ) ≥ σ 2 > 0 . Thus, conditioning on f 1 , i f_{1,i} f 1 , i inside (C.45), we get
σ 1 2 = E [ Var ( ϵ 1 , i ∣ f 1 , i , A i = 1 ) { ( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] ≥ σ ‾ 2 E [ { ( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] . \sigma_1^2=\mathbb{E}\left[\operatorname{Var}(\epsilon_{1,i}\mid f_{1,i},A_i=1)\{(\Omega_1^{-1}a_1)^{\top}f_{1,i}\}^2\mid A_i=1\right]\geq\underline{\sigma}^2\mathbb{E}\left[\{(\Omega_1^{-1}a_1)^{\top}f_{1,i}\}^2\mid A_i=1\right]. σ 1 2 = E [ Var ( ϵ 1 , i ∣ f 1 , i , A i = 1 ) {( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] ≥ σ 2 E [ {( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] .
The inner expectation is the Ω 1 \Omega_1 Ω 1 -quadratic form, we get
E [ { ( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] = ( Ω 1 − 1 a 1 ) ⊤ Ω 1 ( Ω 1 − 1 a 1 ) = a 1 ⊤ Ω 1 − 1 a 1 ≥ λ min ( Ω 1 − 1 ) ∥ a 1 ∥ 2 . \mathbb{E}\left[\{(\Omega_1^{-1}a_1)^{\top}f_{1,i}\}^2\mid A_i=1\right]=(\Omega_1^{-1}a_1)^{\top}\Omega_1(\Omega_1^{-1}a_1)=a_1^{\top}\Omega_1^{-1}a_1\geq\lambda_{\min}(\Omega_1^{-1})\|a_1\|^2. E [ {( Ω 1 − 1 a 1 ) ⊤ f 1 , i } 2 ∣ A i = 1 ] = ( Ω 1 − 1 a 1 ) ⊤ Ω 1 ( Ω 1 − 1 a 1 ) = a 1 ⊤ Ω 1 − 1 a 1 ≥ λ m i n ( Ω 1 − 1 ) ∥ a 1 ∥ 2 .
Since ∥ a 1 ∥ ≥ 1 \|a_1\|\geq1 ∥ a 1 ∥ ≥ 1 by (C.42) and λ min ( Ω 1 − 1 ) = λ max ( Ω 1 ) − 1 > 0 \lambda_{\min}(\Omega_1^{-1})=\lambda_{\max}(\Omega_1)^{-1}>0 λ m i n ( Ω 1 − 1 ) = λ m a x ( Ω 1 ) − 1 > 0 , we have
σ 2 ≥ σ 1 2 π 1 ≥ σ ‾ 2 λ max ( Ω 1 ) − 1 π 1 = c > 0. \sigma^2\geq\frac{\sigma_1^2}{\pi_1}\geq\frac{\underline{\sigma}^2\lambda_{\max}(\Omega_1)^{-1}}{\pi_1}=c>0. σ 2 ≥ π 1 σ 1 2 ≥ π 1 σ 2 λ m a x ( Ω 1 ) − 1 = c > 0.
Now, combining the upper and lower bounds gives 0 < c ≤ σ 2 ≤ C < ∞ 0<c\leq\sigma^2\leq C<\infty 0 < c ≤ σ 2 ≤ C < ∞ , which completes the proof of asymptotic normality of the cross-fitted estimator θ ^ 0 c f \hat{\theta}_0^{\mathrm{cf}} θ ^ 0 cf .
Proof of Lemma 5.1
Proof. We write σ ^ 2 \hat{\sigma}^2 σ ^ 2 as the empirical second moment of an estimated influence function. Then, we show that this function is close to the influence function as defined in Equation (C.49). Here, the weights from the projected factors must be close to the weights from true factors and the regression residuals to the structural errors. When that would hold, the sample averages in σ ^ 1 2 \hat{\sigma}_1^2 σ ^ 1 2 and σ ^ 2 2 \hat{\sigma}_2^2 σ ^ 2 2 can be compared directly with the true averages, and this gives the result. Recall that the expansion in (C.48) from the proof of Theorem 5.2 uses
ψ i = 1 ( A i = 1 ) π 1 ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i + 1 ( A i = 0 ) X 0 e 1 , 1 + p ˉ ( Ω 1 − 1 a 1 ) ⊤ f X 1 , i η i . (78) \psi_i=\frac{1(A_i=1)}{\pi_1}(\Omega_1^{-1}a_1)^{\top}f_{1,i}\epsilon_{1,i}+\frac{1(A_i=0)}{X_0e_{1,1}+\bar{p}}(\Omega_1^{-1}a_1)^{\top}f_{X_1,i}\eta_i. \tag*{(78)} ψ i = π 1 1 ( A i = 1 ) ( Ω 1 − 1 a 1 ) ⊤ f 1 , i ϵ 1 , i + X 0 e 1 , 1 + p ˉ 1 ( A i = 0 ) ( Ω 1 − 1 a 1 ) ⊤ f X 1 , i η i . (78)
By the mean-zero properties of the structural errors and Equation (C.50), E ( ψ i ) = 0 \mathbb{E}(\psi_i)=0 E ( ψ i ) = 0 and E ( ψ i 2 ) = σ 2 \mathbb{E}(\psi_i^2)=\sigma^2 E ( ψ i 2 ) = σ 2 . These terms depend on the unobserved factors and structural errors, so we replace them with the predicted regression quantities. Fix a regression fold D k \mathcal{D}_k D k . Write m = n k m=n_k m = n k , n t = n k t n_t=n_k^t n t = n k t , and n c = n k c n_c=n_k^c n c = n k c . The projections used on this fold were estimated on the other fold. We condition on that training fold whenever we work with the projected errors. For the control bridge we also condition on the treated observations, because γ ^ 1 \hat{\gamma}_1 γ ^ 1 is fitted on them. We have that n t ≪ n c ≍ n n_t\ll n_c\asymp n n t ≪ n c ≍ n in probability. Let Z ^ i = ( 1 , f ^ X , i ⊤ , f ^ M , i ⊤ ) ⊤ \hat{Z}_i=(1,\hat{f}_{X,i}^{\top},\hat{f}_{M,i}^{\top})^{\top} Z ^ i = ( 1 , f ^ X , i ⊤ , f ^ M , i ⊤ ) ⊤ and R ^ i = ( 1 , f ^ X , i ⊤ ) ⊤ \hat{R}_i=(1,\hat{f}_{X,i}^{\top})^{\top} R ^ i = ( 1 , f ^ X , i ⊤ ) ⊤ denote the projected treated and control design vectors, respectively. By Equation (A.1), they satisfy
Z ^ i = H 1 f 1 , i + e 0 , i , R ^ i = H X 1 f X 1 , i + e X 0 , i . \hat{Z}_i=H_1f_{1,i}+e_{0,i},\qquad\hat{R}_i=H_{X_1}f_{X_1,i}+e_{X_0,i}. Z ^ i = H 1 f 1 , i + e 0 , i , R ^ i = H X 1 f X 1 , i + e X 0 , i .
Since H X 1 = diag ( 1 , H X ) \mathbf{H}_{X1}=\operatorname{diag}(1,\mathbf{H}_{X}) H X 1 = diag ( 1 , H X ) , we have e 1 = H X 1 e 1 , 1 + p ~ e_1=\mathbf{H}_{X1}e_{1,1+\tilde p} e 1 = H X 1 e 1 , 1 + p ~ . Since H 1 = diag ( 1 , H X , H M ) \mathbf{H}_1=\operatorname{diag}(1,\mathbf{H}_{X},\mathbf{H}_{M}) H 1 = diag ( 1 , H X , H M ) , we have H 1 a 1 = e 1 + S q ~ ⊤ H M δ 0 \mathbf{H}_1a_1=e_1+\mathbf{S}_{\tilde q}^{\top}\mathbf{H}_{M}\delta_0 H 1 a 1 = e 1 + S q ~ ⊤ H M δ 0 . We know that M = n t − 1 Z ^ ⊤ Z ^ M=n_t^{-1}\widehat{\mathbf{Z}}^{\top}\widehat{\mathbf{Z}} M = n t − 1 Z ⊤ Z and M ~ = n c − 1 R ^ ⊤ R ^ \widetilde{M}=n_c^{-1}\widehat{\mathbf{R}}^{\top}\widehat{\mathbf{R}} M = n c − 1 R ⊤ R denote the treated and control gram matrices on this fold.
Let ϵ ^ 1 , i \widehat{\epsilon}_{1,i} ϵ 1 , i and η ^ i \widehat{\eta}_i η i be the least-squares residuals from the treated outcome regression and the control bridge regression of Algorithm 1. Since a 1 a_1 a 1 contains the unknown mediator intercept δ 0 \delta_0 δ 0 , we estimate H M δ 0 \mathbf{H}_{M}\delta_0 H M δ 0 by the intercept from a least-squares regression of f ^ M , i \widehat{f}_{M,i} f M , i on R ^ i \widehat{\mathbf{R}}_i R i among the controls as we did in the proof of Theorem 5.2. On each regression fold, define H M δ 0 ^ = { ( 1 / n c k ) ∑ i ∈ D k : A i = 0 f ^ M , i R ^ i ⊤ } M ~ − 1 e 1 \widehat{\mathbf{H}_{M}\delta_0}=\{(1/n_c^k)\sum_{i\in D_k:A_i=0}\widehat{f}_{M,i}\widehat{\mathbf{R}}_i^{\top}\}\widetilde{M}^{-1}e_1 H M δ 0 = {( 1/ n c k ) ∑ i ∈ D k : A i = 0 f M , i R i ⊤ } M − 1 e 1 and H 1 a 1 ^ = e 1 + S q ~ ⊤ H M δ 0 ^ \widehat{\mathbf{H}_1a_1}=e_1+\mathbf{S}_{\tilde q}^{\top}\widehat{\mathbf{H}_{M}\delta_0} H 1 a 1 = e 1 + S q ~ ⊤ H M δ 0 . With these fold specific quantities, the terms in C.54 are π ^ 1 = n − 1 ∑ i = 1 n 1 ( A i = 1 ) \widehat{\pi}_1=n^{-1}\sum_{i=1}^n1(A_i=1) π 1 = n − 1 ∑ i = 1 n 1 ( A i = 1 ) , π ^ 0 = 1 − π ^ 1 \widehat{\pi}_0=1-\widehat{\pi}_1 π 0 = 1 − π 1 , and
σ ^ 1 2 = 1 n π ^ 1 2 ∑ k = 1 2 ∑ i ∈ D k : A i = 1 ( H 1 a 1 ^ ⊤ M − 1 Z ^ i ϵ ^ 1 , i ) 2 , σ ^ 2 2 = 1 n π ^ 0 2 ∑ k = 1 2 ∑ i ∈ D k : A i = 0 ( e 1 ⊤ M ~ − 1 R ^ i η ^ i ) 2 , (79) \widehat{\sigma}_1^2=\frac{1}{n\widehat{\pi}_1^2}\sum_{k=1}^2\sum_{i\in D_k:A_i=1}\left(\widehat{\mathbf{H}_1a_1}^{\top}M^{-1}\widehat{\mathbf{Z}}_i\widehat{\epsilon}_{1,i}\right)^2,\qquad\widehat{\sigma}_2^2=\frac{1}{n\widehat{\pi}_0^2}\sum_{k=1}^2\sum_{i\in D_k:A_i=0}\left(e_1^{\top}\widetilde{M}^{-1}\widehat{\mathbf{R}}_i\widehat{\eta}_i\right)^2, \tag*{(79)} σ 1 2 = n π 1 2 1 k = 1 ∑ 2 i ∈ D k : A i = 1 ∑ ( H 1 a 1 ⊤ M − 1 Z i ϵ 1 , i ) 2 , σ 2 2 = n π 0 2 1 k = 1 ∑ 2 i ∈ D k : A i = 0 ∑ ( e 1 ⊤ M − 1 R i η i ) 2 , (79)
where for i ∈ D k i\in D_k i ∈ D k , the matrices M M M and M ~ \widetilde{M} M , the residuals, and H 1 a 1 ^ \widehat{\mathbf{H}_1a_1} H 1 a 1 are those computed on D k D_k D k . For i ∈ D k i\in D_k i ∈ D k , define
ψ ^ k , i = 1 ( A i = 1 ) π ^ 1 H 1 a 1 ^ ⊤ M − 1 Z ^ i ϵ ^ 1 , i + 1 ( A i = 0 ) π ^ 0 e 1 ⊤ M ~ − 1 R ^ i η ^ i , (80) \widehat{\psi}_{k,i}=\frac{1(A_i=1)}{\widehat{\pi}_1}\widehat{\mathbf{H}_1a_1}^{\top}M^{-1}\widehat{\mathbf{Z}}_i\widehat{\epsilon}_{1,i}+\frac{1(A_i=0)}{\widehat{\pi}_0}e_1^{\top}\widetilde{M}^{-1}\widehat{\mathbf{R}}_i\widehat{\eta}_i, \tag*{(80)} ψ k , i = π 1 1 ( A i = 1 ) H 1 a 1 ⊤ M − 1 Z i ϵ 1 , i + π 0 1 ( A i = 0 ) e 1 ⊤ M − 1 R i η i , (80)
This is the sample version of ψ i \psi_i ψ i . The two indicators cannot both equal one, so the cross term in ψ ^ k , i 2 \widehat{\psi}_{k,i}^2 ψ k , i 2 vanishes. We sum over all observations and use Equation (C.53). This gives
1 n ∑ k = 1 2 ∑ i ∈ D k ψ ^ k , i 2 = 1 n π ^ 1 2 ∑ k = 1 2 ∑ i ∈ D k : A i = 1 ( H 1 a 1 ^ ⊤ M − 1 Z ^ i ϵ ^ 1 , i ) 2 + 1 n π ^ 0 2 ∑ k = 1 2 ∑ i ∈ D k : A i = 0 ( e 1 ⊤ M ~ − 1 R ^ i η ^ i ) 2 = σ ^ 1 2 π ^ 1 + σ ^ 2 2 π ^ 0 = σ ^ 2 . (81) \begin{aligned}
\frac{1}{n}\sum_{k=1}^2\sum_{i\in D_k}\widehat{\psi}_{k,i}^2
=\frac{1}{n\widehat{\pi}_1^2}\sum_{k=1}^2\sum_{i\in D_k:A_i=1}\left(\widehat{\mathbf{H}_1a_1}^{\top}M^{-1}\widehat{\mathbf{Z}}_i\widehat{\epsilon}_{1,i}\right)^2+\frac{1}{n\widehat{\pi}_0^2}\sum_{k=1}^2\sum_{i\in D_k:A_i=0}\left(e_1^{\top}\widetilde{M}^{-1}\widehat{\mathbf{R}}_i\widehat{\eta}_i\right)^2 \\
&=\frac{\widehat{\sigma}_1^2}{\widehat{\pi}_1}+\frac{\widehat{\sigma}_2^2}{\widehat{\pi}_0} \\
&=\widehat{\sigma}^2. \tag*{(81)}
\end{aligned} n 1 k = 1 ∑ 2 i ∈ D k ∑ ψ k , i 2 = n π 1 2 1 k = 1 ∑ 2 i ∈ D k : A i = 1 ∑ ( H 1 a 1 ⊤ M − 1 Z i ϵ 1 , i ) 2 + n π 0 2 1 k = 1 ∑ 2 i ∈ D k : A i = 0 ∑ ( e 1 ⊤ M − 1 R i η i ) 2 = π 1 σ 1 2 + π 0 σ 2 2 = σ 2 . (81)
It therefore suffices to show that n − 1 ∑ k = 1 2 ∑ i ∈ D k ψ ^ k , i 2 → p σ 2 n^{-1}\sum_{k=1}^2\sum_{i\in D_k}\widehat{\psi}_{k,i}^2\xrightarrow{p}\sigma^2 n − 1 ∑ k = 1 2 ∑ i ∈ D k ψ k , i 2 p σ 2 .
Now, if we use the coordinates of Lemma C.7, where H 1 = U R \mathbf{H}_1=UR H 1 = U R , J = [ U S ] J=[U\ \ S] J = [ U S ] is orthogonal, and Σ S = diag ( p − 1 Ω X , q − 1 Ω M ) \Sigma_S=\operatorname{diag}(p^{-1}\Omega_X,q^{-1}\Omega_M) Σ S = diag ( p − 1 Ω X , q − 1 Ω M ) . Also let E ~ S = E 0 S Σ S − 1 / 2 \widetilde{E}_S=E_0S\Sigma_S^{-1/2} E S = E 0 S Σ S − 1/2 and M ~ = n t − 1 Z ‾ ⊤ Z ‾ \widetilde{M}=n_t^{-1}\overline{\mathbf{Z}}^{\top}\overline{\mathbf{Z}} M = n t − 1 Z ⊤ Z , where Z ‾ \overline{\mathbf{Z}} Z from Step 2 of the lemma. There, ∥ M ~ − 1 ∥ op = O p ( 1 ) \lVert\widetilde{M}^{-1}\rVert_{\operatorname{op}}=O_p(1) ∥ M − 1 ∥ op = O p ( 1 ) , and its decomposition gives us that
M − 1 = J ( I 0 0 Σ S − 1 / 2 ) M ~ − 1 ( I 0 0 Σ S − 1 / 2 ) J ⊤ . M^{-1}=J
\begin{pmatrix}
I & 0\\
0 & \Sigma_S^{-1/2}
\end{pmatrix}
\widetilde{M}^{-1}
\begin{pmatrix}
I & 0\\
0 & \Sigma_S^{-1/2}
\end{pmatrix}
J^{\top}. M − 1 = J ( I 0 0 Σ S − 1/2 ) M − 1 ( I 0 0 Σ S − 1/2 ) J ⊤ .
Hence, for every vector v ∈ R 1 + p ~ + q ~ v\in\mathbb{R}^{1+\tilde p+\tilde q} v ∈ R 1 + p ~ + q ~ , we have
v ⊤ M − 1 v ≤ ∥ M ~ − 1 ∥ op ( ∥ U ⊤ v ∥ 2 + ∥ Σ S − 1 / 2 S ⊤ v ∥ 2 ) . (82) v^{\top}M^{-1}v\leq\lVert\widetilde{M}^{-1}\rVert_{\operatorname{op}}\left(\lVert U^{\top}v\rVert^2+\lVert\Sigma_S^{-1/2}S^{\top}v\rVert^2\right). \tag*{(82)} v ⊤ M − 1 v ≤ ∥ M − 1 ∥ op ( ∥ U ⊤ v ∥ 2 + ∥ Σ S − 1/2 S ⊤ v ∥ 2 ) . (82)
For the control part, use H X 1 = U ~ R ~ \mathbf{H}_{X1}=\widetilde{U}\widetilde{R} H X 1 = U R and the X-only version of the same rescaling as we have in the proof of Theorem 5.2. Its null directions are spanned by S X S_X S X with covariance scale p − 1 Ω X p^{-1}\Omega_X p − 1 Ω X . Thus, for every v = ( v 0 , v X ⊤ ) ⊤ ∈ R 1 + p ~ v=(v_0,v_X^{\top})^{\top}\in\mathbb{R}^{1+\tilde p} v = ( v 0 , v X ⊤ ) ⊤ ∈ R 1 + p ~ , we have
v ⊤ M ~ − 1 v ≤ O p ( 1 ) ( ∥ U ~ ⊤ v ∥ 2 + p ∥ Ω X − 1 / 2 S X ⊤ v X ∥ 2 ) . (83) v^{\top}\widetilde{M}^{-1}v\leq O_p(1)\left(\lVert\widetilde{U}^{\top}v\rVert^2+p\lVert\Omega_X^{-1/2}S_X^{\top}v_X\rVert^2\right). \tag*{(83)} v ⊤ M − 1 v ≤ O p ( 1 ) ( ∥ U ⊤ v ∥ 2 + p ∥ Ω X − 1/2 S X ⊤ v X ∥ 2 ) . (83)
As e 1 e_1 e 1 has zero X-block and ∥ U ~ ⊤ e 1 ∥ ≤ 1 \lVert\widetilde{U}^{\top}e_1\rVert\leq1 ∥ U ⊤ e 1 ∥ ≤ 1 , (C.57) gives us that
e 1 ⊤ M ~ − 1 e 1 = O p ( 1 ) . (84) e_1^{\top}\widetilde{M}^{-1}e_1=O_p(1). \tag*{(84)} e 1 ⊤ M − 1 e 1 = O p ( 1 ) . (84)
For a control observation, the mediator model gives f M , i = δ 0 + B 0 f X , i + u X M , 0 , i f_{M,i}=\delta_0+B_0f_{X,i}+u_{XM,0,i} f M , i = δ 0 + B 0 f X , i + u X M , 0 , i . We also have f X , i = H X ⊤ ( f ^ X , i − e X , i ) f_{X,i}=\mathbf{H}_X^{\top}(\widehat{f}_{X,i}-e_{X,i}) f X , i = H X ⊤ ( f X , i − e X , i ) . We substitute both into f ^ M , i = H M f M , i + e M , i \widehat{f}_{M,i}=\mathbf{H}_Mf_{M,i}+e_{M,i} f M , i = H M f M , i + e M , i and get that
f ^ M , i = H M ( δ 0 − B 0 H X ⊤ ) R ^ i + H M u X M , 0 , i − H M B 0 H X ⊤ e X , i + e M , i . \widehat{f}_{M,i}=\mathbf{H}_M\left(\delta_0-B_0\mathbf{H}_X^{\top}\right)\widehat{\mathbf{R}}_i+\mathbf{H}_Mu_{XM,0,i}-\mathbf{H}_MB_0\mathbf{H}_X^{\top}e_{X,i}+e_{M,i}. f M , i = H M ( δ 0 − B 0 H X ⊤ ) R i + H M u X M , 0 , i − H M B 0 H X ⊤ e X , i + e M , i .
The first term is linear in R ^ i \widehat{\mathbf{R}}_i R i . Its least-squares intercept is H M ( δ 0 − B 0 H X ⊤ ) e 1 = H M δ 0 \mathbf{H}_M(\delta_0-B_0\mathbf{H}_X^{\top})e_1=\mathbf{H}_M\delta_0 H M ( δ 0 − B 0 H X ⊤ ) e 1 = H M δ 0 . Hence
H M δ 0 ^ − H M δ 0 = 1 n c ∑ i : A i = 0 ( H M u X M , 0 , i − H M B 0 H X ⊤ e X , i + e M , i ) R ^ i ⊤ M ~ − 1 e 1 . \widehat{\mathbf{H}_{M}\delta_0}-\mathbf{H}_M\delta_0
=\frac{1}{n_c}\sum_{i:A_i=0}\left(\mathbf{H}_Mu_{XM,0,i}-\mathbf{H}_MB_0\mathbf{H}_X^{\top}e_{X,i}+e_{M,i}\right)\widehat{\mathbf{R}}_i^{\top}\widetilde{M}^{-1}e_1. H M δ 0 − H M δ 0 = n c 1 i : A i = 0 ∑ ( H M u X M , 0 , i − H M B 0 H X ⊤ e X , i + e M , i ) R i ⊤ M − 1 e 1 .
The scalars R ^ i ⊤ M ~ − 1 e 1 \widehat{\mathbf{R}}_i^{\top}\widetilde{M}^{-1}e_1 R i ⊤ M − 1 e 1 satisfy that
1 n c ∑ i : A i = 0 ( R ^ i ⊤ M ~ − 1 e 1 ) 2 = e 1 ⊤ M ~ − 1 M ~ M ~ − 1 e 1 = e 1 ⊤ M ~ − 1 e 1 = O p ( 1 ) . \frac{1}{n_c}\sum_{i:A_i=0}\left(\widehat{\mathbf{R}}_i^{\top}\widetilde{M}^{-1}e_1\right)^2=e_1^{\top}\widetilde{M}^{-1}\widetilde{M}\widetilde{M}^{-1}e_1=e_1^{\top}\widetilde{M}^{-1}e_1=O_p(1). n c 1 i : A i = 0 ∑ ( R i ⊤ M − 1 e 1 ) 2 = e 1 ⊤ M − 1 M M − 1 e 1 = e 1 ⊤ M − 1 e 1 = O p ( 1 ) .
using the Equation (C.58). By Assumption 3.1(ii), u X M , 0 , i \mathbf{u}_{XM,0,i} u X M , 0 , i and e M i \mathbf{e}_{Mi} e M i are mean zero and independent of R ^ i \widehat{\mathbf{R}}_i R i , conditional on the training fold. So, we have that the conditional second moment of the first term is at most C n c − 1 e 1 ⊤ M ~ − 1 e 1 C n_c^{-1}e_1^{\top}\widetilde{M}^{-1}e_1 C n c − 1 e 1 ⊤ M − 1 e 1 , and that of the third term is at most C ( n c q ) − 1 e 1 ⊤ M ~ − 1 e 1 C(n_cq)^{-1}e_1^{\top}\widetilde{M}^{-1}e_1 C ( n c q ) − 1 e 1 ⊤ M − 1 e 1 . For the second term, we have using the Cauchy–Schwarz and the X X X -only version of Lemma C.2(i) give a bound of order O p ( p − 1 / 2 ) O_p(p^{-1/2}) O p ( p − 1/2 ) , since ∥ H M B 0 H X ⊤ ∥ o p = O p ( 1 ) \|H_M B_0 H_X^{\top}\|_{\mathrm{op}}=O_p(1) ∥ H M B 0 H X ⊤ ∥ op = O p ( 1 ) . Therefore, we get
∥ H ^ M δ ~ 0 − H M δ 0 ∥ = O p ( 1 m + 1 p ) . (85) \left\|\widehat{H}_M\widetilde{\delta}_0-H_M\delta_0\right\|=O_p\left(\frac{1}{\sqrt{m}}+\frac{1}{\sqrt{p}}\right). \tag*{(85)} H M δ 0 − H M δ 0 = O p ( m 1 + p 1 ) . (85)
Since S M ⊤ H M = 0 S_M^{\top}H_M=0 S M ⊤ H M = 0 , we have
S M ⊤ H ^ M δ 0 = 1 n c ∑ i : A i = 0 S M ⊤ e M i R ^ i ⊤ M ~ − 1 e 1 . S_M^{\top}\widehat{H}_M\delta_0=\frac{1}{n_c}\sum_{i:A_i=0}S_M^{\top}e_{M_i}\widehat{R}_i^{\top}\widetilde{M}^{-1}e_1. S M ⊤ H M δ 0 = n c 1 i : A i = 0 ∑ S M ⊤ e M i R i ⊤ M − 1 e 1 .
Using the Step 2 in the proof of Lemma C.7, we have that E ∥ S M ⊤ e M i ∥ 2 = q − 1 tr ( Ω M ) \mathbb{E}\|S_M^{\top}e_{M_i}\|^2=q^{-1}\operatorname{tr}(\Omega_M) E ∥ S M ⊤ e M i ∥ 2 = q − 1 tr ( Ω M ) . The conditional second moment is therefore at most C ( n c q ) − 1 e 1 ⊤ M ~ − 1 e 1 C(n_cq)^{-1}e_1^{\top}\widetilde{M}^{-1}e_1 C ( n c q ) − 1 e 1 ⊤ M − 1 e 1 . Using Equation (C.58),
∥ S M ⊤ H ^ M δ 0 ∥ = O p ( 1 q m ) . (86) \left\|S_M^{\top}\widehat{H}_M\delta_0\right\|=O_p\left(\frac{1}{\sqrt{qm}}\right). \tag*{(86)} S M ⊤ H M δ 0 = O p ( q m 1 ) . (86)
Now, for treated observations, let h ^ 1 , i = H ^ 1 a 1 ⊤ M − 1 Z ^ i \widehat{h}_{1,i}=\widehat{H}_1a_1^{\top}M^{-1}\widehat{Z}_i h 1 , i = H 1 a 1 ⊤ M − 1 Z i and h 1 , i = a 1 ⊤ Ω 1 − 1 f 1 , i h_{1,i}=a_{1}^{\top}\Omega_1^{-1}f_{1,i} h 1 , i = a 1 ⊤ Ω 1 − 1 f 1 , i . For control part, let h ^ 0 , i = e 1 ⊤ M ~ − 1 R ^ i \widehat{h}_{0,i}=e_1^{\top}\widetilde{M}^{-1}\widehat{R}_i h 0 , i = e 1 ⊤ M − 1 R i and h 0 , i = e 1 , 1 + p ˉ ⊤ Ω X 1 − 1 f X 1 , i h_{0,i}=e_{1,1+\bar{p}}^{\top}\Omega_{X1}^{-1}f_{X1,i} h 0 , i = e 1 , 1 + p ˉ ⊤ Ω X 1 − 1 f X 1 , i . Using Equation (C.44) and (C.46), we have that ξ 1 , i = h 1 , i ϵ 1 , i \xi_{1,i}=h_{1,i}\epsilon_{1,i} ξ 1 , i = h 1 , i ϵ 1 , i and ξ 2 , i = h 0 , i η i \xi_{2,i}=h_{0,i}\eta_i ξ 2 , i = h 0 , i η i .
Now, we start with the treated weights. Since H 1 H_1 H 1 has full column rank, H 1 ⊤ ( H 1 ⊤ ) ⊤ = I H_1^{\top}(H_1^{\top})^{\top}=I H 1 ⊤ ( H 1 ⊤ ) ⊤ = I . So, we have
Z ^ ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = F 1 H 1 ⊤ ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = F 1 Ω 1 − 1 a 1 + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 . \widehat{Z}(H_1^{\top})^{\top}\Omega_1^{-1}a_1
=F_1H_1^{\top}(H_1^{\top})^{\top}\Omega_1^{-1}a_1+E_0(H_1^{\top})^{\top}\Omega_1^{-1}a_1
=F_1\Omega_1^{-1}a_1+E_0(H_1^{\top})^{\top}\Omega_1^{-1}a_1. Z ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = F 1 H 1 ⊤ ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = F 1 Ω 1 − 1 a 1 + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 .
The vector F 1 Ω 1 − 1 a 1 F_1\Omega_1^{-1}a_1 F 1 Ω 1 − 1 a 1 has entries h 1 , i h_{1,i} h 1 , i . So, we subtract and get that
( h ^ 1 , i − h 1 , i ) i : A i = 1 = Z ^ M − 1 H ^ 1 a 1 − Z ^ ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = Z ^ M − 1 v + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 , (\widehat{h}_{1,i}-h_{1,i})_{i:A_i=1}
=\widehat{Z}M^{-1}\widehat{H}_1a_1-\widehat{Z}(H_1^{\top})^{\top}\Omega_1^{-1}a_1+E_0(H_1^{\top})^{\top}\Omega_1^{-1}a_1
=\widehat{Z}M^{-1}v+E_0(H_1^{\top})^{\top}\Omega_1^{-1}a_1, ( h 1 , i − h 1 , i ) i : A i = 1 = Z M − 1 H 1 a 1 − Z ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = Z M − 1 v + E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 ,
where v = H ^ 1 a 1 − M ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 v=\widehat{H}_1a_1-M(H_1^{\top})^{\top}\Omega_1^{-1}a_1 v = H 1 a 1 − M ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 . Since n t − 1 ∥ Z ^ M − 1 v ∥ 2 = v ⊤ M − 1 v n_t^{-1}\|\widehat{Z}M^{-1}v\|^2=v^{\top}M^{-1}v n t − 1 ∥ Z M − 1 v ∥ 2 = v ⊤ M − 1 v , we have that
1 n t ∑ i : A i = 1 ∣ h ^ 1 , i − h 1 , i ∣ 2 ≤ 2 v ⊤ M − 1 v + 2 ∥ 1 n t E 0 ⊤ E 0 ∥ o p ∥ ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 ∥ 2 . (87) \frac{1}{n_t}\sum_{i:A_i=1}|\widehat{h}_{1,i}-h_{1,i}|^2
\leq2v^{\top}M^{-1}v+2\left\|\frac{1}{n_t}E_0^{\top}E_0\right\|_{\mathrm{op}}\left\|(H_1^{\top})^{\top}\Omega_1^{-1}a_1\right\|^2. \tag*{(87)} n t 1 i : A i = 1 ∑ ∣ h 1 , i − h 1 , i ∣ 2 ≤ 2 v ⊤ M − 1 v + 2 n t 1 E 0 ⊤ E 0 op ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 2 . (87)
The second term is O p ( ( p ∧ q ) − 1 ) O_p((p\wedge q)^{-1}) O p (( p ∧ q ) − 1 ) using the Lemma C.2(i), and also since ∥ H 1 ⊤ ∥ o p \|H_1^{\top}\|_{\mathrm{op}} ∥ H 1 ⊤ ∥ op , ∥ Ω 1 − 1 ∥ o p \|\Omega_1^{-1}\|_{\mathrm{op}} ∥ Ω 1 − 1 ∥ op , and ∥ a 1 ∥ \|a_1\| ∥ a 1 ∥ are O p ( 1 ) O_p(1) O p ( 1 ) . Now, we expand v v v . We substitute Z ^ = F 1 H 1 ⊤ + E 0 \widehat{Z}=F_1H_1^{\top}+E_0 Z = F 1 H 1 ⊤ + E 0 into M = n t − 1 Z ^ ⊤ Z ^ M=n_t^{-1}\widehat{Z}^{\top}\widehat{Z} M = n t − 1 Z ⊤ Z and use H ^ 1 a 1 = H 1 a 1 + S q ~ ( H ^ M δ ~ 0 − H M δ 0 ) \widehat{H}_1a_1=H_1a_1+S_{\widetilde{q}}(\widehat{H}_M\widetilde{\delta}_0-H_M\delta_0) H 1 a 1 = H 1 a 1 + S q ( H M δ 0 − H M δ 0 ) . This gives
v = H 1 ( Ω 1 − 1 n t F 1 ⊤ F 1 ) Ω 1 − 1 a 1 − 1 n t H 1 F 1 ⊤ E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 − 1 n t E 0 ⊤ F 1 Ω 1 − 1 a 1 − 1 n t E 0 ⊤ E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 + S q ~ ⊤ ( H ^ M δ ~ 0 − H M δ 0 ) . v=H_1\left(\Omega_1-\frac{1}{n_t}F_1^{\top}F_1\right)\Omega_1^{-1}a_1
-\frac{1}{n_t}H_1F_1^{\top}E_0(H_1^{\top})^{\top}\Omega_1^{-1}a_1
-\frac{1}{n_t}E_0^{\top}F_1\Omega_1^{-1}a_1
-\frac{1}{n_t}E_0^{\top}E_0(H_1^{\top})^{\top}\Omega_1^{-1}a_1
+S_{\widetilde{q}}^{\top}(\widehat{H}_M\widetilde{\delta}_0-H_M\delta_0). v = H 1 ( Ω 1 − n t 1 F 1 ⊤ F 1 ) Ω 1 − 1 a 1 − n t 1 H 1 F 1 ⊤ E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 − n t 1 E 0 ⊤ F 1 Ω 1 − 1 a 1 − n t 1 E 0 ⊤ E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 + S q ⊤ ( H M δ 0 − H M δ 0 ) .
For the component U ⊤ v U^{\top}v U ⊤ v , we use U ⊤ H 1 = R U^{\top}H_1=R U ⊤ H 1 = R and ∥ R ∥ o p = O p ( 1 ) \|R\|_{\mathrm{op}}=O_p(1) ∥ R ∥ op = O p ( 1 ) . Here, the sample factor term is O p ( n t − 1 / 2 ) O_p(n_t^{-1/2}) O p ( n t − 1/2 ) by Part 3 of the proof of Theorem 5.2, the next three terms are O p ( { n t ( p ∧ q ) } − 1 / 2 + ( p ∧ q ) − 1 ) O_p(\{n_t(p\wedge q)\}^{-1/2}+(p\wedge q)^{-1}) O p ({ n t ( p ∧ q ) } − 1/2 + ( p ∧ q ) − 1 ) by Lemma C.2(i)–(ii), and the last term is controlled by (C.59). Hence, we have that
∥ U ⊤ v ∥ = O p ( 1 m + 1 p + 1 q ) . \|U^{\top}v\|=O_p\left(\frac{1}{\sqrt{m}}+\frac{1}{\sqrt{p}}+\frac{1}{\sqrt{q}}\right). ∥ U ⊤ v ∥ = O p ( m 1 + p 1 + q 1 ) .
For the null-space component, S ⊤ H 1 = 0 S^{\top}H_1=0 S ⊤ H 1 = 0 removes the first two terms. The third term is as n t − 1 E ~ S ⊤ F 1 Ω 1 − 1 a 1 = O p ( n t − 1 / 2 ) n_t^{-1}\widetilde{E}_S^{\top}F_1\Omega_1^{-1}a_1=O_p(n_t^{-1/2}) n t − 1 E S ⊤ F 1 Ω 1 − 1 a 1 = O p ( n t − 1/2 ) by Step 2 of Lemma C.7. The fourth term is n t − 1 E ~ S ⊤ E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = O p ( p − 1 / 2 + q − 1 / 2 ) n_t^{-1}\widetilde{E}_S^{\top}E_0(H_1^{\top})^{\top}\Omega_1^{-1}a_1=O_p(p^{-1/2}+q^{-1/2}) n t − 1 E S ⊤ E 0 ( H 1 ⊤ ) ⊤ Ω 1 − 1 a 1 = O p ( p − 1/2 + q − 1/2 ) by the K 2 K_2 K 2 bound in that lemma with Ω 1 − 1 a 1 \Omega_1^{-1}a_1 Ω 1 − 1 a 1 in place of our Δ \Delta Δ . For the last term, the block form of S S S gives us that
Σ S − 1 / 2 S ⊤ S q ~ ( H ^ M δ ~ 0 − H M δ 0 ) = ( 0 q Ω M − 1 / 2 S M ⊤ H ^ M δ ~ 0 ) , \Sigma_S^{-1/2}S^{\top}S_{\widetilde{q}}(\widehat{H}_M\widetilde{\delta}_0-H_M\delta_0)
=\begin{pmatrix}
0\\
\sqrt{q}\Omega_M^{-1/2}S_M^{\top}\widehat{H}_M\widetilde{\delta}_0
\end{pmatrix}, Σ S − 1/2 S ⊤ S q ( H M δ 0 − H M δ 0 ) = ( 0 q Ω M − 1/2 S M ⊤ H M δ 0 ) ,
which is O p ( m − 1 / 2 ) O_p(m^{-1/2}) O p ( m − 1/2 ) using Equation (C.60). So, we have that
∥ Σ S − 1 / 2 S ⊤ v ∥ = O p ( 1 m + 1 p + 1 q ) . \left\|\Sigma_S^{-1/2}S^\top v\right\|=O_p\left(\frac{1}{\sqrt{m}}+\frac{1}{\sqrt{p}}+\frac{1}{\sqrt{q}}\right). Σ S − 1/2 S ⊤ v = O p ( m 1 + p 1 + q 1 ) .
We combine the two parts with Equations (C.56) and (C.61). This gives us that
1 n t ∑ i : A i = 1 ∣ h ^ 1 , i − h 1 , i ∣ 2 ≤ O p ( 1 ) ( ∥ U ⊤ v ∥ 2 + ∥ Σ S − 1 / 2 S ⊤ v ∥ 2 ) + O p ( 1 p ∧ q ) = O p ( 1 m + 1 p + 1 q ) . (88) \frac{1}{n_t}\sum_{i:A_i=1}\left|\widehat{h}_{1,i}-h_{1,i}\right|^2\leq O_p(1)\left(\left\|U^\top v\right\|^2+\left\|\Sigma_S^{-1/2}S^\top v\right\|^2\right)+O_p\left(\frac{1}{p\wedge q}\right)=O_p\left(\frac{1}{m}+\frac{1}{p}+\frac{1}{q}\right). \tag*{(88)} n t 1 i : A i = 1 ∑ h 1 , i − h 1 , i 2 ≤ O p ( 1 ) ( U ⊤ v 2 + Σ S − 1/2 S ⊤ v 2 ) + O p ( p ∧ q 1 ) = O p ( m 1 + p 1 + q 1 ) . (88)
For control part, there is no estimated mediator intercept. Now, by applying the same decomposition with e 1 = H X 1 e 1 , 1 + p ˉ e_1=\mathbf{H}_{X_1}e_{1,1+\bar{p}} e 1 = H X 1 e 1 , 1 + p ˉ , ( H X 1 ⊤ ) Ω X 1 − 1 e 1 , 1 + p ˉ (\mathbf{H}_{X_1}^\top)\Omega_{X_1}^{-1}e_{1,1+\bar{p}} ( H X 1 ⊤ ) Ω X 1 − 1 e 1 , 1 + p ˉ , and the X X X -only versions of Equation (C.56) and Lemma C.2 gives us that
1 n c ∑ i : A i = 0 ∣ h ^ 0 , i − h 0 , i ∣ 2 = O p ( 1 m + 1 p ) . (89) \frac{1}{n_c}\sum_{i:A_i=0}\left|\widehat{h}_{0,i}-h_{0,i}\right|^2=O_p\left(\frac{1}{m}+\frac{1}{p}\right). \tag*{(89)} n c 1 i : A i = 0 ∑ h 0 , i − h 0 , i 2 = O p ( m 1 + p 1 ) . (89)
To bound the treated weights, consider the transformed vector
b = ( U ⊤ H ^ 1 a 1 Σ S − 1 / 2 S ⊤ H ^ 1 a 1 ) . b=\begin{pmatrix}U^\top\widehat{H}_{1a_1}\\ \Sigma_S^{-1/2}S^\top\widehat{H}_{1a_1}\end{pmatrix}. b = ( U ⊤ H 1 a 1 Σ S − 1/2 S ⊤ H 1 a 1 ) .
By Equation (C.59) and the boundedness of ∥ H 1 a 1 ∥ \left\|H_{1a_1}\right\| ∥ H 1 a 1 ∥ , the first block is O p ( 1 ) O_p(1) O p ( 1 ) . Since S ⊤ H 1 = 0 S^\top H_1=0 S ⊤ H 1 = 0 , Equation (C.60), and the block structure of Σ S \Sigma_S Σ S give ∥ Σ S − 1 / 2 S ⊤ H ^ 1 a 1 ∥ = O p ( m − 1 / 2 ) \left\|\Sigma_S^{-1/2}S^\top\widehat{H}_{1a_1}\right\|=O_p(m^{-1/2}) Σ S − 1/2 S ⊤ H 1 a 1 = O p ( m − 1/2 ) . Thus, ∥ b ∥ = O p ( 1 ) \|b\|=O_p(1) ∥ b ∥ = O p ( 1 ) . Together with ∥ M ^ − 1 ∥ o p = O p ( 1 ) \|\widehat{M}^{-1}\|_{\mathrm{op}}=O_p(1) ∥ M − 1 ∥ op = O p ( 1 ) , this gives
∣ h ^ 1 , i ∣ ≤ O p ( 1 ) ( ∥ Z ^ i ∥ + ∥ e ~ S , i ∥ ) , \left|\widehat{h}_{1,i}\right|\leq O_p(1)\left(\|\widehat{Z}_i\|+\|\widetilde{e}_{S,i}\|\right), h 1 , i ≤ O p ( 1 ) ( ∥ Z i ∥ + ∥ e S , i ∥ ) ,
uniformly in i i i . Using Assumption 5.1(i), the true factors and the structural errors have sub-Gaussian projections with parameter at most C C C . The same holds for f M , i f_{M,i} f M , i which is a linear combination of f X , i f_{X,i} f X , i and u X M , a , i u_{XM,a,i} u X M , a , i . Since W X = p V X W_X=\sqrt{p}V_X W X = p V X , each coordinate of e X , i e_{X,i} e X , i is p − 1 / 2 p^{-1/2} p − 1/2 times a unit projection of u X , i u_{X,i} u X , i . The X X X -block of e ~ S , i \widetilde{e}_{S,i} e S , i is Ω X − 1 / 2 ( V X S X ) ⊤ u X , i \Omega_X^{-1/2}(V_XS_X)^\top u_{X,i} Ω X − 1/2 ( V X S X ) ⊤ u X , i , and V X S X V_XS_X V X S X has orthonormal columns. So, the coordinates of e 0 i e_{0i} e 0 i and e ~ S , i \widetilde{e}_{S,i} e S , i are sub-Gaussian with parameters bounded by a constant. The mediator part is also handled in the same way. The number of coordinates is fixed, so a union bound over the m m m observations gives us
max i ∈ D k : A i = 1 ( ∣ h ^ 1 , i ∣ 2 + ∣ ϵ 1 , i ∣ 2 ) = O p ( log m ) , max i ∈ D k : A i = 0 ( ∣ h ^ 0 , i ∣ 2 + ∣ η i ∣ 2 ) = O p ( log m ) . (90) \max_{i\in D_k:A_i=1}\left(\left|\widehat{h}_{1,i}\right|^2+\left|\epsilon_{1,i}\right|^2\right)=O_p(\log m),\qquad\max_{i\in D_k:A_i=0}\left(\left|\widehat{h}_{0,i}\right|^2+\left|\eta_i\right|^2\right)=O_p(\log m). \tag*{(90)} i ∈ D k : A i = 1 max ( h 1 , i 2 + ∣ ϵ 1 , i ∣ 2 ) = O p ( log m ) , i ∈ D k : A i = 0 max ( h 0 , i 2 + ∣ η i ∣ 2 ) = O p ( log m ) . (90)
The control bound uses Equation (C.57) in the same way that together with η i = γ 1 ⊤ u X M , 0 , i \eta_i=\gamma_1^\top u_{XM,0,i} η i = γ 1 ⊤ u X M , 0 , i , and ∥ γ 1 ∥ = O ( 1 ) \|\gamma_1\|=O(1) ∥ γ 1 ∥ = O ( 1 ) .
We compare the least-squares residuals with the structural errors, beginning with the treated observations. Using Equations (A.2) and (A.1), the outcome satisfies the exact identity Y = Z ^ δ + ϵ 1 − E 0 δ Y=\widehat{Z}\delta+\epsilon_1-E_0\delta Y = Z δ + ϵ 1 − E 0 δ . Proposition 5.1 and Assumption 3.2(i) give ∥ δ ∥ = O p ( 1 ) \|\delta\|=O_p(1) ∥ δ ∥ = O p ( 1 ) . We know that the least-squares residuals are ϵ ^ 1 = ( I − P Z ^ ) Y \widehat{\epsilon}_1=(I-P_{\widehat{Z}})Y ϵ 1 = ( I − P Z ) Y . Since ( I − P Z ^ ) Z ^ = 0 (I-P_{\widehat{Z}})\widehat{Z}=0 ( I − P Z ) Z = 0 , we have that
ϵ ^ 1 − ϵ 1 = ( I − P Z ^ ) ( ϵ 1 − E 0 δ ) − ϵ 1 = − ( I − P Z ^ ) E 0 δ − P Z ^ ϵ 1 . \widehat{\epsilon}_1-\epsilon_1=(I-P_{\widehat{Z}})(\epsilon_1-E_0\delta)-\epsilon_1=-(I-P_{\widehat{Z}})E_0\delta-P_{\widehat{Z}}\epsilon_1. ϵ 1 − ϵ 1 = ( I − P Z ) ( ϵ 1 − E 0 δ ) − ϵ 1 = − ( I − P Z ) E 0 δ − P Z ϵ 1 .
The first term comes from the use of projected factors. By Lemma C.2 (i), ∥ E 0 δ ∥ 2 ≤ ∥ E 0 ∥ o p 2 ∥ δ ∥ 2 = O p ( n t ( p ∧ q ) − 1 ) \|E_0\delta\|^2\leq\|E_0\|_{\mathrm{op}}^2\|\delta\|^2=O_p(n_t(p\wedge q)^{-1}) ∥ E 0 δ ∥ 2 ≤ ∥ E 0 ∥ op 2 ∥ δ ∥ 2 = O p ( n t ( p ∧ q ) − 1 ) . For the second term, the structural outcome errors are independent of the projected design, conditional on the training fold, and have bounded variance. Let T \mathcal{T} T denote information from the training fold. The rank of P Z ^ P_{\widehat{Z}} P Z is at most 1 + p ~ + q ~ 1+\widetilde{p}+\widetilde{q} 1 + p + q . Hence E ( ∥ P Z ^ ϵ 1 ∥ 2 ∣ Z ^ , T ) ≤ C ( 1 + p ~ + q ~ ) \mathbb{E}(\|P_{\widehat{Z}}\epsilon_1\|^2\mid\widehat{Z},\mathcal{T})\leq C(1+\widetilde{p}+\widetilde{q}) E ( ∥ P Z ϵ 1 ∥ 2 ∣ Z , T ) ≤ C ( 1 + p + q ) , and so ∥ P Z ^ ϵ 1 ∥ 2 = O p ( 1 ) \|P_{\widehat{Z}}\epsilon_1\|^2=O_p(1) ∥ P Z ϵ 1 ∥ 2 = O p ( 1 ) . An orthogonal projector does not increase the Euclidean norm. Therefore, we have that
1 n t ∑ i : A i = 1 ∣ ϵ ^ 1 , i − ϵ 1 , i ∣ 2 ≤ 2 n t ∥ E 0 δ ∥ 2 + 2 n t ∥ P Z ^ ϵ 1 ∥ 2 = O p ( 1 p ∧ q ) + O p ( 1 n t ) = O p ( 1 m + 1 p + 1 q ) . (91) \begin{aligned}
\frac{1}{n_t}\sum_{i:A_i=1}\left|\widehat{\epsilon}_{1,i}-\epsilon_{1,i}\right|^2\leq\frac{2}{n_t}\|E_0\delta\|^2+\frac{2}{n_t}\|P_{\widehat{Z}}\epsilon_1\|^2 \\
&=O_p\left(\frac{1}{p\wedge q}\right)+O_p\left(\frac{1}{n_t}\right) \\
&=O_p\left(\frac{1}{m}+\frac{1}{p}+\frac{1}{q}\right). \tag*{(91)}
\end{aligned} n t 1 i : A i = 1 ∑ ∣ ϵ 1 , i − ϵ 1 , i ∣ 2 ≤ n t 2 ∥ E 0 δ ∥ 2 + n t 2 ∥ P Z ϵ 1 ∥ 2 = O p ( p ∧ q 1 ) + O p ( n t 1 ) = O p ( m 1 + p 1 + q 1 ) . (91)
Now, we turn to the control bridge. In the proof of Theorem 5.2, Equation (C.21) and the expansion of γ 1 ⊤ δ 0 \gamma_1^\top\delta_0 γ 1 ⊤ δ 0 that follows it write the bridge response as b = R ϕ + Δ γ , n δ 0 ⋅ 1 n c + R ~ c + η + R n b=R\phi+\Delta_{\gamma,n}\delta_0\cdot\mathbf{1}_{n_c}+\widetilde{R}c+\eta+\mathcal{R}_n b = R ϕ + Δ γ , n δ 0 ⋅ 1 n c + R c + η + R n . Since R = R ^ − E X 0 R=\widehat{R}-E_{X0} R = R − E X 0 and 1 n c = R ^ e 1 \mathbf{1}_{n_c}=\widehat{R}e_1 1 n c = R e 1 , then we have
b = R ^ ( ϕ + c ~ + Δ γ , n δ 0 e 1 ) + η + R n − E X 0 ϕ . b=\widehat{R}\left(\phi+\widetilde{c}+\Delta_{\gamma,n}\delta_0e_1\right)+\eta+\mathcal{R}_n-E_{X0}\phi. b = R ( ϕ + c + Δ γ , n δ 0 e 1 ) + η + R n − E X 0 ϕ .
Since ( I − P R ^ ) R ^ = 0 (I-P_{\widehat{R}})\widehat{R}=0 ( I − P R ) R = 0 , the control least-squares residuals satisfy
η ^ − η = ( I − P R ^ ) b − η = ( I − P R ^ ) ( η + R n − E X 0 ϕ ) − η = ( I − P R ^ ) ( R n − E X 0 ϕ ) − P R ^ η . \widehat{\eta}-\eta=(I-P_{\widehat{R}})b-\eta
=(I-P_{\widehat{R}})(\eta+R_n-\mathbf{E}X_0\phi)-\eta
=(I-P_{\widehat{R}})(R_n-\mathbf{E}X_0\phi)-P_{\widehat{R}}\eta. η − η = ( I − P R ) b − η = ( I − P R ) ( η + R n − E X 0 ϕ ) − η = ( I − P R ) ( R n − E X 0 ϕ ) − P R η .
We bound the three pieces. Here, Part 2 of the proof of Theorem 5.2 gives us that ∥ ϕ ∥ = O p ( 1 ) \lVert\phi\rVert=O_p(1) ∥ ϕ ∥ = O p ( 1 ) , and the X X X -only version of Lemma C.2 (i) gives us ∥ E X 0 ∥ o p = O p ( n c / p ) \lVert\mathbf{E}X_0\rVert_{\mathrm{op}}=O_p(n_c/p) ∥ E X 0 ∥ op = O p ( n c / p ) . So, we have that n c − 1 ∥ E X 0 ϕ ∥ 2 = O p ( p − 1 ) n_c^{-1}\lVert\mathbf{E}X_0\phi\rVert^2=O_p(p^{-1}) n c − 1 ∥ E X 0 ϕ ∥ 2 = O p ( p − 1 ) .
The remainder has entries ( R n ) i = Δ γ , n ⊤ u X M , 0 , i − Δ γ , n ⊤ B 0 H X e T X i + γ ^ 1 e M i (R_n)_i=\Delta_{\gamma,n}^{\top}u_{XM,0,i}-\Delta_{\gamma,n}^{\top}B_0H^{\mathsf{T}}_{X e}X_i+\widehat{\gamma}_1e_{M_i} ( R n ) i = Δ γ , n ⊤ u X M , 0 , i − Δ γ , n ⊤ B 0 H X e T X i + γ 1 e M i . Now, conditional on the training fold and the treated observations, Δ γ , n \Delta_{\gamma,n} Δ γ , n and γ ^ 1 \widehat{\gamma}_1 γ 1 are fixed and the control observations are independent. Lemma C.6 gives ∥ Δ γ , n ∥ = O p ( n t − 1 / 2 ) \lVert\Delta_{\gamma,n}\rVert=O_p(n_t^{-1/2}) ∥ Δ γ , n ∥ = O p ( n t − 1/2 ) , so the first two entries have empirical second moments of order O p ( n t − 1 ) O_p(n_t^{-1}) O p ( n t − 1 ) . For the third entry, we split γ ^ 1 \widehat{\gamma}_1 γ 1 as in (C.17). The row-space part has second moment O p ( q − 1 ) O_p(q^{-1}) O p ( q − 1 ) , since ∥ H M T ∥ o p = O p ( 1 ) \lVert H_M^{\mathsf{T}}\rVert_{\mathrm{op}}=O_p(1) ∥ H M T ∥ op = O p ( 1 ) and E ∥ e M i ∥ 2 = O ( q − 1 ) \mathbb{E}\lVert e_{M_i}\rVert^2=O(q^{-1}) E ∥ e M i ∥ 2 = O ( q − 1 ) . The null-space part has conditional variance O p ( n t − 1 ) O_p(n_t^{-1}) O p ( n t − 1 ) by (C.18). Hence, we have that
1 n c ∥ R n ∥ 2 = O p ( 1 n t ) + O p ( 1 q ) + O p ( 1 n t ) = O p ( 1 n t + 1 q ) . \frac{1}{n_c}\lVert R_n\rVert^2=O_p\left(\frac{1}{n_t}\right)+O_p\left(\frac{1}{q}\right)+O_p\left(\frac{1}{n_t}\right)=O_p\left(\frac{1}{n_t}+\frac{1}{q}\right). n c 1 ∥ R n ∥ 2 = O p ( n t 1 ) + O p ( q 1 ) + O p ( n t 1 ) = O p ( n t 1 + q 1 ) .
Using Assumption 3.1(ii), the η i \eta_i η i are also independent of the control projected design as mentioned earlier, conditional on the training fold and the treated observations, and have bounded variance. The rank of P R ^ P_{\widehat{R}} P R is at most 1 + p ~ 1+\widetilde{p} 1 + p . So, we have that ∥ P R ^ η ∥ 2 = O p ( 1 ) \lVert P_{\widehat{R}}\eta\rVert^2=O_p(1) ∥ P R η ∥ 2 = O p ( 1 ) . We combine the three bounds with the contraction property of an orthogonal projector. This gives us that
1 n c ∑ i : A i = 0 ∣ η ^ i − η i ∣ 2 ≤ 4 n c ∥ R n ∥ 2 + 4 n c ∥ E X 0 ϕ ∥ 2 + 2 n c ∥ P R ^ η ∥ 2 = O p ( 1 n t + 1 q ) + O p ( 1 p ) + O p ( 1 n c ) = O p ( 1 m + 1 p + 1 q ) . (92) \begin{aligned}
\frac{1}{n_c}\sum_{i:A_i=0}\lvert\widehat{\eta}_i-\eta_i\rvert^2
\leq\frac{4}{n_c}\lVert R_n\rVert^2+\frac{4}{n_c}\lVert\mathbf{E}X_0\phi\rVert^2+\frac{2}{n_c}\lVert P_{\widehat{R}}\eta\rVert^2 \\
&=O_p\left(\frac{1}{n_t}+\frac{1}{q}\right)+O_p\left(\frac{1}{p}\right)+O_p\left(\frac{1}{n_c}\right) \\
&=O_p\left(\frac{1}{m}+\frac{1}{p}+\frac{1}{q}\right). \tag*{(92)}
\end{aligned} n c 1 i : A i = 0 ∑ ∣ η i − η i ∣ 2 ≤ n c 4 ∥ R n ∥ 2 + n c 4 ∥ E X 0 ϕ ∥ 2 + n c 2 ∥ P R η ∥ 2 = O p ( n t 1 + q 1 ) + O p ( p 1 ) + O p ( n c 1 ) = O p ( m 1 + p 1 + q 1 ) . (92)
Now, to the estimated influence function. For treated observations,
h ^ 1 , i ϵ ^ 1 , i − h 1 , i ϵ 1 , i = h ^ 1 , i ( ϵ ^ 1 , i − ϵ 1 , i ) + ( h ^ 1 , i − h 1 , i ) ϵ 1 , i . \widehat{h}_{1,i}\widehat{\epsilon}_{1,i}-h_{1,i}\epsilon_{1,i}
=\widehat{h}_{1,i}(\widehat{\epsilon}_{1,i}-\epsilon_{1,i})+(\widehat{h}_{1,i}-h_{1,i})\epsilon_{1,i}. h 1 , i ϵ 1 , i − h 1 , i ϵ 1 , i = h 1 , i ( ϵ 1 , i − ϵ 1 , i ) + ( h 1 , i − h 1 , i ) ϵ 1 , i .
We apply ( x + y ) 2 ≤ 2 x 2 + 2 y 2 (x+y)^2\leq2x^2+2y^2 ( x + y ) 2 ≤ 2 x 2 + 2 y 2 and then we have from the Equations (C.62), (C.64), and (C.65) that
1 n t ∑ i : A i = 1 ∣ h ^ 1 , i ϵ ^ 1 , i − h 1 , i ϵ 1 , i ∣ 2 ≤ 2 n t ∑ i : A i = 1 ∣ h ^ 1 , i ∣ 2 ∣ ϵ ^ 1 , i − ϵ 1 , i ∣ 2 + 2 n t ∑ i : A i = 1 ∣ h ^ 1 , i − h 1 , i ∣ 2 ∣ ϵ 1 , i ∣ 2 \frac{1}{n_t}\sum_{i:A_i=1}\lvert\widehat{h}_{1,i}\widehat{\epsilon}_{1,i}-h_{1,i}\epsilon_{1,i}\rvert^2
\leq\frac{2}{n_t}\sum_{i:A_i=1}\lvert\widehat{h}_{1,i}\rvert^2\lvert\widehat{\epsilon}_{1,i}-\epsilon_{1,i}\rvert^2+\frac{2}{n_t}\sum_{i:A_i=1}\lvert\widehat{h}_{1,i}-h_{1,i}\rvert^2\lvert\epsilon_{1,i}\rvert^2 n t 1 i : A i = 1 ∑ ∣ h 1 , i ϵ 1 , i − h 1 , i ϵ 1 , i ∣ 2 ≤ n t 2 i : A i = 1 ∑ ∣ h 1 , i ∣ 2 ∣ ϵ 1 , i − ϵ 1 , i ∣ 2 + n t 2 i : A i = 1 ∑ ∣ h 1 , i − h 1 , i ∣ 2 ∣ ϵ 1 , i ∣ 2
≤ 2 max i : A i = 1 ∣ h ^ 1 , i ∣ 2 1 n t ∑ i : A i = 1 ∣ ϵ ^ 1 , i − ϵ 1 , i ∣ 2 + 2 max i : A i = 1 ∣ ϵ 1 , i ∣ 2 1 n t ∑ i : A i = 1 ∣ h ^ 1 , i − h 1 , i ∣ 2 = O p ( log m ( 1 m + 1 p + 1 q ) ) . \begin{aligned}
\leq2\max_{i:A_i=1}\lvert\widehat{h}_{1,i}\rvert^2\frac{1}{n_t}\sum_{i:A_i=1}\lvert\widehat{\epsilon}_{1,i}-\epsilon_{1,i}\rvert^2+2\max_{i:A_i=1}\lvert\epsilon_{1,i}\rvert^2\frac{1}{n_t}\sum_{i:A_i=1}\lvert\widehat{h}_{1,i}-h_{1,i}\rvert^2 \\
&=O_p\left(\log m\left(\frac{1}{m}+\frac{1}{p}+\frac{1}{q}\right)\right).
\end{aligned} ≤ 2 i : A i = 1 max ∣ h 1 , i ∣ 2 n t 1 i : A i = 1 ∑ ∣ ϵ 1 , i − ϵ 1 , i ∣ 2 + 2 i : A i = 1 max ∣ ϵ 1 , i ∣ 2 n t 1 i : A i = 1 ∑ ∣ h 1 , i − h 1 , i ∣ 2 = O p ( log m ( m 1 + p 1 + q 1 ) ) .
Now, using the same argument for the control part with Equations (C.63) and (C.66), gives us that
1 n c ∑ i : A i = 0 ∣ h ^ 0 , i η ^ i − h 0 , i η i ∣ 2 = O p ( log m ( 1 m + 1 p + 1 q ) ) . \frac{1}{n_c}\sum_{i:A_i=0}\lvert\widehat{h}_{0,i}\widehat{\eta}_i-h_{0,i}\eta_i\rvert^2
=O_p\left(\log m\left(\frac{1}{m}+\frac{1}{p}+\frac{1}{q}\right)\right). n c 1 i : A i = 0 ∑ ∣ h 0 , i η i − h 0 , i η i ∣ 2 = O p ( log m ( m 1 + p 1 + q 1 ) ) .
The last equality uses Assumption 5.2 and m ≍ n m\asymp n m ≍ n . Since π ^ 1 → p π 1 \widehat{\pi}_1\xrightarrow{p}\pi_1 π 1 p π 1 and π ^ 0 → p π 0 \widehat{\pi}_0\xrightarrow{p}\pi_0 π 0 p π 0 where π 1 , π 0 > 0 \pi_1,\pi_0>0 π 1 , π 0 > 0 using Assumption 5.1(iii), and the empirical second moments of ξ 1 , i \xi_{1,i} ξ 1 , i and ξ 2 , i \xi_{2,i} ξ 2 , i are bounded in probability, replacing π 1 \pi_1 π 1 and π 0 \pi_0 π 0 by π ^ 1 \widehat{\pi}_1 π 1 and π ^ 0 \widehat{\pi}_0 π 0 , we get that
1 m ∑ i ∈ D k ( ψ ^ k , i − ψ i ) 2 = o p ( 1 ) . (93) \frac{1}{m}\sum_{i\in\mathcal{D}_k}(\widehat{\psi}_{k,i}-\psi_i)^2=o_p(1). \tag*{(93)} m 1 i ∈ D k ∑ ( ψ k , i − ψ i ) 2 = o p ( 1 ) . (93)
Also, the same argument applies to the other fold. There are only two folds, so we have that
1 n ∑ k = 1 2 ∑ i ∈ D k ( ψ ^ k , i − ψ i ) 2 = o p ( 1 ) . (94) \frac{1}{n}\sum_{k=1}^{2}\sum_{i\in\mathcal{D}_k}(\widehat{\psi}_{k,i}-\psi_i)^2=o_p(1). \tag*{(94)} n 1 k = 1 ∑ 2 i ∈ D k ∑ ( ψ k , i − ψ i ) 2 = o p ( 1 ) . (94)
Now, when we compare the empirical second moments by adding and subtracting n − 1 ∑ i = 1 n ψ i 2 n^{-1}\sum_{i=1}^{n}\psi_i^2 n − 1 ∑ i = 1 n ψ i 2 , we get that
σ ^ 2 − σ 2 = 1 n ∑ k = 1 2 ∑ i ∈ D k ( ψ ^ k , i 2 − ψ i 2 ) + ( 1 n ∑ i = 1 n ψ i 2 − σ 2 ) . \hat{\sigma}^2-\sigma^2=\frac{1}{n}\sum_{k=1}^{2}\sum_{i\in D_k}\left(\hat{\psi}_{k,i}^2-\psi_i^2\right)+\left(\frac{1}{n}\sum_{i=1}^{n}\psi_i^2-\sigma^2\right). σ ^ 2 − σ 2 = n 1 k = 1 ∑ 2 i ∈ D k ∑ ( ψ ^ k , i 2 − ψ i 2 ) + ( n 1 i = 1 ∑ n ψ i 2 − σ 2 ) .
Using the Steps 4 and 6 of Part 3 in the proof of Theorem 5.2, the ψ i \psi_i ψ i are i.i.d. with mean zero, and Equation (C.50) gives E ( ψ i 2 ) = σ 2 \mathbb{E}(\psi_i^2)=\sigma^2 E ( ψ i 2 ) = σ 2 . Therefore, the law of large numbers gives n − 1 ∑ i = 1 n ψ i 2 − σ 2 = o p ( 1 ) n^{-1}\sum_{i=1}^{n}\psi_i^2-\sigma^2=o_p(1) n − 1 ∑ i = 1 n ψ i 2 − σ 2 = o p ( 1 ) . For the first term, we simply use x 2 − y 2 = ( x − y ) ( x + y ) x^2-y^2=(x-y)(x+y) x 2 − y 2 = ( x − y ) ( x + y ) and using the Cauchy-Schwarz inequality. This gives us that
∣ 1 n ∑ k = 1 2 ∑ i ∈ D k ( ψ ^ k , i 2 − ψ i 2 ) ∣ ≤ { 1 n ∑ k = 1 2 ∑ i ∈ D k ( ψ ^ k , i − ψ i ) 2 } 1 / 2 { 1 n ∑ k = 1 2 ∑ i ∈ D k ( ψ ^ k , i + ψ i ) 2 } 1 / 2 . \left|\frac{1}{n}\sum_{k=1}^{2}\sum_{i\in D_k}\left(\hat{\psi}_{k,i}^2-\psi_i^2\right)\right|\leq\left\{\frac{1}{n}\sum_{k=1}^{2}\sum_{i\in D_k}\left(\hat{\psi}_{k,i}-\psi_i\right)^2\right\}^{1/2}\left\{\frac{1}{n}\sum_{k=1}^{2}\sum_{i\in D_k}\left(\hat{\psi}_{k,i}+\psi_i\right)^2\right\}^{1/2}. n 1 k = 1 ∑ 2 i ∈ D k ∑ ( ψ ^ k , i 2 − ψ i 2 ) ≤ { n 1 k = 1 ∑ 2 i ∈ D k ∑ ( ψ ^ k , i − ψ i ) 2 } 1/2 { n 1 k = 1 ∑ 2 i ∈ D k ∑ ( ψ ^ k , i + ψ i ) 2 } 1/2 .
the first term is o p ( 1 ) o_p(1) o p ( 1 ) using Equation (C.68). For the second factor, we write x + y = ( x − y ) + 2 y x+y=(x-y)+2y x + y = ( x − y ) + 2 y , so that ( x + y ) 2 ≤ 2 ( x − y ) 2 + 8 y 2 (x+y)^2\leq2(x-y)^2+8y^2 ( x + y ) 2 ≤ 2 ( x − y ) 2 + 8 y 2 . Then
1 n ∑ k = 1 2 ∑ i ∈ D k ( ψ ^ k , i + ψ i ) 2 ≤ 2 n ∑ k = 1 2 ∑ i ∈ D k ( ψ ^ k , i − ψ i ) 2 + 8 n ∑ i = 1 n ψ i 2 = O p ( 1 ) . \frac{1}{n}\sum_{k=1}^{2}\sum_{i\in D_k}\left(\hat{\psi}_{k,i}+\psi_i\right)^2\leq\frac{2}{n}\sum_{k=1}^{2}\sum_{i\in D_k}\left(\hat{\psi}_{k,i}-\psi_i\right)^2+\frac{8}{n}\sum_{i=1}^{n}\psi_i^2=O_p(1). n 1 k = 1 ∑ 2 i ∈ D k ∑ ( ψ ^ k , i + ψ i ) 2 ≤ n 2 k = 1 ∑ 2 i ∈ D k ∑ ( ψ ^ k , i − ψ i ) 2 + n 8 i = 1 ∑ n ψ i 2 = O p ( 1 ) .
Therefore, the first term is o p ( 1 ) o_p(1) o p ( 1 ) , and hence, we have σ ^ 2 − σ 2 = o p ( 1 ) \hat{\sigma}^2-\sigma^2=o_p(1) σ ^ 2 − σ 2 = o p ( 1 ) . Finally, Theorem 5.2 gives us that n ( θ ^ 0 c f − θ 0 ) → d N ( 0 , σ 2 ) \sqrt{n}(\hat{\theta}^{\mathrm{cf}}_0-\theta_0)\xrightarrow{d}N(0,\sigma^2) n ( θ ^ 0 cf − θ 0 ) d N ( 0 , σ 2 ) , and its proof shows σ 2 ≥ c > 0 \sigma^2\geq c>0 σ 2 ≥ c > 0 . So, the consistency of σ ^ 2 \hat{\sigma}^2 σ ^ 2 implies σ ^ → p σ \hat{\sigma}\xrightarrow{p}\sigma σ ^ p σ . Using Slutsky’s theorem, we get that
n ( θ ^ 0 c f − θ 0 ) σ ^ = n ( θ ^ 0 c f − θ 0 ) σ σ σ ^ → d N ( 0 , 1 ) . \frac{\sqrt{n}(\hat{\theta}^{\mathrm{cf}}_0-\theta_0)}{\hat{\sigma}}=\frac{\sqrt{n}(\hat{\theta}^{\mathrm{cf}}_0-\theta_0)}{\sigma}\frac{\sigma}{\hat{\sigma}}\xrightarrow{d}N(0,1). σ ^ n ( θ ^ 0 cf − θ 0 ) = σ n ( θ ^ 0 cf − θ 0 ) σ ^ σ d N ( 0 , 1 ) .
Auxiliary Material
Technical Lemmas
Lemma D.1 (Inverse of an augmented second-moment matrix). Suppose Assumptions 3.1 and 3.2 hold. Let H = diag ( H X , H M ) \mathbf{H}=\operatorname{diag}(\mathbf{H}_X,\mathbf{H}_M) H = diag ( H X , H M ) where H X \mathbf{H}_X H X and H M \mathbf{H}_M H M be defined as in Definition 3.1, and e = ( e X ⊤ e M ⊤ ) ⊤ \mathbf{e}=(e_X^\top\ e_M^\top)^\top e = ( e X ⊤ e M ⊤ ) ⊤ be a vector with mean zero, covariance Σ e ≻ 0 \boldsymbol{\Sigma}_e\succ0 Σ e ≻ 0 as defined in Section A.1. Set L = ( 1 , ( H f + e ) ⊤ ) ⊤ \mathbf{L}=(1,(\mathbf{Hf}+\mathbf{e})^\top)^\top L = ( 1 , ( Hf + e ) ⊤ ) ⊤ , then M : = E [ L L ⊤ ∣ A = 1 ] \mathbf{M}:=\mathbb{E}[\mathbf{L}\mathbf{L}^\top\mid A=1] M := E [ L L ⊤ ∣ A = 1 ] is invertible, with
M − 1 = ( 1 + μ f ∣ 1 ⊤ H ⊤ ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 H μ f ∣ 1 − μ f ∣ 1 ⊤ H ⊤ ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 H − ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 H μ f ∣ 1 ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 ) . \mathbf{M}^{-1}=
\begin{pmatrix}
1+\boldsymbol{\mu}_{f\mid1}^{\top}\mathbf{H}^{\top}(\mathbf{H}\boldsymbol{\Sigma}_{f\mid1}\mathbf{H}^{\top}+\boldsymbol{\Sigma}_e)^{-1}\mathbf{H}\boldsymbol{\mu}_{f\mid1} & -\boldsymbol{\mu}_{f\mid1}^{\top}\mathbf{H}^{\top}(\mathbf{H}\boldsymbol{\Sigma}_{f\mid1}\mathbf{H}^{\top}+\boldsymbol{\Sigma}_e)^{-1}\mathbf{H}\\
-(\mathbf{H}\boldsymbol{\Sigma}_{f\mid1}\mathbf{H}^{\top}+\boldsymbol{\Sigma}_e)^{-1}\mathbf{H}\boldsymbol{\mu}_{f\mid1} & (\mathbf{H}\boldsymbol{\Sigma}_{f\mid1}\mathbf{H}^{\top}+\boldsymbol{\Sigma}_e)^{-1}
\end{pmatrix}. M − 1 = ( 1 + μ f ∣ 1 ⊤ H ⊤ ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 H μ f ∣ 1 − ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 H μ f ∣ 1 − μ f ∣ 1 ⊤ H ⊤ ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 H ( H Σ f ∣ 1 H ⊤ + Σ e ) − 1 ) .
Proof. Using Assumption 3.1(ii), we know that e \mathbf{e} e do not depend on A A A , so E [ e ∣ A = 1 ] = E [ e ] = 0 \mathbb{E}[\mathbf{e}\mid A=1]=\mathbb{E}[\mathbf{e}]=0 E [ e ∣ A = 1 ] = E [ e ] = 0 , E [ e e ⊤ ∣ A = 1 ] = E [ e e ⊤ ] = Σ e \mathbb{E}[\mathbf{e}\mathbf{e}^{\top}\mid A=1]=\mathbb{E}[\mathbf{e}\mathbf{e}^{\top}]=\boldsymbol{\Sigma}_e E [ e e ⊤ ∣ A = 1 ] = E [ e e ⊤ ] = Σ e and E [ f e ⊤ ∣ A = 1 ] = 0 \mathbb{E}[\mathbf{f}\mathbf{e}^{\top}\mid A=1]=0 E [ f e ⊤ ∣ A = 1 ] = 0 . From L = ( 1 , ( H f + e ) ⊤ ) ⊤ \mathbf{L}=(1,(\mathbf{Hf}+\mathbf{e})^\top)^\top L = ( 1 , ( Hf + e ) ⊤ ) ⊤ , we have
L L ⊤ = ( 1 ( H f + e ) ⊤ H f + e ( H f + e ) ( H f + e ) ⊤ ) . \mathbf{L}\mathbf{L}^{\top}=
\begin{pmatrix}
1 & (\mathbf{Hf}+\mathbf{e})^\top\\
\mathbf{Hf}+\mathbf{e} & (\mathbf{Hf}+\mathbf{e})(\mathbf{Hf}+\mathbf{e})^\top
\end{pmatrix}. L L ⊤ = ( 1 Hf + e ( Hf + e ) ⊤ ( Hf + e ) ( Hf + e ) ⊤ ) .
Now, expanding the bottom-right block,
( H f + e ) ( H f + e ) ⊤ = H f f ⊤ H ⊤ + H f e ⊤ + e f ⊤ H ⊤ + e e ⊤ . (\mathbf{Hf}+\mathbf{e})(\mathbf{Hf}+\mathbf{e})^\top=\mathbf{Hff}^{\top}\mathbf{H}^{\top}+\mathbf{Hf}\mathbf{e}^{\top}+\mathbf{e}\mathbf{f}^{\top}\mathbf{H}^{\top}+\mathbf{e}\mathbf{e}^{\top}. ( Hf + e ) ( Hf + e ) ⊤ = Hff ⊤ H ⊤ + Hf e ⊤ + e f ⊤ H ⊤ + e e ⊤ .
We take the conditional expectation given A = 1 A=1 A = 1 entrywise. In the linear blocks, we have that
E [ H f + e ∣ A = 1 ] = H E [ f ∣ A = 1 ] + E [ e ] = H μ f ∣ 1 , \mathbb{E}[\mathbf{Hf}+\mathbf{e}\mid A=1]=\mathbf{H}\mathbb{E}[\mathbf{f}\mid A=1]+\mathbb{E}[\mathbf{e}]=\mathbf{H}\boldsymbol{\mu}_{f\mid1}, E [ Hf + e ∣ A = 1 ] = H E [ f ∣ A = 1 ] + E [ e ] = H μ f ∣ 1 ,
using E [ e ] = 0 \mathbb{E}[\mathbf{e}]=0 E [ e ] = 0 . Also, the two cross terms satisfy
E [ H f e ⊤ ∣ A = 1 ] = H E [ f e ⊤ ∣ A = 1 ] = 0 , E [ e f ⊤ H ⊤ ∣ A = 1 ] = E [ f e ⊤ ∣ A = 1 ] ⊤ H ⊤ = 0 , \mathbb{E}[\mathbf{Hf}\mathbf{e}^{\top}\mid A=1]=\mathbf{H}\mathbb{E}[\mathbf{f}\mathbf{e}^{\top}\mid A=1]=0,\qquad\mathbb{E}[\mathbf{e}\mathbf{f}^{\top}\mathbf{H}^{\top}\mid A=1]=\mathbb{E}[\mathbf{f}\mathbf{e}^{\top}\mid A=1]^{\top}\mathbf{H}^{\top}=0, E [ Hf e ⊤ ∣ A = 1 ] = H E [ f e ⊤ ∣ A = 1 ] = 0 , E [ e f ⊤ H ⊤ ∣ A = 1 ] = E [ f e ⊤ ∣ A = 1 ] ⊤ H ⊤ = 0 ,
as E [ f e ⊤ ∣ A = 1 ] = 0 \mathbb{E}[\mathbf{f}\mathbf{e}^{\top}\mid A=1]=0 E [ f e ⊤ ∣ A = 1 ] = 0 , and the remaining noise term is E [ e e ⊤ ∣ A = 1 ] = E [ e e ⊤ ] = Σ e \mathbb{E}[\mathbf{e}\mathbf{e}^{\top}\mid A=1]=\mathbb{E}[\mathbf{e}\mathbf{e}^{\top}]=\boldsymbol{\Sigma}_e E [ e e ⊤ ∣ A = 1 ] = E [ e e ⊤ ] = Σ e . So, collecting these gives us
M = ( 1 μ f ∣ 1 ⊤ H ⊤ H μ f ∣ 1 H E [ f f ⊤ ∣ A = 1 ] H ⊤ + Σ e ) . \mathbf{M}=
\begin{pmatrix}
1 & \boldsymbol{\mu}_{f\mid1}^{\top}\mathbf{H}^{\top}\\
\mathbf{H}\boldsymbol{\mu}_{f\mid1} & \mathbf{H}\mathbb{E}[\mathbf{ff}^{\top}\mid A=1]\mathbf{H}^{\top}+\boldsymbol{\Sigma}_e
\end{pmatrix}. M = ( 1 H μ f ∣ 1 μ f ∣ 1 ⊤ H ⊤ H E [ ff ⊤ ∣ A = 1 ] H ⊤ + Σ e ) .
We write A 11 = 1 A_{11}=1 A 11 = 1 , A 12 = μ f ∣ 1 T H T A_{12}=\mu_{f|1}^{\mathsf{T}}\mathbf{H}^{\mathsf{T}} A 12 = μ f ∣1 T H T , and A 22 = H E [ f f T ∣ A = 1 ] H T + Σ e A_{22}=\mathbf{H}\mathbb{E}[\mathbf{f}\mathbf{f}^{\mathsf{T}}\mid A=1]\mathbf{H}^{\mathsf{T}}+\boldsymbol{\Sigma}_{e} A 22 = H E [ f f T ∣ A = 1 ] H T + Σ e . The Schur complement of A 11 A_{11} A 11 is
A 22 − A 12 T A 11 − 1 A 12 = H E [ f f T ∣ A = 1 ] H T + Σ e − H μ f ∣ 1 μ f ∣ 1 T H T = H ( E [ f f T ∣ A = 1 ] − μ f ∣ 1 μ f ∣ 1 T ) H T + Σ e = H Σ f ∣ 1 H T + Σ e , \begin{aligned}
A_{22}-A_{12}^{\mathsf{T}}A_{11}^{-1}A_{12}
&=\mathbf{H}\mathbb{E}[\mathbf{f}\mathbf{f}^{\mathsf{T}}\mid A=1]\mathbf{H}^{\mathsf{T}}+\boldsymbol{\Sigma}_{e}-\mathbf{H}\mu_{f|1}\mu_{f|1}^{\mathsf{T}}\mathbf{H}^{\mathsf{T}}\\
&=\mathbf{H}\left(\mathbb{E}[\mathbf{f}\mathbf{f}^{\mathsf{T}}\mid A=1]-\mu_{f|1}\mu_{f|1}^{\mathsf{T}}\right)\mathbf{H}^{\mathsf{T}}+\boldsymbol{\Sigma}_{e}\\
&=\mathbf{H}\boldsymbol{\Sigma}_{f|1}\mathbf{H}^{\mathsf{T}}+\boldsymbol{\Sigma}_{e},
\end{aligned} A 22 − A 12 T A 11 − 1 A 12 = H E [ f f T ∣ A = 1 ] H T + Σ e − H μ f ∣1 μ f ∣1 T H T = H ( E [ f f T ∣ A = 1 ] − μ f ∣1 μ f ∣1 T ) H T + Σ e = H Σ f ∣1 H T + Σ e ,
using Σ f ∣ 1 = E [ f f T ∣ A = 1 ] − μ f ∣ 1 μ f ∣ 1 T \boldsymbol{\Sigma}_{f|1}=\mathbb{E}[\mathbf{f}\mathbf{f}^{\mathsf{T}}\mid A=1]-\mu_{f|1}\mu_{f|1}^{\mathsf{T}} Σ f ∣1 = E [ f f T ∣ A = 1 ] − μ f ∣1 μ f ∣1 T in the last line. This is positive definite, so M M M is invertible. Applying block-inverse formula with these blocks, we get
B 22 = ( H Σ f ∣ 1 H T + Σ e ) − 1 , B_{22}=\left(\mathbf{H}\boldsymbol{\Sigma}_{f|1}\mathbf{H}^{\mathsf{T}}+\boldsymbol{\Sigma}_{e}\right)^{-1}, B 22 = ( H Σ f ∣1 H T + Σ e ) − 1 ,
B 12 = − μ f ∣ 1 T H T ( H Σ f ∣ 1 H T + Σ e ) − 1 , B_{12}=-\mu_{f|1}^{\mathsf{T}}\mathbf{H}^{\mathsf{T}}\left(\mathbf{H}\boldsymbol{\Sigma}_{f|1}\mathbf{H}^{\mathsf{T}}+\boldsymbol{\Sigma}_{e}\right)^{-1}, B 12 = − μ f ∣1 T H T ( H Σ f ∣1 H T + Σ e ) − 1 ,
B 11 = 1 + μ f ∣ 1 T H T ( H Σ f ∣ 1 H T + Σ e ) − 1 H μ f ∣ 1 , B_{11}=1+\mu_{f|1}^{\mathsf{T}}\mathbf{H}^{\mathsf{T}}\left(\mathbf{H}\boldsymbol{\Sigma}_{f|1}\mathbf{H}^{\mathsf{T}}+\boldsymbol{\Sigma}_{e}\right)^{-1}\mathbf{H}\mu_{f|1}, B 11 = 1 + μ f ∣1 T H T ( H Σ f ∣1 H T + Σ e ) − 1 H μ f ∣1 ,
which is the formula.
Lemma D.2 (Woodbury matrix identity). Let A ∈ R n × n A\in\mathbb{R}^{n\times n} A ∈ R n × n and C ∈ R k × k C\in\mathbb{R}^{k\times k} C ∈ R k × k be invertible, and let U ∈ R n × k U\in\mathbb{R}^{n\times k} U ∈ R n × k , V ∈ R k × n V\in\mathbb{R}^{k\times n} V ∈ R k × n . If C − 1 + V A − 1 U C^{-1}+VA^{-1}U C − 1 + V A − 1 U is invertible, then A + U C V A+UCV A + U C V is invertible and
( A + U C V ) − 1 = A − 1 − A − 1 U ( C − 1 + V A − 1 U ) − 1 V A − 1 . (A+UCV)^{-1}=A^{-1}-A^{-1}U(C^{-1}+VA^{-1}U)^{-1}VA^{-1}. ( A + U C V ) − 1 = A − 1 − A − 1 U ( C − 1 + V A − 1 U ) − 1 V A − 1 .
Proof. We verify the right-hand side is a right inverse of A + U C V A+UCV A + U C V . Since both matrices are square, a right inverse is a two-sided inverse. We have
( A + U C V ) [ A − 1 − A − 1 U ( C − 1 + V A − 1 U ) − 1 V A − 1 ] = I + U C V A − 1 − U ( C − 1 + V A − 1 U ) − 1 V A − 1 − U C V A − 1 U ( C − 1 + V A − 1 U ) − 1 V A − 1 = I + U C V A − 1 − U [ I + C V A − 1 U ] ( C − 1 + V A − 1 U ) − 1 V A − 1 = ( 1 ) I + U C V A − 1 − U C [ C − 1 + V A − 1 U ] ( C − 1 + V A − 1 U ) − 1 V A − 1 = I + U C V A − 1 − U C V A − 1 = I . \begin{aligned}
(A+UCV)\left[A^{-1}-A^{-1}U(C^{-1}+VA^{-1}U)^{-1}VA^{-1}\right]
&=I+UCVA^{-1}-U(C^{-1}+VA^{-1}U)^{-1}VA^{-1}\\
&\quad-UCVA^{-1}U(C^{-1}+VA^{-1}U)^{-1}VA^{-1}\\
&=I+UCVA^{-1}-U[I+CV A^{-1}U](C^{-1}+VA^{-1}U)^{-1}VA^{-1}\\
&\overset{(1)}{=}I+UCVA^{-1}-UC[C^{-1}+VA^{-1}U](C^{-1}+VA^{-1}U)^{-1}VA^{-1}\\
&=I+UCVA^{-1}-UCVA^{-1}=I.
\end{aligned} ( A + U C V ) [ A − 1 − A − 1 U ( C − 1 + V A − 1 U ) − 1 V A − 1 ] = I + U C V A − 1 − U ( C − 1 + V A − 1 U ) − 1 V A − 1 − U C V A − 1 U ( C − 1 + V A − 1 U ) − 1 V A − 1 = I + U C V A − 1 − U [ I + C V A − 1 U ] ( C − 1 + V A − 1 U ) − 1 V A − 1 = ( 1 ) I + U C V A − 1 − U C [ C − 1 + V A − 1 U ] ( C − 1 + V A − 1 U ) − 1 V A − 1 = I + U C V A − 1 − U C V A − 1 = I .
Here, (1) follows simply using C [ C − 1 + V A − 1 U ] ( C − 1 + V A − 1 U ) − 1 = C C[C^{-1}+VA^{-1}U](C^{-1}+VA^{-1}U)^{-1}=C C [ C − 1 + V A − 1 U ] ( C − 1 + V A − 1 U ) − 1 = C .
Calculation of Effects
Throughout this subsection, we center the latent factors so that E [ f X ] = E [ f M ] = 0 \mathbb{E}[\mathbf{f}_{X}]=\mathbb{E}[\mathbf{f}_{M}]=0 E [ f X ] = E [ f M ] = 0 . The intercepts α a \alpha_a α a and δ a \delta_a δ a therefore account for the corresponding mean levels. Note that the arm-specific conditional means μ f ∣ 1 \mu_{f|1} μ f ∣1 and μ f X ∣ 0 \mu_{f_X|0} μ f X ∣0 used elsewhere in the Appendix can still be nonzero.
By the regression model in (1) , for a ∈ { 0 , 1 } a\in\{0,1\} a ∈ { 0 , 1 } ,
E [ Y ∣ f X , f M , A = a ] = α a + β a T f X + γ a T f M , E [ f M ∣ f X , A = a ] = δ a + B a f X . \mathbb{E}[Y\mid\mathbf{f}_{X},\mathbf{f}_{M},A=a]=\alpha_a+\boldsymbol{\beta}_a^{\mathsf{T}}\mathbf{f}_{X}+\boldsymbol{\gamma}_a^{\mathsf{T}}\mathbf{f}_{M},\qquad
\mathbb{E}[\mathbf{f}_{M}\mid\mathbf{f}_{X},A=a]=\boldsymbol{\delta}_a+B_a\mathbf{f}_{X}. E [ Y ∣ f X , f M , A = a ] = α a + β a T f X + γ a T f M , E [ f M ∣ f X , A = a ] = δ a + B a f X .
For Y ( a , f M ( a ′ ) ) Y^{(a,f_{M}^{(a')})} Y ( a , f M ( a ′ ) ) , we first average over the mediator distribution under A = a ′ A=a' A = a ′ conditional on f X \mathbf{f}_{X} f X , and then over the marginal distribution of f X \mathbf{f}_{X} f X . Therefore,
E [ Y ( a , f M ( a ′ ) ) ] = α a + E [ f X ] T β a + E f X [ E [ f M ∣ f X , A = a ′ ] ] T γ a = ( α a + δ a ′ T γ a ) + E [ f X ] T ( β a + B a ′ T γ a ) = α a + δ a ′ T γ a , \begin{aligned}
\mathbb{E}\left[Y^{(a,f_{M}^{(a')})}\right]
&=\alpha_a+\mathbb{E}[\mathbf{f}_{X}]^{\mathsf{T}}\boldsymbol{\beta}_a+\mathbb{E}_{\mathbf{f}_{X}}\left[\mathbb{E}[\mathbf{f}_{M}\mid\mathbf{f}_{X},A=a']\right]^{\mathsf{T}}\boldsymbol{\gamma}_a\\
&=(\alpha_a+\boldsymbol{\delta}_{a'}^{\mathsf{T}}\boldsymbol{\gamma}_a)+\mathbb{E}[\mathbf{f}_{X}]^{\mathsf{T}}(\boldsymbol{\beta}_a+B_{a'}^{\mathsf{T}}\boldsymbol{\gamma}_a)\\
&=\alpha_a+\boldsymbol{\delta}_{a'}^{\mathsf{T}}\boldsymbol{\gamma}_a,
\end{aligned} E [ Y ( a , f M ( a ′ ) ) ] = α a + E [ f X ] T β a + E f X [ E [ f M ∣ f X , A = a ′ ] ] T γ a = ( α a + δ a ′ T γ a ) + E [ f X ] T ( β a + B a ′ T γ a ) = α a + δ a ′ T γ a ,
where the last equality follows from E [ f X ] = 0 \mathbb{E}[\mathbf{f}_{X}]=0 E [ f X ] = 0 .
For the four choices of ( a , a ′ ) (a,a') ( a , a ′ ) , we have
E [ Y ( 1 , f M ( 1 ) ) ] = α 1 + E [ f X ] T β 1 + E f X [ E [ f M ∣ f X , A = 1 ] ] T γ 1 = ( α 1 + δ 1 T γ 1 ) + E [ f X ] T ( β 1 + B 1 T γ 1 ) = α 1 + δ 1 T γ 1 . \mathbb{E}[Y^{(1,f_M^{(1)})}] = \alpha_1 + \mathbb{E}[f_X]^{\mathsf{T}}\beta_1 + \mathbb{E}_{f_X}\left[\mathbb{E}[f_M \mid f_X,A=1]\right]^{\mathsf{T}}\gamma_1
= (\alpha_1+\delta_1^{\mathsf{T}}\gamma_1)+\mathbb{E}[f_X]^{\mathsf{T}}(\beta_1+B_1^{\mathsf{T}}\gamma_1)
= \alpha_1+\delta_1^{\mathsf{T}}\gamma_1. E [ Y ( 1 , f M ( 1 ) ) ] = α 1 + E [ f X ] T β 1 + E f X [ E [ f M ∣ f X , A = 1 ] ] T γ 1 = ( α 1 + δ 1 T γ 1 ) + E [ f X ] T ( β 1 + B 1 T γ 1 ) = α 1 + δ 1 T γ 1 .
E [ Y ( 0 , f M ( 0 ) ) ] = α 0 + E [ f X ] T β 0 + E f X [ E [ f M ∣ f X , A = 0 ] ] T γ 0 = ( α 0 + δ 0 T γ 0 ) + E [ f X ] T ( β 0 + B 0 T γ 0 ) = α 0 + δ 0 T γ 0 . \mathbb{E}[Y^{(0,f_M^{(0)})}] = \alpha_0 + \mathbb{E}[f_X]^{\mathsf{T}}\beta_0 + \mathbb{E}_{f_X}\left[\mathbb{E}[f_M \mid f_X,A=0]\right]^{\mathsf{T}}\gamma_0
= (\alpha_0+\delta_0^{\mathsf{T}}\gamma_0)+\mathbb{E}[f_X]^{\mathsf{T}}(\beta_0+B_0^{\mathsf{T}}\gamma_0)
= \alpha_0+\delta_0^{\mathsf{T}}\gamma_0. E [ Y ( 0 , f M ( 0 ) ) ] = α 0 + E [ f X ] T β 0 + E f X [ E [ f M ∣ f X , A = 0 ] ] T γ 0 = ( α 0 + δ 0 T γ 0 ) + E [ f X ] T ( β 0 + B 0 T γ 0 ) = α 0 + δ 0 T γ 0 .
E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + E [ f X ] T β 1 + E f X [ E [ f M ∣ f X , A = 0 ] ] T γ 1 = ( α 1 + δ 0 T γ 1 ) + E [ f X ] T ( β 1 + B 0 T γ 1 ) = α 1 + δ 0 T γ 1 . \mathbb{E}[Y^{(1,f_M^{(0)})}] = \alpha_1 + \mathbb{E}[f_X]^{\mathsf{T}}\beta_1 + \mathbb{E}_{f_X}\left[\mathbb{E}[f_M \mid f_X,A=0]\right]^{\mathsf{T}}\gamma_1
= (\alpha_1+\delta_0^{\mathsf{T}}\gamma_1)+\mathbb{E}[f_X]^{\mathsf{T}}(\beta_1+B_0^{\mathsf{T}}\gamma_1)
= \alpha_1+\delta_0^{\mathsf{T}}\gamma_1. E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + E [ f X ] T β 1 + E f X [ E [ f M ∣ f X , A = 0 ] ] T γ 1 = ( α 1 + δ 0 T γ 1 ) + E [ f X ] T ( β 1 + B 0 T γ 1 ) = α 1 + δ 0 T γ 1 .
E [ Y ( 0 , f M ( 1 ) ) ] = α 0 + E [ f X ] T β 0 + E f X [ E [ f M ∣ f X , A = 1 ] ] T γ 0 = ( α 0 + δ 1 T γ 0 ) + E [ f X ] T ( β 0 + B 1 T γ 0 ) = α 0 + δ 1 T γ 0 . \mathbb{E}[Y^{(0,f_M^{(1)})}] = \alpha_0 + \mathbb{E}[f_X]^{\mathsf{T}}\beta_0 + \mathbb{E}_{f_X}\left[\mathbb{E}[f_M \mid f_X,A=1]\right]^{\mathsf{T}}\gamma_0
= (\alpha_0+\delta_1^{\mathsf{T}}\gamma_0)+\mathbb{E}[f_X]^{\mathsf{T}}(\beta_0+B_1^{\mathsf{T}}\gamma_0)
= \alpha_0+\delta_1^{\mathsf{T}}\gamma_0. E [ Y ( 0 , f M ( 1 ) ) ] = α 0 + E [ f X ] T β 0 + E f X [ E [ f M ∣ f X , A = 1 ] ] T γ 0 = ( α 0 + δ 1 T γ 0 ) + E [ f X ] T ( β 0 + B 1 T γ 0 ) = α 0 + δ 1 T γ 0 .
Note that E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + δ 0 T γ 1 \mathbb{E}[Y^{(1,f_M^{(0)})}]=\alpha_1+\delta_0^{\mathsf{T}}\gamma_1 E [ Y ( 1 , f M ( 0 ) ) ] = α 1 + δ 0 T γ 1 is exactly the estimand θ 0 = α 1 + γ 1 T δ 0 \theta_0=\alpha_1+\gamma_1^{\mathsf{T}}\delta_0 θ 0 = α 1 + γ 1 T δ 0 studied in Theorem 3.1 and throughout the rest of this Appendix.
The natural indirect effect holds exposure fixed at treatment and varies the mediator between its two natural values
NIE = E [ Y ( 1 , f M ( 1 ) ) ] − E [ Y ( 1 , f M ( 0 ) ) ] = ( α 1 + δ 1 T γ 1 ) − ( α 1 + δ 0 T γ 1 ) = ( δ 1 − δ 0 ) T γ 1 . \operatorname{NIE}=\mathbb{E}[Y^{(1,f_M^{(1)})}]-\mathbb{E}[Y^{(1,f_M^{(0)})}]
=(\alpha_1+\delta_1^{\mathsf{T}}\gamma_1)-(\alpha_1+\delta_0^{\mathsf{T}}\gamma_1)
=(\delta_1-\delta_0)^{\mathsf{T}}\gamma_1. NIE = E [ Y ( 1 , f M ( 1 ) ) ] − E [ Y ( 1 , f M ( 0 ) ) ] = ( α 1 + δ 1 T γ 1 ) − ( α 1 + δ 0 T γ 1 ) = ( δ 1 − δ 0 ) T γ 1 .
The natural direct effect holds the mediator fixed at its control-arm natural value and varies exposure
NDE = E [ Y ( 1 , f M ( 0 ) ) ] − E [ Y ( 0 , f M ( 0 ) ) ] = ( α 1 + δ 0 T γ 1 ) − ( α 0 + δ 0 T γ 0 ) = α 1 − α 0 + δ 0 T ( γ 1 − γ 0 ) . \operatorname{NDE}=\mathbb{E}[Y^{(1,f_M^{(0)})}]-\mathbb{E}[Y^{(0,f_M^{(0)})}]
=(\alpha_1+\delta_0^{\mathsf{T}}\gamma_1)-(\alpha_0+\delta_0^{\mathsf{T}}\gamma_0)
=\alpha_1-\alpha_0+\delta_0^{\mathsf{T}}(\gamma_1-\gamma_0). NDE = E [ Y ( 1 , f M ( 0 ) ) ] − E [ Y ( 0 , f M ( 0 ) ) ] = ( α 1 + δ 0 T γ 1 ) − ( α 0 + δ 0 T γ 0 ) = α 1 − α 0 + δ 0 T ( γ 1 − γ 0 ) .
The remaining potential outcome, E [ Y ( 0 , f M ( 1 ) ) ] = α 0 + δ 1 T γ 0 \mathbb{E}[Y^{(0,f_M^{(1)})}]=\alpha_0+\delta_1^{\mathsf{T}}\gamma_0 E [ Y ( 0 , f M ( 1 ) ) ] = α 0 + δ 1 T γ 0 , is not needed for NIE/NDE above but gives the complementary decomposition, TDE = E [ Y ( 1 , f M ( 1 ) ) ] − E [ Y ( 0 , f M ( 1 ) ) ] =\mathbb{E}[Y^{(1,f_M^{(1)})}]-\mathbb{E}[Y^{(0,f_M^{(1)})}] = E [ Y ( 1 , f M ( 1 ) ) ] − E [ Y ( 0 , f M ( 1 ) ) ] and TIE = E [ Y ( 0 , f M ( 1 ) ) ] − E [ Y ( 0 , f M ( 0 ) ) ] =\mathbb{E}[Y^{(0,f_M^{(1)})}]-\mathbb{E}[Y^{(0,f_M^{(0)})}] = E [ Y ( 0 , f M ( 1 ) ) ] − E [ Y ( 0 , f M ( 0 ) ) ] , which satisfies the same identity TDE + TIE = NDE + NIE.
More on Simulation Study and Sensitivity Analysis
Table 5. Sensitivity of θ ^ 0 \hat{\theta}_0 θ ^ 0 to the common working dimension κ = p ~ = q ~ \kappa=\tilde{p}=\tilde{q} κ = p ~ = q ~ , with p ˉ = q ˉ = 3 \bar{p}=\bar{q}=3 p ˉ = q ˉ = 3 , over 500 replications.
Continued on next page
Covariates
Table 5 (continued).
All 500 replications were usable in every cell.
Covariates
Table 7. Descriptions of patient background variables used as covariates in the model.
Comparison to Related Literature
Comparison to Zhang et al. (2026)
The method of Zhang et al. [44 ] is related to FARMA because both use latent factor models in high-dimensional mediation settings. However, the high-dimensional variables and latent factors play different roles in the two methods, and the causal targets are also different. Using the notation of Zhang et al. [44 ] , let x ∈ R q x \in\mathbb{R}^{q} x ∈ R q be a high-dimensional exposure vector, m ∈ R p m \in\mathbb{R}^{p} m ∈ R p a high-dimensional mediator vector, and y ∈ R y \in\mathbb{R} y ∈ R the outcome. Their model is
y = α 0 T m + α 1 T x + ε 1 , m = Γ T x + ε . y = \alpha_{0}^{\mathsf{T}}m + \alpha_{1}^{\mathsf{T}}x + \varepsilon_{1}, \qquad m = \Gamma^{\mathsf{T}}x + \varepsilon. y = α 0 T m + α 1 T x + ε 1 , m = Γ T x + ε .
The direct, indirect, and total effects are α 1 \alpha_{1} α 1 , β = Γ α 0 \beta= \Gamma\alpha_{0} β = Γ α 0 and γ = α 1 + β \gamma= \alpha_{1} + \beta γ = α 1 + β respectively. In order to account for strong dependence among the high-dimensional variables, PRIME uses the factor models
x = B 1 f 1 + v 1 , ( m x ) = B 2 f 2 + v 2 . x = B_{1}f_{1} + v_{1}, \qquad
\begin{pmatrix} m \\ x \end{pmatrix} = B_{2}f_{2} + v_{2}. x = B 1 f 1 + v 1 , ( m x ) = B 2 f 2 + v 2 .
For each prespecified exposure group g g g , PRIME estimates α 1 , g \alpha_{1,g} α 1 , g and γ g \gamma_{g} γ g , and estimates the indirect effect as
β ^ g = γ ^ g − α ^ 1 , g . \widehat{\beta}_{g} = \widehat{\gamma}_{g} - \widehat{\alpha}_{1,g}. β g = γ g − α 1 , g .
The main differences from FARMA are given below.
Observed variables and surrogate measurements. In Zhang et al. [44 ] , x x x and m m m are observed exposures and mediators, and the direct and indirect effects are defined for their original coordinates. The factors f 1 f_{1} f 1 and f 2 f_{2} f 2 are introduced to account for the dependence among these observed variables. In FARMA, X X X and M M M are not the covariates and mediators themselves. They are high-dimensional surrogate measurements of the latent factors f X f_{X} f X and f M f_{M} f M :
X = Γ X f X + u X , M = Γ M f M + u M . X = \Gamma_{X}f_{X} + u_{X}, \qquad M = \Gamma_{M}f_{M} + u_{M}. X = Γ X f X + u X , M = Γ M f M + u M .
Therefore, the individual coordinates of M M M are not treated as separate mediators. Instead, they provide information about the underlying latent mediator f M f_{M} f M .
Exposure and causal target. Zhang et al. [44 ] considers a high-dimensional exposure vector and studies direct and indirect effects for individual exposures or prespecified groups:
H 0 , d i r ( g ) : α 1 , g = 0 , H 0 , i n d ( g ) : β g = 0. H_{0,\mathrm{dir}}^{(g)}:\alpha_{1,g}=0, \qquad H_{0,\mathrm{ind}}^{(g)}:\beta_{g}=0. H 0 , dir ( g ) : α 1 , g = 0 , H 0 , ind ( g ) : β g = 0.
The corresponding inference problem is therefore high-dimensional and involves multiple testing. FARMA considers a binary treatment A ∈ { 0 , 1 } A \in\{0,1\} A ∈ { 0 , 1 } . The main target is the population-level counterfactual mean
θ 0 = E { Y ( 1 , f M ( 0 ) ) } , \theta_{0} = E\left\{Y^{(1,f_{M}^{(0)})}\right\}, θ 0 = E { Y ( 1 , f M ( 0 ) ) } ,
which is then used together with the treatment-specific counterfactual means to obtain the natural direct, natural indirect, and total effects. The goal is therefore different from identifying which coordinate of a high-dimensional exposure has a direct or indirect effect.
Role of the factor structure. In Zhang et al. [44 ] , the exposures and mediators are observed, and the factors are used to handle the strong dependence among the high-dimensional variables.
In FARMA, the factors are themselves the latent covariates and mediators of interest. As a result, the factor structure also plays an important role in identification. With fixed p p p and q q q , the latent mediation functional is generally not point identified from ( X , M ) (X,M) ( X , M ) alone. We show that the observed-data functional approaches the latent target as the numbers of surrogate measurements increase. We also allow the working dimensions to be larger than the true factor dimensions, p ~ ≥ p \widetilde{p} \geq p p ≥ p and q ~ ≥ q \widetilde{q} \geq q q ≥ q . Thus, the exact latent factor dimensions do not need to be known.
Model assumptions. PRIME uses a high-dimensional linear structural equation model with sparsity assumptions on the regression coefficients. The main model does not include unmeasured confounding, although observed confounders can be added. The mediator-outcome coefficient is also common across exposure levels.
FARMA includes latent pre-treatment covariates f X f_{X} f X , which adjust for confounding among the treatment, mediator, and outcome. Since the regressions involving the latent factors are low-dimensional, our theory does not require sparsity. We also allow the coefficients ( B 0 , B 1 ) (B_{0},B_{1}) ( B 0 , B 1 ) , ( β 0 , β 1 ) (\beta_{0},\beta_{1}) ( β 0 , β 1 ) , and ( γ 0 , γ 1 ) (\gamma_{0},\gamma_{1}) ( γ 0 , γ 1 ) to vary across treatment levels.
Estimation and inference. PRIME estimates the factor and idiosyncratic components and then uses group-wise partially penalized least squares. Inference is based on tests for direct and indirect effects together with false discovery rate control.
FARMA uses projected surrogate variables followed by two cross-fitted low-dimensional regression steps. The estimator targets a scalar mediation functional. We show that the estimator is n \sqrt{n} n -consistent and asymptotically normal, which allows inference for the population natural direct and indirect effects.
The difference can also be seen in the ADNI applications. Zhang et al. [44 ] use SNPs as high-dimensional exposures and regional PET measurements as observed mediators. In our application, depressive status is the treatment, while high-dimensional DNA methylation measurements are used as surrogates for an underlying latent mediating process.
Summary of differences:
Table 8.