Zulip Chat Archive

Stream: new members

Topic: simplifying a chain of inequalities - LGG?


rzeta0 (Jul 06 2024 at 23:19):

Consider the following inequalities

abb=cc>d\begin{align} a \geq b \\ b = c \\ c > d \end{align}

We can't simplify this chain of inequalities down to ada \geq d. The correct simplification is a>da > d.

Question: Is the logical process of simplifying a chain of inequality called taking the least general generalisation?

That phrase LGG is from symbolic AI (inductive logic programming). Is there a different phrase used in pure mathematics?

Ted Hwa (Jul 06 2024 at 23:21):

I don't think there's a name for it in pure mathematics. Also, ada \ge d would not be wrong, just not the best result possible.

rzeta0 (Jul 06 2024 at 23:40):

Hi Ted - I've edited to fix the mathematical error. Hopefully now we can say ada \geq d is wrong, and a>da > d is correct.

Although both versions of question pose a challenge to what I think LGG is !

Ted Hwa (Jul 07 2024 at 03:15):

Still the same. If a>da > d is correct, then ada \ge d must also be correct, since a>da > d implies ada \ge d.

rzeta0 (Jul 07 2024 at 10:06):

H Ted - I think I'll delete this thread, my brain is making terrible errors!


Last updated: May 02 2025 at 03:31 UTC