Skip to content

Lexicographic functional calculus and its application to functional calculus calculus

Evangelos A. Nikitopoulos

math.FAarXiv:2608.08404

Abstract

Let A be a unital C*-algebra and I be a symmetrically normed ideal of A. I introduce and study lexicographic functional calculus (LFC), a kind of multivariate functional calculus for tuples (a1,…,am) of noncommuting self-adjoint elements of A ''acting in lexicographic order,'' i.e., from left to right, with an element bi ∈ I ''inserted'' between the action of ai and ai+1 for each i=1,…,m-1. The reason for its introduction is an application to ''functional calculus calculus,'' the differential calculus of maps induced by single-variate (continuous) functional calculus. Specifically, I prove that if f is sufficiently regular and a∈ Asa:=\c∈ A:c*=c\, then fa,I(b):=f(a+b)-f(a)∈ I for all b∈ Isa:=I Asa, the map fa,I Isa I is Fréchet Ck, and the kth Fréchet derivative of fa,I may be written in terms of LFC applied to the kth divided difference of f, a function of k+1 variables. This result recovers or vastly generalizes nearly all comparable results in the literature. For example, it simultaneously recovers the following three highly related results on the regularity of the function fA Asa A defined by a f(a): (1) If A is commutative and f∈ Ck(R), then fA is Fréchet Ck; (2) if A is finite dimensional and f∈ Ck(R), then fA is Fréchet Ck; and (3) if f is ''slightly better than Ck,'' e.g., belongs to the homogeneous Besov space B1k,∞(R), then fA is Fréchet Ck no matter the choice of A. Before LFC, there was no unifying framework for results (1)--(3); in particular, there was no single result of which they were all corollaries.

Create a lesson