Unverified50% confidenceFactExact time
In 2005, Goldston, Pintz, and Yıldırım used sieve methods to obtain the GPY theorem, proving that there exist infinitely many prime pairs with a gap smaller than C·lnP (where C can be arbitrarily small).
1
Sources
50%
Confidence
Long-term
Relevance
9/26/2026
First Seen
Sources
Related Entities
Related Claims
VerifiedTerence Tao collaborated with Ben Green to prove the Green-Tao theorem, which states that the prime numbers contain arbitrarily long arithmetic progressions.68% similarUnverifiedCordero-Erausquin and Klartag proved the moment measure decomposition theorem in 2015: any probability measure ρ with a first moment, zero barycenter, and support not contained in a hyperplane can be decomposed into a specific form, where the transport map is the gradient of a convex function u.61% similarVerifiedAt the end of 2023, Terence Tao and collaborators used Lean and LLM assistance to prove an important special case of the polynomial Freiman-Ruzsa conjecture60% similarUnverifiedThe core issue involved in the discovery is a factorial normalization discrepancy between the original moment M_n and the Taylor/Jensen coefficients.58% similarUnverifiedIn their 2004 paper, Ledoit and Wolf derived an analytically optimal solution for the shrinkage intensity δ that minimizes the Frobenius norm between the estimated matrix and the true covariance matrix.58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/951520API
curl https://kongchang.com/api/v1/knowledge/claims/951520MCP
get_claim(id=951520)