Physlib

PhyslibAlpha.ProbabilisticTheory.JordanOrderUnit.JB.GeneratedByOne.SqrtUniqueness

Uniqueness of the positive square root

i. Overview

Every nonnegative `b` with `b ∘ b = a` is the square root of `a` from the functional calculus. Evaluating polynomials by Jordan multiplication does not depend on the subalgebra in which it is computed, so `p(a) = (p ∘ X²)(b)` for every polynomial `p`. Approximating the square root by polynomials on both sides gives `b = √a`.

ii. Key results

  • `NormedJordanAlgebra.jordanPolyEval` : evaluating a polynomial by Jordan multiplication.
  • `NormedJordanAlgebra.jordanPolyEval_comp_sq` : `(p ∘ X²)(b) = p(b ∘ b)`.
  • `NormedJordanAlgebra.jordanSqrt_eq_of_nonneg_of_mul_self` : the positive square root is unique.

iii. Table of contents

  • A. The ambient-independent polynomial evaluation
  • B. Approximation of the polynomial calculus
  • C. Uniform polynomial approximation of the square root
  • D. Unrestricted uniqueness of the positive square root

A. The ambient-independent polynomial evaluation

B. Approximation of the polynomial calculus

C. Uniform polynomial approximation of the square root

D. Unrestricted uniqueness of the positive square root

9 declarations

definition

Jordan polynomial evaluation p(x)p(x)

For an element xx of a Jordan algebra EE and a real polynomial p(X)=∑i=0nciXi∈R[X]p(X) = \sum_{i=0}^n c_i X^i \in \mathbb{R}[X], this function computes the evaluation p(x)=∑i=0ncixi∈Ep(x) = \sum_{i=0}^n c_i x^i \in E. Here, xix^i denotes the ii-th Jordan power of xx, defined recursively by x0=1x^0 = 1 and xk+1=x∘xkx^{k+1} = x \circ x^k where ∘\circ is the Jordan product. This definition is "ambient-independent," meaning it relies solely on the Jordan multiplication of xx and does not require reference to a specific closed one-generator subalgebra.

theorem

Polynomial Evaluation in C(u)C(u) Matches Jordan Evaluation

Let EE be a normed Jordan algebra and u∈Eu \in E. Let C(u)C(u) be the closed Jordan subalgebra generated by the identity 11 and uu. For any polynomial p∈R[X]p \in \mathbb{R}[X] and any element x∈C(u)x \in C(u), the standard polynomial evaluation p(x)p(x) (as defined in the associative algebra C(u)C(u)) is equal to the Jordan polynomial evaluation p(x)p(x) computed in the ambient algebra EE.

theorem

Additivity of Jordan Polynomial Evaluation: (p+q)(x)=p(x)+q(x)(p + q)(x) = p(x) + q(x)

Let EE be a Jordan algebra and x∈Ex \in E be an element. For any two real polynomials p,q∈R[X]p, q \in \mathbb{R}[X], the Jordan polynomial evaluation of their sum at xx is equal to the sum of their individual evaluations at xx. That is, (p+q)(x)=p(x)+q(x)(p + q)(x) = p(x) + q(x) where p(x)p(x) denotes the evaluation ∑i=0ncixi\sum_{i=0}^n c_i x^i using Jordan powers of xx.

theorem

(p∘X2)(v)=p(v2)(p \circ X^2)(v) = p(v^2) in Jordan Algebras

Let EE be a Jordan algebra and v∈Ev \in E. For any real polynomial p∈R[X]p \in \mathbb{R}[X], let p(v)p(v) denote the Jordan polynomial evaluation of pp at vv (where powers vnv^n are computed using the Jordan product ∘\circ). Then, evaluating the composed polynomial p(X2)p(X^2) at vv is equivalent to evaluating pp at v2=v∘vv^2 = v \circ v. That is, (p∘X2)(v)=p(v2)(p \circ X^2)(v) = p(v^2).

theorem

The Jordan Continuous Functional Calculus of a Polynomial is p(a)p(a)

Let EE be a nontrivial normed Jordan algebra. For any element a∈Ea \in E and any real polynomial p∈R[X]p \in \mathbb{R}[X], let fp:σ(a)→Rf_p: \sigma(a) \to \mathbb{R} be the continuous function defined on the Jordan spectrum σ(a)\sigma(a) of aa by the evaluation of pp. Then the Jordan continuous functional calculus of aa applied to fpf_p is equal to the Jordan polynomial evaluation p(a)p(a): jordanCfc(a,fp)=p(a)\text{jordanCfc}(a, f_p) = p(a) where p(a)p(a) denotes the evaluation of the polynomial at aa using the Jordan product structure.

theorem

∥p(a)−jordanCfc(a,F)∥≤δ\|p(a) - \text{jordanCfc}(a, F)\| \le \delta from uniform polynomial approximation on the Jordan spectrum

Let EE be a nontrivial normed Jordan algebra and a∈Ea \in E be an element with Jordan spectrum σ(a)⊆R\sigma(a) \subseteq \mathbb{R}. Let p∈R[X]p \in \mathbb{R}[X] be a real polynomial and F:σ(a)→RF: \sigma(a) \to \mathbb{R} be a continuous function. Suppose there exists a non-negative real number δ≥0\delta \ge 0 such that for all x∈σ(a)x \in \sigma(a), the inequality ∣p(x)−F(x)∣≤δ|p(x) - F(x)| \le \delta holds. Then the norm of the difference between the Jordan polynomial evaluation p(a)p(a) and the Jordan continuous functional calculus of FF at aa is bounded by δ\delta: ∥p(a)−jordanCfc(a,F)∥≤δ\|p(a) - \text{jordanCfc}(a, F)\| \le \delta

theorem

Every polynomial function on ss has a global polynomial representative p∈R[x]p \in \mathbb{R}[x]

Let s⊆Rs \subseteq \mathbb{R} be a set and C(s,R)C(s, \mathbb{R}) denote the space of continuous real-valued functions on ss. If a function g∈C(s,R)g \in C(s, \mathbb{R}) is a polynomial function on ss (meaning it belongs to the set `polynomialFunctions s`), then there exists a real polynomial p∈R[x]p \in \mathbb{R}[x] such that the evaluation of pp on ss is equal to gg.

theorem

Uniform polynomial approximation of s\sqrt{s} on [0,M][0, M]

For any real number MM and any positive real number ϵ>0\epsilon > 0, there exists a polynomial pp with real coefficients such that for all s∈[0,M]s \in [0, M], the inequality ∣p(s)−s∣<ϵ|p(s) - \sqrt{s}| < \epsilon holds.

theorem

Uniqueness of the positive square root: b≥0b \ge 0 and b2=a  ⟹  b=ab^2 = a \implies b = \sqrt{a}

Let EE be a nontrivial normed Jordan algebra. For any non-negative element a∈Ea \in E and any non-negative element b∈Eb \in E, if b2=ab^2 = a (where the square is taken with respect to the Jordan product), then bb is equal to the canonical positive square root of aa, denoted by a\sqrt{a}.