this post was submitted on 23 Feb 2025
765 points (99.1% liked)

Lemmy Shitpost

28539 readers
4738 users here now

Welcome to Lemmy Shitpost. Here you can shitpost to your hearts content.

Anything and everything goes. Memes, Jokes, Vents and Banter. Though we still have to comply with lemmy.world instance rules. So behave!


Rules:

1. Be Respectful


Refrain from using harmful language pertaining to a protected characteristic: e.g. race, gender, sexuality, disability or religion.

Refrain from being argumentative when responding or commenting to posts/replies. Personal attacks are not welcome here.

...


2. No Illegal Content


Content that violates the law. Any post/comment found to be in breach of common law will be removed and given to the authorities if required.

That means:

-No promoting violence/threats against any individuals

-No CSA content or Revenge Porn

-No sharing private/personal information (Doxxing)

...


3. No Spam


Posting the same post, no matter the intent is against the rules.

-If you have posted content, please refrain from re-posting said content within this community.

-Do not spam posts with intent to harass, annoy, bully, advertise, scam or harm this community.

-No posting Scams/Advertisements/Phishing Links/IP Grabbers

-No Bots, Bots will be banned from the community.

...


4. No Porn/ExplicitContent


-Do not post explicit content. Lemmy.World is not the instance for NSFW content.

-Do not post Gore or Shock Content.

...


5. No Enciting Harassment,Brigading, Doxxing or Witch Hunts


-Do not Brigade other Communities

-No calls to action against other communities/users within Lemmy or outside of Lemmy.

-No Witch Hunts against users/communities.

-No content that harasses members within or outside of the community.

...


6. NSFW should be behind NSFW tags.


-Content that is NSFW should be behind NSFW tags.

-Content that might be distressing should be kept behind NSFW tags.

...

If you see content that is a breach of the rules, please flag and report the comment and a moderator will take action where they can.


Also check out:

Partnered Communities:

1.Memes

2.Lemmy Review

3.Mildly Infuriating

4.Lemmy Be Wholesome

5.No Stupid Questions

6.You Should Know

7.Comedy Heaven

8.Credible Defense

9.Ten Forward

10.LinuxMemes (Linux themed memes)


Reach out to

All communities included on the sidebar are to be made in compliance with the instance rules. Striker

founded 2 years ago
MODERATORS
 
top 50 comments
sorted by: hot top controversial new old
[–] [email protected] 88 points 5 days ago (1 children)

To be fair, until you can see both sides of each horse, that technically doesn’t disprove it

[–] [email protected] 21 points 5 days ago* (last edited 5 days ago) (1 children)

Doesn’t “color” (no ‘s’) imply they can’t be more than one? Or.. is this theorem further supported? Both of these horses are all the same color.

[–] [email protected] 5 points 4 days ago

There are Value, Croma(or Saturation) and Hue, so maybe you're onto something here!

[–] [email protected] 18 points 4 days ago

This is what arguing with people about politics feels like.

[–] [email protected] 63 points 5 days ago (9 children)
[–] [email protected] 23 points 5 days ago (3 children)

I did do this proof by induction back in the day, but now looking at the article I am clueless.

[–] [email protected] 8 points 5 days ago* (last edited 5 days ago) (2 children)

Do you mean you went through the proof and verified it, or falsified it?

As I understand it, it goes something like this:

...

You have a set of n horses.

Assume a set of n horses are the same color.

Now you also have a set of n+1 horses.

Set 1: (1, 2, 3, ... n)

Set 2: (2, 3, 4, ... n+1)

Referring back to the assumption, both sets have n horses in them, Set 2 is just incremented forward one, therefore, Set 2's horses are all one color, and Set 1's horses are all one color.

Finally, Set 1 and Set 2 always overlap, therefore that the color of all Set 1 and Set 2's horses are the same.

...

So, if you hold the 'all horses in a set of size n horses are the same color' assumption as an actually valid assertion, for the sake of argument...

This does logically hold for Set 1 and Set 2 ... but only in isolation, not compared to each other.

The problem is that the sets do not actually always overlap.

If n = 1, and n + 1 = 2, then:

Set 1 = ( 1 )

Set 2 = ( 2 )

No overlap.

Thus the attempted induction falls apart.

Set 1's horse 1 could be brown, Set 2's horse 2 could be ... fucking purple... each set contains only one distinct color, that part is true, but the final assertion that both sets always overlap is false, so when you increment to:

Set 1 = ( 1, 2 )

Set 2 = ( 2, 3 )

We now do not have necessarily have the same colored horse 2 in each set, Set 1's horse 1 and 2 would be brown, Set 2's horse 2 and 3 would be purple.

...

I may be getting this wrong in some way, it's been almost 20 years since I last did set theory / mathematical proof type coursework.

[–] [email protected] 4 points 4 days ago

Yeah, so the following actually is valid: If all pairs of horses are the same color, all horses are the same color. Just starting the induction one step further.

[–] [email protected] 4 points 5 days ago

Yep this is the exact issue. This problem comes up frequently in a first discrete math or formal mathematics course in universities, as an example of how subtle mistakes can arise in induction.

[–] [email protected] 3 points 5 days ago* (last edited 5 days ago) (1 children)

I took a peek and it is sort of dumb but logically "sound". Specifically the indictive step.

In the inductive step you assume the statement is true for some number n and use this statement to prove the statement n + 1 is true. If you can do that then you can prove the induction step.

So in this example the statement we assume is true is given n horses, all of them are the same color. To prove the statement for n + 1 horses we look at the n + 1 horses. Then we exclude the last horse. By excluding the last horse we have a set of n horses. By the induction statement this set of horses must all be the same color. So now we've proven the first n horses are the same color.

Next we can exclude the first horse. This also gives us a set of n horses. By the induction statement all these horses must also be the same color. Therefore all n + 1 horses must be the same color.

This sounds really dumb but the proof works in the induction step.

The logical issue is that the base case is wrong which is necessary for a complete proof by induction.

load more comments (1 replies)
[–] [email protected] 12 points 5 days ago (1 children)
[–] [email protected] 3 points 4 days ago

A much more interesting question, if you ask me.

[–] [email protected] 5 points 5 days ago

It was stated as a lemma, which in particular allowed the author to "prove" that Alexander the Great did not exist, and he had an infinite number of limbs.[4]

Talk about burying the lede! 😄

load more comments (6 replies)
[–] [email protected] 22 points 5 days ago (1 children)

Actually this just refers to the color of their fur. I'd say that a blonde white man and a white read head are the same color, just their hair has a different color.

(I'm not totally serious and will not die on this hill)

[–] [email protected] 15 points 5 days ago (1 children)

Oh, I'm gonna make sure you die on that hill!

First, by building you a lovely house on that hill and a nearby Denny's...

[–] [email protected] 13 points 5 days ago

Sounds nice, go on!

(I'm gullible and will fall into any trap I come across)

[–] [email protected] 16 points 5 days ago (1 children)

In some cultures this might be the same color.

[–] [email protected] 5 points 4 days ago

They are both horse colored, obviously.

[–] [email protected] 7 points 4 days ago (1 children)

That theory assumes that color is real. Color is just some photons smacking into your retina and then the brain deciding what that even means.

[–] [email protected] 2 points 4 days ago (1 children)

Well, sorta. Different materials bounce different wavelengths of light that our eyes catch and send to the brain to piece together and interpret color from. There is a degree of responsibility for what we see on the object the light bounces off of in the form of what wavelengths they absorb or reflect.

[–] [email protected] 2 points 4 days ago (1 children)

Aha, but that assumes light is real and materials are real and the universe is real!

[–] [email protected] 2 points 4 days ago (1 children)

Yeah, colors are just whatever the simulation decided it should be

[–] [email protected] 1 points 2 days ago

That assumes the simulation is real

[–] [email protected] 21 points 5 days ago (3 children)

I'm not even convinced that horses are real.

[–] [email protected] 15 points 5 days ago (1 children)

They’re what the government uses to spy on the Amish.

[–] [email protected] 11 points 5 days ago (1 children)

Why can't they just use birds like for everyone else?

[–] [email protected] 4 points 5 days ago* (last edited 5 days ago) (1 children)

I'm not convinced that anything outside my own thoughts are real. In fact are my thoughts real?

[–] [email protected] 3 points 4 days ago

You're not real. I am not real. Nothing is real.

[–] [email protected] 3 points 5 days ago

True. They look too similar to giraffes

[–] [email protected] 20 points 5 days ago (1 children)

Why is there a picture of an empty field?

[–] [email protected] 9 points 5 days ago

I assume John Cena is standing there and we just can't see him

[–] [email protected] 9 points 4 days ago (1 children)
[–] [email protected] 11 points 4 days ago

Horse blindness is a made up illness designed to gaslight us into believing that horses exist.

[–] [email protected] 6 points 4 days ago* (last edited 4 days ago)

On the inside?

[–] [email protected] 10 points 5 days ago

Their hair is the same color. What color is the skin?

[–] [email protected] 6 points 5 days ago (1 children)

But the reasoning given doesnt apply exclusively to horses. Suppose we follow the same chain that gets us "all horses are the same color", but replace "horses" with "colors", we would end up with the statement that all colors are the same color. Thus, this is not a counterexample, because black and brown are the same color.

load more comments (1 replies)
[–] [email protected] 4 points 5 days ago (2 children)

...what?

Horse hair colors vary.

If you shave a horse, any breeds with dark black or blue-ish grey hair will give you a variety of that pallet, getting dark enough to be stopped and frisked in larger American cities. Sometime blueish-black skin and hair pigmentation matches as well.

Most other breeds will give you a pink color range.

https://artpictures.club/autumn-2023.html

https://www.magonlinelibrary.com/cms/10.12968/ukve.2021.5.1.24/asset/images/medium/ukve.2021.5.1.24_f03.jpg

Source: was given a saddle for Christmas once.

[–] [email protected] 13 points 5 days ago

It's not actually claiming that all horses are the same color, it's an example of a flawed induction argument

[–] [email protected] 9 points 5 days ago

If you read the Wikipedia article (or other articles) about "all horses are the same color", it is really just about an inductive fallacy that can occur.

[–] [email protected] 3 points 5 days ago

Mammals only make brown, but we do a lot with it.

[–] [email protected] 2 points 5 days ago

This is great. I love stuff like this.

[–] [email protected] 2 points 5 days ago

Maybe author of the sentence was looking at horses in space and wikipedia is completly wrong.

load more comments
view more: next ›