In case you haven't noticed, if you've read some of my previous posts, I've been thinking a lot about strings (of characters) lately, and what I can do with them mathematically. Obviously the strings together with concatenation form a monoid. I've been trying to think about what else I can do with them. Firstly, as in my last post, I showed that it's possible to make an infinite dimensional Hilbert space of strings, which I tried to explain in a way clear enough to people who don't exactly know what a Hilbert space is (including myself). It's pretty important to make a vector space out of strings if I want to do any cool stuff with them, because all the cool stuff tends to use vector spaces.
If we take the vector space that I defined previously, then we already have vector addition and inner products defined on the strings. However, neither of these are anything special about strings, and we could've just as easily numbered each dimension with a natural number. However there is one special thing that stand out about strings, and that is string concatenation.
Since string concatenation forms a monoid, it seemed pretty obvious to look around for things that are also monoids. Something that particularly stands out is the set of all real square matrices of size n, Mn(ℝ). This set includes all matrices including ones with zero determinant, which is what makes it different from the general linear group GLn(ℝ). Matrices with zero determinant have no inverse, and therefore Mn(ℝ) does not form a group. However, these two sets of matrices have an interesting relationship: Mn(ℝ) is the Lie algebra of GLn(ℝ)! This led me to the idea of trying to make a Lie algebra for the monoid of strings.
First, I'll explicitly show that the strings form a monoid with concatenation:
Closure: the concatenation of two strings will always form a new string.
$$ a\cdot b \in S^*, \forall a,b \in S^* $$
Associativity: string concatenation is associative (but not commutative)
$$ a \cdot (b \cdot c) = (a \cdot b) \cdot c, \forall a,b,c \in S^* $$
Identity: the empty string acts as the identity.
$$ a\cdot "" = "" \cdot a = a, \forall a \in S^* $$
Given this definition as multiplication, we can define a Lie bracket, where we use fraktur s as the vector space for the Lie algebra:
$$ [\cdot, \cdot] : \mathfrak{s}^* \times \mathfrak{s}^* \to \mathfrak{s}^* $$
$$ [a, b] = a \cdot b - b \cdot a $$
$$ ["what", "meow"] = "whatmeow" - "meowwhat" $$
This lie bracket is alternating and anticommutative:
$$ ["what","what"] = "whatwhat" - "whatwhat" = 0 $$
$$ ["wh","at"] = "what" - "atwh" = -["at","wh"] $$
$$ [\alpha x + \beta y, z] = \alpha [x,z] + \beta [y,z] $$
$$ [5 "wh" + 3 "c", "at"] = (5 "what" + 3 "cat") - (5 "atwh" + 3 "atc) $$
$$ 5 ["wh","at"] + 3 ["c","at"] = 5 ("what" - "atwh") - 3 ("cat" - "atc") $$
The second and third lines are equal, which is exactly what we wanted to show.
And finally, incredibly enough, the Lie bracket satisfies the Jacobi identity:
$$ [x,[y,z]] + [z,[x,y]] + [y,[z,x]] = 0 $$
If we let \\( x = "x", y = "b", z = "zz" \\) as an example if you weren't convinced already:
$$ [y,z] = ("bzz" - "zzb") $$
$$ [x,y] = ("xb" - "bx") $$
$$ [z,x] = ("zzx" - "xzz") $$
Then plugging those into the Jacobi identity, we get the following sum:
$$ ("xbzz" - "xzzb" - "bzzx" + "zzbx") + $$
$$ ("zzxb" - "zzbx" - "xbzz" + "bxzz") + $$
$$ ("bzzx" - "bxzz" - "zzxb" + "xzzb") $$
As for now, that's all I've got. I don't know if this idea would lead to anything particularly profound. I'll think about it some more. Maybe it would be interesting to define a Lie group given this definition, which shouldn't be too hard. I may also look into other algebras like Jordan algebras over the strings, just cause I find stuff like this fun for some reason.