TheoremBase

First-Order Operators Satisfy the Second-Order Structure and Tail-Insensitivity Conditions

A structure pair for the first-order condition is a structure pair for the second-order condition, and an operator that ignores its form argument is tail-insensitive along every admissible basis.

Statement

In the setting of Hilbert Triples: Standing Notation and Background, let U⊆HU\subseteq H be open in HH, with W=D(A)∩UW=D(A)\cap U as in Hilbert Triples: Standing Notation and Background (v), let Sym(H)\mathrm{Sym}(H) be as in Hilbert Triples: Standing Notation and Background (vi), and let FF be a second-order equation operator on UU relative to (H,V,A)(H,V,A). Then the following hold.

1. (A first-order structure pair serves at second order) Let R∈RR\in\mathbb{R} be positive and let (ω1,ω2)(\omega_{1},\omega_{2}) be a structure pair for FF at RR. Then (ω1,ω2)(\omega_{1},\omega_{2}) is a second-order structure pair for FF at RR. Consequently, if FF satisfies the first-order structure condition, then FF satisfies the second-order structure condition.

2. (First-order operators are tail-insensitive) Assume that FF is first order, and let (ek)k∈N(e_{k})_{k\in\mathbb{N}} be an orthonormal basis of HH with ek∈Ve_{k}\in V for every k∈Nk\in\mathbb{N}. Then FF is tail-insensitive along (ek)k∈N(e_{k})_{k\in\mathbb{N}}.

3. (The tail-insensitivity condition for a first-order operator) Assume that FF is first order and that HH, as a vector space over R\mathbb{R}, is not finite-dimensional. Then FF satisfies the tail-insensitivity condition.

Proofs

Log in to submit a proof.

Loading...

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…