Suppose that $F$ is a finite dimensional extension field of $K$ (both subfields of $\mathbb{C}$). Given $u \in F$, let $g_u : F \to F$ be defined by $v \mapsto uv$. If $B$ is any ($K$-basis) for $F$ and $M = [g_u]_B$, then I would like to show that $\mbox{trace}(M) = \mbox{Tr}_{F/K}(u)$ and moreover $\mbox{det}(M) = \mbox{N}_{F/K}(u)$. I've been trying to prove that this at least holds in the case that $F = K(u)$ (where we would have a basis of the form $\{u^0, u^1, \dots u^n\}$) but haven't succeeded.
I am using the Hungerford notion of trace and norm. In particular, let $\sigma_1, \dots, \sigma_t$ be all the distinct $K$-monomorphisms $F \to \mathbb{C}$. If $a \in F$, then $N_{F/K}(a) = \sigma_1(a)\sigma_2(a) \dots \sigma_r(a)$ and $\mbox{Tr}_{F/K}(u) = \sigma_1(a) + \dots + \sigma_r(a)$.
Here's an alternative argument: by primitive element theorem, we can assume that $F = K(a)$ for some $a \in F$. Let $n = [F : K]$ be the degree of the extension, so that $a$ is a root of an irreducible $f \in K[x]$ of degree $n$.
Then, since $a$ generates $F$ over $K$, different $K$-monomorphisms $\sigma_i: F \to \mathbb{C}$ correspond to different choices of $n$ different roots of $f \in K[x]$ in $\mathbb{C}$ -- each $\sigma_i$ maps $a$ to a different root of $f$ in $\mathbb{C}$.
As $f$ splits over $\mathbb{C}$, we can write $f(x) = (x-\sigma_1(a))\cdots(x-\sigma_n(a)) \in \mathbb{C}[x]$. Multiplying this out, we get that $\mbox{Tr}_{F/K}(a) = \sigma_1(a) + \ldots + \sigma_n(a)$ is equal to minus coefficient at $x^{n-1}$ of the minimal polynomial of $a$ over $K$.
Now, we will connect this to the matrix above. Let $h$ be characteristic polynomial of $g_a: F \to F$, that is, $h(x) = \det(g_a - x \cdot id) = x^n - b_{n-1} x^{n-1} + \ldots + (-1)^n b_0$. By easy observation, trace of $g_a$ is equal to $b_{n-1}$. We claim that in fact $f = h$, that is, the characteristic polynomial of $g_a$ is indeed the minimal polynomial of $a$ over $K$.
Indeed, this follows from Cayley-Hamilton theorem, which says that a linear operator satisfies its characteristic equation, that is, $h(g_a) = g_a^n - b_{n-1} g_a^{n-1} + ... + (-1)^n b_0 \cdot id$ is a zero operator. But that means that $h(g_a)(u) = 0$ for any $u \in F$, that is,
$$ (g_a^n - b_{n-1} g_a^{n-1} + ... + (-1)^n b_0 \cdot id)(u) = g_a^n(u) - b_{n-1} g_a^{n-1}(u) + ... + (-1)^n b_0 \cdot u = 0 $$
which in turns, since $g_a^n(u) = a^n \cdot u$, gives us:
$$ a^n\cdot u - b_{n-1} a^n \cdot u + ... + (-1)^n b_0 \cdot u = (a^n - b_{n-1} a^n + ... + (-1)^n b_0) \cdot u = 0 $$
which is only true for all $u \in F$ if $a^n - b_{n-1} a^n + ... + (-1)^n b_0 = 0$, but then it means that $h(a) = 0$. Since $g_a: F \to F$ is a $K$-linear map, and we take characteristic polynomial of it as such, $h \in K[x]$, and $\deg h = \dim_K F = [F : K] = n$, $h$ must be the minimal polynomial of $a$ over $K$, which concludes the proof.
Similar argument also works for the norm, which is left as an exercise for reader.