5 ms·
Well, if we set all letters to equal 1, then what is stopping this from working out? Haven't they just shown that the product of any combination of 1's is equa
by wodenokoto 11y ago
Well, if we set all letters to equal 1, then what is stopping this from working out?
Haven't they just shown that the product of any combination of 1's is equal to the product of any other combination of ones?
- eru 11y agoThis wouldn't work in eg German, where there's no way to cancel out pronunciation like that.
- raverbashing 11y agoYes, because German pronunciation is very close to the written form of words
- kwhitefoot 11y agoNo dialects in German then?
- raverbashing 11y agoI am referring to Hochdeutsch
- wodenokoto 11y agoCan you give an example of how this wouldn't work out? I can't even figure out how to make one up, and would like to see how it would look.
- eru 11y agoOh, you can only give concrete examples where it would work out. To show that it doesn't work out, you'd have to show that there are no ways to make it work.
- MatthewWilkes 11y agoI'm sure the poster was intending that it wouldn't be complete, like English. There certainly are some letters that obey this property: DASS/DAS; S=1 BUND=BUNT; D=T MANN/MAN; N=1 VIEL=FIEL; V=F VERBEN=WERBEN; V=W SIEH/SIE; H=1 GANZ=GANS; Z=S POPP/POP; P=1 That only gives five letters as the identity (H,N,P,S,Z), but that's how you'd attack it. The equivalence of D/T, for example, is unsurprising as it's an example of voicing changing; these words are in the process of changing. If you can do more complex work with bigrams, more are possible, e.g.: JAHR/JA; HR=1; HR/H; R=1
- eru 11y agoI'd say that S is idempotent in `dass' vs `das'. Not that s is the identity.
- raverbashing 11y agoWhat they proved is that, for certain words, all letters can work as a multiplicative identity element (which if we were talking about numbers it would be 1) Or, https://en.wikipedia.org/wiki/Ghoti https://en.wikipedia.org/wiki/Ghoti
- MatthewWilkes 11y agoNot quite, there's also ordering and indirectness. They've proved that all letters in the English alphabet have at least one word where either appending or prepending that letter does not modify the pronunciation, or have at least one word where changing the first or last letter to the one in question does not modify the pronunciation and that these are not disjoint sets. Someone's silly Friday project, I think.
- johncolanduoni 11y agoThe whole point is that they didn't immediately set all letters equal to one. The only relations they added (on top of cancellation) was that identically sounding words are equal within the monoid. From this, they were able to prove that the group must be the trivial group, no matter how you try to come up with a multiplication table.
- chriswarbo 11y ago> Well, if we set all letters to equal 1, then what is stopping this from working out? > Haven't they just shown that the product of any combination of 1's is equal to the product of any other combination of ones? tl;dr they weren't trying to find a solution, they were trying to characterise the behaviour of all possible solutions; but it turns out that there are no "non-trivial" solutions (i.e. setting all letters to equal 1 is the only way to solve it). Longer version: Technically, yes. However, that's not really the goal of this kind of algebra. In school, we only tend to do algebra where all of the constants and variables are numbers; e.g. 2 * x = 4. Our goal was usually to find a particular value for x which is consistent with the equations, e.g. "solve for x" to get x = 2. Your solution of "set all letters to equal 1" is a perfectly valid way of achieving this kind of goal. However, for the kind of algebra this article is about, we don't restrict ourselves to working with numbers. Instead, we explicitly avoid talking about "concrete" representations at all. We only focus on the equations we've been given. Some sets of equations are so common that they're given names, like "group (laws)", "semigroup (laws)", "field (laws)", etc. The quote in the article tells us what the equations are: > Regard English as a left-cancellative and right-cancellative multiplicative semigroup with identity, i.e. obeying the relations XY=ZY or YZ=YX implies X=Z, and having an element “1” such that 1X=X1=X. Lots of things satisfy these equations. Some HN-relevant examples: - Positive integers, where "1" is the number one and multiplication (written as juxtaposition "xy") is integer multiplication. Notice that we can't allow zero, since 1 * 0 = 2 * 0 does not imply that 1 = 2. - Integers, where "1" is the number zero and multiplication is integer addition. - Booleans, where "1" is False and multiplication is OR. - Booleans, where "1" is True and multiplication is AND. - Sets, where "1" is the empty set and multiplication is set union. - Lists, where "1" is the empty list and multiplication is concatenation. - Functions, where "1" is the identity function (i.e. "identity = function(arg) { return arg; }") and multiplication is function composition (i.e. "compose(x, y) = function(arg) { return x(y(arg)); }") - Commands, where "1" is the no-op command (i.e. it performs no actions) and multiplication is sequencing (i.e. "xy = x; y") By focusing on the equations and ignoring any particular representation, our results will apply to all representations; making this "universal algebra" a very powerful method. What these mathematicians have done is impose a whole load of extra equations on top of the semigroup laws, of the form "AISLE = ISLE", etc. They've then shown that this large set of equations is equivalent to the single equation "x = 1". In other words, they've shown that your solution (AKA the "trivial" solution) is the only solution. In other words, by imposing these extra rules, we've gone from a relatively interesting system which can describe functions, commands, lists, etc. to a relatively boring one, where representations might include: - The set {one}, where multiplication is integer multiplication. - The set {zero}, where multiplication is integer addition. - The set {False}, where multiplication is OR. - The set {True}, where multiplication is AND. - The set {{}}, where multiplication is set union. - The set {[]}, where multiplication is concatenation. - The set {identity}, where multiplication is function composition. - The set {no-op}, where multiplication is sequencing.