irchans
Joined 12 years ago
Joined 12 years ago
counting zero integer decimal positional notation 100, 1000, … the four arithmetic operations + – * / fractions decimal notation 0.1, 0.01, … basic propositional logic (Modus ponens, contrapositive, If-then, and, or, nand, …) negative numbers equivalence classes equality & substitution basic algebra – idea of variables, equations, … the idea of probability commutative and associative properties distributive property powers (squared, cubed,…), – compound interest (miracle of) scientific notation 1.3e6 = 1,300,000 polynomials first order predicate logic infinity irrational numbers De Morgan’s laws statistical independence the notion of a function square root (cube root, …) inequalities (list of inequalities) power laws (i.e. abac=ab+c ) Cartesian coordinate plane basic set theory random variable probability distribution histogram the mean, expected value & strong law of large numbers the graph of a function standard deviation Pythagorean theorem vectors and vector spaces limits real numbers as limits of fractions, the least upper bound continuity Rn, Euclidean Space, and Hilbert spaces (inner or dot product) derivative correlation central limit theorem, Gaussian Distribution, Properties of Guassains. integrals chain rule modular arithmetic sine cosine tangent π, circumference, area, and volume formulas for circles, rectangles, parallelograms, triangles, spheres, cones,… linear regression Taylor’s theorem the number e and the exponential function Rolle’s theorem, Karush–Kuhn–Tucker conditions, derivative is zero at the maximum the notion of linearity Big O notation injective (one-to-one) / surjective (onto) functions imaginary numbers symmetry Euler’s Formula eiπ+1=0 Fourier transform, convolution in time domain is the product in the frequency domain (& vice versa), the FFT fundamental theorem of calculus logarithms matrices conic sections Boolean algebra Cauchy–Schwarz inequality binomial theorem – Pascal’s triangle the determinant ordinary differential equation (ODE) mode (maximum likelihood estimator) cosine law prime numbers linear independence Jacobian fundamental theorem of arithmetic duality – (polyhedron faces & points, geometry lines and points, Dual Linear Program, dual space, …) intermediate value theorem eigenvalues median entropy KL distance binomial distribution Bayes’ theorem 210≈1000 compactness, Heine – Borel theorem metric space, Triangle Inequality Projections, Best Approximation 1/(1−X)=1+X+X2+… partial differential equations quadratic formula Reisz representation theorem Fubini’s theorem the ideas of groups, semigroups, monoids, rings, … Singular Value Decomposition numeric integration – trapezoidal rule, Simpson’s rule, … mutual information Plancherel’s theorem matrix condition number integration by parts Euler’s method for numerical integration of ODEs (and improved Euler & Runge–Kutta) pigeon hole principle
mathematical used less often: Baire category theorem, Banach Spaces, Brouwer Fixed Point Theorem, Carathéodory’s Theorem, Category Theory, Cauchy integral formula, calculus of variations, closed graph theorem, Chinese remainder theorem, Clifford algebra (quaternions), Context Free Grammars, countable vs uncountable infinity, Cramer’s Rule, cohomology, Euclidean algorithm, fundamental group, Gauss’ Law, Grassmannian algebra , Graph Theory, Hahn-Banach Theorem, homology, Hairy Ball Theorem, Hölder’s inequality, inclusion-exclusion, Jordan Decomposition, Kalman Filters, Markov Chains (Hidden Markov Models), modules, non-associative algebras, Picard’s Great Theorem, Platonic/Euclidean solids, Principle of Induction, Probabilistic Graphical Models (Bayesian Networks, Markov Random Fields), Pontryagin duality, Quaternions, Spectral Theorem, Sylow p subgroup, repeating decimals equal a fraction, ring ideals, sine law, tensors, tessellation, transcendental numbers, Uniform Boundedness Theorem, Weierstrass approximation theorem. From http://artent.net/2012/11/27/100-most-useful-theorems-and-id...
https://www.youtube.com/watch?v=-ga41edXw3A
The Amiga was the second computer that I ever owned. The first was a C64 that I bought freshman year. (My father bought a TRS-80 before that.)
(* Mathematica Notation, Assume x>0 ) If[ x < 10^(-10), 1+ x/2, ( order x^2 error ) If[ x> 10^10, Sqrt[x], ( order 1/Sqrt[x] error ) (else) Sqrt[x +1] ] ] ( I guess the If statements take too much time. *)
I asked GPT to write code to address their question and the code was quite acceptable drawing the circle and finding the correct intersection point. It would have take me about 40 minutes to write the code, so I would not have done it myself.
Currently, GPT is great for writing short programs. The results often have a bug or two that is easy to fix, but it's much faster to have GPT write the code. This works fine for projects that are less than 100 lines of code where you just want something that works.
https://chatgpt.com/share/690f675d-c340-8013-b598-41fe487b4e...
It has the nice properties that you can do any number of sets (in theory) and all the boundary intersections are either osculating or perpendicular.
Simplifying all of math is another endeavor, but I imagine that you could have a bunch of LLMs trying to shorten existing Lean proofs.