Agrawal and Vinay [FOCS'08] showed that any polynomial size arithmetic circuit can be reduced to a subexponential sized circuit of depth 4. This reduction was further analyzed carefully by Koiran [TCS'12] and Tavenas [MFCS'13]. We will discuss the proof, and consequences of depth reduction to lower bounds.