Latest Posts

• Quick Analysis Trick 5

  The quarter is over, and now that I’m vaccinated (twice!) I feel comfortable seeing people again. So I flew east coast to see my family and a bunch of friends. Before I left, I had a few ideas for blog posts, and figured I would get around to writing one now.

• Checking Concavity with Sage

  I haven’t been on MSE lately, because I’ve been fairly burned out from a few weeks of more work than I’d have liked. I’m actually still catching up, with a commutative algebra assignment that should have been done last week. I was (very kindly) given an extension, and I’ll be finishing it soon, though.

• Talk - Problem Solving Without Ansibles -- An Introduction to Communication Complexity

  Wow, two talk posts in one day! Thankfully the actual talks were a week apart!

• Talk - Categories, Modalities, and Type Theories: Oh My

  Last week I gave a talk at CMU’s Graduate Student Workshop on Homotopy Type Theory (HoTT). You can see the schedule of talks here.

• Cohomology Intuitively

  So I was on mse the other day…

• Linearly Ordered Groups and CH

  Earlier today Jonathan Alcaraz gave a GSS talk about Linearly Ordered (LO) Groups, which are a fun topic with connections to dynamics, topology, geometric group theory, etc. This reminded me of a problem I told myself to think about a while ago, and so I decided to finally do that. After a bit of thought, a friend from CMU (Pedro Marun) and I were able to figure it out. This post is going to be somewhat more meandering than usual (if you can imagine such a thing), because I want to showcase what the flow of thoughts was in solving the problem. At the end I’ll clean things up and write them linearly.

• Sage Sums

  Today I learned that sage can automatically simplify lots of sums for us by interfacing with maxima. I also learned recently that the init.sage file exists, which let me fix some minor gripes with my sage. Notably, I was able to add commands aa and nn which automatically get ascii art or a numeric answer for the most recent expression! This is going to be a short post just to highlight how these things work, since I had to figure them out for myself.

• Measure Theory and Differentiation (Part 1)

  So I had an analysis exam yesterday last week a while ago (this post took a bit of time to finish writing). It roughly covered the material in chapter 3 of Folland’s “Real Analysis: Modern Techniques and Their Applications”. I’m decently comfortable with the material, but a lot of it has always felt kind of unmotivated. For example, why is the Lebesgue Differentiation Theorem called that? It doesn’t look like a derivative… At least not at first glance.

• Talk - Why Think -- Letting Computers do Math for Us

  Yesterday I gave my second talk at the Graduate Student Seminar at UCR. I decided to talk about something near and dear to me, a topic which first got me interested in logic: decidability. The idea of decidability is to look for theories which are simple enough to admit a computer program (called a decider) which can tell you whether or not a given sentence is true.

• Talk - Syntax and Semantics (Trans Math Day 2020)

  I’ve been busy with some assignments and grading, so it took me a while to post this. We got there eventually, though! I gave a talk at an online conference for Trans Math Day on December 5th. There were a lot of interested speakers, so the organizers gave us 5 minute, 10 minute, and 20 minute spots. I was given a 5 minute talk, which is a borderline impossible assignment – Obviously I was still exited to give it, there were just a slew of challenges to work out.

• Automorphisms Don't Extend

  I was on mse last night (later than I should have been…) when I saw a really interesting question. In the interest of keeping the blog post self contained, I’ll transcribe the question here (with some notational edits):

• Talk - Programming and Category Theory

  Yesterday I gave a talk at the UCR Category Theory Seminar. I ended up putting off making the slides for longer than I should have, because I wasn’t entirely sure what I wanted the talk to be. The connections between Cartesian Closed Categories/Proof Theory and Constructive Logic/Programming Languages run extremely deep, and ths kind of talk can kind of be arbitrarily abstract. I wanted to make sure this talk was easily approachable, though, and it was tricky to find that balance.

• Quick Analysis Trick 4

  To the surprise of no one, I was on math stackexchange earlier and saw an interesting analysis question. I have a weird fascination with tricky limit questions because I feel like I’ve always been bad at them. I like working on them for the same reason I like practicing the difficult parts of pieces of music – it makes me feel like I’m improving (in a “no pain no gain” kind of way).

• Quick Analysis Trick 3

  I’m in a measure theory class right now, and I think it’s important to be properly comfortable with measure theory in a way that I’m currently not. It has deep connections with things that I find very interesting (Descriptive Set Theory, Ergodic Theory, their intersection in Amenable Groups, etc.) and it’s one of my go to examples of an “obviously useful” branch of math. If you can apply your interests to measure theory somehow, I think that’s a compelling argument to fend off questions of “why is this worthwhile” (at least from other mathematicians).

• Nilpotentizing Groups

  I really like group theory, and I’ve spent a lot of time reading about groups and their properties. Most of these properties seem like very natural things to consider ($p$-groups, abelian groups, simple groups, etc.) and the ones that don’t typically seem motivated by some external factor (solvable groups come to mind). However, I have always been somewhat confused by nilpotent groups. I know that they are “almost abelian”, and I can rattle off some facts about them and sketches of proofs… But it was never made clear to me how to work with them in practice. If I come across a nilpotent group in the wild, how does that help me? Surely I should be able to leverage the “almost abelian”-ness in a way that’s more general than “elements of coprime order commute”.

• Algebraic Misconceptions 1

  I spend a lot of time on math stackexchange (mse), and I periodically see “simple” questions that totally shatter a misconception that I didn’t know I even held.

• Talk - Model Theory and You

  Today I gave my first talk at my new department. I was pretty nervous going into it for a few reasons. Obviously giving your first talk at a new institution is going to be stressful. This was going to be my introduction to a lot of the older grad students, and I really wanted to make a good first impression. This was also my first zoom talk, and my first proper talk using pre-made slides. I typically take a more improvisatory approach to my talks, and I plan out 4-5 different (similar) talks, and change what I’m presenting based on audience interest and time constraints. Since I almost always give blackboard talks, it’s easy to introduce or omit an example on the fly without my audience catching on. This is not unlike many magic tricks I perform where the ending depends on the spectator’s choices. Since the audience hasn’t seen the trick before (or the talk, in this case) you can totally change the ending without anyone knowing. Of course, this goes out the window when you’re writing slides in advance. If you skip an example, your audience sees you skip past a few slides. I’m glad I’m getting experience with this more structured setup, but it’s still out of my comfort zone. It forces you to, basically, set the talk in stone, and I’m worried that what I set will not live up to my expectations. Thankfully, in this instance, the talk was extremely well received. I’m trying to convince my department to care more about logic, and it seems this was a good first impression for both me and the subject I’m evangelizing. If anyone is interested in seeing the slides, I’ve attached them to this post.

• Submodels vs Elementary Submodels

  I’m giving a GSS talk next week in the hopes of introducing myself to my new department. More importantly, I am giving this talk to try and showcase the utility of model theory in combinatorics and algebra. While writing this talk, I’ve been thinking about the best way to discuss elementary submodels as opposed to regular old submodels. When it was taught to me, a focus was placed on “quantifying over extra stuff”, which is true, but I was never shown a simple example. While I was thinking about how to teach it, I realized we can already find elementary and nonelementary submodels in graph theory, and that these might serve as good examples for people new to the area.

• Quick Analysis Trick 2

  While watching this lecture (in case the link breaks one day: Steffano Luzzatto teaching Dynamical Systems at ICTP, lecture 11), I saw my first clever use of fixed-point theorems in analysis. In particular, we used a leveled-up version of the contraction mapping theorem to show that a certain map was actually a homeomorphism. The main takeaway is that by rearranging what you want to be true into a statement that some object is a fixed point, we can show that our dreams can be realized. This mode of argument is extremely common in algebra and logic, so it’s like a friendly face in the often stressful world of analysis.

• Quick Analysis Trick 1

  This is the start of a series of short posts which will come sporadically. To say that I struggle with analysis would be akin to saying that Stravinsky’s “Rite of Spring” wasn’t well received during its premiere. While technically true, the reality is much more dramatic than you might expect. I’m obviously being a bit hyperbolic here, but it really is something that I find quite difficult (this is probably due in part to lack of exposure).

• Right Angled Artin Groups

  I’m starting my PhD at UC Riverside this fall, and I’ve enrolled in a program that introduces me to some faculty and gets me familiar with the campus… Or, it would were it not for covid. Regardless, I’ve been meeting with a summer advisor (Matt Durham) over zoom every week for a while now to talk about hyperbolic surfaces and mapping class groups. I’m not sure I’m ready to make a blog post about that material, but last week we talked about Right Angled Artin Groups (RAAGs), which arise as subgroups of mapping class groups in a very natural way (cf. this article by Thomas Koberda). Raags, as we’ll soon see, are controlled by their combinatorial structure, which gives us a good way of creating counterexamples by converting algebraic conditions into combinatorial ones.

• Visualizing Hyperbolic Isometries

  Welcome to the inaugural post of this blog! As a quick preface, I plan to post about math, particularly math that I’m struggling with, and hopefully we can work through some stuff together ^_^.