0
$\begingroup$

I'm working on an exercise in linear algebra involving the multilinearity of the determinant. The task is:

Let $š¾$ be a field. Consider the determinant as a function:

\begin{align} &\det : K^n \times \dots \times K^n \to K\,, \\ &\quad (s_1, \dots, s_n) \mapsto \det(s_1, \dots, s_n) ] \end{align}

Show that this map is multilinear, i.e., linear in each component. (As you can see in the added picture)

the exercise

This was an optional problem, but I decided to try it for practice.

I worked on it myself first. You can see my handwritten attempt here:

my attempt

Later, I checked other solutions and saw that most of them use the Leibniz formula for determinants. I tried a different path using the Smith normal form instead.

Question:

Is this an acceptable method for proving multilinearity? Or is it considered invalid for some reason? I’m aware that I didn’t show full linearity yet (e.g. f(aā‹…v)=aā‹…f(v)), but I’m mostly interested in whether my overall idea/approach makes sense.

Thanks a lot in advance — I’m still new to this, so I appreciate any feedback!

Also if there is anything unclear or not appropriate about my post, I’d really appreciate it if someone could leave a comment or brief explanation before voting to close or delete it. I’m happy to edit and improve the question — but I can only do that if I understand what’s wrong. Thanks a lot!

$\endgroup$
6
  • $\begingroup$ Hi, welcome to Math.SE. For posts looking for feedback or verification of a proposed solution. "Is this proof correct?" or "where is the mistake?" is too broad or missing context. Instead, the question must identify precisely which step in the proof is in doubt, and why so. This should not be the only tag for a question, and should not be used to circumvent site policies regarding duplication. $\endgroup$ Commented Apr 25 at 19:14
  • $\begingroup$ Hi, thanks a lot for the feedback! To clarify: I’m not asking for a full proof-check or correction service. I just want to know whether the overall idea I tried (using the Smith normal form instead of the Leibniz formula) is a valid and acceptable way to approach the problem of proving multilinearity. If anything is unclear, I’ll be happy to rephrase or improve the question — I’m still getting used to how this site works! $\endgroup$ Commented Apr 25 at 19:20
  • $\begingroup$ Guten Tag. I think that you can give more details, including but not limited to the manner in which the text that you read defines determinants. Your handwritten attempt seems to contain a proof of 2) for diagonal matrices. What about other square matrices? It is known that given an $n \times n$ matrix $A$ over a field $K$, there exist invertible matrices $S$, $T$ over $K$ such that $D = SAT$ is diagonal. However, how will you show that $\det {(D)}$ and $\det {(A)}$ are "related in some way"? $\endgroup$ Commented Apr 26 at 1:36
  • $\begingroup$ Thank you for your comment! You’re absolutely right—I revisited our lecture notes and realized that the Smith Normal Form (SNF) doesn’t apply universally to matrices over arbitrary fields. As you pointed out, our notes explicitly state: "In particular, every matrix in Z^mxn has a Smith Normal Form" My approach implicitly assumed SNF exists for all matrices, but it’s only guaranteed for principal ideal domains (like Z) - not general fields. Thanks for catching this! I will retry with the normal proof by Leibniz that is used for this. $\endgroup$ Commented Apr 26 at 10:31
  • $\begingroup$ Did you know that a field is automatically a Euclidean domain, which is a principal ideal domain? It is just the case that the SNF of a matrix over a field is better known as... well, I do not know its name. See en.wikipedia.org/wiki/Matrix_equivalence for more information. There is another thing: one can explicitly mention a user with "@". @Tƶrtchen $\endgroup$ Commented Apr 27 at 1:08

0

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.