As there is no (obvious) notion of trivial ∧-semibrace, the following question is far less trivial: Problem 3.
Statement
As there is no (obvious) notion of trivial ∧-semibrace, the following question is far less trivial: Problem 3. It has been shown by Rump, that every L-algebra X is embedded as a sub- L-algebra into a self-similar L-algebra S(X) - its self-similar closure - such that S(X) is generated as a monoid by X. The self-similar closure can be shown to be unique up to isomorphism. It can furthermore be shown that the self-similar closure S(X) always has a group of left fractions G(X) = {a−1 b : a, b \in S(X)}, the structure group of X. The next problem is concerned with right bricks: Definition 4. [7] A right brick is a set X, together with binary operations \cdot, ◦ and distinguished elements e, 0 \in X such that (X, \cdot, e) and (X, ◦, e) are L-algebras, and setting x = x \cdot 0 and x̃ = x ◦ 0, we have • x̃ = x, • x \cdot x ◦ y = y \cdot y ◦ x and x ◦ xg \cdoty =y◦y\cdotgx, • xg \cdot y = x̃ \cdot ỹ. On a right brick, the canonical orders determined by ◦, \cdot coincide and make the underlying set a lattice. For a (possibly noncommutative) field K and an integer n \geq 1, let L(K, n) be the lattice of K-linear subspaces of the left vector space K n . A lattice isomorphism to one of the form L(K, n) is called desarguesian. Problem 5. Which desarguesian lattices L(K, n) are the underlying lattices of a brick? Problem 6. Can the subspace lattice of a non-desarguesian plane be the under- lying lattice of a brick? Only positive answers are known - a brick structure on L(K, n) is known to exist in the following cases:
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.