Lattice problems originating in quadratic space theory (Q1063016)

H. Gross and his coworkers have developed a ''lattice method'' for isometry classification problems mainly in infinite dimensional quadratic spaces. It requires the computation (in the general case) of the sublattice generated by one or more subspaces in the lattice of all subspaces with formation of the orthogonal as an additional operation. Also, they consider the closure operators associated with the linear topologies determined by the orthogonals of subspaces the dimension of which is bounded by a given cardinality. In the case of one subspace and dimension \(\aleph_ m\) this lattice is called \(V_ m(a)\). The authors give a list of axioms valid in such lattices which enables them to determine the free lattice \(V_ 3[a]\) having 957 elements (the cases \(m\leq 2\) had been known before, \(m=0\) being due to Kaplansky). It should be noted that the original classification problem has been solved, now, by Wild based on work of Schuppli. Also, the authors show that \(V_ m(5)\) is infinite in the general case. Both results are based on a general decomposition of \(V_ m[a]\). Last not least the most important open problems in the field are stated.