Quasimaximality and principal filters isomorphism between \({\mathcal E}^*\) and \({\mathcal L}^*(V_\infty)\) (Q701738): Difference between revisions

Let \(V_\infty\) be a computable infinite-dimensional computable vector space generated by a computable basis. Any two such spaces are computably isomorphic. Two of its subspaces \(V_0\) and \(V_1\) are called equivalent if there exists a finite-dimensional vector space \(W\) such that \(V_0+W=V_1+W\). The classes of computably enumerable subspaces of \(V_\infty\) modulo this equivalence form a lattice \({\mathcal L}^\ast(V_\infty)\) by inclusion up to a finite-dimensional subspace. The principal filter of it generated by a subspace \(V\) is denoted by \({\mathcal L}^\ast(V,\uparrow)\). The principal filter generated by a computably enumerable subset \(I\) of the basis in the lattice \({\mathcal E}^\ast\) of computably enumerable subsets of the computable basis modulo the equivalence ``to differ on a finite set only'' is denoted by \({\mathcal E}^\ast(I,\uparrow)\). The author proves a nessessary and sufficient condition for a quasimaximal subset \(I\) of the computable basis of \(V_\infty\) to generate a subspace cl\((I)\) for which the ordered set \({\mathcal L}^\ast(\text{cl}(I),\uparrow)\) is isomorphic to \({\mathcal E}^\ast(I,\uparrow)\) and gives examples of spaces that satisfy and do not satisfy this condition.