The last paragraph is wrong. Consider the case $m=1$. $\tilde{M}$ is the intersection of $K$ with one hyperplane. In general this will not contain any extreme point of $K$, so its extreme points will not be convex combinations of $m=1$ extreme points of $K$.
Or did you mean $n$ insteadWhat is true is that every extreme point of $m$? Krein-Milman theorem says any compact convex subset of a locally convex tvs$M$ is an extreme point of the closedintersection of $K$ with one hyperplane, and this is a convex hullcombination of itstwo extreme points; in this casepoints of $K$ has at most. Namely, suppose $n$ extreme points so the$p = \sum_{i=1}^r t_i p_i$, $t_i \in (0,1)$, $\sum_i t_i = 1$, is a convex hullcombination of these is closed. Thus every point$r > 2$ extreme points of $K$. Say $T(p) = c$. If any $T(p_j) = c$, then $p$ is a convex combination of $p_j$ and $(p - t_j p_j)/(1-t_j)$ which are both in particular every$M$, so not an extreme point. Otherwise some $T(p_i) > c$ and some $< c$. Relabelling, suppose $T(p_1) > c$ and $T(p_2) < c$. Then $$q = \frac{T(p_1) - c}{T(p_1)-T(p_2)} p_2 + \frac{c - T(p_2)}{T(p_1)- T(p_2)} p_1$$ is a nontrivial convex combination of $p_1$ and $p_2$ which is in $M$, and $p$ is a convex combination of the extreme pointsthis and some other member of $K$$M$, thus not an extreme point.