Search arXivSearch

arXiv · math/9509210

Orthogonal Families of Real Sequences

Abstract

For x and y sequences of real numbers define the inner product (x,y) = x(0)y(0) + x(1)y(1)+ ... which may not be finite or even exist. We say that x and y are orthogonal iff (x,y) converges and equals 0. Define l_p to be the set of all real sequences x such that |x(0)|^p + |x(1)|^p + .. converges. For Hilbert space, l_2, any family of pairwise orthogonal sequences must be countable. Thm 1. There exists a pairwise orthogonal family F of size continuum such that F is a subset of l_p for every p>2. It was already known that there exists a family of continuum many pairwise orthogonal elements of real sequences. Thm 2. There exists a perfect maximal orthogonal family of elements of real sequences. Abian raised the question of what are the possible cardinalities of maximal orthogonal families. Thm 3. In the Cohen real model there is a maximal orthogonal set cardinality omega_1, but there is no maximal orthogonal set of cardinality k with ω_1< k < c. Thm 4. For any countable standard model M of ZFC and cardinal k in M such that M satisfies k^ω=k, there exists a ccc generic extension M[G] such that the continuum of M[G] is k and in M[G] for every infinite cardinal i less than or equal to k there is a maximal orthogonal family of cardinality i. Thm 5. (MA_k(σ-centered)) Suppose cardinality of X is less than or equal to k, X contains only finitely many elements of l_2, and for every distinct pair x,y in X the inner product (x,y) converges. Then there exists a z such that z is orthogonal to every element of X. Thm 6.(a) There exists X which is a maximal orthogonal family in l_2 such that for all n with 1\leq n \leqωthere exists Y of cardinality n with (X union Y) a maximal orthogonal family in $\rr^\om$. Furthermore, every maximal orthogonal family containing $X$ is countable. (b) There exists a perfect maximal orthogonal family P such that (P intersect l_2) is a maximal orthogonal family in $l_2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arnold W. Miller, Juris Steprāns. 1995-09-12. Orthogonal Families of Real Sequences. https://arxiv.org/abs/math/9509210

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO

Coordinate recognition: General theory, Groups, and other surprises

A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.

math.LO