Controls all near-maximal inverse frames by an explicit
basis-dependent constant.
Statement
Let
,
let
be a finite-dimensional real normed vector space, and fix an ordered
basis
.
Write
for the coordinate isomorphism, defined by
,
and give its coordinate space the sup norm
(zero in dimension zero). A frame is an ordered family
of continuous real linear functionals, with no independence assumed. Its
matrix and evaluation map are
The admissible frames form the product of closed dual unit balls
The norm on
need not be a coordinate sup norm. Let
be the dual coordinate functionals, and put
and
.
Fix
.
Define
For
and every
,
Assumptions
The only deficit hypothesis is
;
the frame satisfies both the dual-row contraction condition and the
displayed determinant lower bound. The coefficient
is arbitrary. There is no extra
hypothesis.
Conclusion
The same positive
works for every frame in this near-maximal set and every coefficient.
The coordinate inverse
and matrix inverse
are distinct maps; the resulting norm is the given norm of
.
Proof route
Use row Cramer with a scaled coordinate functional, divide by the
determinant gap, and transport the coordinate bound through the inverse
coordinate map.
Proof steps
Read the row-Cramer identity one coordinate at a
time. Since
and
,
For
,
let
denote the matrix obtained by replacing row
with
.
The row-Cramer formula is
Here
specifies the replaced row, while
runs over the basis coordinates. Apply provider
row form of Cramer to
and the row
;
its determinant hypothesis is the nonvanishing just shown. The provider
uses
,
so its column replacement is exactly the row replacement above.
Multiply by the coefficients and show the two
sums. For the same functional
and the given column
,
The second line
interchanges two finite sums; the third is matrix multiplication.
Finally, linearity of
and the definition of
give
The argument with a
coordinate
is for
.
When
,
both vectors are zero,
and
,
so the conclusion is immediate. In every dimension
and the leading
in
ensures positivity.
/-- The explicit Cramer estimate transported back through the inverse coordinate map. -/
theorem inverseBoundConstant_bound (b : Basis (Fin n) ℝ E)
{η : ℝ} (hηD : η < determinantMaximum b) {B : Frame n E}
(hB : B ∈ nearMaxFrames b η) (c : Fin n → ℝ) :
‖(coordinateEquiv b).symm ((frameMatrix b B)⁻¹.mulVec c)‖ ≤
inverseBoundConstant b η * ‖c‖
The hypotheses are hηD and hB;
c is an arbitrary vector, not a further bound.
The ambient
is a finite-dimensional real normed vector space, with its given norm
(not necessarily a coordinate sup norm). These hypotheses occur in the
separate surrounding excerpt.
Fin n → ℝ
The coordinate space
with the sup norm. Lean indexes the coordinates by
;
the formulas here use
.
Frame n E
The ordered families
with
continuous and real linear. No independence is part of this type.
determinantMaximum b
The real number
,
using the specified basis
.
hηD : η < determinantMaximum b
The input hypothesis
.
hB : B ∈ nearMaxFrames b η
The frame
called B satisfies
for every
and
.
Together with the gap, this implies
.
(c : Fin n → ℝ); ‖c‖
An arbitrary coordinate vector
and its sup norm
.
frameMatrix b B
The real
matrix
.
(frameMatrix b B)⁻¹.mulVec c
The vector
.
⁻¹ is matrix inverse and mulVec is matrix
multiplication by a column.
(coordinateEquiv b).symm (…)
The vector
.
symm selects the inverse coordinate isomorphism; the norm
outside this expression is the norm of
.
In the source
Mathematical meaning
inverseBoundConstant b η
,
where
and
.
‖(coordinateEquiv b).symm ((frameMatrix b B)⁻¹.mulVec c)‖ ≤
inverseBoundConstant b η * ‖c‖
The complete conclusion
,
for this frame and every supplied coefficient vector.
Braces allow Lean to infer a parameter. Parentheses provide explicit
arguments. →L[ℝ] in the surrounding definitions denotes a
continuous real linear map.