An Algorithm for Verifying Some Norm Identities in Inner-Product Spaces
Abstract
In this paper, we provide an algorithm for verifying the validity of identities of the form A⊂eqnΣcA xA 2=0, where xA=i∈ AΣxi and n=\1,...,n\ in inner-product spaces. Such algorithm is used to verify the validity, in inner-product spaces, for a number of identities. These include a generalization of the parallelopiped law. We also show that such identities hold only in inner-product spaces. Thus, the algorithm can be used to deduce characterizations of inner-product spaces.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.