Documentation

TauCeti.Analysis.Matrix.CharPowerSeries.Basic

Principal-minor series of infinite matrices #

For a square matrix A : Matrix ι ι R over a commutative topological ring, indexed by an arbitrary (possibly infinite) type ι, this file uses the principal minors A.principalMinor s = det (A i j)_{i, j ∈ s} on finite sets s of indices (Matrix.principalMinor) to define the coefficients

A.charCoeff n = (-1) ^ n * ∑' s : {s : Finset ι // s.card = n}, A.principalMinor s,

and the power series A.charPowerSeries with these coefficients. For a finite index type these are exactly the coefficients of det (1 - X A), Mathlib's Matrix.charpolyRev (Matrix.charCoeff_eq_coeff_charpolyRev). For infinite index types the series is the Fredholm determinant det (1 - T A) of Serre's theory of completely continuous endomorphisms of nonarchimedean Banach spaces, once the defining sums are known to converge.

Over an ultrametric seminormed commutative ring, a product majorant ‖A.principalMinor s‖ ≤ ∏ i ∈ s, r i controls convergence and growth:

The last two estimates depend on the coefficients only through the bound ‖A.charCoeff n‖ ≤ c for every nonnegative bound c of the n-fold products of r. They are instances of the real estimates TauCeti.mul_pow_le_of_forall_prod_le and TauCeti.tendsto_mul_pow_of_forall_prod_le, which assume only that bound and so apply equally to the coefficients of the Fredholm resolvent.

Only summability requires completeness; none of these estimates requires ‖1‖ = 1. Over an ultrametric seminormed commutative ring with ‖1‖ = 1, row bounds ‖A i j‖ ≤ r i supply the product majorant (Matrix.norm_principalMinor_le). They give the row-bound corollaries Matrix.norm_charCoeff_le, Matrix.summable_principalMinor, and Matrix.norm_charCoeff_mul_pow_le. When the ring is normed, they also give Matrix.isRestricted_charPowerSeries.

The tail estimate depends on A only through r, so it is uniform over every family of matrices sharing one product majorant. The coefficients do not depend on an enumeration of the index type (Matrix.charCoeff_submatrix_equiv).

The series is compatible with the operations on matrices that act on each principal minor:

The product-majorant results Matrix.summable_principalMinor_of_le_prod and Matrix.isRestricted_charPowerSeries_of_le_prod only require bounds on principal minors. They also apply to two-sided entry bounds whose diagonal products tend to zero, even when the rows themselves do not decay.

The summability hypotheses in Matrix.charPowerSeries_map and Matrix.charPowerSeries_smul are needed because the coefficients are unconditional sums: the image of a non-summable family of minors may be summable with a nonzero sum. The scaling identities require only continuity of multiplication by each fixed scalar.

Main definitions #

Implementation notes #

The coefficients are defined by an unconditional tsum, which is zero when the family is not summable. Statements about their values that need convergence carry the corresponding row-decay or product-majorant hypotheses; the norm bounds hold without them.

References #

noncomputable def Matrix.charCoeff {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] (A : Matrix ι ι R) (n : ℕ) :
R

The n-th coefficient of the principal-minor series det (1 - T A): (-1) ^ n times the sum of the principal minors of size n. The sum is an unconditional tsum, so it is only meaningful once the family of minors is summable (Matrix.summable_principalMinor).

Instances For
    theorem Matrix.charCoeff_def {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] (A : Matrix ι ι R) (n : ℕ) :
    A.charCoeff n = (-1) ^ n * ∑' (s : { s : Finset ι // s.card = n }), A.principalMinor ↑s
    @[simp]
    theorem Matrix.charCoeff_zero {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] (A : Matrix ι ι R) :
    A.charCoeff 0 = 1
    theorem Matrix.charCoeff_submatrix_of_row_eq_zero {ι : Type u_1} {κ : Type u_2} {R : Type u_3} [DecidableEq ι] [DecidableEq κ] [CommRing R] [TopologicalSpace R] (A : Matrix κ κ R) (e : ι ↪ κ) (hA : ∀ i ∉ Set.range ⇑e, ∀ (j : κ), A i j = 0) (n : ℕ) :
    (A.submatrix ⇑e ⇑e).charCoeff n = A.charCoeff n

    Extension by zero. If every row of A outside the range of an embedding e vanishes, for instance if A extends a matrix on ι by zero, then restricting A along e does not change the coefficients of its principal-minor series. No convergence hypothesis is needed.

    theorem Matrix.charCoeff_submatrix_equiv {ι : Type u_1} {κ : Type u_2} {R : Type u_3} [DecidableEq ι] [DecidableEq κ] [CommRing R] [TopologicalSpace R] (A : Matrix κ κ R) (e : ι ≃ κ) (n : ℕ) :
    (A.submatrix ⇑e ⇑e).charCoeff n = A.charCoeff n

    The coefficients of the principal-minor series do not depend on the enumeration of the index type.

    @[simp]
    theorem Matrix.charCoeff_transpose {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] (A : Matrix ι ι R) (n : ℕ) :

    The coefficients of the principal-minor series are unchanged by transposition.

    theorem Matrix.charCoeff_submatrix_of_col_eq_zero {ι : Type u_1} {κ : Type u_2} {R : Type u_3} [DecidableEq ι] [DecidableEq κ] [CommRing R] [TopologicalSpace R] (A : Matrix κ κ R) (e : ι ↪ κ) (hA : ∀ j ∉ Set.range ⇑e, ∀ (i : κ), A i j = 0) (n : ℕ) :
    (A.submatrix ⇑e ⇑e).charCoeff n = A.charCoeff n

    Extension by zero, column form. If every column of A outside the range of an embedding e vanishes, then restricting A along e does not change the coefficients of its principal-minor series.

    theorem Matrix.charCoeff_map {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] {S : Type u_4} [CommRing S] [TopologicalSpace S] [T2Space S] (f : R →+* S) (hf : Continuous ⇑f) {A : Matrix ι ι R} {n : ℕ} (hA : Summable fun (s : { s : Finset ι // s.card = n }) => A.principalMinor ↑s) :
    (A.map ⇑f).charCoeff n = f (A.charCoeff n)

    Base change of coefficients. A continuous ring morphism f carries the n-th coefficient of the principal-minor series of A to that of the matrix A.map f, provided the principal minors of A of size n are summable.

    theorem Matrix.charCoeff_smul {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] [ContinuousConstSMul R R] [T2Space R] (c : R) {A : Matrix ι ι R} {n : ℕ} (hA : Summable fun (s : { s : Finset ι // s.card = n }) => A.principalMinor ↑s) :
    (c • A).charCoeff n = c ^ n * A.charCoeff n

    Scaling. Scaling A by c multiplies the n-th coefficient of its principal-minor series by c ^ n, provided the principal minors of A of size n are summable.

    noncomputable def Matrix.charPowerSeries {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] (A : Matrix ι ι R) :

    The principal-minor series det (1 - T A), whose coefficients are Matrix.charCoeff.

    Instances For
      @[simp]
      theorem Matrix.coeff_charPowerSeries {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] (A : Matrix ι ι R) (n : ℕ) :
      theorem Matrix.charPowerSeries_submatrix_equiv {ι : Type u_1} {κ : Type u_2} {R : Type u_3} [DecidableEq ι] [DecidableEq κ] [CommRing R] [TopologicalSpace R] (A : Matrix κ κ R) (e : ι ≃ κ) :

      The principal-minor series does not depend on the enumeration of the index type.

      theorem Matrix.charPowerSeries_submatrix_of_row_eq_zero {ι : Type u_1} {κ : Type u_2} {R : Type u_3} [DecidableEq ι] [DecidableEq κ] [CommRing R] [TopologicalSpace R] (A : Matrix κ κ R) (e : ι ↪ κ) (hA : ∀ i ∉ Set.range ⇑e, ∀ (j : κ), A i j = 0) :

      Extension by zero. If every row of A outside the range of an embedding e vanishes, then restricting A along e does not change its principal-minor series.

      theorem Matrix.charPowerSeries_submatrix_of_col_eq_zero {ι : Type u_1} {κ : Type u_2} {R : Type u_3} [DecidableEq ι] [DecidableEq κ] [CommRing R] [TopologicalSpace R] (A : Matrix κ κ R) (e : ι ↪ κ) (hA : ∀ j ∉ Set.range ⇑e, ∀ (i : κ), A i j = 0) :

      Extension by zero, column form. If every column of A outside the range of an embedding e vanishes, then restricting A along e does not change its principal-minor series.

      @[simp]

      The principal-minor series is unchanged by transposition.

      theorem Matrix.charPowerSeries_map {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] {S : Type u_4} [CommRing S] [TopologicalSpace S] [T2Space S] (f : R →+* S) (hf : Continuous ⇑f) {A : Matrix ι ι R} (hA : ∀ (n : ℕ), Summable fun (s : { s : Finset ι // s.card = n }) => A.principalMinor ↑s) :

      Base change. If the principal minors of A of each size are summable, a continuous ring morphism f carries the principal-minor series of A to that of the matrix A.map f.

      theorem Matrix.charPowerSeries_smul {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] [ContinuousConstSMul R R] [T2Space R] (c : R) {A : Matrix ι ι R} (hA : ∀ (n : ℕ), Summable fun (s : { s : Finset ι // s.card = n }) => A.principalMinor ↑s) :

      Scaling. If the principal minors of A of each size are summable, the principal-minor series of c • A is that of A with the variable rescaled by c: H_{c A}(T) = H_A(c T).

      theorem Matrix.charCoeff_eq_coeff_charpolyRev {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] [Fintype ι] (A : Matrix ι ι R) (n : ℕ) :

      For a finite index type, the coefficients of the principal-minor series are those of det (1 - X A).

      For a finite index type, the principal-minor series is the polynomial det (1 - X A).

      @[simp]
      theorem Matrix.charPowerSeries_of_isEmpty {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [CommRing R] [TopologicalSpace R] [IsEmpty ι] (A : Matrix ι ι R) :
      @[simp]

      The principal-minor series of the zero matrix is 1: every nonempty principal minor vanishes.

      theorem Matrix.norm_charCoeff_le_of_principalMinor_le {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [SeminormedCommRing R] [IsUltrametricDist R] {A : Matrix ι ι R} {n : ℕ} {C : ℝ} (hC : 0 ≤ C) (hs : ∀ (s : Finset ι), s.card = n → ‖A.principalMinor s‖ ≤ C) :

      A common nonnegative bound on the size-n principal minors bounds the n-th principal-minor coefficient. No convergence hypothesis is needed.

      theorem Matrix.summable_principalMinor_of_le_prod {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [SeminormedCommRing R] [IsUltrametricDist R] [CompleteSpace R] {A : Matrix ι ι R} {r : ι → ℝ} (hA : ∀ (s : Finset ι), ‖A.principalMinor s‖ ≤ ∏ i ∈ s, r i) (hr : Filter.Tendsto r Filter.cofinite (nhds 0)) (n : ℕ) :
      Summable fun (s : { s : Finset ι // s.card = n }) => A.principalMinor ↑s

      Product majorants tending to zero imply summability of the principal minors of each fixed size. No bound on individual matrix entries is required.

      theorem Matrix.norm_charCoeff_mul_pow_le_of_le_prod {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [SeminormedCommRing R] [IsUltrametricDist R] {A : Matrix ι ι R} {r : ι → ℝ} (hA : ∀ (s : Finset ι), ‖A.principalMinor s‖ ≤ ∏ i ∈ s, r i) {ρ q B : ℝ} (hρ : 0 < ρ) (hq₀ : 0 ≤ q) (hq₁ : q ≤ 1) (hB : 1 ≤ B) (T : Finset ι) (hT : ∀ i ∉ T, ρ * r i ≤ q) (hrB : ∀ (i : ι), ρ * r i ≤ B) (n : ℕ) :
      ‖A.charCoeff n‖ * ρ ^ n ≤ B ^ T.card * q ^ (n - T.card)

      Uniform tail bound from principal minors. Suppose the principal minors are bounded by products of nonnegative r i, and let ρ > 0, 0 ≤ q ≤ 1, 1 ≤ B, and T a finite set of indices with ρ * r i ≤ q off T and ρ * r i ≤ B everywhere. Then ‖A.charCoeff n‖ * ρ ^ n ≤ B ^ #T * q ^ (n - #T), with truncated subtraction in the exponent. The bound depends on A only through r.

      theorem Matrix.isRestricted_charPowerSeries_of_le_prod {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [NormedCommRing R] [IsUltrametricDist R] {A : Matrix ι ι R} {r : ι → ℝ} (hA : ∀ (s : Finset ι), ‖A.principalMinor s‖ ≤ ∏ i ∈ s, r i) (hr : Filter.Tendsto r Filter.cofinite (nhds 0)) (c : ℝ) :

      A null product majorant for principal minors makes their series restricted at every radius, even when the matrix has no null row majorant.

      theorem Matrix.norm_charCoeff_le {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [SeminormedCommRing R] [NormOneClass R] [IsUltrametricDist R] {A : Matrix ι ι R} {r : ι → ℝ} (hA : ∀ (i j : ι), ‖A i j‖ ≤ r i) {n : ℕ} {C : ℝ} (hC : 0 ≤ C) (hs : ∀ (s : Finset ι), s.card = n → ∏ i ∈ s, r i ≤ C) :

      Coefficient bound. If r bounds the rows of A and C ≥ 0 bounds ∏ i ∈ s, r i for every n-element set s, then C bounds the n-th coefficient of the principal-minor series. No convergence hypothesis is needed.

      theorem Matrix.summable_principalMinor {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [SeminormedCommRing R] [NormOneClass R] [IsUltrametricDist R] [CompleteSpace R] {A : Matrix ι ι R} {r : ι → ℝ} (hA : ∀ (i j : ι), ‖A i j‖ ≤ r i) (hr : Filter.Tendsto r Filter.cofinite (nhds 0)) (n : ℕ) :
      Summable fun (s : { s : Finset ι // s.card = n }) => A.principalMinor ↑s

      Summability of principal minors. Over a complete ultrametric seminormed ring with ‖1‖ = 1, if the rows of A are bounded by a family r tending to zero along the cofinite filter, then the principal minors of each fixed size form a summable family.

      theorem Matrix.norm_charCoeff_mul_pow_le {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [SeminormedCommRing R] [NormOneClass R] [IsUltrametricDist R] {A : Matrix ι ι R} {r : ι → ℝ} (hA : ∀ (i j : ι), ‖A i j‖ ≤ r i) {ρ q B : ℝ} (hρ : 0 < ρ) (hq₀ : 0 ≤ q) (hq₁ : q ≤ 1) (hB : 1 ≤ B) (T : Finset ι) (hT : ∀ i ∉ T, ρ * r i ≤ q) (hrB : ∀ (i : ι), ρ * r i ≤ B) (n : ℕ) :
      ‖A.charCoeff n‖ * ρ ^ n ≤ B ^ T.card * q ^ (n - T.card)

      Uniform tail bound. Suppose r bounds the rows of A, and let ρ > 0, 0 ≤ q ≤ 1, 1 ≤ B, and T a finite set of indices with ρ * r i ≤ q off T and ρ * r i ≤ B everywhere. Then ‖A.charCoeff n‖ * ρ ^ n ≤ B ^ #T * q ^ (n - #T), with truncated subtraction in the exponent. The bound depends on A only through r.

      theorem Matrix.isRestricted_charPowerSeries {ι : Type u_1} {R : Type u_3} [DecidableEq ι] [NormedCommRing R] [NormOneClass R] [IsUltrametricDist R] {A : Matrix ι ι R} {r : ι → ℝ} (hA : ∀ (i j : ι), ‖A i j‖ ≤ r i) (hr : Filter.Tendsto r Filter.cofinite (nhds 0)) (c : ℝ) :

      Entirety. If the rows of A are bounded by a family tending to zero along the cofinite filter, then the principal-minor series is restricted at every radius.