And, even better, the dimension of the kernel of d just counts how many connected components the domain has.
There is a similar thing in graph theory, where the kernel of the incidence matrix counts how many connected components a graph has.
There is a similar thing in graph theory, where the kernel of the incidence matrix counts how many connected components a graph has.
No comments yet.