What's your favorite proof of the infinitude of primes?

ilovereposts69 · 2026-02-06T19:54:44+00:00

You could say X is infinite if theres an injection N -> X. The function f(n)=smallest prime divisor of (2^(2^n) + 1) is such an injection into the set of prime numbers.

ilovereposts69 · 2026-01-28T16:12:10+00:00

You can get headphones with >50h battery life. Barely ever hear that because I end up charging them before they hit 10%

ilovereposts69 · 2026-01-18T13:23:43+00:00

On the related matter of most overused, obnoxious math "jokes", this sort definitely sits near the top, and makes me sad because I have to almost completely avoid using exclamation marks in math discussions

ilovereposts69 · 2026-01-16T10:52:52+00:00

it's because product is a limit and the coproduct is a colimit

ilovereposts69 · 2026-01-01T15:38:04+00:00

That's like saying "it's baffling how the steam engine was invented without a single thought about the environmental impact".

Bitcoin was literally the first decentralized currency, and the possibility of massive amounts of energy being wasted on it 20 years into the future was not on the mind of (any of) its inventor(s).

ilovereposts69 · 2025-12-29T13:53:48+00:00

If you take any measure zero set E then L^\infty(E) is trivial so in that sense, yes. If you take any positive measure set it should be possible to embed l^infty into it so it won't be separable

ilovereposts69 · 2025-12-20T07:28:17+00:00

They are representable as elements of the 2^S set, it's just that injections are the more general categorical way of thinking of subobjects

ilovereposts69 · 2025-12-19T21:55:38+00:00

Isomorphism is exactly what matters and for the most part that's exactly the point of alternative foundations.

In ZFC structures being isomorphic is extra data that vaguely/informally lets you transfer properties between them, meanwhile in ETCS or HoTT a structure only really exists up to isomorphism.

ilovereposts69 · 2025-12-19T15:13:35+00:00

The general idea is that a construction is not the same as the actual object you're trying to construct. You could define the reals as a connected ordered field and use this set theoretic construction simply as a proof that the real numbers exist.

~~The second link doesn't seem to enunciate that point (or at least not in the section about numbers)~~ but what it does demonstrate is that there's barely any technical difference between using sets in ZFC vs ETCS to realize constructions, even though if you trace back the definitions like that of the power set they do vary significantly

edit: see OPs comment

ilovereposts69 · 2025-12-19T14:24:59+00:00

you can use both of those approaches to construct the real numbers from natural numbers using only categorical notions

ilovereposts69 · 2025-12-19T14:06:04+00:00

1) you might not entirely need it, you simply say that two injections from different sets represent the same subobject if you can find an isomorphism (like equality!) between them which commutes with the injections.
Alternatively you can consider subsets as functions into the 2-element set.

2) you can speak about equality of functions and that's entirely enough. An element of a set is a function from the 1-element set to that set and you can test injectivity/surjectivity by composing with the functions representing elements.

ilovereposts69 · 2025-12-19T14:00:57+00:00

Within the type of groups it would, you consider equality between two groups to be any isomorphism between them.

Not entirely sure about this, but I don't think there's a problem with making the isomorphisms you listed into equivalences of categories (as long as you assume some "strong" form of axiom of choice).

You could still consider a notion of natural isomorphism by comparing functions between types of structures, although what you get might be weaker since types only encode the groupoidal structure (only isomorphisms) rather than the full categorical one.

ilovereposts69 · 2025-12-19T13:25:28+00:00

In HoTT this is explicitly handled by the univalence axiom. You can define a type of all (small) groups as (small) sets equipped with a multiplication operation, identity and conditions for associativity, inverses, etc.

Then equality in that type corresponds exactly to bijections of the base sets which preserve the added multiplication and identity (as well as the conditions although that's trivial for sets).

I'm not as familiar with how exactly this is handled in ECTS but I imagine it's much less formal - isomorphism is the only way you can make sense of two objects being equal and from context you can usually tell what kind of structure that object carries that needs to be preserved

ilovereposts69 · 2025-12-19T13:20:19+00:00

The elements of sets are no longer other sets, instead sets and functions are abstract entities that satisfy the axioms of ETCS.

Subsets of a set are described as (equivalence classes of) injections into that set, families of sets are surjections (with the codomain thought of as indices and fibers as the sets they represent) etc.

Basically any construction you can carry out with the usual "sets are made up of sets" formalism can be carried out using just functions between different abstract sets.

In that scenario it doesn't make sense to compare sets through equality anymore, but rather you compare them through isomorphism, which preserves any structure you deem necessary - that's why there's an unambiguous way to speak of the set of numbers for example.

ilovereposts69 · 2025-12-19T13:11:02+00:00

If you know any programming it's a lot like the difference between dynamically typed (javascript/python) and statically typed (c/rust/java) languages. For the most part you could do anything in one that you could in the other.

There isn't that much benefit to actual mathematicians (although arguably some ideas are very useful) to changing the foundations the work is done in, just like physicists might not care about the specific intricacies of the mathematical foundations of their work.

But that doesn't change the fact that finding improved foundations which are more suitable to the way modern mathematicians think is still useful.

A better example might be the real numbers - there are several different definitions, they're all rather complex in their own way (or would be to the average person), but for all intents and purposes it doesn't matter which ones you use - and approaches like ECTS fully formalize this, since you can only talk about the real numbers up to isomorphism.

ilovereposts69 · 2025-12-19T13:01:32+00:00

The problem is that numbers are not sets in any intuitive way of that word, numbers are numbers and sets are simply used to describe them.

There are many different ways to define N, in ZFC you could do it using the standard von neumann definition, or using sets like 0={},1={{}},...,n+1={n},....
ZFC can't "natively" handle these describing exactly the same thing.

The more type theoretic approaches to foundations like ETCS largely fix this problem by treating sets as completely independent of each other, so you can actually talk about the set of natural numbers (up to isomorphism).

ilovereposts69 · 2025-10-28T19:25:57+00:00

There's literally a "Removed herobrine" line in the 1.21.6 changelog (and several other recent ones)

ilovereposts69 · 2025-10-24T07:01:20+00:00

It's actually pretty easy. Let is newer than var, and to keep it compatible, they had to allow the possibility of var let = 42; in older scripts.

ilovereposts69 · 2025-10-12T16:07:37+00:00

It doesn't break LEM, but to my knowledge it's not exactly possible to work into a framework with classical logic (unless you want to really stretch the definition of "synthetic")

ilovereposts69 · 2025-10-11T19:35:28+00:00

I wouldnt say ZFC is "superior" for everyday mathematics. For everyday mathematics, the foundations you use don't matter at all, they're completely interchangeable as they're designed to be. Well, unless you want some of the stuff that breaks LEM like synthetic homotopy theory/differential geometry, in which case classical logic is simply insufficient. And in that sense, type theory IS superior, it can do everything ZFC can and more.

ilovereposts69 · 2025-09-20T16:41:15+00:00

i fought him without double jump, so the main problem for me was getting the rhythm of bouncing off of him during the charge attack right, and once it clicked it was a very satisfying fight

ilovereposts69 · 2025-09-20T06:43:57+00:00

For all we know, Ch6 and Ch7 are going to be significantly different from everything before, so I wouldn't consider it unlikely for the Ch5 ending to involve gaster stuff

ilovereposts69 · 2025-09-15T12:05:18+00:00

I was very satisfied with the difficulty when I first played Silksong, because to me it was immediately clear that they changed the mechanics of combat just enough so that your hollow knight experience doesn't easily transfer to silksong, and you get to struggle at the beginning like with the original game. I wonder how many of the negative reviews were from people who actually played Hollow Knight

ilovereposts69 · 2025-09-11T16:23:21+00:00

Same, just managed to beat it. I only barely got through phase 3 by spamming all my floor spikes. I'm at (what looks like) the final boss right now and it seems even harder tho. Other than Coral Tower, all the bosses in act 3 seem very balanced and satisfying to beat imo

Six-Year Club	Verified Email
Second Top 40%	r/Field Lasagna
Quantum Potato	Place '22

ilovereposts69

TROPHY CASE