TheoremBase

The Truncated Cyclic Gradient of a Gauge Vector

For a gauge vector p and a length n, the i-th truncated cyclic gradient is the self-adjoint part of the sum of cwc_w times conj(p(w)) times the i-th cyclic derivative of w, over cyclically reduced words of length at most n.

Statement

In the setting of The Real Numbers: Standing Notation and Background, let N\mathbb{N} be the natural numbers, for k∈Nk\in\mathbb{N} let [k][k] be the initial segment determined by kk, and let d∈Nd\in\mathbb{N}. Let Wd∘W^{\circ}_{d} be the set of cyclically reduced words and Wd,k∘W^{\circ}_{d,k} the set of those of length kk, let the weights cwc_{w} and the gauge space EdE_{d} be as in The Word Gauge: Weights, the Space of Weighted Square-Summable Word Functions, Its Norm and Inner Product, and the Length-Weighted Gauge, let DwiD^{i}_{w} be the cyclic derivatives, and let word polynomials, their pointwise sums and complex multiples and their adjoints be as in Word Polynomials in Unitary Letters: the Normed *-Algebra of Finitely Supported Word Functions; finite sums of word polynomials are word polynomials as explained in Rotations and Cyclic Derivatives of Words in Unitary Letters. Let C\mathbb{C} be the complex numbers with conjugation z↦z‾z\mapsto\overline{z}.

(Truncated cyclic gradient) Let p∈Edp\in E_{d} and n∈Nn\in\mathbb{N}, and let W≤n∘W^{\circ}_{\le n} be the union of the sets Wd,k∘W^{\circ}_{d,k}, k∈[n]k\in[n], which is finite by Counting Cyclically Reduced Words: Finiteness and the Bound (2d)^k §finite and Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §finite-union. For i∈[d]i\in[d] put

Zp,ni=∑w∈W≤n∘cw p(w)‾ Dwi,Ξp,ni=12(Zp,ni+(Zp,ni)∗).Z^{i}_{p,n}=\sum_{w\in W^{\circ}_{\le n}}c_{w}\,\overline{p(w)}\,D^{i}_{w},\qquad \Xi^{i}_{p,n}=\tfrac12\bigl(Z^{i}_{p,n}+(Z^{i}_{p,n})^{*}\bigr).

The word polynomial Ξp,ni\Xi^{i}_{p,n} is the ii-th cyclic gradient of pp truncated at length nn.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…