Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Explores compositions of applications and injectivity conditions in linear algebra, including restriction of applications and combinatorial proof of injections.
