r/mathematics • u/MEDBEDb • 14h ago
Alpöge Should Publish His Entire Process and Prompt History Flowchart.
Isn’t this much more interesting than the lean result and furthermore in the interest of advancing scientific technique?
r/mathematics • u/MEDBEDb • 14h ago
Isn’t this much more interesting than the lean result and furthermore in the interest of advancing scientific technique?
r/mathematics • u/Sea_Ingenuity_5022 • 9h ago
I always thought Riemann was the biggest pure math problems but now that its solved what is it now. The only other big substancial problem I know of is P=NP but that's theoretical computer science rather than pure math
r/mathematics • u/Cojj25 • 18h ago
I haven’t seen any videos / postings. Curious to hear his thoughts.
r/mathematics • u/drugkeeper • 22h ago
Given the recent advancements, is there any unsolved problem that is still intractable for the foreseeable future? For instance, something so completely out of reach and unsolvable with our current understanding and our limited tools available.
For instance, existence of odd perfect numbers which is unsolved for a very very long time. What about Collatz conjecture or twin prime conjecture?
I'm curious on what would be the hardest unsolved problem out there now, obviously we are all speculating here, but I wish to hear your thoughts!
r/mathematics • u/Old-School8916 • 19h ago
Riemann Theorem? Riemann-Alpöge Theorem?
r/mathematics • u/Old-School8916 • 8h ago
r/mathematics • u/Queasy_Height2353 • 21h ago
I am not a mathematician, just a math enthusiast. I don't understand why a problem about the distribution of prime numbers is the most important problem in mathematics. For a layperson, it can sound a bit trivial.
Edit: Some people misinterpreted me. I am not claiming that RH is not important. I don't assume because I can't see its importance, that it is not important. I am saying that I don't understand its importance and came here to understand.
I tried to avoid coming over as intellectually arrogant and stubborn by using subjective language and saying that I am just a layperson ("for a layperson, it can sound trivial"), but clearly not everybody in the chat interpreted this in the way I meant.
If mathematicians regard this as one of the biggest problems (maybe solved problem by now) in math, I'll take their word for it. But I still don't understand why.
r/mathematics • u/Gold_Ad4004 • 20h ago
I found this thing on GitHub, saying what I believe that the human made solution is wrong, can anyone explain to me or verify if this is true? https://github.com/prenjith/prime-trace-note
r/mathematics • u/ECrispy • 11h ago
In light of the GRH news, there are still many maths problems that are far more difficult, and which we really have no clue how to even approach - like the normality of well known irrational constants, whether e+pi is irrational etc.
It is widely believed (and yes, this was said about RH too) that new mathematic techniques and major new insights will be needed for these.
But out of all these, is Collatz the 'simplest'? Its almost impossible to explain a lot of other problems to the vast majority of non mathematicians.
you can explain Collatz to a child in about 2min and they can happily start experimenting. This might be true of most problems in pure number theory, eg twin primes/goldbach, but prime numbers quickly get overwhelming. Nothing seems as approachable yet completely unfathomable like Collatz!
r/math • u/bladex1234 • 19h ago
Looking over the recent discussion around the claimed Anthropic proof of the generalized Riemann hypothesis for Dirichlet L-functions, I was wondering about other conjectures that rely on the Riemann hypothesis being true. Considering that Hodge and BSD both concern cohomologies of algebraic varieties, and algebraic motives give a unified framework for the cohomologies of algebraic varieties, does the Riemann hypothesis for motivic L-functions provide the framework for answering these other Millenium Prize problems? This is not my area of expertise so I only have a partial understanding of the proof and how these other conjectures are formulated so I thought I’d ask the community here.
r/mathematics • u/princeanand009 • 19h ago
r/math • u/vintergroena • 22h ago
In recent months, there have been an influx of proofs that seem to be technically correct, but are lengthy and difficult to comprehend due to you-know-what techniques.
The formal verification systems mostly utilize some notion of proof-irrelevance. A proposition is either proven or it's not and that's it, there's nothing more to look at.
But this is contrary to intuition and taste of mathematicians, who mostly have clear preference and even a somewhat of a consensus for what makes a proof elegant, valuable, or insightful besides it being just a mechanistically correct argument.
But to my knowledge, these notions themselves haven't been made formal, although it seems like they could be: A simple approach could be to measure the size of a derivation graph in a formal logic system that goes from the axioms to the theorem and try to minimize its size. This is not a very polished definition, perhaps a much better one could be proposed, but take it as some sort of baseline, or just one optimization criterion among many.
Then we could ask for not only "a proof" but for "the proof" and have a way to motivate alternative proof techniques to established theorems as truly novel contributions within a rigorous framework (in the sense that showing a proof is better according to a criterion than another proof or showing that it's the best one would be theorems on its own)
Maybe this hasn't really been practically possible until recently and that's why it hasn't been done, but I think some of these limitations are disappearing.
What are your thoughts?
r/mathematics • u/Equivalent-Lab-8852 • 8h ago
r/mathematics • u/DemMemez1999 • 21h ago
Since Riemann hypothesis and Navier Stokes have fallen within few short months, let’s have fun and try to guess when the next problem falls and which one it will be.
r/math • u/East_Finance2203 • 23h ago
Hi
I have quite a specific question about generalising (Siegel) modular forms to adellic automorphic forms that I‘ve been wondering about for a while.
Say we have G=Sp_2r the symplectic group of genus r, and take it’s points in the Adeles G(A), then let K be the maximal compact subgroup of G(A). For an automorphic form f:G(A)->C, by definition and some properties of profinite groups, if we look at the non Archimedean places, we are guaranteed an open compact subgroup of K(A_f) that leaves f invariant by right translation. This in some sense generalises the level of a modular form on H^r.
My question is about the weight. When we look at the Archimedean place, G(R), noting that K(R) acts by right translation on automorphic forms, by Peter Weyl theorem we can decompose the right regular representation into isotypic components. In the case r=1, G=SL_2 and K(R)=So(2) is abelian, meaning the isotypic components are dim 1 characters. If an automorphic form lives in one of these isotypic components, and the character has positive integer exponent (i.e rho(k(theta)= e^iktheta), we can recover a classical modular form of weight k and level determined by the open compact subgroup mentioned above.
I was wondering what happens when we don‘t have a positive integer exponent in the character, or if an Automorphic form lives in a sum of these isotypic components, what type of modular form on the hyperbolic plane can we recover? I assume in some of these cases we get non holomorphic modular forms, but don‘t know what happens otherwise.
r/mathematics • u/Pt4FN455 • 22h ago
Found a new approximation to sin(x), it covers 0 to pi, made using a Padé approximant, satisfying x=0, x=pi/2 and x=pi, while also satisfying the slope at x=0 and the slope at x=pi.
r/mathematics • u/bennetthaselton • 16h ago
Googling “shape covered with triangles and pentagons” only finds the icosidodecahedron.
r/mathematics • u/Recent-Day3062 • 4h ago
For reference I am an engineer who has far more math than most of my colleagues, but I am certainly not a math major.
When I open a paper here, I simply get lost in the first two paragraphs in both notation and prior knowledge
But they almost always start with notation and what I call an assumption of prior math. To make up a silly concrete example, like “consider a function (.) such that it is a solution to a second order Bessel function root under the condition of Helmholtz equivalence <r, z> such that lambda^(~{iar omeag_subq)} module pi/2 is everywhere representable in a quasi-Hilbert space, which we shall notate as q’m(r\omega_n). Correspondingly ther is of course a tea gent bundle…
Obviously this is farcical. But you get my drift.
1) at what point in your education do you follow this from the start ?
2) does it always assume a deep knowledge of some field, and makes little sense if you haven’t studied that field?
I assume Tao can read many, but what is the norm? Are fields of math so deep and narrow that most mathematicians even have trouble undeerstanding the first page because it presumes a PhD in that niche?
r/mathematics • u/BTonn • 1h ago
Hello everyone,
I would like to share a mathematical result on support-overlap graphs of linear kernels and request an independent review of its Lean 4 formalization.
The result concerns the homogeneous kernel K_G over GF(3) arising from the positive exact-one encoding of graph three-colouring.
For every finite nonempty simple graph G, let H_B denote the coefficient-overlap graph associated with an arbitrary basis B of K_G.
The main theorem establishes the exact identity
2\operatorname{tw}(G)+1.
]
The essential part is the universal lower bound: no change of basis can reduce the overlap treewidth below this value. An explicit canonical basis attains equality.
The Lean development includes the upper bound (wstar_le_two_tw_add_one), the lower bound (tw_le_of_coeff_tw), and the resulting equivalence (wstar_eq_iff).
The repository reports successful compilation under Lean 4.35.0 / Mathlib v4.35.0, without sorry or user-declared axioms. The reported axioms are propext, Classical.choice, and Quot.sound.
A stronger mathematical theorem extends the subgraph embedding to arbitrary fields and finite spanning families. That extension has a written proof but is not yet fully formalized in Lean.
I would particularly appreciate independent verification of:
Lean sources and proof documentation:
Related mathematical preprint:
The result is a structural theorem about linear representations. I am not claiming that it establishes a general computational lower bound or resolves P versus NP.
Any mathematical feedback or independent verification would be greatly appreciated.
Thank you,
Bjoern Tonn
r/mathematics • u/indigo_kaze • 4h ago
r/mathematics • u/BludyOlive • 12h ago
Hello!
Im looking for an easy website to practice my formulas. I am doing a maths exam for an admissions test, and while I have no problem solving problems and understanding the steps, I tend to forget the basic rules since I haven't done this in a while. Is there a simple website to practice this? Like a website that would write out something you then need to reduce, or with multiple choice so you have to fill in a formula or something?