Current location - Training Enrollment Network - Mathematics courses - Detailed demonstration process of solving the problem of super-high reward in discrete mathematical function exercises
Detailed demonstration process of solving the problem of super-high reward in discrete mathematical function exercises
(1) take y∈A,

There must be x∈A, which makes

Set by topic

Therefore, the existence of z∈A makes

Because f(x) is unique, y = z.

thus

take

There is < x, x > ∈ f, because f(x) is unique, so x=y is obtained.

This proves that F? Iowa

So f=IA