Kernel of the composition. ker(g∘f)={x:g(f(x))=0}=f−1(kerg).
Dimension bound. Let N=f−1(kerg) and let h:N→kerg be the restriction of f to N (it takes values in kerg by definition of N). Then kerh=kerf, because kerf⊆N. By rank-nullity applied to h,
dimN=dimkerf+dimImh≤dimkerf+dimkerg.
Thus dimker(g∘f)≤dimkerf+dimkerg.
Inequality. By rank-nullity for g∘f, f and g:
rank(g∘f)=dimE−dimker(g∘f)≥dimE−dimkerf−dimkerg,
and dimE−dimkerf=rank(f), −dimkerg=rank(g)−dimF. Hence
rank(g∘f)≥rank(f)+rank(g)−dimF.
Conclusion. This is Sylvester's rank inequality. For matrices A∈Mp,n, B∈Mn,q it reads rank(AB)≥rankA+rankB−n.