Re: Simple enough for every reader?

On 2025-07-04 12:32:55 +0000, WM said:

On 04.07.2025 09:51, Mikko wrote:

On 2025-07-03 13:08:25 +0000, WM said:
 

On 03.07.2025 11:35, Mikko wrote:

On 2025-07-02 13:51:01 +0000, WM said:

 

The definition of bijection requires completeness.

 No, it doesn't.

 The function is injective, or one-to-one, if each element of the codomain is mapped to by at most one element of the domain,
The function is surjective, or onto, if each element of the codomain is mapped to by at least one element of the domain; Wikipedia
 Bijection = injection and surjection.
 Note that no element must be missing. That means completeness.

 It does not mean that the bijection is completely known.

 It means that every element of the domain and of the codomain is involved.

 Being involved is not the same as being known.

 I only said: The definition of bijection requires completeness.
 >
You: No, it doesn't.

I also said what is worng in your claim: bijection only requires that
there is one and only one element of co-domain for each element of
domain, regardless of completeness.
--
Mikko