Independence of the blocks and for orthonormal frames with
ProvedGaussianMatrix.block_indepLet be a standard Gaussian matrix and let , have orthonormal columns (, ) spanning orthogonal subspaces (). Then the random matrices
are stochastically independent.
Together with the law of each block, this justifies conditioning on while treating as a fresh standard Gaussian matrix — the step that turns the deterministic range-finder bound into an explicit expectation.
Formalization Note. Independence is Mathlib's IndepFun of the two measurable maps and under . The frames need not be complete: is allowed to be strict.
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
namespace GaussianMatrix
theorem block_indep {n k r t : ℕ} (V₁ : Matrix (Fin n) (Fin k) ℝ) (V₂ : Matrix (Fin n) (Fin r) ℝ)
(hV₁ : V₁ᵀ * V₁ = 1) (hV₂ : V₂ᵀ * V₂ = 1) (hV₁₂ : V₁ᵀ * V₂ = 0) :
IndepFun (fun G : Fin n → Fin t → ℝ => Matrix.of.symm (V₁ᵀ * Matrix.of G))
(fun G : Fin n → Fin t → ℝ => Matrix.of.symm (V₂ᵀ * Matrix.of G)) (gaussianMatrix n t) := by sorry
end GaussianMatrixRead-back
What the Lean code literally says, in plain math · claude-fable-5-1
Let be natural numbers (implicit; any may be ), and let and be real matrices satisfying
(both have orthonormal columns and their column spaces are mutually orthogonal). Let be the law of an array with independent entries. Consider the two maps on arrays
(matrix products, with the array/matrix identification). The statement asserts that and are independent random variables under in Mathlib's sense (IndepFun): for every set in the sigma-algebra on arrays generated by (preimages of measurable sets of arrays, in the product sigma-algebra) and every set generated likewise by ,
This notion does not itself require or to be measurable (though here they are linear, hence measurable). Vacuity: the three hypotheses together force (the columns of are orthonormal in ), so for no such pair exists and the statement holds vacuously. Edge cases: if (or ) the corresponding hypotheses are trivial and (or ) is a constant map into a one-point space, so the generated sigma-algebra is trivial and independence is automatic; if both maps are constant. If , the hypotheses force .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.