Post #2103465
2026-05-06 14:59 UTC
Replies (6)
-
@lisyarus@mastodon.gamedev.place 2026-05-06 15:11
@julesh@mathstodon.xyz The powerset is a complete lattice wrt subset relation, and the largest element is the original set that the powerset was computed from. I'm not sure about the details but it sounds like that should be enough?
-
@ToucanIan@mathstodon.xyz 2026-05-06 15:19
@julesh@mathstodon.xyz P should be injective on sets by uniqueness of top elements in a sup lattice.
-
@oantolin@mathstodon.xyz 2026-05-06 15:23
@julesh@mathstodon.xyz By the Yoneda lemma, if F is represented by some set A, then Nat(F, id) = id(A) = A. That's probably the easiest way to recover the representing object.
-
@mudri@mathstodon.xyz 2026-05-06 15:47
@julesh@mathstodon.xyz ⋃𝒫X = X.
-
@eigil@mathstodon.xyz 2026-05-06 21:02
@julesh@mathstodon.xyz X can be recovered from PX as the set of elements with exactly one other element below them (in the inclusion order, which can be recovered from the order on 2 and observing that Hom(X,-) preserves limits, so carries posets to posets).
-
@julian_kuelshammer@mathstodon.xyz 2026-05-07 17:03
@julesh@mathstodon.xyz To answer one of your questions, namely whether the power set function is injective (in the sense of cardinality): This depends on your axioms for set theory. Under the generalised continuum hypothesis it holds, without it, there are counterexamples, see https://mathoverflow.net/q/67473/15887