How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Matrix Functions and Scaling Squaring — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Norms and Realification
- Complex Power Series and Analytic Functions
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computed Schur decompositions and nonnormal spectra
- Computed singular values and rank revealing factorizations
- Conformal Mapping, Branches, and the Schwarz Lemma
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalue Iterations and the QR Algorithm
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Functions and Scaling Squaring
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Strongly Continuous Semigroups and Hille Yosida
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Sylvester and lyapunov matrix equations
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The Winding Number and the Global Cauchy Theorem
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The examples compute a positive diagonal Gram matrix and its polar factors, show how a stable spectrum can coexist with a large transient norm for a nonnormal exponential, and locate the planar half-turn on the principal logarithm branch cut. Each calculation states the matrix identities and spectral facts it uses.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A positive diagonal Gram matrix gives a nontrivial polar factor
Example
For the Gram matrix is positive diagonal, its positive square root is nontrivial, and the polar isometry is a quarter-turn.
Facts & Assumptions
Given: The displayed real matrix .
A nonnegative matrix has a unique nonnegative square root (A non-negative operator has a unique non-negative square root).
The polar decomposition has positive factor and isometry factor with (Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible).
Verification
Direct multiplication gives , and is positive with . By [F1], is the unique nonnegative square root.
Put . Then and , so [F2] identifies as the polar isometry and as its positive factor.
A stable-spectrum nonnormal exponential has a large transient norm
Example
Let Its eigenvalues have negative real part, but at time the row-sum norm of is greater than one. Here the row-sum norm is .
Facts & Assumptions
Given: The displayed matrix .
The complex exponential is its power-series exponential and its primary matrix value is given by the Jordan-block formula (The complex exponential by its power series, Jordan, contour, similarity, and normal-functional-calculus formulas agree).
The exponential series is absolutely convergent for a bounded matrix operator (The exponential series of a bounded operator).
Verification
Write with and . For , . The Jordan formula and similarity invariance in [F1] therefore give . Direct multiplication gives and , so is nonnormal.
The row-sum norm is , while the spectral radius of is . From [F2], (for , , with strict inequality for some terms). Thus , displaying transient norm growth despite the stable eigenvalues.
A half-turn lies on the principal logarithm branch cut
Example
The planar half-turn is invertible, and the principal logarithm algorithm must return a branch-domain failure because its spectrum lies on the removed negative-real axis.
Facts & Assumptions
Given: , the principal logarithm request, and finite complex Francis controls with deflation tolerance , sweep budget , stagnation period , and an empty exceptional-shift table for both Schur calls. The Schur–Parlett threshold is , its initial partition is the two singletons, and its interval-keyed table contains the exact Jordan certificate , for each singleton. These block data are not used because the branch test fails first.
The holomorphic principal logarithm is defined on (The principal logarithm is the normalised holomorphic branch on the slit plane).
The branch-aware procedure returns branch-domain-failure when an exact Schur diagonal eigenvalue lies in (Principal matrix logarithm and square root by branch-aware Schur–Parlett).
With sweep budget , a complex Francis reduction returns Schur-computed when the initialized matrix is already upper triangular; when its Hessenberg initialization has no reflector columns (Finite-budget computed Francis Schur reduction with explicit statuses).
Verification
The characteristic polynomial of is , so its only eigenvalue is . This lies on the removed ray and hence outside by [F1].
Here , so [F3] performs no Hessenberg reflectors. The initialized matrix is already upper triangular, and with zero sweeps the reduction returns the exact pair , ; this pair passes and . The branch test then sees the diagonal value and returns branch-domain-failure by [F2]. This records only that the principal holomorphic branch is unavailable there.
Sources
- Sheldon Axler, Linear Algebra Done Right, fourth edition
- Nicholas J. Higham, Computing the Polar Decomposition—with Applications
- Awad H. Al-Mohy and Nicholas J. Higham, A New Scaling and Squaring Algorithm for the Matrix Exponential
- Jan Zur, Matrix Functions, TU Berlin full lecture notes
- Nicholas J. Higham, Functions of Matrices, Handbook of Linear Algebra, Chapter 17