Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-16T21:16:20.470Z Has data issue: false hasContentIssue false
  • English
  • Français

Automorphisms of supermaximal subspaces

Published online by Cambridge University Press:  12 March 2014

R. G. Downey  and
G. R. Hird
R. G. Downey
Affiliation:
Department of Mathematics, National University of Singapore, Kent Ridge, 0511, Singapore
G. R. Hird
Affiliation:
Department of Mathematics, Monash University, Clayton, Victoria 3168, Australia
Get access Rights & Permissions [Opens in a new window]

Extract

An infinite-dimensional vector space V∞ over a recursive field F is called fully effective if V∞ is a recursive set identified with ω upon which the operations of vector addition and scalar multiplication are recursive functions, identity is a recursive relation, and V∞ has a dependence algorithm, that is a uniformly effective procedure which when applied to x, a1,…,an, ∈ V∞ determines whether or not x is an element of {a1,…,an}* (the subspace generated by {a1,…,an}). The study of V∞, and of its lattice of r.e. subspaces L(V∞), was introduced in Metakides and Nerode [15]. Since then both V∞ and L(V∞) (and many other effective algebraic systems) have been studied quite intensively. The reader is directed to [5] and [17] for a good bibliography in this area, and to [15] for any unexplained notation and terminology.

In [15] Metakides and Nerode observed that a study of L(V∞) may in some ways be modelled upon a study of L(ω), the lattice of r.e. sets. For example, they showed how an e-state construction could be modified to produce an r.e. maximal subspace, where M ∈ L(V∞) is maximal if dim(V∞/M) = ∞ and, for all W ∈ L(V∞), if W ⊃ M then either dim(W/M) < ∞ or dim(V∞/W) < ∞.

However, some of the most interesting features of L(V∞) are those which do not have analogues in L(ω). Our concern here, which is probably one of the most striking characteristics of L(V∞), falls into this category. We say M ∈ L(V∞) is supermaximal if dim(V∞/M) = ∞ and for all W ∈ L(V∞), if W ⊃ M then dim(W/M) < ∞ or W = V∞. These subspaces were discovered by Kalantari and Retzlaff [13].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 50 , Issue 1 , March 1985 , pp. 1 - 9
Copyright
Copyright © Association for Symbolic Logic 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Ash, C. J. and Downey, R. G., Decidable subspaces and recursively enumerable subspaces, this Journal, vol. 49 (1984), pp. 1137–1145.Google Scholar
[2] Ash, C. J. and Nerode, A., Intrinsically recursive relations, [5, pp. 26–41].Google Scholar
[3] Baldwin, J. T., Recursion theory and abstract dependence, Patras Logic Symposion (1980), North-Holland, Amsterdam, 1982, pp. 67–76.Google Scholar
[4] Cohen, P. F. and Jockusch, C. G. Jr., A lattice property of Post's simple set, Illinois Journal of Mathematics, vol. 19 (1975), pp. 450–453.Google Scholar
[5] Crossley, J. N. (editor), Aspects of effective algebra, Upside Down A Book Company, Steels Creek, Australia, 1981.Google Scholar
[6] Downey, R., On a question of A. Retzlaff, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 29 (1983), pp. 379–384.Google Scholar
[7] Downey, R., Co-immune subspaces and complementation in V*infin; , this Journal, vol. 49 (1984), pp. 528–538.Google Scholar
[8] Downey, R., Bases of supermaximal subspaces and Steinitz systems. I, this Journal, vol. 49 (1984), pp. 1146–1159.Google Scholar
[9] Downey, R. G. and Hird, G. R., Certain classes of supermaximal subspaces and automorphisms of the lattice of recursively enumerable subspaces, manuscript, 1982.Google Scholar
[10] Guichard, D., Automorphisms of substructure lattices in recursive algebra, Annals of Pure and Applied Logic, vol. 25 (1983), pp. 47–58.Google Scholar
[11] Guichard, D., Automorphisms and large submodels in effective algebra, Ph.D. Thesis, University of Wisconsin, Madison, Wisconsin, 1982.Google Scholar
[12] Hird, G. R., Preliminary version of Ph.D. thesis.Google Scholar
[13] Kalantari, I. and Retzlaff, A., Maximal vector spaces under automorphisms of the lattice of recursively enumerable subspaces, this Journal, vol. 42 (1977), pp. 481–491.Google Scholar
[13a] Kalantari, I., Structural properties of the lattice of recursively enumerable vector spaces, Ph.D. Thesis, Cornell University, Ithaca, New York, 1977.Google Scholar
[14] Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295–310.Google Scholar
[15] Metakides, G. and Nerode, A., Recursively enumerable vector spaces, Annals of Mathematical Logic, vol 11 (1977), pp. 147–171.Google Scholar
[16] Metakides, G., Recursion theory on fields and abstract dependence, Journal of Algebra, vol. 65 (1980), pp. 36–59.CrossRefGoogle Scholar
[17] Nerode, A. and Remmel, J. B., A. survey of lattices of r.e. substructures, Recursion theory, Proceedings of Symposia in Pure Mathematics, vol. 42, American Mathematical Society, Providence, Rhode Island, 1984, pp.Google Scholar
[17a] Nerode, A. and Remmel, J. B., Recursion theory on matroids. II, Southeast Asian Conference on Logic (Singapore, 1981); Chong, C. T. and Wicks, M. J., editors), North-Holland, Amsterdam, 1983, pp. 133–184.Google Scholar
[18] Remmel, J., On r.e. and co-r.e. vector spaces with nonextendible bases, this Journal, vol. 45 (1980), pp. 20–34.Google Scholar
[19] Soare, R. I., Automorphisms of the lattice of recursively enumerable sets. Part I: Maximal sets, Annals of Mathematics, ser. 2, vol. 100 (1974), pp. 80–120.Google Scholar