Category theory is a language for formulating results in mathematics concisely, which often need input from the problem domain to be proven. Since it allows cer

Category theory is a language for formulating results in mathematics concisely, which often need input from the problem domain to be proven. Since it allows certain properties to be stated concisely it also makes it easy to see commonalities between structures in disparate areas of mathematics. To give you several concrete examples, which will probably be meaningless to you: If you were to ask what categories are like the category of sets and you were very smart you would arrive at the notion of Topos. The Eilenberg-Zilber theorem states, that two functors between chain complexes are adjunctions to each other. The initial result of Galois theory can also be formulated as an adjunction between two lattices. Just recently the so called "tilting lemma" established an equivalence of categories between certain categories of "perfectoid algebras" over different fields. In programming languages whenever you see something resembling a dataflow diagram, there is a monoidal category lurking in the background. The same is true for reaction diffusion networks and all the digital circuit diagrams ever drawn. Typed lambda calculus is the "internal language" of cartesian closed categories. Similarly linear logic (where resource tracking in Rust comes from) can be seen as the internal logic of some kind of bimonoidal category. There are countless other examples along those lines, the point is that in modern mathematics all the things you consider can be made into a category in one way or another, establishing functors between them gives you a way of studying one thing in terms of the other. Most of the time category theory itself helps very little in doing so. It is just a language for formulating results. Actual research in category theory is done by comparatively few people and is nowadays probably mostly in the area of "higher category theory".