But this text does not come of as "elementary" at all to me.
Within the first few pages (and within "Chapter 0: Trivia" in section "0.1 Relations")
The language is tortured (sorry to say!)
<QUOTE>
For a function f : X → Y , the image of A ⊂ X is f (A) = {f (x) : x ∈ A}, and
the preimage of B ⊂ Y is f −1(B) = {x ∈ X : f (x) ∈ B}, defined whether or not f
has an inverse. The preimage of a single point is a fiber or level set. Every subset
A ⊂ X is a preimage, that of 1 under its indicator function 1A : X → {0, 1}, equal
to 1 on A and to 0 off it. The function f is injective if f (x) = f (x′) implies x = x′,
surjective if f (X) = Y , and bijective if both, which is to say invertible. Functions
f : X → Y and g : Y → Z compose to g ◦ f : X → Z, associatively, with the identity
IdX as a unit.
</QUOTE>
And it just gets worse from there.
It might be elementary to a PhD student in Maths, but def not to me (and I studied graduate level maths at MIT)
Rendered at 01:01:36 GMT+0000 (Coordinated Universal Time) with Vercel.
But this text does not come of as "elementary" at all to me.
Within the first few pages (and within "Chapter 0: Trivia" in section "0.1 Relations")
The language is tortured (sorry to say!)
<QUOTE>
For a function f : X → Y , the image of A ⊂ X is f (A) = {f (x) : x ∈ A}, and the preimage of B ⊂ Y is f −1(B) = {x ∈ X : f (x) ∈ B}, defined whether or not f has an inverse. The preimage of a single point is a fiber or level set. Every subset A ⊂ X is a preimage, that of 1 under its indicator function 1A : X → {0, 1}, equal to 1 on A and to 0 off it. The function f is injective if f (x) = f (x′) implies x = x′, surjective if f (X) = Y , and bijective if both, which is to say invertible. Functions f : X → Y and g : Y → Z compose to g ◦ f : X → Z, associatively, with the identity IdX as a unit.
</QUOTE>
And it just gets worse from there.
It might be elementary to a PhD student in Maths, but def not to me (and I studied graduate level maths at MIT)