LANƘWASA MAFI TSAWO NA ERDŐS, AN TABBATAR DA SHI A ƘARSHE
Ɗauki wani polynomial p wanda babban ɓangarensa (leading term) shi ne zⁿ, kamar z⁶ − z, sannan ka bar z ta yi yawo a kan fili (plane) na lambobi masu sarƙaƙiya (complex numbers). Ka shafa launi a kan kowane wuri da ƙimar p(z) ke nisan 1 daidai daga sifili. Sakamakon wani lanƙwasa ne da ake kira lemniscate, wanda ake rubutawa {|p(z)| = 1}. Ga z⁶ − 1 fure ne: ganyayen fure shida da ke haɗuwa a asalin (origin).
A 1958, P. Erdős, F. Herzog da G. Piranian sun tambayi yaya tsawon irin wannan lanƙwasa zai iya kai. Hasashensu (conjecture): cikin dukkan polynomials na mataki n masu babban coefficient (leading coefficient) 1, lemniscate mafi tsawo na zⁿ − 1 ne. A 1983, hasashen ya sake bayyana a matsayin matsala ta farko a cikin wani tarin matsalolin Erdős kan polynomials.
Shekaru sittin da takwas na iyakoki na sama
Tsawon lanƙwasan misalin (model curve) yana da madaidaiciyar dabara (exact formula), 2^(1/n) B(1/2, 1/(2n)), inda B shi ne beta function na Euler. Ga n = 1 tana ba da 2π, kewayen da’irar raka’a (unit circle).
Teburi na farko na takardar ya bi diddigin hawan da aka yi zuwa gare shi. Iyakoki na sama (upper bounds) a kan tsawon sun tafi daga 74n² (Pommerenke, 1961) zuwa 8eπn, 4πn, 2πn, πn tare da gyara (correction), sannan 2n tare da gyare-gyare masu ƙara ƙanƙanta. An warware mataki na 2 a hannun Alexandre Eremenko da W. Hayman a 1999, mataki na 3 kuma a hannun B. E. Dahlke a 2026. An riga an tabbatar da hasashen, a hannun Terence Tao, ga kowane mataki mai girma isasshe. Matakan da ke tsakani sun kasance a buɗe.
Yanzu an tabbatar da hasashen a kowane mataki, a hannun Teng Zhang, na Jami’ar Xi’an Jiaotong (Xi’an Jiaotong University) a China: babu lemniscate da ya fi na zⁿ − 1 tsawo.
Lanƙwasa da’ira ta zama layi madaidaici
Dabarar ta fara ne daga wani lura. zⁿ − 1 yana da critical value guda ɗaya tak (ƙimar da ake samu a inda derivative ke zama sifili): −1. Kullum ana iya zaɓar lanƙwasa mafi tsawo ta yadda critical values ɗinsa za su kasance a kan da’irar raka’a; aikin shi ne a nuna cewa irin wannan mai kai matuƙa (maximiser) yana da ɗaya kawai daga cikinsu.
Don kwatanta tsawo, an lanƙwasa abin da ake hari. Ana amfani da canjin Möbius (Möbius transformation), w ↦ w/(1 − βw), a kan ƙimomin polynomial ɗin da kuma a kan da’irar raka’a. Idan aka tura shi har iyakarsa, da’irar tana buɗewa ta zama layi madaidaici.
A kan layi, tsawo ya zama batun ƙirgawa. Ga zⁿ, wuraren da ake tura su zuwa layin lambobi na gaske (real axis) suna samar da layuka madaidaita n da ke ratsawa ta asalin, kuma kusan kowane layi da aka zana a filin yana ketare su sau n daidai. Wani polynomial na daban wani lokaci yana bayar da ƙarancin ketarewa. Wata dabara ta gargajiya ta integral geometry, dabarar Crofton (Crofton’s formula), tana mayar da waɗannan ketarewa da suka ɓace zuwa tsawon da ya ɓace. Idan akwai critical values biyu daban-daban, takardar ta tabbatar cewa ana rasa isasshen tsawo a kan layin da zai tsira har bayan an koma kan da’irar.
Matakai 4 zuwa 255, injin ya duba su
Ga matakai na 256 zuwa sama, ƙiyasin (estimates) suna aiki ga dukkan matakai lokaci guda, ta nazarin lissafi zalla (pure analysis). Tsakanin 4 da 255, ana ƙara musu kaifi mataki bayan mataki, kuma sauran rashin daidaito (inequalities) a kan dukkan yankunan sigogi (parameters) kwamfuta ce ke tabbatar da su da lissafin lambobin rational ko na interval (rational or interval arithmetic), wanda ke kewaye kowace ƙima tsakanin iyakoki da aka ba da tabbacinsu. Lambar shirin (code) a buɗe take ga jama’a, an rubuta ta da Python da C#, kuma shirye-shirye biyu masu zaman kansu ne ke gudanar da mafi yawan binciken; gwaji ɗaya na mataki na 5 kaɗai yana gina bishiya (tree) mai ƙulli na ciki (internal nodes) 347,691. Matakai na 2 da na 3 sun dogara ne kan hujjojin da suka gabata.
Mai nasara ɗaya kaɗai
Sashe na ƙarshe ya warware batun daidaito (equality case): polynomial yana kaiwa matuƙar tsawo kawai idan shi zⁿ − 1 ne da aka matsar a kan filin ko aka juya shi, (z − z₀)ⁿ − e^(iθ). Wannan ita ce daidai amsar da shawarar Tao ta nuna.
Takardar preprint ce mai shafuka 63, kuma da yawa daga cikinta ta dogara ne kan lissafi da aka ba da tabbacinsa (certified computation), don haka dole sauran masana lissafi su bi ta. Takardar ta ba da rahoton amfani da ChatGPT wajen gyaran harshe, zane-zane (figures) da tattaunawar lalube (exploratory discussions), kuma ta bayyana cewa an samar da hujjojin, an duba su, an kuma rubuta su a keɓe (independently).
