top of page

TEAM

Proof (Sketch) Assistant

clear.png

I've had the desire for a while now to code up a simple proof (sketch) assistant for a subclass of problems in analytic number theory pertaining to subconvexity bounds of L-functions. The point is to have something which would initially be human-in-the-loop and then something that can exhaust a finite decision tree of common local and global steps that one might take to determine the full "class" of L-functions that one could treat with a given method through an exhaustive search. The next step after, would be to then train a model on a collection of methods and steps and see if it could predict which steps should be taken for a given L-function.

Screen Shot 2022-06-03 at 11.31.35 AM.png
github URL
bottom of page