Skip to main content
Joshua Grochow's user avatar
Joshua Grochow's user avatar
Joshua Grochow's user avatar
Joshua Grochow
  • Member for 14 years, 3 months
  • Last seen this week
Loading…
comment
What is a "general" relation algebra?
Oh yeah, sorry, silly mistake on my part. I suppose one could ask if, e.g., RA is the variety containing RRA and with a finite equational axiomatization where that finite equational axiomatization is as short as possible (by some metric - number of axioms, numbers of characters, Kolmogorov complexity, ...), but that seems much harder to establish, if true.
comment
What is a "general" relation algebra?
Is RA the smallest variety containing RRA and with a finite equational characterization? That wouldn't answer your question as stated, but, if true, could be taken as a different kind of evidence that these axioms are "the right ones".
comment
Wedderburn theorem for finite-dimensional algebras over the complex numbers
An alternative if perhaps less standard way to see it is to not require \varphi nor A-modules to be unital, and then we have to allow the 0 representation as a simple module.
comment
Wedderburn theorem for finite-dimensional algebras over the complex numbers
Oh, sorry, yes that's a potential issue but you already found the solution. Really what's happening in that case is that A is conjugate to matrices of the form $\begin{pmatrix} a & 0 \\ 0 & 0 \end{pmatrix}$, and so is essentially a subalgebra of a smaller matrix algebra acting on a smaller vector space. And then the rest of what I wrote goes through in that smaller matrix algebra & smaller vector space.
Loading…
comment
Are all "reasonable" Gödel encodings isomorphic in some sense?
@NoahSchweber: I admit I didn't quite follow all of that, but it sounds plausibly like what I was hoping for, so I would certainly appreciate reading more details about it!
comment
Wedderburn theorem for finite-dimensional algebras over the complex numbers
@LSpice: I understood that. The results about representations I mentioned imply block-diagonalizability of any semisimple subalgebra of $M_d(F)$ into blocks each of which is a full matrix algebra on its own, though some blocks can be repeated. If you think there is a little new content I can spell out the details in an actual answer.
comment
Wedderburn theorem for finite-dimensional algebras over the complex numbers
You can always put a semisimple matrix algebra into block-diagonal form over an algebraically closed field. This follows from the classification of the representations of a semisimple algebra: they are all direct sums of irreps, and each irrep is the standard d-dimensional module for $M_d(F)$, where $M_d(F)$ is one of the direct summands of the algebra.
Loading…
awarded
awarded
comment
Irreducible action of an algebraic group
I assumed that "algebraic group" meant G was finite-dimensional and that $G/G^0$ was finite. And then doesn't it follow that any irrep of $G^0$, and hence $G$, is finite-dimensional? But re: other fields, yes, I see there is potentially an issue for non-algebraically closed fields.
answered
Loading…
comment
Can closure of an orbit under a reductive action contain infinitely many orbits?
FYI the classification give in the Kac paper linked to by Sam Gunningham in an earlier comment is known to contain some errors, which were corrected in Dadok & Kac: doi.org/10.1016/0021-8693(85)90136-X
comment
Canonical forms for representations of tame algebras
I would guess one might make some progress on this problem - perhaps in either direction - using Sergeichuk's normal form based on Belitskii's algorithm: Sergeichuk, "Canonical matrices for linear matrix problems", Lin. Alg. Appl. 2000, doi.org/10.1016/S0024-3795(00)00150-6
accepted
asked
Loading…
revised
complex structure on S^n
Fixed link to the DOI link, added author/title/journal/year
Loading…
awarded
1
2
3 4 5
16