Re: Simple enough for every reader?

Am Wed, 09 Jul 2025 18:32:21 +0200 schrieb WM:

On 08.07.2025 17:59, joes wrote:

Am Tue, 08 Jul 2025 17:47:12 +0200 schrieb WM:

On 08.07.2025 09:46, Mikko wrote:

On 2025-07-07 15:37:08 +0000, WM said:

On 07.07.2025 10:29, Mikko wrote:
>

Bijection requires completeness of domain and codomain.

So you say but cannot prove.

Wikipedia will be sufficient: a bijection is a relation between two
sets such that each element of either set is paired with exactly one
element of the other set.

So no requirement of completeness.

"Each element" means that none is missing.

None is *unpaired*.

Each element of either set is in the bijection.

So which element of a bijection isn't?

Nothing about "completeness" of (co)domain, whatever that may look
like.

Look up surjection, for instance in Wikipedia: ...

Your concept of "completeness" seems to differ from that.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.