Using the summation convention and the Kronecker delta ($\delta$), one can show that $$a_i\delta_{ij} = a_j.$$
If one expands the expression, one is looking at $$ a_i\delta_{ij} = a_1\delta_{1j} + a_2\delta_{2j} + \cdots + a_n\delta_{nj}. $$
In the above $i$ is usually called a 'dummy' variable and 'j' a free variable. The slightly confusing thing that happens is that the free variable seems to 'jump' from the $\delta$ to the $a$ although it does not originally figure as a subscript of it. One does not (at least as a beginner) see this coming.
To 'prove' this, one could observe the pattern
\begin{align} j=1 \implies& a_i\delta_{i1} = a_1 \implies a_i\delta_{ij} = a_j & \text{(since j=1)} \\ j=2 \implies& a_i\delta_{i2} = a_2 \implies a_i\delta_{ij} = a_j & \text{(since j=2)} \\ & \cdots \\ j=n \implies& a_i\delta_{in} = a_n \implies a_i\delta_{ij} = a_j & \text{(since j=n)} \end{align} So one can conclude that this holds for arbitrary $j$. But what is this kind of proof? It is not a proof by induction (or is it?), at the same time, one has the $\cdots$ middle part which seems like hand waving. One could talk about 'arbitrary j', but what comes close to such a proof formally?
If one were a purist, and introduced this notation in an overly rigorous book on set theory, what would the proof look like Hilbert style? Alternatively, what would the proof look like in a proof assistant like CoQ? What 'theorems', 'definitions', would be it using?
Maybe this is not a proof but a 'verification'? If it was, how would an overly rigorous go about proving this as an identity?
If this is a proof, how does its proof tree look like?
– jadn Aug 20 '17 at 15:17