Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T23:51:12.723Z Has data issue: false hasContentIssue false

Transformations of n-Space which Preserve a Fixed Square-Distance

Published online by Cambridge University Press:  20 November 2018

J. A. Lester*
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

1. Introduction. Our interest here lies in the following theorem:

THEOREM 1. Assume there is defined on R n (n ≧ 3) a “square-distance” of the form

where (g ij) is a given symmetric non-singular matrix over the reals and x = (x 1, …, x n ), y = (y 1, …, y n ) ∈ R n . Assume further that f is a bijection ofR n which preserves a given fixed square-distance ρ, i.e. d(x, y) = ρ if and only if d(ƒ(x),ƒ(y)) = ρ. Then (unless ρ = 0 and (gij) is positive or negative definite) ƒ(x) = Lx + ƒ(0), where L is a linear bijection ofR nsatisfying d(Lx, Ly) = ±d(x, y) for all x, y ∈ R n (the – sign is possible if and only if ρ = 0 and (g ij ) has signature 0).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1979