{"assessment":{"class":"C","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":641995,"passages":[{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"97427d957334f2f7046b0b597a7b8e12c996208a0f64b792f2a2176a273bce32"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #dada7015","item":"In-text #dada7015","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsLittleO.add_isEquivalent","end_line":163,"library":"mathlib","line":162,"location_key":"7dd050678e400e502c4f138888ad9d8739ad4c3ec9c3faa8eca4f835f529accb","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":null,"pair_key":"b499eb991d779c5780095b913cf66e5ec4ada2fe6e517d091a01e7aefb2d82f9","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsLittleO.add_isEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v w : α → β} {l : Filter α} : u =o[l] w → Asymptotics.IsEquivalent l v w → Asymptotics.IsEquivalent l (u + v) w"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f2f3cc2494396eb87ca0a75291516499bc8747b5c9bde2a2f15369d0f5d2770b","prominence":"supporting","quote":{"exact":"For example, the function y ~ ( x ) = x {\\textstyle"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"For example, the function y ~ ( x ) = x {\\textstyle {\\widetilde {y}}(x)=x} accurately approximates the function y ( x ) = x + e − x {\\textstyle y(x)=x+e^{-x}} for large positive x {\\textstyle x} values (Figure 1).","segments":[{"text":"For example, the function "},{"tex":"\\textstyle {\\widetilde {y}}(x)=x"},{"text":" accurately approximates the function "},{"tex":"\\textstyle y(x)=x+e^{-x}"},{"text":" for large positive "},{"tex":"\\textstyle x"},{"text":" values (Figure 1)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"ef3139f118e7366b2d9f6cd1a6931021d3e480e84a903150b6bc07c30f462173"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #876290bb","item":"In-text #876290bb","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"dace43acb9360b56cf18bcfaea150b697b8003b7500847c5fd90ef9e6684973c","prominence":"supporting","quote":{"exact":"For any desired accuracy, there is a corresponding range of x {\\textstyle"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"For any desired accuracy, there is a corresponding range of x {\\textstyle x} values where this accuracy occurs.","segments":[{"text":"For any desired accuracy, there is a corresponding range of "},{"tex":"\\textstyle x"},{"text":" values where this accuracy occurs."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"55dcf3f600a89954c18d4bdb26056c2f17265d97b1062e786d4287cc0505f280"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #461cf6e3","item":"In-text #461cf6e3","kind":"example","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"42c586c83ee9b122f2fdf0cb0335564283efe65fb8c59b5afe9e55161691ab1f","prominence":"supporting","quote":{"exact":"In this case, a chosen accuracy with a relative error of less"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"In this case, a chosen accuracy with a relative error of less than 1% occurs when the x {\\textstyle x} values are greater than 3.4.","segments":[{"text":"In this case, a chosen accuracy with a relative error of less than 1% occurs when the "},{"tex":"\\textstyle x"},{"text":" values are greater than 3.4."}]},"unresolved":null},{"absence":null,"basis":"6b8f8776e9dca61234e4456845cace4b167255a3375c8c9e93b226dcae4110fd","coverage":null,"id":"enwiki-641995-1379563048::In-text #6a56930f","item":"In-text #6a56930f","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.primeCounting","end_line":58,"library":"mathlib","line":57,"location_key":"6b8f8776e9dca61234e4456845cace4b167255a3375c8c9e93b226dcae4110fd","module":"Mathlib.NumberTheory.PrimeCounting","note":"The library function is defined on natural arguments where the article admits any real x, and on the naturals the two agree.","pair_key":"0d75bd99bab15061943ae160a6bce122d7ce92b7e2e6fdecb3a8a39383f28163","path":"Mathlib/NumberTheory/PrimeCounting.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Nat.primeCounting : ℕ → ℕ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"beb4402d6928463e917fbb20f3c5bea0a121642d75ff15d94a6381a36c538b00","prominence":"central","quote":{"exact":"For any real number x {\\textstyle x} , the prime counting function,"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"For any real number x {\\textstyle x} , the prime counting function, denoted as π ⁡ ( x ) {\\textstyle \\operatorname {\\pi } (x)} , is the number of prime numbers less than or equal to x {\\textstyle x} .","segments":[{"text":"For any real number "},{"tex":"\\textstyle x"},{"text":" , the prime counting function, denoted as "},{"tex":"\\textstyle \\operatorname {\\pi } (x)"},{"text":" , is the number of prime numbers less than or equal to "},{"tex":"\\textstyle x"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"81701b43dc88d2a886df10df438449184b610e98400278aebd75db6159493c22","coverage":null,"id":"enwiki-641995-1379563048::In-text #37e31d14","item":"In-text #37e31d14","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem","library":"atlas","line":183,"location_key":"81701b43dc88d2a886df10df438449184b610e98400278aebd75db6159493c22","module":"MathlibExt.NumberTheory.PrimeNumberTheorem","note":"The declaration is stated with a natural argument, while the article's counting function accepts any real x, so it is that approximation along the naturals.","pair_key":"a3b5348d54ae6b227c2ea986072a0f225227fa799622131292eda80ad478e446","path":"MathlibExt/NumberTheory/PrimeNumberTheorem.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Chebyshev.primeCounting_isEquivalent_of_theta_isEquivalent","library":"atlas","line":49,"location_key":"3dc5505e531572f7044f1436ea6a8f0e86b40827fedcd6d6ebe31b575aae30c9","module":"MathlibExt.NumberTheory.PrimeCounting.Chebyshev","note":null,"pair_key":"76639eebf46a9dc24575d92e1b3aa085dfec12f5a388d1b1029810ddf828dea6","path":"MathlibExt/NumberTheory/PrimeCounting/Chebyshev.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Chebyshev.primeCounting_isEquivalent_of_theta_isEquivalent : (Asymptotics.IsEquivalent Filter.atTop Chebyshev.theta fun x ↦ x) → Asymptotics.IsEquivalent Filter.atTop (fun x ↦ ↑⌊x⌋₊.primeCounting) fun x ↦ x / Real.log x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5d057dacdc72892b38c9b4fec8ddac9595866478347f94c56f6351e5efd0daa5","prominence":"central","quote":{"exact":"The function, x / ln ⁡ ( x ) {\\textstyle x/\\ln(x)} ,"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The function, x / ln ⁡ ( x ) {\\textstyle x/\\ln(x)} , approximates the prime counting function for large numbers x {\\textstyle x} .","segments":[{"text":"The function, "},{"tex":"\\textstyle x/\\ln(x)"},{"text":" , approximates the prime counting function for large numbers "},{"tex":"\\textstyle x"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"a48d9eb46a6609d01421284daf90b9451dfb69ac75e5766c37ff34a93040d440","coverage":null,"id":"enwiki-641995-1379563048::In-text #71e946ca","item":"In-text #71e946ca","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem","library":"atlas","line":183,"location_key":"a48d9eb46a6609d01421284daf90b9451dfb69ac75e5766c37ff34a93040d440","module":"MathlibExt.NumberTheory.PrimeNumberTheorem","note":"Stated at natural arguments while the article speaks of a real x growing without bound; vanishing relative discrepancy is precisely this equivalence.","pair_key":"a337f7c49cb6c878f3cbf98810552f4486878093f3e6eccfb1c09be1fbce67dc","path":"MathlibExt/NumberTheory/PrimeNumberTheorem.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"753c453214cd9c6ede31fd89559cc47db5b5a835c517628ad3d2942ecfb53357","prominence":"supporting","quote":{"exact":"As in the preceding example, as the number x {\\textstyle x} becomes"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"As in the preceding example, as the number x {\\textstyle x} becomes increasingly larger, the approximating function becomes increasingly more accurate, leading to an increasingly smaller relative error.","segments":[{"text":"As in the preceding example, as the number "},{"tex":"\\textstyle x"},{"text":" becomes increasingly larger, the approximating function becomes increasingly more accurate, leading to an increasingly smaller relative error."}]},"unresolved":null},{"absence":null,"basis":"434967f0004842328ed1bd3b2d5af391f27d6f3b4ff882e29f2fd8d35ef7083b","coverage":null,"id":"enwiki-641995-1379563048::In-text #9145159e","item":"In-text #9145159e","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem","library":"atlas","line":183,"location_key":"434967f0004842328ed1bd3b2d5af391f27d6f3b4ff882e29f2fd8d35ef7083b","module":"MathlibExt.NumberTheory.PrimeNumberTheorem","note":"The declaration fixes a natural argument where the article's displayed relation runs over real x, so it is that relation along the naturals.","pair_key":"4ac748b070fba90f221c7da7b8dd877aabedf7f18a66539bb295c0597acfb75f","path":"MathlibExt/NumberTheory/PrimeNumberTheorem.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MathlibExt.NumberTheory.PrimeNumberTheoremWanted.prime_number_theorem : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.primeCounting) fun n ↦ ↑n / Real.log ↑n"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Chebyshev.primeCounting_isEquivalent_iff_theta_isEquivalent","library":"atlas","line":95,"location_key":"4cc96d2b6d0d084bae419bf13343a750be42ff9256050b0044a17a302bb0c28b","module":"MathlibExt.NumberTheory.PrimeCounting.Chebyshev","note":null,"pair_key":"caa230b7127f5927887c0bb100862c1efac3d8700c2e9ab70b75b02ecdfbe814","path":"MathlibExt/NumberTheory/PrimeCounting/Chebyshev.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Chebyshev.primeCounting_isEquivalent_iff_theta_isEquivalent : (Asymptotics.IsEquivalent Filter.atTop (fun x ↦ ↑⌊x⌋₊.primeCounting) fun x ↦ x / Real.log x) ↔ Asymptotics.IsEquivalent Filter.atTop Chebyshev.theta fun x ↦ x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8c9ad3e64bbda32f1485dc3e472aba7fef773e176e40e655219edae18c3448ee","prominence":"central","quote":{"exact":"This asymptotic relationship is expressed using this notation: π ( x )"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"This asymptotic relationship is expressed using this notation: π ( x ) ∼ x ln ⁡ ( x ) ( x → ∞ ) {\\displaystyle \\pi (x)\\sim {\\frac {x}{\\ln(x)}}\\quad (x\\to \\infty )}","segments":[{"text":"This asymptotic relationship is expressed using this notation: "},{"display":true,"tex":"\\pi (x)\\sim {\\frac {x}{\\ln(x)}}\\quad (x\\to \\infty )"}]},"unresolved":null},{"absence":null,"basis":"5a3dcdbc77d07c8bb0827242523da0bca2cc9727fd3dad1ffd40be0062098cef","coverage":null,"id":"enwiki-641995-1379563048::In-text #1451a6ba","item":"In-text #1451a6ba","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent","end_line":78,"library":"mathlib","line":77,"location_key":"5a3dcdbc77d07c8bb0827242523da0bca2cc9727fd3dad1ffd40be0062098cef","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"Mathlib introduces the relation for an arbitrary filter and an arbitrary normed additive group, through the little-o form of the condition, which the article itself records as the other way of writing it.","pair_key":"9661bfefa5c43b301b5be100f557d93ff696a8a41f4a32a16fe311476fc6f1af","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.isEquivalent_iff_tendsto_one","end_line":225,"library":"mathlib","line":214,"location_key":"0416b8d635a21d1767bb1eec2a2c49aee1a121f05edfe2178c6d8cf189d8dd52","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"It carries the extra assumption that the second function avoids zero near the limit, which is just the setting where the article's quotient definition behaves.","pair_key":"2c24e5bf8ed0b85f46e25a862b04e28ad3d465418fd20d996440afdc0c6fa08d","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.isEquivalent_iff_tendsto_one {α : Type*} {β : Type*} [NormedField β] {u v : α → β} {l : Filter α} : (∀ᶠ (x : α) in l, v x ≠ 0) → (Asymptotics.IsEquivalent l u v ↔ Filter.Tendsto (u / v) l (𝓝 1))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"eef441596ee68ef4522a800e6bd04cc15497a5a85e49674deb391524698db616","prominence":"central","quote":{"exact":"Formally, given functions f (x) and g(x), we define a binary relation"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Formally, given functions f (x) and g(x), we define a binary relation f ( x ) ∼ g ( x ) ( as x → ∞ ) {\\displaystyle f(x)\\sim g(x)\\quad ({\\text{as }}x\\to \\infty )} if and only if (de Bruijn 1981, §1.4) lim x → ∞ f ( x ) g ( x ) = 1. {\\displaystyle \\lim _{x\\to \\infty }{\\frac {f(x)}{g(x)}}=1.}","segments":[{"text":"Formally, given functions f (x) and g(x), we define a binary relation "},{"display":true,"tex":"f(x)\\sim g(x)\\quad ({\\text{as }}x\\to \\infty )"},{"text":" if and only if (de Bruijn 1981, §1.4) "},{"display":true,"tex":"\\lim _{x\\to \\infty }{\\frac {f(x)}{g(x)}}=1."}]},"unresolved":null},{"absence":null,"basis":"9e3a3882ddddb27edfdb315890714556af24656914bc62b40bc349c391e5c8f1","coverage":null,"id":"enwiki-641995-1379563048::In-text #7b4e8927","item":"In-text #7b4e8927","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.refl","end_line":100,"library":"mathlib","line":98,"location_key":"9e3a3882ddddb27edfdb315890714556af24656914bc62b40bc349c391e5c8f1","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The library proves reflexivity of its asymptotic equivalence relation on its own, with no hypothesis on the function.","pair_key":"a2a279934c8c48dac5546d927cac86a6cd9cb0e66a71aeca5b2fcfb7277b3a29","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.refl {α : Type*} {β : Type*} [NormedAddCommGroup β] {u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.symm","end_line":104,"library":"mathlib","line":103,"location_key":"24bc34c6998e64cba4409bd43afa2696cd4097b543988793094987e73d25e6aa","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The library proves symmetry of the relation for any two functions along the same limit.","pair_key":"24eb4c80ccd14ff363540e0d4588a26e1538f493acbe39dd24c5608587972c9e","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.symm {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.trans","end_line":109,"library":"mathlib","line":107,"location_key":"dbba48992208c1065d0bdfc332bcfc87ccac4c4aa2eaf5de63c86bcc592bb4c5","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The library proves transitivity of the relation along one fixed limit.","pair_key":"7ae6a906eeb0d62e0abf33f3a8081b1b3e74471b794575544d16e26f4975c814","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.trans {α : Type*} {β : Type*} [NormedAddCommGroup β] {l : Filter α} {u v w : α → β} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v w → Asymptotics.IsEquivalent l u w"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b7e9c4775bb68318bd5135733de9b2ea501d4b7eae48d2cccf05e031a5493e1a","prominence":"central","quote":{"exact":"The relation is an equivalence relation on the set of functions of"},"quote_capped":true,"section":["Definition"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":"; the functions f and g are said to be asymptotically equivalent.","segments":[{"text":"; the functions f and g are said to be asymptotically equivalent."}]},"layer":"The relation is an equivalence relation on the set of functions of x","segments":[{"text":"The relation is an equivalence relation on the set of functions of x"}]},"unresolved":null},{"absence":null,"basis":"aeaa894cfd58fbf562417514fb5c8ad42a0d1bbc21a148bdb4618034c572ed57","coverage":null,"id":"enwiki-641995-1379563048::In-text #5905d06f","item":"In-text #5905d06f","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent","end_line":78,"library":"mathlib","line":77,"location_key":"aeaa894cfd58fbf562417514fb5c8ad42a0d1bbc21a148bdb4618034c572ed57","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"Mathlib defines this relation along an arbitrary filter and for values in any normed additive group, writing the condition as the difference being little-o of the second function, which is the article's own second form of the relation; its docstring calls such functions asymptotically equivalent.","pair_key":"d7bf4b2b4daf2126e36558481e6c8d770e7174575ab0db3123ec0601148b79bb","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5e75a1bed70c0de6dfea23fb0d5916fef2b2d2adc4308cc4069c82ca8e9b6c72","prominence":"supporting","quote":{"exact":"the functions f and g are said to be asymptotically equivalent."},"quote_capped":false,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"before":{"layer":"The relation is an equivalence relation on the set of functions of x; ","segments":[{"text":"The relation is an equivalence relation on the set of functions of x; "}]},"layer":"the functions f and g are said to be asymptotically equivalent.","segments":[{"text":"the functions f and g are said to be asymptotically equivalent."}]},"unresolved":null},{"absence":null,"basis":"52c29c0c00463dd557ec7dc414e22f33596c0ba1d53843358825a8cb25610cbc","coverage":null,"id":"enwiki-641995-1379563048::In-text #b93c4b81","item":"In-text #b93c4b81","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.IsEquivalent","end_line":78,"library":"mathlib","line":77,"location_key":"52c29c0c00463dd557ec7dc414e22f33596c0ba1d53843358825a8cb25610cbc","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The library leaves the domain a type variable and records the limiting process as a filter on it, so the relation is available over the reals, the complexes and the positive integers alike.","pair_key":"8851cf575347232c9ac4bd6f55c29f61070ee833e6059ee445ccfd5e0476bffa","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c5263ba00f145d1c89fb7dd3d57c52e77cf4ec740141e13f6bf8d26589605fb7","prominence":"supporting","quote":{"exact":"The domain of f and g can be any set for which"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The domain of f and g can be any set for which the limit is defined: e.g. real numbers, complex numbers, positive integers.","segments":[{"text":"The domain of f and g can be any set for which the limit is defined: e.g. real numbers, complex numbers, positive integers."}]},"unresolved":null},{"absence":null,"basis":"81ae0ccda29e742dbbb1165b9e368041cfaa503af3db807b22b0117c0cf21d42","coverage":null,"id":"enwiki-641995-1379563048::In-text #89cdb21a","item":"In-text #89cdb21a","kind":"notation","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.IsEquivalent","end_line":78,"library":"mathlib","line":77,"location_key":"81ae0ccda29e742dbbb1165b9e368041cfaa503af3db807b22b0117c0cf21d42","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The library's notation for the relation carries the limiting process as a filter subscript, so one relation serves approach to infinity, approach to zero and one-sided approach to zero.","pair_key":"4c489055eedc4d2b89655fad67b3bc329da0f05df87bd4637ae40ca4fc8db110","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"833e639318eb081b1293a5329dd21fddccf3a2749a386a68c2fb23ec9b1cc892","prominence":"supporting","quote":{"exact":"The same notation is also used for other ways of passing to"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The same notation is also used for other ways of passing to a limit: e.g. x → 0, x ↓ 0, |x| → 0.","segments":[{"text":"The same notation is also used for other ways of passing to a limit: e.g. x → 0, x ↓ 0, |x| → 0."}]},"unresolved":null},{"absence":null,"basis":"320ffaa821e55715d4c57206a0d8ea44ff28b3c9fb9a713bc90a996221724110","coverage":null,"id":"enwiki-641995-1379563048::In-text #9446d740","item":"In-text #9446d740","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent","end_line":78,"library":"mathlib","line":77,"location_key":"320ffaa821e55715d4c57206a0d8ea44ff28b3c9fb9a713bc90a996221724110","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"Mathlib takes this little-o condition as its definition of asymptotic equivalence, stated along any filter and for values in any normed additive group.","pair_key":"5bb3655fe8a1c2b6548ea4e297c3db2a670823e1ccfc02d104080eef400491b3","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.isEquivalent_iff_exists_eq_mul","end_line":199,"library":"mathlib","line":190,"location_key":"b0cad5bf4c4402ae122dbc7c3d228cd7f9e85ffc55c8d6fea2aa02100e671c1b","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The theorem puts the library relation in the product form the passage uses, with a factor tending to one, and it holds along any filter.","pair_key":"2ae30ca9324f59bf26d551cc3ba577840203c63cde322fc4f44ee93ba0300aca","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.isEquivalent_iff_exists_eq_mul {α : Type*} {β : Type*} [NormedField β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v ↔ ∃ φ, ∃ (_ : Filter.Tendsto φ l (𝓝 1)), u =ᶠ[l] φ * v"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8265167c4ee73fcbc653e865e75d0c496e240b13996642a9742a7320cf749575","prominence":"central","quote":{"exact":"The alternative definition, in little-o notation, is that f ~ g if"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The alternative definition, in little-o notation, is that f ~ g if and only if f ( x ) = g ( x ) ( 1 + o ( 1 ) ) . {\\displaystyle f(x)=g(x)(1+o(1)).}","segments":[{"text":"The alternative definition, in little-o notation, is that f ~ g if and only if "},{"display":true,"tex":"f(x)=g(x)(1+o(1))."}]},"unresolved":null},{"absence":null,"basis":"a4c4d6d0d9e5f507897d638e2248342e7dc286aa14039aff61c133679c681850","coverage":null,"id":"enwiki-641995-1379563048::In-text #ea6cba06","item":"In-text #ea6cba06","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.isEquivalent_iff_tendsto_one","end_line":225,"library":"mathlib","line":214,"location_key":"a4c4d6d0d9e5f507897d638e2248342e7dc286aa14039aff61c133679c681850","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"Mathlib writes 'nonzero on a neighbourhood of the limiting value' as non-vanishing eventually along the filter, and states the equivalence for values in any normed field.","pair_key":"e3df45c487d82ff4ab971334aafb2168cad662d6a13bb806b570e9400531b739","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.isEquivalent_iff_tendsto_one {α : Type*} {β : Type*} [NormedField β] {u v : α → β} {l : Filter α} : (∀ᶠ (x : α) in l, v x ≠ 0) → (Asymptotics.IsEquivalent l u v ↔ Filter.Tendsto (u / v) l (𝓝 1))"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1947e277421c995d6ed81f943ced0667f344492776b089b8a90f69284dd2074e","prominence":"supporting","quote":{"exact":"This definition is equivalent to the prior definition if g(x) is not"},"quote_capped":true,"section":["Definition"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"This definition is equivalent to the prior definition if g(x) is not zero in some neighbourhood of the limiting value.","segments":[{"text":"This definition is equivalent to the prior definition if g(x) is not zero in some neighbourhood of the limiting value."}]},"unresolved":null},{"absence":null,"basis":"30ec79e39b4657dcb3ccf32c7b131aab842ad77747325249aa948b661c661828","coverage":null,"id":"enwiki-641995-1379563048::In-text #1f9e0c97","item":"In-text #1f9e0c97","kind":"theorem","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.isEquivalent_zero_iff_eventually_zero","end_line":121,"library":"mathlib","line":119,"location_key":"30ec79e39b4657dcb3ccf32c7b131aab842ad77747325249aa948b661c661828","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"Mathlib reads functions as germs along the filter, so it settles equivalence with the zero function as vanishing from some stage on, which for the article's functions means agreeing with the zero function near the limit.","pair_key":"eae9a62ba3123af85562021a8edd37b588919e1ddaa86149ed86bba1b72ef16b","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.isEquivalent_zero_iff_eventually_zero {α : Type*} {β : Type*} [NormedAddCommGroup β] {u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u 0 ↔ u =ᶠ[l] 0"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2af7ad0bd6e2131f463dfb7c827b37ad2278de944e675cc756fe61bbbcd3fdbf","prominence":"central","quote":{"exact":"The zero function, f ( z ) = 0 {\\textstyle f(z)=0} ,"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The zero function, f ( z ) = 0 {\\textstyle f(z)=0} , can never be equivalent to any other function.","segments":[{"text":"The zero function, "},{"tex":"\\textstyle f(z)=0"},{"text":" , can never be equivalent to any other function."}]},"unresolved":null},{"absence":null,"basis":"c927207a935f0a3e14011334a64fe1379ce9c05f61b6d75452551a8d99ea1654","coverage":null,"id":"enwiki-641995-1379563048::In-text #597984ec","item":"In-text #597984ec","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsLittleO.trans","end_line":353,"library":"mathlib","line":351,"location_key":"c927207a935f0a3e14011334a64fe1379ce9c05f61b6d75452551a8d99ea1654","module":"Mathlib.Analysis.Asymptotics.Basic","note":"The library states transitivity of the little-o relation along an arbitrary filter, allowing the three functions distinct normed value types.","pair_key":"5df507ba9359ee200c0d6ce88b3cf9dfcaf8f1b218adb4b991e7166b24317f30","path":"Mathlib/Analysis/Asymptotics/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsLittleO.trans {α : Type*} {E : Type*} {F : Type*} {G : Type*} [Norm E] [Norm F] [Norm G] {l : Filter α} {f : α → E} {g : α → F} {k : α → G} : f =o[l] g → g =o[l] k → f =o[l] k"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.transIsLittleOIsLittleO","end_line":357,"library":"mathlib","line":355,"location_key":"69c5931b96a7bb2ae129402c5be65c8ba53c46f7f99a5a20aa439288831a026c","module":"Mathlib.Analysis.Asymptotics.Basic","note":"This is the same implication packaged as a transitivity instance so that little-o steps compose in calculations.","pair_key":"93db61417c9c77a4cc9608fce1df4969248bbc38da432ce3b23d7be4214e1462","path":"Mathlib/Analysis/Asymptotics/Basic.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Asymptotics.transIsLittleOIsLittleO {α : Type*} {E : Type*} {F : Type*} {G : Type*} [Norm E] [Norm F] [Norm G] {l : Filter α} : Trans (fun x1 x2 ↦ x1 =o[l] x2) (fun x1 x2 ↦ x1 =o[l] x2) fun x1 x2 ↦ x1 =o[l] x2"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"db0d9dc8c5b6a616bd7d217914d7fc1cbed488ed235c52525cd2e7e5c2ad965a","prominence":"central","quote":{"exact":"The little-o relation has the partial ordering property defined as if f"},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The little-o relation has the partial ordering property defined as if f ( x ) = o ( g ( x ) ) {\\textstyle f(x)=o(g(x))} and g ( x ) = o ( h ( x ) ) {\\textstyle g(x)=o(h(x))} then f ( x ) = o ( h ( x ) ) {\\textstyle f(x)=o(h(x))} .","segments":[{"text":"The little-o relation has the partial ordering property defined as if "},{"tex":"\\textstyle f(x)=o(g(x))"},{"text":" and "},{"tex":"\\textstyle g(x)=o(h(x))"},{"text":" then "},{"tex":"\\textstyle f(x)=o(h(x))"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":{"basis":true,"bundle_key":"359b8ce2f9f5448286459e46e4f9d3c6f73de24e0ff3a371b5f2f80aa7d70eb2","challenge":"survived","complete":true,"conjuncts":[{"id":"c1","part":"db87f0880d76bdef93dee6a417c8e401cc7c7f5a8d192754f82026c0295b8ad9","text":"asymptotic equivalence is reflexive"},{"id":"c2","part":"7c55fa398c77181a8b49310cb0add49f141961ea554d8c20c5e1732a96089d54","text":"asymptotic equivalence is symmetric"},{"id":"c3","part":"d25f60610423137dfd1a41df234f63c31a38064e1f91b617be4e780c00159979","text":"asymptotic equivalence is transitive"}],"parts":["db87f0880d76bdef93dee6a417c8e401cc7c7f5a8d192754f82026c0295b8ad9","7c55fa398c77181a8b49310cb0add49f141961ea554d8c20c5e1732a96089d54","d25f60610423137dfd1a41df234f63c31a38064e1f91b617be4e780c00159979"],"relation":"broadMatch","status":"formalized"},"id":"enwiki-641995-1379563048::In-text #c41a8069","item":"In-text #c41a8069","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.refl","end_line":100,"library":"mathlib","line":98,"location_key":"db87f0880d76bdef93dee6a417c8e401cc7c7f5a8d192754f82026c0295b8ad9","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"Mathlib phrases the relation through its IsEquivalent predicate on a filter, the same relation the passage calls asymptotic equivalence.","pair_key":"3ad51451ad278a39fb3e2b9574117841bf1c8c9573ad36800ca2030cb56ace51","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.refl {α : Type*} {β : Type*} [NormedAddCommGroup β] {u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.symm","end_line":104,"library":"mathlib","line":103,"location_key":"7c55fa398c77181a8b49310cb0add49f141961ea554d8c20c5e1732a96089d54","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The declaration works for an arbitrary filter, so it covers the article's several ways of passing to a limit.","pair_key":"ca28ad149a257f8598524e698794326197afc28109da1169629fa00439eba4ae","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.symm {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v u"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.trans","end_line":109,"library":"mathlib","line":107,"location_key":"d25f60610423137dfd1a41df234f63c31a38064e1f91b617be4e780c00159979","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The chaining is stated for one fixed filter, matching the article's single limit process.","pair_key":"375c30434b5d7a5f2bda8c3eb3595380bc8cc489987f54fad2dce7c6646eab5a","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.trans {α : Type*} {β : Type*} [NormedAddCommGroup β] {l : Filter α} {u v w : α → β} : Asymptotics.IsEquivalent l u v → Asymptotics.IsEquivalent l v w → Asymptotics.IsEquivalent l u w"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"de97dde49bd5c52ce24e65841cf297227323c70cdfbf1db4b007b2e56c210a82","prominence":"central","quote":{"exact":"Asymptotic equivalence has reflexive, symmetric and transitive properties."},"quote_capped":false,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Asymptotic equivalence has reflexive, symmetric and transitive properties.","segments":[{"text":"Asymptotic equivalence has reflexive, symmetric and transitive properties."}]},"unresolved":null},{"absence":null,"basis":"f760b67430369943f85470aef0e3243244f6c1ebf2f74a088b096b5b34aca985","coverage":null,"id":"enwiki-641995-1379563048::In-text #32768b9f","item":"In-text #32768b9f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.rpow","end_line":121,"library":"mathlib","line":110,"location_key":"f760b67430369943f85470aef0e3243244f6c1ebf2f74a088b096b5b34aca985","module":"Mathlib.Analysis.Asymptotics.SpecificAsymptotics","note":"The declaration asks that the second function be nonnegative, a sign condition the passage's sentence does not state.","pair_key":"c22c18bb9687c40c1fc52edee951be30a048e5fd550274d1a1de3de24633bd05","path":"Mathlib/Analysis/Asymptotics/SpecificAsymptotics.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.rpow {α : Type*} {u v : α → ℝ} {l : Filter α} : 0 ≤ v → Asymptotics.IsEquivalent l u v → ∀ {r : ℝ}, Asymptotics.IsEquivalent l (u ^ r) (v ^ r)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.IsEquivalent.pow","end_line":306,"library":"mathlib","line":303,"location_key":"6ac60343b14c3b3ec025e32659369b0c765e0744b0009d83b4c1513863948eaa","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"The exponent here ranges over the naturals only, where the passage allows any real exponent.","pair_key":"ed7f5e33e609be89bd22ac4a8c2661fccb59d7aace14f8b669caf554e97ca0b9","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.pow {α : Type*} {β : Type*} [NormedField β] {t u : α → β} {l : Filter α} : Asymptotics.IsEquivalent l t u → ∀ (n : ℕ), Asymptotics.IsEquivalent l (t ^ n) (u ^ n)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"80a9a09c293568c9712cf997b21495faae97e9bc41dad39e3de3800a7b6074eb","prominence":"central","quote":{"exact":"If these functions are equivalent, f ( x ) ∼ g ("},"quote_capped":true,"section":["Properties"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"If these functions are equivalent, f ( x ) ∼ g ( x ) ( x → L ) {\\textstyle f(x)\\sim g(x)\\,(x\\to L)} , then the exponentiated functions to the real power r {\\textstyle r} are also equivalent:[7] ( f ( x ) ) r ∼ ( g ( x ) ) r ( x → L ) {\\displaystyle (f(x))^{r}\\sim (g(x))^{r}\\ (x\\to L)}","segments":[{"text":"If these functions are equivalent, "},{"tex":"\\textstyle f(x)\\sim g(x)\\,(x\\to L)"},{"text":" , then the exponentiated functions to the real power "},{"tex":"\\textstyle r"},{"text":" are also equivalent:"},{"ref":"[7]"},{"text":" "},{"display":true,"tex":"(f(x))^{r}\\sim (g(x))^{r}\\ (x\\to L)"}]},"unresolved":null},{"absence":null,"basis":"20b95e43ca98f4ba02e93dae47e6254eed86036859fa410169cefb5fdbe60025","coverage":null,"id":"enwiki-641995-1379563048::In-text #d7f86f77","item":"In-text #d7f86f77","kind":"theorem","locations":[{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsEquivalent.div","end_line":301,"library":"mathlib","line":299,"location_key":"20b95e43ca98f4ba02e93dae47e6254eed86036859fa410169cefb5fdbe60025","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"Lean's division is total and returns zero when the denominator is zero, which is where the passage's quotient would have no value.","pair_key":"6ca5a57aeb06f37e894e4289aa7533b26bb7d24a9eabe406f0eeba0794c328a9","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.div {α : Type*} {β : Type*} [NormedField β] {t u v w : α → β} {l : Filter α} : Asymptotics.IsEquivalent l t u → Asymptotics.IsEquivalent l v w → Asymptotics.IsEquivalent l (t / v) (u / w)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"28911ba23f664843be33e42a0269cbe4dbb747da860d6825f86f7111cadd2bfc","prominence":"central","quote":{"exact":"If these functions are equivalent f ( x ) ∼ g ("},"quote_capped":true,"section":["Properties"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":" These properties allow asymptotically equivalent functions to be freely exchanged in many algebraic expressions.","segments":[{"text":" These properties allow asymptotically equivalent functions to be freely exchanged in many algebraic expressions."}]},"layer":"If these functions are equivalent f ( x ) ∼ g ( x ) ( x → L ) {\\textstyle f(x)\\sim g(x)\\,(x\\to L)} , and these functions are equivalent h ( x ) ∼ k ( x ) ( x → L ) {\\textstyle h(x)\\sim k(x)\\,(x\\to L)} , then the quotients are equivalent:[7] f ( x ) h ( x ) ∼ g ( x ) k ( x ) ( x → L ) {\\displaystyle {\\frac {f(x)}{h(x)}}\\sim {\\frac {g(x)}{k(x)}}\\ (x\\to L)}","segments":[{"text":"If these functions are equivalent "},{"tex":"\\textstyle f(x)\\sim g(x)\\,(x\\to L)"},{"text":" , and these functions are equivalent "},{"tex":"\\textstyle h(x)\\sim k(x)\\,(x\\to L)"},{"text":" , then the quotients are equivalent:"},{"ref":"[7]"},{"text":" "},{"display":true,"tex":"{\\frac {f(x)}{h(x)}}\\sim {\\frac {g(x)}{k(x)}}\\ (x\\to L)"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"d294aba6134d29d8370cb2824f722305e7fa32055f1601f3d76d66328717ca3f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #204d7d28","item":"In-text #204d7d28","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a01d326b8d18192fdd6783eb82b27bc3d62cd8e81f470b6b2df66ad4f24e5f6d","prominence":"supporting","quote":{"exact":"Asymptotically equivalent functions remain asymptotically equivalent under integration if requirements related to"},"quote_capped":true,"section":["Properties"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Asymptotically equivalent functions remain asymptotically equivalent under integration if requirements related to convergence are met.","segments":[{"text":"Asymptotically equivalent functions remain asymptotically equivalent under integration if requirements related to convergence are met."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #79ad4153","item":"In-text #79ad4153","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"aa74eb59dfcd20b8c4568111d67184a002269d4d2d6fb3ccbfffab0f83c72734","prominence":"supporting","quote":{"exact":"There are more stringent requirements for asymptotically equivalent functions to remain asymptotically"},"quote_capped":true,"section":["Properties"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"There are more stringent requirements for asymptotically equivalent functions to remain asymptotically equivalent under differentiation.","segments":[{"text":"There are more stringent requirements for asymptotically equivalent functions to remain asymptotically equivalent under differentiation."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":null,"basis":"0fd7305dcdb99c80a6e29d79cf8d84986ca2eeec898fedf84186f0a42a40cfd9","coverage":null,"id":"enwiki-641995-1379563048::In-text #f02f4869","item":"In-text #f02f4869","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Stirling.factorial_isEquivalent_stirling","end_line":225,"library":"mathlib","line":218,"location_key":"0fd7305dcdb99c80a6e29d79cf8d84986ca2eeec898fedf84186f0a42a40cfd9","module":"Mathlib.Analysis.SpecialFunctions.Stirling","note":"Lean writes the radicand with the factors in another order, which is the same real number the passage writes.","pair_key":"14af9669094a93c3a5fc1f0e941bcfba83211006feb54a21c3a6e19c67bbbbd4","path":"Mathlib/Analysis/SpecialFunctions/Stirling.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Stirling.factorial_isEquivalent_stirling : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.factorial) fun n ↦ √(2 * ↑n * π) * (↑n / Real.exp 1) ^ n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b87ee6bf7b188db4ec6ba7bd28515b2f6df10312e630dfaf941da80f48bbb087","prominence":"central","quote":{"exact":"Factorial n ! ∼ 2 π n ( n e ) n"},"quote_capped":true,"section":["Examples of asymptotic formulas"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Factorial n ! ∼ 2 π n ( n e ) n {\\displaystyle n!\\sim {\\sqrt {2\\pi n}}\\left({\\frac {n}{e}}\\right)^{n}} —this is Stirling's approximation","segments":[{"text":"Factorial "},{"display":true,"tex":"n!\\sim {\\sqrt {2\\pi n}}\\left({\\frac {n}{e}}\\right)^{n}"},{"text":" —this is Stirling's approximation"}]},"unresolved":null},{"absence":null,"basis":"28ef1559beddd71317e468eefab8f8b5d883697c974f1b1ff97e0f2e1b53eccf","coverage":null,"id":"enwiki-641995-1379563048::In-text #2a218964","item":"In-text #2a218964","kind":"definition","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"MetaMathlibExt.partitionFunction","library":"atlas","line":31,"location_key":"28ef1559beddd71317e468eefab8f8b5d883697c974f1b1ff97e0f2e1b53eccf","module":"MathlibExt.Combinatorics.Enumerative.PentagonalNumber","note":"It is built from the Mathlib type of partitions of n, multisets of positive parts summing to n, so the arrangement of the summands plays no role.","pair_key":"50e2de44c33c0b2bfa2c3062d1421b57766fbe3ad53f916338a16118f9caedb0","path":"MathlibExt/Combinatorics/Enumerative/PentagonalNumber.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def MetaMathlibExt.partitionFunction : ℕ → ℕ"},"statement":false},{"challenge":"survived","commit":"e754a78c74a3f2bbc38e4f2063b5f6eed51bde39","confidence":"medium","declaration":"Erdos1106.p","end_line":37,"library":"formal-conjectures","line":37,"location_key":"c3082f9935ea766b71731f02aac4c5716138fbe67f9e89f7b738ef4d06d1a714","module":"FormalConjectures.ErdosProblems.«1106»","note":"Its own documentation records the same counting description, with the arrangement of the summands disregarded.","pair_key":"82b58196f7b03047fdc6e7d6d827ea95e711d8a9f4aa5ad7a77d87bd4011965e","path":"FormalConjectures/ErdosProblems/1106.lean","proof_status":"definition","rank":2,"relation":"exactMatch","repo":"https://github.com/google-deepmind/formal-conjectures","signature":{"elided":false,"text":"def Erdos1106.p : ℕ → ℕ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Nat.Partition","end_line":59,"library":"mathlib","line":52,"location_key":"4779a8e8505a1ec3b64818dc8b3fd761e5b2fec1556ecdb498e05d9263fc0d7e","module":"Mathlib.Combinatorics.Enumerative.Partition.Basic","note":"This is the type of partitions of n, whose cardinality is the number the passage defines, rather than that number itself.","pair_key":"5ae3fbc387cdc8526b23c218772da5c15f7aac65e50a07c4d0d40e0cb2a281bd","path":"Mathlib/Combinatorics/Enumerative/Partition/Basic.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure Nat.Partition : ℕ → Type"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"59e2a34e17dcfc8c8208b29776d4553fbd555c55c52ca424f38b8f2a679dde97","prominence":"supporting","quote":{"exact":"Partition function For a positive integer n, the partition function, p(n), gives"},"quote_capped":true,"section":["Examples of asymptotic formulas"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Partition function For a positive integer n, the partition function, p(n), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered.","segments":[{"text":"Partition function For a positive integer n, the partition function, p(n), gives the number of ways of writing the integer n as a sum of positive integers, where the order of addends is not considered."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"2b54e963863fb6ef9d7e42964b4b8fa3adc98e7827d3f7fd220478dbb09b6c1e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #1e90fae6","item":"In-text #1e90fae6","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"40233c7218876c3bef975e80f41ab4caa0d6f4478274e8e3a19ddc01f49fab94","prominence":"central","quote":{"exact":"p ( n ) ∼ 1 4 n 3 e π 2"},"quote_capped":true,"section":["Examples of asymptotic formulas"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"p ( n ) ∼ 1 4 n 3 e π 2 n 3 {\\displaystyle p(n)\\sim {\\frac {1}{4n{\\sqrt {3}}}}e^{\\pi {\\sqrt {\\frac {2n}{3}}}}}","segments":[{"display":true,"tex":"p(n)\\sim {\\frac {1}{4n{\\sqrt {3}}}}e^{\\pi {\\sqrt {\\frac {2n}{3}}}}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"ab9ed1a4e311576cf17e2f0628b5f703fa7858f464844b7801137fa6b801c813"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #0db244bc","item":"In-text #0db244bc","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3a224170a935d44ce5c7e1423dba2cf15bff7fc47e64c18f6c4063255f20e6e8","prominence":"supporting","quote":{"exact":"Airy function The Airy function, Ai(x), is a solution of the differential"},"quote_capped":true,"section":["Examples of asymptotic formulas"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":"; it has many applications in physics.","segments":[{"text":"; it has many applications in physics."}]},"layer":"Airy function The Airy function, Ai(x), is a solution of the differential equation y″ − xy = 0","segments":[{"text":"Airy function The Airy function, Ai(x), is a solution of the differential equation y″ − xy = 0"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"94e76088cf409544bc7bc3ed0d3e93e1e428c3532d36c9db0dc3f33a04b3d6b4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #7a8274b2","item":"In-text #7a8274b2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5285b18620d81caadeef09b2591a5719308bb6db4c11012a3d5befbe89338026","prominence":"central","quote":{"exact":"Ai ⁡ ( x ) ∼ e − 2 3 x 3"},"quote_capped":true,"section":["Examples of asymptotic formulas"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Ai ⁡ ( x ) ∼ e − 2 3 x 3 2 2 π x 1 / 4 {\\displaystyle \\operatorname {Ai} (x)\\sim {\\frac {e^{-{\\frac {2}{3}}x^{\\frac {3}{2}}}}{2{\\sqrt {\\pi }}x^{1/4}}}}","segments":[{"display":true,"tex":"\\operatorname {Ai} (x)\\sim {\\frac {e^{-{\\frac {2}{3}}x^{\\frac {3}{2}}}}{2{\\sqrt {\\pi }}x^{1/4}}}"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"a7c7d1b0d3a6b392e6c0059196e4bc531c108a4a8d32ec47eb21cb7a10116efd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #00f3c6e2","item":"In-text #00f3c6e2","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"462b740fd0c981117bf0bbde4b8d4cbb212cb9b84745d707fba46c7b46debafb","prominence":"central","quote":{"exact":"Hankel functions H α ( 1 ) ( z ) ∼ 2"},"quote_capped":true,"section":["Examples of asymptotic formulas"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Hankel functions H α ( 1 ) ( z ) ∼ 2 π z e i ( z − 2 π α − π 4 ) H α ( 2 ) ( z ) ∼ 2 π z e − i ( z − 2 π α − π 4 ) {\\displaystyle {\\begin{aligned}H_{\\alpha }^{(1)}(z)&\\sim {\\sqrt {\\frac {2}{\\pi z}}}e^{i\\left(z-{\\frac {2\\pi \\alpha -\\pi }{4}}\\right)}\\\\H_{\\alpha }^{(2)}(z)&\\sim {\\sqrt {\\frac {2}{\\pi z}}}e^{-i\\left(z-{\\frac {2\\pi \\alpha -\\pi }{4}}\\right)}\\end{aligned}}}","segments":[{"text":"Hankel functions "},{"display":true,"tex":"\\begin{aligned}H_{\\alpha }^{(1)}(z)&\\sim {\\sqrt {\\frac {2}{\\pi z}}}e^{i\\left(z-{\\frac {2\\pi \\alpha -\\pi }{4}}\\right)}\\\\H_{\\alpha }^{(2)}(z)&\\sim {\\sqrt {\\frac {2}{\\pi z}}}e^{-i\\left(z-{\\frac {2\\pi \\alpha -\\pi }{4}}\\right)}\\end{aligned}"}]},"unresolved":null},{"absence":null,"basis":"b0429b1ad08130f32ebc64109349c55b13e61716cfa1b8e113ca53603875bc8a","coverage":null,"id":"enwiki-641995-1379563048::In-text #7b9eb019","item":"In-text #7b9eb019","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Real.exp_sub_sum_range_succ_isLittleO_pow","end_line":167,"library":"mathlib","line":165,"location_key":"b0429b1ad08130f32ebc64109349c55b13e61716cfa1b8e113ca53603875bc8a","module":"Mathlib.Analysis.SpecialFunctions.Exp","note":"The passage permits a divergent series but does not demand one, so the convergent exponential series at zero falls under the notion it describes.","pair_key":"702edd810faa961382ee7a7f037fa106bdcad77ef29784e24ef9d42564f9176d","path":"Mathlib/Analysis/SpecialFunctions/Exp.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.exp_sub_sum_range_succ_isLittleO_pow (n : ℕ) : (fun x ↦ Real.exp x - ∑ i ∈ Finset.range (n + 1), x ^ i / ↑i.factorial) =o[𝓝 0] fun x ↦ x ^ n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5daac15df3c77ed1e162a71799a13086403901834a4126ff9aaa2a2a5ff6e925","prominence":"central","quote":{"exact":"An asymptotic expansion of a function f(x) is in practice an expression"},"quote_capped":true,"section":["Asymptotic expansion"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"An asymptotic expansion of a function f(x) is in practice an expression of that function in terms of a series, the partial sums of which do not necessarily converge, but such that taking any initial partial sum provides an asymptotic formula for f.","segments":[{"text":"An asymptotic expansion of a function f(x) is in practice an expression of that function in terms of a series, the partial sums of which do not necessarily converge, but such that taking any initial partial sum provides an asymptotic formula for f."}]},"unresolved":null},{"absence":null,"basis":"7e7fb076277e7589a843b7bc30e7e6949bd505a02a1d11851a67a7eccf1626c4","coverage":null,"id":"enwiki-641995-1379563048::In-text #a157c32a","item":"In-text #a157c32a","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Real.exp_sub_sum_range_succ_isLittleO_pow","end_line":167,"library":"mathlib","line":165,"location_key":"7e7fb076277e7589a843b7bc30e7e6949bd505a02a1d11851a67a7eccf1626c4","module":"Mathlib.Analysis.SpecialFunctions.Exp","note":"Mathlib's asymptotic equivalence is by definition the little-o form of the difference, and the nonzero factorial factor does not change the order, so the stated bound is the chain of equivalences at these terms.","pair_key":"c56e24a9103872f10dd72df7f13bbb96d758a3bd1b5a3c0941b243f763f0410a","path":"Mathlib/Analysis/SpecialFunctions/Exp.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.exp_sub_sum_range_succ_isLittleO_pow (n : ℕ) : (fun x ↦ Real.exp x - ∑ i ∈ Finset.range (n + 1), x ^ i / ↑i.factorial) =o[𝓝 0] fun x ↦ x ^ n"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Complex.exp_sub_sum_range_succ_isLittleO_pow","end_line":90,"library":"mathlib","line":88,"location_key":"401d8cab9f37af0dd6d48aaf0a66eb5f730f7485c370431855b520bc88d5700f","module":"Mathlib.Analysis.SpecialFunctions.Exp","note":"The same reading applies over the complex numbers, where the article allows the domain of f and g to be any set on which the limit makes sense.","pair_key":"7c61531d11fb2436650b4120e7411a887e74ae1a348d9242d6b2662690697394","path":"Mathlib/Analysis/SpecialFunctions/Exp.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Complex.exp_sub_sum_range_succ_isLittleO_pow (n : ℕ) : (fun x ↦ Complex.exp x - ∑ i ∈ Finset.range (n + 1), x ^ i / ↑i.factorial) =o[𝓝 0] fun x ↦ x ^ n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"31dd8e6b190fc952490233854c540a643ed1ac75a2a22c211d36dd5e347695ea","prominence":"supporting","quote":{"exact":"In symbols, it means we have f ∼ g 1 , {\\displaystyle"},"quote_capped":true,"section":["Asymptotic expansion"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"In symbols, it means we have f ∼ g 1 , {\\displaystyle f\\sim g_{1},} but also f − g 1 ∼ g 2 {\\displaystyle f-g_{1}\\sim g_{2}} and f − g 1 − ⋯ − g k − 1 ∼ g k {\\displaystyle f-g_{1}-\\cdots -g_{k-1}\\sim g_{k}} for each fixed k.","segments":[{"text":"In symbols, it means we have "},{"tex":"f\\sim g_{1},"},{"text":" but also "},{"tex":"f-g_{1}\\sim g_{2}"},{"text":" and "},{"tex":"f-g_{1}-\\cdots -g_{k-1}\\sim g_{k}"},{"text":" for each fixed k."}]},"unresolved":null},{"absence":null,"basis":"37998054135d98aec8fd87e9b2238bfb75b21374e69f885432b63c3448e22d51","coverage":null,"id":"enwiki-641995-1379563048::In-text #becf7611","item":"In-text #becf7611","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.IsEquivalent.isLittleO","end_line":82,"library":"mathlib","line":82,"location_key":"37998054135d98aec8fd87e9b2238bfb75b21374e69f885432b63c3448e22d51","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"It carries only one direction of the equivalence the passage asserts, so it does not give the converse reading.","pair_key":"66c050983a46dae9a508f3c3c9f8ec1ae4a945e1f7748004fdeb342d23cd1c27","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.isLittleO {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v → (u - v) =o[l] v"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.IsLittleO.isEquivalent","end_line":175,"library":"mathlib","line":175,"location_key":"e7414ede6f44c3dda552e5cafd77eac35ba4347951f1eaa1f926441754fd79c9","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"It carries only the other direction of the equivalence the passage asserts.","pair_key":"61c390451fd3b9e5b03543f11b56e999cf1403ea3130fb5986ed2e9d0b9b827d","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsLittleO.isEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : (u - v) =o[l] v → Asymptotics.IsEquivalent l u v"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.IsEquivalent","end_line":78,"library":"mathlib","line":77,"location_key":"1ad76c8989e2f21fb04f0613eebf3e0fbf32bbd22ad17325d8ce89040a921b29","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":"This is the definition of the tilde relation in the library, so it already builds in the little-o reading the passage argues for rather than asserting the link.","pair_key":"08b2b47eb0573392415b4436d7b910605e1d738349233421e9a7e5a3fe215c8e","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Asymptotics.IsEquivalent {α : Type*} {β : Type*} [NormedAddCommGroup β] : Filter α → (α → β) → (α → β) → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"870496cd2dcac45b7458075849e348afdd16c8c774d8170a07f7c6a277c38f03","prominence":"supporting","quote":{"exact":"In view of the definition of the ∼ {\\displaystyle \\sim } symbol,"},"quote_capped":true,"section":["Asymptotic expansion"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"In view of the definition of the ∼ {\\displaystyle \\sim } symbol, the last equation means f − ( g 1 + ⋯ + g k ) = o ( g k ) {\\displaystyle f-(g_{1}+\\cdots +g_{k})=o(g_{k})} in the little o notation, i.e., f − ( g 1 + ⋯ + g k ) {\\displaystyle f-(g_{1}+\\cdots +g_{k})} is much smaller than g k . {\\displaystyle g_{k}.}","segments":[{"text":"In view of the definition of the "},{"tex":"\\sim"},{"text":" symbol, the last equation means "},{"tex":"f-(g_{1}+\\cdots +g_{k})=o(g_{k})"},{"text":" in the little o notation, i.e., "},{"tex":"f-(g_{1}+\\cdots +g_{k})"},{"text":" is much smaller than "},{"tex":"g_{k}."}]},"unresolved":null},{"absence":null,"basis":"630cb44550a5f2ff481444a95960f7dee9faefdb0d3f537f3c0fb61947cf9d64","coverage":null,"id":"enwiki-641995-1379563048::In-text #feca116b","item":"In-text #feca116b","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.isLittleO_pow_pow","end_line":588,"library":"mathlib","line":583,"location_key":"630cb44550a5f2ff481444a95960f7dee9faefdb0d3f537f3c0fb61947cf9d64","module":"Mathlib.Analysis.Asymptotics.Lemmas","note":"The library states the condition for every pair of exponents, which contains the consecutive pairs the passage asks about.","pair_key":"1972b9b7542d3bfdee006184e9296db67bb4e15f6e42b80559bc21fbecf142ae","path":"Mathlib/Analysis/Asymptotics/Lemmas.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.isLittleO_pow_pow {𝕜 : Type*} [NormedDivisionRing 𝕜] {m n : ℕ} : m < n → (fun x ↦ x ^ n) =o[𝓝 0] fun x ↦ x ^ m"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2408733015f1f62dc93c705f7496c766fdd387013005be5ca1c92345c14b4535","prominence":"central","quote":{"exact":"The relation f − g 1 − ⋯ − g k −"},"quote_capped":true,"section":["Asymptotic expansion"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The relation f − g 1 − ⋯ − g k − 1 ∼ g k {\\displaystyle f-g_{1}-\\cdots -g_{k-1}\\sim g_{k}} takes its full meaning if g k + 1 = o ( g k ) {\\displaystyle g_{k+1}=o(g_{k})} for all k, which means the g k {\\displaystyle g_{k}} form an asymptotic scale.","segments":[{"text":"The relation "},{"tex":"f-g_{1}-\\cdots -g_{k-1}\\sim g_{k}"},{"text":" takes its full meaning if "},{"tex":"g_{k+1}=o(g_{k})"},{"text":" for all k, which means the "},{"tex":"g_{k}"},{"text":" form an asymptotic scale."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"bfeef67fac38b54c7d311880e0a1e156c686fda29eb17e44214f2f778922ecc7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #67950a6b","item":"In-text #67950a6b","kind":"notation","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"29d59d91461dfab243cac522922fccf9df2ef83367379707f86572774f2c0585","prominence":"supporting","quote":{"exact":"In that case, some authors may abusively write f ∼ g 1"},"quote_capped":true,"section":["Asymptotic expansion"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":" One should however be careful that this is not a standard use of the ∼ {\\displaystyle \\sim } symbol, and that it does not correspond to the definition given in § Definition.","segments":[{"text":" One should however be careful that this is not a standard use of the "},{"tex":"\\sim"},{"text":" symbol, and that it does not correspond to the definition given in § Definition."}]},"layer":"In that case, some authors may abusively write f ∼ g 1 + ⋯ + g k {\\displaystyle f\\sim g_{1}+\\cdots +g_{k}} to denote the statement f − ( g 1 + ⋯ + g k ) = o ( g k ) . {\\displaystyle f-(g_{1}+\\cdots +g_{k})=o(g_{k}).}","segments":[{"text":"In that case, some authors may abusively write "},{"tex":"f\\sim g_{1}+\\cdots +g_{k}"},{"text":" to denote the statement "},{"tex":"f-(g_{1}+\\cdots +g_{k})=o(g_{k})."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"a53c94db4614a852eb8bcbca1d3db8cb50aae27948fdf0a30f27c04fb0d82e02"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #722a3804","item":"In-text #722a3804","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Asymptotics.IsEquivalent.isLittleO","end_line":82,"library":"mathlib","line":82,"location_key":"bfd9b53646ba276b4e93a13e23a30a49b5d6cebf49ed67ccbce4ab79db05e619","module":"Mathlib.Analysis.Asymptotics.AsymptoticEquivalent","note":null,"pair_key":"f1f847504a1b294e340f8bd404dd9e8c1214009a0eb036b175fd0f1ea7c792c3","path":"Mathlib/Analysis/Asymptotics/AsymptoticEquivalent.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Asymptotics.IsEquivalent.isLittleO {α : Type*} {β : Type*} [NormedAddCommGroup β] {u v : α → β} {l : Filter α} : Asymptotics.IsEquivalent l u v → (u - v) =o[l] v"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"6173e220a19636efa1dd4abe9209d3b6739cfb9465f21dfb1794f58244e2f73c","prominence":"supporting","quote":{"exact":"In the present situation, this relation g k = o ( g"},"quote_capped":true,"section":["Asymptotic expansion"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":"; by subtracting f − g 1 − ⋯ − g k − 2 = g k − 1 + o ( g k − 1 ) {\\displaystyle f-g_{1}-\\cdots -g_{k-2}=g_{k-1}+o(g_{k-1})} from f − g 1 − ⋯ − g k − 2 − g k − 1 = g k + o ( g k ) , {\\displaystyle f-g_{1}-\\cdots -g_{k-2}-g_{k-1}=g_{k}+o(g_{k}),} one gets g k + o ( g k ) = o ( g k − 1 ) , {\\displaystyle g_{k}+o(g_{k})=o(g_{k-1}),}","segments":[{"text":"; by subtracting "},{"tex":"f-g_{1}-\\cdots -g_{k-2}=g_{k-1}+o(g_{k-1})"},{"text":" from "},{"tex":"f-g_{1}-\\cdots -g_{k-2}-g_{k-1}=g_{k}+o(g_{k}),"},{"text":" one gets "},{"tex":"g_{k}+o(g_{k})=o(g_{k-1}),"}],"trimmed":true},"layer":"In the present situation, this relation g k = o ( g k − 1 ) {\\displaystyle g_{k}=o(g_{k-1})} actually follows from combining steps k and k−1","segments":[{"text":"In the present situation, this relation "},{"tex":"g_{k}=o(g_{k-1})"},{"text":" actually follows from combining steps k and k−1"}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #bf8078b5","item":"In-text #bf8078b5","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"16228c1106dcd8cd1a682f94701bd9bcc1b8e1fde64a02102d11fbc5d5634245","prominence":"supporting","quote":{"exact":"by subtracting f − g 1 − ⋯ − g k −"},"quote_capped":true,"section":["Asymptotic expansion"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"before":{"layer":"In the present situation, this relation g k = o ( g k − 1 ) {\\displaystyle g_{k}=o(g_{k-1})} actually follows from combining steps k and k−1; ","segments":[{"text":"In the present situation, this relation "},{"tex":"g_{k}=o(g_{k-1})"},{"text":" actually follows from combining steps k and k−1; "}]},"layer":"by subtracting f − g 1 − ⋯ − g k − 2 = g k − 1 + o ( g k − 1 ) {\\displaystyle f-g_{1}-\\cdots -g_{k-2}=g_{k-1}+o(g_{k-1})} from f − g 1 − ⋯ − g k − 2 − g k − 1 = g k + o ( g k ) , {\\displaystyle f-g_{1}-\\cdots -g_{k-2}-g_{k-1}=g_{k}+o(g_{k}),} one gets g k + o ( g k ) = o ( g k − 1 ) , {\\displaystyle g_{k}+o(g_{k})=o(g_{k-1}),} i.e. g k = o ( g k − 1 ) . {\\displaystyle g_{k}=o(g_{k-1}).}","segments":[{"text":"by subtracting "},{"tex":"f-g_{1}-\\cdots -g_{k-2}=g_{k-1}+o(g_{k-1})"},{"text":" from "},{"tex":"f-g_{1}-\\cdots -g_{k-2}-g_{k-1}=g_{k}+o(g_{k}),"},{"text":" one gets "},{"tex":"g_{k}+o(g_{k})=o(g_{k-1}),"},{"text":" i.e. "},{"tex":"g_{k}=o(g_{k-1})."}]},"unresolved":{"challenge":"sampled_out"}},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"74bd39838de397254b3c8289c67947e094758e8b585c441a75e17109ebb3198c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #a9a9f765","item":"In-text #a9a9f765","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"61ff46f5cc5c331f3bb325821ecfdc381ea49f3987346432801e02aeed5d1552","prominence":"supporting","quote":{"exact":"In case the asymptotic expansion does not converge, for any particular value"},"quote_capped":true,"section":["Asymptotic expansion"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"In case the asymptotic expansion does not converge, for any particular value of the argument there will be a particular partial sum which provides the best approximation and adding additional terms will decrease the accuracy.","segments":[{"text":"In case the asymptotic expansion does not converge, for any particular value of the argument there will be a particular partial sum which provides the best approximation and adding additional terms will decrease the accuracy."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"e746fd27f33efbcd7946b966681d280b2de47cbacc698bddc9c585c7c5760124"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #be98f5a3","item":"In-text #be98f5a3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Stirling.factorial_isEquivalent_stirling","end_line":225,"library":"mathlib","line":218,"location_key":"67d8f135269a66e79f0b1dfb00f57f2ed7501d050c90a3b10f555f4c931cfc05","module":"Mathlib.Analysis.SpecialFunctions.Stirling","note":null,"pair_key":"b37a49fc92232894afcab2b5b0b61e256945fa0693c4143cecc570062822d35d","path":"Mathlib/Analysis/SpecialFunctions/Stirling.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Stirling.factorial_isEquivalent_stirling : Asymptotics.IsEquivalent Filter.atTop (fun n ↦ ↑n.factorial) fun n ↦ √(2 * ↑n * π) * (↑n / Real.exp 1) ^ n"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"a162fa6334e2370f6073eb3bd28cb39e379dfdc4221c96b355b9565538e20532","prominence":"central","quote":{"exact":"Gamma function e x x x 2 π x Γ ( x"},"quote_capped":true,"section":["Asymptotic expansion","Examples of asymptotic expansions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Gamma function e x x x 2 π x Γ ( x + 1 ) ∼ 1 + 1 12 x + 1 288 x 2 − 139 51840 x 3 − ⋯ ( x → ∞ ) {\\displaystyle {\\frac {e^{x}}{x^{x}{\\sqrt {2\\pi x}}}}\\Gamma (x+1)\\sim 1+{\\frac {1}{12x}}+{\\frac {1}{288x^{2}}}-{\\frac {139}{51840x^{3}}}-\\cdots \\ (x\\to \\infty )}","segments":[{"text":"Gamma function "},{"display":true,"tex":"{\\frac {e^{x}}{x^{x}{\\sqrt {2\\pi x}}}}\\Gamma (x+1)\\sim 1+{\\frac {1}{12x}}+{\\frac {1}{288x^{2}}}-{\\frac {139}{51840x^{3}}}-\\cdots \\ (x\\to \\infty )"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"9afefefe2239f82c860f1e8064965a176103285419cc4e4f8a046448cc2b85e3"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #c10669cd","item":"In-text #c10669cd","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"high","declaration":"Complex.principal_exponential_integral_e1_two_term_remainder_dlmf","library":"atlas","line":22,"location_key":"a92f983c37d84574796cb9425f7707ee7ab4888c1a27fb3748577acb033e132f","module":"MathlibExt.Analysis.SpecialFunctions.ExponentialIntegral.E1.DLMF","note":null,"pair_key":"4132637ba6ce4526d19b300014f6247cfeb65c0633645f26b3a4fd8d650f8b32","path":"MathlibExt/Analysis/SpecialFunctions/ExponentialIntegral/E1/DLMF.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Complex.principal_exponential_integral_e1_two_term_remainder_dlmf (z : ℂ) (hz : z ≠ 0) : π / 2 ≤ |z.arg| → |z.arg| < π → ‖Complex.e1AsymptoticRemainder 2 z hz‖ ≤ (Real.sin |z.arg|)⁻¹ * ‖Complex.e1AsymptoticTerm 2 z hz‖"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Complex.e1AsymptoticTerm","library":"atlas","line":63,"location_key":"94767a4af599adf8e52631be42a94beb6f5e92b443a2eacc24acfae3ed64f9a8","module":"MathlibExt.Analysis.SpecialFunctions.ExponentialIntegral.E1","note":null,"pair_key":"e989555bd34e88590aea1bd9dc050dd960e1de6bf85308f837e0b6fe07bcd5ef","path":"MathlibExt/Analysis/SpecialFunctions/ExponentialIntegral/E1.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"def Complex.e1AsymptoticTerm : ℕ → (z : ℂ) → z ≠ 0 → ℂ"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3adb569ada5cdcae731e6f7eb850a6237ccf3eb5794e3c26d6efb1e02ece945d","prominence":"central","quote":{"exact":"Exponential integral x e x E 1 ( x ) ∼ ∑"},"quote_capped":true,"section":["Asymptotic expansion","Examples of asymptotic expansions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Exponential integral x e x E 1 ( x ) ∼ ∑ n = 0 ∞ ( − 1 ) n n ! x n ( x → ∞ ) {\\displaystyle xe^{x}E_{1}(x)\\sim \\sum _{n=0}^{\\infty }{\\frac {(-1)^{n}n!}{x^{n}}}\\ (x\\to \\infty )}","segments":[{"text":"Exponential integral "},{"display":true,"tex":"xe^{x}E_{1}(x)\\sim \\sum _{n=0}^{\\infty }{\\frac {(-1)^{n}n!}{x^{n}}}\\ (x\\to \\infty )"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"6fcbeb04837874850facab1aaa4ee952d90958e32e9703a4f5724f98a5245523"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #d4dc9175","item":"In-text #d4dc9175","kind":"theorem","locations":[{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"high","declaration":"TauCeti.Real.tendsto_erfc_atTop","end_line":172,"library":"tauceti","line":168,"location_key":"9b26671f933e5f45eddb6c2e6bd06d8afd498069c86693fa320bf1f830b82cf1","module":"TauCeti.Analysis.SpecialFunctions.Erf","note":null,"pair_key":"8348576a0850b559d5a2a28ff9d0639f8d97d5124ed6bcf9b832c23789a58cd3","path":"TauCeti/Analysis/SpecialFunctions/Erf.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.Real.tendsto_erfc_atTop : Filter.Tendsto TauCeti.Real.erfc Filter.atTop (𝓝 0)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"c461470fba3fe3db21276cbb45f29c060368abc30c782c26b742b2f12a63e820","prominence":"central","quote":{"exact":"Error function π x e x 2 erfc ⁡ ( x )"},"quote_capped":true,"section":["Asymptotic expansion","Examples of asymptotic expansions"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Error function π x e x 2 erfc ⁡ ( x ) ∼ 1 + ∑ n = 1 ∞ ( − 1 ) n ( 2 n − 1 ) ! ! n ! ( 2 x 2 ) n ( x → ∞ ) {\\displaystyle {\\sqrt {\\pi }}xe^{x^{2}}\\operatorname {erfc} (x)\\sim 1+\\sum _{n=1}^{\\infty }(-1)^{n}{\\frac {(2n-1)!!}{n!(2x^{2})^{n}}}\\ (x\\to \\infty )} where m!! is the double factorial.","segments":[{"text":"Error function "},{"display":true,"tex":"{\\sqrt {\\pi }}xe^{x^{2}}\\operatorname {erfc} (x)\\sim 1+\\sum _{n=1}^{\\infty }(-1)^{n}{\\frac {(2n-1)!!}{n!(2x^{2})^{n}}}\\ (x\\to \\infty )"},{"text":" where m!! is the double factorial."}]},"unresolved":null},{"absence":null,"basis":"5dcf904eb41ec00fbadde43ad2999b8e56279cfb131e04fdfdf5356fd7e968ba","coverage":null,"id":"enwiki-641995-1379563048::In-text #599f0f2a","item":"In-text #599f0f2a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"PowerSeries.mk_one_mul_one_sub_eq_one","end_line":83,"library":"mathlib","line":78,"location_key":"5dcf904eb41ec00fbadde43ad2999b8e56279cfb131e04fdfdf5356fd7e968ba","module":"Mathlib.RingTheory.PowerSeries.WellKnown","note":"Mathlib writes the series whose coefficients are all one as mk 1 and states the identity as a product with 1 minus X over an arbitrary commutative coefficient ring.","pair_key":"252065da31d2f5cf8c59c4dc8810867e6bc3d7758c6cf8ede0b92873257f9905","path":"Mathlib/RingTheory/PowerSeries/WellKnown.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem PowerSeries.mk_one_mul_one_sub_eq_one (S : Type*) [CommRing S] : PowerSeries.mk 1 * (1 - PowerSeries.X) = 1"},"statement":false},{"challenge":"survived","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.powerSeries_mk_pow_mul_one_sub_C_mul_X_eq_one","end_line":38,"library":"tauceti","line":31,"location_key":"3d315cccdfcd57b3a56727233dc03ffa9bcfead3aa4785e0ca63848fef34e2f9","module":"TauCeti.RingTheory.PowerSeries.Geometric","note":"The declaration carries a scalar parameter and states the identity for the series in that scalar times the indeterminate, over an arbitrary ring of coefficients.","pair_key":"68c2b576c72cf99d44d0b90d89bca540863ea4147d22f695a38fe11a36545e2d","path":"TauCeti/RingTheory/PowerSeries/Geometric.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.powerSeries_mk_pow_mul_one_sub_C_mul_X_eq_one {R : Type*} [Ring R] (a : R) : (PowerSeries.mk fun n ↦ a ^ n) * (1 - PowerSeries.C a * PowerSeries.X) = 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1b1cb6d6e098e8fad91448ada9ac25a0ad30f84b52761428758a443309f7b75f","prominence":"supporting","quote":{"exact":"For example, we might start with the formal power series 1 1"},"quote_capped":true,"section":["Asymptotic expansion","Worked example"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"For example, we might start with the formal power series 1 1 − w = ∑ n = 0 ∞ w n {\\displaystyle {\\frac {1}{1-w}}=\\sum _{n=0}^{\\infty }w^{n}}","segments":[{"text":"For example, we might start with the formal power series "},{"display":true,"tex":"{\\frac {1}{1-w}}=\\sum _{n=0}^{\\infty }w^{n}"}]},"unresolved":null},{"absence":null,"basis":"ed362df0378b00d440348d737386f31c447b86dfb23818d1a2bf2fc727b48aad","coverage":null,"id":"enwiki-641995-1379563048::In-text #7956ffa3","item":"In-text #7956ffa3","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"summable_geometric_iff_norm_lt_one","end_line":508,"library":"mathlib","line":502,"location_key":"ed362df0378b00d440348d737386f31c447b86dfb23818d1a2bf2fc727b48aad","module":"Mathlib.Analysis.SpecificLimits.Normed","note":"Mathlib ties summability of the powers of a scalar to the bound on its modulus as an equivalence, over any normed division ring; its Summable is unconditional summability over the naturals, which for powers of a complex number agrees with convergence of the geometric series.","pair_key":"6b72bcac5f426201b8489a0c9820378d2de417071b7c2e805eaded282e2518e2","path":"Mathlib/Analysis/SpecificLimits/Normed.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem summable_geometric_iff_norm_lt_one {K : Type*} [NormedDivisionRing K] {ξ : K} : (Summable fun n ↦ ξ ^ n) ↔ ‖ξ‖ < 1"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1ba01199b7fe8b1c1f5dc9d1f65c4e8f2e17cd78e3f77045d12a9ea30a322576","prominence":"supporting","quote":{"exact":"The expression on the left is valid on the entire complex plane"},"quote_capped":true,"section":["Asymptotic expansion","Worked example"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The expression on the left is valid on the entire complex plane w ≠ 1 {\\displaystyle w\\neq 1} , while the right hand side converges only for | w | < 1 {\\displaystyle |w|<1} .","segments":[{"text":"The expression on the left is valid on the entire complex plane "},{"tex":"w\\neq 1"},{"text":" , while the right hand side converges only for "},{"tex":"|w|<1"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"0b2cc44a4b1f9253f4eb47d8d31f571711bde30df7df1bbf414f8df298c54e8d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #594316bc","item":"In-text #594316bc","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"TauCeti.integral_pow_mul_exp_neg_mul_Ioi","end_line":73,"library":"tauceti","line":57,"location_key":"a5c6fb4eee897444164ae1797199bd445f4864e6934ffb04b785a2d4b83d8c7d","module":"TauCeti.MeasureTheory.Integral.ExpDecay","note":"It evaluates one exponential moment with a scaled rate, the step that rescales a single term of the passage's right-hand series.","pair_key":"2cc4160636e7f2f78aa027ce05500a0f5510bf093f7dfc6e9a9f474b8a5ff359","path":"TauCeti/MeasureTheory/Integral/ExpDecay.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"theorem TauCeti.integral_pow_mul_exp_neg_mul_Ioi (n : ℕ) {a : ℝ} : 0 < a → ∫ (t : ℝ) in Set.Ioi 0, t ^ n * Real.exp (-(a * t)) = ↑n.factorial / a ^ (n + 1)"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.watson_laplace_integral_asymptotic","library":"atlas","line":67,"location_key":"31668b1e470d46c7fa198f58de6eefa4901ccea203638b7b7b8a9f121d1b9691","module":"MathlibExt.Analysis.Asymptotics.WatsonLaplaceLemma","note":"Watson's lemma for Laplace integrals, the general result behind expansions of this shape, but it requires the integrand to be integrable on the half-line.","pair_key":"62bf154be7f5fc03ba30c7a4f72aee40dc2eb97bb9a14d06980e585a54b80be8","path":"MathlibExt/Analysis/Asymptotics/WatsonLaplaceLemma.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.watson_laplace_integral_asymptotic (g : ℝ → ℝ) (c : ℕ → ℝ) : (∀ (N : ℕ), (fun s ↦ g s - ∑ k ∈ Finset.range N, c (k + 1) * s ^ (k + 1)) =O[𝓝[>] 0] fun s ↦ s ^ (N + 1)) → (∃ m₀, ∀ m ≥ m₀, MeasureTheory.IntegrableOn (fun s ↦ g s * Real.exp (-m * s)) (Set.Ioi 0) MeasureTheory.MeasureSpace.volume) → ∀ (N : ℕ), (fun m ↦ (∫ (s : ℝ) in Set.Ioi 0, g s * Real.exp (-m * s)) - ∑ k ∈ Finset.range N, ↑(k + 1).factorial * c (k + 1) / m ^ (k + 2)) =O[Filter.atTop] fun m ↦ 1 / m ^ (N + 2)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f1bc066924fe772d92d9eb753383fb2b82dd8df2df603d932ea546972e1ab847","prominence":"supporting","quote":{"exact":"Multiplying by e − w / t {\\displaystyle e^{-w/t}} and integrating both"},"quote_capped":true,"section":["Asymptotic expansion","Worked example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Multiplying by e − w / t {\\displaystyle e^{-w/t}} and integrating both sides yields ∫ 0 ∞ e − w t 1 − w d w = ∑ n = 0 ∞ t n + 1 ∫ 0 ∞ e − u u n d u {\\displaystyle \\int _{0}^{\\infty }{\\frac {e^{-{\\frac {w}{t}}}}{1-w}}\\,dw=\\sum _{n=0}^{\\infty }t^{n+1}\\int _{0}^{\\infty }e^{-u}u^{n}\\,du}","segments":[{"text":"Multiplying by "},{"tex":"e^{-w/t}"},{"text":" and integrating both sides yields "},{"display":true,"tex":"\\int _{0}^{\\infty }{\\frac {e^{-{\\frac {w}{t}}}}{1-w}}\\,dw=\\sum _{n=0}^{\\infty }t^{n+1}\\int _{0}^{\\infty }e^{-u}u^{n}\\,du"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"a73269ad6d0691d79df87cb265d99345900db9f904e2163ebe4d1919c929515a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #456e0784","item":"In-text #456e0784","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Complex.principal_e1_integral","library":"atlas","line":118,"location_key":"c955e9d9ee187932e20971785bf11ce5f59c5928521979f937191fd586e7400d","module":"MathlibExt.Analysis.SpecialFunctions.ExponentialIntegral.E1.PrincipalIntegral","note":"It writes the principal exponential integral of an argument off the negative real axis as a decaying exponential times an integral of the same shape over the positive axis.","pair_key":"18e0382edb2138581031ae9d8df7d242307b0b444ad0f0472d1bd5de1d0958c2","path":"MathlibExt/Analysis/SpecialFunctions/ExponentialIntegral/E1/PrincipalIntegral.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Complex.principal_e1_integral (z : ℂ) (hz : z ≠ 0) : |z.arg| < π → z.principalExponentialIntegralE1 hz = Complex.exp (-z) * ∫ (t : ℝ) in Set.Ioi 0, ↑(Real.exp (-t)) / (↑t + z)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"fd5ee08c438bf3e9a3ba45d7e6f406478729358e8107fd4998f5271cee3bd642","prominence":"supporting","quote":{"exact":"The integral on the left hand side can be expressed in terms"},"quote_capped":true,"section":["Asymptotic expansion","Worked example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The integral on the left hand side can be expressed in terms of the exponential integral.","segments":[{"text":"The integral on the left hand side can be expressed in terms of the exponential integral."}]},"unresolved":null},{"absence":null,"basis":"472c8900e45d6bd6609e407c3e00edf20cd4a112362f1592b16f30fc3d010610","coverage":null,"id":"enwiki-641995-1379563048::In-text #21ae4e0e","item":"In-text #21ae4e0e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Real.Gamma_eq_integral","end_line":408,"library":"mathlib","line":405,"location_key":"472c8900e45d6bd6609e407c3e00edf20cd4a112362f1592b16f30fc3d010610","module":"Mathlib.Analysis.SpecialFunctions.Gamma.Basic","note":"Lean writes the exponent as a real power of the variable; at parameter n+1 that is the passage's whole-number power of the integration variable, the same operation in two encodings.","pair_key":"c787583e00e62e873a025b584b790ed07545266983ce08bb4bd721ee3f142797","path":"Mathlib/Analysis/SpecialFunctions/Gamma/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Real.Gamma_eq_integral {s : ℝ} : 0 < s → Real.Gamma s = ∫ (x : ℝ) in Set.Ioi 0, Real.exp (-x) * x ^ (s - 1)"},"statement":false},{"challenge":"sampled_out","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Complex.integral_exp_neg_mul_pow_Ioi","library":"atlas","line":56,"location_key":"c6c870d5d0d0be249a837acaad25375ea0b1f98ea2b9c795df69726db877a755","module":"MathlibExt.Analysis.SpecialFunctions.ExponentialIntegral.E1.Basic","note":"It evaluates the passage's very integral, with a whole-number exponent, but concludes with the factorial instead of naming the gamma function.","pair_key":"66efaee40048c74701fe545ee69c914e049a079103e98f8cf9b492d5bc1044b4","path":"MathlibExt/Analysis/SpecialFunctions/ExponentialIntegral/E1/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Complex.integral_exp_neg_mul_pow_Ioi (n : ℕ) : ∫ (t : ℝ) in Set.Ioi 0, Real.exp (-t) * t ^ n = ↑n.factorial"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"73e6c49d9b7d44bd7f5339bfb80be13c2cafb2e65e5d6bf10dd391fee7c2994f","prominence":"supporting","quote":{"exact":"The integral on the right hand side, after the substitution u ="},"quote_capped":true,"section":["Asymptotic expansion","Worked example"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"The integral on the right hand side, after the substitution u = w / t {\\displaystyle u=w/t} , may be recognized as the gamma function.","segments":[{"text":"The integral on the right hand side, after the substitution "},{"tex":"u=w/t"},{"text":" , may be recognized as the gamma function."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":4,"sha256":"92dae5eef03212d551388e9404798958ee6348aac475456595e38a1f2907388a"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #43bee47d","item":"In-text #43bee47d","kind":"theorem","locations":[{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"Complex.principal_exponential_integral_e1_two_term_remainder_dlmf","library":"atlas","line":22,"location_key":"594730ec10d33eb50bc10ff0032737d37204a03ea8357cf5cef088cb830f2f7a","module":"MathlibExt.Analysis.SpecialFunctions.ExponentialIntegral.E1.DLMF","note":"It bounds the remainder after two terms of the asymptotic expansion of the principal exponential integral, in a sector that keeps the argument off the negative real axis.","pair_key":"9050b2f51bec373a05005348e456dda3216f804610de92d677eeb9811945eae4","path":"MathlibExt/Analysis/SpecialFunctions/ExponentialIntegral/E1/DLMF.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem Complex.principal_exponential_integral_e1_two_term_remainder_dlmf (z : ℂ) (hz : z ≠ 0) : π / 2 ≤ |z.arg| → |z.arg| < π → ‖Complex.e1AsymptoticRemainder 2 z hz‖ ≤ (Real.sin |z.arg|)⁻¹ * ‖Complex.e1AsymptoticTerm 2 z hz‖"},"statement":false},{"challenge":"survived","commit":"64c2773ffad3e5453b9f40c62e693b3669ade83f","confidence":"medium","declaration":"MetaMathlibExt.watson_laplace_integral_asymptotic","library":"atlas","line":67,"location_key":"b01324741ee2114a537e3544449de1496eeb19d27349e3b61c5c14eead82da74","module":"MathlibExt.Analysis.Asymptotics.WatsonLaplaceLemma","note":"Watson's lemma, the general theorem that yields expansions with factorial coefficients for Laplace integrals.","pair_key":"f3919a6d42f6209e98da2017de4d9538e15902b78b580798342be65c913e060e","path":"MathlibExt/Analysis/Asymptotics/WatsonLaplaceLemma.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/facebookresearch/atlas-lean","signature":{"elided":false,"text":"theorem MetaMathlibExt.watson_laplace_integral_asymptotic (g : ℝ → ℝ) (c : ℕ → ℝ) : (∀ (N : ℕ), (fun s ↦ g s - ∑ k ∈ Finset.range N, c (k + 1) * s ^ (k + 1)) =O[𝓝[>] 0] fun s ↦ s ^ (N + 1)) → (∃ m₀, ∀ m ≥ m₀, MeasureTheory.IntegrableOn (fun s ↦ g s * Real.exp (-m * s)) (Set.Ioi 0) MeasureTheory.MeasureSpace.volume) → ∀ (N : ℕ), (fun m ↦ (∫ (s : ℝ) in Set.Ioi 0, g s * Real.exp (-m * s)) - ∑ k ∈ Finset.range N, ↑(k + 1).factorial * c (k + 1) / m ^ (k + 2)) =O[Filter.atTop] fun m ↦ 1 / m ^ (N + 2)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ff2b0140f6421b828804c06a8b6733911a985a46735dea644190a6d875e54fc1","prominence":"central","quote":{"exact":"Evaluating both, one obtains the asymptotic expansion e − 1 t Ei"},"quote_capped":true,"section":["Asymptotic expansion","Worked example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Evaluating both, one obtains the asymptotic expansion e − 1 t Ei ⁡ ( 1 t ) = ∑ n = 0 ∞ n ! t n + 1 {\\displaystyle e^{-{\\frac {1}{t}}}\\operatorname {Ei} \\left({\\frac {1}{t}}\\right)=\\sum _{n=0}^{\\infty }n!\\;t^{n+1}}","segments":[{"text":"Evaluating both, one obtains the asymptotic expansion "},{"display":true,"tex":"e^{-{\\frac {1}{t}}}\\operatorname {Ei} \\left({\\frac {1}{t}}\\right)=\\sum _{n=0}^{\\infty }n!\\;t^{n+1}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"4a6cde3e1316fc6494e3122b4bb71037799951a9714eca2f6ada863ead9fa7f7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #b0841a00","item":"In-text #b0841a00","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FormalMultilinearSeries.ofScalars_radius_eq_zero_of_tendsto","end_line":285,"library":"mathlib","line":262,"location_key":"f6035daae10fb887ac460c71671b577c890ce3f3c1e0b7310fd2c26c2814a7c2","module":"Mathlib.Analysis.Analytic.OfScalars","note":"It gives radius zero for a scalar series whose successive coefficient ratios grow without bound, which the factorial coefficients do.","pair_key":"fdd1aff7d118b618b2f70e9d233e0e2f1be638d9e78ed1490eed99e7d221bb01","path":"Mathlib/Analysis/Analytic/OfScalars.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem FormalMultilinearSeries.ofScalars_radius_eq_zero_of_tendsto {𝕜 : Type*} (E : Type*) [NontriviallyNormedField 𝕜] [NormedRing E] [NormedAlgebra 𝕜 E] (c : ℕ → 𝕜) [NormOneClass E] : Filter.Tendsto (fun n ↦ ‖c n.succ‖ / ‖c n‖) Filter.atTop Filter.atTop → (FormalMultilinearSeries.ofScalars E c).radius = 0"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"82df04266a75b36b904570e804b2a500b24df6eebe0c925033e0b81d110d0198","prominence":"supporting","quote":{"exact":"Here, the right hand side is clearly not convergent for any non-zero"},"quote_capped":true,"section":["Asymptotic expansion","Worked example"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"Here, the right hand side is clearly not convergent for any non-zero value of t.","segments":[{"text":"Here, the right hand side is clearly not convergent for any non-zero value of t."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":3,"sha256":"96cb598a65f9a4ecedfac560fe72ee67ab785bee10f4ed2d6cd00ab4d64114c9"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #5bfb1ad3","item":"In-text #5bfb1ad3","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.TendstoInDistribution","end_line":70,"library":"mathlib","line":64,"location_key":"2db6a21e5b96241e704548e23fab94dbe52d9dcab0de60dd7e882e930fa7a9cf","module":"Mathlib.MeasureTheory.Function.ConvergenceInDistribution","note":"It defines convergence in distribution of a family of random variables along a filter, as weak convergence of their laws.","pair_key":"24301a463fb61869aff083e9e9ee47ce52963557eb8e7a07740fa3077c37d41b","path":"Mathlib/MeasureTheory/Function/ConvergenceInDistribution.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure MeasureTheory.TendstoInDistribution {ι : Type*} {E : Type*} {Ω' : Type*} {Ω : ι → Type*} {m : (i : ι) → MeasurableSpace (Ω i)} {m' : MeasurableSpace Ω'} {mE : MeasurableSpace E} [TopologicalSpace E] [OpensMeasurableSpace E] : ((i : ι) → Ω i → E) → Filter ι → (Ω' → E) → (μ : (i : ι) → MeasureTheory.Measure (Ω i)) → [∀ (i : ι), MeasureTheory.IsProbabilityMeasure (μ i)] → (μ' : autoParam (MeasureTheory.Measure Ω') MeasureTheory.TendstoInDistribution._auto_1) → [MeasureTheory.IsProbabilityMeasure μ'] → Prop"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"024a8927c95e12c962758020d316f2abca04840f9781100aedb544a6550fb5d5","prominence":"central","quote":{"exact":"In mathematical statistics, an asymptotic distribution is a hypothetical distribution that is"},"quote_capped":true,"section":["Asymptotic distribution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"In mathematical statistics, an asymptotic distribution is a hypothetical distribution that is in a sense the \"limiting\" distribution of a sequence of distributions.","segments":[{"text":"In mathematical statistics, an asymptotic distribution is a hypothetical distribution that is in a sense the \"limiting\" distribution of a sequence of distributions."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"c29de208584e90cdc54818d45a68a5c571f5d9848a2bba7f63bfe461d1a6da8c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #7026be1b","item":"In-text #7026be1b","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"926baa16293b456c23f89050d7b773a75c4a1d33f7273dcc6c03e4577393355d","prominence":"supporting","quote":{"exact":"A distribution is an ordered set of random variables Zi for i"},"quote_capped":true,"section":["Asymptotic distribution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"A distribution is an ordered set of random variables Zi for i = 1, …, n, for some positive integer n.","segments":[{"text":"A distribution is an ordered set of random variables Zi for i = 1, …, n, for some positive integer n."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"d862e975fca63e9260db102c39c9174e03fdac9a09950271d836d34e799a1016"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #114e9cfd","item":"In-text #114e9cfd","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9f00347a811c256653ff976fc84aebc283854a8859698d7e3e360651b900c7ec","prominence":"supporting","quote":{"exact":"An asymptotic distribution allows i to range without bound, that is, n"},"quote_capped":true,"section":["Asymptotic distribution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"An asymptotic distribution allows i to range without bound, that is, n is infinite.","segments":[{"text":"An asymptotic distribution allows i to range without bound, that is, n is infinite."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"52c2e32b29702092bdf24c1d72a4b9e7d83d9569c4f6d89a88dd25e52921ad21"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #b019f838","item":"In-text #b019f838","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"MeasureTheory.TendstoInDistribution","end_line":70,"library":"mathlib","line":64,"location_key":"2eddb87f12bf0e9faf678becb0424708e72af148d5695fdf669a18bf8d64598d","module":"Mathlib.MeasureTheory.Function.ConvergenceInDistribution","note":"This is the library's notion of a sequence of random variables converging in law along a filter; the article's wording does not fix a mode of convergence for its entries.","pair_key":"8a0d8e136010cbb81e375e8cf5a0a9fbdd6324d90e48895b2e96d73e281c4985","path":"Mathlib/MeasureTheory/Function/ConvergenceInDistribution.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure MeasureTheory.TendstoInDistribution {ι : Type*} {E : Type*} {Ω' : Type*} {Ω : ι → Type*} {m : (i : ι) → MeasurableSpace (Ω i)} {m' : MeasurableSpace Ω'} {mE : MeasurableSpace E} [TopologicalSpace E] [OpensMeasurableSpace E] : ((i : ι) → Ω i → E) → Filter ι → (Ω' → E) → (μ : (i : ι) → MeasureTheory.Measure (Ω i)) → [∀ (i : ι), MeasureTheory.IsProbabilityMeasure (μ i)] → (μ' : autoParam (MeasureTheory.Measure Ω') MeasureTheory.TendstoInDistribution._auto_1) → [MeasureTheory.IsProbabilityMeasure μ'] → Prop"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"aa5b551d76810349b9b7f238f090a5236d7f86cf9ce0cc10d02ea673851cd3fd","prominence":"supporting","quote":{"exact":"A special case of an asymptotic distribution is when the late entries"},"quote_capped":true,"section":["Asymptotic distribution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"A special case of an asymptotic distribution is when the late entries go to zero—that is, the Zi go to 0 as i goes to infinity.","segments":[{"text":"A special case of an asymptotic distribution is when the late entries go to zero—that is, the Zi go to 0 as i goes to infinity."}]},"unresolved":null},{"absence":null,"basis":"7ca4b98b969d0183eaad5c0b2a1f214c2e4a0dfd4e7609331f68584dadf2428f","coverage":null,"id":"enwiki-641995-1379563048::In-text #9638537c","item":"In-text #9638537c","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Metric.tendsto_atTop","end_line":913,"library":"mathlib","line":910,"location_key":"8c3c464b6cdf2e9bf8b1c0601602ce1f526a7a3ab0c8f9278e8311995fd528b9","module":"Mathlib.Topology.MetricSpace.Pseudo.Defs","note":"Lean writes the condition with a distance that drops below epsilon past some index, where the passage lets the difference reach epsilon; both phrasings cut out the same functions.","pair_key":"329780abf8d1b223532176cfcaafc2c92a217ff372ea89ccd2310add3d38774a","path":"Mathlib/Topology/MetricSpace/Pseudo/Defs.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Metric.tendsto_atTop {α : Type u} {β : Type v} [PseudoMetricSpace α] [Nonempty β] [SemilatticeSup β] {u : β → α} {a : α} : Filter.Tendsto u Filter.atTop (𝓝 a) ↔ ∀ ε > 0, ∃ N, ∀ n ≥ N, Dist.dist (u n) a < ε"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Filter.Tendsto","end_line":422,"library":"mathlib","line":421,"location_key":"7ca4b98b969d0183eaad5c0b2a1f214c2e4a0dfd4e7609331f68584dadf2428f","module":"Mathlib.Order.Filter.Defs","note":"This is the library's limit predicate for arbitrary filters; the passage's notion is the instance taken along large arguments towards a constant.","pair_key":"795b453696bc33f6d00e436eeaf76aa8b99edac5c5d5f198d33e19c8b5c5f794","path":"Mathlib/Order/Filter/Defs.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Filter.Tendsto {α : Type*} {β : Type*} : (α → β) → Filter α → Filter β → Prop"},"statement":true}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f02c48a9bc5a7a39309e8fd2aa3c7e01f6f7357b75b8eea5fe344485e82eae6d","prominence":"supporting","quote":{"exact":"This is based on the notion of an asymptotic function which cleanly"},"quote_capped":true,"section":["Asymptotic distribution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"This is based on the notion of an asymptotic function which cleanly approaches a constant value (the asymptote) as the independent variable goes to infinity; \"clean\" in this sense meaning that for any desired closeness epsilon there is some value of the independent variable after which the function never differs from the constant by more than epsilon.","segments":[{"text":"This is based on the notion of an asymptotic function which cleanly approaches a constant value (the asymptote) as the independent variable goes to infinity; \"clean\" in this sense meaning that for any desired closeness epsilon there is some value of the independent variable after which the function never differs from the constant by more than epsilon."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"d21b001ce79ab89dca228a9281953c4731e2f674f4c6542f52cb6ff84fc0640d"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #e2adecab","item":"In-text #e2adecab","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b3bb44be922042c160ced4de74977c394083c1336fad1cf8189ac0e953f96c00","prominence":"central","quote":{"exact":"An asymptote is a straight line that a curve approaches but never"},"quote_capped":true,"section":["Asymptotic distribution"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"An asymptote is a straight line that a curve approaches but never meets or crosses.","segments":[{"text":"An asymptote is a straight line that a curve approaches but never meets or crosses."}]},"unresolved":null},{"absence":null,"basis":"d37b1d9c46b46d71a8d6f8ff16a58d9bfe2c6ceac2475412908bea0dc9120d86","coverage":null,"id":"enwiki-641995-1379563048::In-text #cb00e449","item":"In-text #cb00e449","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"tendsto_inv_atTop_zero","end_line":76,"library":"mathlib","line":75,"location_key":"d37b1d9c46b46d71a8d6f8ff16a58d9bfe2c6ceac2475412908bea0dc9120d86","module":"Mathlib.Topology.Algebra.Order.Field","note":"Lean states it for any linearly ordered semifield with the order topology; the passage reads it on the real line.","pair_key":"65abd82adf3d5aada348309d7991f9dda9331926b0028afc9fb753ce773c0f55","path":"Mathlib/Topology/Algebra/Order/Field.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem tendsto_inv_atTop_zero {𝕜 : Type*} [Semifield 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [TopologicalSpace 𝕜] [OrderTopology 𝕜] : Filter.Tendsto (fun r ↦ r⁻¹) Filter.atTop (𝓝 0)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"tendsto_inv_atTop_nhds_zero_nat","end_line":49,"library":"mathlib","line":45,"location_key":"3d5c7702a85100596ee76fb99b02ef94916d35e48acde49668cef73ac3aa877f","module":"Mathlib.Analysis.SpecificLimits.Basic","note":"The variable here ranges over the whole numbers only, where the passage lets x run over the reals.","pair_key":"87c837119d73e1978e429a17812391a248a746c4e4d7e75404b00f51761e56fa","path":"Mathlib/Analysis/SpecificLimits/Basic.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem tendsto_inv_atTop_nhds_zero_nat {𝕜 : Type*} [DivisionSemiring 𝕜] [CharZero 𝕜] [TopologicalSpace 𝕜] [ContinuousSMul ℚ≥0 𝕜] : Filter.Tendsto (fun n ↦ (↑n)⁻¹) Filter.atTop (𝓝 0)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e1cfa8d6d565739689085e217d191c7de0cf62b95a5b960a2a3589d619bd255e","prominence":"supporting","quote":{"exact":"In the equation y = 1 x , {\\displaystyle y={\\frac {1}{x}},} y"},"quote_capped":true,"section":["Asymptotic distribution"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"In the equation y = 1 x , {\\displaystyle y={\\frac {1}{x}},} y becomes arbitrarily small in magnitude as x increases.","segments":[{"text":"In the equation "},{"tex":"y={\\frac {1}{x}},"},{"text":" y becomes arbitrarily small in magnitude as x increases."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"1d783c6aac195dfa700d44e1f9f86167c533787fe5ea0b7b519a0def63fcc79f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #6d529aa6","item":"In-text #6d529aa6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Asymptotics.IsBigO","end_line":86,"library":"mathlib","line":85,"location_key":"6099ac3d740f52d72830877ebcd0d1343f065b2d762fdba2abaf1f1ee1014d39","module":"Mathlib.Analysis.Asymptotics.Defs","note":"This is the Landau big-O predicate itself, the notation the passage's estimate is written in, and it asserts nothing about any particular function.","pair_key":"3b40b29b7cbb732bd3ee13ab05fa8abecb98cb7bf594218c2c8fc0cb716bf7eb","path":"Mathlib/Analysis/Asymptotics/Defs.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Asymptotics.IsBigO {α : Type*} {E : Type*} {F : Type*} [Norm E] [Norm F] : Filter α → (α → E) → (α → F) → Prop"},"statement":true}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"98d477a30425d5600e881613a44b8b62d4aafffb4e933aecb2397239e6c180ed","prominence":"supporting","quote":{"exact":"A.A.: f ( x ) = x − 1 + O ("},"quote_capped":true,"section":["Applications","Asymptotic versus Numerical Analysis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"A.A.: f ( x ) = x − 1 + O ( x − 2 ) ( x → ∞ ) {\\displaystyle f(x)=x^{-1}+\\mathrm {O} (x^{-2})\\qquad (x\\to \\infty )} .","segments":[{"text":"A.A.: "},{"tex":"f(x)=x^{-1}+\\mathrm {O} (x^{-2})\\qquad (x\\to \\infty )"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"7f9cc4d9bbbc34ee1fb434f4ad7796c9d03c23fb2f5b5697642f7deefc4e5b0b"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #4b0dfa4f","item":"In-text #4b0dfa4f","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e33be7af54b7571fb0c7f119d86f610e3e6896f209ff7c70b5e1ab78bfa91ce3","prominence":"supporting","quote":{"exact":"A.A.: | f ( x ) − x − 1 | <"},"quote_capped":true,"section":["Applications","Asymptotic versus Numerical Analysis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":" N.A.: But my value of x {\\displaystyle x} is only 100.","segments":[{"text":" N.A.: But my value of "},{"tex":"x"},{"text":" is only 100."}]},"layer":"A.A.: | f ( x ) − x − 1 | < 8 x − 2 ( x > 10 4 ) . {\\displaystyle |f(x)-x^{-1}|<8x^{-2}\\qquad (x>10^{4}).}","segments":[{"text":"A.A.: "},{"tex":"|f(x)-x^{-1}|<8x^{-2}\\qquad (x>10^{4})."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"a39d9d43e1259c609cad5df9b98e08436684a4f41dd8d754460690e47ef0d688"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #82d09e02","item":"In-text #82d09e02","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3fd4e5678b3234cdf9b7d65044ba983c7aa65eabe98c52cd26836d483f7ba1d7","prominence":"supporting","quote":{"exact":"My evaluations give | f ( x ) − x − 1"},"quote_capped":true,"section":["Applications","Asymptotic versus Numerical Analysis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":" N.A.: This is no news to me.","segments":[{"text":" N.A.: This is no news to me."}]},"layer":"My evaluations give | f ( x ) − x − 1 | < 57000 x − 2 ( x > 100 ) . {\\displaystyle |f(x)-x^{-1}|<57000x^{-2}\\qquad (x>100).}","segments":[{"text":"My evaluations give "},{"tex":"|f(x)-x^{-1}|<57000x^{-2}\\qquad (x>100)."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"93a1541654b92cf3117fb0193ac65642cd9a7d577e833b01b217143b9bace519"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #24c25646","item":"In-text #24c25646","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"aba5f0f2de45371efaed0ab5aa8ff56d431e40c2ba0379af4b9a47d3e8d47975","prominence":"supporting","quote":{"exact":"I know already that 0 < f ( 100 ) < 1"},"quote_capped":true,"section":["Applications","Asymptotic versus Numerical Analysis"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"layer":"I know already that 0 < f ( 100 ) < 1 {\\displaystyle 0<f(100)<1} .","segments":[{"text":"I know already that "},{"tex":"0<f(100)<1"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #0680ea16","item":"In-text #0680ea16","kind":"theorem","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"70b752b8753a5fc5a14cb9d712225e2ac043cd305a209f6acd848a57ad7d5973","prominence":"supporting","quote":{"exact":"Now I find that | f ( x ) − x −"},"quote_capped":true,"section":["Applications","Asymptotic versus Numerical Analysis"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":" N.A.: I asked for 1%, not for 20%.","segments":[{"text":" N.A.: I asked for 1%, not for 20%."}]},"layer":"Now I find that | f ( x ) − x − 1 | < 20 x − 2 ( x > 100 ) . {\\displaystyle |f(x)-x^{-1}|<20x^{-2}\\qquad (x>100).}","segments":[{"text":"Now I find that "},{"tex":"|f(x)-x^{-1}|<20x^{-2}\\qquad (x>100)."}]},"unresolved":{"challenge":"survived"}},{"absence":null,"basis":null,"coverage":null,"id":"enwiki-641995-1379563048::In-text #4f3ca7bd","item":"In-text #4f3ca7bd","kind":"example","locations":[],"outcome":"unresolved","passage_ends_in_suffix":false,"passage_key":"95c1969f6a39636ebb7335ff74307e36a3f2b8f5e0dc5371313bec385168dc3f","prominence":"supporting","quote":{"exact":"Machine: f(100) = 0.01137 42259 34008 67153"},"quote_capped":false,"section":["Applications","Asymptotic versus Numerical Analysis"],"status":null,"subject_uri":"https://en.wikipedia.org/w/index.php?curid=641995&oldid=1379563048","text":{"after":{"layer":" A.A.: Haven't I told you so?","segments":[{"text":" A.A.: Haven't I told you so?"}]},"layer":"Machine: f(100) = 0.01137 42259 34008 67153","segments":[{"text":"Machine: f(100) = 0.01137 42259 34008 67153"}]},"unresolved":{"challenge":"sampled_out"}}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":190637,"images":[{"author":"TMM53","file":"Asymptotic_approximation.jpg","licence":"CC BY 4.0","licence_url":"https://creativecommons.org/licenses/by/4.0","project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"}],"marks":305,"passages":54,"sha256":"aeb9e95c46c0a4fee4ca42a1a849ea91f680c76829a783cf81f9eaf024c32423","unplaced":["enwiki-641995-1379563048::In-text #79ad4153","enwiki-641995-1379563048::In-text #bf8078b5","enwiki-641995-1379563048::In-text #0680ea16","enwiki-641995-1379563048::In-text #4f3ca7bd"]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"95f2b815486162f9b23fcbfe04cf575dcef776de1bfec20f9fa35053bac47c69","revision":1379563048,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"a762ef5718895e79a47529300be2f6f0b867640c306699703c304ea3aee114c5","layer_sha256":"f0375041db9202c7daa38ee3968bc34ad46f01a3eb35e83cff356f09d3fb4cb2","renderer":"web-html/3"},"source_id":"enwiki-641995-1379563048","summary":{"by_library":{"atlas":{"complete":4,"incomplete":0,"locations":4,"passages":4,"related":9},"formal-conjectures":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":0},"mathlib":{"complete":35,"incomplete":0,"locations":35,"passages":23,"related":9},"tauceti":{"complete":1,"incomplete":0,"locations":1,"passages":1,"related":2}},"by_prominence":{"central":{"by_status":{"formalized":7,"not_formalized":9,"partial":7,"statement_only":0,"unresolved":0},"passages":23},"subject":{"by_status":{"formalized":0,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":0},"supporting":{"by_status":{"formalized":9,"not_formalized":18,"partial":4,"statement_only":0,"unresolved":4},"passages":35}},"by_proof_status":{"definition":16,"proved":45},"by_relation":{"broadMatch":16,"closeMatch":1,"exactMatch":3,"hasPart":9,"narrowMatch":12,"relatedMatch":20},"by_status":{"formalized":16,"not_formalized":27,"partial":11,"statement_only":0,"unresolved":4},"locations":41,"passages":58,"related":20},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Asymptotic analysis","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q752718"}
