MATHLIBANNEX / CANONICAL DECLARATION CARD

Absolute maximization forces a near-maximal base

MathlibAnnex.Satellite.absoluteMaximizer_base_nearMax

theorem

A dominant determinant term prevents a large deficit in the base frame.

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.

Let be a finite index set, possibly empty; choose coefficients for . A configuration is a pair , where is a frame and is a family of additional continuous real linear functionals, called satellites. Write For any real weight , let replace row by and set An absolute maximizer means a single with for every . It need not maximize the signed polynomial. Set Suppose , , , and is an admissible absolute maximizer. Then .

Assumptions

The stated positive comparison constants for , finiteness of , nonnegative deficit, positive weight, strict budget inequality, admissibility of and its global absolute maximality are required. There is no assumption in this theorem.

Conclusion

The base frame has while remaining -dual contractive. Invertibility requires the separate additional condition .

Proof route

Bound the satellite sum and compare against an attained maximum frame with zero satellites.

Proof steps
  1. Bound every satellite contribution. For an admissible , replacing a row by any leaves a -dual contraction frame. Therefore each replacement determinant has absolute value at most . Applying the finite satellite budget estimate to precisely these contraction rows gives

    Since , the absolute polynomial upper bound yields .

  2. Use a benchmark in the same domain. Choose a -dual frame attaining , and set all its satellites to zero. This comparison configuration is admissible. Its polynomial has absolute value . Absolute maximality of the given gives

    This comparison uses the same weight and coefficients, without choosing a sign for the determinant.

  3. Exclude a deficit larger than . If , positivity of and imply

    contradicting the benchmark. Thus . Together with this is near-maximal membership, the output of the benchmark-to-near-maximal lemma.

The budget is defined by the determinant-scaled coefficient sum. For later applications with , a weight dominating that budget chooses , giving and . This weight choice is a contextual result with the stronger positive-deficit input, not an additional assumption on this theorem.

Main citations

Lean source signature (exact)

theorem absoluteMaximizer_base_nearMax {n : ℕ} {J : Type u}
    [Fintype J] (M : NormModel n) {η weight : ℝ}
    (hη0 : 0 ≤ η) (hweight : 0 < weight)
    (coeff : J → Coord n)
    (hgap : satelliteBudget M coeff < weight * η)
    {C : SatelliteConfiguration n J}
    (hC : C ∈ satelliteConfigurationSet M J)
    (hmax : ∀ D ∈ satelliteConfigurationSet M J,
      |configurationPolynomial weight coeff D| ≤
        |configurationPolynomial weight coeff C|) :
    C.1 ∈ nearMaxFrames M η

The proof arguments hη0, hweight, hgap, hC and hmax are assumptions. The final membership is the conclusion.

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 .
[Fintype J] The index set is finite and may be empty; this permits the finite sum over all .
DualFrame n; dualFrameMatrix B; frameDet B An ordered family of continuous real linear functionals, its matrix in the standard basis, and its determinant . No independence is imposed by the family type.
detMax M; nearMaxFrames M η and , where .
SatelliteConfiguration n J; C.1; C.2 a A pair , called C. Its first component C.1 is the base frame ; C.2 a is the satellite , continuous and real linear.
weight; coeff a; coeff a i The real weight , the coefficient vector , and its th coordinate . These coefficients are fixed before maximization.
hC : C ∈ satelliteConfigurationSet M J The given configuration lies in : and for every .
configurationPolynomial weight coeff C The scalar , where the replaced row is .
hmax : ∀ D ∈ satelliteConfigurationSet M J, … For every admissible comparison pair , . D names that pair, not the number . This is a hypothesis about absolute values.
hη0; hweight; hgap The three hypotheses , , and , respectively.
In the source Mathematical meaning
satelliteBudget M coeff The scalar .
C.1 ∈ nearMaxFrames M η The conclusion is and , for the base of the same pair C.

Here →L[ℝ] means continuous real linear, ∀ means “for every”, and ∈ is membership. Dot notation selects a field or component; successive arguments denote function application.

Relevant surrounding context (separate exact excerpts)

Exact source lines 13–15:

private abbrev Coord (n : ℕ) := Fin n → ℝ
private abbrev NormModel (n : ℕ) := EquivalentSeminorm (Coord n)
private abbrev DualFrame (n : ℕ) := DeterminantFrame.Frame n (Coord n)

Exact source lines 53–53:

private abbrev detMax {n : ℕ} (M : NormModel n) := DeterminantFrame.determinantMaximum (modelBasis M)

Exact source lines 55–55:

private abbrev nearMaxFrames {n : ℕ} (M : NormModel n) (η : ℝ) := {B : DualFrame n | B ∈ dualFrameSet M ∧ detMax M - η ≤ |frameDet B|}

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.

Exact content identity

Declaration: MathlibAnnex.Satellite.absoluteMaximizer_base_nearMax

Accepted content SHA-256: 1510ad9ef49cb88b88be7c6bd8311e1a66ff84728cb7c042fbf5b4acf64f4afc

Accepted source guide SHA-256: 3901d0f28fe6638210e9f1708754b0710dedc6d7f1203d12e53acc9bd1a2630d

Source commit: 437e6e46228bbb8e91211ebded349d7a30020e73

Back to top ↑