MathlibAnnex.Satellite.exists_goodSatellitePackage
theorem
Chooses the inverse bound, net and weight before fixing one satellite family.
Statement
Let and use reference coordinates with the sup norm. Let be a continuous seminorm with specified constants such that Thus is a norm. We use for the model distance and for reference-coordinate estimates; the two norms are allowed to coincide. A -dual contraction is a continuous real linear functional satisfying for every . Let be the standard coordinate vectors. For an ordered family of continuous real linear functionals on , put For a real number , define the attained maximum and near-maximal set by Admissibility is measured with ; the matrices are written in the fixed reference coordinates. Suppose and . The conclusion chooses a number with the uniform bound then a finite center set and a weight . More precisely, put Index the coefficients by and put . For a functional , let replace row by . A configuration consists of a base frame and a family of additional continuous real linear functionals , called satellites. Its polynomial, admissible set and coefficient budget are For the selected absolute maximizer , that is, the same choices satisfy and
Assumptions
The real norm model with its comparison constants, , and are the only assumptions. Neither , , a nonempty sphere nor nonempty centers are assumed. The number , its uniform bound, the finite net, and the weight are outputs, not further assumptions.
Conclusion
One finite family, obtained from the selected absolute-maximizing configuration after fixing the net and weight, works for every unit vector. The center/index may depend on the unit vector. Positivity of the weight and its strict budget inequality are also outputs.
Proof route
Fix a uniform inverse bound, choose a finite coefficient net, choose a dominating weight, maximize the absolute polynomial, and then detect each unit vector using that same family.
Proof steps
Choose the common bound before the net. Apply existence of a common near-maximal inverse bound to the same space equipped with the norm and the standard basis and to . Its record supplies and for every and . Set ; and ensure .
Take a net in the reference coordinates. The annulus is closed and contained in the reference closed unit ball, so it is compact in finite-dimensional . Apply finite covering of a compact set with this actual set and the nonzero radius (stored as a nonnegative real). Its outputs are a finite covering every point of to reference distance at most . The finite coefficient-net record stores exactly its centers, their containment, their finiteness and this cover property. Each is used as the coefficient vector ; no maximizer or unit vector has yet been chosen.
Turn this net into detection uniformly over near-maximal frames. For every and , contraction and reconstruction give
Thus . Choose with . The same inverse estimate gives
These are the inputs and output of coefficient detection supplied by this net; detection holds for every near-maximal frame, before the selected maximizer is known.
Choose the weight and then the configuration. With the already fixed finite coefficient family, set . Nonnegativity of the budget and give and . The product is compact and nonempty: its dual contraction rows are closed, bounded by in reference operator norm, and finite in number; zero rows are admissible. The continuous function therefore attains its maximum. Fix the selected once. Apply absolute maximization giving a near-maximal base with this positive weight, strict budget inequality, admissibility and absolute maximum. It gives .
Apply detection to the same satellites and retain strictness. For arbitrary , apply the almost-norming satellite estimate with exactly the fixed , the gap, the detection already proved, and the base membership just obtained. It gives an from this same family with
Indeed implies . Thus the error is strictly less than , without assuming . For the unit sphere is empty, the annulus and centers may be empty, and the final universal statement is vacuous.
A common inverse bound consists of a number and the uniform estimate It is fixed independently of the particular frame and coefficient. When , every such frame has nonzero determinant. The annulus itself is the coefficient annulus. The strict epsilon version, finite-net absolute-maximizer conclusion and weight choice for a given net preserve this order of choices. As a contextual connection, define with the sup norm on its finite coordinates. the upper bound for that coordinate map uses admissibility to give , while one satellite coordinate bounds the whole map from below gives on the unit sphere. For , apply the latter to and use linearity to get , as in the lower bound for every nonzero vector. This only explains the assigned coordinate-map context; no later classification is asserted.
Main citations
- existence
of a common near-maximal inverse bound —
MathlibAnnex.DeterminantFrame.nonempty_nearMaxInverseBound - finite
covering of a compact set —
Metric.exists_finite_isCover_of_isCompact - finite
coefficient-net record —
MathlibAnnex.Satellite.FiniteCoefficientNet - coefficient
detection supplied by this net —
MathlibAnnex.Satellite.finiteCoefficientNet_detectsUnit - absolute
maximization giving a near-maximal base —
MathlibAnnex.Satellite.absoluteMaximizer_base_nearMax - the
almost-norming satellite estimate —
MathlibAnnex.Satellite.absoluteMaximizer_satellites_almost_norm - the
coefficient annulus —
MathlibAnnex.Satellite.coefficientAnnulus - strict
epsilon version —
MathlibAnnex.Satellite.absoluteMaximizer_satellites_one_sub_epsilon - finite-net
absolute-maximizer conclusion —
MathlibAnnex.Satellite.finiteNet_absoluteMaximizer_satellites_one_sub_epsilon - weight
choice for a given net —
MathlibAnnex.Satellite.exists_goodNetSatelliteMaximizer - the
upper bound for that coordinate map —
MathlibAnnex.FiniteSup.configurationMap_norm_le_model - one
satellite coordinate bounds the whole map from below —
MathlibAnnex.FiniteSup.configurationMap_norm_gt_of_satellite - the
lower bound for every nonzero vector —
MathlibAnnex.FiniteSup.maxNetConfigurationMap_lower_of_ne_zero - Exact
declaration and proof —
MathlibAnnex.Satellite.exists_goodSatellitePackage
Lean source signature (exact)
theorem exists_goodSatellitePackage
{n : ℕ} (M : NormModel n) {η ε : ℝ}
(hη : 0 < η) (hηD : η < detMax M) (hε : 0 < ε) :
∃ H : NearMaxInverseBound M η,
∃ C : FiniteCoefficientNet (n := n) H.boundConstant
(satelliteRadiusNNReal ε H.boundConstant hε H.boundConstant_pos),
∃ weight : ℝ,
0 < weight ∧
satelliteBudget M (Internal.centerValue C) < weight * η ∧
∀ x : Coord n, M.p x = 1 →
∃ a : C.centers,
1 - ε <
|(maxSatelliteConfiguration M C.centers
weight (Internal.centerValue C)).2 a x|
The nested existence quantifiers choose
,
then the finite net C, then weight. The final
assertion tests the resulting one family on every unit vector.
| In the source | Mathematical meaning |
|---|---|
Coord n |
The reference space
with its sup norm; Coord n abbreviates
Fin n → ℝ. Lean uses indices
and the formulas use
. |
M : NormModel n; M.p |
The input M contains the continuous seminorm
and constants
with
for every
.
M.p x is the scalar
. |
detMax M; nearMaxFrames M η |
and , where . |
hη; hηD; hε |
The only numerical input hypotheses are , , and . |
∃ H : NearMaxInverseBound M η |
There exists
with
for all
and
.
The structure H stores that number and its two stated
properties. |
H.boundConstant; H.boundConstant_pos |
The chosen number and the proof that . |
satelliteRadiusNNReal ε H.boundConstant hε
H.boundConstant_pos |
The radius , represented as a nonnegative real number. The proof arguments establish the required sign; they are not further numerical choices. |
∃ C : FiniteCoefficientNet (n := n) H.boundConstant
(…) |
There exists a finite set such that every has with . The structure stores the set, containment, finiteness and cover property. |
C.centers; a : C.centers; Internal.centerValue C a |
The center set, a center together with its membership proof, and its coordinate vector , respectively. The coefficient is . |
satelliteBudget M (Internal.centerValue C) |
, using this chosen finite center set. |
∃ weight : ℝ, 0 < weight ∧ satelliteBudget M (…) <
weight * η |
After is chosen there exists a real satisfying both and . These are output properties. |
maxSatelliteConfiguration M C.centers weight
(Internal.centerValue C) |
The selected pair maximizing for this . Every base row and every is dominated by ; the polynomial is the displayed weighted determinant plus row-replacement sum. |
| In the source | Mathematical meaning |
|---|---|
(maxSatelliteConfiguration M C.centers weight
(Internal.centerValue C)).2 a x |
The entire expression is
.
.2 selects the satellite family in the one selected pair,
a selects its functional, and x is the
evaluation point. |
∀ x : Coord n, M.p x = 1 → ∃ a : C.centers, 1 - ε <
|…| |
For every with , some index from that same finite set satisfies . The family is fixed before ; only may depend on . |
∧ means “and” and the implication
M.p x = 1 → ... restricts the final assertion to unit
vectors. (n := n) fixes the dimension of the net. The net
structure and its center set are distinct; the source writes them as
C and C.centers, while the formulas use
for the set.
Relevant surrounding context (separate exact excerpts)
private abbrev Coord (n : ℕ) := Fin n → ℝ
private abbrev NormModel (n : ℕ) := EquivalentSeminorm (Coord n)
private abbrev NearMaxInverseBound {n : ℕ} (M : NormModel n) := DeterminantFrame.NearMaxInverseBound (modelBasis M)
Full surrounding source. These excerpts are separate from the declaration above.
Surrounding assumptions and aliases: exact source, lines 7–55. The full original context is retained with the source evidence.
Read exact source with highlighted declaration · Raw UTF-8 source · Card PDF · Back to Project
Exact content identity
Declaration: MathlibAnnex.Satellite.exists_goodSatellitePackage
Accepted content SHA-256: f79f8ef5f24914391336ebe540e799da4107cab5645e0372791ac71c98ea6b32
Accepted source guide SHA-256: dc8964fc07f86e1508cc438b70e4954d4c7c61ded2485a99e6ae441e39d7e78b
Source commit: 437e6e46228bbb8e91211ebded349d7a30020e73