Computations with real numbers are those of The Real Numbers as a Type. By Basic Facts about Intervals of the Real Line (v), [a,b] is an interval containing the two distinct points a and b. As in Euclidean Space and Real Matrices: Standing Notation (ii) and Euclidean Space and Real Matrices: Standing Notation (vi), dE(u,v)=∥u−v∥ for u,v∈Rn and dp×r(M,N)=∥M−N∥ for M,N∈Mp×r(R).
Proof of (i). Let A and g be as there. For t∈[a,b] and x∈Rn, the matrix-vector product A(t)x lies in Rn (Euclidean Space and Real Matrices: Standing Notation (iii)), and so does the sum A(t)x+g(t) (Euclidean Space Rn: n-Tuples of Real Numbers with Their Componentwise Operations (iv)). So the map [a,b]×Rn→Rn, (t,x)↦A(t)x+g(t), given by this expression, exists (Values, Restriction and Equality of a Map, and the Map u↦t(u) as a Defined Set Symbol (v)); two maps [a,b]×Rn→Rn with these values agree at every point, and so are equal by Values, Restriction and Equality of a Map, and the Map u↦t(u) as a Defined Set Symbol (iv). Likewise, for A, B and G as there, t∈[a,b] and X∈Mn×q(R), the products A(t)X and XB(t) lie in Mn×q(R) (Euclidean Space and Real Matrices: Standing Notation (iii)), and so does A(t)X+XB(t)+G(t) (Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iv)); so the map (t,X)↦A(t)X+XB(t)+G(t) from [a,b]×Mn×q(R) to Mn×q(R) exists (Values, Restriction and Equality of a Map, and the Map u↦t(u) as a Defined Set Symbol (v)), and it is the only map with these values by Values, Restriction and Equality of a Map, and the Map u↦t(u) as a Defined Set Symbol (iv). This proves (i).
Step 1: a bound for a continuous matrix-valued map. Let p∈N and let C:[a,b]→Mp(R) be continuous on [a,b]. We show that there is K∈R with K≥0 and ∥C(t)∥≤K for every t∈[a,b]. The map ν:[a,b]→R, t↦∥C(t)∥ (the composite of C with the operator norm, a map Mp(R)→R by The Operator Norm of a Real Matrix (i)), is continuous on [a,b] by Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (iii) and Continuity of Vector- and Matrix-Valued Maps: the Componentwise Criterion, Norms and Algebraic Operations (v), with (R,dR) for its (X,d) and [a,b] for its S. By Closed Interval [a,b] is Compact in R (i), [a,b] is compact in (R,TR), where TR is the set of open subsets of (R,dR), that is, the topology Td of Extreme Value Theorem on a Compact Subset of a Metric Space for (R,dR) in place of (X,d); and [a,b] is nonempty. By Extreme Value Theorem on a Compact Subset of a Metric Space (i), with [a,b] for its K and ν for its f, there is t1∈[a,b] with ν(t)≤ν(t1) for every t∈[a,b]. So K=∥C(t1)∥ satisfies ∥C(t)∥≤K for every t∈[a,b], and K≥0 by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (i).
Proof of (ii). Let A, g and F be as there. By Step 1, with n for p and A for C, there is K0∈R with K0≥0 and ∥A(t)∥≤K0 for every t∈[a,b].
Lipschitz bound. Let K∈R with K≥0 and ∥A(t)∥≤K for every t∈[a,b], and let t∈[a,b] and x,y∈Rn. By Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v) (and Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (ii), Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (i)), F(t,x)−F(t,y)=(A(t)x−A(t)y)+(g(t)−g(t))=A(t)x−A(t)y=A(t)(x−y). By Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (ii), and as ∥x−y∥≥0 by Properties of the Euclidean Norm on Rn: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i),
∥F(t,x)−F(t,y)∥≤∥A(t)∥∥x−y∥≤K∥x−y∥.
Continuity. Let d be the product metric on R×Rn and let (t0,x0)∈[a,b]×Rn. The choices are made in this order. First a real ε>0 is given; put μ=ε/(3(1+∥x0∥)), a positive real number as ∥x0∥≥0. Next, A is continuous at t0 relative to [a,b] by Continuous Map Between Metric Spaces (ii), and Continuous Map Between Metric Spaces (i) gives a real δ1>0 such that ∥A(t)−A(t0)∥<μ for every t∈[a,b] with dR(t0,t)<δ1; likewise it gives, for g, a real δ2>0 such that ∥g(t)−g(t0)∥<ε/3 for every t∈[a,b] with dR(t0,t)<δ2. Let δ>0 be the smallest of δ1, δ2 and ε/(3(1+K0)). Now let (t,x)∈[a,b]×Rn with d((t0,x0),(t,x))<δ. By The Product Metric is a Metric (iii), dR(t0,t)<δ and ∥x0−x∥=dE(x0,x)<δ, and ∥x−x0∥=∥x0−x∥ by Properties of the Euclidean Norm on Rn: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v). By Products of Real Matrices with Zero Matrices, Negatives and Differences (iii) (and Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (ii), Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (i)),
F(t,x)−F(t0,x0)=A(t)(x−x0)+(A(t)−A(t0))x0+(g(t)−g(t0)),
so, by Properties of the Euclidean Norm on Rn: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (ii),
∥F(t,x)−F(t0,x0)∥≤K0∥x−x0∥+μ∥x0∥+∥g(t)−g(t0)∥≤3ε+3ε+∥g(t)−g(t0)∥<ε.
Thus dE(F(t,x),F(t0,x0))<ε. So F is continuous at (t0,x0) relative to [a,b]×Rn by Continuous Map Between Metric Spaces (i), and, the point being arbitrary, continuous on [a,b]×Rn by Continuous Map Between Metric Spaces (ii). This proves (ii).
Proof of (iii). Let A, g and F be as there. By (ii), there is K0∈R with K0≥0 and ∥A(t)∥≤K0 for every t∈[a,b], and F is continuous on [a,b]×Rn and satisfies the Lipschitz bound with the constant K0. By The Picard–Lindelöf Theorem on a Closed Interval: Existence, Uniqueness and Continuous Dependence for Globally Lipschitz Systems (i), with K0 for L, for every ξ∈Rn the initial value problem with right-hand side F and initial value ξ has exactly one solution. This proves (iii).
Proof of (iv). Let A, B, G and F be as there. Step 1, with n and A, and with q and B, for p and C, gives the bounds KA and KB; fix such KA,KB≥0.
Lipschitz bound. Let KA′,KB′∈R with KA′,KB′≥0, ∥A(t)∥≤KA′ and ∥B(t)∥≤KB′ for every t∈[a,b], and let t∈[a,b] and X,Y∈Mn×q(R). By Products of Real Matrices with Zero Matrices, Negatives and Differences (iii) (and Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (ii), Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (i)), F(t,X)−F(t,Y)=A(t)(X−Y)+(X−Y)B(t). By Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vi), Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vii) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (i),
∥F(t,X)−F(t,Y)∥≤∥A(t)∥∥X−Y∥+∥X−Y∥∥B(t)∥≤(KA′+KB′)∥X−Y∥.
Continuity. Let d be the product metric on R×Mn×q(R) and let (t0,X0)∈[a,b]×Mn×q(R). The choices are made in this order. First a real ε>0 is given; put μ=ε/(5(1+∥X0∥))>0, using Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (i). Next, by Continuous Map Between Metric Spaces (ii) and Continuous Map Between Metric Spaces (i), there are real δA,δB,δG>0 such that, for every t∈[a,b], dR(t0,t)<δA implies ∥A(t)−A(t0)∥<μ, dR(t0,t)<δB implies ∥B(t)−B(t0)∥<μ, and dR(t0,t)<δG implies ∥G(t)−G(t0)∥<ε/5. Let δ>0 be the smallest of δA, δB, δG and ε/(5(1+KA+KB)). Now let (t,X)∈[a,b]×Mn×q(R) with d((t0,X0),(t,X))<δ. By The Product Metric is a Metric (iii), dR(t0,t)<δ and ∥X0−X∥<δ, and ∥X−X0∥=∥X0−X∥ by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v). By Products of Real Matrices with Zero Matrices, Negatives and Differences (iii) (and Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (ii), Additive Laws for Vectors in Rq and for Real p×q Matrices: Group Laws and Rules for Differences (i)),
F(t,X)−F(t0,X0)=A(t)(X−X0)+(A(t)−A(t0))X0+(X−X0)B(t)+X0(B(t)−B(t0))+(G(t)−G(t0)),
so, by Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vi) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vii),
∥F(t,X)−F(t0,X0)∥≤(KA+KB)∥X−X0∥+2μ∥X0∥+∥G(t)−G(t0)∥≤5ε+52ε+∥G(t)−G(t0)∥<53ε+5ε=54ε<ε,
since ∥G(t)−G(t0)∥<ε/5 as dR(t0,t)<δ≤δG; that is, dn×q(F(t,X),F(t0,X0))<ε. As in the proof of (ii), F is continuous on [a,b]×Mn×q(R). This proves (iv).
Proof of (v). Let A, B, G and F be as there. By (iv), there are KA,KB∈R with KA,KB≥0, ∥A(t)∥≤KA and ∥B(t)∥≤KB for every t∈[a,b], and F is continuous on [a,b]×Mn×q(R) and satisfies the Lipschitz bound with the constant KA+KB≥0. By The Picard–Lindelöf Theorem on a Closed Interval: Existence, Uniqueness and Continuous Dependence for Globally Lipschitz Systems (iii), with n for p and KA+KB for L, for every Ξ∈Mn×q(R) the initial value problem with right-hand side F and initial value Ξ has exactly one solution. This proves (v).