[{"data":1,"prerenderedAt":9844},["ShallowReactive",2],{"lesson:\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":3,"course-wordcounts":4079,"ref-card-index":4991,"nav:astrophysics-cosmology":9678,"tikz:88e4172e2c98c83dd538c879bd34eb66227a4d0f2212d6238281be0732db2b78":9839,"tikz:c3c365fcf045e54590eda321c4640d431d3629b71fd2d1dc1fedd4b7be536d71":9840,"tikz:79a80302ba9dc03d1a0c53879993496eb7665d8223cf757ee45176f9324c7a8f":9841,"tikz:a4f838ac3160af04868c5784e57e1946808221e87f8040135fdd51edf85cc256":9842,"tikz:8b7952583dc412cf0892ac1e87243af2c5b4d60fda0af4f60ad644f7277cc8b3":9843},{"id":4,"title":5,"blurb":6,"body":7,"brief":4048,"category":4049,"description":13,"draft":4050,"extension":4051,"meta":4052,"module":4056,"navigation":4057,"path":4058,"practice":4059,"rawbody":4060,"readingTime":4061,"seo":4066,"sources":4067,"status":4074,"stem":4075,"summary":4076,"topics":4077,"__hash__":4078},"course\u002F10.astrophysics-cosmology\u002F03.radiation-and-matter\u002F04.opacity-and-the-rosseland-mean.md","Opacity Sources and the Rosseland Mean","",{"type":8,"value":9,"toc":4039},"minimark",[10,14,19,114,430,434,438,445,582,601,604,980,1053,1056,1060,1270,1392,1395,1399,1406,1796,1856,2336,2433,3109,3356,3359,3363,3370,3863,3943,3991,3994,3997],[11,12,13],"p",{},"Opacity is the resistance a stellar gas offers to radiation. It sets the\noptical-depth scale of the previous lessons, and through it the rate at which\nenergy diffuses out of a star. Four microphysical processes contribute, each with\nits own frequency and temperature dependence. Because a star transports energy at\nall frequencies at once, the many monochromatic opacities must be combined into a\nsingle mean, and the correct average is harmonic, dominated by the frequencies\nwhere the gas is most transparent. That mean fixes the temperature gradient and,\nwhere it grows too steep, triggers convection.",[15,16,18],"h2",{"id":17},"the-four-sources-of-opacity","The four sources of opacity",[11,20,21,22,102,103],{},"The total opacity ",[23,24,27],"span",{"className":25},[26],"katex",[23,28,32],{"className":29,"ariaHidden":31},[30],"katex-html","true",[23,33,36,41],{"className":34},[35],"base",[23,37],{"className":38,"style":40},[39],"strut","height:0.5806em;vertical-align:-0.15em;",[23,42,45,50],{"className":43},[44],"mord",[23,46,49],{"className":47},[44,48],"mathnormal","κ",[23,51,54],{"className":52},[53],"msupsub",[23,55,59,93],{"className":56},[57,58],"vlist-t","vlist-t2",[23,60,63,88],{"className":61},[62],"vlist-r",[23,64,68],{"className":65,"style":67},[66],"vlist","height:0.1514em;",[23,69,71,76],{"style":70},"top:-2.55em;margin-left:0em;margin-right:0.05em;",[23,72],{"className":73,"style":75},[74],"pstrut","height:2.7em;",[23,77,83],{"className":78},[79,80,81,82],"sizing","reset-size6","size3","mtight",[23,84,87],{"className":85,"style":86},[44,48,82],"margin-right:0.0637em;","ν",[23,89,92],{"className":90},[91],"vlist-s","​",[23,94,96],{"className":95},[62],[23,97,100],{"className":98,"style":99},[66],"height:0.15em;",[23,101],{}," is a sum of contributions from four distinct\ninteractions between photons and matter.",[104,105,106],"sup",{},[107,108,113],"a",{"href":109,"ariaDescribedBy":110,"dataFootnoteRef":6,"id":112},"#user-content-fn-bob-opacity",[111],"footnote-label","user-content-fnref-bob-opacity","1",[115,116,117,183,304,368],"ul",{},[118,119,120,124,125,182],"li",{},[121,122,123],"strong",{},"Bound-bound absorption"," (",[23,126,128],{"className":127},[26],[23,129,131],{"className":130,"ariaHidden":31},[30],[23,132,134,137],{"className":133},[35],[23,135],{"className":136,"style":40},[39],[23,138,140,143],{"className":139},[44],[23,141,49],{"className":142},[44,48],[23,144,146],{"className":145},[53],[23,147,149,174],{"className":148},[57,58],[23,150,152,171],{"className":151},[62],[23,153,156],{"className":154,"style":155},[66],"height:0.3361em;",[23,157,158,161],{"style":70},[23,159],{"className":160,"style":75},[74],[23,162,164],{"className":163},[79,80,81,82],[23,165,167],{"className":166},[44,82],[23,168,170],{"className":169},[44,48,82],"bb",[23,172,92],{"className":173},[91],[23,175,177],{"className":176},[62],[23,178,180],{"className":179,"style":99},[66],[23,181],{},"): an electron absorbs a photon and\njumps between two bound levels. This produces the spectral lines of the previous\nlesson. It is sharply peaked in frequency and, summed over the forest of lines,\ncontributes substantially to the mean opacity in cool, metal-rich gas.",[118,184,185,124,188,251,252,303],{},[121,186,187],{},"Bound-free absorption",[23,189,191],{"className":190},[26],[23,192,194],{"className":193,"ariaHidden":31},[30],[23,195,197,201],{"className":196},[35],[23,198],{"className":199,"style":200},[39],"height:0.7167em;vertical-align:-0.2861em;",[23,202,204,207],{"className":203},[44],[23,205,49],{"className":206},[44,48],[23,208,210],{"className":209},[53],[23,211,213,242],{"className":212},[57,58],[23,214,216,239],{"className":215},[62],[23,217,219],{"className":218,"style":155},[66],[23,220,221,224],{"style":70},[23,222],{"className":223,"style":75},[74],[23,225,227],{"className":226},[79,80,81,82],[23,228,230,234],{"className":229},[44,82],[23,231,233],{"className":232},[44,48,82],"b",[23,235,238],{"className":236,"style":237},[44,48,82],"margin-right:0.1076em;","f",[23,240,92],{"className":241},[91],[23,243,245],{"className":244},[62],[23,246,249],{"className":247,"style":248},[66],"height:0.2861em;",[23,250],{},"): photoionization. A photon with energy\nabove the ionization threshold ejects a bound electron into the continuum. The\ncross section jumps at each threshold frequency and falls as ",[23,253,255],{"className":254},[26],[23,256,258],{"className":257,"ariaHidden":31},[30],[23,259,261,265],{"className":260},[35],[23,262],{"className":263,"style":264},[39],"height:0.8141em;",[23,266,268,271],{"className":267},[44],[23,269,87],{"className":270,"style":86},[44,48],[23,272,274],{"className":273},[53],[23,275,277],{"className":276},[57],[23,278,280],{"className":279},[62],[23,281,283],{"className":282,"style":264},[66],[23,284,286,289],{"style":285},"top:-3.063em;margin-right:0.05em;",[23,287],{"className":288,"style":75},[74],[23,290,292],{"className":291},[79,80,81,82],[23,293,295,299],{"className":294},[44,82],[23,296,298],{"className":297},[44,82],"−",[23,300,302],{"className":301},[44,82],"3"," above it,\ngiving the characteristic sawtooth of ionization edges.",[118,305,306,124,309,367],{},[121,307,308],{},"Free-free absorption",[23,310,312],{"className":311},[26],[23,313,315],{"className":314,"ariaHidden":31},[30],[23,316,318,321],{"className":317},[35],[23,319],{"className":320,"style":200},[39],[23,322,324,327],{"className":323},[44],[23,325,49],{"className":326},[44,48],[23,328,330],{"className":329},[53],[23,331,333,359],{"className":332},[57,58],[23,334,336,356],{"className":335},[62],[23,337,339],{"className":338,"style":155},[66],[23,340,341,344],{"style":70},[23,342],{"className":343,"style":75},[74],[23,345,347],{"className":346},[79,80,81,82],[23,348,350,353],{"className":349},[44,82],[23,351,238],{"className":352,"style":237},[44,48,82],[23,354,238],{"className":355,"style":237},[44,48,82],[23,357,92],{"className":358},[91],[23,360,362],{"className":361},[62],[23,363,365],{"className":364,"style":248},[66],[23,366],{},"): a free electron passing a nucleus\nabsorbs a photon, the inverse of bremsstrahlung. It requires the third body to\nconserve momentum and operates at all frequencies, contributing everywhere but\nmost in the hot, dense interior.",[118,369,370,124,373,429],{},[121,371,372],{},"Electron scattering",[23,374,376],{"className":375},[26],[23,377,379],{"className":378,"ariaHidden":31},[30],[23,380,382,385],{"className":381},[35],[23,383],{"className":384,"style":40},[39],[23,386,388,391],{"className":387},[44],[23,389,49],{"className":390},[44,48],[23,392,394],{"className":393},[53],[23,395,397,421],{"className":396},[57,58],[23,398,400,418],{"className":399},[62],[23,401,403],{"className":402,"style":67},[66],[23,404,405,408],{"style":70},[23,406],{"className":407,"style":75},[74],[23,409,411],{"className":410},[79,80,81,82],[23,412,414],{"className":413},[44,82],[23,415,417],{"className":416},[44,48,82],"es",[23,419,92],{"className":420},[91],[23,422,424],{"className":423},[62],[23,425,427],{"className":426,"style":99},[66],[23,428],{},"): a photon scatters off a free electron\nby the Thomson process. It removes the photon from the beam without absorbing\nit, is independent of frequency, and dominates at high temperature where the gas\nis fully ionized and few bound electrons remain.",[431,432],"tikz-figure",{"hash":433},"88e4172e2c98c83dd538c879bd34eb66227a4d0f2212d6238281be0732db2b78",[15,435,437],{"id":436},"the-kramers-law","The Kramers law",[11,439,440,441,444],{},"The bound-free and free-free opacities share a temperature and density dependence,\nbecause both scale with the density of absorbers and with the population of\nphotons able to interact. Averaged over frequency, both follow the ",[121,442,443],{},"Kramers\nopacity law",",",[23,446,449],{"className":447},[448],"katex-display",[23,450,452],{"className":451},[26],[23,453,455,523],{"className":454,"ariaHidden":31},[30],[23,456,458,461,510,515,520],{"className":457},[35],[23,459],{"className":460,"style":40},[39],[23,462,464,467],{"className":463},[44],[23,465,49],{"className":466},[44,48],[23,468,470],{"className":469},[53],[23,471,473,502],{"className":472},[57,58],[23,474,476,499],{"className":475},[62],[23,477,480],{"className":478,"style":479},[66],"height:0.3283em;",[23,481,482,485],{"style":70},[23,483],{"className":484,"style":75},[74],[23,486,488],{"className":487},[79,80,81,82],[23,489,491],{"className":490},[44,82],[23,492,495],{"className":493},[44,494,82],"text",[23,496,498],{"className":497},[44,82],"Kramers",[23,500,92],{"className":501},[91],[23,503,505],{"className":504},[62],[23,506,508],{"className":507,"style":99},[66],[23,509],{},[23,511],{"className":512,"style":514},[513],"mspace","margin-right:0.2778em;",[23,516,519],{"className":517},[518],"mrel","∝",[23,521],{"className":522,"style":514},[513],[23,524,526,530,534,538,578],{"className":525},[35],[23,527],{"className":528,"style":529},[39],"height:1.1324em;vertical-align:-0.1944em;",[23,531,533],{"className":532},[44,48],"ρ",[23,535],{"className":536,"style":537},[513],"margin-right:0.1667em;",[23,539,541,546],{"className":540},[44],[23,542,545],{"className":543,"style":544},[44,48],"margin-right:0.1389em;","T",[23,547,549],{"className":548},[53],[23,550,552],{"className":551},[57],[23,553,555],{"className":554},[62],[23,556,559],{"className":557,"style":558},[66],"height:0.938em;",[23,560,562,565],{"style":561},"top:-3.113em;margin-right:0.05em;",[23,563],{"className":564,"style":75},[74],[23,566,568],{"className":567},[79,80,81,82],[23,569,571,574],{"className":570},[44,82],[23,572,298],{"className":573},[44,82],[23,575,577],{"className":576},[44,82],"7\u002F2",[23,579,581],{"className":580},[44],".",[11,583,584,585,581],{},"The steep inverse temperature dependence means opacity falls rapidly as the gas\nheats: hotter gas is more transparent, because ionization removes bound electrons\nand the free-free interaction weakens as electrons move faster past ions. The\nlinear density dependence reflects that both processes need a second particle, an\nion or a nucleus, whose abundance scales with ",[23,586,588],{"className":587},[26],[23,589,591],{"className":590,"ariaHidden":31},[30],[23,592,594,598],{"className":593},[35],[23,595],{"className":596,"style":597},[39],"height:0.625em;vertical-align:-0.1944em;",[23,599,533],{"className":600},[44,48],[11,602,603],{},"Electron scattering has no such dependence. The Thomson cross section is a\nconstant, so its opacity depends only on the number of free electrons per unit\nmass,",[23,605,607],{"className":606},[448],[23,608,610],{"className":609},[26],[23,611,613,672,844,877],{"className":612,"ariaHidden":31},[30],[23,614,616,619,662,665,669],{"className":615},[35],[23,617],{"className":618,"style":40},[39],[23,620,622,625],{"className":621},[44],[23,623,49],{"className":624},[44,48],[23,626,628],{"className":627},[53],[23,629,631,654],{"className":630},[57,58],[23,632,634,651],{"className":633},[62],[23,635,637],{"className":636,"style":67},[66],[23,638,639,642],{"style":70},[23,640],{"className":641,"style":75},[74],[23,643,645],{"className":644},[79,80,81,82],[23,646,648],{"className":647},[44,82],[23,649,417],{"className":650},[44,48,82],[23,652,92],{"className":653},[91],[23,655,657],{"className":656},[62],[23,658,660],{"className":659,"style":99},[66],[23,661],{},[23,663],{"className":664,"style":514},[513],[23,666,668],{"className":667},[518],"=",[23,670],{"className":671,"style":514},[513],[23,673,675,679,835,838,841],{"className":674},[35],[23,676],{"className":677,"style":678},[39],"height:1.988em;vertical-align:-0.8804em;",[23,680,682,687,831],{"className":681},[44],[23,683],{"className":684},[685,686],"mopen","nulldelimiter",[23,688,691],{"className":689},[690],"mfrac",[23,692,694,822],{"className":693},[57,58],[23,695,697,819],{"className":696},[62],[23,698,701,714,725],{"className":699,"style":700},[66],"height:1.1076em;",[23,702,704,708],{"style":703},"top:-2.314em;",[23,705],{"className":706,"style":707},[74],"height:3em;",[23,709,711],{"className":710},[44],[23,712,533],{"className":713},[44,48],[23,715,717,720],{"style":716},"top:-3.23em;",[23,718],{"className":719,"style":707},[74],[23,721],{"className":722,"style":724},[723],"frac-line","border-bottom-width:0.04em;",[23,726,728,731],{"style":727},"top:-3.677em;",[23,729],{"className":730,"style":707},[74],[23,732,734,777],{"className":733},[44],[23,735,737,742],{"className":736},[44],[23,738,741],{"className":739,"style":740},[44,48],"margin-right:0.0359em;","σ",[23,743,745],{"className":744},[53],[23,746,748,769],{"className":747},[57,58],[23,749,751,766],{"className":750},[62],[23,752,754],{"className":753,"style":479},[66],[23,755,757,760],{"style":756},"top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;",[23,758],{"className":759,"style":75},[74],[23,761,763],{"className":762},[79,80,81,82],[23,764,545],{"className":765,"style":544},[44,48,82],[23,767,92],{"className":768},[91],[23,770,772],{"className":771},[62],[23,773,775],{"className":774,"style":99},[66],[23,776],{},[23,778,780,784],{"className":779},[44],[23,781,783],{"className":782},[44,48],"n",[23,785,787],{"className":786},[53],[23,788,790,811],{"className":789},[57,58],[23,791,793,808],{"className":792},[62],[23,794,796],{"className":795,"style":67},[66],[23,797,798,801],{"style":70},[23,799],{"className":800,"style":75},[74],[23,802,804],{"className":803},[79,80,81,82],[23,805,807],{"className":806},[44,48,82],"e",[23,809,92],{"className":810},[91],[23,812,814],{"className":813},[62],[23,815,817],{"className":816,"style":99},[66],[23,818],{},[23,820,92],{"className":821},[91],[23,823,825],{"className":824},[62],[23,826,829],{"className":827,"style":828},[66],"height:0.8804em;",[23,830],{},[23,832],{"className":833},[834,686],"mclose",[23,836],{"className":837,"style":514},[513],[23,839,668],{"className":840},[518],[23,842],{"className":843,"style":514},[513],[23,845,847,851,855,858,862,865,869,874],{"className":846},[35],[23,848],{"className":849,"style":850},[39],"height:1em;vertical-align:-0.25em;",[23,852,854],{"className":853},[44],"0.02",[23,856],{"className":857,"style":537},[513],[23,859,861],{"className":860},[685],"(",[23,863,113],{"className":864},[44],[23,866],{"className":867,"style":868},[513],"margin-right:0.2222em;",[23,870,873],{"className":871},[872],"mbin","+",[23,875],{"className":876,"style":868},[513],[23,878,880,884,889,893,897,932,935,976],{"className":879},[35],[23,881],{"className":882,"style":883},[39],"height:1.1484em;vertical-align:-0.25em;",[23,885,888],{"className":886,"style":887},[44,48],"margin-right:0.0785em;","X",[23,890,892],{"className":891},[834],")",[23,894,896],{"className":895},[513]," ",[23,898,900,907],{"className":899},[44],[23,901,903],{"className":902},[44,494],[23,904,906],{"className":905},[44],"m",[23,908,910],{"className":909},[53],[23,911,913],{"className":912},[57],[23,914,916],{"className":915},[62],[23,917,920],{"className":918,"style":919},[66],"height:0.8641em;",[23,921,922,925],{"style":561},[23,923],{"className":924,"style":75},[74],[23,926,928],{"className":927},[79,80,81,82],[23,929,931],{"className":930},[44,82],"2",[23,933],{"className":934,"style":537},[513],[23,936,938,945],{"className":937},[44],[23,939,941],{"className":940},[44,494],[23,942,944],{"className":943},[44],"kg",[23,946,948],{"className":947},[53],[23,949,951],{"className":950},[57],[23,952,954],{"className":953},[62],[23,955,958],{"className":956,"style":957},[66],"height:0.8984em;",[23,959,961,964],{"style":960},"top:-3.1473em;margin-right:0.05em;",[23,962],{"className":963,"style":75},[74],[23,965,967],{"className":966},[79,80,81,82],[23,968,970,973],{"className":969},[44,82],[23,971,298],{"className":972},[44,82],[23,974,113],{"className":975},[44,82],[23,977,444],{"className":978},[979],"mpunct",[11,981,982,983,999,1000,1052],{},"with ",[23,984,986],{"className":985},[26],[23,987,989],{"className":988,"ariaHidden":31},[30],[23,990,992,996],{"className":991},[35],[23,993],{"className":994,"style":995},[39],"height:0.6833em;",[23,997,888],{"className":998,"style":887},[44,48]," the hydrogen mass fraction and ",[23,1001,1003],{"className":1002},[26],[23,1004,1006],{"className":1005,"ariaHidden":31},[30],[23,1007,1009,1012],{"className":1008},[35],[23,1010],{"className":1011,"style":40},[39],[23,1013,1015,1018],{"className":1014},[44],[23,1016,741],{"className":1017,"style":740},[44,48],[23,1019,1021],{"className":1020},[53],[23,1022,1024,1044],{"className":1023},[57,58],[23,1025,1027,1041],{"className":1026},[62],[23,1028,1030],{"className":1029,"style":479},[66],[23,1031,1032,1035],{"style":756},[23,1033],{"className":1034,"style":75},[74],[23,1036,1038],{"className":1037},[79,80,81,82],[23,1039,545],{"className":1040,"style":544},[44,48,82],[23,1042,92],{"className":1043},[91],[23,1045,1047],{"className":1046},[62],[23,1048,1050],{"className":1049,"style":99},[66],[23,1051],{}," the Thomson cross section. It is\nindependent of frequency, temperature, and density, so it forms a floor beneath\nthe Kramers contribution. Where Kramers opacity has fallen below this floor, in\nthe hot interior, electron scattering dominates and the opacity becomes nearly\nconstant.",[431,1054],{"hash":1055},"c3c365fcf045e54590eda321c4640d431d3629b71fd2d1dc1fedd4b7be536d71",[15,1057,1059],{"id":1058},"the-negative-hydrogen-ion","The negative hydrogen ion",[11,1061,1062,1063,1080,1081,1107,1108,1111,1112,1159,1160,1186,1187,1217,1218,1262,1263],{},"In the cool photospheres of the Sun and less massive stars, temperatures near\n",[23,1064,1066],{"className":1065},[26],[23,1067,1069],{"className":1068,"ariaHidden":31},[30],[23,1070,1072,1076],{"className":1071},[35],[23,1073],{"className":1074,"style":1075},[39],"height:0.6444em;",[23,1077,1079],{"className":1078},[44],"5000","–",[23,1082,1084],{"className":1083},[26],[23,1085,1087],{"className":1086,"ariaHidden":31},[30],[23,1088,1090,1093,1097,1100],{"className":1089},[35],[23,1091],{"className":1092,"style":995},[39],[23,1094,1096],{"className":1095},[44],"6000",[23,1098,896],{"className":1099},[513],[23,1101,1103],{"className":1102},[44,494],[23,1104,1106],{"className":1105},[44],"K"," are too low to keep hydrogen ionized, and the ordinary\nbound-free and free-free hydrogen opacities are weak. The dominant opacity is\ninstead the ",[121,1109,1110],{},"negative hydrogen ion",", ",[23,1113,1115],{"className":1114},[26],[23,1116,1118],{"className":1117,"ariaHidden":31},[30],[23,1119,1121,1125],{"className":1120},[35],[23,1122],{"className":1123,"style":1124},[39],"height:0.8446em;",[23,1126,1128,1135],{"className":1127},[44],[23,1129,1131],{"className":1130},[44,494],[23,1132,1134],{"className":1133},[44],"H",[23,1136,1138],{"className":1137},[53],[23,1139,1141],{"className":1140},[57],[23,1142,1144],{"className":1143},[62],[23,1145,1147],{"className":1146,"style":1124},[66],[23,1148,1150,1153],{"style":1149},"top:-3.1362em;margin-right:0.05em;",[23,1151],{"className":1152,"style":75},[74],[23,1154,1156],{"className":1155},[79,80,81,82],[23,1157,298],{"className":1158},[872,82],": a neutral hydrogen atom\nbinding a second electron with an ionization energy of only ",[23,1161,1163],{"className":1162},[26],[23,1164,1166],{"className":1165,"ariaHidden":31},[30],[23,1167,1169,1172,1176,1179],{"className":1168},[35],[23,1170],{"className":1171,"style":995},[39],[23,1173,1175],{"className":1174},[44],"0.75",[23,1177,896],{"className":1178},[513],[23,1180,1182],{"className":1181},[44,494],[23,1183,1185],{"className":1184},[44],"eV",". The\nloosely held electron is photodetached by any photon with wavelength shorter than\nabout ",[23,1188,1190],{"className":1189},[26],[23,1191,1193],{"className":1192,"ariaHidden":31},[30],[23,1194,1196,1200,1204,1207,1211],{"className":1195},[35],[23,1197],{"className":1198,"style":1199},[39],"height:0.8389em;vertical-align:-0.1944em;",[23,1201,1203],{"className":1202},[44],"1.64",[23,1205,896],{"className":1206},[513],[23,1208,1210],{"className":1209},[44,48],"μ",[23,1212,1214],{"className":1213},[44,494],[23,1215,906],{"className":1216},[44],", so ",[23,1219,1221],{"className":1220},[26],[23,1222,1224],{"className":1223,"ariaHidden":31},[30],[23,1225,1227,1230],{"className":1226},[35],[23,1228],{"className":1229,"style":1124},[39],[23,1231,1233,1239],{"className":1232},[44],[23,1234,1236],{"className":1235},[44,494],[23,1237,1134],{"className":1238},[44],[23,1240,1242],{"className":1241},[53],[23,1243,1245],{"className":1244},[57],[23,1246,1248],{"className":1247},[62],[23,1249,1251],{"className":1250,"style":1124},[66],[23,1252,1253,1256],{"style":1149},[23,1254],{"className":1255,"style":75},[74],[23,1257,1259],{"className":1258},[79,80,81,82],[23,1260,298],{"className":1261},[872,82]," absorbs across the whole visible and\nnear-infrared band.",[104,1264,1265],{},[107,1266,931],{"href":1267,"ariaDescribedBy":1268,"dataFootnoteRef":6,"id":1269},"#user-content-fn-maoz-hminus",[111],"user-content-fnref-maoz-hminus",[11,1271,1272,1273,1317,1318,1362,1363,1391],{},"The extra electrons that form ",[23,1274,1276],{"className":1275},[26],[23,1277,1279],{"className":1278,"ariaHidden":31},[30],[23,1280,1282,1285],{"className":1281},[35],[23,1283],{"className":1284,"style":1124},[39],[23,1286,1288,1294],{"className":1287},[44],[23,1289,1291],{"className":1290},[44,494],[23,1292,1134],{"className":1293},[44],[23,1295,1297],{"className":1296},[53],[23,1298,1300],{"className":1299},[57],[23,1301,1303],{"className":1302},[62],[23,1304,1306],{"className":1305,"style":1124},[66],[23,1307,1308,1311],{"style":1149},[23,1309],{"className":1310,"style":75},[74],[23,1312,1314],{"className":1313},[79,80,81,82],[23,1315,298],{"className":1316},[872,82]," come from the ionization of trace\nmetals with low ionization potentials, so the ",[23,1319,1321],{"className":1320},[26],[23,1322,1324],{"className":1323,"ariaHidden":31},[30],[23,1325,1327,1330],{"className":1326},[35],[23,1328],{"className":1329,"style":1124},[39],[23,1331,1333,1339],{"className":1332},[44],[23,1334,1336],{"className":1335},[44,494],[23,1337,1134],{"className":1338},[44],[23,1340,1342],{"className":1341},[53],[23,1343,1345],{"className":1344},[57],[23,1346,1348],{"className":1347},[62],[23,1349,1351],{"className":1350,"style":1124},[66],[23,1352,1353,1356],{"style":1149},[23,1354],{"className":1355,"style":75},[74],[23,1357,1359],{"className":1358},[79,80,81,82],[23,1360,298],{"className":1361},[872,82]," opacity depends on\nmetal abundance even though the absorber is hydrogen. It is the reason the solar\ncontinuum forms where it does, and its threshold near ",[23,1364,1366],{"className":1365},[26],[23,1367,1369],{"className":1368,"ariaHidden":31},[30],[23,1370,1372,1375,1379,1382,1385],{"className":1371},[35],[23,1373],{"className":1374,"style":1199},[39],[23,1376,1378],{"className":1377},[44],"1.6",[23,1380,896],{"className":1381},[513],[23,1383,1210],{"className":1384},[44,48],[23,1386,1388],{"className":1387},[44,494],[23,1389,906],{"className":1390},[44]," imprints a\nminimum in the continuous opacity that makes the infrared photosphere the deepest\nlayer visible in the Sun.",[431,1393],{"hash":1394},"79a80302ba9dc03d1a0c53879993496eb7665d8223cf757ee45176f9324c7a8f",[15,1396,1398],{"id":1397},"the-rosseland-mean-opacity","The Rosseland mean opacity",[11,1400,1401,1402,1405],{},"A star transports energy at every frequency simultaneously, so the structure\nequations need one representative opacity. The physically correct choice follows\nfrom how radiation diffuses through the deep interior, where the field is nearly\nisotropic and nearly Planckian. In that ",[121,1403,1404],{},"diffusion regime"," the monochromatic\nflux is",[23,1407,1409],{"className":1408},[448],[23,1410,1412],{"className":1411},[26],[23,1413,1415,1473],{"className":1414,"ariaHidden":31},[30],[23,1416,1418,1422,1464,1467,1470],{"className":1417},[35],[23,1419],{"className":1420,"style":1421},[39],"height:0.8333em;vertical-align:-0.15em;",[23,1423,1425,1429],{"className":1424},[44],[23,1426,1428],{"className":1427,"style":544},[44,48],"F",[23,1430,1432],{"className":1431},[53],[23,1433,1435,1456],{"className":1434},[57,58],[23,1436,1438,1453],{"className":1437},[62],[23,1439,1441],{"className":1440,"style":67},[66],[23,1442,1444,1447],{"style":1443},"top:-2.55em;margin-left:-0.1389em;margin-right:0.05em;",[23,1445],{"className":1446,"style":75},[74],[23,1448,1450],{"className":1449},[79,80,81,82],[23,1451,87],{"className":1452,"style":86},[44,48,82],[23,1454,92],{"className":1455},[91],[23,1457,1459],{"className":1458},[62],[23,1460,1462],{"className":1461,"style":99},[66],[23,1463],{},[23,1465],{"className":1466,"style":514},[513],[23,1468,668],{"className":1469},[518],[23,1471],{"className":1472,"style":514},[513],[23,1474,1476,1480,1483,1597,1600,1712,1715,1793],{"className":1475},[35],[23,1477],{"className":1478,"style":1479},[39],"height:2.2519em;vertical-align:-0.8804em;",[23,1481,298],{"className":1482},[44],[23,1484,1486,1489,1594],{"className":1485},[44],[23,1487],{"className":1488},[685,686],[23,1490,1492],{"className":1491},[690],[23,1493,1495,1586],{"className":1494},[57,58],[23,1496,1498,1583],{"className":1497},[62],[23,1499,1502,1559,1567],{"className":1500,"style":1501},[66],"height:1.3214em;",[23,1503,1504,1507],{"style":703},[23,1505],{"className":1506,"style":707},[74],[23,1508,1510,1513,1516,1556],{"className":1509},[44],[23,1511,302],{"className":1512},[44],[23,1514],{"className":1515,"style":537},[513],[23,1517,1519,1522],{"className":1518},[44],[23,1520,49],{"className":1521},[44,48],[23,1523,1525],{"className":1524},[53],[23,1526,1528,1548],{"className":1527},[57,58],[23,1529,1531,1545],{"className":1530},[62],[23,1532,1534],{"className":1533,"style":67},[66],[23,1535,1536,1539],{"style":70},[23,1537],{"className":1538,"style":75},[74],[23,1540,1542],{"className":1541},[79,80,81,82],[23,1543,87],{"className":1544,"style":86},[44,48,82],[23,1546,92],{"className":1547},[91],[23,1549,1551],{"className":1550},[62],[23,1552,1554],{"className":1553,"style":99},[66],[23,1555],{},[23,1557,533],{"className":1558},[44,48],[23,1560,1561,1564],{"style":716},[23,1562],{"className":1563,"style":707},[74],[23,1565],{"className":1566,"style":724},[723],[23,1568,1569,1572],{"style":727},[23,1570],{"className":1571,"style":707},[74],[23,1573,1575,1579],{"className":1574},[44],[23,1576,1578],{"className":1577},[44],"4",[23,1580,1582],{"className":1581,"style":740},[44,48],"π",[23,1584,92],{"className":1585},[91],[23,1587,1589],{"className":1588},[62],[23,1590,1592],{"className":1591,"style":828},[66],[23,1593],{},[23,1595],{"className":1596},[834,686],[23,1598],{"className":1599,"style":537},[513],[23,1601,1603,1606,1709],{"className":1602},[44],[23,1604],{"className":1605},[685,686],[23,1607,1609],{"className":1608},[690],[23,1610,1612,1700],{"className":1611},[57,58],[23,1613,1615,1697],{"className":1614},[62],[23,1616,1619,1635,1643],{"className":1617,"style":1618},[66],"height:1.3714em;",[23,1620,1621,1624],{"style":703},[23,1622],{"className":1623,"style":707},[74],[23,1625,1627,1632],{"className":1626},[44],[23,1628,1631],{"className":1629,"style":1630},[44],"margin-right:0.0556em;","∂",[23,1633,545],{"className":1634,"style":544},[44,48],[23,1636,1637,1640],{"style":716},[23,1638],{"className":1639,"style":707},[74],[23,1641],{"className":1642,"style":724},[723],[23,1644,1645,1648],{"style":727},[23,1646],{"className":1647,"style":707},[74],[23,1649,1651,1654],{"className":1650},[44],[23,1652,1631],{"className":1653,"style":1630},[44],[23,1655,1657,1662],{"className":1656},[44],[23,1658,1661],{"className":1659,"style":1660},[44,48],"margin-right:0.0502em;","B",[23,1663,1665],{"className":1664},[53],[23,1666,1668,1689],{"className":1667},[57,58],[23,1669,1671,1686],{"className":1670},[62],[23,1672,1674],{"className":1673,"style":67},[66],[23,1675,1677,1680],{"style":1676},"top:-2.55em;margin-left:-0.0502em;margin-right:0.05em;",[23,1678],{"className":1679,"style":75},[74],[23,1681,1683],{"className":1682},[79,80,81,82],[23,1684,87],{"className":1685,"style":86},[44,48,82],[23,1687,92],{"className":1688},[91],[23,1690,1692],{"className":1691},[62],[23,1693,1695],{"className":1694,"style":99},[66],[23,1696],{},[23,1698,92],{"className":1699},[91],[23,1701,1703],{"className":1702},[62],[23,1704,1707],{"className":1705,"style":1706},[66],"height:0.686em;",[23,1708],{},[23,1710],{"className":1711},[834,686],[23,1713],{"className":1714,"style":537},[513],[23,1716,1718,1721,1790],{"className":1717},[44],[23,1719],{"className":1720},[685,686],[23,1722,1724],{"className":1723},[690],[23,1725,1727,1782],{"className":1726},[57,58],[23,1728,1730,1779],{"className":1729},[62],[23,1731,1733,1754,1762],{"className":1732,"style":1618},[66],[23,1734,1735,1738],{"style":703},[23,1736],{"className":1737,"style":707},[74],[23,1739,1741,1744,1749],{"className":1740},[44],[23,1742],{"className":1743,"style":537},[513],[23,1745,1748],{"className":1746},[44,1747],"mathbf","d",[23,1750,1753],{"className":1751,"style":1752},[44,48],"margin-right:0.0278em;","r",[23,1755,1756,1759],{"style":716},[23,1757],{"className":1758,"style":707},[74],[23,1760],{"className":1761,"style":724},[723],[23,1763,1764,1767],{"style":727},[23,1765],{"className":1766,"style":707},[74],[23,1768,1770,1773,1776],{"className":1769},[44],[23,1771],{"className":1772,"style":537},[513],[23,1774,1748],{"className":1775},[44,1747],[23,1777,545],{"className":1778,"style":544},[44,48],[23,1780,92],{"className":1781},[91],[23,1783,1785],{"className":1784},[62],[23,1786,1788],{"className":1787,"style":1706},[66],[23,1789],{},[23,1791],{"className":1792},[834,686],[23,1794,581],{"className":1795},[44],[11,1797,1798,1799,1855],{},"The key feature is the factor ",[23,1800,1802],{"className":1801},[26],[23,1803,1805],{"className":1804,"ariaHidden":31},[30],[23,1806,1808,1811,1815],{"className":1807},[35],[23,1809],{"className":1810,"style":850},[39],[23,1812,1814],{"className":1813},[44],"1\u002F",[23,1816,1818,1821],{"className":1817},[44],[23,1819,49],{"className":1820},[44,48],[23,1822,1824],{"className":1823},[53],[23,1825,1827,1847],{"className":1826},[57,58],[23,1828,1830,1844],{"className":1829},[62],[23,1831,1833],{"className":1832,"style":67},[66],[23,1834,1835,1838],{"style":70},[23,1836],{"className":1837,"style":75},[74],[23,1839,1841],{"className":1840},[79,80,81,82],[23,1842,87],{"className":1843,"style":86},[44,48,82],[23,1845,92],{"className":1846},[91],[23,1848,1850],{"className":1849},[62],[23,1851,1853],{"className":1852,"style":99},[66],[23,1854],{},": the flux at each frequency is\ninversely proportional to the opacity there, so transparent frequencies carry the\nmost energy. Integrating over frequency to get the total flux,",[23,1857,1859],{"className":1858},[448],[23,1860,1862],{"className":1861},[26],[23,1863,1865,1883],{"className":1864,"ariaHidden":31},[30],[23,1866,1868,1871,1874,1877,1880],{"className":1867},[35],[23,1869],{"className":1870,"style":995},[39],[23,1872,1428],{"className":1873,"style":544},[44,48],[23,1875],{"className":1876,"style":514},[513],[23,1878,668],{"className":1879},[518],[23,1881],{"className":1882,"style":514},[513],[23,1884,1886,1890,1893,1961,1964,2038,2041,2110,2113,2213,2216,2321,2324,2327,2330,2333],{"className":1885},[35],[23,1887],{"className":1888,"style":1889},[39],"height:3.5408em;vertical-align:-1.5782em;",[23,1891,298],{"className":1892},[44],[23,1894,1896,1899,1958],{"className":1895},[44],[23,1897],{"className":1898},[685,686],[23,1900,1902],{"className":1901},[690],[23,1903,1905,1950],{"className":1904},[57,58],[23,1906,1908,1947],{"className":1907},[62],[23,1909,1911,1925,1933],{"className":1910,"style":1501},[66],[23,1912,1913,1916],{"style":703},[23,1914],{"className":1915,"style":707},[74],[23,1917,1919,1922],{"className":1918},[44],[23,1920,302],{"className":1921},[44],[23,1923,533],{"className":1924},[44,48],[23,1926,1927,1930],{"style":716},[23,1928],{"className":1929,"style":707},[74],[23,1931],{"className":1932,"style":724},[723],[23,1934,1935,1938],{"style":727},[23,1936],{"className":1937,"style":707},[74],[23,1939,1941,1944],{"className":1940},[44],[23,1942,1578],{"className":1943},[44],[23,1945,1582],{"className":1946,"style":740},[44,48],[23,1948,92],{"className":1949},[91],[23,1951,1953],{"className":1952},[62],[23,1954,1956],{"className":1955,"style":828},[66],[23,1957],{},[23,1959],{"className":1960},[834,686],[23,1962],{"className":1963,"style":537},[513],[23,1965,1967,1970,2035],{"className":1966},[44],[23,1968],{"className":1969},[685,686],[23,1971,1973],{"className":1972},[690],[23,1974,1976,2027],{"className":1975},[57,58],[23,1977,1979,2024],{"className":1978},[62],[23,1980,1982,1999,2007],{"className":1981,"style":1618},[66],[23,1983,1984,1987],{"style":703},[23,1985],{"className":1986,"style":707},[74],[23,1988,1990,1993,1996],{"className":1989},[44],[23,1991],{"className":1992,"style":537},[513],[23,1994,1748],{"className":1995},[44,1747],[23,1997,1753],{"className":1998,"style":1752},[44,48],[23,2000,2001,2004],{"style":716},[23,2002],{"className":2003,"style":707},[74],[23,2005],{"className":2006,"style":724},[723],[23,2008,2009,2012],{"style":727},[23,2010],{"className":2011,"style":707},[74],[23,2013,2015,2018,2021],{"className":2014},[44],[23,2016],{"className":2017,"style":537},[513],[23,2019,1748],{"className":2020},[44,1747],[23,2022,545],{"className":2023,"style":544},[44,48],[23,2025,92],{"className":2026},[91],[23,2028,2030],{"className":2029},[62],[23,2031,2033],{"className":2032,"style":1706},[66],[23,2034],{},[23,2036],{"className":2037},[834,686],[23,2039],{"className":2040,"style":537},[513],[23,2042,2046],{"className":2043},[2044,2045],"mop","op-limits",[23,2047,2049,2101],{"className":2048},[57,58],[23,2050,2052,2098],{"className":2051},[62],[23,2053,2056,2070,2085],{"className":2054,"style":2055},[66],"height:1.9625em;",[23,2057,2059,2063],{"style":2058},"top:-1.8818em;margin-left:-0.4445em;",[23,2060],{"className":2061,"style":2062},[74],"height:3.36em;",[23,2064,2066],{"className":2065},[79,80,81,82],[23,2067,2069],{"className":2068},[44,82],"0",[23,2071,2073,2076],{"style":2072},"top:-3.3611em;",[23,2074],{"className":2075,"style":2062},[74],[23,2077,2078],{},[23,2079,2084],{"className":2080,"style":2083},[2044,2081,2082],"op-symbol","large-op","margin-right:0.4445em;","∫",[23,2086,2088,2091],{"style":2087},"top:-4.9211em;margin-left:0.4445em;",[23,2089],{"className":2090,"style":2062},[74],[23,2092,2094],{"className":2093},[79,80,81,82],[23,2095,2097],{"className":2096},[44,82],"∞",[23,2099,92],{"className":2100},[91],[23,2102,2104],{"className":2103},[62],[23,2105,2108],{"className":2106,"style":2107},[66],"height:1.5782em;",[23,2109],{},[23,2111],{"className":2112,"style":537},[513],[23,2114,2116,2119,2210],{"className":2115},[44],[23,2117],{"className":2118},[685,686],[23,2120,2122],{"className":2121},[690],[23,2123,2125,2201],{"className":2124},[57,58],[23,2126,2128,2198],{"className":2127},[62],[23,2129,2131,2179,2187],{"className":2130,"style":1501},[66],[23,2132,2133,2136],{"style":703},[23,2134],{"className":2135,"style":707},[74],[23,2137,2139],{"className":2138},[44],[23,2140,2142,2145],{"className":2141},[44],[23,2143,49],{"className":2144},[44,48],[23,2146,2148],{"className":2147},[53],[23,2149,2151,2171],{"className":2150},[57,58],[23,2152,2154,2168],{"className":2153},[62],[23,2155,2157],{"className":2156,"style":67},[66],[23,2158,2159,2162],{"style":70},[23,2160],{"className":2161,"style":75},[74],[23,2163,2165],{"className":2164},[79,80,81,82],[23,2166,87],{"className":2167,"style":86},[44,48,82],[23,2169,92],{"className":2170},[91],[23,2172,2174],{"className":2173},[62],[23,2175,2177],{"className":2176,"style":99},[66],[23,2178],{},[23,2180,2181,2184],{"style":716},[23,2182],{"className":2183,"style":707},[74],[23,2185],{"className":2186,"style":724},[723],[23,2188,2189,2192],{"style":727},[23,2190],{"className":2191,"style":707},[74],[23,2193,2195],{"className":2194},[44],[23,2196,113],{"className":2197},[44],[23,2199,92],{"className":2200},[91],[23,2202,2204],{"className":2203},[62],[23,2205,2208],{"className":2206,"style":2207},[66],"height:0.836em;",[23,2209],{},[23,2211],{"className":2212},[834,686],[23,2214],{"className":2215,"style":537},[513],[23,2217,2219,2222,2318],{"className":2218},[44],[23,2220],{"className":2221},[685,686],[23,2223,2225],{"className":2224},[690],[23,2226,2228,2310],{"className":2227},[57,58],[23,2229,2231,2307],{"className":2230},[62],[23,2232,2234,2248,2256],{"className":2233,"style":1618},[66],[23,2235,2236,2239],{"style":703},[23,2237],{"className":2238,"style":707},[74],[23,2240,2242,2245],{"className":2241},[44],[23,2243,1631],{"className":2244,"style":1630},[44],[23,2246,545],{"className":2247,"style":544},[44,48],[23,2249,2250,2253],{"style":716},[23,2251],{"className":2252,"style":707},[74],[23,2254],{"className":2255,"style":724},[723],[23,2257,2258,2261],{"style":727},[23,2259],{"className":2260,"style":707},[74],[23,2262,2264,2267],{"className":2263},[44],[23,2265,1631],{"className":2266,"style":1630},[44],[23,2268,2270,2273],{"className":2269},[44],[23,2271,1661],{"className":2272,"style":1660},[44,48],[23,2274,2276],{"className":2275},[53],[23,2277,2279,2299],{"className":2278},[57,58],[23,2280,2282,2296],{"className":2281},[62],[23,2283,2285],{"className":2284,"style":67},[66],[23,2286,2287,2290],{"style":1676},[23,2288],{"className":2289,"style":75},[74],[23,2291,2293],{"className":2292},[79,80,81,82],[23,2294,87],{"className":2295,"style":86},[44,48,82],[23,2297,92],{"className":2298},[91],[23,2300,2302],{"className":2301},[62],[23,2303,2305],{"className":2304,"style":99},[66],[23,2306],{},[23,2308,92],{"className":2309},[91],[23,2311,2313],{"className":2312},[62],[23,2314,2316],{"className":2315,"style":1706},[66],[23,2317],{},[23,2319],{"className":2320},[834,686],[23,2322],{"className":2323,"style":537},[513],[23,2325],{"className":2326,"style":537},[513],[23,2328,1748],{"className":2329},[44,1747],[23,2331,87],{"className":2332,"style":86},[44,48],[23,2334,581],{"className":2335},[44],[11,2337,2338,2339,2342,2343,2432],{},"The ",[121,2340,2341],{},"Rosseland mean opacity"," ",[23,2344,2346],{"className":2345},[26],[23,2347,2349],{"className":2348,"ariaHidden":31},[30],[23,2350,2352,2356],{"className":2351},[35],[23,2353],{"className":2354,"style":2355},[39],"height:0.7178em;vertical-align:-0.15em;",[23,2357,2359,2396],{"className":2358},[44],[23,2360,2363],{"className":2361},[44,2362],"accent",[23,2364,2366],{"className":2365},[57],[23,2367,2369],{"className":2368},[62],[23,2370,2373,2382],{"className":2371,"style":2372},[66],"height:0.5678em;",[23,2374,2376,2379],{"style":2375},"top:-3em;",[23,2377],{"className":2378,"style":707},[74],[23,2380,49],{"className":2381},[44,48],[23,2383,2384,2387],{"style":2375},[23,2385],{"className":2386,"style":707},[74],[23,2388,2392],{"className":2389,"style":2391},[2390],"accent-body","left:-0.25em;",[23,2393,2395],{"className":2394},[44],"ˉ",[23,2397,2399],{"className":2398},[53],[23,2400,2402,2424],{"className":2401},[57,58],[23,2403,2405,2421],{"className":2404},[62],[23,2406,2408],{"className":2407,"style":479},[66],[23,2409,2410,2413],{"style":70},[23,2411],{"className":2412,"style":75},[74],[23,2414,2416],{"className":2415},[79,80,81,82],[23,2417,2420],{"className":2418,"style":2419},[44,48,82],"margin-right:0.0077em;","R",[23,2422,92],{"className":2423},[91],[23,2425,2427],{"className":2426},[62],[23,2428,2430],{"className":2429,"style":99},[66],[23,2431],{}," is defined so that the total flux\ntakes the same form with a single opacity,",[23,2434,2436],{"className":2435},[448],[23,2437,2439],{"className":2438},[26],[23,2440,2442,2585],{"className":2441,"ariaHidden":31},[30],[23,2443,2445,2449,2576,2579,2582],{"className":2444},[35],[23,2446],{"className":2447,"style":2448},[39],"height:2.1574em;vertical-align:-0.836em;",[23,2450,2452,2455,2573],{"className":2451},[44],[23,2453],{"className":2454},[685,686],[23,2456,2458],{"className":2457},[690],[23,2459,2461,2565],{"className":2460},[57,58],[23,2462,2464,2562],{"className":2463},[62],[23,2465,2467,2543,2551],{"className":2466,"style":1501},[66],[23,2468,2469,2472],{"style":703},[23,2470],{"className":2471,"style":707},[74],[23,2473,2475],{"className":2474},[44],[23,2476,2478,2509],{"className":2477},[44],[23,2479,2481],{"className":2480},[44,2362],[23,2482,2484],{"className":2483},[57],[23,2485,2487],{"className":2486},[62],[23,2488,2490,2498],{"className":2489,"style":2372},[66],[23,2491,2492,2495],{"style":2375},[23,2493],{"className":2494,"style":707},[74],[23,2496,49],{"className":2497},[44,48],[23,2499,2500,2503],{"style":2375},[23,2501],{"className":2502,"style":707},[74],[23,2504,2506],{"className":2505,"style":2391},[2390],[23,2507,2395],{"className":2508},[44],[23,2510,2512],{"className":2511},[53],[23,2513,2515,2535],{"className":2514},[57,58],[23,2516,2518,2532],{"className":2517},[62],[23,2519,2521],{"className":2520,"style":479},[66],[23,2522,2523,2526],{"style":70},[23,2524],{"className":2525,"style":75},[74],[23,2527,2529],{"className":2528},[79,80,81,82],[23,2530,2420],{"className":2531,"style":2419},[44,48,82],[23,2533,92],{"className":2534},[91],[23,2536,2538],{"className":2537},[62],[23,2539,2541],{"className":2540,"style":99},[66],[23,2542],{},[23,2544,2545,2548],{"style":716},[23,2546],{"className":2547,"style":707},[74],[23,2549],{"className":2550,"style":724},[723],[23,2552,2553,2556],{"style":727},[23,2554],{"className":2555,"style":707},[74],[23,2557,2559],{"className":2558},[44],[23,2560,113],{"className":2561},[44],[23,2563,92],{"className":2564},[91],[23,2566,2568],{"className":2567},[62],[23,2569,2571],{"className":2570,"style":2207},[66],[23,2572],{},[23,2574],{"className":2575},[834,686],[23,2577],{"className":2578,"style":514},[513],[23,2580,668],{"className":2581},[518],[23,2583],{"className":2584,"style":514},[513],[23,2586,2588,2592,3106],{"className":2587},[35],[23,2589],{"className":2590,"style":2591},[39],"height:7.3615em;vertical-align:-3.4308em;",[23,2593,2595,2598,3103],{"className":2594},[44],[23,2596],{"className":2597},[685,686],[23,2599,2601],{"className":2600},[690],[23,2602,2604,3094],{"className":2603},[57,58],[23,2605,2607,3091],{"className":2606},[62],[23,2608,2611,2796,2805],{"className":2609,"style":2610},[66],"height:3.9308em;",[23,2612,2614,2618],{"style":2613},"top:-2.11em;",[23,2615],{"className":2616,"style":2617},[74],"height:3.9625em;",[23,2619,2621,2676,2679,2784,2787,2790,2793],{"className":2620},[44],[23,2622,2624],{"className":2623},[2044,2045],[23,2625,2627,2668],{"className":2626},[57,58],[23,2628,2630,2665],{"className":2629},[62],[23,2631,2633,2644,2654],{"className":2632,"style":2055},[66],[23,2634,2635,2638],{"style":2058},[23,2636],{"className":2637,"style":2062},[74],[23,2639,2641],{"className":2640},[79,80,81,82],[23,2642,2069],{"className":2643},[44,82],[23,2645,2646,2649],{"style":2072},[23,2647],{"className":2648,"style":2062},[74],[23,2650,2651],{},[23,2652,2084],{"className":2653,"style":2083},[2044,2081,2082],[23,2655,2656,2659],{"style":2087},[23,2657],{"className":2658,"style":2062},[74],[23,2660,2662],{"className":2661},[79,80,81,82],[23,2663,2097],{"className":2664},[44,82],[23,2666,92],{"className":2667},[91],[23,2669,2671],{"className":2670},[62],[23,2672,2674],{"className":2673,"style":2107},[66],[23,2675],{},[23,2677],{"className":2678,"style":537},[513],[23,2680,2682,2685,2781],{"className":2681},[44],[23,2683],{"className":2684},[685,686],[23,2686,2688],{"className":2687},[690],[23,2689,2691,2773],{"className":2690},[57,58],[23,2692,2694,2770],{"className":2693},[62],[23,2695,2697,2711,2719],{"className":2696,"style":1618},[66],[23,2698,2699,2702],{"style":703},[23,2700],{"className":2701,"style":707},[74],[23,2703,2705,2708],{"className":2704},[44],[23,2706,1631],{"className":2707,"style":1630},[44],[23,2709,545],{"className":2710,"style":544},[44,48],[23,2712,2713,2716],{"style":716},[23,2714],{"className":2715,"style":707},[74],[23,2717],{"className":2718,"style":724},[723],[23,2720,2721,2724],{"style":727},[23,2722],{"className":2723,"style":707},[74],[23,2725,2727,2730],{"className":2726},[44],[23,2728,1631],{"className":2729,"style":1630},[44],[23,2731,2733,2736],{"className":2732},[44],[23,2734,1661],{"className":2735,"style":1660},[44,48],[23,2737,2739],{"className":2738},[53],[23,2740,2742,2762],{"className":2741},[57,58],[23,2743,2745,2759],{"className":2744},[62],[23,2746,2748],{"className":2747,"style":67},[66],[23,2749,2750,2753],{"style":1676},[23,2751],{"className":2752,"style":75},[74],[23,2754,2756],{"className":2755},[79,80,81,82],[23,2757,87],{"className":2758,"style":86},[44,48,82],[23,2760,92],{"className":2761},[91],[23,2763,2765],{"className":2764},[62],[23,2766,2768],{"className":2767,"style":99},[66],[23,2769],{},[23,2771,92],{"className":2772},[91],[23,2774,2776],{"className":2775},[62],[23,2777,2779],{"className":2778,"style":1706},[66],[23,2780],{},[23,2782],{"className":2783},[834,686],[23,2785],{"className":2786,"style":537},[513],[23,2788],{"className":2789,"style":537},[513],[23,2791,1748],{"className":2792},[44,1747],[23,2794,87],{"className":2795,"style":86},[44,48],[23,2797,2799,2802],{"style":2798},"top:-4.1925em;",[23,2800],{"className":2801,"style":2617},[74],[23,2803],{"className":2804,"style":724},[723],[23,2806,2808,2811],{"style":2807},"top:-5.9308em;",[23,2809],{"className":2810,"style":2617},[74],[23,2812,2814,2869,2872,2971,2974,3079,3082,3085,3088],{"className":2813},[44],[23,2815,2817],{"className":2816},[2044,2045],[23,2818,2820,2861],{"className":2819},[57,58],[23,2821,2823,2858],{"className":2822},[62],[23,2824,2826,2837,2847],{"className":2825,"style":2055},[66],[23,2827,2828,2831],{"style":2058},[23,2829],{"className":2830,"style":2062},[74],[23,2832,2834],{"className":2833},[79,80,81,82],[23,2835,2069],{"className":2836},[44,82],[23,2838,2839,2842],{"style":2072},[23,2840],{"className":2841,"style":2062},[74],[23,2843,2844],{},[23,2845,2084],{"className":2846,"style":2083},[2044,2081,2082],[23,2848,2849,2852],{"style":2087},[23,2850],{"className":2851,"style":2062},[74],[23,2853,2855],{"className":2854},[79,80,81,82],[23,2856,2097],{"className":2857},[44,82],[23,2859,92],{"className":2860},[91],[23,2862,2864],{"className":2863},[62],[23,2865,2867],{"className":2866,"style":2107},[66],[23,2868],{},[23,2870],{"className":2871,"style":537},[513],[23,2873,2875,2878,2968],{"className":2874},[44],[23,2876],{"className":2877},[685,686],[23,2879,2881],{"className":2880},[690],[23,2882,2884,2960],{"className":2883},[57,58],[23,2885,2887,2957],{"className":2886},[62],[23,2888,2890,2938,2946],{"className":2889,"style":1501},[66],[23,2891,2892,2895],{"style":703},[23,2893],{"className":2894,"style":707},[74],[23,2896,2898],{"className":2897},[44],[23,2899,2901,2904],{"className":2900},[44],[23,2902,49],{"className":2903},[44,48],[23,2905,2907],{"className":2906},[53],[23,2908,2910,2930],{"className":2909},[57,58],[23,2911,2913,2927],{"className":2912},[62],[23,2914,2916],{"className":2915,"style":67},[66],[23,2917,2918,2921],{"style":70},[23,2919],{"className":2920,"style":75},[74],[23,2922,2924],{"className":2923},[79,80,81,82],[23,2925,87],{"className":2926,"style":86},[44,48,82],[23,2928,92],{"className":2929},[91],[23,2931,2933],{"className":2932},[62],[23,2934,2936],{"className":2935,"style":99},[66],[23,2937],{},[23,2939,2940,2943],{"style":716},[23,2941],{"className":2942,"style":707},[74],[23,2944],{"className":2945,"style":724},[723],[23,2947,2948,2951],{"style":727},[23,2949],{"className":2950,"style":707},[74],[23,2952,2954],{"className":2953},[44],[23,2955,113],{"className":2956},[44],[23,2958,92],{"className":2959},[91],[23,2961,2963],{"className":2962},[62],[23,2964,2966],{"className":2965,"style":2207},[66],[23,2967],{},[23,2969],{"className":2970},[834,686],[23,2972],{"className":2973,"style":537},[513],[23,2975,2977,2980,3076],{"className":2976},[44],[23,2978],{"className":2979},[685,686],[23,2981,2983],{"className":2982},[690],[23,2984,2986,3068],{"className":2985},[57,58],[23,2987,2989,3065],{"className":2988},[62],[23,2990,2992,3006,3014],{"className":2991,"style":1618},[66],[23,2993,2994,2997],{"style":703},[23,2995],{"className":2996,"style":707},[74],[23,2998,3000,3003],{"className":2999},[44],[23,3001,1631],{"className":3002,"style":1630},[44],[23,3004,545],{"className":3005,"style":544},[44,48],[23,3007,3008,3011],{"style":716},[23,3009],{"className":3010,"style":707},[74],[23,3012],{"className":3013,"style":724},[723],[23,3015,3016,3019],{"style":727},[23,3017],{"className":3018,"style":707},[74],[23,3020,3022,3025],{"className":3021},[44],[23,3023,1631],{"className":3024,"style":1630},[44],[23,3026,3028,3031],{"className":3027},[44],[23,3029,1661],{"className":3030,"style":1660},[44,48],[23,3032,3034],{"className":3033},[53],[23,3035,3037,3057],{"className":3036},[57,58],[23,3038,3040,3054],{"className":3039},[62],[23,3041,3043],{"className":3042,"style":67},[66],[23,3044,3045,3048],{"style":1676},[23,3046],{"className":3047,"style":75},[74],[23,3049,3051],{"className":3050},[79,80,81,82],[23,3052,87],{"className":3053,"style":86},[44,48,82],[23,3055,92],{"className":3056},[91],[23,3058,3060],{"className":3059},[62],[23,3061,3063],{"className":3062,"style":99},[66],[23,3064],{},[23,3066,92],{"className":3067},[91],[23,3069,3071],{"className":3070},[62],[23,3072,3074],{"className":3073,"style":1706},[66],[23,3075],{},[23,3077],{"className":3078},[834,686],[23,3080],{"className":3081,"style":537},[513],[23,3083],{"className":3084,"style":537},[513],[23,3086,1748],{"className":3087},[44,1747],[23,3089,87],{"className":3090,"style":86},[44,48],[23,3092,92],{"className":3093},[91],[23,3095,3097],{"className":3096},[62],[23,3098,3101],{"className":3099,"style":3100},[66],"height:3.4308em;",[23,3102],{},[23,3104],{"className":3105},[834,686],[23,3107,581],{"className":3108},[44],[11,3110,3111,3112,3115,3116,3196,3197,3262,3263,3348,3349],{},"It is a ",[121,3113,3114],{},"harmonic mean",": the reciprocal of the opacity is averaged, not the\nopacity itself. The average therefore weights toward the frequencies of lowest\nopacity, the transparent windows, because those are the frequencies through which\nthe flux leaks. A narrow transparent band lowers ",[23,3117,3119],{"className":3118},[26],[23,3120,3122],{"className":3121,"ariaHidden":31},[30],[23,3123,3125,3128],{"className":3124},[35],[23,3126],{"className":3127,"style":2355},[39],[23,3129,3131,3162],{"className":3130},[44],[23,3132,3134],{"className":3133},[44,2362],[23,3135,3137],{"className":3136},[57],[23,3138,3140],{"className":3139},[62],[23,3141,3143,3151],{"className":3142,"style":2372},[66],[23,3144,3145,3148],{"style":2375},[23,3146],{"className":3147,"style":707},[74],[23,3149,49],{"className":3150},[44,48],[23,3152,3153,3156],{"style":2375},[23,3154],{"className":3155,"style":707},[74],[23,3157,3159],{"className":3158,"style":2391},[2390],[23,3160,2395],{"className":3161},[44],[23,3163,3165],{"className":3164},[53],[23,3166,3168,3188],{"className":3167},[57,58],[23,3169,3171,3185],{"className":3170},[62],[23,3172,3174],{"className":3173,"style":479},[66],[23,3175,3176,3179],{"style":70},[23,3177],{"className":3178,"style":75},[74],[23,3180,3182],{"className":3181},[79,80,81,82],[23,3183,2420],{"className":3184,"style":2419},[44,48,82],[23,3186,92],{"className":3187},[91],[23,3189,3191],{"className":3190},[62],[23,3192,3194],{"className":3193,"style":99},[66],[23,3195],{}," far more than a\nnarrow opaque line raises it, since energy simply routes around the opaque line\nthrough the transparent continuum. The weighting function ",[23,3198,3200],{"className":3199},[26],[23,3201,3203],{"className":3202,"ariaHidden":31},[30],[23,3204,3206,3209,3212,3252,3256,3259],{"className":3205},[35],[23,3207],{"className":3208,"style":850},[39],[23,3210,1631],{"className":3211,"style":1630},[44],[23,3213,3215,3218],{"className":3214},[44],[23,3216,1661],{"className":3217,"style":1660},[44,48],[23,3219,3221],{"className":3220},[53],[23,3222,3224,3244],{"className":3223},[57,58],[23,3225,3227,3241],{"className":3226},[62],[23,3228,3230],{"className":3229,"style":67},[66],[23,3231,3232,3235],{"style":1676},[23,3233],{"className":3234,"style":75},[74],[23,3236,3238],{"className":3237},[79,80,81,82],[23,3239,87],{"className":3240,"style":86},[44,48,82],[23,3242,92],{"className":3243},[91],[23,3245,3247],{"className":3246},[62],[23,3248,3250],{"className":3249,"style":99},[66],[23,3251],{},[23,3253,3255],{"className":3254},[44],"\u002F",[23,3257,1631],{"className":3258,"style":1630},[44],[23,3260,545],{"className":3261,"style":544},[44,48],"\npeaks somewhat blueward of the Planck peak and its total integral is\n",[23,3264,3266],{"className":3265},[26],[23,3267,3269,3299],{"className":3268,"ariaHidden":31},[30],[23,3270,3272,3275,3278,3281,3284,3287,3290,3293,3296],{"className":3271},[35],[23,3273],{"className":3274,"style":850},[39],[23,3276,1631],{"className":3277,"style":1630},[44],[23,3279,1661],{"className":3280,"style":1660},[44,48],[23,3282,3255],{"className":3283},[44],[23,3285,1631],{"className":3286,"style":1630},[44],[23,3288,545],{"className":3289,"style":544},[44,48],[23,3291],{"className":3292,"style":514},[513],[23,3294,668],{"className":3295},[518],[23,3297],{"className":3298,"style":514},[513],[23,3300,3302,3306,3309,3313,3342,3345],{"className":3301},[35],[23,3303],{"className":3304,"style":3305},[39],"height:1.0641em;vertical-align:-0.25em;",[23,3307,107],{"className":3308},[44,48],[23,3310,3312],{"className":3311},[44,48],"c",[23,3314,3316,3319],{"className":3315},[44],[23,3317,545],{"className":3318,"style":544},[44,48],[23,3320,3322],{"className":3321},[53],[23,3323,3325],{"className":3324},[57],[23,3326,3328],{"className":3327},[62],[23,3329,3331],{"className":3330,"style":264},[66],[23,3332,3333,3336],{"style":285},[23,3334],{"className":3335,"style":75},[74],[23,3337,3339],{"className":3338},[79,80,81,82],[23,3340,302],{"className":3341},[44,82],[23,3343,3255],{"className":3344},[44],[23,3346,1582],{"className":3347,"style":740},[44,48],", from the Stefan-Boltzmann law.",[104,3350,3351],{},[107,3352,302],{"href":3353,"ariaDescribedBy":3354,"dataFootnoteRef":6,"id":3355},"#user-content-fn-bob-rosseland",[111],"user-content-fnref-bob-rosseland",[431,3357],{"hash":3358},"a4f838ac3160af04868c5784e57e1946808221e87f8040135fdd51edf85cc256",[15,3360,3362],{"id":3361},"opacity-and-the-temperature-gradient","Opacity and the temperature gradient",[11,3364,3365,3366,3369],{},"Solving the diffusion relation for the temperature gradient gives the\n",[121,3367,3368],{},"radiative temperature gradient"," a star must have to carry its luminosity by\nradiation alone,",[23,3371,3373],{"className":3372},[448],[23,3374,3376],{"className":3375},[26],[23,3377,3379,3535],{"className":3378,"ariaHidden":31},[30],[23,3380,3382,3386,3526,3529,3532],{"className":3381},[35],[23,3383],{"className":3384,"style":3385},[39],"height:2.4497em;vertical-align:-0.9997em;",[23,3387,3390,3482],{"className":3388},[3389],"minner",[23,3391,3393,3402,3476],{"className":3392},[3389],[23,3394,3398],{"className":3395,"style":3397},[685,3396],"delimcenter","top:0em;",[23,3399,861],{"className":3400},[3401,81],"delimsizing",[23,3403,3405,3408,3473],{"className":3404},[44],[23,3406],{"className":3407},[685,686],[23,3409,3411],{"className":3410},[690],[23,3412,3414,3465],{"className":3413},[57,58],[23,3415,3417,3462],{"className":3416},[62],[23,3418,3420,3437,3445],{"className":3419,"style":1618},[66],[23,3421,3422,3425],{"style":703},[23,3423],{"className":3424,"style":707},[74],[23,3426,3428,3431,3434],{"className":3427},[44],[23,3429],{"className":3430,"style":537},[513],[23,3432,1748],{"className":3433},[44,1747],[23,3435,1753],{"className":3436,"style":1752},[44,48],[23,3438,3439,3442],{"style":716},[23,3440],{"className":3441,"style":707},[74],[23,3443],{"className":3444,"style":724},[723],[23,3446,3447,3450],{"style":727},[23,3448],{"className":3449,"style":707},[74],[23,3451,3453,3456,3459],{"className":3452},[44],[23,3454],{"className":3455,"style":537},[513],[23,3457,1748],{"className":3458},[44,1747],[23,3460,545],{"className":3461,"style":544},[44,48],[23,3463,92],{"className":3464},[91],[23,3466,3468],{"className":3467},[62],[23,3469,3471],{"className":3470,"style":1706},[66],[23,3472],{},[23,3474],{"className":3475},[834,686],[23,3477,3479],{"className":3478,"style":3397},[834,3396],[23,3480,892],{"className":3481},[3401,81],[23,3483,3485],{"className":3484},[53],[23,3486,3488,3517],{"className":3487},[57,58],[23,3489,3491,3514],{"className":3490},[62],[23,3492,3495],{"className":3493,"style":3494},[66],"height:-0.5136em;",[23,3496,3498,3501],{"style":3497},"top:-1.7003em;margin-right:0.05em;",[23,3499],{"className":3500,"style":75},[74],[23,3502,3504],{"className":3503},[79,80,81,82],[23,3505,3507],{"className":3506},[44,82],[23,3508,3510],{"className":3509},[44,494,82],[23,3511,3513],{"className":3512},[44,82],"rad",[23,3515,92],{"className":3516},[91],[23,3518,3520],{"className":3519},[62],[23,3521,3524],{"className":3522,"style":3523},[66],"height:0.9997em;",[23,3525],{},[23,3527],{"className":3528,"style":514},[513],[23,3530,668],{"className":3531},[518],[23,3533],{"className":3534,"style":514},[513],[23,3536,3538,3542,3545,3724,3727,3860],{"className":3537},[35],[23,3539],{"className":3540,"style":3541},[39],"height:2.0463em;vertical-align:-0.686em;",[23,3543,298],{"className":3544},[44],[23,3546,3548,3551,3721],{"className":3547},[44],[23,3549],{"className":3550},[685,686],[23,3552,3554],{"className":3553},[690],[23,3555,3557,3713],{"className":3556},[57,58],[23,3558,3560,3710],{"className":3559},[62],[23,3561,3563,3617,3625],{"className":3562,"style":1501},[66],[23,3564,3565,3568],{"style":703},[23,3566],{"className":3567,"style":707},[74],[23,3569,3571,3574,3577,3580,3583,3586],{"className":3570},[44],[23,3572,1578],{"className":3573},[44],[23,3575],{"className":3576,"style":537},[513],[23,3578,107],{"className":3579},[44,48],[23,3581,3312],{"className":3582},[44,48],[23,3584],{"className":3585,"style":537},[513],[23,3587,3589,3592],{"className":3588},[44],[23,3590,545],{"className":3591,"style":544},[44,48],[23,3593,3595],{"className":3594},[53],[23,3596,3598],{"className":3597},[57],[23,3599,3601],{"className":3600},[62],[23,3602,3605],{"className":3603,"style":3604},[66],"height:0.7401em;",[23,3606,3608,3611],{"style":3607},"top:-2.989em;margin-right:0.05em;",[23,3609],{"className":3610,"style":75},[74],[23,3612,3614],{"className":3613},[79,80,81,82],[23,3615,302],{"className":3616},[44,82],[23,3618,3619,3622],{"style":716},[23,3620],{"className":3621,"style":707},[74],[23,3623],{"className":3624,"style":724},[723],[23,3626,3627,3630],{"style":727},[23,3628],{"className":3629,"style":707},[74],[23,3631,3633,3636,3639,3707],{"className":3632},[44],[23,3634,302],{"className":3635},[44],[23,3637],{"className":3638,"style":537},[513],[23,3640,3642,3673],{"className":3641},[44],[23,3643,3645],{"className":3644},[44,2362],[23,3646,3648],{"className":3647},[57],[23,3649,3651],{"className":3650},[62],[23,3652,3654,3662],{"className":3653,"style":2372},[66],[23,3655,3656,3659],{"style":2375},[23,3657],{"className":3658,"style":707},[74],[23,3660,49],{"className":3661},[44,48],[23,3663,3664,3667],{"style":2375},[23,3665],{"className":3666,"style":707},[74],[23,3668,3670],{"className":3669,"style":2391},[2390],[23,3671,2395],{"className":3672},[44],[23,3674,3676],{"className":3675},[53],[23,3677,3679,3699],{"className":3678},[57,58],[23,3680,3682,3696],{"className":3681},[62],[23,3683,3685],{"className":3684,"style":479},[66],[23,3686,3687,3690],{"style":70},[23,3688],{"className":3689,"style":75},[74],[23,3691,3693],{"className":3692},[79,80,81,82],[23,3694,2420],{"className":3695,"style":2419},[44,48,82],[23,3697,92],{"className":3698},[91],[23,3700,3702],{"className":3701},[62],[23,3703,3705],{"className":3704,"style":99},[66],[23,3706],{},[23,3708,533],{"className":3709},[44,48],[23,3711,92],{"className":3712},[91],[23,3714,3716],{"className":3715},[62],[23,3717,3719],{"className":3718,"style":1706},[66],[23,3720],{},[23,3722],{"className":3723},[834,686],[23,3725],{"className":3726,"style":537},[513],[23,3728,3730,3733,3857],{"className":3729},[44],[23,3731],{"className":3732},[685,686],[23,3734,3736],{"className":3735},[690],[23,3737,3739,3849],{"className":3738},[57,58],[23,3740,3742,3846],{"className":3741},[62],[23,3743,3746,3789,3797],{"className":3744,"style":3745},[66],"height:1.3603em;",[23,3747,3748,3751],{"style":703},[23,3749],{"className":3750,"style":707},[74],[23,3752,3754,3757,3760],{"className":3753},[44],[23,3755,1578],{"className":3756},[44],[23,3758,1582],{"className":3759,"style":740},[44,48],[23,3761,3763,3766],{"className":3762},[44],[23,3764,1753],{"className":3765,"style":1752},[44,48],[23,3767,3769],{"className":3768},[53],[23,3770,3772],{"className":3771},[57],[23,3773,3775],{"className":3774},[62],[23,3776,3778],{"className":3777,"style":3604},[66],[23,3779,3780,3783],{"style":3607},[23,3781],{"className":3782,"style":75},[74],[23,3784,3786],{"className":3785},[79,80,81,82],[23,3787,931],{"className":3788},[44,82],[23,3790,3791,3794],{"style":716},[23,3792],{"className":3793,"style":707},[74],[23,3795],{"className":3796,"style":724},[723],[23,3798,3799,3802],{"style":727},[23,3800],{"className":3801,"style":707},[74],[23,3803,3805],{"className":3804},[44],[23,3806,3808,3812],{"className":3807},[44],[23,3809,3811],{"className":3810},[44,48],"L",[23,3813,3815],{"className":3814},[53],[23,3816,3818,3838],{"className":3817},[57,58],[23,3819,3821,3835],{"className":3820},[62],[23,3822,3824],{"className":3823,"style":67},[66],[23,3825,3826,3829],{"style":70},[23,3827],{"className":3828,"style":75},[74],[23,3830,3832],{"className":3831},[79,80,81,82],[23,3833,1753],{"className":3834,"style":1752},[44,48,82],[23,3836,92],{"className":3837},[91],[23,3839,3841],{"className":3840},[62],[23,3842,3844],{"className":3843,"style":99},[66],[23,3845],{},[23,3847,92],{"className":3848},[91],[23,3850,3852],{"className":3851},[62],[23,3853,3855],{"className":3854,"style":1706},[66],[23,3856],{},[23,3858],{"className":3859},[834,686],[23,3861,444],{"className":3862},[979],[11,3864,982,3865,3917,3918,3934,3935,3938,3939,3942],{},[23,3866,3868],{"className":3867},[26],[23,3869,3871],{"className":3870,"ariaHidden":31},[30],[23,3872,3874,3877],{"className":3873},[35],[23,3875],{"className":3876,"style":1421},[39],[23,3878,3880,3883],{"className":3879},[44],[23,3881,3811],{"className":3882},[44,48],[23,3884,3886],{"className":3885},[53],[23,3887,3889,3909],{"className":3888},[57,58],[23,3890,3892,3906],{"className":3891},[62],[23,3893,3895],{"className":3894,"style":67},[66],[23,3896,3897,3900],{"style":70},[23,3898],{"className":3899,"style":75},[74],[23,3901,3903],{"className":3902},[79,80,81,82],[23,3904,1753],{"className":3905,"style":1752},[44,48,82],[23,3907,92],{"className":3908},[91],[23,3910,3912],{"className":3911},[62],[23,3913,3915],{"className":3914,"style":99},[66],[23,3916],{}," the luminosity crossing radius ",[23,3919,3921],{"className":3920},[26],[23,3922,3924],{"className":3923,"ariaHidden":31},[30],[23,3925,3927,3931],{"className":3926},[35],[23,3928],{"className":3929,"style":3930},[39],"height:0.4306em;",[23,3932,1753],{"className":3933,"style":1752},[44,48],". The gradient is proportional to the\nopacity: a more opaque region needs a steeper temperature drop to push the same\nflux through. Where the opacity is high enough that the required radiative\ngradient exceeds the ",[121,3936,3937],{},"adiabatic gradient"," a rising gas parcel would follow, the\nlayer becomes unstable to convection, and energy is carried by bulk motion\ninstead. This is the ",[121,3940,3941],{},"Schwarzschild criterion",", and opacity is the switch that\ndecides it.",[11,3944,3945,3946,3990],{},"The consequences track the opacity sources. In the cool outer envelope of the\nSun, the surge of ",[23,3947,3949],{"className":3948},[26],[23,3950,3952],{"className":3951,"ariaHidden":31},[30],[23,3953,3955,3958],{"className":3954},[35],[23,3956],{"className":3957,"style":1124},[39],[23,3959,3961,3967],{"className":3960},[44],[23,3962,3964],{"className":3963},[44,494],[23,3965,1134],{"className":3966},[44],[23,3968,3970],{"className":3969},[53],[23,3971,3973],{"className":3972},[57],[23,3974,3976],{"className":3975},[62],[23,3977,3979],{"className":3978,"style":1124},[66],[23,3980,3981,3984],{"style":1149},[23,3982],{"className":3983,"style":75},[74],[23,3985,3987],{"className":3986},[79,80,81,82],[23,3988,298],{"className":3989},[872,82]," and bound-free opacity steepens the radiative\ngradient past adiabatic and drives the outer convection zone that produces\ngranulation. In the hot interior, where electron scattering has flattened the\nopacity, the gradient is shallow and energy diffuses radiatively. The opacity\ncomputed in this lesson thus feeds directly into the stellar-structure equations\nof the next module, where it appears as the coefficient linking the luminosity to\nthe temperature profile.",[431,3992],{"hash":3993},"8b7952583dc412cf0892ac1e87243af2c5b4d60fda0af4f60ad644f7277cc8b3",[11,3995,3996],{},"Radiation and matter, treated over these four lessons through intensity, transfer,\nline formation, and opacity, supply the boundary between what a star emits and\nwhat it is made of. The next module turns inward, using hydrostatic equilibrium\nand the opacity computed here to build the interior structure of a star.",[3998,3999,4002,4007],"section",{"className":4000,"dataFootnotes":6},[4001],"footnotes",[15,4003,4006],{"className":4004,"id":111},[4005],"sr-only","Footnotes",[4008,4009,4010,4021,4030],"ol",{},[118,4011,4013,4014],{"id":4012},"user-content-fn-bob-opacity","Carroll & Ostlie, §9.2 — the four sources of opacity, the Kramers law, electron scattering, and the definition of the Rosseland mean. ",[107,4015,4020],{"href":4016,"ariaLabel":4017,"className":4018,"dataFootnoteBackref":6},"#user-content-fnref-bob-opacity","Back to reference 1",[4019],"data-footnote-backref","↩",[118,4022,4024,4025],{"id":4023},"user-content-fn-maoz-hminus","Maoz, Ch. 3 — the negative hydrogen ion as the dominant continuous opacity in cool stellar photospheres. ",[107,4026,4020],{"href":4027,"ariaLabel":4028,"className":4029,"dataFootnoteBackref":6},"#user-content-fnref-maoz-hminus","Back to reference 2",[4019],[118,4031,4033,4034],{"id":4032},"user-content-fn-bob-rosseland","Carroll & Ostlie, §9.2 and §10.3 — the Rosseland mean as a harmonic, transparency-weighted average and its role in setting the radiative temperature gradient. ",[107,4035,4020],{"href":4036,"ariaLabel":4037,"className":4038,"dataFootnoteBackref":6},"#user-content-fnref-bob-rosseland","Back to reference 3",[4019],{"title":6,"searchDepth":4040,"depth":4040,"links":4041},2,[4042,4043,4044,4045,4046,4047],{"id":17,"depth":4040,"text":18},{"id":436,"depth":4040,"text":437},{"id":1058,"depth":4040,"text":1059},{"id":1397,"depth":4040,"text":1398},{"id":3361,"depth":4040,"text":3362},{"id":111,"depth":4040,"text":4006},[],"computer-science",false,"md",{"moduleNumber":4053,"lessonNumber":4054,"order":4055},3,4,304,"Radiation and Matter",true,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean",[],"---\ntitle: Opacity Sources and the Rosseland Mean\ndraft: false\nmodule: Radiation and Matter\nmoduleNumber: 3\nlessonNumber: 4\norder: 304\nsummary: >\n  Stellar opacity comes from four processes: bound-bound line absorption,\n  bound-free photoionization, free-free absorption, and electron scattering. The\n  bound-free and free-free terms follow a Kramers law, electron scattering sets a\n  frequency-flat floor, and the negative hydrogen ion dominates cool photospheres.\n  The Rosseland mean averages these harmonically, weighting transparent frequencies\n  because they carry the flux, and its value fixes the radiative temperature\n  gradient and decides where a star becomes convective.\ntopics: [Radiation and Matter]\nsources:\n  - book: Carroll & Ostlie\n    ref: \"Ch. 9 — Stellar Atmospheres; §9.2 Opacity; Ch. 10 — The Interiors of Stars; §10.3\"\n  - book: Maoz\n    ref: \"Ch. 3 — Stellar Physics\"\n---\n\nOpacity is the resistance a stellar gas offers to radiation. It sets the\noptical-depth scale of the previous lessons, and through it the rate at which\nenergy diffuses out of a star. Four microphysical processes contribute, each with\nits own frequency and temperature dependence. Because a star transports energy at\nall frequencies at once, the many monochromatic opacities must be combined into a\nsingle mean, and the correct average is harmonic, dominated by the frequencies\nwhere the gas is most transparent. That mean fixes the temperature gradient and,\nwhere it grows too steep, triggers convection.\n\n## The four sources of opacity\n\nThe total opacity $\\kappa_\\nu$ is a sum of contributions from four distinct\ninteractions between photons and matter.[^bob-opacity]\n\n- **Bound-bound absorption** ($\\kappa_{bb}$): an electron absorbs a photon and\n  jumps between two bound levels. This produces the spectral lines of the previous\n  lesson. It is sharply peaked in frequency and, summed over the forest of lines,\n  contributes substantially to the mean opacity in cool, metal-rich gas.\n- **Bound-free absorption** ($\\kappa_{bf}$): photoionization. A photon with energy\n  above the ionization threshold ejects a bound electron into the continuum. The\n  cross section jumps at each threshold frequency and falls as $\\nu^{-3}$ above it,\n  giving the characteristic sawtooth of ionization edges.\n- **Free-free absorption** ($\\kappa_{ff}$): a free electron passing a nucleus\n  absorbs a photon, the inverse of bremsstrahlung. It requires the third body to\n  conserve momentum and operates at all frequencies, contributing everywhere but\n  most in the hot, dense interior.\n- **Electron scattering** ($\\kappa_{es}$): a photon scatters off a free electron\n  by the Thomson process. It removes the photon from the beam without absorbing\n  it, is independent of frequency, and dominates at high temperature where the gas\n  is fully ionized and few bound electrons remain.\n\n$$\n% caption: The four opacity processes as electron transitions: a bound-bound jump\n% between levels, a bound-free ejection into the continuum, a free-free absorption\n% by an electron passing an ion, and photon scattering off a free electron.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n% panel 1: bound-bound\n\\begin{scope}\n\\draw[black] (0,0) -- (1.4,0);\n\\draw[black] (0,1.0) -- (1.4,1.0);\n\\draw[->, very thick] (0.5,0) -- (0.5,1.0);\n\\node[black!70, anchor=north] at (0.7,-0.15) {bound-bound};\n\\end{scope}\n% panel 2: bound-free\n\\begin{scope}[shift={(2.6,0)}]\n\\draw[black] (0,0) -- (1.4,0);\n\\draw[black, densely dashed] (0,1.4) -- (1.4,1.4);\n\\draw[->, very thick] (0.5,0) -- (0.5,1.6);\n\\node[anchor=south] at (0.5,1.6) {free};\n\\node[black!70, anchor=north] at (0.7,-0.15) {bound-free};\n\\end{scope}\n% panel 3: free-free\n\\begin{scope}[shift={(5.2,0)}]\n\\fill[black] (0.7,0.2) circle (2.5pt);\n\\node[black, anchor=north] at (0.7,0.15) {ion};\n\\draw[very thick] (0.1,1.3) .. controls (0.5,0.9) and (0.9,0.9) .. (1.3,1.4);\n\\draw[->, thick] (1.3,1.4) -- (1.6,1.7);\n\\node[black!70, anchor=north] at (0.7,-0.35) {free-free};\n\\end{scope}\n% panel 4: electron scattering\n\\begin{scope}[shift={(7.8,0)}]\n\\fill (0.7,0.7) circle (2.5pt);\n\\node[black, anchor=north] at (0.7,0.5) {electron};\n\\draw[->, thick] (0.0,1.3) -- (0.65,0.75);\n\\draw[->, thick] (0.75,0.65) -- (1.5,1.2);\n\\node[black!70, anchor=north] at (0.7,-0.35) {scattering};\n\\end{scope}\n\\end{tikzpicture}\n$$\n\n## The Kramers law\n\nThe bound-free and free-free opacities share a temperature and density dependence,\nbecause both scale with the density of absorbers and with the population of\nphotons able to interact. Averaged over frequency, both follow the **Kramers\nopacity law**,\n\n$$\n\\kappa_{\\text{Kramers}} \\propto \\rho \\, T^{-7\u002F2} .\n$$\n\nThe steep inverse temperature dependence means opacity falls rapidly as the gas\nheats: hotter gas is more transparent, because ionization removes bound electrons\nand the free-free interaction weakens as electrons move faster past ions. The\nlinear density dependence reflects that both processes need a second particle, an\nion or a nucleus, whose abundance scales with $\\rho$.\n\nElectron scattering has no such dependence. The Thomson cross section is a\nconstant, so its opacity depends only on the number of free electrons per unit\nmass,\n\n$$\n\\kappa_{es} = \\frac{\\sigma_T n_e}{\\rho} = 0.02\\,(1 + X)\\ \\text{m}^2\\,\\text{kg}^{-1} ,\n$$\n\nwith $X$ the hydrogen mass fraction and $\\sigma_T$ the Thomson cross section. It is\nindependent of frequency, temperature, and density, so it forms a floor beneath\nthe Kramers contribution. Where Kramers opacity has fallen below this floor, in\nthe hot interior, electron scattering dominates and the opacity becomes nearly\nconstant.\n\n$$\n% caption: Opacity against temperature at fixed density. The Kramers term rises\n% toward lower temperature and falls as T to the minus seven-halves toward higher\n% temperature, meeting the flat electron-scattering floor in the hot interior.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n\\draw[->, black] (0,0) -- (8.4,0) node[right, black!70] {log temperature};\n\\draw[->, black] (0,0) -- (0,4.6) node[above, black!70] {log opacity};\n% electron scattering floor\n\\draw[black, thick, densely dashed] (0.4,1.2) -- (8.0,1.2);\n\\node[black, anchor=south east] at (8.0,1.2) {electron scattering};\n% Kramers falling toward high T\n\\draw[acc, very thick] (2.2,4.2) .. controls (3.6,3.3) and (4.6,1.9) .. (5.4,1.25);\n\\node[acc, anchor=south west] at (3.4,3.1) {Kramers};\n% low-T rise (bound-free \u002F H-minus bump region)\n\\draw[acc, very thick, densely dotted] (0.6,1.9) .. controls (1.2,2.9) and (1.8,3.6) .. (2.2,4.2);\n\\node[black, anchor=east] at (1.5,3.2) {bound-free bump};\n% combined floor continuation\n\\draw[acc, very thick] (5.4,1.25) -- (8.0,1.22);\n\\end{tikzpicture}\n$$\n\n## The negative hydrogen ion\n\nIn the cool photospheres of the Sun and less massive stars, temperatures near\n$5000$–$6000\\ \\text{K}$ are too low to keep hydrogen ionized, and the ordinary\nbound-free and free-free hydrogen opacities are weak. The dominant opacity is\ninstead the **negative hydrogen ion**, $\\text{H}^-$: a neutral hydrogen atom\nbinding a second electron with an ionization energy of only $0.75\\ \\text{eV}$. The\nloosely held electron is photodetached by any photon with wavelength shorter than\nabout $1.64\\ \\mu\\text{m}$, so $\\text{H}^-$ absorbs across the whole visible and\nnear-infrared band.[^maoz-hminus]\n\nThe extra electrons that form $\\text{H}^-$ come from the ionization of trace\nmetals with low ionization potentials, so the $\\text{H}^-$ opacity depends on\nmetal abundance even though the absorber is hydrogen. It is the reason the solar\ncontinuum forms where it does, and its threshold near $1.6\\ \\mu\\text{m}$ imprints a\nminimum in the continuous opacity that makes the infrared photosphere the deepest\nlayer visible in the Sun.\n\n$$\n% caption: In a cool photosphere the negative hydrogen ion, a neutral atom holding\n% a weakly bound extra electron, is photodetached by visible and near-infrared\n% photons and dominates the continuous opacity below about six thousand kelvin.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n% nucleus\n\\fill (1.4,1.6) circle (3pt);\n\\node[anchor=south] at (1.4,1.85) {proton};\n% inner electron orbit\n\\draw[black] (1.4,1.6) circle (0.9);\n\\fill[black] (2.3,1.6) circle (2pt);\n\\node[black, anchor=west] at (2.35,1.6) {bound electron};\n% weakly bound outer electron\n\\draw[black, densely dashed] (1.4,1.6) circle (1.7);\n\\fill[black] (1.4,3.3) circle (2pt);\n\\node[black, anchor=south] at (1.4,3.35) {weakly bound electron};\n% incoming photon\n\\draw[->, acc, very thick] (4.6,3.3) -- (2.0,2.9);\n\\node[acc, anchor=west] at (4.6,3.3) {photon};\n% ejected electron\n\\draw[->, black, thick] (1.4,3.3) -- (0.1,3.9);\n\\node[black, anchor=east] at (0.2,3.85) {detached};\n\\end{tikzpicture}\n$$\n\n## The Rosseland mean opacity\n\nA star transports energy at every frequency simultaneously, so the structure\nequations need one representative opacity. The physically correct choice follows\nfrom how radiation diffuses through the deep interior, where the field is nearly\nisotropic and nearly Planckian. In that **diffusion regime** the monochromatic\nflux is\n\n$$\nF_\\nu = -\\frac{4\\pi}{3\\, \\kappa_\\nu \\rho} \\, \\frac{\\partial B_\\nu}{\\partial T} \\, \\frac{\\d T}{\\d r} .\n$$\n\nThe key feature is the factor $1\u002F\\kappa_\\nu$: the flux at each frequency is\ninversely proportional to the opacity there, so transparent frequencies carry the\nmost energy. Integrating over frequency to get the total flux,\n\n$$\nF = -\\frac{4\\pi}{3\\rho} \\, \\frac{\\d T}{\\d r} \\int_0^\\infty \\frac{1}{\\kappa_\\nu} \\, \\frac{\\partial B_\\nu}{\\partial T} \\, \\d\\nu .\n$$\n\nThe **Rosseland mean opacity** $\\bar\\kappa_R$ is defined so that the total flux\ntakes the same form with a single opacity,\n\n$$\n\\frac{1}{\\bar\\kappa_R} = \\frac{\\displaystyle\\int_0^\\infty \\frac{1}{\\kappa_\\nu} \\, \\frac{\\partial B_\\nu}{\\partial T} \\, \\d\\nu}{\\displaystyle\\int_0^\\infty \\frac{\\partial B_\\nu}{\\partial T} \\, \\d\\nu} .\n$$\n\nIt is a **harmonic mean**: the reciprocal of the opacity is averaged, not the\nopacity itself. The average therefore weights toward the frequencies of lowest\nopacity, the transparent windows, because those are the frequencies through which\nthe flux leaks. A narrow transparent band lowers $\\bar\\kappa_R$ far more than a\nnarrow opaque line raises it, since energy simply routes around the opaque line\nthrough the transparent continuum. The weighting function $\\partial B_\\nu \u002F \\partial T$\npeaks somewhat blueward of the Planck peak and its total integral is\n$\\partial B\u002F\\partial T = ac T^3 \u002F \\pi$, from the Stefan-Boltzmann law.[^bob-rosseland]\n\n$$\n% caption: The Rosseland weighting averages one over opacity, so a transparent\n% window at moderate opacity contributes far more to the flux than an opaque line;\n% the mean is pulled down toward the transparent frequencies.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n\\draw[->, black] (0,0) -- (8.4,0) node[right, black!70] {frequency};\n\\draw[->, black] (0,0) -- (0,4.2) node[above, black!70] {opacity};\n% opacity curve with a transparent dip and an opaque line spike\n\\draw[very thick] (0.4,2.4) .. controls (1.6,2.3) and (2.2,0.6) .. (2.8,0.6)\n  .. controls (3.4,0.6) and (3.6,2.2) .. (4.2,2.2)\n  -- (4.6,2.2) -- (4.6,3.8) -- (4.9,3.8) -- (4.9,2.2)\n  .. controls (5.6,2.2) and (6.4,2.4) .. (8.0,2.5);\n\\node[acc, anchor=north] at (2.8,0.55) {transparent window};\n\\node[black, anchor=west] at (4.95,3.6) {opaque line};\n% flux weighting arrow to the window\n\\draw[->, acc, thick] (2.8,-0.7) -- (2.8,0.4);\n\\node[black, anchor=north] at (2.8,-0.7) {f\\\u002Flux escapes here};\n\\end{tikzpicture}\n$$\n\n## Opacity and the temperature gradient\n\nSolving the diffusion relation for the temperature gradient gives the\n**radiative temperature gradient** a star must have to carry its luminosity by\nradiation alone,\n\n$$\n\\left(\\frac{\\d T}{\\d r}\\right)_{\\text{rad}} = -\\frac{3\\, \\bar\\kappa_R \\rho}{4\\, a c\\, T^3} \\, \\frac{L_r}{4\\pi r^2} ,\n$$\n\nwith $L_r$ the luminosity crossing radius $r$. The gradient is proportional to the\nopacity: a more opaque region needs a steeper temperature drop to push the same\nflux through. Where the opacity is high enough that the required radiative\ngradient exceeds the **adiabatic gradient** a rising gas parcel would follow, the\nlayer becomes unstable to convection, and energy is carried by bulk motion\ninstead. This is the **Schwarzschild criterion**, and opacity is the switch that\ndecides it.\n\nThe consequences track the opacity sources. In the cool outer envelope of the\nSun, the surge of $\\text{H}^-$ and bound-free opacity steepens the radiative\ngradient past adiabatic and drives the outer convection zone that produces\ngranulation. In the hot interior, where electron scattering has flattened the\nopacity, the gradient is shallow and energy diffuses radiatively. The opacity\ncomputed in this lesson thus feeds directly into the stellar-structure equations\nof the next module, where it appears as the coefficient linking the luminosity to\nthe temperature profile.\n\n$$\n% caption: Where high opacity forces the radiative gradient steeper than the\n% adiabatic gradient a rising parcel follows, the layer convects; where the\n% radiative gradient stays shallow, energy diffuses as radiation.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n% radiative zone\n\\begin{scope}\n\\draw[black] (0,0) rectangle (3.2,3.0);\n\\node[black!70, anchor=south] at (1.6,3.05) {low opacity};\n\\foreach \\y in {0.5,1.1,1.7,2.3} \\draw[->, thick] (0.6,\\y) -- (2.6,\\y);\n\\node[black] at (1.6,-0.35) {radiative};\n\\end{scope}\n% convective zone\n\\begin{scope}[shift={(4.6,0)}]\n\\draw[black] (0,0) rectangle (3.2,3.0);\n\\node[black!70, anchor=south] at (1.6,3.05) {high opacity};\n\\draw[->, thick] (0.8,0.4) .. controls (0.4,1.5) .. (0.8,2.6);\n\\draw[->, thick] (1.6,2.6) .. controls (2.0,1.5) .. (1.6,0.4);\n\\draw[->, thick] (2.4,0.4) .. controls (2.0,1.5) .. (2.4,2.6);\n\\node[black] at (1.6,-0.35) {convective};\n\\end{scope}\n\\end{tikzpicture}\n$$\n\nRadiation and matter, treated over these four lessons through intensity, transfer,\nline formation, and opacity, supply the boundary between what a star emits and\nwhat it is made of. The next module turns inward, using hydrostatic equilibrium\nand the opacity computed here to build the interior structure of a star.\n\n[^bob-opacity]: Carroll & Ostlie, §9.2 — the four sources of opacity, the Kramers law, electron scattering, and the definition of the Rosseland mean.\n[^maoz-hminus]: Maoz, Ch. 3 — the negative hydrogen ion as the dominant continuous opacity in cool stellar photospheres.\n[^bob-rosseland]: Carroll & Ostlie, §9.2 and §10.3 — the Rosseland mean as a harmonic, transparency-weighted average and its role in setting the radiative temperature gradient.\n",{"text":4062,"minutes":4063,"time":4064,"words":4065},"6 min read",5.32,319200,1064,{"title":5,"description":13},[4068,4071],{"book":4069,"ref":4070},"Carroll & Ostlie","Ch. 9 — Stellar Atmospheres; §9.2 Opacity; Ch. 10 — The Interiors of Stars; §10.3",{"book":4072,"ref":4073},"Maoz","Ch. 3 — Stellar Physics","available","10.astrophysics-cosmology\u002F03.radiation-and-matter\u002F04.opacity-and-the-rosseland-mean","Stellar opacity comes from four processes: bound-bound line absorption, bound-free photoionization, free-free absorption, and electron scattering. The bound-free and free-free terms follow a Kramers law, electron scattering sets a frequency-flat floor, and the negative hydrogen ion dominates cool photospheres. The Rosseland mean averages these harmonically, weighting transparent frequencies because they carry the flux, and its value fixes the radiative temperature gradient and decides where a star becomes convective.\n",[4056],"epK-7xRMmzi7fsEze7z18tGo5B5czOG2v4iwR_UJ6J4",{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":4080,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":4081,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":4082,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":4083,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":4084,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":4085,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":4086,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":4087,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":4088,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":4089,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":4090,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":4091,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":4092,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":4093,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":4094,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":4095,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":4096,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":4097,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":4098,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":4099,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":4100,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":4101,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":4102,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":4103,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":4104,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":4105,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":4106,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":4107,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":4108,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":4109,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":4110,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":4111,"\u002Falgorithms\u002Fsequences\u002Ftries":4112,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":4113,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":4114,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":4115,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":4116,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":4117,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":4118,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":4119,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":4120,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":4121,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":4122,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":4123,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":4124,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":4125,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":4126,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":4127,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":4128,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":4129,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":4130,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":4131,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":4132,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":4133,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":4134,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":4135,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":4136,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":4137,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":4138,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":4139,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":4140,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":4141,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":4142,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":4143,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":4144,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":4145,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":4146,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":4147,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":4148,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":4149,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":4150,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":4151,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":4152,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":4153,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":4154,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":4155,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":4156,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":4157,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":4158,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":4159,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":4160,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":4161,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":4162,"\u002Falgorithms":4163,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":4164,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":4165,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":4166,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":4167,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":4168,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":4169,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":4170,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":4171,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":4172,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":4173,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":4174,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":4175,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":4176,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":4177,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":4178,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":4179,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":4180,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":4181,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":4182,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":4183,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":4184,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":4185,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":4186,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":4187,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":4188,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":4189,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":4190,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":4191,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":4192,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":4193,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":4194,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":4195,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":4196,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":4197,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":4178,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":4198,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":4199,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":4200,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":4168,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":4201,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":4202,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":4203,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":4204,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":4205,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":4206,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":4207,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":4208,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":4209,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":4210,"\u002Fcalculus":4211,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":4212,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":4213,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":4214,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":4215,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":4216,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":4217,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":4218,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":4219,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":4220,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":4221,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":4222,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":4223,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":4224,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":4225,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":4226,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":4227,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":4228,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":4229,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":4230,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":4231,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":4232,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":4233,"\u002Fmechanics\u002Frotation\u002Frolling-motion":4234,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":4235,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":4236,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":4237,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":4238,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":4239,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":4240,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":4241,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":4242,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":4243,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":4244,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":4245,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":4246,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":4247,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":4248,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":4249,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":4250,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":4251,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":4252,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":4253,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":4254,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":4255,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":4256,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":4257,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":4258,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":4259,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":4260,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":4261,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":4262,"\u002Fmechanics":4263,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":4264,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":4265,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":4266,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":4267,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":4268,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":4269,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":4270,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":4271,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":4272,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":4273,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":4274,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":4275,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":4252,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":4276,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":4277,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":4278,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":4248,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":4113,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":4279,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":4239,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":4280,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":4281,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":4282,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":4283,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":4284,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":4285,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":4286,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":4287,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":4288,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":4213,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":4289,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":4290,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":4291,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":4292,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":4293,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":4294,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":4295,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":4296,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":4231,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":4230,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":4297,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":4298,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":4299,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":4300,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":4301,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":4302,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":4303,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":4304,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":4305,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":4257,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":4255,"\u002Felectricity-and-magnetism":4306,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":4307,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":4308,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":4309,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":4310,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":4311,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":4312,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":4313,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":4314,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":4315,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":4165,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":4316,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":4317,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":4169,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":4318,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":4319,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":4320,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":4321,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":4322,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":4323,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":4324,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":4325,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":4326,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":4327,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":4328,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":4329,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":4330,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":4331,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":4332,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":4333,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":4334,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":4335,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":4336,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":4337,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":4204,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":4338,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":4339,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":4340,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":4341,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":4342,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":4343,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":4344,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":4345,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":4346,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":4347,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":4348,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":4349,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":4350,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":4351,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":4352,"\u002Flinear-algebra":4353,"\u002Ftheory-of-computation":4354,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":4355,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":4356,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":4357,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":4358,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":4359,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":4360,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":4361,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":4362,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":4363,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":4364,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":4365,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":4366,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":4367,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":4368,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":4369,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":4370,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":4371,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":4372,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":4373,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":4374,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":4375,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":4376,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":4377,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":4378,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":4379,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":4380,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":4381,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":4382,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":4383,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":4384,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":4385,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":4386,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":4387,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":4388,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":4389,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":4390,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":4391,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":4392,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":4393,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":4394,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":4395,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":4396,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":4397,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":4398,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":4399,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":4400,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":4401,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":4402,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":4403,"\u002Fcomputer-architecture":4354,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":4404,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":4405,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":4406,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":4169,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":4407,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":4168,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":4175,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":4408,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":4409,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":4209,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":4410,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":4411,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":4412,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":4413,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":4414,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":4415,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":4416,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":4417,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":4418,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":4419,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":4420,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":4421,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":4416,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":4422,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":4423,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":4424,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":4425,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":4426,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":4427,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":4428,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":4429,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":4430,"\u002Fdifferential-equations":4431,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":4432,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":4433,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":4434,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":4435,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":4314,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":4436,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":4437,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":4438,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":4439,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":4440,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":4441,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":4184,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":4442,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":4443,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":4444,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":4445,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":4446,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":4447,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":4448,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":4449,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":4450,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":4451,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":4406,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":4452,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":4453,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":4454,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":4455,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":4456,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":4335,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":4457,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":4458,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":4345,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":4459,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":4460,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":4461,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":4462,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":4463,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":4464,"\u002Frelativity":4465,"\u002Fphysical-computing":4354,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":4466,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":4445,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":4467,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":4468,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":4469,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":4470,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":4471,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":4472,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":4473,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":4421,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":4345,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":4474,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":4475,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":4476,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":4477,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":4473,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":4478,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":4453,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":4206,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":4479,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":4480,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":4186,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":4481,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":4482,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":4483,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":4484,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":4485,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":4486,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":4487,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":4488,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":4489,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":4445,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":4490,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":4491,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":4492,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":4479,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":4167,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":4493,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":4494,"\u002Fquantum-mechanics":4495,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":4429,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":4496,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":4497,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":4318,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":4498,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":4204,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":4499,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":4500,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":4341,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":4451,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":4501,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":4502,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":4503,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":4504,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":4505,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":4478,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":4506,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":4311,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":4507,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":4508,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":4165,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":4509,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":4510,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":4467,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":4194,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":4345,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":4511,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":4512,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":4330,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":4455,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":4513,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":4514,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":4515,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":4350,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":4516,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":4517,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":4518,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":4518,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":4519,"\u002Freal-analysis":4520,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":4521,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":4522,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":4523,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":4524,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":4525,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":4526,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":4527,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":4528,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":4529,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":4530,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":4494,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":4531,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":4523,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":4440,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":4532,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":4533,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":4534,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":4535,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":4536,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":4537,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":4538,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":4539,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":4533,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":4540,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":4509,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":4541,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":4542,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":4543,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":4544,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":4545,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":4546,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":4547,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":4548,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":4549,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":4550,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":4183,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":4551,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":4552,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":4425,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":4553,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":4554,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":4482,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":4554,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":4555,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":4556,"\u002Fabstract-algebra":4557,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":4558,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":4559,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":4560,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":4561,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":4562,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":4474,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":4563,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":4564,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":4565,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":4566,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":4567,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":4568,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":4569,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":4308,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":4437,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":4183,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":4570,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":4167,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":4571,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":4572,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":4205,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":4499,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":4573,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":4574,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":4575,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":4576,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":4577,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":4578,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":4579,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":4580,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":4581,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":4582,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":4583,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":4584,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":4585,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":4586,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":4530,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":4587,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":4588,"\u002Fatomic-physics":4589,"\u002Fdatabases":4354,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":4590,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":4591,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":4592,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":4521,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":4593,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":4594,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":4595,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":4596,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":4597,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":4598,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":4599,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":4600,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":4601,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":4602,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":4603,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":4604,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":4605,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":4606,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":4607,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":4608,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":4609,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":4610,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":4611,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":4612,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":4603,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":4613,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":4614,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":4615,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":4616,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":4617,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":4562,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":4618,"\u002Fcategory-theory":4619,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":4620,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":4621,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":4622,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":4623,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":4624,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":4625,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":4584,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":4626,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":4627,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":4628,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":4629,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":4630,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":4631,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":4632,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":4633,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":4634,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":4635,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":4636,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":4637,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":4638,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":4639,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":4640,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":4641,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":4642,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":4643,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":4644,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":4645,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":4646,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":4647,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":4648,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":4649,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":4650,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":4651,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":4652,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":4596,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":4653,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":4654,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":4655,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":4656,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":4657,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":4658,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":4659,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":4148,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":4660,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":4661,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":4384,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":4662,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":4663,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":4664,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":4665,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":4666,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":4667,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":4668,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":4669,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":4670,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":4671,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":4672,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":4673,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":4357,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":4674,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":4675,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":4676,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":4677,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":4394,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":4678,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":4679,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":4680,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":4681,"\u002Fdeep-learning":4354,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":4682,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":4479,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":4683,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":4684,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":4685,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":4686,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":4687,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":4688,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":4689,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":4690,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":4526,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":4691,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":4692,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":4693,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":4413,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":4206,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":4694,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":4695,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":4696,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":4340,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":4697,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":4698,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":4418,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":4345,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":4699,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":4314,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":4184,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":4200,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":4700,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":4701,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":4702,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":4332,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":4703,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":4194,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":4704,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":4705,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":4706,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":4707,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":4528,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":4708,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":4709,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":4710,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":4711,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":4474,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":4712,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":4452,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":4713,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":4313,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":4714,"\u002Fstatistical-mechanics":4715,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":4716,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":4179,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":4439,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":4717,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":4718,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":4719,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":4720,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":4721,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":4722,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":4312,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":4723,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":4724,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":4725,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":4726,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":4455,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":4727,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":4728,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":4729,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":4730,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":4731,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":4510,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":4454,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":4732,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":4733,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":4734,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":4735,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":4445,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":4736,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":4737,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":4682,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":4582,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":4309,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":4738,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":4175,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":4739,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":4740,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":4320,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":4741,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":4575,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":4742,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":4167,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":4743,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":4178,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":4744,"\u002Fcondensed-matter":4495,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":4745,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":4746,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":4747,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":4748,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":4192,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":4749,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":4750,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":4192,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":4751,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":4605,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":4752,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":4753,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":4754,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":4752,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":4755,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":4756,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":4757,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":4758,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":4759,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":4760,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":4761,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":4762,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":4683,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":4763,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":4756,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":4764,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":4765,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":4398,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":4766,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":4583,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":4767,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":4768,"\u002Flogic":4769,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":4770,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":4771,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":4384,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":4772,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":4773,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":4774,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":4775,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":4765,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":4776,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":4777,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":4778,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":4676,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":4779,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":4780,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":4781,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":4782,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":4783,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":4401,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":4784,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":4785,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":4786,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":4787,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":4592,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":4788,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":4764,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":4789,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":4790,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":4791,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":4412,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":4792,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":4542,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":4793,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":4794,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":4374,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":4795,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":4796,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":4797,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":4798,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":4799,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":4652,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":4800,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":4801,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":4802,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":4687,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":4803,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":4804,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":4805,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":4401,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":4468,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":4806,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":4807,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":4808,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":4809,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":4810,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":4811,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":4812,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":4813,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":4814,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":4815,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":4816,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":4817,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":4818,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":4819,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":4820,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":4821,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":4822,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":4823,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":4824,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":4825,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":4826,"\u002Freinforcement-learning":4354,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":4827,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":4828,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":4829,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":4830,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":4831,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":4832,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":4833,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":4834,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":4835,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":4836,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":4837,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":4838,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":4839,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":4681,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":4536,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":4840,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":4841,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":4842,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":4843,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":4844,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":4845,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":4663,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":4846,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":4847,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":4848,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":4849,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":4850,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":4851,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":4852,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":4853,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":4854,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":4855,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":4856,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":4857,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":4595,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":4847,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":4858,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":4135,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":4859,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":4860,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":4861,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":4862,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":4863,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":4644,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":4864,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":4865,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":4866,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":4867,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":4868,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":4869,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":4870,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":4871,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":4872,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":4873,"\u002Fartificial-intelligence":4354,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":4611,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":4874,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":4171,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":4169,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":4705,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":4875,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":4197,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":4507,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":4876,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":4877,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":4878,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":4567,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":4879,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":4880,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":4881,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":4766,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":4882,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":4883,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":4181,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":4410,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":4884,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":4511,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":4885,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":4886,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":4406,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":4494,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":4887,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":4888,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":4889,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":4176,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":4551,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":4413,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":4890,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":4461,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":4525,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":4891,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":4892,"\u002Fnuclear-physics":4893,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":4894,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":4895,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":4532,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":4896,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":4897,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":4898,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":4380,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":4899,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":4900,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":4677,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":4901,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":4846,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":4902,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":4903,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":4904,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":4905,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":4906,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":4907,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":4908,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":4358,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":4909,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":4910,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":4852,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":4911,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":4912,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":4913,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":4914,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":4915,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":4916,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":4917,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":4918,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":4776,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":4919,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":4920,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":4921,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":4922,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":4923,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":4924,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":4925,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":4926,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":4927,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":4928,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":4929,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":4930,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":4630,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":4797,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":4386,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":4931,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":4932,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":4933,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":4934,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":4644,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":4935,"\u002Fnatural-language-processing":4354,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":4936,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":4552,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":4937,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":4697,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":4938,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":4939,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":4887,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":4940,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":4941,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":4502,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":4204,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":4942,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":4456,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":4943,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":4489,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":4944,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":4743,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":4945,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":4946,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":4712,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":4947,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":4175,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":4948,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":4949,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":4950,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":4493,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":4709,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":4951,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":4952,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":4568,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":4953,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":4613,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":4954,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":4955,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":4502,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":4535,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":4956,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":4957,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":4958,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":4591,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":4959,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":4332,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":4960,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":4435,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":4961,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":4962,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":4759,"\u002Fparticle-physics":4963,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":4553,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":4707,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":4964,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":4492,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":4965,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":4552,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":4464,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":4966,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":4967,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":4968,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":4065,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":4969,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":4758,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":4689,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":4970,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":4971,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":4972,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":4973,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":4886,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":4974,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":4448,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":4511,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":4493,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":4975,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":4577,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":4193,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":4976,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":4977,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":4708,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":4978,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":4979,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":4980,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":4981,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":4174,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":4982,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":4983,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":4435,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":4984,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":4985,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":4701,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":4356,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":4986,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":4987,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":4613,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":4599,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":4611,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":4708,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":4988,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":4173,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":4365,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":4989,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":4452,"\u002Fastrophysics-cosmology":4557,"\u002Fcolophon":4990,"\u002F":4354},4250,4808,3626,2682,4109,4786,3878,3875,3751,3415,4067,3153,3000,4042,5461,5808,3961,3749,4327,5067,4246,4655,4154,5436,2640,4003,3601,2158,4331,4189,2273,3252,4633,4964,4172,3131,5524,3160,4031,2309,4207,3226,2648,4842,5340,3307,5701,4977,4039,2615,3472,4460,3848,4075,4400,3382,3010,3602,3737,3740,3707,3922,5191,4043,3804,4542,4214,5062,2850,4361,3443,3627,4044,3766,4140,3860,4006,5199,4334,5234,3651,5509,5680,153,1375,1073,1093,1125,1146,1014,1132,876,1541,1189,1173,984,1402,1301,950,1268,1063,1107,1408,1161,925,1012,866,964,1090,1142,1085,1020,1207,973,980,728,764,1225,1329,796,929,801,878,774,1044,1488,1175,1130,890,814,870,154,4073,5140,4961,5127,4870,5382,5195,4955,5369,4501,5576,3824,4132,4289,4307,4570,3403,5084,5105,5201,5116,5341,5175,5368,5188,5211,5499,5155,4981,5125,5415,5255,5304,5130,5167,5552,5164,5094,5239,5036,5190,5004,5099,5035,5159,5088,5026,4937,5023,5264,5244,133,5114,5078,5043,5312,5170,5342,5139,5151,5049,5212,5013,5068,5079,5102,5121,5081,5029,5379,5854,5110,2139,3798,5055,5364,4984,4935,4895,4972,5289,5112,5156,4987,5031,5025,5149,5302,5042,5002,4979,4922,4960,5279,126,1877,1180,1129,907,958,1112,1300,1053,1250,1181,1241,1234,966,1050,734,1190,484,1082,926,733,761,571,607,798,804,952,977,731,784,645,771,1017,742,1004,1000,1562,1254,1288,1101,1011,1486,1061,856,992,1169,988,137,0,2037,1782,2384,2254,2123,2332,1643,1714,2089,1751,1367,1660,2511,1998,1892,1854,1791,2438,2487,1917,2375,2525,2266,1845,2275,1810,1631,2310,2166,2233,2113,2505,2347,2672,2112,2473,2592,2380,3013,2513,3256,3218,2194,2173,2205,2326,2081,3342,3152,1799,1670,1027,960,1095,1291,986,897,1209,1055,1817,1801,1593,1465,1196,1464,1201,1230,1435,1684,1461,1926,1500,1409,1284,1774,1869,162,1487,1122,1188,1001,1351,982,1005,979,1325,1046,943,1279,824,1008,989,1798,1277,1025,987,1043,1211,1074,981,939,1002,739,1139,1108,1013,1070,978,1458,1317,157,1357,1077,2355,1116,1037,1178,1637,1314,1109,1056,1702,1474,1071,1158,832,993,1404,1024,1068,1339,1106,1264,1248,913,1848,1328,1633,1224,1143,135,1378,959,1028,998,911,1527,1203,1266,1483,1165,990,938,965,1257,1418,1099,942,1352,956,1035,1398,1003,1094,1292,138,1721,1827,1449,1354,1148,1184,1285,1281,1213,1290,1271,1252,1274,1778,1591,1503,1437,1571,1584,1957,1117,1781,1648,1342,1667,1510,1965,1607,1365,1849,1259,1303,1356,1238,2208,1564,173,1671,1286,1227,1638,1529,668,1078,918,709,865,880,940,1534,1015,874,922,841,794,1194,822,1105,1658,1359,1296,1438,1921,1844,1570,1429,1324,1400,140,1787,1558,1654,1492,1747,2224,2002,2009,1323,1349,1785,1573,1722,1829,1353,1548,1552,1583,1624,1585,1245,1364,1514,1343,1397,1355,2211,1481,1770,160,2388,2293,2256,2552,2569,2478,2039,2496,2578,2814,2519,2461,2587,2492,2714,3278,2654,3050,2447,2849,2238,2369,2061,2214,2602,2563,2186,2985,2749,3364,2038,2282,2409,2126,2573,2206,2176,2268,2182,2402,2705,2633,2414,2213,2801,3313,3410,3195,1952,2017,1509,2537,2645,2027,2415,2838,2356,1906,3184,2950,2807,2954,1683,1316,1034,1138,1763,1822,1705,1246,1701,1097,1104,1187,1032,1083,1228,916,1489,1033,1652,997,692,837,1023,888,864,1089,1231,1214,1675,1156,1075,1520,1309,139,1205,1051,735,1123,1072,915,567,768,825,1253,983,1007,762,1058,861,862,971,1208,1149,1145,1029,1084,927,810,838,857,807,936,949,2321,1622,1069,1113,1057,854,1958,1528,1618,2049,1432,1679,1796,1685,1346,1275,1476,1505,1610,2018,1599,1215,1838,1909,132,3902,2215,2240,3266,3208,3073,2454,2969,2451,1875,2728,1884,2371,2516,2842,1690,1904,2346,3146,1386,2607,1966,2668,1665,2885,1606,2577,3074,2869,2403,2433,2082,1939,1587,2460,2747,2032,2642,1619,3123,1993,2090,2339,3829,1737,2622,2340,2322,3828,4409,2305,3411,2510,4527,3030,3569,3043,2457,1946,2277,2044,2909,1693,1945,2093,2399,2115,2898,2742,2242,3895,3378,3376,2769,2223,3062,3262,2651,2949,2768,3128,2423,1977,2087,2866,3388,2830,2210,2489,2884,3945,2099,2713,3402,1692,2931,4195,3989,3206,4391,3004,3704,3494,2902,999,881,901,919,748,869,1018,1045,1049,1333,954,1092,1019,976,1771,1480,1396,953,1026,161,3533,2495,1818,3007,2595,3427,3537,2216,1895,2304,3396,1739,2073,1962,2203,1767,2666,2264,2276,2852,1807,3735,1560,4144,1669,1676,1972,2418,3291,1525,2040,2766,2337,2220,2800,3001,2078,1759,2836,1896,2026,1758,1543,1047,896,946,1060,1384,1482,815,1414,1322,1440,1240,1468,1098,1133,847,1009,1381,1052,1191,1258,1370,1712,1441,1199,957,1079,150,1262,1417,1368,1219,1136,1463,1636,1059,931,1115,1736,1174,1376,1363,1411,1247,1746,1313,1299,1617,1102,1076,1495,1265,1193,1263,80,{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":4992,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":4997,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":5001,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":5005,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":5009,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":5013,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":5017,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":5022,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":5026,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":5030,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":5034,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":5039,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":5043,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":5047,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":5051,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":5056,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":5060,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":5064,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":5068,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":5072,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":5076,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":5080,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":5084,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":5088,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":5092,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":5096,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":5100,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":5105,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":5109,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":5113,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":5117,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":5121,"\u002Falgorithms\u002Fsequences\u002Ftries":5125,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":5129,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":5133,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":5138,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":5142,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":5146,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":5150,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":5154,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":5158,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":5162,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":5166,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":5170,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":5174,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":5178,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":5182,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":5186,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":5190,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":5195,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":5199,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":5203,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":5207,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":5211,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":5216,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":5220,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":5224,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":5228,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":5232,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":5236,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":5240,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":5244,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":5248,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":5252,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":5256,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":5261,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":5265,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":5269,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":5273,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":5278,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":5282,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":5286,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":5290,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":5294,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":5298,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":5302,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":5307,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":5311,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":5315,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":5319,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":5324,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":5328,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":5332,"\u002Falgorithms":5336,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":5339,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":5344,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":5348,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":5352,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":5356,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":5361,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":5365,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":5369,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":5373,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":5378,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":5382,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":5386,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":5390,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":5395,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":5399,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":5403,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":5408,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":5412,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":5416,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":5421,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":5425,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":5429,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":5434,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":5438,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":5442,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":5446,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":5451,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":5455,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":5459,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":5464,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":5468,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":5472,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":5476,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":5480,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":5485,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":5489,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":5493,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":5497,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":5501,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":5506,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":5509,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":5513,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":5517,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":5521,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":5526,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":5530,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":5534,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":5538,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":5542,"\u002Fcalculus":5546,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":5549,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":5553,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":5557,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":5562,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":5566,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":5570,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":5574,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":5578,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":5583,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":5587,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":5591,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":5595,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":5599,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":5604,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":5608,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":5612,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":5616,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":5620,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":5625,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":5629,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":5633,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":5638,"\u002Fmechanics\u002Frotation\u002Frolling-motion":5642,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":5646,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":5650,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":5654,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":5658,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":5663,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":5667,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":5671,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":5675,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":5679,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":5683,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":5687,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":5692,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":5696,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":5700,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":5704,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":5708,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":5712,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":5716,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":5720,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":5724,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":5728,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":5732,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":5736,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":5741,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":5745,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":5749,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":5753,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":5757,"\u002Fmechanics":5761,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":5764,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":5769,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":5773,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":5777,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":5781,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":5785,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":5790,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":5794,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":5799,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":5803,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":5807,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":5811,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":5815,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":5820,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":5824,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":5828,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":5832,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":5837,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":5841,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":5845,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":5850,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":5854,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":5858,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":5862,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":5866,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":5871,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":5875,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":5879,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":5883,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":5887,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":5891,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":5896,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":5900,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":5904,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":5908,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":5912,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":5916,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":5920,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":5924,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":5929,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":5933,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":5937,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":5941,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":5945,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":5950,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":5954,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":5958,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":5962,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":5966,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":5971,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":5975,"\u002Felectricity-and-magnetism":5979,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":5982,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":5987,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":5991,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":5995,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":5999,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":6003,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":6008,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":6012,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":6016,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":6020,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":6024,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":6029,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":6033,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":6037,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":6042,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":6046,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":6050,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":6054,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":6058,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":6062,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":6066,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":6071,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":6075,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":6079,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":6083,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":6087,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":6091,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":6095,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":6100,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":6104,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":6108,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":6112,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":6116,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":6120,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":6125,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":6129,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":6133,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":6137,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":6141,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":6146,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":6150,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":6154,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":6158,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":6162,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":6166,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":6171,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":6175,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":6179,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":6183,"\u002Flinear-algebra":6187,"\u002Ftheory-of-computation":6190,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":6193,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":6197,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":6201,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":6205,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":6209,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":6213,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":6218,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":6222,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":6226,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":6230,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":6234,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":6238,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":6242,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":6247,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":6251,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":6255,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":6259,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":6263,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":6268,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":6272,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":6276,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":6280,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":6284,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":6289,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":6293,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":6297,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":6301,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":6305,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":6310,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":6314,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":6318,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":6322,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":6326,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":6331,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":6335,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":6339,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":6343,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":6347,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":6352,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":6356,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":6360,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":6365,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":6369,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":6374,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":6378,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":6382,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":6386,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":6390,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":6395,"\u002Fcomputer-architecture":6399,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":6402,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":6406,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":6410,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":6415,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":6419,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":6423,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":6427,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":6431,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":6435,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":6440,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":6444,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":6448,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":6452,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":6456,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":6460,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":6465,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":6469,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":6473,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":6478,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":6482,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":6487,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":6491,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":6495,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":6500,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":6504,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":6509,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":6513,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":6517,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":6522,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":6526,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":6530,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":6535,"\u002Fdifferential-equations":6539,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":6542,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":6547,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":6551,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":6555,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":6559,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":6563,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":6568,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":6572,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":6576,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":6580,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":6585,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":6589,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":6593,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":6597,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":6602,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":6606,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":6610,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":6614,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":6619,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":6623,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":6627,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":6631,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":6635,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":6639,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":6644,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":6648,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":6652,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":6657,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":6661,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":6665,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":6669,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":6674,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":6678,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":6682,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":6687,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":6691,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":6695,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":6700,"\u002Frelativity":6704,"\u002Fphysical-computing":6707,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":6710,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":6715,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":6719,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":6723,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":6727,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":6732,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":6736,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":6740,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":6745,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":6749,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":6753,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":6757,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":6761,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":6765,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":6770,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":6774,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":6778,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":6782,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":6786,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":6790,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":6795,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":6799,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":6803,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":6807,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":6811,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":6815,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":6819,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":6824,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":6828,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":6832,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":6837,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":6841,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":6845,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":6850,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":6854,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":6859,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":6863,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":6867,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":6871,"\u002Fquantum-mechanics":6875,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":6878,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":6883,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":6887,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":6891,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":6895,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":6900,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":6904,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":6908,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":6912,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":6916,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":6920,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":6925,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":6929,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":6933,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":6937,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":6941,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":6945,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":6949,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":6953,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":6957,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":6961,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":6965,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":6970,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":6974,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":6978,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":6982,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":6987,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":6991,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":6995,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":6998,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":7002,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":7007,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":7011,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":7015,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":7019,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":7024,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":7028,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":7032,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":7036,"\u002Freal-analysis":7040,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":7043,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":7047,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":7051,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":7056,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":7060,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":7064,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":7068,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":7073,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":7077,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":7081,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":7085,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":7089,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":7093,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":7098,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":7102,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":7106,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":7110,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":7115,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":7119,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":7123,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":7127,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":7132,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":7136,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":7140,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":7145,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":7149,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":7153,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":7157,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":7162,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":7166,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":7170,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":7174,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":7179,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":7183,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":7187,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":7192,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":7196,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":7200,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":7204,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":7209,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":7213,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":7217,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":7221,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":7225,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":7230,"\u002Fabstract-algebra":7234,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":7237,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":7242,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":7246,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":7250,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":7254,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":7258,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":7263,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":7267,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":7271,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":7275,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":7279,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":7283,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":7287,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":7292,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":7296,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":7300,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":7304,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":7309,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":7313,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":7317,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":7322,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":7326,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":7330,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":7334,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":7338,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":7342,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":7347,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":7351,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":7355,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":7360,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":7364,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":7368,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":7372,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":7377,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":7381,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":7385,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":7390,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":7394,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":7398,"\u002Fatomic-physics":7402,"\u002Fdatabases":7405,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":7408,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":7412,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":7416,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":7420,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":7424,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":7428,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":7432,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":7437,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":7441,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":7445,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":7450,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":7454,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":7458,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":7463,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":7467,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":7471,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":7475,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":7479,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":7484,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":7488,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":7492,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":7496,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":7501,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":7505,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":7509,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":7513,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":7518,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":7522,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":7526,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":7530,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":7535,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":7539,"\u002Fcategory-theory":7543,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":7546,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":7550,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":7554,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":7558,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":7561,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":7565,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":7569,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":7573,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":7578,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":7582,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":7586,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":7590,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":7594,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":7599,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":7603,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":7607,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":7611,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":7615,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":7620,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":7624,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":7628,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":7632,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":7637,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":7641,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":7645,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":7649,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":7653,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":7657,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":7661,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":7665,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":7669,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":7674,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":7678,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":7682,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":7686,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":7690,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":7695,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":7699,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":7703,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":7707,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":7711,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":7715,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":7719,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":7724,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":7728,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":7732,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":7737,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":7741,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":7745,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":7749,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":7753,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":7757,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":7761,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":7766,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":7770,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":7774,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":7778,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":7782,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":7786,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":7790,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":7794,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":7798,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":7802,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":7806,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":7811,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":7815,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":7819,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":7823,"\u002Fdeep-learning":7827,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":7830,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":7834,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":7838,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":7842,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":7846,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":7850,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":7855,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":7859,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":7863,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":7867,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":7872,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":7876,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":7880,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":7884,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":7889,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":7893,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":7897,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":7901,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":7905,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":7910,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":7914,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":7918,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":7923,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":7927,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":7931,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":7936,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":7940,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":7944,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":7948,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":7953,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":7957,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":7961,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":7965,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":7969,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":7973,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":7978,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":7982,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":7986,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":7990,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":7995,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":7999,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":8003,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":8008,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":8012,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":8016,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":8020,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":8024,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":8029,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":8033,"\u002Fstatistical-mechanics":8037,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":8040,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":8045,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":8049,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":8053,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":8057,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":8062,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":8066,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":8070,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":8074,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":8079,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":8083,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":8087,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":8091,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":8096,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":8100,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":8104,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":8108,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":8113,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":8117,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":8121,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":8125,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":8130,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":8134,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":8138,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":8142,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":8147,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":8151,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":8155,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":8159,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":8163,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":8168,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":8172,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":8177,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":8181,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":8185,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":8189,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":8194,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":8198,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":8202,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":8206,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":8210,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":8215,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":8219,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":8223,"\u002Fcondensed-matter":8227,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":8230,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":8234,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":8239,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":8243,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":8247,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":8251,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":8255,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":8259,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":8263,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":8268,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":8272,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":8276,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":8280,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":8285,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":8289,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":8293,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":8297,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":8302,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":8306,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":8310,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":8314,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":8319,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":8323,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":8327,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":8331,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":8336,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":8340,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":8344,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":8349,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":8353,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":8358,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":8362,"\u002Flogic":8366,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":8369,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":8373,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":8377,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":8381,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":8385,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":8389,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":8393,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":8397,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":8401,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":8405,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":8409,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":8413,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":8417,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":8421,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":8425,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":8429,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":8433,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":8437,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":8441,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":8446,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":8450,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":8454,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":8458,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":8462,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":8466,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":8470,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":8474,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":8478,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":8482,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":8486,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":8490,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":8494,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":8498,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":8502,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":8506,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":8510,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":8514,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":8518,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":8522,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":8526,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":8530,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":8535,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":8539,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":8543,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":8547,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":8551,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":8555,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":8559,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":8563,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":8567,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":8571,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":8575,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":8579,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":8583,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":8587,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":8591,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":8595,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":8599,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":8603,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":8607,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":8611,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":8615,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":8619,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":8624,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":8628,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":8632,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":8636,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":8640,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":8644,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":8648,"\u002Freinforcement-learning":8652,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":8654,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":8658,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":8662,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":8666,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":8670,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":8675,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":8679,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":8683,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":8687,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":8691,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":8695,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":8699,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":8703,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":8707,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":8711,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":8715,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":8719,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":8724,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":8728,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":8732,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":8736,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":8740,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":8744,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":8748,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":8752,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":8756,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":8760,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":8764,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":8768,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":8773,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":8777,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":8781,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":8785,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":8789,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":8793,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":8797,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":8800,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":8804,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":8808,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":8813,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":8817,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":8821,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":8825,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":8828,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":8832,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":8836,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":8840,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":8845,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":8849,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":8853,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":8857,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":8861,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":8865,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":8869,"\u002Fartificial-intelligence":8873,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":8876,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":8881,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":8885,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":8889,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":8893,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":8897,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":8902,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":8906,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":8910,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":8914,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":8919,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":8923,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":8927,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":8931,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":8936,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":8940,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":8945,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":8949,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":8954,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":8958,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":8962,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":8966,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":8971,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":8975,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":8979,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":8984,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":8988,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":8992,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":8997,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":9001,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":9006,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":9010,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":9014,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":9019,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":9023,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":9027,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":9031,"\u002Fnuclear-physics":9035,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":9038,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":9042,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":9046,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":9050,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":9054,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":9058,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":9063,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":9067,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":9071,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":9075,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":9080,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":9084,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":9088,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":9092,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":9096,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":9100,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":9104,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":9107,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":9110,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":9114,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":9118,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":9122,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":9127,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":9131,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":9135,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":9139,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":9143,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":9147,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":9151,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":9155,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":9159,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":9163,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":9167,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":9171,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":9175,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":9179,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":9183,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":9187,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":9191,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":9195,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":9199,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":9203,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":9207,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":9211,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":9215,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":9219,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":9223,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":9227,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":9231,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":9235,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":9240,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":9244,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":9248,"\u002Fnatural-language-processing":9252,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":9255,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":9259,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":9263,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":9267,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":9272,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":9276,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":9280,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":9284,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":9289,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":9293,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":9297,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":9301,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":9306,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":9310,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":9314,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":9318,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":9323,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":9327,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":9331,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":9336,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":9340,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":9344,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":9348,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":9353,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":9357,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":9361,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":9365,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":9370,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":9374,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":9378,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":9382,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":9387,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":9391,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":9395,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":9399,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":9403,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":9408,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":9412,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":9416,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":9421,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":9425,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":9429,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":9433,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":9437,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":9441,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":9445,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":9449,"\u002Fparticle-physics":9453,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":9456,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":9461,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":9465,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":9469,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":9474,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":9478,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":9482,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":9486,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":9490,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":9494,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":9498,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":9499,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":9504,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":9508,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":9512,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":9516,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":9521,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":9525,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":9529,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":9533,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":9538,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":9542,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":9546,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":9551,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":9555,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":9559,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":9563,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":9567,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":9571,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":9575,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":9579,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":9583,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":9588,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":9592,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":9596,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":9600,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":9605,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":9609,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":9613,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":9617,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":9621,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":9626,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":9630,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":9633,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":9637,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":9641,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":9646,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":9650,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":9654,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":9658,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":9662,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":9666,"\u002Fastrophysics-cosmology":9670,"\u002Fcolophon":9673,"\u002F":9676},{"path":4993,"title":4994,"module":4995,"summary":4996},"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm","What Is an Algorithm?","Foundations","An algorithm is a finite, mechanical recipe that transforms inputs into outputs. We define what counts as an algorithm, how we write one down, and the three things we always ask of it: is it correct, is it fast, and can we prove it.\n",{"path":4998,"title":4999,"module":4995,"summary":5000},"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques","Proof Techniques","An algorithm without a proof is a conjecture. This lesson collects the handful\nof arguments that certify the algorithms in this course — direct proof,\ncontrapositive, contradiction, ordinary and strong induction, construction, and\ndisproof by counterexample — each with a small worked\nexample and a picture. Loop invariants are a form of induction,\nrecursive correctness falls to strong induction, and the classic broken proofs\n(all horses are the same color) show where inductions go wrong.\n",{"path":5002,"title":5003,"module":4995,"summary":5004},"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis","Asymptotic Analysis","We measure an algorithm's running time as a function of its input size, then strip away machine-specific constants and lower-order terms to compare algorithms cleanly. This lesson defines the RAM model and the $O$, $\\Omega$, $\\Theta$, $o$, and $\\omega$ notations, proves the polynomial theorem, and shows how to rank growth rates with the limit test, L'Hôpital, base substitution, and the logarithm identities the arguments lean on.\n",{"path":5006,"title":5007,"module":4995,"summary":5008},"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis","Growth Rates and Loop Analysis","With the asymptotic notations in hand, we rank the functions that actually arise in running times — from constant to factorial — proving the orderings between rungs, then read the running time of a loop nest straight off the page. Sequential blocks add, nested loops multiply, index scaling gives logarithms; a worked trace and a tour of cache-aware and galactic algorithms close the lesson.\n",{"path":5010,"title":5011,"module":4995,"summary":5012},"\u002Falgorithms\u002Ffoundations\u002Frecurrences","Recurrences and the Master Theorem","Recursive and divide-and-conquer algorithms describe their own running time with a recurrence: $T(n)$ in terms of $T$ on smaller inputs. We solve recurrences three ways — drawing the recursion tree, guessing-and-verifying by induction, and applying the Master Theorem — using merge sort as the running example, then handle unequal splits with Akra–Bazzi.\n",{"path":5014,"title":5015,"module":4995,"summary":5016},"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis","Amortized Analysis","Some operations are occasionally expensive but cheap on average across any\nsequence. Amortized analysis bounds the average cost per operation over a\nworst-case sequence — not an expectation — so a rare costly step is paid for by\nthe many cheap ones around it. This lesson develops the aggregate, accounting,\nand potential methods on dynamic-array doubling, the binary counter, and a\nstack with multipop.\n",{"path":5018,"title":5019,"module":5020,"summary":5021},"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort","Divide and Conquer & Mergesort","Divide & Conquer","Divide and conquer breaks a problem into smaller copies of itself, solves\nthem recursively, and stitches the answers together. We meet the paradigm\nthrough mergesort — its merge step, its loop-invariant proof, and the\nrecursion tree that pins its cost at $\\Theta(n\\log n)$ — then count inversions\nwith the same machinery and distill the whole pattern into the master theorem.\n",{"path":5023,"title":5024,"module":5020,"summary":5025},"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort","Quicksort","Quicksort sorts in place by partitioning around a pivot and recursing on\neach side. We give Lomuto and Hoare partitioning with a correctness\ninvariant, see why a bad pivot costs $\\Theta(n^2)$ while a balanced one gives\n$\\Theta(n\\log n)$, and prove that randomizing the pivot makes the expected\ncost $\\Theta(n\\log n)$ on every input.\n",{"path":5027,"title":5028,"module":5020,"summary":5029},"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection","Linear-Time Selection","Finding the $k$-th smallest element looks like it should require sorting, but\nit does not. Quickselect adapts quicksort's partition to recurse on just one\nside, achieving expected $O(n)$. The median-of-medians algorithm guarantees a\ngood pivot with the groups-of-five trick, pushing the worst case down to a\nprovable $O(n)$.\n",{"path":5031,"title":5032,"module":5020,"summary":5033},"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication","Fast Multiplication","Grade-school multiplication is $\\Theta(n^2)$, yet divide and conquer beats it.\nKaratsuba multiplies $n$-bit integers with three half-size products instead of\nfour, giving $\\Theta(n^{\\log_2 3})$, and Strassen multiplies matrices with\nseven block products instead of eight, giving $\\Theta(n^{\\log_2 7})$. Both\nspend cheap additions to save an expensive multiplication, and the master\ntheorem quantifies the savings.\n",{"path":5035,"title":5036,"module":5037,"summary":5038},"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort","Heaps and Heapsort","Sorting & Order Statistics","A binary heap is a tree we store flat in an array, with index arithmetic\nstanding in for pointers. We build the max-heap property bottom-up in $O(n)$\ntime, sort in place in $\\Theta(n\\log n)$ by repeatedly extracting the maximum,\nand reuse the same structure to implement a priority queue.\n",{"path":5040,"title":5041,"module":5037,"summary":5042},"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds","Lower Bounds for Comparison Sorting","Every sort we have seen runs in $\\Omega(n\\log n)$, and that is no accident.\nModeling a sort as a decision tree of comparisons, we show any such tree must\nhave $n!$ leaves, forcing height $\\ge \\log_2(n!) = \\Omega(n\\log n)$ — a bound\nno comparison sort beats in the worst case, on average, or with randomness.\n",{"path":5044,"title":5045,"module":5037,"summary":5046},"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting","Sorting in Linear Time","The $\\Omega(n\\log n)$ barrier only binds algorithms that compare. By instead\nusing keys as array indices we slip past it: counting sort runs in\n$\\Theta(n+k)$ and is stable, radix sort layers it digit by digit, and bucket\nsort averages $\\Theta(n)$ on uniform data. We see exactly when each applies.\n",{"path":5048,"title":5049,"module":5037,"summary":5050},"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting","External Sorting","When the data dwarfs main memory, the cost that matters is no longer\ncomparisons but block transfers to and from disk. External merge sort sorts\nmemory-sized runs, then folds them together with a heap-driven $k$-way merge in\n$\\Theta(\\log_k(N\u002FM))$ passes. Larger fan-out cuts passes; replacement selection\nbuilds longer runs to cut them further.\n",{"path":5052,"title":5053,"module":5054,"summary":5055},"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures","Elementary Data Structures","Data Structures","Every container is built one of two ways: **contiguous** in an array, or\n**linked** through pointers. We trade cache-friendly random access against\n$O(1)$ splicing, derive the **amortized $O(1)$** append of a doubling dynamic\narray, and assemble the two ordered access disciplines — the LIFO **stack** and\nthe FIFO **queue** (with its generalization, the **deque**) — on top of both.\n",{"path":5057,"title":5058,"module":5054,"summary":5059},"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables","Hash Tables","A hash table implements the dictionary — insert, search, delete — in expected\n$O(1)$ time by scattering keys across an array with a hash function. We build\nup from direct addressing, handle collisions by chaining and by open\naddressing, analyze the load factor $\\alpha$, and see how universal hashing\nachieves its expected-time guarantee against every input.\n",{"path":5061,"title":5062,"module":5054,"summary":5063},"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees","Binary Search Trees","A binary search tree keeps keys ordered so that every operation follows a\nsingle root-to-leaf path. We state the BST property, trace search, insert,\nsuccessor, and all three delete cases on concrete trees, prove the inorder\nwalk sorts, and note the drawback — every operation costs $O(h)$, and a\ncarelessly built tree degrades to height $h = \\Theta(n)$, motivating balance.\n",{"path":5065,"title":5066,"module":5054,"summary":5067},"\u002Falgorithms\u002Fdata-structures\u002Favl-trees","AVL Trees","An AVL tree is the first balanced BST: at every node the two subtrees' heights\ndiffer by at most $1$. A Fibonacci-style minimal-node argument forces height\n$h \\le 1.44\\log_2 n = O(\\log n)$, so search, insert, and delete are all\n$O(\\log n)$. Insertion rebalances with at most one of four rotation cases\n(LL, RR, LR, RL); deletion may rotate all the way to the root.\n",{"path":5069,"title":5070,"module":5054,"summary":5071},"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees","Balanced Search Trees","An ordinary BST can degrade to height $\\Theta(n)$; balanced search trees\nguarantee $h = O(\\log n)$ by maintaining invariants and repairing them after\nevery update. We meet rotations, the local restructuring primitive, then\nred-black trees, whose color invariants force logarithmic height, and finally\nB-trees, which trade tall-and-thin for short-and-wide to win on disk.\n",{"path":5073,"title":5074,"module":5054,"summary":5075},"\u002Falgorithms\u002Fdata-structures\u002Funion-find","Disjoint Sets (Union-Find)","The disjoint-set data structure tracks a partition of elements into groups,\nanswering \"are these two in the same group?\" and merging groups on demand. A\nforest of parent pointers, sped up by union by rank and path compression,\ndrives every operation to near-constant $O(\\alpha(n))$ amortized time — the\nstructure behind connectivity queries and Kruskal's minimum spanning tree.\n",{"path":5077,"title":5078,"module":5054,"summary":5079},"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees","Fenwick & Segment Trees","A prefix-sum array answers a range sum in $O(1)$ but pays $O(n)$ per update;\na plain array updates in $O(1)$ but pays $O(n)$ per range sum. Fenwick and\nsegment trees give us _both_ in $O(\\log n)$. The Fenwick (binary indexed) tree\nis a tiny array keyed by the low bit; the segment tree is a general balanced\ntree over canonical ranges that handles any associative aggregate and, with\nlazy propagation, range updates too.\n",{"path":5081,"title":5082,"module":5054,"summary":5083},"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures","Spatial Data Structures","A balanced BST orders keys on a line, but points in the plane have no single\nnatural order. Quadtrees subdivide space recursively into quadrants; k-d trees\nsplit on alternating coordinates at the median. Both make range and\nnearest-neighbour queries fast by carving the plane into boxes a query can\nprune away. Range trees nest a y-tree in an x-tree for fast orthogonal range\nreporting; interval trees index intervals to answer stabbing queries.\n",{"path":5085,"title":5086,"module":5054,"summary":5087},"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures","Skip Lists & Probabilistic Structures","Balanced trees achieve $O(\\log n)$ with rotations and invariants; randomization\ngives the same bound far more simply. A skip list is a layered linked list whose\nexpress lanes are chosen by coin flips, giving expected $O(\\log n)$ search and\ninsert with no rebalancing. A Bloom filter trades exactness for space: a bit\narray and a few hashes answer set membership with no false negatives and a\ntunable false-positive rate, but cannot delete.\n",{"path":5089,"title":5090,"module":5054,"summary":5091},"\u002Falgorithms\u002Fdata-structures\u002Fb-trees","B-Trees","When data lives on disk, the cost that dominates is block transfers, not\ncomparisons — and a binary tree of a billion keys is thirty reads deep. A\nB-tree of minimum degree $t$ is short and wide: $t-1$ to $2t-1$ keys per node,\nall leaves at one depth, height $O(\\log_t n)$. Insertion splits a full node on\nthe way down and pushes its median up; deletion borrows or merges to keep nodes\nfull enough. High fan-out is what minimizes disk I\u002FO.\n",{"path":5093,"title":5094,"module":5054,"summary":5095},"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms","Data-Stream Algorithms","Most of this course assumes data sits in fast memory, addressable at will.\nExternal sorting relaxed that to a re-readable disk. The streaming model goes\nfurther: items arrive one at a time, are seen once, and must be discarded, with\nonly sublinear, often polylogarithmic, memory. In exchange, the answers are\napproximate and probabilistic. We set up the model, then meet reservoir\nsampling for a uniform sample of an unknown-length stream and Morris counting\nfor an approximate tally in doubly-logarithmic space.\n",{"path":5097,"title":5098,"module":5054,"summary":5099},"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches","Streaming Sketches","Sampling and counting kept a random subset or a single approximate tally.\nSketches go further: fixed, tiny summaries that answer questions about a\nstream's frequencies. We meet the Count–Min sketch for point frequency\nestimation, Misra–Gries for heavy hitters, and HyperLogLog for distinct\ncounts, each trading a controlled error for space that never grows with the\nstream.\n",{"path":5101,"title":5102,"module":5103,"summary":5104},"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows","Two Pointers & Sliding Windows","Sequences & Strings","A family of array idioms that collapse an obvious $O(n^2)$ scan into a single\n$O(n)$ pass by maintaining an invariant as indices move. We meet two pointers\n(converging on a sorted array, and a fast\u002Fslow pair for in-place rewriting)\nand the sliding window (fixed and variable size, amortized $O(n)$). The\ncompanion lesson on prefix sums picks up where the window's positivity\nassumption fails.\n",{"path":5106,"title":5107,"module":5103,"summary":5108},"\u002Falgorithms\u002Fsequences\u002Fprefix-sums","Prefix Sums & Difference Arrays","Prefix sums precompute the running total once so that any range-sum query is a\nsingle subtraction, $P[r{+}1]-P[l]$, in $O(1)$. A hash map of prefix\nfrequencies then counts subarrays summing to $k$ in $O(n)$ — even with negative\nentries, where the sliding window fails. The difference-array dual turns $m$\nrange-adds into $O(m+n)$, and the whole idea lifts to 2-D rectangle sums by\ninclusion–exclusion.\n",{"path":5110,"title":5111,"module":5103,"summary":5112},"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks","Monotonic Stacks & Queues","A **monotonic stack** keeps its contents sorted by popping every element that\nwould break the order before each push — turning a family of \"previous\u002Fnext\ngreater (or smaller) element\" questions into a single $O(n)$ scan. We trace\nthe next-greater-element routine push by push and prove its amortized bound,\nfuse two such scans to measure the **largest rectangle in a histogram** in\nlinear time, extend the idea to a **monotonic deque** that streams the\n**sliding-window maximum** in $O(n)$, and use asymmetric tie-breaking to\ncount **subarray minimums** without double-counting duplicates.\n",{"path":5114,"title":5115,"module":5103,"summary":5116},"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer","Binary Search on the Answer","Binary search locates the boundary of a **monotone predicate** $p(x)$ in\n$O(\\log(\\text{range}))$ probes; sorted arrays are only one instance. We first\nestablish the half-open `while (lo \u003C hi)` template for $\\textsc{lower\\_bound}$\nand $\\textsc{upper\\_bound}$, then generalize to \"binary search on the answer\":\nwhenever feasibility is monotone in a numeric parameter, we binary search the\nparameter itself, calling a feasibility check at each step.\n",{"path":5118,"title":5119,"module":5103,"summary":5120},"\u002Falgorithms\u002Fsequences\u002Fstring-matching","String Matching: Naive & Rabin–Karp","Given a text $T$ of length $n$ and a pattern $P$ of length $m$, find every\noccurrence of $P$ in $T$. The naive scan costs $O(nm)$ and re-reads text it has\nalready seen. Rabin–Karp fixes the first inefficiency with a **rolling hash**:\neach length-$m$ window is summarized by one number, updated in $O(1)$ per slide,\nverified on a hash match to kill collisions, for expected $O(n+m)$. A companion\nlesson removes the re-reading entirely with KMP and the Z-function.\n",{"path":5122,"title":5123,"module":5103,"summary":5124},"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function","String Matching: KMP & the Z-Function","Two linear-time matchers that beat Rabin–Karp's expected bound with a\nworst-case guarantee and no randomness. KMP precomputes a **failure function**\n$\\pi$ so a mismatch slides the pattern by $q-\\pi[q-1]$ and the text pointer\nnever backs up, for $O(n+m)$. The **Z-function** computes the longest\nprefix-match at every position via the Z-box, giving the same bound from a\ndifferent angle; the two encodings of a string's self-overlap convert freely.\n",{"path":5126,"title":5127,"module":5103,"summary":5128},"\u002Falgorithms\u002Fsequences\u002Ftries","Tries & Prefix Trees","A **trie** stores a set of strings in a tree keyed by _characters_, so that\ninsert, search, delete, and prefix-test all run in $O(L)$ time — the length\nof the key, _independent of how many keys are stored_. Shared prefixes are\nstored once, which makes tries the natural structure for autocomplete,\nwildcard dictionaries, board word-search, and — over the alphabet $\\{0,1\\}$\n— the maximum-XOR-pair problem. Radix (Patricia) trees compress the chains.\n",{"path":5130,"title":5131,"module":5103,"summary":5132},"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick","Suffix Arrays, LCP & Aho–Corasick","A **suffix array** sorts all $n$ suffixes of a string, indexing every substring\nat once; built in $O(n\\log n)$, it locates a pattern by binary search in\n$O(m\\log n)$. Its companion **LCP array** (Kasai's $O(n)$ algorithm) counts\ndistinct substrings and finds the longest repeated substring. **Aho–Corasick**\ngeneralises KMP to a whole dictionary: a trie of patterns plus failure links\nscans the text once in $O(\\text{text} + \\text{matches})$ to report every\noccurrence of every pattern. Manacher's algorithm finds all palindromic\nsubstrings in $O(n)$.\n",{"path":5134,"title":5135,"module":5136,"summary":5137},"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal","Graph Representations and Traversal","Graphs","A graph captures _relationships_ — who connects to whom. We fix the\nvocabulary, weigh the two standard representations (adjacency list versus\nmatrix), then meet the single search skeleton behind everything that follows:\nWhatever-First-Search, and its breadth-first reading, which finds shortest\npaths by number of edges in $O(V + E)$.\n",{"path":5139,"title":5140,"module":5136,"summary":5141},"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search","Depth-First Search","Swap BFS's queue for a stack and the search plunges instead of fanning out.\nDepth-first search stamps every vertex with discovery and finish times that\nnest like parentheses, classifies each edge as tree, back, forward, or cross,\nand — through the back edge — decides in one pass whether a graph has a cycle.\nThese timestamps underpin topological sort, strong\nconnectivity, and the rest of this module.\n",{"path":5143,"title":5144,"module":5136,"summary":5145},"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc","Topological Sort and Strong Connectivity","Directed acyclic graphs model dependencies: tasks that must precede other\ntasks. A _topological order_ lays such a graph out in a line so every edge\npoints forward, and depth-first finish times yield one almost for free.\nWe then ask the harder question for graphs _with_ cycles: which vertices can\nreach each other? The answer is the strongly connected components, found by a\ntwo-pass DFS.\n",{"path":5147,"title":5148,"module":5136,"summary":5149},"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees","Minimum Spanning Trees","Given a weighted network, how do we connect everything as cheaply as possible?\nThe answer is a minimum spanning tree, and one lemma — the cut property —\njustifies _every_ correct MST algorithm. We prove the cut and cycle\nproperties by exchange arguments, use them to settle uniqueness, and meet the\noldest MST algorithm, Borůvka's, whose parallel component-merging rounds fall\nstraight out of the cut rule.\n",{"path":5151,"title":5152,"module":5136,"summary":5153},"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim","Kruskal and Prim","The two minimum-spanning-tree algorithms you will actually implement.\nKruskal grows a forest edge by edge, cheapest first, using a union-find\nstructure to reject cycle-closing edges; Prim grows one tree outward from a\nroot with a priority queue, exactly Dijkstra rekeyed by attachment cost. Both\ntraced in full on a nine-town graph, with the edge cases, the bottleneck\nproperty, and where each one wins.\n",{"path":5155,"title":5156,"module":5136,"summary":5157},"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths","Shortest Paths","Finding the cheapest route through a weighted network is one of the most-used\nalgorithms in computing, and a single operation — _relaxation_ — underlies\nevery method. We build the primitive, prove the triangle inequality and\noptimal substructure that make it work, then meet Dijkstra's algorithm: the\ngreedy solution for non-negative weights, traced vertex by vertex, with the\ncut argument that proves each extraction is final.\n",{"path":5159,"title":5160,"module":5136,"summary":5161},"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights","All-Pairs and Negative Weights","Dijkstra's greedy schedule breaks the moment an edge goes negative. We give it\nup for dynamic programming: Bellman-Ford derived as a DP over edge budgets,\nwith its negative-cycle detector, and Floyd-Warshall computing the distance\nbetween _every_ pair of vertices via a DP over which vertices a path may pass\nthrough. We close with Johnson's algorithm and the arbitrage problems that\nnegative cycles encode.\n",{"path":5163,"title":5164,"module":5136,"summary":5165},"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow","Network Flow","How much can flow through a network from source to sink? We build flow\nnetworks with capacity and conservation constraints, increase a flow by\npushing along augmenting paths in the residual graph, and see how reverse\nedges let the algorithm undo earlier routing. Ford-Fulkerson and its BFS refinement\nEdmonds-Karp find a maximum flow, traced end to end on a worked network.\n",{"path":5167,"title":5168,"module":5136,"summary":5169},"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut","Max-Flow Min-Cut and Applications","Why is the flow found when no augmenting path remains actually optimal? The\nanswer is a duality theorem: the maximum flow equals the minimum cut. We prove\nit, read the minimum cut off the final residual graph, then derive bipartite\nmatching and a catalog of modeling reductions from the flow\nabstraction — before touching the modern algorithms that supersede\nEdmonds-Karp.\n",{"path":5171,"title":5172,"module":5136,"summary":5173},"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points","Bridges & Articulation Points","A **bridge** is an edge whose removal disconnects the graph; an **articulation\npoint** is a vertex whose removal does. Both are single points of failure in a\nnetwork. A single depth-first search computes discovery times and **low-links**,\nand two local criteria — $low[v] > disc[u]$ for bridges, $low[v] \\ge disc[u]$\nfor cut vertices — find them all in $O(V+E)$.\n",{"path":5175,"title":5176,"module":5136,"summary":5177},"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor","Lowest Common Ancestor & Binary Lifting","Given a rooted tree, the lowest common ancestor of $u$ and $v$ is the deepest\nnode that is an ancestor of both. A naive walk answers one query in $O(h)$;\n**binary lifting** precomputes the $2^k$-th ancestor of every node in\n$O(n\\log n)$, then answers $k$-th-ancestor and LCA queries in $O(\\log n)$ each.\nWe derive both jumps, apply them to tree distance, and compare against the\nEuler-tour + RMQ and Tarjan offline alternatives.\n",{"path":5179,"title":5180,"module":5136,"summary":5181},"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat","2-SAT via Implication Graphs","A boolean formula whose every clause has exactly two literals can be solved in\n_linear_ time — even though its three-literal cousin is NP-complete. The idea\nis to read each clause as a pair of implications, build a directed graph on the\n$2n$ literals, and ask a question we already know how to answer: which literals\nshare a strongly connected component? The formula is satisfiable iff no variable\nlands in the same SCC as its own negation, and the SCCs' topological order\nyields a satisfying assignment for free.\n",{"path":5183,"title":5184,"module":5136,"summary":5185},"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours","Eulerian Tours","An **Eulerian tour** uses every _edge_ of a graph exactly once. We give the\nexact parity and balance conditions under which one exists (even degree\nfor undirected graphs, in-degree equal to out-degree for directed) and Hierholzer's\n$O(E)$ algorithm that constructs one by splicing closed sub-tours. We contrast\nthis sharply with the **Hamiltonian** problem (visit every _vertex_ once),\nwhich is NP-complete: visiting edges is easy, visiting vertices is hard.\n",{"path":5187,"title":5188,"module":5136,"summary":5189},"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching","Bipartite Matching","Pairing applicants to jobs, students to slots, files to disks: all are\n**maximum bipartite matching**. We solve it combinatorially with **augmenting\npaths** (Kuhn's algorithm, $O(VE)$), speed it up to $O(E\\sqrt V)$ with\n**Hopcroft–Karp**, and uncover the structure behind it — **König's theorem**\n(max matching equals min vertex cover) and **Hall's marriage theorem** (a\nperfect matching exists iff every set has enough neighbors).\n",{"path":5191,"title":5192,"module":5193,"summary":5194},"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method","The Greedy Method","Greedy Algorithms","A greedy algorithm builds a solution one locally-best choice at a time and\nnever looks back. We isolate the two properties that make this work — the\ngreedy-choice property and optimal substructure — prove the canonical\nactivity-selection algorithm correct with an exchange argument, watch greedy\nfail on the 0\u002F1 knapsack, and glimpse matroids as the theory\nthat says exactly when the greedy method is optimal.\n",{"path":5196,"title":5197,"module":5193,"summary":5198},"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals","Scheduling & Interval Partitioning","Three classic scheduling problems all yield to greedy algorithms — and all\nthree turn on a single design decision: which key to sort by. Interval\nscheduling sorts by **finish** time to pack the most compatible jobs;\ninterval partitioning sorts by **start** time and proves the rooms needed\nequal the maximum overlap **depth**; minimizing maximum lateness sorts by\n**deadline** and is justified by an adjacent-swap exchange argument.\n",{"path":5200,"title":5201,"module":5193,"summary":5202},"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes","Huffman Codes","Huffman coding builds a\nprovably optimal prefix-free binary code by repeatedly merging the two least\nfrequent symbols. We develop prefix-free codes as binary trees, give the\nalgorithm with a priority queue, build a Huffman tree from example\nfrequencies, prove optimality with the same greedy-choice-plus-substructure\nargument, and pin the running time at $O(n\\log n)$.\n",{"path":5204,"title":5205,"module":5193,"summary":5206},"\u002Falgorithms\u002Fgreedy\u002Fmatroids","Matroids & Exchange Arguments","The capstone of the greedy module: _why_ and _when_ a greedy algorithm is\nprovably optimal. We recap the two correctness templates — **greedy-stays-ahead**\nand the **exchange argument** — then meet the **matroid** $M=(S,\\mathcal{I})$, an\nabstraction whose **exchange property** is the structure greedy needs.\nThe matroid–greedy theorem says sorting by weight and taking what stays\nindependent yields a maximum-weight basis _if and only if_ the structure is a\nmatroid. Kruskal's MST is the canonical instance; 0\u002F1 knapsack and TSP are the\ncanonical failures.\n",{"path":5208,"title":5209,"module":5193,"summary":5210},"\u002Falgorithms\u002Fgreedy\u002Fstable-matching","Stable Matching (Gale–Shapley)","Two sides each rank the other; we want a matching with no **blocking pair** — no\ntwo participants who both prefer each other to their assigned partners. The\n**Gale–Shapley deferred-acceptance** algorithm has proposers propose in\npreference order while receivers tentatively hold the best offer so far. We prove\nit terminates in $\\O(n^2)$ proposals, returns a **perfect** matching, and that\nthe matching is **stable**. A sharper asymmetry follows: deferred acceptance is\n**proposer-optimal** and **receiver-pessimal**, the structural fact behind the\nresidency match and school-choice systems.\n",{"path":5212,"title":5213,"module":5214,"summary":5215},"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples","Principles of Dynamic Programming","Dynamic Programming","Dynamic programming is recursion with memory: when a recursive solution\nre-solves the same subproblems again and again, we solve each one once and\nstore the answer. We identify the two structural conditions that make this\nwork — overlapping subproblems and optimal substructure — contrast top-down\nmemoization with bottom-up tabulation, and distil the whole method into a\nfive-step recipe.\n",{"path":5217,"title":5218,"module":5214,"summary":5219},"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp","Sequence Alignment & LCS","Two strings can be compared by how much of one appears inside the\nother. The longest common subsequence (LCS) and edit distance are the two\nclassic measures, and they are the _same_ dynamic program with different\ncosts. We derive the LCS recurrence by examining the last characters, fill a\nworked DP table, reconstruct the subsequence, and then show edit distance as\nthe identical $\\Theta(mn)$ pattern.\n",{"path":5221,"title":5222,"module":5214,"summary":5223},"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence","Longest Increasing Subsequence","Given a sequence of numbers, how long is its longest strictly increasing\nsubsequence? A first dynamic program indexes subproblems by the element each\nsubsequence _ends at_, giving an $O(n^2)$ solution with parent-pointer\nreconstruction. A sharper idea, the patience-sorting _tails_ array searched by\nbinary search, drops the time to $O(n\\log n)$. We then fold in the\nvariants: non-decreasing, counting, Russian-doll envelopes, and bitonic.\n",{"path":5225,"title":5226,"module":5214,"summary":5227},"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack","Knapsack & Subset Problems","We start from $\\textsc{Subset-sum}$ — does some sublist hit a target $t$? — and its\ninclude\u002Fexclude recurrence over a boolean table $A(i, u)$, then bolt on values\nto get 0\u002F1 knapsack as the same machine with $\\lor$ promoted to $\\max$. We fill\nboth tables, recover the chosen items, and confront the surprise that the\n$\\Theta(nt)$ running time is only _pseudo-polynomial_ — exponential in the bit\nlength $b$, and unimprovable unless $\\mathrm{P}=\\mathrm{NP}$ since subset-sum is\n$\\textsc{NP-complete}$. The fractional variant reveals the sharp line between greedy\nand dynamic programming.\n",{"path":5229,"title":5230,"module":5214,"summary":5231},"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded","Coin Change & Unbounded Knapsack","The previous lesson let each item be taken at most once. Drop that cap — items\nmay be reused _any number of times_ — and the 0\u002F1 knapsack collapses from a\ntwo-dimensional table to a one-dimensional one, because there is no longer a\nprefix of \"already-used\" items to track. We meet **unbounded knapsack**, then\nits most famous instance, **coin change**: the minimum-coins recurrence\n$C[a] = 1 + \\min_c C[a-c]$, and the counting variant where the _order of the\nloops_ decides whether you count unordered combinations or ordered sequences —\nthe classic bug. Greed fails in general but works for canonical coin systems.\n",{"path":5233,"title":5234,"module":5214,"summary":5235},"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp","Interval DP","Many problems ask for the best way to combine a contiguous range of items, and\nthe answer is a dynamic program over subintervals $[i,j]$ that chooses a split\npoint $k$. We derive the pattern from matrix-chain multiplication —\nparenthesising a product to minimize scalar multiplications in $O(n^3)$ — distil\nit into a reusable template filled by increasing interval length, and then meet\nits sharpest variant: the \"last operation\" trick behind Burst Balloons and\ncutting a stick, where fixing the _last_ move (not the first) makes the two\nsides independent.\n",{"path":5237,"title":5238,"module":5214,"summary":5239},"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp","Dynamic Programming on Trees","When the subproblems of a dynamic program are _rooted subtrees_, a single\npost-order DFS solves the whole thing in $O(n)$: each node combines the\nalready-computed answers of its children. We meet the archetype — maximum-weight\nindependent set on a tree — then the \"path through a node\" pattern behind tree\ndiameter and maximum path sum, and finally **rerooting**, which computes a\nper-node answer for _every_ node as root in $O(n)$ with two passes.\n",{"path":5241,"title":5242,"module":5214,"summary":5243},"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp","Bitmask DP","When a subproblem depends not on an index or a prefix but on _which subset_ of\na small ground set has been used, we can encode that subset as the bits of an\ninteger and index a DP table by it. With $n \\le \\sim 20$ the $2^n$ subsets fit\nin a table, turning $\\Theta(n!)$ brute force into $O(2^n \\cdot \\text{poly}(n))$.\nWe meet the bit tricks, the Held–Karp TSP archetype, assignment by mask,\nsubset-sum partitioning, and submask enumeration with its $3^n$ bound.\n",{"path":5245,"title":5246,"module":5214,"summary":5247},"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations","DP Optimizations","A correct DP recurrence is only half the battle; its naive evaluation is often\na factor of $n$ slower than necessary. This capstone surveys five techniques,\nmonotonic-queue, the convex hull trick, divide-and-conquer optimization,\nKnuth's optimization, and SOS DP, that each exploit _structure in the\ntransition_ (a sliding window, linear costs, monotone optimal splits, the\nquadrangle inequality, or subset lattices) to shave an $O(n)$, $O(\\log n)$, or\nworse factor off the running time.\n",{"path":5249,"title":5250,"module":5214,"summary":5251},"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs","Dynamic Programming on Graphs","Many graph algorithms are dynamic programs: the subproblem is the\n_best value reachable under a restricted resource_ — intermediate vertices\nallowed, edges allowed, or a topological prefix — and edge _relaxation_ is the\nDP transition. We frame Floyd–Warshall as the archetype ($O(V^3)$ all-pairs\nshortest paths), Bellman–Ford as a DP over path length (the at-most-$K$-stops\nvariant), DAG-DP in topological order ($O(V+E)$), and Warshall's transitive\nclosure as the boolean analog.\n",{"path":5253,"title":5254,"module":5214,"summary":5255},"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp","Digit & Probability DP","Two DP patterns with unusual state. _Digit DP_ counts the\nintegers in a range $[L, R]$ that satisfy a digit constraint by walking the\ndecimal places of the bound, carrying a _tight_ flag that marks when the prefix\nstill equals the bound's. _Probability\u002FExpectation DP_ replaces \"best value\" with\n\"expected value,\" using linearity of expectation to make each state an\naverage over its weighted transitions — the natural tool for expected step\ncounts and absorbing Markov chains.\n",{"path":5257,"title":5258,"module":5259,"summary":5260},"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals","Backtracking: Subsets, Permutations & Combinations","Backtracking & Search","Backtracking builds a solution one choice at a time and abandons a partial\nsolution the moment it cannot be completed, exploring a state-space tree by\ndepth-first search. We meet the universal choose\u002Fexplore\u002Fun-choose template,\nderive the canonical enumerations — subsets ($2^n$), permutations ($n!$), and\ncombinations ($\\binom{n}{k}$) — handle duplicate elements by skipping equal\nsiblings, and see how pruning turns an exponential search into a tractable one.\n",{"path":5262,"title":5263,"module":5259,"summary":5264},"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search","Constraint Search: N-Queens & Sudoku","Many hard puzzles are **constraint satisfaction problems**: assign each\nvariable a value from its domain so that every constraint holds. Backtracking\nsolves them by assigning variables one at a time and rejecting a partial\nassignment the instant a constraint breaks. We make the rejection cheap — $O(1)$\nconflict checks for N-Queens via column and diagonal sets — and prune harder\nwith **forward checking**, **MRV** ordering, and **constraint propagation**,\nwhich is what lets an exponential search actually finish.\n",{"path":5266,"title":5267,"module":5259,"summary":5268},"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound","Branch & Bound and Meet in the Middle","Plain backtracking prunes a search tree by _feasibility_; for _optimization_\nproblems we can prune far more aggressively by _value_. **Branch and bound**\nkeeps the best complete solution found so far and discards any partial solution\nwhose optimistic bound cannot beat it. **Meet in the middle** splits the\ninstance in two, enumerates each half, and recombines by binary search — turning\n$2^n$ into $O(2^{n\u002F2}\\,n)$ and pushing exact search out to $n \\approx 40$.\n",{"path":5270,"title":5271,"module":5259,"summary":5272},"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking","Graph Backtracking: m-Coloring & Hamiltonian Paths","Two famous graph problems have no known efficient algorithm, yet yield cleanly\nto backtracking with the right pruning. **Graph $m$-coloring** assigns one of\n$m$ colors to each vertex so no edge is monochromatic; we color vertices in turn\nand reject a color the instant a neighbor already has it. **Hamiltonian\npath\u002Fcycle** asks for a walk visiting every vertex exactly once; we extend a path\ngreedily and backtrack on dead ends. Both are NP-complete, so the worst case is\nexponential — but feasibility pruning and good vertex ordering make real\ninstances tractable, and the contrast with the easy Eulerian condition shows why.\n",{"path":5274,"title":5275,"module":5276,"summary":5277},"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics","Number Theory: GCD & Modular Arithmetic","Mathematical Algorithms","This lesson opens the mathematical-algorithms module with the bedrock of\ncomputational number theory. We prove Euclid's recurrence\n$\\gcd(a,b)=\\gcd(b,\\,a\\bmod b)$ and its $O(\\log\\min(a,b))$ running time, extend\nit to recover Bézout coefficients $x,y$ with $ax+by=\\gcd(a,b)$, and build\nmodular arithmetic on residue classes — including when a modular inverse\n$a^{-1}\\bmod m$ exists and how to compute it.\n",{"path":5279,"title":5280,"module":5276,"summary":5281},"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality","Modular Exponentiation & Primality","Computing $a^n \\bmod m$ naively costs $n$ multiplications; **repeated squaring**\ndoes it in $O(\\log n)$ by reading the bits of the exponent. We use this routine\nto state **Fermat's little theorem** (and the modular inverse it gives), then to\ntest primality — trial division, the probabilistic **Fermat** and **Miller–Rabin**\ntests, and the deterministic witness set that settles primality for every 64-bit\nnumber.\n",{"path":5283,"title":5284,"module":5276,"summary":5285},"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization","Sieves & Factorization","The previous lesson tested one number for primality; here we ask for _all_\nprimes up to $n$ at once. The **sieve of Eratosthenes** cross-cuts composites\nin $O(n\\log\\log n)$, and a **linear sieve** does it in $O(n)$ while recording\neach number's **smallest prime factor**, which then factors any $x \\le n$ in\n$O(\\log x)$. From a factorization $x = \\prod p_i^{e_i}$ the multiplicative\nfunctions $\\tau$, $\\sigma$, and Euler's totient $\\varphi$ fall out immediately.\n",{"path":5287,"title":5288,"module":5276,"summary":5289},"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics","Combinatorics & Counting","Counting is the arithmetic of finite sets. We build up from permutations\n$n!$ and combinations $\\binom{n}{k}$, prove Pascal's rule by a bijection,\nand count multisets with stars and bars. The practical core is computing\n$\\binom{n}{k}\\bmod p$ in $O(1)$ from precomputed factorials and inverse\nfactorials. We close with inclusion–exclusion and the Chinese Remainder\nTheorem, both of which lean on the modular inverse from the previous lesson.\n",{"path":5291,"title":5292,"module":5276,"summary":5293},"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation","Matrix Exponentiation","A linear recurrence advances by a fixed linear rule, so one step is a\n**matrix–vector** product and $n$ steps are a **matrix power**. Packaging\nFibonacci, and any $k$-term recurrence, into a transition matrix lets us jump\nto the $n$-th term in $O(k^3 \\log n)$ by **exponentiation by squaring** — the\nsame doubling trick from modular exponentiation, now over matrices.\n",{"path":5295,"title":5296,"module":5276,"summary":5297},"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform","Fast Fourier Transform","Multiplying two degree-$n$ polynomials by the schoolbook method costs\n$\\Theta(n^2)$. Evaluating them at the **$n$-th roots of unity** turns\nmultiplication into pointwise products, and the **Cooley–Tukey FFT** computes\nall those evaluations in $\\Theta(n\\log n)$ by splitting even and odd\ncoefficients. The inverse FFT interpolates back, giving $\\Theta(n\\log n)$\npolynomial and big-integer multiplication.\n",{"path":5299,"title":5300,"module":5276,"summary":5301},"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent","Numerical Optimization and Gradient Descent","Most of this course chases **discrete** optima over finite structures; here the\nsearch space is **continuous** and the objective $f$ is differentiable. The\n**gradient** points uphill, so stepping against it —\n$x_{t+1} = x_t - \\eta\\,\\nabla f(x_t)$ — walks downhill. **Convexity** makes every\nlocal minimum global; for convex $L$-smooth $f$ gradient descent converges at\n$O(1\u002Ft)$, and **geometrically** under strong convexity. **Newton's method** uses\nthe Hessian for local quadratic convergence, and **bisection** is the robust\nbracketing fallback for roots.\n",{"path":5303,"title":5304,"module":5305,"summary":5306},"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives","Geometric Primitives & Orientation","Computational Geometry","Computational geometry is built on a single reliable primitive — the\n**orientation test**, a sign of a cross product that tells whether three points\nturn left, right, or lie collinear. From points-as-vectors and the dot and\ncross products we derive orientation, segment intersection, the shoelace area\nformula, and point-in-polygon tests, keeping all arithmetic **exact and\ninteger** so that no floating-point rounding can corrupt a sign.\n",{"path":5308,"title":5309,"module":5305,"summary":5310},"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull","Convex Hull","The convex hull is the smallest convex polygon enclosing a point set — the\nrubber band snapped around the nails. We build it with Andrew's monotone chain,\nsorting by $(x,y)$ and sweeping a lower and upper hull while popping any\nnon-left turn via the orientation primitive, in $O(n\\log n)$. A reduction from\nsorting shows that bound is optimal, and the hull yields diameter, smallest\nenclosing rectangle, and more through rotating calipers.\n",{"path":5312,"title":5313,"module":5305,"summary":5314},"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line","Sweep-Line Algorithms","The plane-sweep paradigm turns a static $2$-D geometry problem into a dynamic\n$1$-D ordered-set problem: a vertical line sweeps left to right, stopping at an\n$x$-sorted **event queue** while a balanced-BST **status structure** tracks the\nobjects it currently crosses, ordered by $y$. We derive Bentley–Ottmann segment\nintersection in $O((n+k)\\log n)$, recover closest-pair in $O(n\\log n)$, and\nreduce skyline, rectangle-area, and overlap problems to $\\pm1$ event sweeps.\n",{"path":5316,"title":5317,"module":5305,"summary":5318},"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity","Polygons & Proximity","Four classics that live on top of the orientation primitive and the convex\nhull. **Closest pair** falls to divide-and-conquer in $\\Theta(n\\log n)$, where a\npacking argument caps the cross-boundary combine at seven neighbours per point.\n**Point-in-polygon** is the ray-casting parity test or the winding-number count\nthat also handles self-intersecting boundaries, both with their edge caveats. The **shoelace formula**\ngives signed area as a sum of cross products, and **rotating calipers** walk the\nhull to read off diameter and width in $O(n)$.\n",{"path":5320,"title":5321,"module":5322,"summary":5323},"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions","P, NP, and Reductions","Intractability","Most problems we have met so far have fast algorithms. A vast and important\nfamily seemingly does not. This lesson builds the vocabulary for that\ndivide: decision problems, the class $\\mathsf{P}$ of problems we can solve\nquickly, the class $\\mathsf{NP}$ of problems whose solutions we can _check_\nquickly, and polynomial-time reductions, the tool that lets us compare the\ndifficulty of two problems without solving either.\n",{"path":5325,"title":5326,"module":5322,"summary":5327},"\u002Falgorithms\u002Fintractability\u002Fnp-completeness","NP-Completeness","Some problems in $\\mathsf{NP}$ are universally hardest: every other problem\nin $\\mathsf{NP}$ reduces to them. This lesson defines $\\mathsf{NP}$-hard and\n$\\mathsf{NP}$-complete, states the Cook–Levin theorem that anchors the\ntheory on **SAT**, walks the web of reductions that grows from it, and gives\nthe four-step recipe for proving a brand-new problem $\\mathsf{NP}$-complete.\n",{"path":5329,"title":5330,"module":5322,"summary":5331},"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness","Coping with NP-Hardness","An $\\mathsf{NP}$-hardness proof rules out an exact polynomial-time algorithm,\nnot the need for answers. This lesson surveys four practical responses to\nhardness: approximation algorithms with a provable ratio (worked through a\n2-approximation for vertex cover), heuristics and local search, exact\nexponential methods like branch and bound, and exploiting special structure\nin the instances you actually face.\n",{"path":5333,"title":5334,"module":5322,"summary":5335},"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms","Approximation Algorithms","When a problem is $\\mathsf{NP}$-hard we can still ask for a solution\nprovably close to optimal. This lesson makes the approximation ratio\n$\\rho$ precise, separates absolute from relative guarantees, and proves the\nratios of four classic algorithms: greedy set cover ($H_n \\approx \\ln n$),\nthe MST-doubling $2$-approximation for metric TSP, load balancing, and the\nknapsack FPTAS. It closes with the hierarchy PTAS \u002F FPTAS and the limits of\ninapproximability.\n",{"path":5337,"title":5338,"module":6,"summary":6},"\u002Falgorithms","Algorithms",{"path":5340,"title":5341,"module":5342,"summary":5343},"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models","Functions and Mathematical Models","Limits and Continuity","A function assigns exactly one output to each input and can be presented four ways: verbally, numerically, graphically, or by a formula. The elementary families — linear, polynomial, power, rational, trigonometric, exponential — model most elementary phenomena, and transformation, combination, and composition build every other function from them.\n",{"path":5345,"title":5346,"module":5342,"summary":5347},"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function","The Limit of a Function","The tangent and velocity problems both ask for a value a ratio approaches but never reaches — the limit. Its intuitive two-sided form splits into one-sided limits that must agree; a limit fails to exist when they disagree or when the function grows without bound, the latter producing a vertical asymptote.\n",{"path":5349,"title":5350,"module":5342,"summary":5351},"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition","Limit Laws and the ε–δ Definition","The Limit Laws reduce a limit to arithmetic on simpler limits, and direct substitution settles polynomials and rational functions outright. The 0\u002F0 forms that resist substitution yield to algebra or the Squeeze Theorem, and the ε–δ definition makes \"arbitrarily close\" precise as a pair of quantified inequalities.\n",{"path":5353,"title":5354,"module":5342,"summary":5355},"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity","Continuity","A function is continuous at a point when its limit there equals its value, so the graph has no break. Continuity fails in three geometric ways; it is closed under arithmetic and composition, so the elementary families and their combinations are continuous; and on a closed interval it forces the Intermediate Value Theorem, which locates roots.\n",{"path":5357,"title":5358,"module":5359,"summary":5360},"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change","The Derivative and Rates of Change","Derivatives","A single limit with three readings: the slope of the tangent line, the instantaneous velocity of a moving object, and the rate of change of one quantity with respect to another. Built from the difference quotient, extended from a value at one point to a function of x, and undefined exactly where a corner, jump, or vertical tangent appears.\n",{"path":5362,"title":5363,"module":5359,"summary":5364},"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule","Differentiation Rules and the Chain Rule","Computing every derivative from the limit definition is tedious. A short list of rules — power, constant multiple, sum, product, quotient — differentiates any polynomial or rational function by inspection. The trigonometric derivatives follow from one limit, and the chain rule extends everything to composite functions by multiplying rates along the composition.\n",{"path":5366,"title":5367,"module":5359,"summary":5368},"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates","Implicit Differentiation and Related Rates","Not every curve is the graph of y = f(x). Implicit differentiation finds a slope from an equation in x and y directly, treating y as an unknown function and differentiating both sides. The same chain-rule idea drives related rates, where one measured rate of change forces another through a geometric constraint, and interprets the derivative as a rate across the sciences.\n",{"path":5370,"title":5371,"module":5359,"summary":5372},"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials","Linear Approximations and Differentials","A differentiable curve looks like its tangent line under enough magnification, so the tangent is a usable stand-in for the function near the point of contact. The linear approximation and its linearization, written in the language of differentials dy and dx, estimate both function values and the measurement error propagated into a computed quantity.\n",{"path":5374,"title":5375,"module":5376,"summary":5377},"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem","Extrema and the Mean Value Theorem","Applications of Derivatives","Absolute and local extrema, the Extreme Value Theorem that guarantees them, and Fermat's Theorem pinning candidates to critical numbers. The Closed Interval Method turns the search for extrema into a finite checklist. Rolle's Theorem and the Mean Value Theorem then connect a function's values to its derivative, giving the tool that most of differential calculus rests on.\n",{"path":5379,"title":5380,"module":5376,"summary":5381},"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph","How Derivatives Shape a Graph","The sign of the first derivative fixes where a function rises and falls, and a sign change identifies each local extremum through the First Derivative Test. The second derivative sets concavity and inflection points and gives a faster Second Derivative Test. Limits at infinity describe end behavior and the horizontal asymptotes a curve settles toward.\n",{"path":5383,"title":5384,"module":5376,"summary":5385},"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization","Curve Sketching and Optimization","A checklist that synthesizes domain, symmetry, asymptotes, monotonicity, extrema, and concavity into a hand sketch of any function, plus the slant asymptote for rational functions whose degree exceeds the denominator's. The same extremum machinery, applied to a word problem, becomes the optimization template: model one quantity, reduce it to a function of a single variable, and find its absolute extremum.\n",{"path":5387,"title":5388,"module":5376,"summary":5389},"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives","Newton's Method and Antiderivatives","Newton's method solves $f(x) = 0$ by repeatedly replacing the curve with its tangent line and jumping to the tangent's root, converging fast when it works and diverging when the derivative is small. Antiderivatives reverse differentiation: every antiderivative of a function differs from another by a constant, so the general antiderivative is a family of parallel curves, pinned to one by an initial condition.\n",{"path":5391,"title":5392,"module":5393,"summary":5394},"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral","Area and the Definite Integral","Integrals","The area under a curve is defined as a limit of sums of rectangle areas. The same limit — a Riemann sum taken as the mesh shrinks to zero — defines the definite integral, a single number measuring signed area, total distance, and every accumulated quantity built the same way. Its properties, comparison bounds, and reading as net area follow directly from the limit.\n",{"path":5396,"title":5397,"module":5393,"summary":5398},"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus","The Fundamental Theorem of Calculus","Differentiation and integration are inverse operations. Part 1 says the derivative of an area-accumulation function is the integrand; Part 2 says a definite integral equals the change in any antiderivative across the interval. Together they replace limits of Riemann sums with antiderivative lookups, define the indefinite integral, and give the Net Change Theorem for rates.\n",{"path":5400,"title":5401,"module":5393,"summary":5402},"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule","The Substitution Rule","Substitution runs the Chain Rule backward: spotting an inner function whose derivative also appears in the integrand lets the variable change to $u$ and collapse a composite integral to a simple one. The rule applies to indefinite and definite integrals, with two ways to handle the limits, and it yields the symmetry shortcuts that double even integrands and vanish odd ones.\n",{"path":5404,"title":5405,"module":5406,"summary":5407},"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes","Areas Between Curves and Volumes","Applications of Integration","A definite integral computes any quantity that a limit of Riemann sums approximates. Applied to geometry it gives the area between two curves and the volume of a solid: by cross-sections, by disks and washers when the region is revolved, and by cylindrical shells when inverting the boundary is awkward.\n",{"path":5409,"title":5410,"module":5406,"summary":5411},"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length","Work, Average Value, Arc Length, and Surface Area","The work done by a force that varies with position, the average value of a function and the Mean Value Theorem it satisfies, the length of a curve, and the area of a surface swept out by revolving that curve. Each is a limit of Riemann sums, hence a definite integral.\n",{"path":5413,"title":5414,"module":5406,"summary":5415},"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability","Applications to Physics, Economics, and Probability","Definite integrals in physics, economics, and statistics: the force a fluid exerts on a submerged plate, the balance point of a plane region, the money consumers save at a market price, and the probability that a continuous random variable lands in an interval, together with its mean.\n",{"path":5417,"title":5418,"module":5419,"summary":5420},"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials","Inverse Functions, Logarithms, and Exponentials","Exponential, Logarithmic, and Inverse Functions","A one-to-one function has an inverse that reverses it, with a graph mirrored across y = x and a derivative given by the reciprocal-slope rule. The exponential e^x is its own derivative and the natural logarithm has derivative 1\u002Fx; logarithmic differentiation turns products, quotients, and variable powers into sums.\n",{"path":5422,"title":5423,"module":5419,"summary":5424},"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions","Growth, Decay, Inverse Trigonometric, and Hyperbolic Functions","Any quantity whose rate of change is proportional to its size grows or decays exponentially, the single equation y' = ky behind populations, radioactive decay, cooling, and continuously compounded interest. The inverse trigonometric functions have algebraic derivatives, and the hyperbolic functions, built from e^x and e^{-x}, describe the hanging cable.\n",{"path":5426,"title":5427,"module":5419,"summary":5428},"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule","Indeterminate Forms and l'Hospital's Rule","When a limit produces 0\u002F0 or infinity over infinity, the value is undetermined by the forms alone. l'Hospital's Rule resolves both by replacing the ratio of functions with the ratio of their derivatives. Products, differences, and powers reduce to a quotient the rule can handle, and repeated use ranks the growth of logarithms, powers, and exponentials.\n",{"path":5430,"title":5431,"module":5432,"summary":5433},"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts","Integration by Parts","Techniques of Integration","The product rule for derivatives reverses into integration by parts, trading the integral of $u\\,\\d v$ for the integral of $v\\,\\d u$ whenever the second is easier. The LIATE ordering fixes which factor to differentiate. Standard cases: a polynomial against a transcendental factor, repeated parts, cyclic integrals that solve for themselves, and reduction formulas that peel an exponent down by recursion.\n",{"path":5435,"title":5436,"module":5432,"summary":5437},"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution","Trigonometric Integrals and Substitution","Two related techniques. Trigonometric integrals evaluate powers and products of sine, cosine, tangent, and secant by splitting off one factor and converting the rest with a Pythagorean identity, or by dropping even powers with half-angle formulas. Trigonometric substitution runs the idea in reverse: replace x by a sine, tangent, or secant to clear a radical, integrate, then read the answer back off a reference triangle.\n",{"path":5439,"title":5440,"module":5432,"summary":5441},"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy","Partial Fractions and Integration Strategy","Any rational function integrates in closed form: factor the denominator, split the fraction into simple pieces by partial fractions, and integrate each piece as a logarithm or an arctangent. Four denominator cases exhaust the possibilities. A four-step strategy then sorts an arbitrary integrand by its shape to the technique that fits it, and a short catalog records elementary functions whose antiderivatives are not elementary.\n",{"path":5443,"title":5444,"module":5432,"summary":5445},"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals","Approximate and Improper Integrals","Two definite integrals the Fundamental Theorem cannot reach. With no antiderivative available, the Midpoint, Trapezoidal, and Simpson rules approximate the integral from sample values, each carrying a provable error bound. With an infinite interval or an integrand that blows up, the improper integral is defined as a limit that either converges or diverges; the Comparison Test settles which without evaluating it.\n",{"path":5447,"title":5448,"module":5449,"summary":5450},"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus","Parametric Curves and Their Calculus","Parametric Equations and Polar Coordinates","A parametric curve gives x and y separately as functions of a third variable, recording not only a path but the direction and timing with which it is traced. Eliminating the parameter recovers a Cartesian equation; the slope, area, arc-length, and surface-area formulas run directly on the parameter, with the cycloid and astroid as worked examples.\n",{"path":5452,"title":5453,"module":5449,"summary":5454},"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates","Polar Coordinates","Polar coordinates locate a point by a distance from the pole and an angle from the polar axis, giving circles, spirals, and flower-shaped curves short equations. Conversion between the two systems is right-triangle trigonometry, and treating a polar curve as a parametric curve in the angle yields the tangent, area, and arc-length formulas.\n",{"path":5456,"title":5457,"module":5449,"summary":5458},"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections","Conic Sections","Parabolas, ellipses, and hyperbolas are the plane curves cut from a double cone. Each has a focus-based geometric definition and a standard Cartesian equation. A single number, the eccentricity, ties the three together, and placing a focus at the pole gives all of them one polar equation that describes planetary orbits.\n",{"path":5460,"title":5461,"module":5462,"summary":5463},"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences","Sequences","Infinite Sequences and Series","A sequence is a function on the positive integers, and its limit is defined almost exactly like a limit at infinity. The Limit Laws and Squeeze Theorem carry over from functions, monotonic and bounded sequences give a convergence criterion, and the Monotonic Sequence Theorem guarantees a limit exists without naming it.\n",{"path":5465,"title":5466,"module":5462,"summary":5467},"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test","Series and the Integral Test","Adding infinitely many terms is made precise as the limit of partial sums. The two series with closed-form partial sums are geometric and telescoping; the harmonic series diverges even as its terms shrink to zero. The Integral Test compares a positive series to an improper integral, settling the p-series and supplying a remainder bound for estimating sums.\n",{"path":5469,"title":5470,"module":5462,"summary":5471},"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests","The Convergence Tests","The comparison, alternating-series, ratio, and root tests decide convergence without a closed-form partial sum. Absolute convergence is stronger than conditional convergence and is preserved under rearrangement; an alternating series errs by less than its first omitted term. A test is chosen from the shape of the general term.\n",{"path":5473,"title":5474,"module":5462,"summary":5475},"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series","Power Series","A power series is a polynomial of infinite degree whose convergence set is an interval centered at $a$, with a radius the Ratio Test finds and endpoints that must be tested by hand. Inside that interval the series represents a function that can be differentiated and integrated term by term, generating new representations from the geometric series.\n",{"path":5477,"title":5478,"module":5462,"summary":5479},"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series","Taylor and Maclaurin Series","If a function equals a power series, its coefficients are forced: the nth is the nth derivative at the center over n factorial. We derive that formula, use Taylor's Inequality to prove the standard series for the exponential, sine, and cosine, record the binomial series and a reference table, and bound the error when a Taylor polynomial replaces a function.\n",{"path":5481,"title":5482,"module":5483,"summary":5484},"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product","Three-Dimensional Coordinates, Vectors, and the Dot Product","Vectors and the Geometry of Space","Space needs three coordinates, so we set up the rectangular system, the distance formula, and the equation of a sphere. Vectors then package magnitude and direction into a single algebraic object with its own arithmetic. The dot product turns two vectors into a number that measures the angle between them, gives a clean test for orthogonality, and produces the projection of one vector onto another.\n",{"path":5486,"title":5487,"module":5483,"summary":5488},"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes","The Cross Product, Lines, and Planes","The cross product multiplies two vectors into a third perpendicular to both, with length equal to the area of the parallelogram they span. That one construction supplies the direction of a line, the normal of a plane, and, through the scalar triple product, the volume of a parallelepiped. Lines carry a point and a direction vector; planes carry a point and a normal, which fixes the angle between planes and the distance from a point to a plane.\n",{"path":5490,"title":5491,"module":5483,"summary":5492},"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces","Cylinders and Quadric Surfaces","A surface whose equation omits one variable is a cylinder: the graph of a plane curve swept along the missing axis. A second-degree equation in three variables is a quadric, and translation and rotation reduce every one to a short standard list. Traces — the curves cut by planes parallel to the coordinate planes — sort the six quadrics into ellipsoid, the two paraboloids, the cone, and the two hyperboloids.\n",{"path":5494,"title":5495,"module":5483,"summary":5496},"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves","Vector Functions and Space Curves","A vector function assigns a vector to each value of a parameter, and as the parameter runs its tip traces a space curve. Taking limits, derivatives, and integrals component by component carries all of single-variable calculus into three dimensions. The derivative of a vector function is the tangent vector to its curve, and normalizing it gives the unit tangent that points the way along the path.\n",{"path":5498,"title":5499,"module":5483,"summary":5500},"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion","Arc Length, Curvature, and Motion in Space","Integrating the speed of a vector function gives the length of its curve and a natural parameter, arc length, that depends only on the curve's shape. Curvature measures how fast the unit tangent turns, and together with the normal and binormal it builds the moving TNB frame. Reading the same vector function as a trajectory, its first two derivatives are velocity and acceleration, and acceleration splits cleanly into tangential and normal parts.\n",{"path":5502,"title":5503,"module":5504,"summary":5505},"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables","Functions of Several Variables, Limits, and Continuity","Partial Derivatives","A function of several variables assigns one number to each point of a region in the plane or in space. Domain, graph, level curve, and level surface describe it; limits and continuity extend to two variables, where a limit must agree along every path of approach, not just from the left and the right.\n",{"path":5507,"title":5504,"module":5504,"summary":5508},"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives","A partial derivative holds every variable but one fixed and differentiates in the ordinary sense. Geometrically it is the slope of a trace curve cut from the surface by a coordinate plane. The freeze-and-differentiate rule computes the two first partials; the four second partials follow, and the two mixed ones agree under Clairaut's Theorem when they are continuous.\n",{"path":5510,"title":5511,"module":5504,"summary":5512},"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule","Tangent Planes, Linear Approximation, and the Chain Rule","Near a point, a smooth surface looks like its tangent plane, and the plane's equation is built from the two partial derivatives. That linearization defines the total differential and the meaning of differentiability in two variables. The chain rule then propagates derivatives through composed functions, tracked by a tree diagram, and yields clean formulas for implicit differentiation.\n",{"path":5514,"title":5515,"module":5504,"summary":5516},"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient","Directional Derivatives and the Gradient","The partial derivatives measure slope along the two axes; the directional derivative measures slope along any chosen direction, and equals the gradient dotted with a unit vector. The gradient points in the direction of steepest increase, its length is the greatest rate, and it stands perpendicular to level curves and surfaces, which fixes the tangent plane to a level surface.\n",{"path":5518,"title":5519,"module":5504,"summary":5520},"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers","Optimization and Lagrange Multipliers","Extrema of a two-variable function sit at critical points where the gradient vanishes; the Second Derivatives Test sorts them into peaks, valleys, and saddles by the sign of a discriminant. Absolute extrema on a closed region also need the boundary. When the domain is itself a constraint curve, Lagrange multipliers set the two gradients parallel and solve the constrained problem.\n",{"path":5522,"title":5523,"module":5524,"summary":5525},"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals","Double Integrals","Multiple Integrals and Vector Calculus","The double integral extends the definite integral to functions of two variables: a limit of Riemann sums that measures signed volume under a surface. Fubini's Theorem turns it into two ordinary integrations done one after the other, general regions of type I and type II fix the inner limits, polar coordinates absorb circular symmetry through the factor r, and the same machine computes mass, center of mass, and moments of a lamina.\n",{"path":5527,"title":5528,"module":5524,"summary":5529},"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems","Triple Integrals and Coordinate Systems","The triple integral integrates a function of three variables over a solid, as a limit of Riemann sums evaluated by three nested single integrations. Cylindrical coordinates add the factor r to handle axial symmetry, spherical coordinates add rho-squared sine-phi for radial symmetry, and the general change of variables shows both volume elements are Jacobian determinants of the coordinate map. Surface area for a graph completes the measurement toolkit.\n",{"path":5531,"title":5532,"module":5524,"summary":5533},"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals","Vector Fields and Line Integrals","A vector field assigns a vector to every point of space; the line integral of a field along a curve accumulates its tangential component, measuring work. Conservative fields are gradients of a potential, and for them the Fundamental Theorem for Line Integrals makes the integral depend only on the endpoints. Path independence, closed-loop integrals of zero, and the component test for a potential are three faces of the same property.\n",{"path":5535,"title":5536,"module":5524,"summary":5537},"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence","Green's Theorem, Curl, and Divergence","Green's Theorem equates the line integral of a field around a positively oriented closed curve with a double integral over the enclosed region, turning a boundary computation into an area computation and vice versa. Curl measures local circulation and divergence measures local outflow; the two vector forms of Green's Theorem express the boundary integral as the integrated curl or divergence, the planar case of Stokes' and the Divergence Theorem.\n",{"path":5539,"title":5540,"module":5524,"summary":5541},"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals","Parametric Surfaces and Surface Integrals","A parametric surface is the image of a two-variable vector function; its area element is the magnitude of the cross product of the two tangent vectors. The surface integral of a scalar function sums it over that area, and the flux integral of a vector field sums the field's normal component, measuring flow through the surface. Orientation by a choice of unit normal makes flux well-defined, the integral Stokes' and the Divergence Theorem operate on.\n",{"path":5543,"title":5544,"module":5524,"summary":5545},"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem","Stokes' Theorem and the Divergence Theorem","Stokes' Theorem lifts Green's Theorem into space: the line integral of a field around the boundary of a surface equals the flux of its curl through the surface. The Divergence Theorem relates the outward flux across a closed surface to the triple integral of divergence over the solid it encloses. Together with the Fundamental Theorem of Calculus and its line-integral and Green counterparts, they are one theorem: the integral of a derivative over a region equals the integral of the field over its oriented boundary.\n",{"path":5547,"title":5548,"module":6,"summary":6},"\u002Fcalculus","Calculus",{"path":5550,"title":5551,"module":4995,"summary":5552},"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions","Measurement and Dimensions","Every physical quantity is a number attached to a unit, and that pairing is what lets you check an equation before computing anything, since terms that add together must carry the same dimensions. We build the SI base units and the notion of dimension, then use dimensional analysis to test a proposed relation and form scaling groups — a method that fixes a formula's shape but never its numerical constants. The lesson also sets how precisely a result may be stated, through significant figures, propagated uncertainty, and order-of-magnitude checks that catch errors a raw calculator answer hides.\n",{"path":5554,"title":5555,"module":4995,"summary":5556},"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra","Vector Algebra","Force, velocity, and displacement all carry a direction, so mechanics needs an arithmetic that respects it; adding magnitudes alone gives the wrong answer the moment two arrows point different ways. We set up vectors and their components in a chosen basis, then build the two products that carry most of the physics — the dot product, which extracts the part of one vector along another and yields work and power, and the cross product, which measures oriented area and yields torque and angular momentum. Rotating the axes changes the components while leaving the vector itself untouched, and the same component method resolves a force along whatever directions a constraint picks out.\n",{"path":5558,"title":5559,"module":5560,"summary":5561},"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion","One-Dimensional Motion","Kinematics","Motion along a line already forces the two questions the whole of kinematics repeats: how fast is the object moving now, and where will it be next? Velocity and acceleration answer the first as derivatives of position; integrating them back — the signed area under a graph — answers the second. We derive the constant-acceleration equations, mark exactly where the \"constant\" assumption is load-bearing, and see why sign, not magnitude, is what carries direction.\n",{"path":5563,"title":5564,"module":5560,"summary":5565},"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs","Motion Graphs","Draw a motion as a graph and its two most useful facts turn geometric: the slope of the position curve is the velocity, and the area under the velocity curve is the displacement. We read motion in both directions — differentiating a graph for the next rate, integrating it back to recover position — and handle the curved, piecewise, and noisy graphs that real measurements produce. Along the way we see why a velocity estimated from two positions belongs to the midpoint of their interval, not its end.\n",{"path":5567,"title":5568,"module":5560,"summary":5569},"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion","Projectile Motion","Throw an object and it seems to trace one curved path, but the motion is really two independent one-dimensional motions running at once: constant velocity across the ground and free fall in the vertical. Splitting it that way turns every projectile question — how long it stays up, how far it lands, how high it climbs, whether it clears an obstacle — into a pair of equations you already know. We derive the parabolic trajectory, work both the forward and the inverse problems, and show why the familiar $45^\\circ$ range-maximizing angle holds only when launch and landing heights match.\n",{"path":5571,"title":5572,"module":5560,"summary":5573},"\u002Fmechanics\u002Fkinematics\u002Frelative-motion","Relative Motion","A velocity is only ever measured relative to some observer, so a boat's speed through the water, over the ground, and as seen from another boat are three different vectors. Choosing the right frame — and subtracting one motion from another — collapses river crossings, crosswind headings, pursuit, and closest-approach problems into a single vector equation. We build the relative-velocity and relative-position relations for uniformly moving frames, show why acceleration is the one quantity all such observers agree on, and note where rotating frames break the simple subtraction.\n",{"path":5575,"title":5576,"module":5560,"summary":5577},"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion","Circular Motion","An object going around a circle at a steady speed is still accelerating, because its velocity is forever changing direction — the fact that governs everything from a car on a curve to a satellite in orbit. We tie the angular description (angle, angular velocity, angular acceleration) to the linear one through $v=r\\omega$, split the acceleration into an inward part that turns the velocity and a tangential part that changes its speed, and extend the inward $v^2\u002Fr$ result to any curved path through its local radius of curvature. Constant angular acceleration then mirrors straight-line motion equation for equation.\n",{"path":5579,"title":5580,"module":5581,"summary":5582},"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws","Newton's Laws","Dynamics","What makes a body change its motion, and in which frames does the answer take its simplest form? Newton's three laws settle both: inertial frames are the ones where a force-free body coasts, force is whatever changes momentum, and every interaction pushes back on its source. We write the second law as $\\sum\\vec F=\\d\\vec p\u002F\\d t$, reduce it to $m\\vec a$ at constant mass, and separate what a scale actually reads — the support force — from the weight $m\\vec g$ it is so often mistaken for.\n",{"path":5584,"title":5585,"module":5581,"summary":5586},"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams","Free-Body Diagrams","Once several forces act on a body at once, the reliable way to predict its motion is to isolate that one body and draw every external push and pull on it — nothing more, nothing less. The free-body diagram is that discipline. We fix a system boundary, resolve $\\sum\\vec F=m\\vec a$ into components along axes chosen to fit the geometry, and solve for the unknowns a problem hands us — normal forces, tensions, friction, and the acceleration a constraint permits — seeing why internal forces drop out only when the boundary encloses both bodies that share them.\n",{"path":5588,"title":5589,"module":5581,"summary":5590},"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion","Friction and Curved Motion","Real surfaces grip before they slip, fluids push back harder the faster you move through them, and anything rounding a bend must be pulled toward the inside of the curve by something. This lesson supplies the force laws for those three cases. We bound static friction by $|f_s|\\leq\\mu_sN$ and switch to kinetic friction $\\mu_kN$ once sliding starts, model drag as a speed-dependent resistance that levels off at a terminal speed, and show that circular motion demands an inward net force $mv^2\u002Fr$ furnished by real interactions — friction, a banked normal force, tension — never by an invented outward one.\n",{"path":5592,"title":5593,"module":5581,"summary":5594},"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics","Numerical Dynamics","Most force laws — quadratic drag, coupled oscillators, anything nonlinear — admit no closed-form trajectory, so we advance the motion one small time step at a time and let arithmetic do what algebra cannot. This lesson turns $\\d\\vec y\u002F\\d t=f(t,\\vec y)$ into a marching rule. We derive the Euler, Euler--Cromer, midpoint, and Verlet updates, weigh their accuracy and stability, watch a drifting energy expose a bad scheme, and use step-halving and conserved quantities to separate the error of the method from the error of the model.\n",{"path":5596,"title":5597,"module":5581,"summary":5598},"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems","Center-of-Mass Systems","A firework bursts into a dozen fragments, yet one point keeps gliding along the original parabola as though nothing had happened. That point is the centre of mass, and following it collapses a many-body tangle into a single equation of motion. We define $\\vec R=\\frac1M\\sum_i m_i\\vec r_i$ and its continuous form, show that internal forces cancel so that only external ones move it, $M\\vec A_{\\rm cm}=\\sum\\vec F_{\\rm ext}$, and put the result to work on recoil, collisions viewed from the centre-of-mass frame, and rocket propulsion, where mass leaving the boundary carries momentum with it.\n",{"path":5600,"title":5601,"module":5602,"summary":5603},"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy","Work and Kinetic Energy","Energy","A constant push along a straight path is trivial to score, but real forces vary and bend along curved trajectories, and only the component along the motion transfers any energy. Work captures exactly that transfer as the line integral $W=\\int\\vec F\\cdot\\d\\vec r$, and the work-kinetic-energy theorem turns it into a statement about speed: the net work on a particle equals the change in its $\\tfrac12 mv^2$. We build work up from the dot product to the signed area under a force curve, derive the theorem from Newton's second law, and read power as its instantaneous rate $P=\\vec F\\cdot\\vec v$.\n",{"path":5605,"title":5606,"module":5602,"summary":5607},"\u002Fmechanics\u002Fenergy\u002Fpotential-energy","Potential Energy","When a force does the same work no matter which path a particle takes, that work can be stored as a function of position alone, and solving for the motion becomes bookkeeping instead of integration. We single out the forces that qualify — the conservative ones, for which $\\oint\\vec F\\cdot\\d\\vec r=0$ — define their potential energy through $\\vec F=-\\nabla U$, and use conservation of mechanical energy to read speeds, turning points, and equilibria straight off a potential curve. Friction breaks the shortcut, so we also track where mechanical energy leaks away as heat.\n",{"path":5609,"title":5610,"module":5602,"summary":5611},"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work","Multiparticle Work","A single particle has one velocity and one kinetic energy; a system of many can spin, deform, explode, and warm up while its centre of mass glides along as if nothing happened. Splitting the motion into a centre-of-mass part and an internal part separates the energy that momentum already fixes from the energy left free for relative motion, $K=\\tfrac12MV_{\\rm cm}^2+K'$. We derive the centre-of-mass work theorem, see why an explosion or a released spring can raise total kinetic energy with no external work at all, and use the reduced-mass and centre-of-mass frames to make collisions and internal transfers clean.\n",{"path":5613,"title":5614,"module":5602,"summary":5615},"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding","Mass-Energy and Binding","Relativity puts rest itself on the energy ledger: a mass $m$ carries energy $mc^2$ even when it sits still, so weighing a system's separated pieces and weighing the assembled whole give different answers, and the gap is binding energy. We convert freely between mass units and MeV, compute the energy that holds a nucleus together, and read the binding-energy-per-nucleon curve that explains why fusing light nuclei and splitting heavy ones both release energy. Reaction $Q$ values, thresholds, and recoil then follow from the same mass-difference accounting, once the frame and mass convention are fixed.\n",{"path":5617,"title":5618,"module":5602,"summary":5619},"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization","Photons and Quantization","Light delivers its energy in indivisible lumps: a photon of frequency $f$ carries exactly $hf$, and this one fact explains why a dim blue lamp ejects electrons that an intense red one cannot. We fix a photon's energy and momentum from its wavelength, follow the quanta through emission, absorption, and the photoelectric threshold $K_{\\rm max}=hf-\\phi$, and watch energy and momentum conservation together produce the Compton wavelength shift when a photon scatters from an electron. The recurring discipline is unit and frame care, where a stray factor of $10^9$ or a forgotten rest energy quietly ruins an answer.\n",{"path":5621,"title":5622,"module":5623,"summary":5624},"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions","Momentum and Collisions","Momentum","When two objects collide, the forces between them are too brief and too tangled to integrate directly, yet the result is fixed by one conserved quantity. Linear momentum $\\vec p=m\\vec v$ turns Newton's second law into the impulse-momentum theorem $\\vec J=\\Delta\\vec p$, and for an isolated system into a conservation law that holds through any internal collision, however dissipative. We use it to separate elastic from inelastic collisions, follow the centre of mass, and read impulse as the signed area under a force-time curve — always tracking which external impulses the chosen system and interval let us drop.\n",{"path":5626,"title":5627,"module":5623,"summary":5628},"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions","Center-of-Mass Collisions","A two-body collision that looks asymmetric in the laboratory becomes almost trivial in the frame that rides along with the centre of mass, where the total momentum is zero and the two momenta stay equal and opposite. We build that frame, reduce the pair to a single relative coordinate carrying the reduced mass $\\mu$, and show that an elastic collision there only rotates one momentum vector while its length holds fixed. Transforming back to the laboratory then handles elastic and inelastic collisions, scattering angles, and reaction thresholds with the same construction — and shows why relative speed, not laboratory kinetic energy, measures what a collision can convert.\n",{"path":5630,"title":5631,"module":5623,"summary":5632},"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion","Rocket Propulsion","A rocket speeds up by throwing mass backward, so its own mass drops as it flies and $\\vec F=m\\vec a$ no longer applies to a fixed body. Tracking the momentum the exhaust carries across the vehicle boundary gives thrust $T=Ru_e$ and, for a force-free burn, the rocket equation $\\Delta v=u_e\\ln(m_i\u002Fm_f)$ — a logarithm that makes large velocity changes expensive in propellant and forces staging. We then add the forces a real ascent cannot ignore, gravity, drag, and steering, and show how thrust and mass-flow records are cross-checked to infer the exhaust speed.\n",{"path":5634,"title":5635,"module":5636,"summary":5637},"\u002Fmechanics\u002Frotation\u002Frotational-inertia","Rotational Inertia","Rotation","Push a wheel and a merry-go-round with the same force and they speed up at wildly different rates: the same mass resists rotation differently depending on where it sits relative to the axis. That single fact is the moment of inertia, $I=\\int r_\\perp^2\\,\\d m$, and this lesson builds it from the ground up. We tie angular motion to linear through $s=r\\theta$, $v=r\\omega$, and $a_t=r\\alpha$, derive $I$ for rods, disks, and spheres, and use the parallel- and perpendicular-axis theorems to move between axes — always naming the axis, because the same body has as many moments of inertia as it has lines to spin about.\n",{"path":5639,"title":5640,"module":5636,"summary":5641},"\u002Fmechanics\u002Frotation\u002Frotational-dynamics","Rotational Dynamics","A force applied to a wheel does nothing unless it acts off the axis: what turns a rigid body is torque, force times lever arm. This lesson makes that precise and turns it into the rotational Newton's second law, $\\sum\\tau=I\\alpha$ about a fixed axis, the exact analogue of $\\sum F=ma$. From there we get rotational work $W=\\int\\tau\\,\\d\\theta$ and power $P=\\tau\\omega$, size a motor to a load, and solve pulleys and Atwood machines where the pulley's own inertia can no longer be ignored — always insisting that every torque be measured about the same axis.\n",{"path":5643,"title":5644,"module":5636,"summary":5645},"\u002Fmechanics\u002Frotation\u002Frolling-motion","Rolling Motion","A rolling wheel is doing two things at once — translating and spinning — but the no-slip condition $v_{cm}=R\\omega$ locks them together, and that single constraint is what makes rolling tractable. We use it to split the kinetic energy into $\\tfrac12Mv_{cm}^2+\\tfrac12I\\omega^2$, find how fast a cylinder reaches the bottom of an incline, and show why the contact point is instantaneously at rest. The static friction that enforces rolling does no work; we track its direction from the tendency to slip, and mark exactly where the model breaks once the required friction exceeds $\\mu_sN$.\n",{"path":5647,"title":5648,"module":5636,"summary":5649},"\u002Fmechanics\u002Frotation\u002Fangular-momentum","Angular Momentum","A skater pulls in her arms and spins faster, with no torque acting: that is angular momentum conservation, and it lets us answer questions that would be hopeless force by force. We build $\\vec L=\\vec r\\times\\vec p$, show it obeys $\\vec\\tau_{ext}=\\d\\vec L\u002F\\d t$, and use its conservation under zero external torque to link before and after in collisions, reconfigurations, and coupled rotors without ever resolving the internal forces. The catch is bookkeeping: the origin, the system boundary, and the frame must be fixed first, and a change in total $\\vec L$ always points to an external impulse someone forgot.\n",{"path":5651,"title":5652,"module":5636,"summary":5653},"\u002Fmechanics\u002Frotation\u002Frolling-resistance","Rolling Resistance","Ideal rolling should coast forever, yet every real wheel slows down. The reason is that a deformable tire and road do not press through a single point: the contact patch spreads, the normal-force resultant shifts ahead of the axle, and that offset is a resisting moment even with no gross sliding. We package it as an equivalent force $F_{rr}=C_{rr}N$, tie the coefficient to load, surface, speed, and temperature, and use coast-down, towing, and traction tests to separate this contact loss from aerodynamic drag, bearing friction, and the adhesion limit where rolling gives way to skidding.\n",{"path":5655,"title":5656,"module":5636,"summary":5657},"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession","Gyroscopic Precession","A spinning top leans over but does not fall — it swings its axis in a slow horizontal circle instead. The paradox dissolves once torque is read as the rate of change of a vector: gravity's torque is perpendicular to the spin angular momentum, so it turns $\\vec L$ rather than toppling it. We derive the steady precession rate $\\Omega\\simeq Mgr\u002F(I_s\\omega_s)$ in the fast-top limit, state the assumptions it leans on — dominant spin, slow tilt, negligible bearing torque — and read nutation, support motion, and a decaying spin as the ways real gyroscopes depart from it.\n",{"path":5659,"title":5660,"module":5661,"summary":5662},"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits","Keplerian Orbits","Gravitation and Matter","Why do the planets trace ellipses rather than any other curve? Newton's inverse-square law collapses the two-body problem onto a single conic section, and the answer falls out of two conserved quantities: a central force can exert no torque, so angular momentum is fixed, and gravity is conservative, so energy is fixed. We read an orbit's size and shape straight off those invariants, recover all three of Kepler's laws, and derive escape speed, the vis-viva relation, and the timing of a pass. We also mark where the ideal ellipse breaks down — drag, oblateness, and a third body slowly move a real orbit.\n",{"path":5664,"title":5665,"module":5661,"summary":5666},"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields","Gravitational Fields","Instead of tracking the force between every pair of masses, we attach a field to the source and ask a test mass to read it off locally. That move pays off because gravity is conservative: the field is the gradient of a single scalar potential, and potentials from many sources simply add. We build the field-potential picture, use spherical symmetry and the shell theorem to get the point-mass exterior field and the zero interior field of a shell, and read tides straight out of the field's gradient. Along the way we mark exactly when the constant-$g$ and point-mass shortcuts hold and when a shape correction is needed.\n",{"path":5668,"title":5669,"module":5661,"summary":5670},"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium","Static Equilibrium","What does it take for a loaded structure to stay put? A body at rest needs its forces to cancel and its turning effects to cancel — $\\sum\\vec F=0$ and $\\sum\\vec\\tau=0$ about any point — and almost all of statics is the craft of turning a physical setup into those equations. We build free-body diagrams, replace supports, cables, friction, couples, and distributed loads with their idealized reactions, and locate the centre of gravity that decides whether a body tips. We also count equations against unknowns to separate a determinate problem from one that needs the material's deformation to resolve, and read every negative or inconsistent reaction as a sign that a contact or a boundary was chosen wrong.\n",{"path":5672,"title":5673,"module":5661,"summary":5674},"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics","Fluid Statics","A fluid at rest cannot support a shear, so the only stress it carries is a pressure that must grow with depth to hold up the fluid above it. That single balance, $\\d p\u002F\\d z=-\\rho g$, runs the whole subject: it sets manometer readings, the force on a dam, and — integrated over a submerged boundary — Archimedes' buoyant force $F_B=\\rho g V_{\\rm disp}$. We derive these, use them to decide when a body floats and whether it floats upright, and mark where acceleration, rotation, compressibility, or capillarity forces a richer pressure model.\n",{"path":5676,"title":5677,"module":5661,"summary":5678},"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow","Fluid Flow","Two accounting rules carry most of steady flow: mass cannot pile up, so the same volume crosses every section each second, and mechanical energy is conserved along a streamline when the fluid is ideal. From those we get continuity, Bernoulli's relation between pressure, speed, and height, and the results that follow — Torricelli's efflux speed, the Venturi meter, the Pitot tube. We then let go of the ideal assumptions one at a time: viscosity adds wall shear and head loss, Reynolds number decides laminar versus turbulent, and Mach number marks where a gas stops behaving as incompressible.\n",{"path":5680,"title":5681,"module":5661,"summary":5682},"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion","Orbital Motion","A circular orbit is nothing but free fall with enough sideways speed to keep missing the ground, and setting gravity equal to the centripetal requirement fixes that speed and the period once and for all. From the same energy bookkeeping we read off escape speed, sort orbits into bound, parabolic, and hyperbolic by the sign of their specific energy, and see why a tangential burn is the efficient way to change an orbit. We build the Hohmann transfer and its launch window, work the numbers for a geostationary orbit and an escape burn, and mark where finite thrust, perturbations, and an uncertain initial state pull a real trajectory off the ideal.\n",{"path":5684,"title":5685,"module":5661,"summary":5686},"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity","Stress and Elasticity","Rigid bodies are a fiction; every real material stretches, shears, or squeezes under load, and the useful question is how much. We define stress as force per area and strain as fractional deformation, then find that for small deformations the two are simply proportional — Hooke's law — with Young's, shear, and bulk moduli as the constants for stretch, twist, and volume change. From these we compute extensions, torsional twist, and stored elastic energy, and read a tensile curve for the yield, ultimate, and fracture points where linear elasticity ends. We also mark the practical limits: stress concentrations, fatigue, and the multiaxial states a single uniaxial modulus cannot capture.\n",{"path":5688,"title":5689,"module":5690,"summary":5691},"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators","Damped Oscillators","Oscillations and Waves","Every real oscillator eventually stops: friction, drag, and internal loss drain its energy, so free motion is a decay rather than a permanent swing. Adding a velocity-proportional resistance to the spring-mass equation produces one dimensionless number, $b\u002F(2\\sqrt{mk})$, that decides whether the mass rings down through many cycles, returns once without overshoot, or crawls back slowly. We solve the three regimes, tie the observed decay to the power balance $b\\dot x^2$, and turn a measured ring-down into the decay rate and quality factor of the apparatus — reading damping off the data instead of assuming it.\n",{"path":5693,"title":5694,"module":5690,"summary":5695},"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves","Travelling Waves","A wave carries a shape, not the material: each element of a rope or air column oscillates in place while the disturbance travels through it. Writing that shape as $f(x\\mp vt)$ turns \"the pattern moves\" into a statement about the cosine's argument, and a local force balance on one string segment fixes the speed at $v=\\sqrt{T\u002F\\mu}$ — restoring stiffness over inertia, with amplitude nowhere in it. We build the sinusoidal wave and its phase, derive the wave equation from Newton's second law, and follow the energy a travelling wave transports, then check speed and power against those predictions.\n",{"path":5697,"title":5698,"module":5690,"summary":5699},"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition","Wave Superposition","When two waves cross the same point, what does a probe read? In a linear medium the answer is arithmetic: the displacements add, $y=y_1+y_2$, and the pulses pass through each other unchanged. That one rule produces interference — reinforcement where the signs agree, cancellation where they oppose — and it guards against a common mistake, since displacement can vanish at an instant while the energy sits in transverse motion instead. We work out the signed sum, the phase bookkeeping for equal-frequency components, and why a null in the record is not a null in the wave.\n",{"path":5701,"title":5702,"module":5690,"summary":5703},"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves","Standing Waves","Clamp a string at both ends and only certain frequencies survive: the ends must be nodes, and that single geometric demand quantizes the wave into a discrete set of modes $f_n=nv\u002F(2L)$. The travelling wave becomes a fixed pattern of nodes and antinodes — standing, not moving — because equal waves running in opposite directions superpose. We build the standing wave from its counter-propagating pieces, read the harmonic sequence off the boundary conditions (half-wavelengths for a fixed-fixed string, odd quarter-wavelengths for a closed pipe), and test the ideal model against node scans and resonance peaks.\n",{"path":5705,"title":5706,"module":5690,"summary":5707},"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves","Sound Waves","Sound is a pressure wave so small that a loud tone displaces air molecules by less than the width of an atom, yet a microphone reads it easily — because pressure, not displacement, is what the ear and the instrument sense. The acoustic impedance $Z=\\rho c$ ties pressure, density, and particle velocity together, fixes the intensity a wave carries, and sets the reference for the decibel, a logarithm that tames a $10^{12}$ range in power. We derive the sound speed from the gas's stiffness, convert between pressure and intensity levels, and treat the measurement itself — calibration, geometry, background, averaging — as part of the physics.\n",{"path":5709,"title":5710,"module":5690,"summary":5711},"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect","Doppler Effect","A passing siren drops in pitch not because the source changes but because motion repacks the wavefronts: an approaching source crowds its crests, a receding one stretches them, and a moving listener samples them at a different rate. For mechanical waves every velocity is measured against the medium, and one signed ratio $f_r=f_s(v-u_r)\u002F(v-u_s)$ captures both effects at once. We separate source motion, which sets crest spacing, from receiver motion, which sets arrival rate, invert the shift to recover radial velocity, and mark where the model breaks — supersonic sources, moving air, and reflected paths that carry two shifts, not one.\n",{"path":5713,"title":5714,"module":5690,"summary":5715},"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets","Wave Packets","No real signal is a single frequency: a disturbance that starts and stops is built from a band of wave numbers, and the width of that band is what makes it local. We ask how such a packet moves — carrier crests at the phase velocity $v_\\mathrm p=\\omega\u002Fk$, the envelope at the group velocity $v_\\mathrm g=\\d\\omega\u002F\\d k$ — and why the two differ once a medium is dispersive. Curvature $\\d^2\\omega\u002F\\d k^2$ spreads and chirps the packet as it travels, and the Fourier reciprocity that ties bandwidth to duration explains why a finite record, aliasing, or a coarse probe can imitate that spreading unless the sampling limits are respected.\n",{"path":5717,"title":5718,"module":5690,"summary":5719},"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling","Beats and Coupling","Add two tones a few hertz apart and the sum swells and fades at their difference frequency — a beat — though neither source is changing. We work out that envelope, then ask the mechanical version of the same question: join two oscillators and a single resonance splits into normal modes, with energy sloshing between the coordinates at their frequency difference. The lesson identifies when a slow amplitude envelope signals genuine coupling rather than two independent sources, drift, or deliberate modulation, reading it from envelope timing, spectral sidebands, and the mode shapes.\n",{"path":5721,"title":5722,"module":5690,"summary":5723},"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion","Simple Harmonic Motion","Any system pushed back toward equilibrium by a force proportional to its displacement obeys one equation, $\\ddot x+\\omega_0^2x=0$, and so moves sinusoidally at $\\omega_0=\\sqrt{k\u002Fm}$ whatever the amplitude. We derive that motion, follow its energy $E=mv^2\u002F2+kx^2\u002F2$ trading between kinetic and potential form at constant total, and read the elliptical phase-space orbit Hooke's law implies. Period, amplitude, velocity, and acceleration then supply redundant checks: an amplitude-dependent period or a curved force residual is the signature that the linear model has failed, and mass-loading and offset tests separate a calibration error from a real frequency shift.\n",{"path":5725,"title":5726,"module":5690,"summary":5727},"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion","Pendulum Motion","A pendulum keeps time only because, for small swings, gravity supplies a restoring torque proportional to the angle — and $T=2\\pi\\sqrt{L\u002Fg}$ then follows without the mass appearing at all. We derive that result, mark exactly which assumptions carry it (small angle, negligible pivot loss, a rigid support), then relax them: finite amplitude lengthens the period through an elliptic integral, and an extended body replaces $L$ with the ratio of its moment of inertia to its center-of-mass distance. How the period drifts with amplitude or pivot position is what diagnoses the geometric, damping, and distributed-mass corrections.\n",{"path":5729,"title":5730,"module":5690,"summary":5731},"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators","Driven Oscillators","Drive a damped oscillator at a frequency you control and it eventually forgets its own: $m\\ddot x+b\\dot x+kx=F_0\\cos\\omega t$ settles into a steady response whose amplitude and phase depend sharply on how close the drive sits to resonance. We solve for that response, show how damping alone fixes the resonance width, the peak power, and the settling time, and treat base excitation as the same problem with a different input. The steady-state formulas hold only for constant $m$, $b$, and $k$; level-dependent peaks or hysteresis between up- and down-sweeps are how nonlinearity or an extra mode announces itself.\n",{"path":5733,"title":5734,"module":5690,"summary":5735},"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries","Wave Boundaries","A pulse traveling along a string does something abrupt where the string's properties change: part reflects, part transmits, and which is which is set by the impedance mismatch alone. We impose continuity of displacement and transverse force at the join to get the reflection and transmission coefficients in terms of $Z=\\sqrt{T\\mu}$, fix their signs and the polarity flip, and balance the energy. The clean result assumes linear, nondispersive segments meeting at a localized join; pulse polarity, return timing, and energy ratios are the measurements that expose a real connector's mass, loss, or distributed transition.\n",{"path":5737,"title":5738,"module":5739,"summary":5740},"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases","Kinetic Theory of Ideal Gases","Thermodynamics","A gas has no springs and no gears, yet it pushes on its container with a definite pressure and stores energy in a lawful way. Kinetic theory explains both from the motion of the molecules alone: pressure is the accumulated recoil of countless elastic impacts, and temperature is the average translational kinetic energy each molecule carries. We derive $pV=\\tfrac13Nm\\overline{v^2}$ from momentum transfer, read off $\\overline{K}_{\\rm tr}=\\tfrac32kT$, and use the Maxwell–Boltzmann distribution to separate the most probable, mean, and rms speeds — each the right average for a different question — while marking where the dilute, classical assumptions stop holding.\n",{"path":5742,"title":5743,"module":5739,"summary":5744},"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics","First Law of Thermodynamics","Heat a gas and it may warm, expand, or both; compress it and the same energy can reappear as a temperature rise. The first law settles the bookkeeping: internal energy is a state property whose change equals the heat added plus the work done on the system, $\\Delta E_{\\rm int}=Q_{\\rm in}+W_{\\rm on}$. We fix a system boundary and one sign convention, compute boundary work as $\\int p\\,\\d V$ along a path, and use calorimetry to measure heat and heat capacities. The recurring point is that heat and work are path-dependent transfers while their sum is not, so an energy ledger closes only once every boundary crossing is named.\n",{"path":5746,"title":5747,"module":5739,"summary":5748},"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law","Entropy and the Second Law","The first law lets energy flow either way; it never says which way heat actually goes. The second law supplies the missing arrow. Entropy, defined through the reversible transfer $\\d S=\\delta Q_{\\rm rev}\u002FT$, can only increase in an isolated system, and that single inequality fixes the direction of heat flow and caps every engine, refrigerator, and heat pump at its Carnot value. We build entropy ledgers for reservoirs and working substances, separate the entropy carried by heat from the entropy generated by irreversibility, and read the sign of the total as a hard check on any proposed thermal machine.\n",{"path":5750,"title":5751,"module":5739,"summary":5752},"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes","Thermal Processes","Heat rarely sits still: it stretches solids, pushes real gases off their ideal isotherms, and leaks across walls by conduction, convection, and radiation. Each behavior becomes a number a designer can use. Thermal expansion sets the gaps in a bridge and the stress in a clamped rod; the van der Waals equation and a phase diagram fix when $pV=nRT$ or a latent-heat term applies; Fourier's law, Newton cooling, and Stefan–Boltzmann radiation give the rate of heat flow. We assemble these into thermal-resistance networks and transient time constants, then mark where contact resistance, phase change, or a hidden thermal bridge breaks the simple model.\n",{"path":5754,"title":5755,"module":5739,"summary":5756},"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes","Phase Changes","Add heat to ice and its temperature climbs — until it reaches $0\\ ^\\circ\\mathrm C$, where the thermometer stalls while the ice melts. That plateau is the whole subject: at a phase boundary the energy rearranges molecules, $Q=mL$, instead of raising temperature, which resumes only once one phase is gone. We stage a heating path into sensible-heat legs ($Q=mc\\Delta T$) and latent plateaus, use the Clausius–Clapeyron relation to track how a boiling point moves with pressure, and solve calorimetry by testing each coexistence endpoint — so a melt fraction that lands outside $[0,1]$ flags a wrong final-state guess rather than a real state.\n",{"path":5758,"title":5759,"module":5739,"summary":5760},"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines","Thermal Machines","An engine, a refrigerator, and a heat pump are one machine read three ways: each shuttles heat between a hot and a cold reservoir while trading work at the boundary, and only the flow you call useful separates them. A heat engine turns part of $Q_h$ into work, $W=Q_h-Q_c$; a refrigerator spends work to pull $Q_c$ from the cold side; a heat pump counts the warm-side delivery instead. We measure each with its own ratio — efficiency or coefficient of performance — bound them all by the Carnot limit that reservoir temperatures alone set, and track how finite temperature differences, throttling, and friction generate entropy and pull real machines below that bound.\n",{"path":5762,"title":5763,"module":6,"summary":6},"\u002Fmechanics","Mechanics & Dynamics",{"path":5765,"title":5766,"module":5767,"summary":5768},"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors","Charge and Conductors","Electric Fields","Rub two objects together and one pulls electrons from the other; nothing is created, only moved. We define what electric charge is — conserved, additive, and quantized in units of $e$ — and why a conductor's mobile carriers rearrange until its interior field vanishes and its surface sits at one potential. We follow charge through contact, induction, and grounding, treat the field-free cavity that turns a conductor into a shield, and mark where finite conductivity and leakage set the limits of the electrostatic picture.\n",{"path":5770,"title":5771,"module":5767,"summary":5772},"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law","Coulomb's Law","Two charges at rest push or pull along the line joining them, and the whole of electrostatics is assembled by adding up such pairs. We measure that force — its inverse-square falloff, its linear dependence on each charge, the sign that says attract or repel — and write it as a vector so direction survives superposition. We work the magnitude and component forms on real numbers, check them against limiting cases and dimensions, and fix the point-charge approximation to source sizes small against every separation.\n",{"path":5774,"title":5775,"module":5767,"summary":5776},"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force","Electric Field and Force","Rather than ask how one charge reaches across empty space to another, we credit the source with a field that fills the space and let a second charge respond to whatever field sits at its own location. Electric field is force per unit positive test charge, $\\vec E=kq\\hat r\u002Fr^2$ for a point source, and source fields add before any receiving charge is placed. We compute those fields and the force $\\vec F=q\\vec E$ they exert, then follow a charge along its parabolic path through a uniform field and into nonuniform fields where the dynamics turn position-dependent.\n",{"path":5778,"title":5779,"module":5767,"summary":5780},"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps","Electric Field Maps","A field is a vector at every point of space, and the quickest way to grasp one is to draw it. We build the two standard pictures — continuous field lines tangent to $\\vec E$, and scaled vector arrows — and read direction, magnitude, and the location of nulls straight off them. We fix what a line drawing can and cannot say: density encodes magnitude only under a stated seeding rule, and integral curves never cross at a regular point. From there we work the topology near sources, sinks, and conductor surfaces, and state the step-size and interpolation checks a numerical map must pass.\n",{"path":5782,"title":5783,"module":5767,"summary":5784},"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles","Electric Dipoles","Most neutral matter carries no net charge yet still responds to an electric field, because its positive and negative charge sit slightly apart. That separation is a dipole, moment $\\vec p=q\\vec d$ pointing from the negative to the positive charge, and it is the leading term in how any neutral distribution looks from far away. We derive the torque $\\vec p\\times\\vec E$ and energy $-\\vec p\\cdot\\vec E$ a uniform field imposes, the net force a field gradient adds, and the axial and equatorial $1\u002Fr^3$ fields the pair produces, then measure how far out the point-dipole approximation still holds.\n",{"path":5786,"title":5787,"module":5788,"summary":5789},"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields","Continuous Charge Fields","Continuous Charge Distributions","A charged rod, ring, or disk is not a point, yet its field is still nothing but Coulomb's law added up over the charge it carries. We replace the discrete sum by an integral, with $\\d q=\\lambda\\d\\ell$, $\\sigma\\d A$, or $\\rho\\d V$, so the real work becomes geometry: writing the vector from each source element to the field point, and letting symmetry cancel the components that must cancel before any integral is attempted. We carry the line, ring, and disk fields through in full, then check each result against its near field, its far field, and its dimensions.\n",{"path":5791,"title":5792,"module":5788,"summary":5793},"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors","Gauss's Law and Conductors","Adding up Coulomb's law over a whole distribution is laborious; Gauss's law trades that sum for a single statement, that the flux of $\\vec E$ out of any closed surface counts the charge inside, $\\oint\\vec E\\cdot\\d\\vec A=Q_{\\rm enc}\u002F\\varepsilon_0$. The law is always true, but it hands over the field only when the source is symmetric enough to pull $E$ outside the integral. We apply it to spheres, lines, and sheets, then turn it on conductors, where the zero interior field drives every excess charge to the surface and fixes the normal-field jump $\\sigma\u002F\\varepsilon_0$, the charge induced on a cavity wall, and electrostatic shielding.\n",{"path":5795,"title":5796,"module":5797,"summary":5798},"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential","Point-Charge Potential","Electric Potential","The electrostatic force is conservative, so the work it does between two points\ndepends only on the endpoints. That lets us trade the vector field for a single\nscalar attached to each point, the electric potential, the potential energy a unit\ncharge would have there. We build potential from the work integral, fix the usual\nreference at infinity, and add point sources as scalars, $V=k\\sum_i q_i\u002Fr_i$,\navoiding the vector bookkeeping the field demands. Signed charges, the reference\nchoice, equipotential motion, and far-field expansions each give an independent\ncheck on a result.\n",{"path":5800,"title":5801,"module":5797,"summary":5802},"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials","Potential Gradients and Equipotentials","Given the potential everywhere, how do we recover the field? The field is the\nnegative gradient, $\\vec E=-\\nabla V$: it points down the steepest local drop in\npotential, and its magnitude is set by how fast $V$ changes, not by the shape of a\ncontour. We read off components with directional derivatives, reconstruct fields\nfrom measured potential grids using centered differences, and use closed-loop\nintegrals and grid refinement to test whether a reconstructed field is physically\nconsistent.\n",{"path":5804,"title":5805,"module":5797,"summary":5806},"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure","Electrostatic Energy and Pressure","Assembling a charge configuration takes work, and that work is stored, but where\nis it kept and how much is there? We total it two ways: as a sum over the charges,\n$U=\\tfrac12\\sum_i q_iV_i$, and as an integral over the field itself,\n$u_E=\\tfrac12\\varepsilon_0E^2$, energy the field carries in every region it fills.\nDifferentiating the stored energy at fixed charge or at fixed voltage recovers the\nmechanical force on a conductor, and at a charged surface the same field scale\nappears as an outward electrostatic pressure. We work the parallel-plate case in\nfull and mark where curvature and fringing make the pressure nonuniform.\n",{"path":5808,"title":5809,"module":5797,"summary":5810},"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems","Laplace Boundary Problems","Often the charges are not given, only the conductors and the voltages held on\nthem, and the potential in the empty space between has to be found. There $V$ obeys\nLaplace's equation $\\nabla^2V=0$, and the boundary data alone determine a unique solution.\nWe solve it two ways: separation of variables into boundary-matched modes, whose\nhigher spatial frequencies die away with depth into the domain, and finite-difference\nrelaxation for boundaries no analytic mode fits. Residual norms, boundary error, and\nflux balance tell us when the computed potential and its field can be trusted.\n",{"path":5812,"title":5813,"module":5797,"summary":5814},"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials","Continuous Charge Potentials","When charge is spread over a line, a surface, or a volume, the sum over point\nsources becomes an integral, $V(\\vec r)=k\\int \\d q\u002F|\\vec r-\\vec r'|$. Because\npotential is a scalar, this integral sidesteps the component algebra the field\nwould force, until the field is actually wanted through $\\vec E=-\\nabla V$. We set\nup the right density element for each geometry, choose a workable reference, handle\nthe integrable singularities that arise when the observation point sits on the\ncharge, and check every result against symmetry, dimensions, and the far-field\nmultipole limit.\n",{"path":5816,"title":5817,"module":5818,"summary":5819},"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals","Capacitance Fundamentals","Capacitance","How much charge must you separate onto two conductors to hold a given voltage between\nthem? That ratio, $C=Q\u002F\\Delta V$, is fixed by the conductor geometry and the medium,\nnot by how much charge is presently stored. We compute it from the field for the\nparallel-plate, isolated-sphere, concentric-sphere, and coaxial geometries, trace how\nsurface charge and boundary conditions set each result, and see where fringing,\nguarding, and stray coupling separate the ideal formula from what a bridge measures.\n",{"path":5821,"title":5822,"module":5818,"summary":5823},"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks","Capacitor Networks","Wire several capacitors together and the source sees one equivalent capacitance — but\nwhich? The answer comes not from how the symbols are drawn but from which conductors\nshare a node: parallel branches hold a common voltage and add, $C_{\\rm eq}=\\sum_iC_i$,\nwhile series branches share a common charge and add reciprocally. We derive both rules\nfrom charge conservation on the floating internal node, then extend the node-charge\nmethod to unequal, precharged, and stray-coupled branches and carry a worked reduction\nthrough to the charge and voltage on every element.\n",{"path":5825,"title":5826,"module":5818,"summary":5827},"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force","Capacitor Energy and Force","Charging a capacitor takes work, because every increment of charge is pushed through\nthe voltage the earlier charge already established. We total that work three\nequivalent ways, $U=Q^2\u002F(2C)=Q\\Delta V\u002F2=C(\\Delta V)^2\u002F2$, locate it in the field as\na density $u=\\tfrac12\\epsilon_0E^2$, then let the plates move. Differentiating the\nstored energy at fixed charge, or the coenergy at fixed voltage, gives the mechanical\nforce; the two boundaries differ only by the work the source supplies. We work the\nparallel-plate attraction and its electrostatic pressure in full, and follow the same\ngradient into pull-in, tilt, comb drives, and traceable force calibration.\n",{"path":5829,"title":5830,"module":5818,"summary":5831},"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown","Dielectric Polarization and Breakdown","Slide a dielectric between the plates and the capacitance rises — but why, and how\nhard can you drive it before the insulator fails? Bound charge answers the first:\npolarization $\\vec P$ sets up surface and volume charge that partly cancels the\napplied field, so $\\vec D=\\varepsilon_0\\vec E+\\vec P$ separates what the circuit\ncontrols from what the material contributes. We follow the field across layered\ndielectrics and interfaces, tie permittivity and loss to their frequency dependence,\nand treat dielectric strength as a measured, geometry-dependent limit rather than one\nmaterial number.\n",{"path":5833,"title":5834,"module":5835,"summary":5836},"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance","Current and Resistance","Direct-Current Circuits","What does it mean, physically, for charge to flow, and what sets how hard a wire resists that flow? Current counts charge crossing a surface, $I=\\int\\vec J\\cdot\\d\\vec A$, and traces back to a slow drift of many carriers, $\\vec J=nq\\vec v_d$. We establish when the linear law $V=IR$ actually holds, how resistivity and geometry combine into bulk resistance, why real sources sag under load through their internal resistance, and how the three power forms $P=IV=I^2R=V^2\u002FR$ tie electrical work to heating and component ratings.\n",{"path":5838,"title":5839,"module":5835,"summary":5840},"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis","Kirchhoff Network Analysis","Once a circuit has more than one loop, no amount of series-parallel folding will reduce it — you need the two conservation laws written as equations. Kirchhoff's junction law is charge conservation at a node; his loop law is energy conservation around a closed path. We turn a labelled network into a linear system in node voltages or mesh currents, fix the sign conventions so a negative answer just means a reversed arrow, and use power balance as an independent check that the algebra describes the circuit that was actually built.\n",{"path":5842,"title":5843,"module":5835,"summary":5844},"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients","RC Transients","How does a circuit get from one steady state to the next when a capacitor refuses to change its voltage all at once? Because a jump would demand infinite current, an RC circuit slides between states exponentially, with a single time constant $\\tau=RC$ that sets the whole schedule: charging fills as $1-e^{-t\u002F\\tau}$, discharge empties as $e^{-t\u002F\\tau}$. We solve the first-order loop equation, read the response off three numbers — the switch-instant voltage, the final dc voltage, and the Thevenin resistance the capacitor sees — and mark where source and probe resistance shift $\\tau$ or where a second storage element hides a mode a one-$\\tau$ fit misses.\n",{"path":5846,"title":5847,"module":5848,"summary":5849},"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories","Magnetic Trajectories","Magnetic Field","A charged particle in a magnetic field never speeds up or slows down, yet its path curves relentlessly. We work out why: the magnetic force is always perpendicular to velocity, so it does no work and bends the transverse motion into a circle of radius $r=mv_\\perp\u002F(|q|B)$ while leaving the parallel motion untouched, producing a helix. We derive the cyclotron frequency, show why it is independent of speed until relativity intervenes, and turn the geometry around: a measured curvature reads back a particle's momentum, which is how tracking detectors weigh what they cannot see.\n",{"path":5851,"title":5852,"module":5848,"summary":5853},"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect","Hall Effect","Current tells you charge is moving, but not whether the movers are positive or negative, nor how many there are. A magnetic field settles both questions. Push current through a strip in a transverse field and the carriers pile up on one edge until a transverse electric field just balances the magnetic deflection; the sign of the resulting Hall voltage names the carrier's charge and its size counts the carriers per volume. We derive the balance $q\\vec E+q\\vec v_d\\times\\vec B=0$, read off $V_H=IB\u002F(nqt)$, and see why field-and-current reversal is what separates the real Hall signal from the offsets that mimic it.\n",{"path":5855,"title":5856,"module":5848,"summary":5857},"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors","Magnetic Force on Conductors","A magnet pushes on a current-carrying wire even though the wire is electrically neutral. The reason is that each moving carrier feels the Lorentz force, and those microscopic pushes add up to a force the wire's supports must hold. We sum them into $\\d\\vec F=I\\,\\d\\vec\\ell\\times\\vec B$, collapse it to $\\vec F=I\\vec L\\times\\vec B$ for a straight segment in a uniform field, and see exactly when that shortcut fails and the full path integral is needed. The same law runs backward as a measurement: a force-versus-current slope weighs a magnetic field against a known length.\n",{"path":5859,"title":5860,"module":5848,"summary":5861},"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles","Magnetic Dipoles","A compass needle turns to point north; a current loop in a field does the same thing, and for the same reason. Both are magnetic dipoles, and a uniform field cannot push a dipole anywhere, only twist it. We package a loop's response into one vector, the magnetic moment $\\vec\\mu=IA\\hat n$, from which torque $\\vec\\tau=\\vec\\mu\\times\\vec B$ and orientation energy $U=-\\vec\\mu\\cdot\\vec B$ both follow. Stable alignment sits at the energy minimum, a field gradient is what it takes to produce a net force $\\vec F=\\nabla(\\vec\\mu\\cdot\\vec B)$, and the same moment reappears whenever anything from an electron to a planet acts magnetic.\n",{"path":5863,"title":5864,"module":5848,"summary":5865},"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry","Mass Spectrometry","To weigh a single atom you cannot use a scale, so you use a magnetic field instead. A charged ion of unknown mass bends in a field by an amount that depends on its momentum and charge, so if every ion enters with the same velocity, its landing position reads off its mass-to-charge ratio directly. We build the instrument in two stages: crossed electric and magnetic fields that pass only ions with $v=E\u002FB$, and a magnetic sector that bends the survivors along $r=mv\u002F(|q|B)$. Then we ask what blurs a spectral line and how reference ions turn a position into a calibrated mass.\n",{"path":5867,"title":5868,"module":5869,"summary":5870},"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields","Moving-Charge Fields","Magnetic Sources","Every magnetic field comes from charge in motion, and the simplest source is a single point charge drifting past. We work out the field it produces — normal to both the velocity and the line of sight, falling off as the inverse square — and read off why it vanishes straight ahead of the charge and peaks broadside. Summing many such charges is the bridge to steady currents, valid while speeds stay far below $c$ and the motion changes little during the time its field takes to propagate outward.\n",{"path":5872,"title":5873,"module":5869,"summary":5874},"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law","Biot–Savart Law","A steady current is a continuous stream of current elements, and the Biot–Savart law hands each one a magnetic contribution — a right-hand cross product that falls off as the inverse square of distance. Summing the contributions along a conductor is a vector line integral, which we carry out for the straight wire to get the endpoint-angle formula. The infinite-wire field $B=\\mu_0 I\u002F2\\pi s$ falls out as the limit where both ends recede, and we mark how fast a finite wire departs from it and when a thin-filament model is safe.\n",{"path":5876,"title":5877,"module":5869,"summary":5878},"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops","Circular Current Loops","A ring of current is the simplest source with a well-defined magnetic axis, and it is the building block of every coil and electromagnet. Symmetry kills the transverse Biot–Savart contributions along that axis and leaves a single clean integral; we evaluate it to get $B_z=\\mu_0 I R^2\u002F[2(R^2+z^2)^{3\u002F2}]$, read off the centre field $\\mu_0 I\u002F2R$, and watch it fall into the $1\u002Fz^3$ tail of a magnetic dipole far away. Stacking turns just adds their axial contributions, which is what makes a solenoid out of a pile of loops.\n",{"path":5880,"title":5881,"module":5869,"summary":5882},"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law","Ampère’s Law","When a current arrangement is symmetric enough, the Biot–Savart integral is overkill: Ampère's law, $\\oint_C\\vec B\\cdot\\d\\vec\\ell=\\mu_0 I_{\\rm enc}$, gets the field from a single line of reasoning about how much current a loop encloses. We see why the law holds for any steady current, then use cylindrical, planar, and toroidal symmetry to turn the circulation into simple algebra — the field inside and outside a wire, an infinite sheet, a solenoid, and a toroid. We also mark the catch: without symmetry the law still holds but no longer hands you the field pointwise.\n",{"path":5884,"title":5885,"module":5869,"summary":5886},"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism","Gauss’s Law for Magnetism","Electric field lines start and end on charges; magnetic field lines do neither, because no one has ever found an isolated magnetic pole. That single experimental fact is Gauss's law for magnetism: the flux of $\\vec B$ through any closed surface is zero, $\\oint\\vec B\\cdot\\d\\vec A=0$, or in differential form $\\nabla\\cdot\\vec B=0$. We work through what it says — every field line that enters a closed surface must leave it, so field lines close on themselves — and, just as important, what it does not say, since flux through an open surface is generally nonzero.\n",{"path":5888,"title":5889,"module":5869,"summary":5890},"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials","Magnetic Materials","Put matter in a magnetic field and its atoms respond, each acting as a tiny current loop; the aligned moments per unit volume are the magnetization $\\vec M$, whose bound currents add to the field. Separating what we control (the free current) from what the material supplies leads to $\\vec H$ and the relation $\\vec B=\\mu_0(\\vec H+\\vec M)$. We sort materials into diamagnets, paramagnets, and ferromagnets by how $\\vec M$ answers, follow a ferromagnet around its hysteresis loop, and see why the loop's area is the energy dissipated per cycle and why a sample's shape changes the field it actually feels.\n",{"path":5892,"title":5893,"module":5894,"summary":5895},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux","Magnetic Flux","Electromagnetic Induction","A magnetic field threading a loop collapses to one signed number, the flux, and every induced voltage in this module turns out to be a rate of change of that number — so defining the flux and its sign comes first. We define it as the surface integral of $\\vec B$ over an oriented surface, reduce it to $BA\\cos\\theta$ for a uniform field on a flat loop, and carry the flux linkage $N\\Phi_B$ of a coil. The chosen normal fixes the sign; reversing it flips the sign without touching the field. Nonuniform fields and curved surfaces force the integral, so we also build the numerical estimate and the checks that separate a reliable value from a nominal field-times-area product.\n",{"path":5897,"title":5898,"module":5894,"summary":5899},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law","Faraday's Law","Move a magnet toward a coil, or ramp the current in a nearby circuit, and a voltage appears with no battery in sight. Faraday's law names the cause: the emf around a loop equals minus the rate of change of the magnetic flux through it, so any change of field, area, orientation, or position that alters the flux drives an emf. We separate the emf, which lives around the boundary whether or not current can flow, from the current that follows only when the path is closed; fix the single sign convention that ties flux to loop orientation; and read the emf off rotating coils and off flux sampled at discrete times.\n",{"path":5901,"title":5902,"module":5894,"summary":5903},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law","Lenz's Law","The minus sign in Faraday's law is not decoration: it decides which way the induced current flows, and it always chooses the direction that fights the change that produced it. Lenz's law reads that sign off energy conservation — a current that aided the change would be free energy — and turns it into a repeatable procedure. We fix a surface normal and a positive loop direction so the sign is calculable, then work through approaching magnets, expanding loops, coupled coils, and rotating generators, using mechanical work and Joule heating as an independent check on every direction we draw.\n",{"path":5905,"title":5906,"module":5894,"summary":5907},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf","Motional EMF","Push a wire through a magnetic field and its free charges feel a sideways magnetic force that piles them up at the ends — a battery made of motion. Motional emf is that effect: the work per unit charge a moving conductor supplies is the line integral of $\\vec v\\times\\vec B$ along it, which for a rod moving perpendicular to both its length and the field collapses to $B\\ell v$. We chase where the energy comes from — the hand or motor fighting the magnetic drag, never the magnetic force itself — solve the sliding-rail circuit from both flux and carrier forces, and carry the idea into rotating rods, homopolar disks, generators, and the back emf of a motor.\n",{"path":5909,"title":5910,"module":5894,"summary":5911},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents","Eddy Currents","A wire carries current along one path; a solid block of metal offers a continuum of them, and any changing flux threading that block sets charge circulating in closed loops it chooses for itself. We ask what those eddy currents do — where they heat, where they drag, and how Lenz's law fixes their direction — and why the same circulation is a feature in an induction furnace and a loss to be suppressed in a transformer core. From a representative-loop estimate we get the scaling (heating grows with the square of frequency and flux rate) and the two design levers, lamination and resistivity, that break the paths a solid conductor would otherwise hand the current.\n",{"path":5913,"title":5914,"module":5894,"summary":5915},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance","Self-Inductance","A coil resists changes to its own current. Drive current through it and the flux it produces threads its own turns; change that current and Faraday's law turns the coil against the source with a back emf $\\mathcal E_L=-L\\,\\d I\u002F\\d t$. We define self-inductance as the flux linkage per ampere fixed by winding and core geometry, derive the long-solenoid value $L=\\mu_0 N^2A\u002F\\ell$, and follow the consequence that dominates circuits: because a finite voltage can only sustain a finite $\\d I\u002F\\d t$, an inductor's current cannot jump — which is why opening a switch on a live coil throws a spark.\n",{"path":5917,"title":5918,"module":5894,"summary":5919},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy","Magnetic Energy","Building current in a coil means working against its back emf, and that work does not vanish — it sits in the magnetic field as recoverable energy $U_B=\\tfrac12LI^2$, spread through space at density $u_B=B^2\u002F(2\\mu_0)$. We derive both forms, show they agree for a solenoid, and read a force out of the same energy: an armature is pulled toward higher inductance, and $B^2\u002F(2\\mu_0)$ doubles as a magnetic pressure. The lesson closes on the accounting a real switching event demands, where recoverable energy, copper heating, core loss, and clamp dissipation must balance a single ledger.\n",{"path":5921,"title":5922,"module":5894,"summary":5923},"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits","RL Circuits","Put a resistor and an inductor in series and the current cannot switch on or off at will: it climbs to $V_0\u002FR$ and falls away exponentially on a single time scale $\\tau=L\u002FR$ set by how much flux the coil hoards against how fast the resistor bleeds it. We solve the turn-on and turn-off, then confront the practical sting — because the coil's current refuses to stop instantly, breaking its path throws up a large voltage, which is why real inductive circuits carry freewheel diodes and clamps that trade voltage stress against how quickly the current dies.\n",{"path":5925,"title":5926,"module":5927,"summary":5928},"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals","AC Fundamentals","Alternating Current","A wall socket delivers a voltage that averages to zero over each cycle, yet it still heats a filament and runs a motor. The resolution is that dissipation follows the mean of the square, not the mean, so we define the root-mean-square value that makes an alternating source the equal of a DC one for resistive heating. We show a sinusoid's RMS is its peak divided by $\\sqrt2$, work out the average power an ideal resistor draws when its current stays in phase with the applied voltage, and separate the peak, average, and RMS descriptions that a single number cannot combine.\n",{"path":5930,"title":5931,"module":5927,"summary":5932},"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance","Reactance","A resistor obeys Ohm's law instant by instant, but a capacitor responds to how fast its voltage changes and an inductor to how fast its current changes. Under a steady sinusoid that rate-dependence collapses to a fixed quarter-cycle phase shift and a frequency-dependent amplitude ratio, the reactance. We derive $X_C=1\u002F(\\omega C)$ and $X_L=\\omega L$, adopt phasors to turn the defining derivatives into multiplication by $j\\omega$ so a single complex impedance carries amplitude and phase together, and track the energy an ideal reactance stores and returns without dissipating it. Real windings and dielectrics add loss, leakage, and self-resonance that bound where the ideal formulas hold.\n",{"path":5934,"title":5935,"module":5927,"summary":5936},"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance","RLC Resonance","Put a resistor, inductor, and capacitor in one loop and their reactances work against each other: inductive reactance grows with frequency while capacitive reactance shrinks, and at one frequency they cancel exactly. There the branch looks purely resistive, the current peaks, and the inductor and capacitor voltages can swing far above the source. We locate that resonance at $\\omega_0=1\u002F\\sqrt{LC}$, measure how sharp the peak is with the quality factor $Q=\\omega_0L\u002FR$, tie its half-power bandwidth $R\u002FL$ to the ringdown of the unforced circuit, and read the same poles off as bandpass and peaked filters at the R, L, or C terminals.\n",{"path":5938,"title":5939,"module":5927,"summary":5940},"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power","AC Power","Multiply an AC load's RMS voltage by its RMS current and you get an answer in volt-amperes that the wiring must carry, but not in general the watts the load consumes. The phase between voltage and current splits that product into a part that does net work and a part that merely sloshes energy back and forth. We derive the average power $P=V_{\\rm rms}I_{\\rm rms}\\cos\\phi$, package amplitude and phase into complex power $S=P+jQ$ so that real, reactive, and apparent power form one right triangle, and see why a harmonic-rich current forces the time-domain definition $P=\\langle vi\\rangle$ in place of a single phase angle.\n",{"path":5942,"title":5943,"module":5927,"summary":5944},"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers","Transformers","Two coils sharing an iron core exchange no charge, yet a changing current in one drives a voltage in the other, and the ratio of their turns sets how voltage and current trade off between the windings. That lets a transformer step a voltage up or down, isolate two circuits, and make a load look larger or smaller to the source by the square of the turns ratio. We build the ideal ratio element from Faraday's law and the dot convention, derive the reflected-impedance rule, then add the winding resistance, leakage, magnetizing current, and core loss that turn the ideal ratios into real regulation, efficiency, and a bounded voltage-frequency range.\n",{"path":5946,"title":5947,"module":5948,"summary":5949},"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current","Displacement Current","Maxwell’s Equations and Electromagnetic Waves","Ampère's law asks for the current through a surface bounded by a loop, but a charging capacitor breaks it: slide the surface off the wire and into the gap and the enclosed conduction current drops to zero, while the magnetic field around the loop plainly does not. Maxwell's repair is to count a changing electric flux as itself a source of magnetic circulation. We derive the displacement-current term $\\varepsilon_0\\,\\d\\Phi_E\u002F\\d t$, show that charge continuity demands it, compute the magnetic field it produces inside a charging capacitor, and see how it closes the Ampère–Maxwell law so that electric and magnetic fields can sustain one another as a wave.\n",{"path":5951,"title":5952,"module":5948,"summary":5953},"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves","Electromagnetic Waves","Once a changing electric flux can drive a magnetic field, the two curl laws feed each other: a disturbance in one regenerates the other, and the pair walks off through empty space with no medium holding it up. We take the curl of Faraday's law, land on a wave equation whose speed is fixed entirely by $\\mu_0$ and $\\varepsilon_0$, and find that $c=1\u002F\\sqrt{\\mu_0\\varepsilon_0}$ falls out of purely electric and magnetic constants. The plane-wave solution then fixes the geometry — $\\vec E$, $\\vec B$, and the propagation direction mutually perpendicular, oscillating in phase, with amplitudes locked at $E=cB$ — a set of independent predictions any real measurement must meet at once.\n",{"path":5955,"title":5956,"module":5948,"summary":5957},"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum","Electromagnetic Momentum","A light beam carries no mass, yet it pushes: shine it on a surface and the surface feels a force. We trace that force back to the fields, which store energy with density $\\varepsilon_0E^2$ and carry it along the Poynting vector $\\vec S=\\vec E\\times\\vec B\u002F\\mu_0$. Because that energy also carries momentum $U\u002Fc$, an absorbed beam presses with $I\u002Fc$ and a mirror with $2I\u002Fc$. We derive the Poynting theorem as local energy conservation, tie intensity to field amplitude, and work the momentum balance carefully enough that oblique incidence, partial reflection, and finite beams all drop out of one accounting.\n",{"path":5959,"title":5960,"module":5948,"summary":5961},"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation","Dipole Radiation","Only accelerating charge radiates, and the simplest accelerator is a charge sloshing back and forth: an oscillating electric dipole. We work out the field it throws off, keeping the part that survives to large distance — the $1\u002Fr$ radiation field whose intensity goes as $\\sin^2\\theta\u002Fr^2$, zero along the dipole axis and strongest broadside. From it follow the $\\omega^4$ scaling of total radiated power, radiation resistance as the feed's view of that escaping power, and, through reciprocity, the fact that a good transmitter receives well in the same directions. The near-zone terms that fall off faster carry no net power, and we mark carefully where each description is allowed to be used.\n",{"path":5963,"title":5964,"module":5948,"summary":5965},"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization","Polarization","A plane wave still leaves one thing free: which way its electric field points as it oscillates. That freedom is polarization, set entirely by the relative amplitude and phase of the two transverse field components — in phase gives a line, equal amplitudes a quarter cycle apart give a circle, everything else an ellipse. We work out how a linear analyzer reads a state through Malus's law $I=I_0\\cos^2\\theta$, why that scan alone cannot tell circular light from unpolarized, and how a quarter-wave plate plus a few analyzer settings recover the full Stokes vector and the degree of polarization.\n",{"path":5967,"title":5968,"module":5969,"summary":5970},"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction","Reflection and Refraction","Geometrical Optics","Light meeting a boundary between two transparent media splits into a reflected ray and a bent transmitted one, and predicting where those rays go is the whole starting point of geometrical optics. Fixing one convention — every angle measured from the surface normal — we get reflection's equal angles and derive Snell's law $n_1\\sin\\theta_1=n_2\\sin\\theta_2$ from wavefront timing. That single relation, applied once or twice, yields the critical angle and total internal reflection, prism deviation, the lateral shift through a window, apparent depth, and a fiber's acceptance cone; a wavelength-dependent index then adds dispersion. We mark throughout where the ray picture is trustworthy: feature sizes large against the wavelength and clean interface geometry.\n",{"path":5972,"title":5973,"module":5969,"summary":5974},"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses","Thin Lenses","A lens gathers the light spreading from one point back onto another, and a single paraxial relation $1\u002Fs+1\u002Fs'=1\u002Ff$ predicts where that image lands and how large it is. We collapse two refractions into one bending plane, read image position and orientation off the three principal rays, and trace focal length back to glass and curvature through the lensmaker equation. Sign conventions carry the physics here — they separate real from virtual images and upright from inverted — so we drill them before chaining lenses in sequence and in contact. The lesson ends on how focal length is actually measured on a bench, and where finite thickness, aperture, and dispersion break the thin-lens picture.\n",{"path":5976,"title":5977,"module":5969,"summary":5978},"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors","Spherical Mirrors","Curve a mirror and it stops merely reflecting an image and starts forming one: the same $1\u002Fs+1\u002Fs'=1\u002Ff$ that governs lenses reappears, now with $f=R\u002F2$ and reflected rays and object sharing one side of the glass. We derive the mirror equation from the reflection geometry of a single paraxial ray, then let signed distances do the sorting — real inverted images on the near branch, virtual upright ones behind the surface — and check the concave, convex, and plane-mirror limits against each other. The second half turns to how focal length is actually measured on a bench, by finite conjugates, distant targets, return imaging, and sagitta, and to the aperture and off-axis aberrations the single paraxial focus cannot capture.\n",{"path":5980,"title":5981,"module":6,"summary":6},"\u002Felectricity-and-magnetism","Electricity & Magnetism",{"path":5983,"title":5984,"module":5985,"summary":5986},"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms","Systems of Linear Equations and Row Reduction","Linear Equations in Linear Algebra","A linear system is a finite set of linear equations in shared variables. Elementary row operations rewrite it without changing its solution set, and reducing the augmented matrix to echelon form decides both existence and uniqueness. Pivot positions say whether the solution set is empty, a single point, or infinite.\n",{"path":5988,"title":5989,"module":5985,"summary":5990},"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations","Vector Equations and the Matrix Equation Ax = b","The same linear system reads three equivalent ways: a system of equations, a vector equation asking whether b is a linear combination of fixed vectors, and a matrix equation Ax = b. Ax is the linear combination of A's columns weighted by x, so consistency for a given b means b lies in the span of the columns, and consistency for every b means the columns span all of R^m.\n",{"path":5992,"title":5993,"module":5985,"summary":5994},"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications","Solution Sets and Applied Linear Systems","A homogeneous system Ax = 0 has a solution set that is a span through the origin; a consistent Ax = b has that same span translated by any one particular solution. Parametric vector form writes both explicitly. The structure shows up in applied systems with many solutions: equilibrium prices, balanced chemical reactions, network flows, weight-loss diets, and migration models.\n",{"path":5996,"title":5997,"module":5985,"summary":5998},"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence","Linear Independence","A set of vectors is linearly independent when the only linear combination equal to zero is the trivial one; otherwise a dependence relation writes one vector in terms of the others. For the columns of A the question becomes whether Ax = 0 has only the trivial solution — a pivot in every column. Counting pivots settles independence, and any set with more vectors than entries is automatically dependent.\n",{"path":6000,"title":6001,"module":5985,"summary":6002},"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations","Linear Transformations and Their Matrices","Reading A as an action rather than an array, x maps to Ax is a transformation from R^n to R^m. The ones that preserve addition and scalar multiplication are the linear transformations, and every one is x maps to Ax for a unique standard matrix whose columns are the images of the standard basis vectors. Onto and one-to-one translate into the span and independence of those columns.\n",{"path":6004,"title":6005,"module":6006,"summary":6007},"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations","Matrix Operations","Matrix Algebra","Matrices add and scale entrywise, but their product is defined so that multiplication corresponds to composition of linear maps: the columns of AB are A applied to the columns of B. From that requirement follow the row-column rule, the algebra of products (associative and distributive but not commutative), powers, and the transpose.\n",{"path":6009,"title":6010,"module":6006,"summary":6011},"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility","The Inverse and the Invertible Matrix Theorem","The inverse of a square matrix is the matrix analogue of a reciprocal, defined by AA⁻¹ = I. A closed form settles the 2×2 case; the Gauss–Jordan algorithm row reduces [A | I] to [I | A⁻¹] in general; and elementary matrices record single row operations. The Invertible Matrix Theorem collects a dozen equivalent conditions for invertibility into one statement.\n",{"path":6013,"title":6014,"module":6006,"summary":6015},"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu","Block Matrices and the LU Factorization","Partitioning a matrix into blocks lets sums, products, and inverses be computed block by block, as if the submatrices were scalars. Block structure also underlies the LU factorization A = LU, which splits solving Ax = b into two fast triangular solves and repays the cost whenever many systems share one coefficient matrix.\n",{"path":6017,"title":6018,"module":6006,"summary":6019},"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank","Subspaces of Rⁿ, Dimension, and Rank","A subspace is a set closed under addition and scalar multiplication. Every matrix carries two: the column space of all attainable outputs Ax, and the null space of all solutions of Ax = 0. A basis measures each with a minimal spanning set, dimension counts it, and the Rank Theorem ties pivots and free variables together as rank + nullity = n.\n",{"path":6021,"title":6022,"module":6006,"summary":6023},"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics","Applications: Leontief Economics and Computer Graphics","The Leontief input–output model balances an economy through (I − C)x = d and expands the inverse as a geometric series in the consumption matrix. Computer graphics moves figures with matrix products, using homogeneous coordinates so that translation and perspective projection become matrix multiplications too.\n",{"path":6025,"title":6026,"module":6027,"summary":6028},"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors","Introduction to Determinants","Determinants","The determinant of a square matrix is defined recursively by cofactor expansion: an n-by-n determinant is a signed sum of (n-1)-by-(n-1) determinants built from the first row. The expansion can equally run along any row or down any column, and a triangular matrix has determinant equal to the product of its diagonal.\n",{"path":6030,"title":6031,"module":6027,"summary":6032},"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants","Properties of Determinants","Row operations act on the determinant in three predictable ways, and this turns row reduction into a fast algorithm: the determinant is the product of the pivots times a sign for the interchanges. The same properties yield the invertibility test det A is nonzero, the transpose identity, and the multiplicative law det(AB) equals det A times det B.\n",{"path":6034,"title":6035,"module":6027,"summary":6036},"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area","Cramer's Rule, Volume, and Linear Transformations","Cramer's rule writes each unknown of an invertible system as a ratio of determinants, and the same idea gives a closed formula for the inverse through the adjugate. Geometrically the absolute determinant is the area of the parallelogram or the volume of the parallelepiped spanned by the columns, so a linear map scales every region's measure by that factor.\n",{"path":6038,"title":6039,"module":6040,"summary":6041},"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces","Vector Spaces and Subspaces","Vector Spaces","A vector space is any set closed under addition and scalar multiplication that obeys ten algebraic axioms. The same axioms that govern arrows in the plane govern polynomials, functions, matrices, and infinite signals, so one theory covers them all. A subspace is a subset that is a vector space in its own right, tested by three conditions, and the span of any set of vectors is the smallest subspace containing them.\n",{"path":6043,"title":6044,"module":6040,"summary":6045},"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces","Null Spaces, Column Spaces, and Linear Transformations","Two subspaces sit inside every matrix. The null space collects all solutions of $Ax = 0$ and lives in the domain; the column space collects every attainable $Ax$ and lives in the codomain. One is defined implicitly by a condition, the other explicitly by a spanning set, and the same pair appears for an abstract linear transformation as its kernel and range.\n",{"path":6047,"title":6048,"module":6040,"summary":6049},"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets","Linearly Independent Sets and Bases","A basis is a spanning set with no redundancy: linearly independent and still large enough to reach every vector. The spanning-set theorem shows any spanning set can be trimmed to a basis by discarding dependent vectors, and the pivot columns of a matrix give a basis for its column space. Independence and spanning are defined for abstract spaces exactly as in $\\mathbb{R}^n$.\n",{"path":6051,"title":6052,"module":6040,"summary":6053},"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems","Coordinate Systems","Fixing a basis assigns every vector a unique list of coordinates, turning an abstract space into $\\mathbb{R}^n$. The coordinate mapping is a one-to-one linear transformation onto $\\mathbb{R}^n$ — an isomorphism — so any $n$-dimensional space is indistinguishable from $\\mathbb{R}^n$ as far as vector-space computations go. In $\\mathbb{R}^n$ the change-of-coordinates matrix $P_B$ and its inverse convert between basis coordinates and standard coordinates.\n",{"path":6055,"title":6056,"module":6040,"summary":6057},"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank","The Dimension of a Vector Space and Rank","Every basis of a space has the same number of vectors, and that number is the dimension. Rank is the dimension of the column space, equal to the dimension of the row space and to the number of pivots. The Rank Theorem, rank plus nullity equals the number of columns, ties the four fundamental subspaces of a matrix together and adds six lines to the Invertible Matrix Theorem.\n",{"path":6059,"title":6060,"module":6040,"summary":6061},"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis","Change of Basis","Two bases give the same vector two different coordinate vectors, and a single invertible matrix converts between them. Its columns are the coordinate vectors of the old basis expressed in the new one, and its inverse reverses the conversion. In $\\mathbb{R}^n$ the change-of-coordinates matrix between two bases is found by one row reduction.\n",{"path":6063,"title":6064,"module":6040,"summary":6065},"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov","Applications: Difference Equations and Markov Chains","The solutions of an nth-order linear difference equation form an $n$-dimensional vector space, so finding $n$ independent solutions gives them all. A Markov chain evolves a probability distribution by repeated multiplication by a stochastic matrix, and a regular chain converges to a unique steady-state vector fixed by that matrix. Both applications turn a dynamic process into a subspace or a fixed-point question.\n",{"path":6067,"title":6068,"module":6069,"summary":6070},"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues","Eigenvectors and Eigenvalues","Eigenvalues and Eigenvectors","An eigenvector of a square matrix is a nonzero vector the matrix only stretches; its eigenvalue is the stretch factor. The eigenspace of an eigenvalue is the null space of A minus lambda times the identity, the eigenvalues of a triangular matrix are its diagonal entries, and eigenvectors for distinct eigenvalues are linearly independent.\n",{"path":6072,"title":6073,"module":6069,"summary":6074},"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation","The Characteristic Equation","The eigenvalues of a matrix are the roots of its characteristic polynomial det(A minus lambda I). This degree-n polynomial carries an algebraic multiplicity at each repeated root, a nonzero determinant is equivalent to zero not being an eigenvalue, and similar matrices share a characteristic polynomial and hence the same eigenvalues.\n",{"path":6076,"title":6077,"module":6069,"summary":6078},"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization","Diagonalization","A matrix is diagonalizable when it factors as A equals P D P inverse with D diagonal, which happens exactly when it has n linearly independent eigenvectors. The factorization computes matrix powers cheaply, distinct eigenvalues guarantee it, and a repeated eigenvalue permits it only when its eigenspace dimension equals its multiplicity.\n",{"path":6080,"title":6081,"module":6069,"summary":6082},"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations","Eigenvectors and Linear Transformations","Every linear transformation between finite-dimensional spaces has a matrix relative to chosen bases, built from the coordinate vectors of the images of the basis vectors. For a map from a space to itself, an eigenvector basis makes that matrix diagonal, and that change of basis is diagonalization; the matrices similar to A are the representations of the map in every basis.\n",{"path":6084,"title":6085,"module":6069,"summary":6086},"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues","Complex Eigenvalues","A real matrix with no real eigenvalues still has complex ones, occurring in conjugate pairs. A real 2-by-2 matrix with eigenvalue a plus b i is similar to a rotation-scaling matrix, whose rotation angle is the argument of the eigenvalue and whose scale factor is its modulus; the modulus decides whether the trajectories close up, spiral in, or spiral out.\n",{"path":6088,"title":6089,"module":6069,"summary":6090},"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems","Discrete and Continuous Dynamical Systems","Eigenvalues govern the long-term behavior of a system that evolves by x becomes A x or by x prime equals A x. An eigenvector basis decouples both kinds of system into independent scalar equations; the eigenvalues then classify the origin as attractor, repeller, saddle, or spiral, and the dominant eigenpair fixes the growth rate and limiting direction.\n",{"path":6092,"title":6093,"module":6069,"summary":6094},"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method","Iterative Estimates for Eigenvalues","When only a numerical eigenvalue is needed, iteration is preferred over the characteristic polynomial. The power method repeatedly multiplies by A to converge on the dominant eigenvalue and its eigenvector; the Rayleigh quotient sharpens the estimate for symmetric matrices; and the inverse power method targets any eigenvalue near a known guess.\n",{"path":6096,"title":6097,"module":6098,"summary":6099},"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality","Inner Product, Length, and Orthogonality","Orthogonality and Least Squares","The dot product turns the algebra of vectors in R^n into geometry: length, distance, and perpendicularity. The inner product yields the norm, the Pythagorean theorem, and the orthogonal complement, and the null space of a matrix is the orthogonal complement of its row space.\n",{"path":6101,"title":6102,"module":6098,"summary":6103},"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections","Orthogonal Sets and Orthogonal Projections","An orthogonal basis makes coordinates trivial: each weight is a single dot product, no linear system required. Orthogonal and orthonormal bases give a direct projection formula onto a line and onto a subspace, the orthogonal decomposition and best-approximation theorems, and the matrix form U U-transpose of a projection.\n",{"path":6105,"title":6106,"module":6098,"summary":6107},"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr","The Gram-Schmidt Process and QR Factorization","Gram-Schmidt turns any basis into an orthogonal one by repeatedly subtracting off projections onto the span already built. Normalizing the result and recording the coefficients factors the matrix as A = QR, with Q orthonormal and R upper triangular, the factorization behind stable least-squares and eigenvalue algorithms.\n",{"path":6109,"title":6110,"module":6098,"summary":6111},"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems","Least-Squares Problems","When Ax = b has no solution, the least-squares solution makes Ax as close to b as possible. The closest Ax is the projection of b onto the column space, and the vector that produces it solves the normal equations A-transpose A x = A-transpose b. Uniqueness, the residual error, and the stabler QR route follow.\n",{"path":6113,"title":6114,"module":6098,"summary":6115},"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications","Applications to Linear Models","Curve fitting is a least-squares problem in statistical notation. The least-squares line, polynomial fits, and multiple regression all reduce to X beta = y with a design matrix X built from the data, solved by the same normal equations.\n",{"path":6117,"title":6118,"module":6098,"summary":6119},"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces","Inner Product Spaces","Promoting the four properties of the dot product to axioms defines an inner product on any vector space, including spaces of functions. Length, distance, orthogonality, Gram-Schmidt, and best approximation all carry over, along with the Cauchy-Schwarz and triangle inequalities and the integral inner product behind Fourier approximation.\n",{"path":6121,"title":6122,"module":6123,"summary":6124},"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices","Diagonalization of Symmetric Matrices","Symmetric Matrices, Quadratic Forms, and the SVD","A symmetric matrix is one that equals its own transpose. Every such matrix can be diagonalized by an orthogonal change of basis, A = PDPᵀ, with real eigenvalues and perpendicular eigenvectors. This is the Spectral Theorem, and it rewrites A as a weighted sum of rank-one projections onto its eigenvectors.\n",{"path":6126,"title":6127,"module":6123,"summary":6128},"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms","Quadratic Forms","A quadratic form xᵀAx is the second-degree analogue of a linear map, attached to a symmetric matrix A. Orthogonal diagonalization changes variables to the eigenbasis, removing all cross-terms and rotating the form into standard position. The signs of the eigenvalues then classify it as definite or indefinite.\n",{"path":6130,"title":6131,"module":6123,"summary":6132},"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization","Constrained Optimization","Maximizing a quadratic form xᵀAx over the unit sphere has an exact answer: the maximum is the largest eigenvalue of A, attained at its eigenvector, and the minimum is the smallest eigenvalue. Adding orthogonality constraints peels off the eigenvalues in order, characterizing the whole spectrum by optimization.\n",{"path":6134,"title":6135,"module":6123,"summary":6136},"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition","The Singular Value Decomposition","The singular value decomposition factors any m×n matrix as A = UΣVᵀ, with orthogonal U and V and a nonnegative diagonal Σ of singular values. The singular values are the square roots of the eigenvalues of AᵀA, and they describe the matrix geometrically as a rotation, an axiswise stretch, and another rotation, exposing rank, the four fundamental subspaces, and a best low-rank approximation.\n",{"path":6138,"title":6139,"module":6123,"summary":6140},"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging","Applications: Image Processing and Statistics","Principal component analysis diagonalizes the covariance matrix of a data set, producing uncorrelated variables ordered by variance. The leading components capture most of the variation, which reduces dimension, compresses images through low-rank SVD approximation, and connects directly to the singular values of the data matrix.\n",{"path":6142,"title":6143,"module":6144,"summary":6145},"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation","Numerical Thinking and Matrix Computation","Numerical Linear Algebra","Numerical analysis builds efficient discrete algorithms for continuous problems, and its cost is dominated as much by memory traffic as by arithmetic. Block matrix calculus, flop counts, and the BLAS efficiency ratio fix the cost model; triangular and unitary matrices are the two computational building blocks every factorization rests on.\n",{"path":6147,"title":6148,"module":6144,"summary":6149},"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky","LU and Cholesky Factorization in Practice","Gaussian elimination, read as a factorization A = LU, turns a linear system into two triangular solves. A single near-zero pivot wrecks it, so partial pivoting reorders rows to pick the largest available pivot and makes the method work for every invertible matrix. For symmetric positive-definite systems, Cholesky halves the cost and needs no pivoting.\n",{"path":6151,"title":6152,"module":6144,"summary":6153},"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point","Conditioning and Floating-Point Arithmetic","A problem's condition number measures how much its answer moves when its data is perturbed, independent of any algorithm. Subtraction is ill-conditioned under cancellation, and for a linear system the amplifier is the matrix condition number κ(A). Floating-point arithmetic supplies the perturbation: every real number is rounded to within a relative machine precision, so even perfect computation inherits an error of order κ times the unit roundoff.\n",{"path":6155,"title":6156,"module":6144,"summary":6157},"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis","Numerical Stability and Backward Error Analysis","An algorithm is backward stable when its computed answer is the exact answer to a slightly perturbed problem. Combined with the condition number this gives the governing rule of thumb: forward error is at most condition times stability. Three cancellation case studies make the point, then the residual-based backward error applies it to Ax = b and shows why partial pivoting keeps Gaussian elimination stable.\n",{"path":6159,"title":6160,"module":6144,"summary":6161},"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares","QR, Householder, and Numerical Least Squares","The least-squares problem reduces to the normal equations, but forming AᵀA squares the condition number and can wreck accuracy. The stable route computes a QR factorization directly on A and solves Rx = Qᵀb. Householder reflectors build that QR one column at a time using length-preserving reflections, the unconditionally backward-stable building block behind every serious least-squares solver.\n",{"path":6163,"title":6164,"module":6144,"summary":6165},"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd","Numerical Eigenvalue Problems and the SVD","Eigenvalues cannot be found by a formula for large matrices, so they are found by iteration. Power and inverse iteration converge to one eigenvector at a rate set by the eigenvalue gap; the QR algorithm sweeps a matrix to Schur form and, with a good shift and a Hessenberg reduction, computes the whole spectrum in cubic time. Singular values follow from the same machinery applied without ever forming AᵀA.\n",{"path":6167,"title":6168,"module":6169,"summary":6170},"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations","Affine Combinations","Geometry of Vector Spaces","An affine combination is a linear combination whose weights sum to one. The affine hull of a set is the smallest flat containing it: a point, a line, a plane, or a translated subspace. Homogeneous coordinates turn every affine combination into an ordinary linear combination one dimension up.\n",{"path":6172,"title":6173,"module":6169,"summary":6174},"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates","Affine Independence and Barycentric Coordinates","Affine independence is linear independence for the translated or lifted points, and it guarantees each point of an affine hull a unique weight vector. Those weights are barycentric coordinates: centers of mass, ratios of triangle areas, and the interpolation rule behind smooth shading in computer graphics.\n",{"path":6176,"title":6177,"module":6169,"summary":6178},"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets","Convex Combinations and Convex Sets","A convex combination is an affine combination with nonnegative weights, and the convex hull of a set is the smallest convex set containing it. Convex sets are closed under intersection, and Carathéodory's theorem bounds how many points a convex combination in $\\mathbb{R}^n$ ever needs: at most $n+1$.\n",{"path":6180,"title":6181,"module":6169,"summary":6182},"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes","Hyperplanes and Polytopes","A hyperplane is a level set of a linear functional, the set where an inner product equals a constant. Hyperplanes separate disjoint convex sets and support them at their boundaries. Polytopes are convex hulls of finite point sets; their vertices are the extreme points, and a linear functional attains its extremes there.\n",{"path":6184,"title":6185,"module":6169,"summary":6186},"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces","Curves and Surfaces","Bézier curves are affine combinations of control points with polynomial weights, so they lie in the convex hull of those points and bend toward them. The de Casteljau algorithm evaluates them by repeated interpolation, a matrix form factors them for computation, and matching endpoints and tangents joins segments into smooth curves and surfaces.\n",{"path":6188,"title":6189,"module":6,"summary":6},"\u002Flinear-algebra","Linear Algebra",{"path":6191,"title":6192,"module":6,"summary":6},"\u002Ftheory-of-computation","Theory of Computation",{"path":6194,"title":6195,"module":4995,"summary":6196},"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words","Bits, Bytes, and Words","Everything a machine stores is a string of bits grouped into bytes. We set out binary and hexadecimal, the byte as the unit of addressing, the word as the machine's natural integer size, and byte ordering — why the same four bytes read as 0x01234567 on one machine and 0x67452301 on another.\n",{"path":6198,"title":6199,"module":4995,"summary":6200},"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation","Integer Representation","A fixed-width byte string is just a pattern; what makes it a number is the rule we read it by. We define unsigned encoding and two's complement — where the top bit carries a negative weight — derive the ranges UMax, TMin, and TMax, and show how the same bits reinterpret between signed and unsigned, how widening sign-extends, and what truncation throws away.\n",{"path":6202,"title":6203,"module":4995,"summary":6204},"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic","Integer Arithmetic","Fixed-width integer arithmetic is arithmetic modulo a power of two: add past the top and the result wraps. We work out unsigned and two's-complement addition and the rules that detect their overflow, why negation is a complement-plus-one, how multiplication truncates to the low-order bits and how compilers turn constant multiplies into shifts and adds, why C declares signed overflow undefined, and the bias fix that keeps shift-based signed division rounding toward zero.\n",{"path":6206,"title":6207,"module":4995,"summary":6208},"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point","Floating Point","IEEE-754 trades the exactness of integers for enormous range by storing numbers as sign, exponent, and fraction — scientific notation in binary. We lay out the single and double formats, the bias that encodes the exponent, the three regimes (normalized, denormalized, special), a worked encode\u002Fdecode, the four rounding modes and round-to-even at the bit level, why addition is not associative, the pitfalls of float-int conversion, and why 0.1 has no exact binary representation.\n",{"path":6210,"title":6211,"module":4995,"summary":6212},"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation","Boolean Algebra and Bit Manipulation","Treat a word as a vector of independent bits and the bitwise operators become an algebra. We define AND, OR, NOT, and XOR as bit vectors, build the masking idioms that set, clear, toggle, and test individual bits, extract fields with zero- and sign-extension, count set bits three ways, derive the classic x & (x - 1) family of tricks, and distinguish bitwise operators from C's short-circuiting logical operators.\n",{"path":6214,"title":6215,"module":6216,"summary":6217},"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view","The Machine's View","Machine-Level Programming","The instruction set architecture is the contract a compiler writes against: the program counter, sixteen integer registers with their sub-register widths, and the condition codes. We follow one C function down through gcc to assembly, learn to read an instruction as operation plus operands, and fix the vocabulary the rest of the module uses.\n",{"path":6219,"title":6220,"module":6216,"summary":6221},"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement","Data Movement","Most instructions a program runs simply move data. We cover the mov family and its size suffixes, the three operand forms, the full memory addressing mode D(Rb,Ri,S) and its special cases, lea for address arithmetic, and how push and pop manipulate the stack pointer %rsp on a stack that grows toward lower addresses.\n",{"path":6223,"title":6224,"module":6216,"summary":6225},"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic","Arithmetic and Logic","The ALU instructions that compute on register and memory values: add, sub, and imul; the unary inc\u002Fdec\u002Fneg\u002Fnot; the shifts sal\u002Fshr\u002Fsar; the bitwise and\u002For\u002Fxor; and lea reused as a fast arithmetic trick. Each binary operation also sets the condition-code flags CF, ZF, SF, and OF, which cmp and test compute without keeping a result.\n",{"path":6227,"title":6228,"module":6216,"summary":6229},"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow","Control Flow","How a flat instruction stream realizes branches and loops. The conditional jumps read the condition-code flags; set instructions turn flags into a 0\u002F1 byte. We translate if\u002Felse into the standard compare-and-branch pattern, while\u002Ffor loops into the guarded-do form, and dense switches into jump tables that index a target directly.\n",{"path":6231,"title":6232,"module":6216,"summary":6233},"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures","Procedures","How a function call works at the machine level: the run-time stack, call and ret passing control through a saved return address, the System V convention that routes the first six arguments through %rdi..%r9 and the result through %rax, the caller-saved versus callee-saved split, the stack frame, and a recursive factorial traced through its frames.\n",{"path":6235,"title":6236,"module":6216,"summary":6237},"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment","Arrays, Structs, and Alignment","How aggregate data lays out in memory. Arrays as base-plus-scaled-index, the row-major ordering of multidimensional arrays, pointer arithmetic in units of the pointed-to type, struct fields at fixed byte offsets, the overlapping storage of unions, and the alignment rules that force padding into a struct.\n",{"path":6239,"title":6240,"module":6216,"summary":6241},"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows","Memory Layout and Buffer Overflows","The process address space — text, data, heap, and stack — and the classic vulnerability it enables. A stack buffer that is written past its end can overwrite the saved return address and redirect ret, so we sketch the mechanism defensively and then the three standard protections: stack canaries, a non-executable stack, and address-space layout randomization.\n",{"path":6243,"title":6244,"module":6245,"summary":6246},"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is","What an ISA Is","Instruction Set Architecture","The instruction set architecture is the contract that lets a compiler and a chip be written by people who never meet: the stable interface software targets and hardware implements. We separate architecture from microarchitecture, read RISC and CISC as opposite answers to where complexity should live, price out what each choice costs in decode hardware, code density, and pipeline friendliness, and see how x86-64 endures by translating its instructions into RISC-like operations on the fly.\n",{"path":6248,"title":6249,"module":6245,"summary":6250},"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands","Instruction Formats and Operands","An instruction is an opcode plus a way to name its operands. We count operands — 3-address, 2-address, 1-address accumulator, and 0-address stack machines — by writing the same C = A + B four ways, weigh register operands against memory operands, then lay out the same add byte by byte in x86-64 (REX prefix, opcode, ModRM) and in Y86-64, and what fixed versus variable length costs at fetch time.\n",{"path":6252,"title":6253,"module":6245,"summary":6254},"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes","Addressing Modes","Once an operand field exists, it needs a rule for turning its bits into the data it names. That rule is the addressing mode. We walk the standard set — immediate, register, direct, register-indirect, displacement, scaled-indexed, and PC-relative — fixing the effective-address computation for each, run every mode against one concrete machine state, and price out what Y86-64 loses by keeping only base plus displacement.\n",{"path":6256,"title":6257,"module":6245,"summary":6258},"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set","The Y86-64 Instruction Set","Y86-64 is a teaching ISA — a stripped-down x86-64 simple enough to implement by hand yet real enough to compile to. We fix its programmer-visible state (fifteen registers, three condition codes, the PC, memory, and a status code), give the instruction set with exact byte encodings, spell out how the condition codes decide every jXX and cmovXX, and run the encoding both directions: assembly to bytes and raw bytes back to meaning.\n",{"path":6260,"title":6261,"module":6245,"summary":6262},"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming","Y86-64 Programming","With the encodings fixed, we write real Y86-64 assembly: the .pos, .align, and .quad directives, the calling convention borrowed from x86-64, a stack set up by hand, and complete programs — an array sum and a branch-free max. We watch the assembler turn the listing into the exact byte image the processor will execute, and trace the stack across the call.\n",{"path":6264,"title":6265,"module":6266,"summary":6267},"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions","Transistors, Gates, and Boolean Functions","Digital Logic","A processor is built from millions of transistor switches. We start at the MOS transistor as a voltage-controlled switch, build the CMOS inverter and NAND transistor by transistor, meet the seven standard gates with their truth tables, show that NAND alone is functionally complete, price each gate in transistors and in time, and turn any truth table into a sum-of-products circuit.\n",{"path":6269,"title":6270,"module":6266,"summary":6271},"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl","Combinational Logic and HCL","A combinational circuit is a pure Boolean function of its current inputs — no memory, no clock. We draw the line between combinational and sequential logic, do the gate-delay accounting that finds a circuit's critical path and bounds the clock, meet don't-cares, then introduce CS:APP's Hardware Control Language: bit-level operators, word-level signals, equality nets, and the case expression that compiles to a multiplexer tree.\n",{"path":6273,"title":6274,"module":6266,"summary":6275},"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu","Multiplexers, Decoders, and the ALU","The combinational building blocks that make a datapath. We build the 2:1 and 4:1 multiplexer and tie it back to HCL's case expression, the n-to-2^n decoder, a one-bit full adder (sum is XOR, carry is majority), the ripple-carry adder that chains them, and finally the ALU — a function unit that selects among add, sub, and, and xor under a control input and exposes condition flags.\n",{"path":6277,"title":6278,"module":6266,"summary":6279},"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking","Memory Elements: Latches, Flip-Flops, and Clocking","A combinational circuit holds no state; feeding a circuit's output back to its input creates memory. We build the SR latch from cross-coupled gates, the level-sensitive D latch, and the master\u002Fslave edge-triggered D flip-flop, then introduce the clock and the synchronous design discipline, the setup\u002Fhold timing window, clock skew, metastability, and the register as n flip-flops sharing one clock.\n",{"path":6281,"title":6282,"module":6266,"summary":6283},"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory","Register Files and Random-Access Memory","Storage organized for access by address. We build the register file (a small bank of registers with addressed read ports and clocked write ports, the exact structure Y86-64's decode and write-back stages use), then descend to the SRAM and DRAM cells of main memory, why one is fast and dear and the other dense and slow, and how a row decoder picks a word out of a memory array.\n",{"path":6285,"title":6286,"module":6287,"summary":6288},"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle","The Fetch-Decode-Execute Cycle","Processor Design","A processor is a machine that repeats one loop forever: read the next instruction from memory, figure out what it asks for, do it, and advance. We fix the stored-program idea, lay out the datapath at a high level — PC, instruction memory, register file, ALU, data memory — and the control unit that sequences them, break the work into the six stages the rest of the module builds in hardware, and work out exactly how fetch parses variable-length instructions and computes the next PC.\n",{"path":6290,"title":6291,"module":6287,"summary":6292},"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages","The SEQ Stages","The six SEQ stages, made exact. For every Y86-64 instruction — halt, nop, the moves, OPq, the jumps, call and ret, pushq and popq — we write down what Fetch, Decode, Execute, Memory, Write-back, and PC update each compute, as per-instruction stage tables with every row justified. Once the tables are filled in, the processor is fully specified; the remaining lessons turn them into wires.\n",{"path":6294,"title":6295,"module":6287,"summary":6296},"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing","Control Logic and Sequencing","The stage tables say what each instruction needs; the control logic computes it from icode. We write the HCL for the register-port selections (srcA, srcB, dstE, dstM), the ALU function and input selection, the memory read\u002Fwrite and address, the branch condition, and the next-PC mux — each a case expression on icode that compiles to a mux — and see how one blob of combinational logic serves every instruction at once. We close by contrasting hardwired control with the microprogrammed alternative.\n",{"path":6298,"title":6299,"module":6287,"summary":6300},"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq","Assembling SEQ","We wire the whole thing together. The functional units from digital logic and the control signals from the last lesson assemble into the complete SEQ datapath, laid out the way CS:APP draws it — six stages stacked bottom to top, Fetch at the floor and PC update at the ceiling, signals flowing up the margins. Then the timing analysis: why everything must settle in one cycle, the no-reading-back principle that makes single-cycle execution consistent, and the critical path that sets the clock. We close by walking an OPq and a ret through the assembled machine.\n",{"path":6302,"title":6303,"module":6287,"summary":6304},"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program","Tracing a Program","To close the module, we take a complete Y86-64 program — a loop that sums 1 through 3 — and run it through SEQ one cycle at a time, recording the PC, the fetched instruction, every stage computation, and the registers, condition codes, and memory after each cycle. Then we examine single cycles in detail: every named signal of an OPq in concrete hex, and a second program whose call and ret we trace through the stack. The traces confirm that the assembled datapath and control logic behave as a processor.\n",{"path":6306,"title":6307,"module":6308,"summary":6309},"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles","Pipelining Principles","Pipelining","A processor that runs one instruction to completion before starting the next wastes most of its hardware most of the time. Pipelining splits the work into stages separated by registers so several instructions are in flight at once. We separate throughput from latency, work the 300 ps example through one, two, and three stages, and derive the three ceilings on the gain: uneven stages, register overhead, and the dependencies between instructions.\n",{"path":6311,"title":6312,"module":6308,"summary":6313},"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe","From SEQ to PIPE","We turn the sequential Y86-64 processor into a pipelined one by inserting pipeline registers between its stages so each cycle holds one instruction per stage. Doing it correctly forces a rearrangement: the next-PC computation must move into Fetch as a prediction, because the later stages that used to compute it are now busy with other instructions. We walk SEQ to SEQ+ to PIPE, spell out exactly what each pipeline register carries, and fix the naming discipline (D_stat versus d_stat) that keeps five in-flight instructions straight.\n",{"path":6315,"title":6316,"module":6308,"summary":6317},"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding","Data Hazards: Stalling and Forwarding","Overlapping instructions collide when a later one needs a value an earlier one has not finished computing: a read-after-write data hazard. We map exactly which instruction distances are dangerous, fix hazards the slow way by stalling (three bubbles), then the fast way by forwarding from five distinct sources into Decode, in a priority order that sequential semantics forces. Forwarding handles almost everything; the load-use hazard still needs exactly one stall.\n",{"path":6319,"title":6320,"module":6308,"summary":6321},"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction","Control Hazards and Branch Prediction","A pipeline must fetch an instruction every cycle, but after a conditional jump or a ret the next address is not yet known: a control hazard. We measure the branch penalty, weigh predict-taken against its alternatives with real loop arithmetic, watch PIPE detect a misprediction in Execute and squash the two wrong-path instructions, and meet the ret hazard, which has nothing to predict and stalls three cycles. A 2-bit counter gives a taste of dynamic prediction.\n",{"path":6323,"title":6324,"module":6308,"summary":6325},"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor","The Complete PIPE Processor","We assemble the full pipelined Y86-64: five stages, five pipeline registers, forwarding paths, and a small control unit that decides, each cycle, whether to stall or bubble each register. The subtle part is when hazards combine: one pairing hides a genuine bug. A fourth control case reads stat and keeps exceptions precise. Performance reduces to CPI = 1 + lp + mp + rp, worked out to 1.27 with realistic frequencies, and PIPE beats SEQ by several times despite every penalty.\n",{"path":6327,"title":6328,"module":6329,"summary":6330},"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap","Storage Technologies and the Latency Gap","The Memory Hierarchy","No single memory is both fast and large and cheap. We survey the technologies a machine can store bits in — SRAM, DRAM, flash, and rotating disk — open up a DRAM chip to find the row buffer, work a disk access down to the millisecond, and rank everything by speed, density, and cost per bit. Then we watch the processor outrun memory decade after decade. That widening gap is the whole reason a machine stacks fast small storage on top of slow large storage into a hierarchy.\n",{"path":6332,"title":6333,"module":6329,"summary":6334},"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality","Locality","A hierarchy only pays off because programs do not touch memory at random. They reuse recently-used data (temporal locality) and touch nearby data soon after (spatial locality). We make both precise and then quantitative: miss rates for stride-1 and stride-k traversals against a concrete block size, and the loop-order pair on a 2-D array where the same sum misses 16 times one way and 64 times the other — why row-major versus column-major order can change a program's speed by an order of magnitude.\n",{"path":6336,"title":6337,"module":6329,"summary":6338},"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped","Cache Memories and Direct Mapping","A cache is fast SRAM that holds copies of recently-used blocks of main memory. We fix its organization — S sets, E lines per set, B bytes per block — and the way it dissects an address into tag, set index, and block offset, worked bit by bit on a concrete 16-byte cache. Then we run the direct-mapped (E=1) access algorithm end to end on a seven-access trace: index to a set, compare the tag, hit or miss, evict. Cold and conflict misses fall out of the structure, and a two-array ping-pong shows conflict thrashing and its padding fix.\n",{"path":6340,"title":6341,"module":6329,"summary":6342},"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies","Set-Associative Caches and Write Policies","Give each set several lines and a block has a choice of homes — fewer conflict misses, at the cost of comparing E tags in parallel and choosing a victim to evict. We re-run the direct-mapped ping-pong trace on a 2-way cache and watch the conflicts vanish, weigh LRU against random replacement, then turn to writes: write-through versus write-back with a dirty bit on a hit, write-allocate versus no-write-allocate on a miss, and a worked traffic count showing when each pairing wins.\n",{"path":6344,"title":6345,"module":6329,"summary":6346},"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code","Cache Performance and Cache-Friendly Code","Turn the cache mechanism into a number. Hit time, miss rate, and miss penalty combine into the average memory access time; we compute AMAT for a two-level hierarchy with real numbers, weigh the design knobs against each other, and read the memory mountain. Then we write cache-friendly code — the matrix-multiply loop-order case study (ijk versus kij, misses counted per iteration) and loop blocking, where cache-sized tiles turn evicted reuse back into hits.\n",{"path":6348,"title":6349,"module":6350,"summary":6351},"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation","Address Spaces and Translation","Virtual Memory","Every process runs as if it owns a private, contiguous span of memory — its virtual address space — while the hardware maps those addresses onto a single shared physical memory. We fix virtual memory's three jobs (a cache for disk, a memory manager, a protection boundary), the page as the unit of mapping, and the MMU replacing the virtual page number while the offset passes through untouched — then run one translation end to end at the bit level and trace the control flow of a page hit against a page fault.\n",{"path":6353,"title":6354,"module":6350,"summary":6355},"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults","Page Tables and Page Faults","The page table is an array of page-table entries indexed by virtual page number; each entry's valid bit says whether the page is in DRAM, on disk, or unallocated, and its permission, reference, and dirty bits drive protection and replacement. We walk translation as a table lookup, the page fault and demand paging, the clock algorithm the OS uses to approximate LRU, memory mapping and copy-on-write (why fork is cheap), the taxonomy of bad references, and thrashing.\n",{"path":6357,"title":6358,"module":6350,"summary":6359},"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables","The TLB and Multi-Level Page Tables","A page-table read on every access would double memory traffic; a flat table for a 48-bit space would occupy 512 GB per process. The TLB fixes the first: a small set-associative cache of PTEs inside the MMU whose tag and index come from the VPN. Multi-level page tables fix the second, allocating only the sub-tables a process uses; x86-64 walks four levels with a 9+9+9+9+12 split. We trace one reference end to end through TLB, walk, and cache, and close with the overlap trick that lets the L1 cache start before translation ends.\n",{"path":6361,"title":6362,"module":6363,"summary":6364},"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow","Exceptional Control Flow","Exceptions & I\u002FO","Beyond the sequential, branch, and call flow a program controls itself, the hardware can divert the processor in response to events. We sort these into four classes — interrupts (asynchronous, from devices), traps (intentional syscalls), faults (recoverable, like a page fault), and aborts (unrecoverable) — then take the mechanism apart: exception numbers and the table dispatch, what the hardware pushes and why it differs from a procedure call, the divide-error \u002F page-fault \u002F general-protection trio on x86-64, the full syscall round trip with a worked write in assembly, and processes and signals as the abstractions ECF makes possible.\n",{"path":6366,"title":6367,"module":6363,"summary":6368},"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel","Interrupts and the Kernel","An I\u002FO device signals completion by raising an interrupt, crossing the privilege boundary from user mode into the kernel. We fix that boundary, follow an interrupt from device through the interrupt controller to its vectored handler, and use the timer interrupt to drive preemptive scheduling and the context switch. Then the I\u002FO mechanics: polling versus interrupt-driven I\u002FO with a cycle count, device registers and memory-mapped I\u002FO versus port I\u002FO, DMA's full transfer walkthrough and its cache hazard, and a disk read traced end to end, from the read syscall to the completion interrupt.\n",{"path":6370,"title":6371,"module":6372,"summary":6373},"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism","Processes, Threads, and Parallelism","Multithreading & Multicore","Around 2004 the single core stopped getting faster, and the industry's answer was to hand programmers more cores instead. This lesson builds the vocabulary that shift demands: process versus thread and exactly which hardware state each one owns, concurrency versus parallelism, the three kinds of parallelism a machine can exploit, why Dennard scaling ended and forced the multicore turn, and Amdahl's law — the arithmetic that bounds the speedup those cores can deliver.\n",{"path":6375,"title":6376,"module":6372,"summary":6377},"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading","Hardware Multithreading","A pipeline spends much of its life waiting — on cache misses, on dependences, on branches. Hardware multithreading fills the dead cycles with instructions from another thread. We compare coarse-grained switching (change threads on a long stall), fine-grained interleaving (change every cycle), and simultaneous multithreading (mix threads inside a single cycle), work out exactly which hardware a second thread context duplicates and which it shares, and weigh when SMT pays off and when two threads just fight over one cache.\n",{"path":6379,"title":6380,"module":6372,"summary":6381},"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence","Cache Coherence","Give each core its own cache and the same address can live in two places at once, with copies that disagree. We reproduce the stale-copy bug with a two-core trace, then fix it the way hardware does: snooping caches that watch a shared bus and keep every line in a protocol state. We build MSI in full, upgrade it to MESI, contrast invalidation with updating, add coherence misses as the fourth C, and end with false sharing: the performance bug where cores fight over a line while never touching the same byte.\n",{"path":6383,"title":6384,"module":6372,"summary":6385},"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization","Memory Consistency and Synchronization","Coherence keeps cores agreeing about one location; consistency is the contract about many. We define sequential consistency, then watch real hardware break it: the store buffer lets a load slip ahead of an older store, and the classic two-thread litmus test ends with both sides reading zero. We state x86-TSO precisely, restore order with mfence, build atomic read-modify-write from the lock prefix, xchg, and cmpxchg, and write a spinlock twice — once naively, once bus-friendly — closing with what lock-free progress actually guarantees.\n",{"path":6387,"title":6388,"module":6372,"summary":6389},"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization","Multicore Organization","Where everything sits on the die. A modern die gives each core private L1 and L2 caches, spreads a shared last-level cache across slices, and wires it all together with a ring or mesh; multi-socket servers add NUMA, where memory is local to one socket and every remote access pays a latency penalty. We walk the floorplan, put numbers on local versus remote latency, meet thread affinity, and account for the two shared resources — coherence traffic and LLC capacity — that decide how far a parallel program scales.\n",{"path":6391,"title":6392,"module":6393,"summary":6394},"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine","The Whole Machine","Capstone","We take one line of C down the whole tower the course built — compiler to assembly, assembly to machine-code bytes, the bytes into the fetch–decode–execute datapath — then trace one load and one add through the pipelined, cached, translated, interruptible machine, each step cross-linked to the lesson that built it. We close with the map of the course as a stack of layers and an accounting of what we simplified: out-of-order execution, superscalar issue, and speculation past the branch predictor.\n",{"path":6396,"title":6397,"module":6393,"summary":6398},"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu","Assembling a Complete CPU","We bolt the parts the course built — PC, instruction memory and its fetch logic, register file, ALU, condition codes, data memory, and the control unit — into one complete CPU, name the lesson that built each, wire them in a deliberate order, and power the machine on from reset. Then we assemble a real test program (sum a four-element array through a call\u002Fret procedure), give its exact bytes and memory layout, and trace it cycle by cycle to the answer 0xabcdabcdabcd. We close with how to validate such a machine, and what it takes to put two of them on one die.\n",{"path":6400,"title":6401,"module":6,"summary":6},"\u002Fcomputer-architecture","Computer Architecture",{"path":6403,"title":6404,"module":4995,"summary":6405},"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields","Models, Direction Fields, and Solution Curves","A differential equation relates an unknown function to its own rates of change. Three first-order models — a falling body, a cooling object, a population under predation — share the form dy\u002Fdt = ay - b; the slope field fixes their equilibria and long-run behavior before any formula is found. Solving the linear case gives the general solution, its integral curves, and the particular solution selected by an initial condition.\n",{"path":6407,"title":6408,"module":4995,"summary":6409},"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology","Classifying Equations: Order, Linearity, ODE vs. PDE","Every solution method targets a specific class of equation, so the first question about any differential equation is which classes it belongs to. Four independent axes sort them: ordinary versus partial, order, linear versus nonlinear, and homogeneous versus nonhomogeneous. Systems, verification of a solution by substitution, and the split between initial and boundary value problems complete the vocabulary.\n",{"path":6411,"title":6412,"module":6413,"summary":6414},"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors","Linear Equations and Integrating Factors","First-Order Equations","A first-order linear equation has the unknown and its derivative to the first power only. Multiplying by an integrating factor collapses the left side into a single derivative, and one integration gives the general solution in closed form. The solution exists wherever the coefficients are continuous, and for a constant coefficient it splits into a decaying transient and a steady state set by the forcing.\n",{"path":6416,"title":6417,"module":6413,"summary":6418},"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact","Separable and Exact Equations","Two nonlinear first-order classes solve by direct integration. A separable equation splits so that each variable can be integrated on its own side, giving an implicit relation. An exact equation is the total differential of a hidden potential function, recognized by a symmetry test on its coefficients; when the test fails, an integrating factor can sometimes restore exactness. A change of variable brings homogeneous equations into the separable class.\n",{"path":6420,"title":6421,"module":6413,"summary":6422},"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order","Modeling with First-Order Equations","A rate law is a differential equation. Each first-order model starts from one governing principle: conservation of mass for a mixing tank, proportional change for interest and radioactive decay, Newton's law of cooling, a force balance for a body falling against drag, and Kirchhoff's law for a series circuit. Setting the derivative to zero recovers the steady state, and the transient records how the initial condition relaxes toward it.\n",{"path":6424,"title":6425,"module":6413,"summary":6426},"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics","Autonomous Equations, Phase Lines, and Population Dynamics","An autonomous equation y' = f(y) can be analyzed qualitatively without being solved. Its constant solutions are the zeros of f, and the sign of f between them fixes whether nearby solutions rise or fall, which the phase line records as a column of arrows. The logistic and threshold models, constant- and effort-proportional harvesting, and the properties nonlinear equations lose all follow from this reading.\n",{"path":6428,"title":6429,"module":6413,"summary":6430},"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler","Existence, Uniqueness, and Euler's Method","Existence and uniqueness can be settled before any attempt to solve. The existence-uniqueness theorem gives sufficient conditions on f, and a standard example shows what fails when they do not hold. Picard's successive approximations build the solution as the limit of an iteration, and Euler's method turns the same tangent-line idea into a numerical procedure for the equations no formula reaches.\n",{"path":6432,"title":6433,"module":6413,"summary":6434},"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations","First-Order Difference Equations","A difference equation advances a sequence one index at a time by a rule y_{n+1} = f(y_n). The linear case y_{n+1} = rho*y_n + b solves in closed form and converges to its equilibrium exactly when the ratio has magnitude below one, which underlies compound-interest and loan calculations. The logistic difference equation shows the nonlinear counterpart: an exchange of stability, a cascade of period doublings, and the onset of chaos.\n",{"path":6436,"title":6437,"module":6438,"summary":6439},"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients","Homogeneous Equations, the Wronskian, and Real Roots","Second-Order Linear Equations","A second-order linear homogeneous equation with constant coefficients is solved by guessing an exponential and reducing to the quadratic characteristic equation. Two solutions span every solution exactly when their Wronskian is nonzero; that condition, superposition, and Abel's formula give the full structure of the general solution for the case of two distinct real roots.\n",{"path":6441,"title":6442,"module":6438,"summary":6443},"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots","Complex Roots, Repeated Roots, and Reduction of Order","When the characteristic equation has complex conjugate roots, Euler's formula converts the complex exponentials into a real fundamental set of decaying or growing oscillations. When it has a repeated root, one exponential is lost and reduction of order recovers the missing second solution as $t\\,e^{rt}$. The same substitution $y = v(t)y_1(t)$ finds a second solution from any known one.\n",{"path":6445,"title":6446,"module":6438,"summary":6447},"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients","Nonhomogeneous Equations: Undetermined Coefficients","The general solution of a nonhomogeneous linear equation is a complementary solution plus any one particular solution. When the forcing term is a polynomial, exponential, sine, or cosine, a particular solution can be found by assuming a trial form of the same shape with unknown coefficients and solving for them. The one complication is resonance, handled by multiplying the trial by a power of $t$.\n",{"path":6449,"title":6450,"module":6438,"summary":6451},"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters","Variation of Parameters","Variation of parameters finds a particular solution of any nonhomogeneous linear equation from a fundamental set of the homogeneous one. Replacing the constants in the complementary solution by functions and imposing one convenient constraint reduces the problem to a two-by-two linear system whose solution is expressed through the Wronskian, giving an integral formula that works for forcing terms undetermined coefficients cannot touch.\n",{"path":6453,"title":6454,"module":6438,"summary":6455},"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations","Mechanical and Electrical Vibrations","A spring-mass-damper obeys a second-order linear equation, and so does a series RLC circuit, with the same mathematics governing both. Free undamped motion is a pure sinusoid; damping adds a decaying envelope with three regimes; periodic forcing produces a transient that dies out and a steady-state oscillation whose amplitude peaks sharply near the natural frequency, the phenomenon of resonance.\n",{"path":6457,"title":6458,"module":6438,"summary":6459},"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear","Higher-Order Linear Equations","The second-order theory extends directly to order $n$: the solution space is $n$-dimensional, spanned by any $n$ solutions with nonzero Wronskian. For constant coefficients the characteristic polynomial has degree $n$, and its roots (counted with multiplicity, real and complex) build the basis by the same rules as before. Coupled oscillators are the natural application that raises the order.\n",{"path":6461,"title":6462,"module":6463,"summary":6464},"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points","Power Series Solutions Near Ordinary Points","Series Solutions and Special Functions","A linear equation with variable coefficients has no characteristic equation. A power series substituted into the equation matches coefficients to a recurrence relation, which near an ordinary point yields two independent analytic solutions. The radius of convergence is at least the distance from the expansion point to the nearest singular point in the complex plane.\n",{"path":6466,"title":6467,"module":6463,"summary":6468},"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius","Euler Equations, Regular Singular Points, and Frobenius","The Euler equation x^2 y'' + a x y' + b y = 0 is solved outright by y = x^r, and its three root cases fix the behavior at any regular singular point. The Frobenius method multiplies x^r by a power series; the indicial equation chooses the exponents, and equal or integer-separated roots force a logarithm in the second solution. Gauss's hypergeometric equation is the archetype containing most classical functions as special cases.\n",{"path":6470,"title":6471,"module":6463,"summary":6472},"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions","Bessel's Equation, Legendre Polynomials, and Special Functions","Bessel's equation puts the Frobenius machinery through all three of its cases and produces the functions J and Y that govern anything vibrating or diffusing with circular symmetry. The gamma function extends the factorial so that Bessel functions of every order make sense; Legendre's equation, run through the hypergeometric form, yields the polynomials that play the same role in spherical geometry. Orthogonality ties both families to the eigenfunction expansions of Sturm–Liouville theory.\n",{"path":6474,"title":6475,"module":6476,"summary":6477},"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps","The Laplace Transform: Definition, Properties, and Solving IVPs","The Laplace Transform","The Laplace transform sends a function of time to a function of a complex frequency by integrating it against the kernel e^{-st}. Differentiation in t becomes multiplication by s, so a linear constant-coefficient initial value problem turns into an algebraic equation. Existence rests on piecewise continuity and exponential order; the derivative rule folds in the initial data; and inversion runs through a transform table and partial fractions.\n",{"path":6479,"title":6480,"module":6476,"summary":6481},"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution","Step Functions, Discontinuous Forcing, Impulses, and Convolution","The Heaviside step function and the second shifting theorem transform switches and discontinuous forcing into exponential factors on the transform. The Dirac delta idealizes an instantaneous impulse and transforms to a pure exponential. The convolution theorem inverts a product of transforms, writes the forced response as the impulse response convolved with the input, and solves Abel's tautochrone by transform.\n",{"path":6483,"title":6484,"module":6485,"summary":6486},"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review","Matrices, Linear Systems, and the Eigenvalue Toolkit","Systems of First-Order Linear Equations","Any nth-order linear equation, and any coupled collection of them, rewrites as a single first-order system x' = P(t)x + g(t). The matrix and vector algebra behind that form, the eigenvalue problem det(A - λI) = 0 that drives every solution method, and the fundamental theory — superposition, the Wronskian, Abel's theorem — together establish that n independent solutions span all solutions.\n",{"path":6488,"title":6489,"module":6485,"summary":6490},"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits","Homogeneous Constant-Coefficient Systems and Phase Portraits","For x' = Ax with A constant, the trial x = ξe^{rt} turns the differential equation into the eigenvalue problem Aξ = rξ. The eigenvalues fix the geometry of the phase plane: real opposite signs give a saddle, real same sign a node, complex a spiral, purely imaginary a center. Worked in the plane, these cases form the eigenvalue-type classification of equilibria.\n",{"path":6492,"title":6493,"module":6485,"summary":6494},"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices","Repeated Eigenvalues, Fundamental Matrices, and Nonhomogeneous Systems","When a repeated eigenvalue supplies too few eigenvectors, a generalized eigenvector supplies the missing solution as ξte^{ρt} + ηe^{ρt}, giving an improper node. A fundamental set packaged as a matrix Φ(t) yields the matrix exponential e^{At}, the propagator mapping initial states to later ones. Variation of parameters solves the nonhomogeneous system x' = Ax + g(t).\n",{"path":6496,"title":6497,"module":6498,"summary":6499},"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta","Euler, Improved Euler, and Runge–Kutta","Numerical Methods","Most initial value problems have no closed-form solution, so the solution is approximated on a grid. Euler's method steps along the tangent line, the improved Euler method averages two slopes, and the classical Runge–Kutta method averages four. Each added stage raises the order of accuracy at the cost of more evaluations per step, measured by how the local and global truncation errors scale with the step size.\n",{"path":6501,"title":6502,"module":6498,"summary":6503},"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability","Multistep Methods, Systems, and Stability","One-step methods discard everything but the last point. Multistep methods fit a polynomial to several past values and integrate it forward: the explicit Adams–Bashforth formulas, the implicit and more accurate Adams–Moulton formulas, and predictor–corrector pairs that combine them. The same rules extend verbatim to systems in vector form. A separate concern is stability: round-off can dominate truncation, and stiff equations force a tiny step for stability even when accuracy would allow a large one.\n",{"path":6505,"title":6506,"module":6507,"summary":6508},"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability","The Phase Plane, Critical Points, and Stability","Nonlinear Systems and Stability","Most nonlinear systems cannot be solved in closed form, so they are studied geometrically. The phase plane turns an autonomous planar system into a family of trajectories; the five archetypes of critical point follow from the eigenvalues of the coefficient matrix; the trace-determinant plane reads off type and stability directly; and epsilon-delta definitions make stability, asymptotic stability, and instability precise.\n",{"path":6510,"title":6511,"module":6507,"summary":6512},"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov","Locally Linear Systems and Liapunov's Method","Near a critical point a nonlinear system looks linear, and the linear part is the Jacobian. The linearization fixes the type and stability of the nonlinear critical point in every case except a center or a repeated eigenvalue. Liapunov's direct method settles those cases and bounds the basin of attraction by constructing an energy-like function, without solving the system.\n",{"path":6514,"title":6515,"module":6507,"summary":6516},"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles","Population Models, Limit Cycles, and Chaos","The phase-plane methods apply directly to interacting-population models. Competing species either coexist or drive one another to extinction, decided by a single inequality among the interaction constants; the Lotka-Volterra predator-prey system produces closed population cycles. Limit cycles and the Poincaré-Bendixson theorem, the van der Pol oscillator, and the Lorenz equations with their strange attractor carry the theory into chaos.\n",{"path":6518,"title":6519,"module":6520,"summary":6521},"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series","Fourier Series and Convergence","PDEs, Fourier Series, and Boundary Value Problems","A two-point boundary value problem has nontrivial solutions only at a discrete set of eigenvalues, the same trichotomy that governs a singular linear system. For y'' + lambda y = 0 with zero endpoints the eigenfunctions are sines and cosines, and their orthogonality gives the Euler-Fourier coefficient formulas. The convergence theorem fixes when the series returns the function, the Gibbs phenomenon measures the overshoot at a jump, and even\u002Fodd symmetry produces half-range sine and cosine series.\n",{"path":6523,"title":6524,"module":6520,"summary":6525},"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations","Separation of Variables: Heat, Wave, and Laplace Equations","Separation of variables replaces a partial differential equation by a pair of ordinary ones joined through a shared separation constant. Applied to the heat equation it produces the eigenvalue problem X'' + lambda X = 0, and the solution assembles as a Fourier series in the eigenfunctions. The same steps solve the wave equation, whose modes are standing waves, and Laplace's equation, the steady-state limit posed on a region rather than an interval.\n",{"path":6527,"title":6528,"module":6520,"summary":6529},"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville","Sturm-Liouville Theory","The eigenvalue problem behind separation of variables generalizes to the self-adjoint Sturm-Liouville form. Lagrange's identity makes the operator symmetric, and from that one fact follow real eigenvalues, orthogonal eigenfunctions, and eigenfunction expansions that behave like Fourier series. Singular problems admit Bessel and Legendre functions, and Sturm's separation and comparison theorems describe how the eigenfunctions oscillate.\n",{"path":6531,"title":6532,"module":6533,"summary":6534},"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations","The Calculus of Variations","Historical Notes and the Calculus of Variations","Ordinary calculus finds the point where a function is stationary; the calculus of variations finds the whole curve where an integral is stationary. Euler's differential equation is the necessary condition for an extremal, and it becomes integrable in three cases, solving the shortest-path, minimal-surface, and brachistochrone problems. Lagrange multipliers extend the method to isoperimetric constraints, and Hamilton's principle recovers Newton's law from a single stationary integral.\n",{"path":6536,"title":6537,"module":6533,"summary":6538},"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes","Great Problems and the People Who Solved Them","Differential equations grew out of specific problems, not a plan: the invention of calculus by Newton and Leibniz, the Bernoulli brachistochrone challenge, Euler's flood of methods, Lagrange's analytical mechanics, Gauss and Riemann's rigor, Laplace's celestial mechanics, and Poincaré's qualitative theory. Each method descends from a named problem, and reading the subject forward from those problems explains why its parts fit together.\n",{"path":6540,"title":6541,"module":6,"summary":6},"\u002Fdifferential-equations","Differential Equations",{"path":6543,"title":6544,"module":6545,"summary":6546},"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates","The Postulates of Special Relativity","Foundations of Relativity","Newton's laws are the same in every inertial frame, but Maxwell's are not: the equations of electromagnetism single out one speed, c, and the nineteenth century read that as the speed of light relative to a medium, the ether. The Michelson-Morley experiment looked for Earth's motion through that medium and found nothing. Einstein's two postulates replace the ether, and their first consequence is that simultaneity is frame-dependent.\n",{"path":6548,"title":6549,"module":6545,"summary":6550},"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime","The Lorentz Transformation and Spacetime","Requiring that a light sphere stay a light sphere in every inertial frame fixes the coordinate change between frames uniquely: the Lorentz transformation, with its factor gamma. Differentiating it gives relativistic velocity addition, which caps composed speeds at c. Plotting the same events on skewed spacetime axes turns the algebra into geometry, with calibration hyperbolae, an invariant interval, and a light cone that sorts events into past, future, and elsewhere.\n",{"path":6552,"title":6553,"module":6545,"summary":6554},"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction","Time Dilation, Length Contraction, and Paradoxes","A light clock and the constancy of c give the two headline effects directly: a moving clock runs slow by gamma, and a moving rod is short by the same factor. Cosmic-ray muons reaching sea level are the standing experimental proof. The relativistic Doppler effect adds the time-dilation factor to the classical shift, and the twin and pole-barn paradoxes dissolve once the relativity of simultaneity is taken seriously.\n",{"path":6556,"title":6557,"module":6545,"summary":6558},"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy","Relativistic Momentum and Energy","Conserving momentum in every inertial frame forces the redefinition p = gamma m u, which diverges as the speed approaches c. Integrating the corresponding force gives the total energy E = gamma m c-squared, whose rest term m c-squared is Einstein's mass-energy equivalence. Energy and momentum join into a four-vector whose invariant length is the rest energy, giving E-squared = (pc)-squared + (m c-squared)-squared, massless particles, and nuclear binding energy.\n",{"path":6560,"title":6561,"module":6545,"summary":6562},"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity","A Taste of General Relativity","Einstein's happiest thought was that a freely falling observer feels no gravity: a uniform gravitational field is locally indistinguishable from an accelerating frame. That equivalence principle predicts that light bends near a mass, that clocks run slow deep in a gravitational well, that Mercury's orbit precesses, and that radar echoes are delayed. Every prediction has been confirmed, and pushing the redshift to its limit gives the black hole.\n",{"path":6564,"title":6565,"module":6566,"summary":6567},"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval","Minkowski Spacetime and the Interval","Spacetime and the Lorentz Group","The Lorentz transformation of the foundations module is repackaged as the geometry of a four-dimensional space whose invariant is not a distance but the spacetime interval. Events, worldlines, and the metric signature define a causal structure that every observer shares. Proper time is the length of a timelike worldline, and the twin paradox becomes the statement that a straight worldline accumulates the most proper time.\n",{"path":6569,"title":6570,"module":6566,"summary":6571},"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation","Four-Vectors and Index Notation","The index calculus that the rest of the course runs on. Contravariant and covariant components, the Minkowski metric as the machine that raises and lowers indices, and the Einstein summation convention are assembled into scalar products that are the same in every frame. The four-velocity and four-acceleration follow, together with the identity that the four-velocity has constant invariant length.\n",{"path":6573,"title":6574,"module":6566,"summary":6575},"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity","The Lorentz Group and Rapidity","The Lorentz transformations are the linear maps that preserve the Minkowski metric, and they form the group O(1,3). Boosts are hyperbolic rotations parametrized by rapidity, which adds along a line where velocity does not. The boost and rotation generators fix the group's local structure; its four disconnected components are set by two signs; and two non-collinear boosts compose into a boost plus a rotation, the Wigner rotation behind Thomas precession.\n",{"path":6577,"title":6578,"module":6566,"summary":6579},"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance","Doppler, Aberration, and Appearance","Light carries a null four-momentum, and boosting it produces every optical effect of relativity at once. The covariant Doppler formula follows from the transformation of frequency, aberration from the transformation of direction, and the headlight effect from the resulting concentration of light forward. The Terrell-Penrose result shows that a fast object photographs as rotated, not contracted.\n",{"path":6581,"title":6582,"module":6583,"summary":6584},"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion","Four-Momentum, Four-Force, and Accelerated Motion","Relativistic Dynamics","The four-momentum packages energy and momentum into a single vector whose invariant length is the rest mass. Its proper-time derivative is the four-force, always orthogonal to the four-velocity, and a constant orthogonal four-force produces hyperbolic motion. Constant proper acceleration gives rapidity linear in proper time, the relativistic rocket equation, and the Rindler horizon behind an eternally accelerating observer.\n",{"path":6586,"title":6587,"module":6583,"summary":6588},"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics","Particle Decays and Two-Body Kinematics","Conservation of four-momentum fixes the kinematics of a decay from the masses alone. In the center-of-momentum frame a parent breaks into two daughters with equal and opposite momenta and energies set by the Kallen triangle function. Boosting to the lab opens the decay into a cone, and the invariant mass built from the daughters reconstructs the parent as a peak. Worked cases: the two-photon decay of the neutral pion and a heavy two-body hadronic decay.\n",{"path":6590,"title":6591,"module":6583,"summary":6592},"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame","Relativistic Collisions and Threshold Energies","Two-body collisions run on the same conserved four-momentum as decays. The invariant s sets the total energy available in the center-of-momentum frame and therefore the threshold for producing new particles. Fixed-target energy grows only as the square root of beam energy while a collider grows linearly, which is why colliders reach high energy. Compton scattering follows as a worked photon-electron collision giving the wavelength shift.\n",{"path":6594,"title":6595,"module":6583,"summary":6596},"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants","Mandelstam Variables and Lorentz Invariants","For a two-to-two process the three Mandelstam invariants s, t, and u encode all the kinematics in frame-independent form. They obey a single linear constraint, the sum of the four squared masses, so only two are independent. s is the center-of-momentum energy squared, t and u are momentum transfers tied to the scattering angle, and crossing symmetry relates one amplitude across three channels through these variables.\n",{"path":6598,"title":6599,"module":6600,"summary":6601},"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential","The Four-Current and Four-Potential","Covariant Electromagnetism","Charge density and current combine into a single four-vector whose divergence is charge conservation. The scalar and vector potentials combine likewise into the four-potential, whose gauge freedom fixes to the Lorenz condition, reducing Maxwell's equations for the potentials to a single wave equation sourced by the four-current.\n",{"path":6603,"title":6604,"module":6600,"summary":6605},"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor","The Electromagnetic Field Tensor","The antisymmetric derivative of the four-potential is the field-strength tensor F, gauge invariant by construction, with the electric and magnetic fields as its components. Its dual exchanges E and B, and its two contractions form the Lorentz invariants that classify a field as electric, magnetic, or radiative in every frame.\n",{"path":6607,"title":6608,"module":6600,"summary":6609},"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields","How E and B Transform","Transforming the field tensor under a boost gives explicit rules for the electric and magnetic fields: components along the motion are unchanged, transverse components mix and pick up a gamma. The field of a uniformly moving charge compresses transversely, and the force between a current and a moving charge shows that magnetism is the relativistic shadow of electrostatics.\n",{"path":6611,"title":6612,"module":6600,"summary":6613},"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor","Covariant Maxwell and the Stress–Energy Tensor","Maxwell's four equations collapse into two tensor equations, one sourced by the four-current and one an identity on the field strength, with charge conservation automatic. The Lorentz force becomes a four-vector law, and the field's energy, momentum, and stress assemble into a symmetric, conserved stress–energy tensor — the object that will source gravity.\n",{"path":6615,"title":6616,"module":6617,"summary":6618},"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized","The Equivalence Principle","Curved Spacetime","The equality of gravitational and inertial mass promotes to a physical principle in three graded strengths — weak, Einstein, and strong. A freely falling laboratory is locally indistinguishable from an inertial frame, but the qualifier \"locally\" is essential: the size of the patch over which gravity vanishes is set by the tidal field, which no change of frame can remove. Tidal forces are the true, coordinate-independent signature of gravity, and they are what curvature will measure.\n",{"path":6620,"title":6621,"module":6617,"summary":6622},"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric","Manifolds, Vectors, and the Metric","A manifold is a space that looks locally like flat space, described by overlapping coordinate charts. Tangent vectors are directional derivatives with the coordinate basis vectors as partial-derivative operators; one-forms live in the dual space; and the metric tensor turns a coordinate line element into an invariant length. The 2-sphere and Rindler metrics serve as worked examples, including the coordinate singularities that are artefacts of the chart, not of the geometry.\n",{"path":6624,"title":6625,"module":6617,"summary":6626},"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols","Parallel Transport and the Covariant Derivative","The ordinary derivative of a vector field is not a tensor, because it subtracts vectors living in different tangent spaces. A connection supplies the missing comparison: the covariant derivative adds Christoffel-symbol correction terms that cancel the coordinate artefacts. Requiring the connection to be torsion-free and to preserve the metric fixes the Christoffel symbols uniquely in terms of derivatives of the metric, giving the Levi-Civita connection that general relativity uses.\n",{"path":6628,"title":6629,"module":6617,"summary":6630},"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation","Geodesics and the Newtonian Limit","Free fall is geodesic motion: a freely falling particle follows the straightest possible worldline, obtained either by parallel-transporting its own tangent vector or by extremizing proper time. Both routes give the geodesic equation. Affine parameters, and conserved quantities from symmetries via Killing vectors, make it solvable. In the weak-field slow-motion limit the geodesic equation reproduces Newton's law of gravity, fixing the time-time metric component as the Newtonian potential.\n",{"path":6632,"title":6633,"module":6617,"summary":6634},"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation","Curvature and the Riemann Tensor","Curvature is the failure of parallel transport to commute: carrying a vector around an infinitesimal loop returns it rotated, and the rotation per unit area is the Riemann tensor. Its symmetries cut the components to twenty in four dimensions. Geodesic deviation makes it the equation of tidal forces, and its contractions — the Ricci tensor, the Ricci scalar, and the divergence-free Einstein tensor — assemble the objects the field equation is built from.\n",{"path":6636,"title":6637,"module":6617,"summary":6638},"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations","The Einstein Field Equations","The field equation is assembled from a short list of requirements: a symmetric, divergence-free, second-order geometric tensor set proportional to the stress–energy tensor, with the coefficient fixed by the Newtonian limit. The cosmological constant is the one extra term the requirements allow. The Einstein–Hilbert action gives the same equation from a variational principle, and the coupled system closes the logic of the module: matter curves spacetime, and spacetime tells matter how to move.\n",{"path":6640,"title":6641,"module":6642,"summary":6643},"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric","The Schwarzschild Metric","The Schwarzschild Solution","The first exact solution of Einstein's equation follows from two assumptions, staticity and spherical symmetry, imposed on the vacuum outside a mass. Solving the vacuum field equations fixes two metric functions and produces the Schwarzschild geometry, whose one length scale is the Schwarzschild radius $r_s = 2GM\u002Fc^2$. Birkhoff's theorem shows this is the only spherical vacuum, and the far field reduces to Newtonian gravity.\n",{"path":6645,"title":6646,"module":6642,"summary":6647},"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild","Orbits in the Schwarzschild Geometry","The two Killing symmetries of the Schwarzschild metric give a conserved energy and angular momentum per unit mass, reducing geodesic motion to a one-dimensional problem in an effective potential. The potential carries an extra attractive $1\u002Fr^3$ term absent from Newton's, which caps the centrifugal barrier, produces an innermost stable circular orbit at $6GM\u002Fc^2$, and makes bound orbits precess instead of closing.\n",{"path":6649,"title":6650,"module":6642,"summary":6651},"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics","Null Geodesics and the Photon Sphere","Light follows null geodesics, governed by a photon effective potential with a single unstable maximum at $3GM\u002Fc^2$, the photon sphere. The impact parameter sorts rays into those that escape with a deflection and those captured, with the critical value $b_c = 3\\sqrt{3}\\,GM\u002Fc^2$ dividing them. A grazing ray bends by $4GM\u002F(c^2 b)$, twice the naive Newtonian value, and the critical impact parameter sets the edge of a black hole's shadow.\n",{"path":6653,"title":6654,"module":6655,"summary":6656},"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury","The Perihelion Precession of Mercury","Tests of General Relativity","A single extra term in the Schwarzschild orbit equation, cubic in the inverse radius, keeps a bound orbit from closing. The perturbation advances the perihelion by 6πGM\u002F(c²a(1−e²)) per revolution, which for Mercury is 43 arcseconds per century — exactly the anomaly left after Newtonian planetary perturbations are subtracted. A note on frame dragging closes the lesson.\n",{"path":6658,"title":6659,"module":6655,"summary":6660},"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing","Light Deflection and Gravitational Lensing","A light ray grazing the Sun bends by 4GM\u002F(c²b), exactly twice the value a Newtonian corpuscle would give; the extra factor is the curvature of space. The 1919 eclipse confirmed it. The same bending focuses light from distant sources into Einstein rings, multiple images, and microlensing brightenings, making lensing a direct probe of mass, including mass that emits no light.\n",{"path":6662,"title":6663,"module":6655,"summary":6664},"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay","Gravitational Redshift and the Shapiro Delay","A clock deeper in a gravitational well ticks slower, and a photon climbing out loses frequency by the ratio of the metric's time-time components. Pound and Rebka measured the 2.5×10⁻¹⁵ shift over a 22.5-metre tower. Radar signals grazing the Sun return late by about 250 microseconds, the Shapiro delay. Both probe the time part of the metric directly.\n",{"path":6666,"title":6667,"module":6655,"summary":6668},"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps","Relativity and the Global Positioning System","A GPS satellite clock runs slow by 7 microseconds a day from its orbital speed and fast by 46 from its higher gravitational potential, a net gain of about 38 microseconds a day. Left uncorrected, the timing error would grow into kilometres of position error within a day and exceed navigation tolerance within minutes. The satellites carry a pre-launch frequency offset to cancel it.\n",{"path":6670,"title":6671,"module":6672,"summary":6673},"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities","Horizons and Coordinate Singularities","Black Holes","The Schwarzschild radius is a coordinate singularity, not a curvature singularity: the metric blows up there only because the static coordinates fail, while the geometry stays finite. Eddington–Finkelstein and Kruskal– Szekeres coordinates cross the horizon smoothly and show the light cones tipping toward the center. A freely falling observer reaches the true singularity at r=0 in finite proper time, while a distant observer sees the infall freeze and redden at the horizon.\n",{"path":6675,"title":6676,"module":6672,"summary":6677},"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes","Rotating and Charged Black Holes","A stationary black hole is fixed by three numbers: mass, angular momentum, and charge. The Reissner–Nordström metric adds charge and splits the horizon in two; the Kerr metric adds rotation, drags inertial frames, and wraps the horizon in an ergosphere where nothing can stay still. Inside the ergosphere the Penrose process extracts rotational energy, and the no-hair theorem states that no other detail of the collapsed matter survives.\n",{"path":6679,"title":6680,"module":6672,"summary":6681},"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics","Black-Hole Thermodynamics","The four laws of black-hole mechanics mirror the four laws of thermodynamics term for term, with horizon area playing the role of entropy and surface gravity the role of temperature. Hawking's calculation makes the analogy literal: a black hole radiates at a temperature set by its surface gravity, carries a real entropy proportional to its horizon area, and slowly evaporates. The thermal spectrum raises the information paradox.\n",{"path":6683,"title":6684,"module":6685,"summary":6686},"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions","Linearized Gravity and Wave Solutions","Gravitational Waves","Weak gravity is a small perturbation of flat spacetime, and the linearized Einstein equation in the Lorenz gauge is an ordinary wave equation propagating at the speed of light. The trace-reversed perturbation carries the dynamics, residual gauge freedom fixes the transverse-traceless form, and the two physical polarizations deform a ring of freely falling masses into oscillating ellipses whose fractional size change is the strain.\n",{"path":6688,"title":6689,"module":6685,"summary":6690},"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula","The Quadrupole Formula","The retarded solution of the linearized field equation gives the field of a moving source, and conservation of mass and momentum forbids monopole and dipole radiation, leaving the mass quadrupole as the leading emitter. The quadrupole formula fixes the strain and the radiated luminosity, and applied to a compact binary it predicts the inspiral chirp of rising frequency and amplitude. The Hulse-Taylor pulsar's orbital decay confirmed it to a fraction of a percent.\n",{"path":6692,"title":6693,"module":6685,"summary":6694},"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events","LIGO and the First Detections","A gravitational wave is measured as a differential length change of the two arms of a kilometre-scale Michelson interferometer, a strain of order ten to the minus twenty-one that moves the mirrors by a fraction of a proton radius. GW150914 recorded the inspiral, merger, and ringdown of two black holes, fixing their masses and the energy radiated, and GW170817 with its coincident gamma-ray burst and kilonova opened multimessenger astronomy.\n",{"path":6696,"title":6697,"module":6698,"summary":6699},"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric","The Cosmological Principle and the FLRW Metric","A Bridge to Cosmology","Homogeneity and isotropy restrict the spacetime of the universe to a single family of metrics: a flat cosmic-time slicing of spatial sections of constant curvature, scaled by a time-dependent factor a(t). This lesson builds the Friedmann–Lemaître–Robertson–Walker metric from those symmetries, separates comoving from proper distance, and derives cosmological redshift as the stretching of wavelengths with the scale factor.\n",{"path":6701,"title":6702,"module":6698,"summary":6703},"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics","The Friedmann Equations and Cosmic Dynamics","The Einstein equation applied to the FLRW metric with a perfect-fluid source yields the two Friedmann equations and the conservation law that ties them together. This lesson derives them, defines the critical density and the density parameters that fix the spatial geometry, works out how matter, radiation, and a cosmological constant dilute and drive the expansion, and hands off to a dedicated cosmology subject.\n",{"path":6705,"title":6706,"module":6,"summary":6},"\u002Frelativity","Relativity",{"path":6708,"title":6709,"module":6,"summary":6},"\u002Fphysical-computing","Physical Computing",{"path":6711,"title":6712,"module":6713,"summary":6714},"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum","Blackbody Radiation and the Planck Quantum","Origins of the Quantum","Millikan's oil-drop experiment fixed the electron charge as an indivisible unit, and the spectrum of thermal radiation forced a second, deeper quantum. Classical physics predicts an infinite energy density at short wavelengths; Planck removed the divergence by allowing a cavity oscillator to hold only energies that are integer multiples of hf, the first appearance of the quantum of action.\n",{"path":6716,"title":6717,"module":6713,"summary":6718},"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon","The Photoelectric Effect and the Photon","Light shone on a clean metal ejects electrons, but the details defied the wave theory: the electrons' maximum energy depends on the light's frequency, not its brightness, and there is a sharp threshold frequency below which nothing happens. Einstein resolved every anomaly by treating light as a stream of energy quanta hf, each absorbed whole by one electron, and Millikan's measurement of the stopping-potential slope confirmed h to a decade before anyone expected.\n",{"path":6720,"title":6721,"module":6713,"summary":6722},"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect","X-Rays and the Compton Effect","X-rays are short-wavelength electromagnetic waves produced when fast electrons are braked in a target, and their diffraction by crystals lets Bragg's law measure atomic spacings. Compton then scattered X-rays off electrons and found the wavelength shifted by an amount that only a photon carrying momentum hf\u002Fc could explain, closing the case for the particle nature of light.\n",{"path":6724,"title":6725,"module":6713,"summary":6726},"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld","The Old Quantum Theory: Bohr, Sommerfeld, and Correspondence","Between Bohr's 1913 atom and Schrödinger's 1926 equation, physics ran on a provisional recipe: keep classical orbits, but admit only those whose action integral is a whole multiple of Planck's constant. This lesson develops the Wilson-Sommerfeld phase-integral rule, applies it to the oscillator and to the elliptical Kepler orbits of hydrogen, derives Sommerfeld's relativistic fine structure and the quantization of orbit orientation, and shows how the correspondence principle fixed intensities and selection rules. The systematic failures — helium, line intensities, the anomalous Zeeman effect — mark exactly where a theory of orbits had to give way to a theory of waves.\n",{"path":6728,"title":6729,"module":6730,"summary":6731},"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction","De Broglie Waves and Electron Diffraction","The Wave Nature of Matter","In 1924 de Broglie proposed that every particle carries a wave of wavelength h\u002Fp. The hypothesis explains Bohr's quantized orbits as standing waves, and Davisson and Germer, then G. P. Thomson, confirmed it by diffracting electrons from crystals exactly as X-rays diffract. We derive the electron wavelength, work the Bragg analysis of the data, and give the relativistic form.\n",{"path":6733,"title":6734,"module":6730,"summary":6735},"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation","Wave Packets and the Probabilistic Wave Function","A single de Broglie wave fills all space, but a particle is localized. Adding many waves of nearby wavelength builds a wave packet that is confined and moves at the group velocity, which equals the particle velocity. Born's rule reads the squared amplitude of the wave function as a probability density, the meaning confirmed by electron interference building up one detection at a time.\n",{"path":6737,"title":6738,"module":6730,"summary":6739},"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle","The Uncertainty Principle and Wave-Particle Duality","The packet relations delta-k delta-x about 1 become Heisenberg's principle once momentum is hbar times wave number: position and momentum cannot both be sharp, nor energy and time. The gamma-ray microscope shows the limit is physical, not technical. It fixes the zero-point energy of a confined particle, the size of the hydrogen atom, and the natural width of spectral lines, and it frames the wave-particle duality of all matter and radiation.\n",{"path":6741,"title":6742,"module":6743,"summary":6744},"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension","The Schrödinger Equation in One Dimension","Wave Mechanics in One Dimension","The wave equation for matter cannot be derived; it is postulated and judged by experiment. We build the time-dependent Schrödinger equation from the de Broglie relations, read Born's probability rule off the complex wave function, and separate the time and space dependence to get the time-independent equation whose bound-state solutions are the stationary states. The five acceptability conditions on the wave function are what force energy to be quantized.\n",{"path":6746,"title":6747,"module":6743,"summary":6748},"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics","The Free Particle and Wave-Packet Dynamics","The free particle has no bound states: its stationary solutions are non-normalizable plane waves forming a continuum. Physical states are wave packets built by superposing them, and the superposition is a Fourier transform. We delta-normalize the plane waves, assemble a Gaussian packet, solve for its exact time evolution, and read off the two facts that reconcile the wave picture with mechanics: the packet moves at the group velocity ħk\u002Fm, the classical velocity, and it spreads because its component momenta travel at different speeds.\n",{"path":6750,"title":6751,"module":6743,"summary":6752},"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells","Particle in Infinite and Finite Square Wells","The infinite square well is the simplest bound-state problem: two boundary conditions quantize the energy into a ladder E_n = n² E_1, and the eigenfunctions are the standing waves of a string fixed at both ends. Relaxing the walls to a finite depth lets the wave function leak into the classically forbidden region, keeps the number of bound states finite, and turns the eigenvalue condition into a transcendental equation solved graphically.\n",{"path":6754,"title":6755,"module":6743,"summary":6756},"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator","Operators, Expectation Values, and the Harmonic Oscillator","Measurable quantities are extracted from the wave function as expectation values, and each observable is represented by an operator that acts between Ψ* and Ψ — position by multiplication, momentum by a derivative, energy by the Hamiltonian. Applied to the harmonic oscillator, the machinery yields evenly spaced levels E_n = (n+½)ℏω, Gaussian- times-Hermite eigenfunctions of definite parity, and the selection rule Δn = ±1.\n",{"path":6758,"title":6759,"module":6743,"summary":6760},"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential","The Dirac-Delta Potential: A Single Bound State and Scattering","A potential concentrated at a single point is solvable in closed form and isolates the physics of matching a wave function across a discontinuity. Integrating the Schrödinger equation across the spike gives a jump condition on the derivative; the attractive delta well then supports exactly one bound state, of energy set by the strength alone, while the same spike scatters an incoming beam with a transmission that rises from zero to one. The attractive well and the repulsive barrier scatter identically yet only the well binds.\n",{"path":6762,"title":6763,"module":6743,"summary":6764},"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling","Barrier Penetration and Quantum Tunneling","Unbound states scatter rather than bind. A particle meeting a step is partly reflected even when it has more than enough energy to pass, and a particle meeting a barrier taller than its energy has a nonzero chance of appearing on the far side. Matching the wave function across the boundaries gives the reflection and transmission coefficients and the exponential tunneling probability that explains alpha decay, the scanning tunneling microscope, and the ammonia clock.\n",{"path":6766,"title":6767,"module":6768,"summary":6769},"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation","Hilbert Space and Dirac Bra–Ket Notation","The Formalism of Quantum Mechanics","Wave mechanics is one representation of a deeper structure: quantum states are vectors in a complex inner-product space, and observables act on them as linear operators. We build that space from the axioms, introduce Dirac's kets and bras as vectors and the linear functionals that measure them, and identify the wavefunction as the components of an abstract state in the position basis. The resolution of the identity is the single algebraic tool that ties every basis, expansion, and matrix element together.\n",{"path":6771,"title":6772,"module":6768,"summary":6773},"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues","Observables, Hermitian Operators, and the Spectral Theorem","Every measurable quantity is represented by a Hermitian operator, and the reason is forced: a measurement needs real eigenvalues, orthogonal eigenvectors, and a complete eigenbasis, and Hermiticity delivers precisely those. We derive those properties from self-adjointness, state the spectral theorem, handle degeneracy, and show that two observables share an eigenbasis precisely when they commute — the algebraic condition behind compatible and incompatible measurements.\n",{"path":6775,"title":6776,"module":6768,"summary":6777},"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement","The Postulates and Quantum Measurement","With states as vectors and observables as Hermitian operators, the physical content of quantum mechanics reduces to a short list of postulates. We state them precisely, derive the Born probability rule for discrete and continuous spectra, work out projective collapse and its idempotence, compute expectation values and their variance, and state the measurement problem cleanly — the one place the postulates split unitary evolution from measurement without explaining the seam.\n",{"path":6779,"title":6780,"module":6768,"summary":6781},"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra","Position, Momentum, and Continuous Spectra","Position and momentum are the observables with no normalizable eigenstates: their spectra are continuous, their eigenkets are delta-normalized, and the two are Fourier conjugates. We derive the canonical commutator from the momentum operator, build the continuous-basis machinery (Dirac deltas replacing Kronecker deltas), show the position and momentum wavefunctions are a Fourier-transform pair, and compute expectation values in either representation.\n",{"path":6783,"title":6784,"module":6768,"summary":6785},"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle","Commutators and the Generalized Uncertainty Principle","The commutator of two observables measures the obstruction to sharing an eigenbasis, and it bounds how sharply both can be known at once. We derive the generalized uncertainty relation from the Schwarz inequality, recover the position–momentum bound as a special case, characterize the minimum-uncertainty states that saturate it as Gaussians, and give the energy–time relation its correct reading as a lifetime bound rather than a commutator relation.\n",{"path":6787,"title":6788,"module":6768,"summary":6789},"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures","Time Evolution, Propagators, and the Heisenberg Picture","Time evolution is generated by the Hamiltonian and implemented by a unitary operator that preserves probability. We build that operator, expand a state in stationary states to see why probability densities freeze while phases wind, introduce the propagator, transfer the time dependence onto operators in the Heisenberg picture, and derive Ehrenfest's theorem — which recovers classical equations of motion for expectation values and identifies conserved quantities as observables commuting with the Hamiltonian.\n",{"path":6791,"title":6792,"module":6793,"summary":6794},"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states","Ladder Operators and the Number States","The Oscillator Algebraically, and Symmetry","The harmonic oscillator can be solved without touching a differential equation. Factoring the Hamiltonian into a lowering operator and its adjoint turns the spectrum into pure algebra: the commutator relation fixes the ladder, the vacuum condition fixes the ground state, and the energies fall out as equally spaced rungs. The same operators give the matrix elements of position and momentum for free.\n",{"path":6796,"title":6797,"module":6793,"summary":6798},"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states","Coherent and Squeezed States","A single number state never moves — its position expectation is pinned at the origin. The superposition that oscillates like a classical particle is the eigenstate of the annihilation operator: the coherent state. It is a displaced vacuum, carries Poissonian photon statistics, saturates the uncertainty bound, and traces a rigid Gaussian orbit in phase space. Squeezing deforms that circle, trading precision in one quadrature for noise in the other.\n",{"path":6800,"title":6801,"module":6793,"summary":6802},"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws","Symmetries, Generators, and Conservation Laws","Every continuous symmetry of a quantum system is a unitary operator built by exponentiating a Hermitian generator: momentum generates translations, angular momentum generates rotations, the Hamiltonian generates time evolution. When a generator commutes with the Hamiltonian, the transformation leaves the dynamics unchanged and the generator is conserved — the quantum form of Noether's theorem — and any symmetry that mixes states within a level forces degeneracy.\n",{"path":6804,"title":6805,"module":6793,"summary":6806},"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries","Parity, Time Reversal, and Discrete Symmetries","Parity and time reversal are symmetries no continuous generator can reach. Parity is a unitary involution whose eigenvalues label states even or odd, fixing the dipole selection rules. Time reversal is antiunitary: it conjugates i, flips momenta and spins, and for half-integer spin squares to minus one, which by Kramers' theorem makes every level of a time-reversal-invariant Hamiltonian at least doubly degenerate.\n",{"path":6808,"title":6809,"module":5648,"summary":6810},"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics","Orbital Angular Momentum and Spherical Harmonics","Orbital angular momentum is the operator triple built from position and momentum. Its components fail to commute, so no state carries sharp values of more than one of them, but each commutes with the total square. Solving the common eigenvalue problem in spherical coordinates quantizes both the magnitude and the projection and produces the spherical harmonics, the angular part of every central-force wavefunction.\n",{"path":6812,"title":6813,"module":5648,"summary":6814},"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra","The Angular-Momentum Algebra and Ladder Operators","The eigenvalues of angular momentum follow from the commutation relations alone, with no reference to coordinates or wavefunctions. Raising and lowering operators built from the components generate finite multiplets, force the total quantum number to be a non-negative integer or half-integer, and fix the matrix elements of every component. The half-integer values excluded by orbital motion appear here, and they are what spin realizes.\n",{"path":6816,"title":6817,"module":5648,"summary":6818},"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan","Addition of Angular Momenta and Clebsch–Gordan Coefficients","Two angular momenta combine into a total whose allowed magnitudes run from the difference to the sum of the parts in integer steps. The change from the uncoupled product basis to the coupled total-angular-momentum basis is carried out with the lowering operator and orthogonality, and its matrix of overlaps is the table of Clebsch–Gordan coefficients. Two spin-halves split into a triplet and a singlet, the prototype for every composite spin.\n",{"path":6820,"title":6821,"module":6822,"summary":6823},"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions","The Schrödinger Equation in Three Dimensions","Central Potentials","A central potential depends only on the distance from a force center, so the three-dimensional Schrödinger equation separates in spherical coordinates. The angular factor is a spherical harmonic; the radial factor obeys a one-dimensional equation with an effective potential whose centrifugal barrier depends on the angular-momentum quantum number. The free particle and the spherical box fix the two limiting cases through the spherical Bessel functions.\n",{"path":6825,"title":6826,"module":6822,"summary":6827},"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom","The Hydrogen Atom","The Coulomb potential turns the radial equation into one whose bound states exist only for a discrete set of energies. A power-series solution truncated to keep the wavefunction normalizable forces the principal quantum number, and the energy comes out proportional to minus one over its square, recovering the Rydberg spectrum. The bound states are the associated Laguerre functions times spherical harmonics, and their energy depends on the principal number alone, giving an n-squared degeneracy larger than rotational symmetry can explain.\n",{"path":6829,"title":6830,"module":6822,"summary":6831},"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry","The Isotropic Oscillator and Hidden Symmetry","The three-dimensional isotropic harmonic oscillator solves in both Cartesian and spherical bases, and the two solutions must agree on the degeneracy of every level. That agreement, and the accidental degeneracy of hydrogen, both come from a symmetry larger than rotation: the oscillator carries an SU(3) invariance built from a conserved quadrupole tensor, and the Coulomb problem carries an SO(4) invariance built from the conserved Runge–Lenz vector. These hidden symmetries pin the degeneracies that rotational invariance alone leaves unexplained.\n",{"path":6833,"title":6834,"module":6835,"summary":6836},"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach","Spin-½, the Pauli Matrices, and Stern–Gerlach","Spin","A silver atom passing through an inhomogeneous magnetic field splits into two beams, not a smear. That single fact fixes the internal angular momentum of the electron to a two-valued quantity with no spatial wavefunction. We build the two-dimensional spin space, the Pauli matrices and their algebra, the spinor for measurement along an arbitrary axis, and the sequential Stern–Gerlach filters that expose measurement disturbance.\n",{"path":6838,"title":6839,"module":6835,"summary":6840},"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance","Spin in a Magnetic Field: Precession and Resonance","A spin coupled to a magnetic field is the simplest nontrivial quantum dynamics. A static field makes the spin expectation precess on a cone at the Larmor frequency while the energy levels split linearly. Adding a weak oscillating field and passing to the rotating frame produces Rabi oscillations and a resonance lineshape — the physics of NMR and ESR, and the driven qubit.\n",{"path":6842,"title":6843,"module":6835,"summary":6844},"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere","Two-Level Systems and the Bloch Sphere","Every two-state quantum system is a spin-½ in disguise. Its Hamiltonian is an effective magnetic field, its pure states are points on the Bloch sphere, and its unitary evolution is a rigid rotation of that sphere. The same structure produces avoided level crossings, the ammonia inversion doublet and its maser, and the qubit.\n",{"path":6846,"title":6847,"module":6848,"summary":6849},"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry","Identical Particles and Exchange Symmetry","Identical Particles","Two electrons carry no label that distinguishes one from the other, and that bare fact reshapes the state space. The exchange operator that swaps particle labels commutes with any Hamiltonian built from identical particles, so its eigenvalue is conserved, and nature admits only its two extremes: totally symmetric states for bosons and totally antisymmetric states for fermions. The antisymmetry forces a statistical correlation, the exchange \"force,\" that keeps fermions apart and draws bosons together even with no interaction between them.\n",{"path":6851,"title":6852,"module":6848,"summary":6853},"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table","The Pauli Principle, Atoms, and the Periodic Table","Antisymmetry packaged as a Slater determinant turns the exclusion principle into an operating rule for building atoms. Helium shows the machinery in full: the electron-electron repulsion splits into a direct Coulomb integral and an exchange integral, and the exchange term alone pushes the spin-triplet (orthohelium) below the spin-singlet (parahelium) with no magnetic interaction in sight. Screening, the aufbau order, and Hund's rules then assemble the whole periodic table from the same antisymmetry.\n",{"path":6855,"title":6856,"module":6857,"summary":6858},"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory","Time-Independent Perturbation Theory","Approximation Methods for Bound States","Almost no realistic Hamiltonian can be solved exactly. Perturbation theory treats a hard Hamiltonian as a solvable one plus a small correction and expands the eigenvalues and eigenstates in powers of that correction. We derive the first- and second-order energy shifts and the first-order state correction for a nondegenerate level, expose the small-denominator failure that degeneracy forces, and fix it by diagonalizing the perturbation inside the degenerate subspace to find the \"good\" zeroth-order states.\n",{"path":6860,"title":6861,"module":6857,"summary":6862},"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom","Fine Structure and the Real Hydrogen Atom","The Bohr spectrum is only the leading term. Two relativistic corrections of order alpha-squared — the relativistic kinetic-energy correction and spin–orbit coupling, joined by the Darwin term for s states — split the hydrogen levels into fine structure that depends on the total angular momentum j. We derive each shift as a first-order perturbation, combine them into a formula depending only on n and j, and continue down the energy ladder to the Lamb shift and the hyperfine 21 cm line.\n",{"path":6864,"title":6865,"module":6857,"summary":6866},"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects","The Zeeman and Stark Effects","An atom in an external field is a perturbation problem whose good basis depends on which interaction wins. A magnetic field competes with the internal spin–orbit coupling: the weak-field limit gives the anomalous Zeeman splitting set by the Landé g-factor, the strong-field limit gives the Paschen–Back pattern in the uncoupled basis, and the intermediate regime is a matrix diagonalization. An electric field gives a quadratic shift for the nondegenerate ground state and a linear splitting for the degenerate n = 2 level.\n",{"path":6868,"title":6869,"module":6857,"summary":6870},"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method","The Variational Method","The expectation of the Hamiltonian in any trial state is an upper bound on the true ground-state energy. Minimizing that expectation over a parametrized family of trial functions turns the ground-state problem into ordinary calculus and needs no small parameter. We prove the bound, apply it to the helium atom with a screened effective charge, use a two-center trial to predict binding in the hydrogen molecular ion, and extend the method to excited states through orthogonality.\n",{"path":6872,"title":6873,"module":6857,"summary":6874},"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation","The WKB Approximation","When the potential varies slowly on the scale of the de Broglie wavelength, the wavefunction is locally a plane wave with a position-dependent wavelength. This semiclassical picture builds the wavefunction from the classical momentum, breaks down at the turning points where the momentum vanishes, and is repaired there by connection formulas. The result recovers the Bohr–Sommerfeld quantization rule with its half-integer correction and gives the exponential tunneling rate through a smooth barrier, the Gamow factor.\n",{"path":6876,"title":6877,"module":6,"summary":6},"\u002Fquantum-mechanics","Quantum Mechanics",{"path":6879,"title":6880,"module":6881,"summary":6882},"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions","Sets, Logic, and Functions","Foundations and the Real Number System","The working language of analysis: quantifiers and the proof patterns (contrapositive, contradiction, induction), sets and their operations, relations and equivalence classes, and functions with their images, injections, surjections, and bijections. Cardinality is measured by bijection, and Cantor's theorem that no set surjects onto its power set forces uncountable sets to exist.\n",{"path":6884,"title":6885,"module":6881,"summary":6886},"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness","Ordered Fields and the Completeness Axiom","The real numbers are the unique ordered field with the least-upper-bound property. The field and order axioms, the exact failure of the rationals (no supremum for the set of rationals below √2), and completeness as the defining axiom of ℝ lead to the first consequences: the existence of √2, the Archimedean property, and the density of ℚ in ℝ.\n",{"path":6888,"title":6889,"module":6881,"summary":6890},"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds","Absolute Value, Bounded Sets, and Inequalities","The absolute value turns the order on ℝ into a notion of distance, with the triangle inequality as the estimate underlying most later proofs. Covered: its algebra, the triangle and reverse-triangle inequalities, and the extension of the sup\u002Finf vocabulary from sets to bounded functions.\n",{"path":6892,"title":6893,"module":6881,"summary":6894},"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability","Intervals, Uncountability, and Decimals","Intervals are classified, and ℝ is proved uncountable two ways: a nested-interval construction and the decimal diagonal argument. Decimal expansions are built as suprema of truncations, which pins the source of their non-uniqueness (the 0.4999… equals 0.5000… identity) and the identification of the rationals with the eventually-repeating expansions. The middle-thirds Cantor set is an uncountable set of measure zero.\n",{"path":6896,"title":6897,"module":6898,"summary":6899},"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits","Sequences and Their Limits","Sequences and Series","A sequence is a function on the natural numbers; it converges to a limit when its terms eventually stay within any prescribed tolerance of that number. The epsilon-M definition fixes the order of the quantifiers, and from it the limit is unique, every convergent sequence is bounded, and only the tail matters. Divergence to plus or minus infinity records terms that outgrow every bound.\n",{"path":6901,"title":6902,"module":6898,"summary":6903},"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone","Limit Laws and Monotone Convergence","Limits commute with sums, products, quotients, roots, and absolute values and preserve non-strict inequalities, so a limit can be assembled from the limits of its parts without returning to epsilon and M. The squeeze lemma transfers a limit through two envelopes; the monotone convergence theorem produces a limit from boundedness alone; and the ratio test settles the geometric and factorial standard limits.\n",{"path":6905,"title":6906,"module":6898,"summary":6907},"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass","Subsequences, Limit Superior, and Bolzano–Weierstrass","A bounded sequence need not converge, but it always has convergent subsequences, and its terms cluster between two extreme values. The limit superior and inferior are the limits of the tail suprema and infima; they always exist for a bounded sequence, coincide exactly when it converges, and are its largest and smallest subsequential limits. Bolzano–Weierstrass extracts a convergent subsequence from boundedness alone.\n",{"path":6909,"title":6910,"module":6898,"summary":6911},"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness","Cauchy Sequences and the Completeness of the Reals","The Cauchy criterion tests convergence without knowing the limit: a sequence converges exactly when its terms eventually all lie within any tolerance of one another. Cauchy sequences are bounded, in the reals Cauchy and convergent are equivalent, and this completeness property is interchangeable with the least-upper-bound axiom — the single feature that separates the real line from the rationals.\n",{"path":6913,"title":6914,"module":6898,"summary":6915},"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence","Series and Convergence Tests","A series converges when its sequence of partial sums does, so every fact about sequences transfers. Geometric and telescoping series sum in closed form; the n-th term test rejects series whose terms miss zero, though the harmonic series shows the converse fails; and the comparison test against the geometric and p-series benchmarks settles most nonnegative-term series.\n",{"path":6917,"title":6918,"module":6898,"summary":6919},"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement","Absolute Convergence, the Ratio and Root Tests, and Rearrangements","Absolute convergence is the strong form of convergence that permits free manipulation; conditional convergence is fragile. Absolute convergence implies convergence, and the ratio and root tests detect it by comparison with the geometric series. The alternating series test supplies conditionally convergent series, Riemann's theorem rearranges any of them to any sum, and Mertens' theorem multiplies series when at least one converges absolutely.\n",{"path":6921,"title":6922,"module":6923,"summary":6924},"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms","Metric Spaces, Norms, and Examples","Metric Spaces and Topology","A metric is a function $d(x,y)$ obeying four axioms: nonnegativity, identity of indiscernibles, symmetry, and the triangle inequality. The Euclidean, taxicab, sup, discrete, and great-circle metrics all qualify, as does the sup metric on $C[a,b]$. Every norm induces a metric, and strongly equivalent metrics share the same open sets.\n",{"path":6926,"title":6927,"module":6923,"summary":6928},"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets","Open and Closed Sets, Interior, Closure","Open sets are those in which every point has room to move; closed sets are their complements. From the single ball construction come the topology axioms (arbitrary unions, finite intersections), the interior, closure, and boundary of a set, and the fact that openness is always relative to the ambient space.\n",{"path":6930,"title":6931,"module":6923,"summary":6932},"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness","Convergence, Cauchy Sequences, and Completeness","The $\\varepsilon$-$N$ definition of a limit transfers verbatim to any metric space once $|x-y|$ is replaced by $d(x,y)$. Convergent sequences characterize closed sets and closures; Cauchy sequences and completeness capture spaces with no missing limits, with $\\mathbb{R}^n$ and $C[a,b]$ complete and $\\mathbb{Q}$ and $(0,1]$ not.\n",{"path":6934,"title":6935,"module":6923,"summary":6936},"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness","Compactness","A set is compact if every open cover has a finite subcover. In a metric space this is equivalent to sequential compactness and to being complete and totally bounded. Compact sets are closed and bounded; the Heine–Borel theorem gives the converse in $\\mathbb{R}^n$ but nowhere else in general.\n",{"path":6938,"title":6939,"module":6923,"summary":6940},"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness","Connectedness","A space is connected when it cannot be split into two nonempty open pieces. The connected subsets of $\\mathbb{R}$ are precisely the intervals, path- connectedness gives a constructive sufficient condition, and connectedness is a topological invariant preserved by continuous maps, the fact behind the intermediate value theorem.\n",{"path":6942,"title":6943,"module":5342,"summary":6944},"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions","Limits of Functions","The limit of a function at a point is an epsilon–delta condition pinning one value L as the target of f(x) as x approaches c, mirroring the sequence definition with distance replacing index. It is stated only at cluster points of the domain, is unique when it exists, and reduces to sequential limits through the Heine criterion. The algebra of limits and one-sided limits follow from that reduction.\n",{"path":6946,"title":6947,"module":5342,"summary":6948},"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions","Continuous Functions","A function is continuous at c when its limit there equals its own value, lim f(x) = f(c). The epsilon–delta and sequential forms agree; sums, products, quotients, and compositions of continuous functions are continuous; and the failures split into jump, Dirichlet, popcorn, and removable types. The topological reading is that preimages of open sets are open.\n",{"path":6950,"title":6951,"module":5342,"summary":6952},"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt","Extreme and Intermediate Value Theorems","On a closed bounded interval a continuous function attains an absolute maximum and minimum (the extreme value theorem, compactness preserved by continuity) and takes every value between its endpoint values (the intermediate value theorem, connectedness preserved). Both proofs run through Bolzano–Weierstrass and bisection, and yield root-finding, existence of k-th roots, and fixed-point theorems.\n",{"path":6954,"title":6955,"module":5342,"summary":6956},"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity","Uniform Continuity","Uniform continuity strengthens continuity by demanding one delta that works at every point of the domain, not a delta re-chosen at each point. It separates x^2 on a compact interval from x^2 on the whole line and from 1\u002Fx near zero; continuity on a closed bounded interval is automatically uniform; uniformly continuous functions preserve Cauchy sequences and extend to endpoints; and Lipschitz continuity is the strongest of the three, through its secant-slope bound.\n",{"path":6958,"title":6959,"module":5342,"summary":6960},"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces","Continuity on Metric Spaces","The epsilon–delta definition used only distances, so continuity transfers to maps between metric spaces by replacing absolute values with the two metrics. In this generality continuity still admits a sequential form, preserves compactness and connectedness, is uniform on a compact domain, and reads topologically as preimages of open sets being open, the formulation that defines homeomorphisms.\n",{"path":6962,"title":6963,"module":5342,"summary":6964},"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone","Limits at Infinity and Monotone Functions","Treating infinity as a cluster point extends the epsilon–delta limit to x approaching plus or minus infinity, giving horizontal asymptotes and infinite limits. For monotone functions the one-sided limits always exist as suprema and infima, the discontinuities are jumps and at most countably many, the continuity is equivalent to the image being an interval, and a strictly monotone function always has a continuous inverse.\n",{"path":6966,"title":6967,"module":6968,"summary":6969},"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative","The Derivative","Differentiation","The derivative is the limit of the difference quotient, the slope the secant lines approach as the second point slides into the first. Differentiability forces continuity; linearity and the product, quotient, and chain rules follow from the definition; and a continuous function can fail to be differentiable, as the absolute value does at the origin.\n",{"path":6971,"title":6972,"module":6968,"summary":6973},"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem","The Mean Value Theorem","A relative extremum in the interior forces the derivative to vanish; Rolle's theorem and the mean value theorem turn that local fact into global control. The sign of the derivative fixes monotonicity, a bounded derivative yields a Lipschitz bound, and Darboux's theorem shows derivatives have the intermediate value property even where they are discontinuous.\n",{"path":6975,"title":6976,"module":6968,"summary":6977},"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem","Taylor's Theorem","Taylor's theorem generalizes the mean value theorem: an n-times differentiable function is matched near a point by a degree-n polynomial, with a Lagrange remainder that names the error exactly through one higher derivative. Iterating the mean value theorem proves it; the second-derivative test is the order-one case; and a smooth non-analytic bump separates a Taylor series from the function it fails to represent.\n",{"path":6979,"title":6980,"module":6968,"summary":6981},"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d","The Inverse Function Theorem in One Variable","A nonzero derivative certifies a local inverse and fixes its slope. A strictly monotone differentiable function has a differentiable inverse whose derivative is the reciprocal of the original; the inverse function theorem removes the monotonicity hypothesis, and the reciprocal formula constructs nth roots and the logarithm's derivative, failing exactly where the derivative vanishes.\n",{"path":6983,"title":6984,"module":6985,"summary":6986},"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral","Partitions, Darboux Sums, and Integrability","The Riemann Integral","The Riemann integral is defined by trapping the area under a bounded function between under- and over-estimates. Partitions cut the domain into strips; lower and upper Darboux sums bracket the area; refining a partition tightens the bracket. A function is integrable exactly when the bracket can be made arbitrarily thin, and the tagged Riemann-sum limit gives the same number.\n",{"path":6988,"title":6989,"module":6985,"summary":6990},"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes","Which Functions Are Integrable","The Cauchy criterion certifies whole classes of functions as integrable. Continuous functions are integrable because uniform continuity makes every oscillation cap small; monotone functions are integrable because their caps telescope to a single total jump; bounded functions with finitely many discontinuities are integrable by isolating the bad points. The Dirichlet function fails, and the Lebesgue criterion names the exact boundary.\n",{"path":6992,"title":6993,"module":6985,"summary":6994},"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral","Properties of the Integral","The integral is a linear, order-preserving, additive operator on the integrable functions. It splits across subintervals, respects inequalities, bounds the size of a function by the integral of its absolute value, and preserves products. The mean value theorem for integrals identifies the integral with an attained average height on a fixed rectangle.\n",{"path":6996,"title":5397,"module":6985,"summary":6997},"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem","The fundamental theorem ties the integral to the derivative in two forms. The evaluation form computes a definite integral from any antiderivative; the differentiation form shows the area function has derivative equal to the integrand at points of continuity. Together they make differentiation and integration inverse operations, and yield integration by parts and change of variables.\n",{"path":6999,"title":7000,"module":6985,"summary":7001},"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper","The Logarithm, Exponential, and Improper Integrals","The integral defines transcendental functions. The logarithm is the area under 1\u002Ft, the exponential is its inverse, and their calculus properties follow from the fundamental theorem. Improper integrals extend integration to unbounded intervals and unbounded integrands as limits of proper integrals, with a p-test, a comparison test, absolute versus conditional convergence, and the integral test linking integrals to series.\n",{"path":7003,"title":7004,"module":7005,"summary":7006},"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence","Pointwise and Uniform Convergence","Sequences and Series of Functions","A sequence of functions has two natural notions of limit. Pointwise convergence fixes each input and takes the limit of numbers; uniform convergence demands one rate that works for every input at once. The uniform norm turns the second into a statement about a single sequence of numbers, and the uniform Cauchy criterion and the Weierstrass M-test let us certify it.\n",{"path":7008,"title":7009,"module":7005,"summary":7010},"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits","Interchange of Limits: Continuity, Integration, Differentiation","Passing to a limit inside a continuity statement, an integral, or a derivative is an interchange of two limits, and the two limits do not always commute. Uniform convergence licenses the first two swaps: the uniform limit of continuous functions is continuous, and the limit of the integrals is the integral of the limit. Differentiation needs uniform convergence of the derivatives, and counterexamples show why each hypothesis is required.\n",{"path":7012,"title":7013,"module":7005,"summary":7014},"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass","Power Series and the Weierstrass Approximation Theorem","A power series converges uniformly on every closed subinterval inside its radius of convergence, together with all of its derivatives. That makes it continuous, differentiable, and integrable term by term, so a power series defines an infinitely differentiable function. The Weierstrass approximation theorem then shows that polynomials come uniformly close to any continuous function on a closed bounded interval.\n",{"path":7016,"title":7017,"module":7005,"summary":7018},"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode","Picard's Existence and Uniqueness Theorem","The Banach fixed-point theorem says a contraction of a complete metric space has exactly one fixed point, found by iterating from any start. Applied to the space of continuous functions with the uniform norm, it proves Picard's theorem: a first-order differential equation with a Lipschitz right-hand side has a unique local solution. Picard iteration constructs that solution explicitly, and worked examples show the Lipschitz condition is not optional.\n",{"path":7020,"title":7021,"module":7022,"summary":7023},"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn","The Derivative of a Map ℝⁿ → ℝᵐ","Functions of Several Variables (Introduction)","The derivative of a map between Euclidean spaces is the linear transformation of vanishing relative error, unique when it exists and represented in coordinates by the Jacobian matrix of partial derivatives. Differentiability forces continuity through a local Lipschitz bound. Existence of the partial derivatives alone does not suffice; continuity of the partials does.\n",{"path":7025,"title":7026,"module":7022,"summary":7027},"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule","Directional Derivatives, the Gradient, and the Chain Rule","The directional derivative measures the rate of change of a scalar field along a chosen heading and equals the derivative applied to that direction. The gradient collects these into a vector that points along steepest ascent and sits orthogonal to level sets. The chain rule composes derivatives by multiplying Jacobians, and a mean value theorem holds for scalar fields but fails for vector-valued maps.\n",{"path":7029,"title":7030,"module":7022,"summary":7031},"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema","Higher Derivatives, Taylor's Theorem, and Extrema","Iterating the derivative gives a symmetric second derivative, the Hessian, whose mixed partials agree when they are continuous. Taylor's theorem expands a smooth map to any order with a Lagrange-type remainder, and at a critical point the definiteness of the Hessian decides between a local minimum, a local maximum, and a saddle.\n",{"path":7033,"title":7034,"module":7022,"summary":7035},"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems","The Inverse and Implicit Function Theorems","A nonlinear map with a nonsingular Jacobian is locally invertible, with the inverse's derivative given by the inverse matrix. The contraction mapping principle supplies the local inverse; the implicit function theorem then solves a system for some variables in terms of the rest whenever the relevant Jacobian block is invertible. Worked coordinate changes show both theorems in use.\n",{"path":7037,"title":7038,"module":7022,"summary":7039},"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals","Multiple Integrals","The Riemann integral of a bounded function over a closed rectangle in Euclidean space is built from Darboux upper and lower sums on a grid of subrectangles, with the same squeeze criterion that governs the one-variable integral. Continuous integrands are integrable, and a set of content zero can be ignored. Fubini's theorem evaluates a multiple integral as an iterated one in either order, and the indicator trick extends the theory to regions bounded by curves.\n",{"path":7041,"title":7042,"module":6,"summary":6},"\u002Freal-analysis","Real Analysis",{"path":7044,"title":7045,"module":4995,"summary":7046},"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations","Sets, Functions, and Equivalence Relations","Algebra is built on three prior notions: the set, the map between sets, and the equivalence relation that reorganizes a set into disjoint classes. Sets, maps (injective, surjective, bijective), fibers and preimages, and the correspondence between equivalence relations and partitions — the one structural fact reused in every later quotient construction.\n",{"path":7048,"title":7049,"module":4995,"summary":7050},"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic","The Integers and Modular Arithmetic","The integers carry the template every ring later imitates: well-ordering drives induction, induction drives the division algorithm, and division drives the Euclidean algorithm, gcd, Bézout's identity, and unique factorization into primes. Quotienting by congruence mod n builds the first finite arithmetic, Z\u002FnZ, whose invertible elements form the group of units.\n",{"path":7052,"title":7053,"module":7054,"summary":7055},"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples","Group Axioms and First Examples","Groups and Symmetry","A group is a set with one associative operation that has an identity and inverses. We state the axioms, prove that the identity, inverses, and cancellation behave as expected, define the order of a group and of an element, and catalogue the running examples: the integers, the additive group of residues mod n, and the multiplicative group of units mod n.\n",{"path":7057,"title":7058,"module":7054,"summary":7059},"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups","Dihedral and Symmetric Groups","The dihedral group D_{2n} is the symmetries of a regular n-gon, generated by a rotation r and a reflection s subject to three relations. The symmetric group S_n is all permutations of n objects, written in cycle notation. Orders, generators and relations, cycle decomposition, the order of a permutation from its cycle type, and the parity that splits S_n in half.\n",{"path":7061,"title":7062,"module":7054,"summary":7063},"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups","Matrix and Quaternion Groups","Invertible matrices over a field form the general linear group GL_n(F), with the determinant-one matrices as the subgroup SL_n(F). Over a finite field the order of GL_n(F) has a clean product formula. The quaternion group Q_8 is a second small nonabelian group, distinct from the dihedral group of the same order; its multiplication and subgroup structure sharpen the contrast between the two.\n",{"path":7065,"title":7066,"module":7054,"summary":7067},"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions","Homomorphisms, Isomorphisms, and Actions","A homomorphism is a map between groups that respects the operation; an isomorphism is a bijective one, making two groups the same up to relabeling. The kernel and image measure how far a homomorphism is from injective and surjective. A group action realizes a group as permutations of a set, and actions correspond exactly to homomorphisms into a symmetric group, with orbits and stabilizers as the first tools for counting.\n",{"path":7069,"title":7070,"module":7071,"summary":7072},"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures","Subgroups and Their Substructures","Subgroups and Quotients","A subgroup is a subset that is a group under the inherited operation. One test decides it: nonempty and closed under the map $(x,y) \\mapsto xy^{-1}$. From an arbitrary subset $A$ we build the centralizer, normalizer, and center, and from an action the stabilizer and kernel, all of them subgroups nested in a fixed chain inside $G$.\n",{"path":7074,"title":7075,"module":7071,"summary":7076},"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups","Cyclic Groups","A cyclic group is generated by one element. Two facts organize the whole theory: the order of an element equals the order of the subgroup it generates, and cyclic groups of equal order are isomorphic, so $\\mathbb{Z}$ and $\\mathbb{Z}\u002Fn\\mathbb{Z}$ are the only ones. From there the generators ($\\varphi(n)$ of them), the subgroups (one per divisor of $n$), and a fast exponentiation algorithm all follow.\n",{"path":7078,"title":7079,"module":7071,"summary":7080},"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices","Generation and the Lattice of Subgroups","The subgroup generated by a subset $A$ is the smallest subgroup containing it, described top-down as an intersection and bottom-up as the set of words in $A$ and its inverses. Collecting all subgroups and ordering them by containment produces the subgroup lattice, whose Hasse diagram shows the joins, meets, and containment relations among all subgroups.\n",{"path":7082,"title":7083,"module":7071,"summary":7084},"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups","Cosets, Lagrange, and Normal Subgroups","The left cosets of a subgroup partition a group into equal-sized blocks, so the order of a subgroup divides the order of the group: Lagrange's theorem. When the blocks can be multiplied consistently — exactly when the subgroup is normal — they form the quotient group $G\u002FN$. Fermat's and Euler's theorems fall out as index computations.\n",{"path":7086,"title":7087,"module":7071,"summary":7088},"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems","The Isomorphism Theorems","Four theorems relate homomorphisms, quotients, and subgroup lattices. The first identifies the image of a homomorphism with the quotient by its kernel; the second and third compute quotients built from two subgroups and quotients of quotients; the fourth matches the subgroups of $G\u002FN$ with the subgroups of $G$ lying above $N$. Together they make quotient groups computable.\n",{"path":7090,"title":7091,"module":7071,"summary":7092},"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group","Composition Series and the Alternating Group","A composition series breaks a finite group into simple quotient factors, and Jordan-Hölder says those factors are unique up to order. This turns classification into two problems: list the simple groups, and describe how to reassemble them. The sign homomorphism splits $S_n$ into even and odd permutations, defining the alternating group $A_n$, simple for $n \\ge 5$.\n",{"path":7094,"title":7095,"module":7096,"summary":7097},"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem","Actions, Orbits, and Cayley's Theorem","Group Actions and Sylow Theory","A group action turns abstract elements into permutations of a set. The action splits the set into orbits, and the orbit-stabilizer theorem ties each orbit's size to the index of a stabilizer. Applied to a group acting on itself by left multiplication, this gives Cayley's theorem: every group is a group of permutations.\n",{"path":7099,"title":7100,"module":7096,"summary":7101},"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation","Conjugation and the Class Equation","A group acts on itself by conjugation, and the orbits are the conjugacy classes. Orbit-stabilizer turns the resulting partition into the class equation, which forces every group of prime-power order to have a nontrivial center. Conjugacy in the symmetric group is cycle type, and Burnside's lemma counts orbits by averaging fixed points.\n",{"path":7103,"title":7104,"module":7096,"summary":7105},"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems","The Sylow Theorems","Lagrange's theorem forbids subgroups whose order fails to divide the group order; Sylow's theorems supply a partial converse for prime powers. A Sylow p-subgroup always exists, all of them are conjugate, and their count satisfies two congruence-and-divisibility constraints tight enough to prove many groups non-simple from their order alone.\n",{"path":7107,"title":7108,"module":7096,"summary":7109},"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups","Automorphisms and Simplicity of Aₙ","Conjugation makes a group act on itself and on its normal subgroups by automorphisms, giving the inner automorphism group G\u002FZ(G) and the embedding of N(H)\u002FC(H) into Aut(H). Characteristic subgroups are those every automorphism fixes, and the automorphism group of a cyclic group is its unit group. The lesson closes by proving the alternating group Aₙ is simple for n ≥ 5.\n",{"path":7111,"title":7112,"module":7113,"summary":7114},"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups","Direct Products and Finite Abelian Groups","Products and Group Structure","The direct product assembles a larger group from componentwise copies of smaller ones, and a recognition theorem reverses the process when two normal subgroups meet trivially and span the group. The Fundamental Theorem of Finitely Generated Abelian Groups then classifies every such group by two equivalent invariants, invariant factors and elementary divisors.\n",{"path":7116,"title":7117,"module":7113,"summary":7118},"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products","Semidirect Products","The semidirect product relaxes the direct product by requiring only one factor to be normal, with the other acting on it through a homomorphism into its automorphism group. This single twisting map lets abelian pieces assemble into non-abelian groups, realizes the dihedral groups as $\\mathbb{Z}_n \\rtimes \\mathbb{Z}_2$, and, with a recognition theorem, classifies groups of several small orders.\n",{"path":7120,"title":7121,"module":7113,"summary":7122},"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups","p-Groups, Nilpotent, and Solvable Groups","Finite p-groups have nontrivial center, and iterating the center upward builds the nilpotent groups, which decompose as the direct product of their Sylow subgroups. Iterating the commutator downward builds the solvable groups, whose factors are abelian. The chain cyclic, abelian, nilpotent, solvable orders these classes, and A_5 breaks the last link.\n",{"path":7124,"title":7125,"module":7113,"summary":7126},"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups","Classifying Groups of Small Order","With Sylow's theorem to force normal subgroups, direct and semidirect products to assemble them, and presentations to name the result, every group up to order fifteen can be listed explicitly. Free groups make presentations precise: generators with no relations, from which any group is a quotient by the normal closure of its relations.\n",{"path":7128,"title":7129,"module":7130,"summary":7131},"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples","Rings: Definitions and Examples","Ring Theory","A ring carries two operations: an abelian group under addition and an associative multiplication linked by the distributive laws. The named special cases — commutative rings, integral domains, division rings, and fields — differ only in how their multiplication behaves. Standard examples include quadratic integer rings, polynomial rings, matrix rings, and group rings.\n",{"path":7133,"title":7134,"module":7130,"summary":7135},"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms","Ideals, Quotient Rings, and Homomorphisms","Ring homomorphisms have kernels that absorb multiplication; such subsets are ideals, and every ideal is the kernel of the projection onto a quotient ring. The quotient construction yields the ring isomorphism theorems and classifies ideals by their quotients: R\u002FI is a field exactly when I is maximal, an integral domain exactly when I is prime.\n",{"path":7137,"title":7138,"module":7130,"summary":7139},"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem","Fields of Fractions and the CRT","Rings of fractions invert a multiplicatively closed set, enlarging an integral domain into its field of fractions the way Z becomes Q. The Chinese Remainder Theorem splits a quotient by comaximal ideals into a direct product, generalizing Z\u002FmnZ ≅ Z\u002FmZ × Z\u002FnZ and explaining why the Euler function is multiplicative.\n",{"path":7141,"title":7142,"module":7143,"summary":7144},"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds","Euclidean Domains, PIDs, and UFDs","Factorization and Polynomial Rings","Three classes of integral domain, ordered by how much of elementary arithmetic survives: Euclidean domains carry a division algorithm, principal ideal domains make every ideal a single multiple, and unique factorization domains factor every element into irreducibles in one way. We prove the chain ED implies PID implies UFD, the classes are separated by explicit counterexamples, and irreducible and prime coincide exactly in a UFD.\n",{"path":7146,"title":7147,"module":7143,"summary":7148},"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields","Polynomial Rings over Fields","When the coefficients form a field, polynomial long division works exactly as it does over the rationals, and it works with a unique quotient and remainder. That single fact makes F[x] a Euclidean domain, hence a PID and a UFD: every ideal is the multiples of one polynomial, roots correspond to linear factors, and F[x]\u002F(f) is a field precisely when f is irreducible.\n",{"path":7150,"title":7151,"module":7143,"summary":7152},"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization","Gauss's Lemma and Unique Factorization","A UFD is not a field, so its polynomial ring is not a PID — yet unique factorization survives the passage from R to R[x]. Gauss's lemma supplies the passage: a polynomial that factors over the fraction field already factors over R, once content is factored out. This gives the theorem that R[x] is a UFD whenever R is, so Z[x] and Q[x,y] factor uniquely even though neither is a PID.\n",{"path":7154,"title":7155,"module":7143,"summary":7156},"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner","Irreducibility Criteria and Gröbner Bases","Deciding whether a given polynomial is irreducible, and computing in multivariate polynomial rings. In one variable: the rational root test, reduction modulo a prime, and Eisenstein's criterion. In several variables, where division fails, a monomial order gives leading terms, a Gröbner basis restores a well-defined remainder, and Buchberger's algorithm computes it.\n",{"path":7158,"title":7159,"module":7160,"summary":7161},"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules","Introduction to Modules","Module Theory","A module is an abelian group on which a ring acts, generalizing both vector spaces (when the ring is a field) and abelian groups (when the ring is the integers). Submodules, homomorphisms, quotients, and the isomorphism theorems carry over from groups, and an F[x]-module is the same datum as a vector space with a chosen linear operator — the correspondence behind the canonical forms.\n",{"path":7163,"title":7164,"module":7160,"summary":7165},"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums","Generation, Direct Sums, and Free Modules","A generating set spans a module by R-linear combinations; a direct sum decomposes it into independent pieces; a free module has a basis and the universal property that a homomorphism is determined by arbitrary values on that basis. Rank is well defined over a commutative ring, torsion blocks a basis, and every module is a quotient of a free one — a presentation by generators and relations.\n",{"path":7167,"title":7168,"module":7160,"summary":7169},"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences","Tensor Products and Exact Sequences","The tensor product builds a module in which elements of two modules can be multiplied, characterized by a universal property turning bilinear maps into linear ones; extension of scalars is its guiding case. Exact sequences track how a module is assembled from a submodule and a quotient, when that assembly splits, and which modules — projective, injective, flat — make the Hom and tensor functors preserve exactness.\n",{"path":7171,"title":7172,"module":7160,"summary":7173},"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps","Vector Spaces and Linear Maps","A vector space is a module over a field, and the field hypothesis removes every pathology a general module can have: every vector space is free, so it has a basis, a well-defined dimension, and a coordinate isomorphism with F^n. Linear maps become matrices, change of basis becomes similarity, every space pairs with a dual of the same dimension, and the determinant is the unique alternating multilinear normalized form.\n",{"path":7175,"title":7176,"module":7177,"summary":7178},"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids","The Structure Theorem for Modules over a PID","Modules over PIDs and Canonical Forms","Every finitely generated module over a principal ideal domain splits as a free part plus a direct sum of cyclic torsion pieces, in two canonical ways: invariant factors, tied together by a divisibility chain, and elementary divisors, one prime power at a time. Existence follows from the stacked-basis theorem, both lists are unique, and the case $R = \\mathbb{Z}$ is the classification of finitely generated abelian groups.\n",{"path":7180,"title":7181,"module":7177,"summary":7182},"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form","Rational Canonical Form","A linear operator turns its vector space into a module over the polynomial ring $F[x]$, with $x$ acting as the operator. The structure theorem's invariant factors then become polynomials, each cyclic summand becomes a companion matrix, and the block-diagonal assembly is the rational canonical form. It is unique, it is computed inside the base field, and two matrices are similar exactly when their rational canonical forms agree.\n",{"path":7184,"title":7185,"module":7177,"summary":7186},"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form","Jordan Canonical Form","When the base field contains all the eigenvalues, the elementary divisors of an operator are powers of linear polynomials, and each cyclic summand becomes a Jordan block: an eigenvalue on the diagonal with ones just above it. Stacking the blocks gives the Jordan canonical form, unique up to reordering, as close to diagonal as the operator allows. Diagonalizability reads off the minimal polynomial, and the block sizes are counted by ranks of powers of the operator minus the eigenvalue.\n",{"path":7188,"title":7189,"module":7190,"summary":7191},"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements","Field Extensions and Algebraic Elements","Field Theory","A field extension makes a larger field K into a vector space over a smaller field F, and its degree [K:F] is that dimension. Adjoining a root of an irreducible polynomial builds a simple extension F(α) isomorphic to F[x]\u002F(m), whose degree is the degree of the minimal polynomial. The tower law makes these degrees multiply, which turns algebra over fields into bookkeeping with integers.\n",{"path":7193,"title":7194,"module":7190,"summary":7195},"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions","Straightedge-and-Compass Constructions","The lengths a straightedge and compass can build from a unit form a field closed under square roots, and every constructible number lies in a tower of quadratic extensions. So its degree over the rationals is a power of two. That single obstruction settles three problems the Greeks left open: doubling the cube, trisecting a general angle, and squaring the circle are all impossible.\n",{"path":7197,"title":7198,"module":7190,"summary":7199},"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure","Splitting Fields and Algebraic Closure","The splitting field of a polynomial is the smallest extension in which it factors into linear pieces, obtained by adjoining all its roots. Every polynomial has one, its degree is at most n factorial, and any two splitting fields are isomorphic. Pushing this to all polynomials at once gives the algebraic closure, a field in which every polynomial splits and which is unique up to isomorphism.\n",{"path":7201,"title":7202,"module":7190,"summary":7203},"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions","Separable Extensions and Cyclotomic Fields","A polynomial is separable when its roots are distinct, detected by whether it shares a factor with its formal derivative. Over perfect fields — characteristic zero and finite fields — every irreducible is separable, and the existence and uniqueness of the finite fields follow. Cyclotomic polynomials package the roots of unity by order, are irreducible over the rationals, and give the cyclotomic field its degree phi(n).\n",{"path":7205,"title":7206,"module":7207,"summary":7208},"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence","The Galois Correspondence","Galois Theory","Galois theory attaches to a field extension its group of symmetries and shows that, for the right extensions, the subgroups of that group are in exact order-reversing correspondence with the intermediate fields. The automorphism group, Artin's theorem, the characterization of Galois extensions, and the Fundamental Theorem together turn questions about fields into questions about finite groups.\n",{"path":7210,"title":7211,"module":7207,"summary":7212},"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields","Finite Fields","Every finite field has prime-power order, is the splitting field of $x^{p^n} - x$, and is unique up to isomorphism. Its extension over the prime field is Galois with cyclic group generated by the Frobenius map $x \\mapsto x^p$, so the Galois correspondence reduces the subfield lattice to the divisor lattice of $n$. Möbius inversion counts the irreducible polynomials of each degree, and cyclic error-correcting codes are one application.\n",{"path":7214,"title":7215,"module":7207,"summary":7216},"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions","Cyclotomic and Abelian Extensions","The Galois group of the $n$th cyclotomic field over $\\mathbb{Q}$ is the unit group $(\\mathbb{Z}\u002Fn\\mathbb{Z})^\\times$, which makes cyclotomic fields the worked catalogue of abelian extensions of $\\mathbb{Q}$. The isomorphism identifies subfields with subgroups, realizes every finite abelian group as a Galois group over $\\mathbb{Q}$, and leads to Kronecker–Weber. Composites of Galois extensions and the primitive element theorem supply the machinery.\n",{"path":7218,"title":7219,"module":7207,"summary":7220},"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials","Galois Groups of Polynomials","Ordering the roots of a separable polynomial embeds its Galois group in the symmetric group $S_n$, and the group is transitive exactly when the polynomial is irreducible. The discriminant decides membership in $A_n$; for cubics and quartics the resolvent cubic pins the group down; and reduction modulo a prime produces elements of prescribed cycle type, the standard tool for computing Galois groups over $\\mathbb{Q}$.\n",{"path":7222,"title":7223,"module":7207,"summary":7224},"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic","Solvability by Radicals and the Quintic","A polynomial is solvable by radicals exactly when its Galois group is solvable. Cyclic extensions are radical extensions once roots of unity are present, which turns a radical tower into a solvable subnormal series. Since $S_n$ is solvable only for $n \\le 4$, the general quintic has no radical formula, and an explicit quintic with Galois group $S_5$ has roots provably not expressible in radicals.\n",{"path":7226,"title":7227,"module":7228,"summary":7229},"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry","A Glimpse of Commutative Algebra and Algebraic Geometry","Capstone: Where Algebra Goes Next","Commutative algebra reads geometry off the ring of polynomial functions. The dictionary runs through Noetherian rings and the ascending chain condition, Hilbert's Basis Theorem, affine algebraic sets and the two maps connecting ideals to zero sets, radicals, the Zariski topology, and Hilbert's Nullstellensatz, which over an algebraically closed field makes radical ideals and algebraic sets the same object.\n",{"path":7231,"title":7232,"module":7228,"summary":7233},"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory","A Glimpse of Representation and Character Theory","Representation theory studies a group by the ways it can act linearly on a vector space. Representations are equivalent to modules over the group ring; Maschke's theorem gives complete reducibility, the Wedderburn consequences bound the irreducible degrees, and character theory reduces a representation to a trace invariant governed by the orthogonality relations and displayed in the character table of a small group.\n",{"path":7235,"title":7236,"module":6,"summary":6},"\u002Fabstract-algebra","Abstract Algebra",{"path":7238,"title":7239,"module":7240,"summary":7241},"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford","Atomic Spectra and Rutherford's Nucleus","Early Atomic Models and the Old Quantum Theory","Atoms emit light only at sharp, reproducible wavelengths, and by 1890 those wavelengths were captured by the Rydberg-Ritz formula. Neither empirical regularity had a mechanical explanation. Rutherford's alpha-scattering experiment supplied the missing structure: the atom's positive charge and nearly all its mass sit in a tiny central nucleus, with the electrons far outside.\n",{"path":7243,"title":7244,"module":7240,"summary":7245},"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen","The Bohr Model of Hydrogen","Bohr grafted three quantum postulates onto Rutherford's nuclear atom: certain orbits do not radiate, radiation accompanies a jump between them, and quantization must match classical physics for large orbits. Quantizing the angular momentum fixes the orbit radii and energies, reproduces the Rydberg-Ritz formula, and predicts the Rydberg constant from fundamental constants alone.\n",{"path":7247,"title":7248,"module":7240,"summary":7249},"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz","X-Ray Spectra and the Franck-Hertz Experiment","Two 1913-14 experiments confirmed the Bohr-Rutherford atom independently of optical spectra. Moseley found that the square root of a characteristic X-ray frequency is linear in atomic number, fixing Z as nuclear charge and ordering the periodic table. Franck and Hertz measured discrete atomic energy levels directly by scattering electrons through a mercury vapor.\n",{"path":7251,"title":7252,"module":7240,"summary":7253},"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory","The Bohr-Sommerfeld Old Quantum Theory","Bohr fixed the hydrogen levels with a single quantum number by quantizing angular momentum. Sommerfeld replaced that ad hoc rule with a general prescription: quantize the action of each separable coordinate. The rule produces elliptical orbits, a second (azimuthal) quantum number, space quantization, and — once the relativistic mass variation is included — a fine-structure splitting that matches experiment to order alpha squared.\n",{"path":7255,"title":7256,"module":7240,"summary":7257},"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb","Limits of the Old Quantum Theory and the WKB Bridge","The old quantum theory works only where the classical motion is separable into independent periodic coordinates. It fails for helium, forbids the correct zero angular momentum of the hydrogen ground state, and misses the half-integer in the oscillator and in molecular spectra. The WKB quantization condition, derived from the Schrodinger equation, is the modern descendant of the Sommerfeld rule and repairs the half-integer through the Maslov correction.\n",{"path":7259,"title":7260,"module":7261,"summary":7262},"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen","The Schrödinger Equation in Three Dimensions and Hydrogen","The Quantum Hydrogen Atom","Extending the Schrödinger equation to three dimensions and separating it in spherical coordinates produces three ordinary differential equations, one per coordinate. Their boundary conditions generate the quantum numbers n, ℓ, and mℓ, quantize the angular momentum to √(ℓ(ℓ+1))ℏ with projections mℏ, and fix the bound-state energies of hydrogen at −Z²(13.6 eV)\u002Fn².\n",{"path":7264,"title":7265,"module":7261,"summary":7266},"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions","Hydrogen Wave Functions and Orbitals","The hydrogen wave functions factor into a radial part Rₙℓ(r) and an angular spherical harmonic Yℓm(θ,φ). Squaring gives the probability cloud; the radial distribution P(r) = r²|ψ|² peaks at the Bohr radius for the ground state and at the Bohr orbits for excited states. The angular part fixes the s, p, and d orbital shapes that govern chemical bonding.\n",{"path":7268,"title":7269,"module":7261,"summary":7270},"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full","Solving the Radial Equation in Full","The hydrogen radial equation is solved from the differential equation up. The substitution u = rR turns it into a one-dimensional problem with a centrifugal barrier; matching the asymptotic behaviour at the origin and at infinity peels off the factors r^(ℓ+1) and e^(−r\u002Fna₀); a Frobenius series for the remainder must terminate, and that termination condition yields the quantization n ≥ ℓ+1 with E = −Z²Ry\u002Fn². The surviving polynomials are the associated Laguerre functions, whose degree n−ℓ−1 counts the radial nodes.\n",{"path":7272,"title":7273,"module":7261,"summary":7274},"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz","Accidental Degeneracy and the Runge-Lenz Symmetry","Hydrogen energies depend only on n, so states of different ℓ at the same n are degenerate. This is not a coincidence but the mark of a hidden symmetry: the quantum Runge-Lenz vector is conserved for the 1\u002Fr potential alone, and together with angular momentum it generates the group SO(4). The Casimir invariant of that group reproduces E = −Z²Ry\u002Fn² and its representations count the n² states. Any departure from 1\u002Fr breaks the symmetry and lifts the ℓ-degeneracy.\n",{"path":7276,"title":7277,"module":7261,"summary":7278},"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial","Expectation Values, the Virial Theorem, and Scaling","The radial matrix elements ⟨r^k⟩ of hydrogenic states are the raw material of every later correction. This lesson derives ⟨1\u002Fr⟩ from the virial theorem, builds the full family ⟨r⟩, ⟨r²⟩, ⟨1\u002Fr²⟩, ⟨1\u002Fr³⟩ from Kramers' recursion and the Feynman-Hellmann theorem, and reads off their scaling with n, ℓ, and Z. The virial balance ⟨T⟩ = −½⟨V⟩ = −E fixes the energy budget of every bound state.\n",{"path":7280,"title":7281,"module":7261,"summary":7282},"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra","Quantum Defects and Alkali Spectra","An alkali atom is one valence electron outside a closed-shell core, and to a good approximation it is hydrogen with a modified quantum number. Core penetration makes low-ℓ states more bound than the Coulomb formula predicts, and the shortfall is captured by a single number per ℓ, the quantum defect δℓ. The spectrum then follows the Rydberg formula with n replaced by the effective n − δℓ, and the sodium D-line doublet is the worked case.\n",{"path":7284,"title":7285,"module":7261,"summary":7286},"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms","Rydberg Atoms","A Rydberg atom is an atom excited to a very high principal quantum number, and every hydrogenic property becomes exaggerated by a power of n. Size grows as n², binding falls as n⁻², radiative lifetime lengthens as n³, and the static polarizability explodes as n⁷. The levels crowd toward the ionization limit, and the enormous dipole interaction between two Rydberg atoms produces the blockade that underlies neutral-atom quantum computing.\n",{"path":7288,"title":7289,"module":7290,"summary":7291},"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction","The Relativistic Kinetic-Energy Correction","Fine Structure and the Dirac Atom","The Bohr energies treat the electron as slowly moving, but its speed is of order αc, so the kinetic energy needs a relativistic correction. Expanding √(p²c²+m²c⁴) to order (v\u002Fc)² produces the perturbation −p⁴\u002F8m³c², whose first-order shift on a hydrogenic state is evaluated with the trick p²=2m(E−V). The result depends on n and ℓ, is smaller than the gross structure by α²≈5×10⁻⁵, and is one of the three pieces that combine into the fine-structure formula.\n",{"path":7293,"title":7294,"module":7290,"summary":7295},"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession","Spin-Orbit Coupling and Thomas Precession","In the electron's rest frame the nucleus orbits it, and the resulting current produces a magnetic field that couples to the electron's spin moment. The interaction is ξ(r) L·S, with ξ built from the Coulomb potential and the radial expectation ⟨1\u002Fr³⟩. A relativistic subtlety, Thomas precession, halves the naive coefficient because the electron's rest frame is accelerating. The result splits each ℓ≥1 level into a j=ℓ±½ doublet and makes (n, ℓ, j, mⱼ) the good quantum numbers.\n",{"path":7297,"title":7298,"module":7290,"summary":7299},"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula","The Darwin Term and the Fine-Structure Formula","The third fine-structure correction, the Darwin term, is a contact interaction proportional to ∇²V that acts only on s-states, physically a smearing of the electron over a Compton wavelength. Adding the relativistic, spin-orbit, and Darwin shifts, the ℓ-dependence cancels and the total collapses to a formula in n and j alone. The n=2 shell splits into 2S₁\u002F₂, 2P₁\u002F₂, 2P₃\u002F₂, with the two j=½ levels exactly degenerate, a coincidence the Dirac theory explains.\n",{"path":7301,"title":7302,"module":7290,"summary":7303},"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen","The Dirac Equation for Hydrogen","The fine-structure formula was assembled from three perturbations; the Dirac equation produces it in one stroke and exactly. A first-order relativistic wave equation forces a four-component spinor, from which spin s=½, the g-factor of 2, the spin-orbit term, and antiparticles all emerge automatically. Its exact Coulomb spectrum depends only on n and j, and expanding in Zα reproduces the perturbative result, including the 2S₁\u002F₂–2P₁\u002F₂ degeneracy that sets up the Lamb shift.\n",{"path":7305,"title":7306,"module":7307,"summary":7308},"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed","The Lamb Shift and QED Radiative Corrections","QED Corrections and Hyperfine Structure","The Dirac equation makes the 2S₁\u002F₂ and 2P₁\u002F₂ levels of hydrogen exactly degenerate. Lamb and Retherford measured a splitting of about 1058 MHz that the Dirac theory cannot produce. The gap comes from the electron's coupling to the quantized electromagnetic field: self-energy, vacuum polarization, and the anomalous magnetic moment. Welton's vacuum-fluctuation estimate reproduces the size and shows why the effect lands almost entirely on s-states, and the same radiative corrections make hydrogen the most stringent test of QED.\n",{"path":7310,"title":7311,"module":7307,"summary":7312},"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm","Hyperfine Structure and the 21 cm Line","The proton carries a magnetic moment, and it interacts with the magnetic field the electron produces at the nucleus. For s-states that interaction is the Fermi contact term, proportional to the electron density at the origin and to the dot product of the nuclear and electronic spins. Coupling I and J into F = I + J splits each level by a Landé interval rule; in hydrogen's ground state it produces the F = 0\u002FF = 1 doublet whose 1420 MHz, 21 cm transition maps neutral hydrogen across the galaxy.\n",{"path":7314,"title":7315,"module":7307,"summary":7316},"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift","Nuclear Size, Moments, and Isotope Shifts","A real nucleus has a finite size, a mass that changes between isotopes, and, when its spin is at least one, an electric quadrupole moment. Each leaves a fingerprint in the atomic spectrum: the volume shift from s-electrons sampling the charge distribution, the mass and field isotope shifts that separate on a King plot, the quadrupole interaction that breaks the Landé interval rule, and the hyperfine anomaly from the magnetization distribution. Atomic spectroscopy reads nuclear properties out of these shifts.\n",{"path":7318,"title":7319,"module":7320,"summary":7321},"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra","The Periodic Table and Atomic Spectra","Many-Electron Atoms","Identical electrons demand antisymmetric wave functions, which is the Pauli exclusion principle: no two electrons share all four quantum numbers. Filling shells in order of increasing energy — shifted by penetration and shielding — builds the periodic table and its recurring ionization pattern. Selection rules govern optical spectra, and an external field splits lines by the Zeeman effect.\n",{"path":7323,"title":7324,"module":7320,"summary":7325},"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent","The Central-Field Approximation and the Self-Consistent Field","The N-electron Hamiltonian does not separate because every pair of electrons repels. The central-field approximation replaces that pairwise repulsion with an averaged spherical potential each electron feels, restoring hydrogen-like orbitals labelled by n and ℓ. The Thomas-Fermi statistical model fixes the shape of the screened charge from Fermi-gas thermodynamics; the Hartree self-consistent field determines it exactly by iterating orbitals against the potential they generate until the two agree.\n",{"path":7327,"title":7328,"module":7320,"summary":7329},"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock","Exchange, Slater Determinants, and Hartree-Fock","A product wave function ignores that electrons are identical fermions. Enforcing antisymmetry writes the state as a Slater determinant, which vanishes whenever two electrons share a spin-orbital — the exclusion principle made algebraic. The energy of a determinant carries a new term with no classical analogue, the exchange integral, nonzero only for parallel spins; it lowers the energy of aligned electrons and carves a Fermi hole around each one. Adding the exchange operator to the mean field gives the Hartree-Fock equations, and what they still miss defines the correlation energy.\n",{"path":7331,"title":7332,"module":7320,"summary":7333},"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom","Helium: the Prototype Two-Electron Atom","Helium is the smallest atom the Schrödinger equation cannot solve exactly, and the smallest that shows every many-electron effect. Ignoring the electron repulsion overbinds the ground state by 30 eV; first-order perturbation theory and a one-parameter variational calculation with an effective charge close most of the gap. The excited configurations split into para (singlet) and ortho (triplet) states separated by the exchange integral, with the triplet lower — and the absence of a 1s² triplet is the Pauli principle in its plainest form.\n",{"path":7335,"title":7336,"module":7320,"summary":7337},"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols","LS and jj Coupling; Term Symbols","A configuration is not a single energy level. The residual electrostatic repulsion and the spin-orbit interaction split it, and which one dominates fixes the coupling scheme. In light atoms the electrostatic term wins: orbital and spin angular momenta couple separately into L and S, then into J, giving Russell- Saunders term symbols. In heavy atoms spin-orbit wins and each electron's j forms first. The Pauli principle prunes the allowed terms of equivalent electrons, the Landé interval rule spaces the fine-structure multiplet, and the scheme crosses over from LS to jj down a column.\n",{"path":7339,"title":7340,"module":7320,"summary":7341},"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms","Hund's Rules and Ground-State Terms","A configuration allows several terms; Hund's three rules pick the ground one. Maximize the spin S first, then the orbital L, then set J to |L−S| for a less-than-half shell and L+S for a more-than-half shell. The first two rules come from exchange lowering the energy of apart-kept electrons; the third comes from the sign of the spin-orbit coupling, which flips as a shell passes half-filling and turns the multiplet from normal to inverted. Worked ground terms for carbon, nitrogen, oxygen, and iron show the rules in action.\n",{"path":7343,"title":7344,"module":7345,"summary":7346},"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect","The Zeeman Effect","Atoms in External Fields","A magnetic field couples to the atom through its magnetic moment, splitting each level into equally spaced sublevels labelled by the projection of the total angular momentum. When spin is present the spacing is not the classical one: it carries the Landé g-factor, a projection of the spin and orbital moments onto the total angular momentum. We derive the weak-field Hamiltonian from minimal coupling, evaluate the shift with the projection theorem, and read off the polarization of the emitted components.\n",{"path":7348,"title":7349,"module":7345,"summary":7350},"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate","The Paschen-Back and Intermediate-Field Regimes","When the magnetic interaction grows past the fine-structure coupling, spin and orbital angular momentum decouple and precess independently about the field. The anomalous Zeeman pattern reverts to a simple triplet, the Paschen-Back effect. Between the two limits neither coupling dominates and the level positions follow from diagonalizing the combined spin-orbit and Zeeman Hamiltonian. We build the two-by-two problem for a single valence electron, solve it in closed form, and show both limits emerge from one expression.\n",{"path":7352,"title":7353,"module":7345,"summary":7354},"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability","The Stark Effect and Field Ionization","An electric field shifts atomic levels by coupling to the electron's position. Parity forbids a first-order shift for a non-degenerate state, so most atoms respond only at second order through their polarizability, a quadratic Stark shift. Hydrogen is the exception: its accidental degeneracy admits a permanent dipole and a linear shift, cleanest in parabolic coordinates. At large fields the Coulomb well develops a saddle, and Rydberg states field-ionize at a threshold that falls as the fourth power of the principal quantum number.\n",{"path":7356,"title":7357,"module":7358,"summary":7359},"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule","Time-Dependent Perturbation Theory and the Golden Rule","Radiative Transitions and Spectral Lines","An atom in a weak oscillating field makes transitions between its stationary states. First-order time-dependent perturbation theory gives the transition amplitude as a Fourier component of the perturbation at the Bohr frequency, and the resulting probability is a sinc-squared resonance that sharpens as the field acts longer. For a two-level system the same coupling produces Rabi oscillations; for a transition into a continuum the long-time limit collapses the sinc-squared into a delta function and yields Fermi's golden rule, a constant transition rate set by the coupling strength and the density of final states.\n",{"path":7361,"title":7362,"module":7358,"summary":7363},"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients","The Dipole Approximation and Einstein Coefficients","The coupling between an atom and light is the interaction of the electron with the electromagnetic field. Because an optical wavelength dwarfs the atom, the spatial variation of the field across the atom can be dropped, leaving the electric-dipole interaction and its matrix element. That matrix element defines the oscillator strength, which obeys the Thomas-Reiche-Kuhn sum rule. Einstein's three rate coefficients (absorption, stimulated emission, spontaneous emission) follow from detailed balance with thermal radiation, fixing the ratio of spontaneous to stimulated rates and its steep growth with frequency.\n",{"path":7365,"title":7366,"module":7358,"summary":7367},"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions","Selection Rules and Forbidden Transitions","The dipole matrix element vanishes for most pairs of states, and the pattern of which survive is the set of selection rules. Parity forces the orbital angular momentum to change by one; the angular integral of three spherical harmonics restricts the magnetic quantum number to change by zero or one; the photon's spin restricts the total angular momentum. When the dipole element vanishes, higher multipoles (magnetic dipole and electric quadrupole) can still drive the transition at rates smaller by powers of the fine-structure constant, and states with no allowed decay become metastable.\n",{"path":7369,"title":7370,"module":7358,"summary":7371},"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes","Lifetimes, Line Widths, and Line Shapes","A spectral line is never infinitely sharp. The finite lifetime of the excited state gives every line a natural Lorentzian width set by the total decay rate, the Fourier transform of an exponentially damped emission. Thermal motion adds a Gaussian Doppler width that usually dominates in a gas; collisions add a further Lorentzian pressure width; the observed profile is the Voigt convolution of the Gaussian and Lorentzian parts. Strong driving fields broaden the line further through saturation. Each mechanism has a distinct dependence on temperature, density, and intensity that lets it be identified and, where possible, removed.\n",{"path":7373,"title":7374,"module":7375,"summary":7376},"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles","Population Inversion, Gain, and the Laser","Lasers and Spectroscopy","A laser is an optical amplifier placed inside a resonant cavity. Amplification requires that stimulated emission outrun absorption, which requires more atoms in the upper level than the lower one — a population inversion that the Einstein relations forbid in thermal equilibrium and that no two-level pump can produce. Three- and four-level schemes reach it by routing atoms through auxiliary states. The gain coefficient sets how strongly a weak beam grows, the cavity fixes the threshold and selects a comb of longitudinal modes, and gain saturation clamps the steady-state inversion at its threshold value.\n",{"path":7378,"title":7379,"module":7375,"summary":7380},"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques","Spectroscopic Techniques and Frequency Combs","A tunable laser turns spectroscopy from photographing a spectrum into interrogating a single transition, but at room temperature the Doppler width buries the natural linewidth under a thousandfold-broader Gaussian. Saturated absorption and two-photon spectroscopy defeat the first-order Doppler shift by selecting the zero-velocity class or cancelling the shift between counter-propagating photons, recovering natural-width features. Laser-induced fluorescence pushes sensitivity to single atoms, and the optical frequency comb converts an optical frequency into a countable radio-frequency beat, giving absolute frequency measurement across the visible spectrum.\n",{"path":7382,"title":7383,"module":7375,"summary":7384},"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd","Reading Real Spectra with the NIST Database","Every quantity computed in this course — energy levels, transition frequencies, oscillator strengths, lifetimes — is tabulated for real atoms in the NIST Atomic Spectra Database. This lesson reads that data as physics: how levels are labelled by term symbols and energies in wavenumbers, how a transition list encodes wavelength, Einstein coefficient, and line strength, how a Grotrian diagram is reconstructed from the tables, and how a measured spectrum is matched to catalog lines. The residual between computed and tabulated positions is the running score of atomic theory.\n",{"path":7386,"title":7387,"module":7388,"summary":7389},"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler","Laser Cooling and Optical Molasses","Modern Atomic Physics","A near-resonant laser beam pushes an atom because every absorbed photon delivers one unit of momentum and the subsequent spontaneous emission averages to zero. Two counter-propagating red-detuned beams turn that push into friction: the Doppler shift brings a moving atom closer to resonance with the beam it moves against, so the net force opposes the velocity. Six beams give optical molasses in three dimensions. The random recoil of spontaneous emission heats against the friction, and the balance sets the Doppler cooling limit. Adding a magnetic-field gradient makes the force position-dependent as well, giving the magneto-optical trap.\n",{"path":7391,"title":7392,"module":7388,"summary":7393},"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping","Sub-Doppler Cooling and Atom Traps","Optical molasses cools multilevel atoms below the Doppler limit. A polarization gradient plus optical pumping makes an atom repeatedly climb a light-shift hill and be pumped to the valley, losing kinetic energy each cycle — Sisyphus cooling. The floor is the recoil limit, one photon momentum of residual motion. Below it, cooling must avoid scattering photons: conservative magnetic and optical-dipole traps hold the atoms while forced evaporation removes the hot tail, driving the phase-space density up toward quantum degeneracy.\n",{"path":7395,"title":7396,"module":7388,"summary":7397},"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation","Bose-Einstein Condensation of Atomic Gases","Below a critical temperature a gas of identical bosons places a macroscopic fraction of its atoms in the single lowest-energy state. The transition occurs when the thermal de Broglie wavelength grows to the interparticle spacing, so the phase- space density reaches order unity. The critical temperature follows from the Bose-Einstein distribution and the density of states, the condensate fraction grows as one minus (T\u002FTc) to the three-halves, and the condensate reveals itself in time-of-flight as a sharp bimodal peak in the momentum distribution. The 1995 rubidium and sodium experiments realized it in dilute trapped gases.\n",{"path":7399,"title":7400,"module":7388,"summary":7401},"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision","Optical Atomic Clocks and Precision Measurement","An atomic clock counts the oscillations of a field locked to an atomic transition. The cesium microwave standard defines the second through the 9.19 GHz ground-state hyperfine transition, interrogated by Ramsey's separated-oscillatory-field method whose fringe width is set by the free-precession time. Optical clocks replace the microwave transition with an optical one five orders of magnitude higher in frequency, raising the quality factor and the fractional stability in proportion. Lattice and single-ion clocks reach fractional uncertainties near ten-to-the-minus- eighteen by trapping the atoms at a magic wavelength that cancels the light shift, and at that level they measure the gravitational redshift over centimetres of height.\n",{"path":7403,"title":7404,"module":6,"summary":6},"\u002Fatomic-physics","Atomic Physics",{"path":7406,"title":7407,"module":6,"summary":6},"\u002Fdatabases","Databases",{"path":7409,"title":7410,"module":4995,"summary":7411},"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category","Categories, Objects, and Arrows","A category is objects, arrows between them, a rule for composing arrows, and an identity arrow on every object, subject to associativity and the unit laws. The axioms mention no elements: arrows need not be functions, and an object is known only through the arrows into and out of it. Isomorphism, commutative diagrams, duality, and the terminal object are the first consequences.\n",{"path":7413,"title":7414,"module":4995,"summary":7415},"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories","A Zoo of Categories","The axioms admit two very different kinds of model: large categories of structured sets and their structure-preserving maps (Set, Mon, Grp, Top, Vect), and small categories that are themselves single algebraic objects — a monoid as a one-object category, a poset as a thin category. The awkward cases Rel and Pfn have sets as objects but relations and partial functions as arrows, and a typed programming language presents its types and programs as a category.\n",{"path":7417,"title":7418,"module":4995,"summary":7419},"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms","Isomorphisms, Monos, and Epis","Injectivity and surjectivity mention elements, so a general category re-expresses them by cancellation: monomorphisms cancel on the left, epimorphisms on the right. Sections and retractions are the split versions with an explicit one-sided inverse. Mono plus epi does not force an isomorphism, and subobjects are equivalence classes of monos into a fixed object.\n",{"path":7421,"title":7422,"module":4995,"summary":7423},"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors","Functors: Maps Between Categories","A functor sends objects to objects and arrows to arrows while preserving composition and identities. Covariant and contravariant functors, the standard stock (forgetful, free, hom, and powerset), and the classification by faithfulness, fullness, and essential surjectivity all follow. Functors compose, so categories and functors form a category themselves.\n",{"path":7425,"title":7426,"module":4995,"summary":7427},"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations","Natural Transformations and Functor Categories","A natural transformation is a map between two parallel functors: one component arrow per object, subject to a commuting square for every arrow of the source. Naturality is verified for the determinant, the double dual, and list operations; functors and natural transformations form the functor category [C, D]; and vertical and horizontal composition satisfy the Godement interchange law.\n",{"path":7429,"title":7430,"module":4995,"summary":7431},"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory","Size: Small, Large, Locally Small","The objects of Set do not form a set, and pretending otherwise reproduces the classical paradoxes. Classes make the small\u002Flarge distinction precise, with locally small and essentially small as the intermediate notions. Cantor's theorem shows Set and its algebraic relatives are large, and the function-based axiomatization of sets is the one category theory prefers to ZFC.\n",{"path":7433,"title":7434,"module":7435,"summary":7436},"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties","Universal Properties, Initial and Terminal Objects","Universal Properties and Basic Constructions","A universal property characterizes an object by a for-all\u002Fexists-unique condition on the arrows into or out of it, and any two objects satisfying the same property are isomorphic by a unique isomorphism. Initial and terminal objects are the simplest cases; the free vector space, the discrete topology, and the ring of integers show the pattern at work.\n",{"path":7438,"title":7439,"module":7435,"summary":7440},"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts","Products and Coproducts","The product of two objects is a wedge of projections through which every other wedge factors uniquely; the coproduct is the dual, built from injections. In Set these are the cartesian product and the disjoint union, in a poset the meet and join, and in abelian groups the two coincide. The mediating-arrow discipline established here is the template for all limits.\n",{"path":7442,"title":7443,"module":7435,"summary":7444},"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories","Opposite, Product, Slice, and Comma Categories","Categories are themselves mathematical structures, and the standard algebraic constructions apply: opposites, products, subcategories, slices, and the comma category that subsumes them. The opposite category yields the duality principle, halving the subject's proofs; slice and comma categories repackage every universal property as an initial or terminal object.\n",{"path":7446,"title":7447,"module":7448,"summary":7449},"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors","Hom-Functors and Representables","Representables and the Yoneda Lemma","Fixing an object A of a locally small category produces a set-valued functor, the hom-functor A(A,-), that records every map out of A. A functor is representable when it is naturally isomorphic to such a hom-functor. We define the covariant and contravariant hom-functors, collect the standard representables (identity, forgetful, powerset), and read maps as generalized elements of varying shape.\n",{"path":7451,"title":7452,"module":7448,"summary":7453},"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma","The Yoneda Lemma","The Yoneda lemma computes the natural transformations out of a representable presheaf: they form a set in natural bijection with X(A). The proof fixes a single degree of freedom, the image of the identity arrow, and shows naturality forces everything else. We prove the bijection, verify naturality in both variables, and read off that a natural transformation out of a representable is just one element.\n",{"path":7455,"title":7456,"module":7448,"summary":7457},"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences","The Yoneda Embedding and Its Uses","Three corollaries turn the Yoneda lemma into working machinery. A representation of a presheaf is the same thing as a universal element; the Yoneda embedding of a category into its presheaf category is full and faithful; and two objects are isomorphic exactly when their representables are. Together they justify constructing arrows by constructing natural transformations between hom-functors, and they contain Cayley's theorem as the one-object case.\n",{"path":7459,"title":7460,"module":7461,"summary":7462},"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits","Cones and Limits","Limits and Colimits","A diagram is a functor from a small shape category; a cone over it is an object with compatible legs to every node; and a limit is the terminal cone, the one every other cone factors through uniquely. Products and terminal objects reappear as limits over particular shapes, and the whole construction is unique up to a single isomorphism.\n",{"path":7464,"title":7465,"module":7461,"summary":7466},"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks","Equalizers and Pullbacks","The equalizer of a parallel pair is the universal arrow that makes the two composites agree; the pullback of a cospan is the universal commutative square. In Set they are solution sets and fibered products, every equalizer is monic, monics are stable under pullback, and products plus equalizers together generate all limits.\n",{"path":7468,"title":7469,"module":7461,"summary":7470},"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits","Colimits: Coproducts, Coequalizers, Pushouts","Colimits are limits in the opposite category: cocones replace cones, and the universal cocone is initial rather than terminal. Coproducts glue objects side by side, coequalizers impose relations and produce quotients, pushouts glue along a shared part, and in Set every colimit is a quotient of a disjoint union. Directed colimits admit a clean elementwise description.\n",{"path":7472,"title":7473,"module":7461,"summary":7474},"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits","Computing Limits in Concrete Categories","In Set the limit of any diagram is the set of threads: choice functions through the nodes that commute with every edge. In Pos, Mon, and Top the recipe is the same limit downstairs plus the unique structure that makes the projections structure-preserving — pointwise order, componentwise operations, the topology generated by the projections. The pattern is what \"the forgetful functor creates limits\" means concretely.\n",{"path":7476,"title":7477,"module":7461,"summary":7478},"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors","Preservation, Reflection, and Creation of Limits","A functor preserves limits if it sends limit cones to limit cones, reflects them if it recognizes them, and creates them if limits downstairs lift uniquely upstairs. Representable functors preserve all limits, forgetful functors from algebra create them, and limits in functor categories are computed pointwise, one evaluation at a time.\n",{"path":7480,"title":7481,"module":7482,"summary":7483},"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions","Adjoint Functors via Hom-Set Bijections","Adjunctions","An adjunction is a natural bijection between two hom-sets: maps out of $F(A)$ in one category correspond to maps into $G(B)$ in the other. We give the definition, spell out the naturality axioms that make the correspondence compatible with composition, and work the flagship examples — free vector spaces, free groups, discrete and indiscrete topologies, and currying.\n",{"path":7485,"title":7486,"module":7482,"summary":7487},"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits","Units, Counits, and the Triangle Identities","The whole hom-set bijection of an adjunction is generated by two natural transformations: the unit, obtained by transposing identity maps on one side, and the counit, by transposing them on the other. Two triangle identities are all they must satisfy, and any pair satisfying them determines a unique adjunction. The same correspondence specializes to order-preserving maps between posets and to free constructions.\n",{"path":7489,"title":7490,"module":7482,"summary":7491},"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows","Adjunctions from Universal Arrows","The unit component at a single object is an initial object of a comma category, and this universal property alone rebuilds the whole adjunction. A functor has a left adjoint exactly when every object admits such a universal arrow, and the left adjoint is assembled from them one object at a time. We prove the equivalence of all three formulations of adjointness.\n",{"path":7493,"title":7494,"module":7482,"summary":7495},"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions","Free Constructions and Free–Forgetful Adjunctions","Free monoids, free groups, and free vector spaces are left adjoints to forgetful functors, and the universal mapping property is all one needs to prove it. Some forgetful functors also have right adjoints (co-free constructions like the indiscrete topology), producing three-functor chains. Contravariant adjunctions, symmetric in their two functors, close the lesson with the pattern behind duality and representation theorems.\n",{"path":7497,"title":7498,"module":7499,"summary":7500},"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints","Limits as Adjoints and as Representables","Adjoints, Representables, and Limits Together","A cone on a diagram is a natural transformation from a constant diagram, so a limit is a representation of the cone functor and, equivalently, a value of the right adjoint to the diagonal functor. We prove both rephrasings, derive uniqueness and functoriality of limits from them, and record the dual statement that a colimit is the left adjoint to the diagonal.\n",{"path":7502,"title":7503,"module":7499,"summary":7504},"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits","Limits and Colimits of Presheaves","Representables preserve limits, and limits in a functor category are computed one object at a time, so a presheaf category is complete and cocomplete with all its structure inherited pointwise from Set. The Yoneda embedding then preserves limits but not colimits, and the density theorem repairs the colimit side: every presheaf is a canonical colimit of representables.\n",{"path":7506,"title":7507,"module":7499,"summary":7508},"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits","Right Adjoints Preserve Limits (RAPL)","A functor with a left adjoint preserves every limit that exists, and dually a functor with a right adjoint preserves colimits. The proof is a four-line chain of natural isomorphisms through the adjunction and the continuity of representables. The theorem yields product-and-exponential arithmetic in Set, another proof that limits commute with limits, and a standard test for proving that a functor has no adjoint.\n",{"path":7510,"title":7511,"module":7499,"summary":7512},"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem","The Adjoint Functor Theorem","RAPL makes limit preservation necessary for having a left adjoint; the adjoint functor theorems identify when it is sufficient. For ordered sets no extra hypothesis is needed. In general the candidate adjoint is a limit over a comma category that may be large, and the general adjoint functor theorem tames it with a weakly initial set. We prove GAFT in full and apply it to free groups and, through the special adjoint functor theorem, the Stone–Čech compactification.\n",{"path":7514,"title":7515,"module":7516,"summary":7517},"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads","Monads from Adjunctions","Monads and Algebras","A monad on a category is an endofunctor equipped with a unit and a multiplication satisfying associativity and unit laws — the data of a monoid, written internally to the category of endofunctors. Every adjunction induces one, and the list, exception, and state constructions that model computational effects are all monads on Set.\n",{"path":7519,"title":7520,"module":7516,"summary":7521},"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore","Algebras for a Monad","An algebra for a monad is an object with a structure map that interacts correctly with the unit and multiplication. The algebras form the Eilenberg–Moore category, whose free–forgetful adjunction induces the monad back; a comparison functor relates any other inducing adjunction to it, and for the list monad the algebras are exactly monoids.\n",{"path":7523,"title":7524,"module":7516,"summary":7525},"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming","The Kleisli Category and Monads in Programming","The Kleisli category of a monad has the same objects as the base but takes arrows A to TB, composed by mapping and flattening. These arrows are effectful programs, Kleisli composition is the bind of functional programming, and the Kleisli adjunction is the initial resolution of the monad, with Eilenberg–Moore at the terminal end.\n",{"path":7527,"title":7528,"module":7516,"summary":7529},"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors","Algebras for an Endofunctor and Recursion","Dropping the monad laws leaves algebras for a bare endofunctor, whose initial objects are the least fixed points of the functor by Lambek's lemma. The natural numbers, lists, and trees are initial algebras; the unique map out of an initial algebra is the fold of functional programming; and the Smyth–Plotkin fixed-point technique builds Scott domains the same way.\n",{"path":7531,"title":7532,"module":7533,"summary":7534},"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories","Cartesian Closed Categories","Cartesian Closed Categories and Typed Lambda Calculus","A cartesian closed category has a terminal object, binary products, and for every pair of objects an exponential object that internalizes the hom-set as an object of the category. The defining data is an evaluation arrow and a currying operation, packaged by the adjunction between product-with-A and exponential-by-A. Set, Boolean and Heyting algebras, functor categories, and Cat are all cartesian closed.\n",{"path":7536,"title":7537,"module":7533,"summary":7538},"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence","Typed Lambda Calculus and CCCs","The typed lambda calculus and the cartesian closed category are two presentations of the same theory. Types become objects, terms with one free variable become arrows, product types become products, and function types become exponentials, with abstraction matching currying and application matching evaluation. Building the category of a lambda theory and the internal language of a category are mutually inverse up to equivalence.\n",{"path":7540,"title":7541,"module":7533,"summary":7542},"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion","Fixed Points in Cartesian Closed Categories","The untyped lambda calculus has a fixed-point combinator; the typed calculus cannot, and Lawvere's fixed-point theorem explains why: any point-surjection onto an exponential forces every endomap to have a fixed point, which is the abstract form of Cantor's diagonal argument. Recursion is recovered instead by restricting to omega-complete partially ordered objects, where every continuous endomap has a least fixed point built by iterating from bottom. This gives While loops a semantics.\n",{"path":7544,"title":7545,"module":6,"summary":6},"\u002Fcategory-theory","Category Theory",{"path":7547,"title":6189,"module":7548,"summary":7549},"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning","Mathematical Background","Every quantity a network touches is a tensor, and every layer is a matrix acting on one. This lesson compiles the linear algebra deep learning actually uses: products and norms, the system $Ax=b$ and when it is solvable, the two decompositions (eigen and SVD) that diagonalize a transformation, and the pseudoinverse that solves what cannot be solved exactly. It then derives PCA as the worked example that ties it all together.\n",{"path":7551,"title":7552,"module":7548,"summary":7553},"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory","Probability & Information Theory","This lesson assembles the probabilistic vocabulary a network is trained in (random variables, densities, the chain rule, expectation and covariance, the handful of distributions that recur everywhere) and then the information theory that turns a probabilistic model into a loss: self-information, entropy, and the KL divergence whose asymmetry is the cross-entropy objective itself.\n",{"path":7555,"title":7556,"module":7548,"summary":7557},"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation","Numerical Computation","Machine learning runs on finite-precision arithmetic, where every number is approximated and every operation rounds. This lesson sets the numerical ground rules: overflow and underflow and the standard stabilizations, the condition number that measures how much a problem amplifies error, and the gradient-based optimization (first and second order, constrained and unconstrained) that every training loop runs.\n",{"path":7559,"title":5548,"module":7548,"summary":7560},"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus","This lesson assembles the differential calculus used in training networks: the gradient and directional derivative, the Jacobian and Hessian, and the chain rule in scalar, vector, and matrix form. From the chain rule it derives back-propagation as a single sweep over the computational graph, tabulates the matrix-calculus identities that recur in layer gradients, reads optimization off a second-order Taylor expansion, and ends with why reverse-mode automatic differentiation is the algorithm every framework runs.\n",{"path":7562,"title":7563,"module":4995,"summary":7564},"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning","What Is Deep Learning?","Deep learning is representation learning by composition: stack simple differentiable layers, define a loss, and let gradient descent discover the features a human would otherwise have to engineer by hand. We set up the whole vocabulary (model, loss, optimizer, data), the training loop that ties them together, and the three reasons the approach became practical.\n",{"path":7566,"title":7567,"module":4995,"summary":7568},"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher","A Machine-Learning Refresher","The statistical framework the networks live in: data drawn from an unknown distribution, a loss to minimize, and the central question of generalization: will it work on data we have not seen? We set up empirical risk, capacity, the bias–variance tradeoff, and maximum likelihood.\n",{"path":7570,"title":7571,"module":4995,"summary":7572},"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron","Linear Models & the Perceptron","The simplest learners (linear regression, logistic regression, the perceptron) already contain the whole template: a weighted sum, a loss, a gradient step. They also fail on the XOR problem, which no linear model can solve — the limitation that motivates deep learning.\n",{"path":7574,"title":7575,"module":7576,"summary":7577},"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron","The Multilayer Perceptron","Neural Networks","Stacking linear layers with a nonlinearity between them removes the limitation that stopped the perceptron. We build the multilayer perceptron in explicit matrix form (the forward pass, its dimensions, a worked XOR network with concrete weights) and prove why the nonlinearity is essential: without it the deepest stack collapses to a single hyperplane.\n",{"path":7579,"title":7580,"module":7576,"summary":7581},"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions","Activation Functions","The activation is the only nonlinear part of a layer, and the reason depth adds expressive power. We catalog the standard hidden units (sigmoid, tanh, ReLU and its descendants, plus GELU, softplus, swish and maxout), derive each unit's derivative in full, make the vanishing-gradient problem quantitative with the chain-rule product, work numeric examples, and explain why the saturating units gave way to ReLU and why ReLU's own dead-unit failure gave way to Leaky\u002FPReLU\u002FELU\u002FGELU.\n",{"path":7583,"title":7584,"module":7576,"summary":7585},"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation","Universal Approximation","One hidden layer with a non-polynomial activation can approximate any continuous function on a compact set to arbitrary accuracy: the universal approximation theorem. We prove it constructively (two sigmoids make a bump; sums of bumps make any curve), then show the limitation: existence is not efficiency. Depth-separation results exhibit functions a deep net represents with $O(n)$ units that a shallow net needs $\\exp(n)$ units to match.\n",{"path":7587,"title":7588,"module":7576,"summary":7589},"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation","Backpropagation","Backpropagation is the chain rule run backward over a computational graph. We formalize the graph, derive the four backprop equations for an MLP, present the forward and backward passes as algorithms, and work a tiny two-layer net by hand with explicit numbers. The result: one scalar loss, reverse-mode autodiff, and a gradient for every parameter at twice the cost of a forward pass.\n",{"path":7591,"title":7592,"module":7576,"summary":7593},"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units","Loss Functions & Output Units","The last layer is where a network's hidden representation meets the task. Choosing an output unit and a loss is not two independent choices; maximum likelihood fixes the pair. We derive the standard couplings (linear\u002FMSE, sigmoid\u002FBCE, softmax\u002Fcross-entropy), show why softmax and cross-entropy were built to cancel into the residual $\\hat y - y$, and prove why squared error is the wrong loss for a saturating classifier.\n",{"path":7595,"title":7596,"module":7597,"summary":7598},"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd","Gradient Descent & SGD","Optimization","Training is descent on the empirical risk: step the parameters against the gradient. We derive the minibatch gradient as an unbiased estimator whose variance falls as $1\u002FB$, derive the learning-rate ceiling from the smoothness-stability bound $\\eta \u003C 2\u002FL$, and lay out the schedules (step, exponential, cosine, warmup) that anneal it over training.\n",{"path":7600,"title":7601,"module":7597,"summary":7602},"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods","Momentum & Adaptive Methods","Plain gradient descent zig-zags across ravines and moves slowly along flat valleys, because one global learning rate cannot suit a surface with wildly different curvature in different directions. Two fixes address the two problems: momentum accumulates a velocity that damps the oscillation and accelerates the drift, and adaptive methods give every parameter its own learning rate scaled by the history of its gradients. Adam fuses both, and is the default optimizer of modern deep learning.\n",{"path":7604,"title":7605,"module":7597,"summary":7606},"\u002Fdeep-learning\u002Foptimization\u002Finitialization","Weight Initialization","The initial weights determine whether training can succeed before the first gradient step. Initialize every weight equal and all hidden units compute the same function forever; initialize too small or too large and the signal vanishes or explodes as it crosses depth. A single variance condition, $n_{\\text{in}}\\mathrm{Var}(W)=1$, fixes both, and reading it off the forward and backward passes yields Xavier and He initialization directly.\n",{"path":7608,"title":7609,"module":7597,"summary":7610},"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape","The Optimization Landscape","The loss of a deep network is a non-convex surface in millions of dimensions, so local search carries no global guarantee, yet it works. We classify critical points by the eigenvalues of the Hessian, show that in high dimension nearly all of them are saddle points rather than bad local minima, and read off the practical terrain — plateaus, cliffs, ill-conditioning, and the sharp-versus-flat distinction that ties the geometry of a minimum to how well it generalizes.\n",{"path":7612,"title":7613,"module":7597,"summary":7614},"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods","Second-Order & Approximate Methods","Newton's method reads the curvature of the loss off its Hessian and jumps to the minimum of the local quadratic in a single step, rescaling away the ill-conditioning that slows first-order descent. We derive it, then explain the three obstacles that keep it out of deep learning: a $d \\times d$ Hessian for $d$ in the billions, an attraction to saddle points, and minibatch noise. The alternative is approximation (conjugate gradients, BFGS and L-BFGS, the natural gradient and Hessian-free methods), each buying some of Newton's curvature information without ever forming or inverting $H$.\n",{"path":7616,"title":7617,"module":7618,"summary":7619},"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview","Regularization Overview","Regularization","Regularization is any modification to a learning algorithm meant to lower test error at the possible expense of training error. We derive the bias–variance decomposition that explains why it helps, set up the two parameter-norm penalties, $L^2$ weight decay and $L^1$, derive their update rules and eigenbasis shrinkage, show geometrically why $L^1$ alone produces sparse weights (soft-thresholding), distinguish weight decay from loss-added $L^2$ under AdamW, and read both penalties through the two lenses that recur across the chapter: a norm-ball constraint via KKT, and a prior via MAP estimation.\n",{"path":7621,"title":7622,"module":7618,"summary":7623},"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation","Dropout & Data Augmentation","Two of the most effective regularizers add no penalty term at all; they perturb the computation instead. Dropout multiplies hidden units by a random Bernoulli mask, training an exponential ensemble of thinned subnetworks that share weights; inverted scaling collapses that ensemble into one cheap forward pass at test time. Data augmentation enlarges the training set with label-preserving transforms, injecting the invariances the task demands, and noise injection (input, weight, label smoothing, Mixup) generalizes the same idea into a continuous family.\n",{"path":7625,"title":7626,"module":7618,"summary":7627},"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing","Early Stopping & Parameter Sharing","Two cheap regularizers that cost no extra term in the loss. Early stopping treats training time itself as a hyperparameter (watch the validation curve, halt at its minimum, keep the best checkpoint), and for a quadratic objective it is provably equivalent to $L^2$ weight decay. Parameter sharing goes the other way: it constrains many weights to be _equal_, the prior behind every convolution and every recurrent step, and the reason a CNN has orders of magnitude fewer parameters than the dense net it replaces.\n",{"path":7629,"title":7630,"module":7618,"summary":7631},"\u002Fdeep-learning\u002Fregularization\u002Fnormalization","Normalization","Normalization layers standardize activations to zero mean and unit variance inside the network, then hand the model a learnable scale and shift to undo the constraint when it pays to. Batch normalization does this across the batch and must keep separate train-time and test-time statistics; layer, instance, and group norm change only the axes they average over. The result is faster, better-conditioned optimization and a free dose of regularizing batch noise.\n",{"path":7633,"title":7634,"module":7635,"summary":7636},"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks","Convolutional Networks","Architectures","A convolutional network replaces the dense layer's all-to-all weight matrix with a small kernel slid across the input. Three structural commitments (sparse connectivity, parameter sharing, and translation equivariance) collapse the parameter count by orders of magnitude and bake the right prior for images directly into the architecture. We derive the convolution arithmetic, the output geometry, pooling, and the receptive field, then assemble the canonical stack.\n",{"path":7638,"title":7639,"module":7635,"summary":7640},"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures","CNN Architectures","Six landmark networks, each contributing exactly one idea: LeNet's conv-pool stack, AlexNet's ReLU-and-dropout scale, VGG's $3\\times3$ uniformity, Inception's multi-scale module, ResNet's residual skip, and DenseNet's dense connectivity. The common thread is the degradation problem (why plain deeper nets train worse, not just overfit) and the residual block that solved it by keeping a $+1$ path open for the gradient.\n",{"path":7642,"title":7643,"module":7635,"summary":7644},"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks","Recurrent Networks","A recurrent network folds a sequence into a fixed-size hidden state, reusing one set of weights at every time step, the architectural prior that the same rule applies wherever it lands in time. Unrolling the recurrence exposes a deep feed-forward graph; backpropagation through it sums gradient contributions across all steps and chains a product of Jacobians, and that product is why long-range gradients vanish or explode. That failure motivates gated architectures.\n",{"path":7646,"title":7647,"module":7635,"summary":7648},"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru","LSTM & GRU","A plain recurrent network propagates its hidden state through a repeated weight-matrix multiply, and the Jacobian product that results vanishes or explodes long before a useful gradient can reach the early steps. Gated RNNs fix this with an additive memory path: a cell state that is carried forward almost unchanged, past which the gradient flows along a near-identity highway. We derive that highway, give the full LSTM and GRU equations, and compare the two.\n",{"path":7650,"title":7651,"module":7635,"summary":7652},"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers","Attention & Transformers","Attention replaces fixed wiring with content-based routing: every position reads from every other through a soft, learned dot-product lookup. We derive scaled dot-product attention and its $\\sqrt{d_k}$ correction, build it into multi-head self-attention, inject order with positional encodings, and stack the whole thing into the Transformer block that displaced recurrence and convolution alike.\n",{"path":7654,"title":7655,"module":7635,"summary":7656},"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture","The Transformer Architecture","The Transformer is the architecture built around the attention mechanism. This first part assembles the full encoder–decoder of \"Attention Is All You Need\" — embeddings and positional encoding, stacked self-attention and feed-forward sublayers wrapped in residual connections and LayerNorm, masked decoding and cross-attention — works through causal masking and the three modern families (encoder-only, decoder-only, encoder–decoder), and accounts for where the parameters and the $O(n^2)$ compute actually go.\n",{"path":7658,"title":7659,"module":7635,"summary":7660},"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice","Transformers in Practice","The Transformer makes no assumption about what a token represents. This part follows the architecture out of language: image patches feed a plain encoder (the Vision Transformer), the decoder-only half scales into the GPT line of large language models, and one substrate covers translation, retrieval, and multimodal grounding. We work the ViT patch arithmetic and a GPT parameter count by hand, then close on the empirical scaling laws — power-law loss, the Chinchilla compute-optimal balance, and emergent behavior — that made scale the dominant lever.\n",{"path":7662,"title":7663,"module":7635,"summary":7664},"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks","Graph Neural Networks","A graph neural network learns on data with no grid and no canonical ordering: atoms in a molecule, users in a social network, road segments in a map. The unifying idea is message passing — each node repeatedly aggregates its neighbors' states and updates its own — built to respect the one symmetry graphs demand, permutation equivariance. We derive the message-passing framework, specialize it into GCN, GraphSAGE, GAT, and GIN, read off graph-level outputs, and bound what message passing can and cannot tell apart.\n",{"path":7666,"title":7667,"module":7635,"summary":7668},"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models","State-Space Models and Mamba","A state-space model carries a continuous linear hidden state through a sequence, and that linearity buys two equivalent algorithms from one set of weights: a recurrence that runs in linear time with constant memory, and a global convolution that trains in parallel. Long-range memory comes from how the transition matrix is initialized (HiPPO) and parameterized (S4's diagonal-plus-low-rank form). Mamba breaks the convolution on purpose, making the parameters input-dependent so the model can select what to remember, recovered at speed by a hardware-aware parallel scan.\n",{"path":7670,"title":7671,"module":7672,"summary":7673},"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory","Generalization Theory","Theory & Frontiers","Classical learning theory bounds the gap between training and test error by a model's capacity (VC dimension, Rademacher complexity), and predicts that a model with more parameters than data should overfit catastrophically. Modern networks do the opposite: they interpolate, even fit pure noise, and still generalize. We derive the classical bounds, work the bias-variance decomposition, show why the bounds go vacuous, and survey what replaced them: double descent, the interpolation threshold, margin and norm-based bounds, and the implicit bias of the optimizer itself.\n",{"path":7675,"title":7676,"module":7672,"summary":7677},"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness","Adversarial Robustness","A trained network can be fooled by a perturbation too small for a human to see: add a carefully aimed vector of magnitude $\\epsilon$ to a correctly classified image and the prediction flips. We derive the fast gradient sign method as the first-order-optimal step inside an $L_\\infty$ ball, explain the linearity hypothesis that makes high-dimensional models so easy to push around, build up to projected gradient descent, and frame adversarial training as a min-max robust-optimization problem with its own accuracy cost. Defenses beyond training continue in the next lesson.\n",{"path":7679,"title":7680,"module":7672,"summary":7681},"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses","Adversarial Defenses","Defending a network against an adversary is far harder than attacking one. This lesson covers the defense side: certified guarantees via randomized smoothing, the transferability that makes black-box attacks possible, and the recurring failure of gradient masking, where a defense hides the attacker's gradient instead of moving the decision boundary. It ends with the adaptive-attack discipline (BPDA, EOT, transfer) that every robustness claim must be tested against.\n",{"path":7683,"title":7684,"module":7672,"summary":7685},"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods","Bayesian & Ensemble Methods","A trained network returns a single point prediction and, with the softmax, a confidence, but that confidence is usually miscalibrated, collapsing to near- certainty even on inputs the model has never seen. This lesson covers uncertainty estimation for networks: the two kinds of uncertainty, the Bayesian posterior over weights and its tractable stand-ins (MC dropout, deep ensembles), and how to check whether a model's reported confidences match observed frequencies.\n",{"path":7687,"title":7688,"module":7672,"summary":7689},"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models","Deep Equilibrium Models","A deep network need not be a fixed stack of layers; it can be a single weight-tied layer iterated to convergence, its output defined implicitly as the fixed point $z^\\star = f_\\theta(z^\\star, x)$. The forward pass becomes root-finding and the backward pass becomes implicit differentiation, so training costs O(1) memory regardless of effective depth. We derive both passes from the implicit function theorem and close the course on defining a layer by a fixed-point condition rather than an explicit stack.\n",{"path":7691,"title":7692,"module":7693,"summary":7694},"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models","Linear Factor Models","Generative Models","The simplest generative models share one template: a latent variable drawn from a fixed prior, run through a linear decoder, plus noise. Probabilistic PCA, factor analysis, independent component analysis, and sparse coding are all this template with a different prior on the latents and a different noise model. We derive each marginal, see why ICA needs non-Gaussianity to identify its sources, and show how sparse coding learns Gabor-like dictionary atoms.\n",{"path":7696,"title":7697,"module":7693,"summary":7698},"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders","Autoencoders","An autoencoder is a network trained to copy its input to its output through a narrow channel; the useful product is the bottleneck representation $h$, not the reconstruction. We derive the undercomplete autoencoder and prove its linear case recovers PCA, then trade the bottleneck for explicit regularization (sparse, denoising, contractive) and show how a denoising autoencoder learns the low-dimensional manifold the data lives on.\n",{"path":7700,"title":7701,"module":7693,"summary":7702},"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders","Variational Autoencoders","An autoencoder compresses, but its latent space has gaps: sample a point between two encodings and the decoder produces noise. The variational autoencoder fixes this by training a probabilistic encoder against a prior, so the latent space becomes a smooth, samplable density. We derive the evidence lower bound it maximizes, the reparameterization trick that lets gradients flow through a random sample, and the closed-form Gaussian regularizer that pulls the posterior toward the prior.\n",{"path":7704,"title":7705,"module":7693,"summary":7706},"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks","Generative Adversarial Networks","A generative adversarial network trains two networks against each other: a generator that turns noise into samples, and a discriminator that tries to tell real data from forgeries. The game has a clean theory: the optimal discriminator is a likelihood ratio, and at equilibrium the generator minimizes the Jensen–Shannon divergence to the data, with a global optimum exactly when its distribution matches the data. We derive that result, fix the saturating loss that breaks training, and catalogue the failure modes (mode collapse, instability, vanishing gradients) and the architectural fixes.\n",{"path":7708,"title":7709,"module":7693,"summary":7710},"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows","Autoregressive Models & Normalizing Flows","Two families that provide exact likelihoods, each at a cost. Autoregressive models factor the joint by the probability chain rule and learn each conditional with a masked network: exact $\\log p(x)$, but sampling proceeds one coordinate at a time. Normalizing flows push a simple base density through an invertible map and read $\\log p(x)$ off the change-of-variables formula, trading architectural freedom for a cheap Jacobian determinant via triangular coupling layers.\n",{"path":7712,"title":7713,"module":7693,"summary":7714},"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines","Energy-Based & Boltzmann Machines","Energy-based models replace an explicit density with a scalar energy and a Boltzmann normalization, $p(x) = e^{-E(x)}\u002FZ$: simple to specify, but with an intractable partition function $Z$. The Boltzmann machine and its restricted variant make the energy bilinear so the hidden units factorize, and contrastive divergence sidesteps $Z$ by replacing the model expectation with a few Gibbs steps started at the data. We close on the undirected deep models (DBNs and DBMs) and how they differ from the directed VAE.\n",{"path":7716,"title":7717,"module":7693,"summary":7718},"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models","Diffusion and Score-Based Models","Corrupt a data point with Gaussian noise in small steps until only noise remains, then train a network to undo one step at a time. We derive the forward process and its closed-form marginal, reduce the variational bound to the single noise-prediction objective that makes diffusion trainable, and show the score-matching view that unifies it with Langevin sampling and the continuous SDE. The lesson closes with DDIM fast sampling, classifier-free guidance, and the latent diffusion that powers modern text-to-image systems.\n",{"path":7720,"title":7721,"module":7722,"summary":7723},"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models","Structured Probabilistic Models","Probabilistic Methods","A joint distribution over $n$ variables is a table with exponentially many entries; nobody can store it, fit it, or sample from it directly. Structure fixes this: a graph whose missing edges encode conditional independencies that factor the joint into small local pieces. We build the two dialects, directed (Bayesian networks) and undirected (Markov random fields), read independence off the graph, and connect the machinery to the latent-variable and energy-based models that power deep generative learning.\n",{"path":7725,"title":7726,"module":7722,"summary":7727},"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc","Monte Carlo & MCMC","Most quantities of interest in a probabilistic model are integrals nobody can compute in closed form: expectations, marginals, partition functions. Monte Carlo replaces the integral with an average over samples; importance sampling reweights samples from a tractable proposal; and when even sampling the target is hard, Markov-chain Monte Carlo builds a chain whose stationary distribution _is_ the target. We derive Metropolis–Hastings and Gibbs, analyze mixing, and close on the partition-function gradient that powers energy-based learning.\n",{"path":7729,"title":7730,"module":7722,"summary":7731},"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference","Approximate Inference","In a latent-variable model the quantity we need, the posterior $p(h\\mid v)$ over hidden causes, is almost never computable, because its normalizer is an intractable sum over configurations. Approximate inference reframes the problem as optimization: maximize the evidence lower bound, a tractable functional whose gap to the true log-evidence equals a KL divergence. From that single bound fall expectation–maximization, mean-field variational inference, MAP, and the learned encoders behind variational autoencoders.\n",{"path":7733,"title":7734,"module":7735,"summary":7736},"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology","Practical Methodology","Practical Deep Learning","Knowing the algorithms is half the job; the other half is a disciplined loop. Fix a goal and a metric, stand up an end-to-end baseline, then read the train\u002Fvalidation gap to decide whether the next move is more data or a bigger model. We detail that loop: choosing metrics under class imbalance, default baselines by data type, extrapolating the data a target needs, and guarding the data pipeline against the leaks and label bugs that corrupt every gradient. Hyperparameter tuning, debugging, and deployment continue in the sequel.\n",{"path":7738,"title":7739,"module":7735,"summary":7740},"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging","Hyperparameters & Debugging","The tuning half of the methodology loop. The learning rate is the one hyperparameter that dominates, so we tune it first, on a log scale, coarse to fine, and prefer random search to grid when only a few dials matter. Then an ordered debugging playbook — overfit one batch, check the loss at initialization against ln C, watch the gradient norm, gradient-check against centered finite differences — and, after launch, monitoring for train-test skew and distribution drift with confidence-based abstention.\n",{"path":7742,"title":7743,"module":7735,"summary":7744},"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning","Representation Learning","A good representation makes a hard task easy by changing coordinates: it disentangles the factors of variation, spends its bits as a distributed code, and respects the low-dimensional manifold the data lives on. We make those three properties precise, recover the manifold hypothesis, and close on the first method that turned them into training practice — greedy layer-wise unsupervised pretraining — before the sequel picks up how the field learned to reuse those features.\n",{"path":7746,"title":7747,"module":7735,"summary":7748},"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning","Transfer Learning","A representation learned once can be reused everywhere. We cover the main mechanisms of reuse: feature extraction versus fine-tuning, the generic-to-specific gradient of features that sets the freeze boundary, the learning-rate discipline that keeps borrowed weights from being erased, domain adaptation when only the input distribution shifts, and the modern arc from supervised transfer to self-supervised foundation models.\n",{"path":7750,"title":7751,"module":7735,"summary":7752},"\u002Fdeep-learning\u002Fpractical\u002Fapplications","Applications","We survey large-scale training (the hardware, the two axes of parallelism, mixed precision, and the compression tricks that shrink a model after it is trained), then specialize the same gradient loop to vision, language, speech, and recommendation. Each domain is a different prior bolted onto one optimizer: convolutional invariance for pixels, distributed word vectors for tokens, sequence transduction for audio, low-rank factorization for the user–item matrix.\n",{"path":7754,"title":7755,"module":7735,"summary":7756},"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation","Model Compression and Distillation","A trained network and a deployable one are rarely the same object. This lesson is the toolkit for closing that gap: knowledge distillation transfers a large teacher's soft, information-rich logits into a small student; pruning deletes the weights that contribute least; quantization swaps 32-bit floats for 8- or 4-bit integers; and low-rank factorization replaces a fat matrix with two thin ones. We derive each method, show what it costs in accuracy, and lay out which combinations win on which hardware.\n",{"path":7758,"title":7759,"module":7735,"summary":7760},"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot","Meta-Learning and Few-Shot Learning","A deep network trained on one example per class overfits. Meta-learning targets this few-shot regime by training across a distribution of tasks so that a new task is learnable from a handful of examples. We formalize the $N$-way $K$-shot episode, then derive the two dominant families: metric methods that learn an embedding where distance classifies (Prototypical Networks), and optimization methods that learn an initialization a few gradient steps can adapt (MAML). We close on the link to transfer learning and to the in-context few-shot behavior of large language models.\n",{"path":7762,"title":7763,"module":7764,"summary":7765},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models","Large Language Models","Large Models & Agents","A large language model is a decoder-only Transformer trained on one objective, next-token prediction, then scaled until new behavior appears. This first part builds the object itself: the equivalence between next-token prediction and lossless compression, subword tokenization (BPE, WordPiece, Unigram, SentencePiece) worked on a real sentence, the four pretraining objectives and the attention masks that distinguish them, and the three model families (encoder-only, decoder-only, encoder--decoder) with their parameter budgets. Scaling, decoding, the KV cache, and alignment continue in part two.\n",{"path":7767,"title":7768,"module":7764,"summary":7769},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment","Scaling, Inference, and Alignment of Language Models","Once a language model is built, three questions remain: how does it improve as it grows, how is it decoded and served affordably, and how is a raw next-token predictor turned into an assistant. We derive the Kaplan power laws and the Chinchilla compute-optimal balance, trace emergent abilities and in-context learning, catalog the decoding strategies from greedy to nucleus sampling, work the KV cache that makes generation quadratic instead of cubic, cover parameter-efficient adaptation by low-rank updates (LoRA), and close on the alignment stack: instruction tuning, RLHF, and DPO.\n",{"path":7771,"title":7772,"module":7764,"summary":7773},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart","Denoising Sequence-to-Sequence Pretraining: BART","BERT corrupts and reconstructs; GPT predicts the next token. Sequence-to-sequence pretraining unifies both by training a full encoder–decoder as a denoising autoencoder: corrupt the text with a noise function, then reconstruct the original through a bidirectional encoder and an autoregressive decoder. This first part derives the denoising objective, catalogs BART's five noise functions (with a worked Poisson-infilling budget), proves BART specializes to both BERT and GPT, and traces a dimension-annotated forward pass through its encoder--decoder. T5, PEGASUS, fine-tuning, and decoding continue in part two.\n",{"path":7775,"title":7776,"module":7764,"summary":7777},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation","Text-to-Text Transfer and Conditional Generation","BART reconstructs a corrupted document; T5 pushes the same denoising idea into a single interface where every task is a string-to-string map. This second part covers T5's span corruption with sentinel tokens (with a worked token budget), PEGASUS's summarization-matched gap sentences and the MASS midpoint, supervised fine-tuning and beam-search decoding with a length penalty, the exposure-bias failure modes of autoregressive decoding, and a theorem showing why a bidirectional encoder--decoder strictly dominates a decoder-only model when the output is conditioned on a full input.\n",{"path":7779,"title":7780,"module":7764,"summary":7781},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models","Speech Recognition: Front-Ends and Alignment","Speech is a long, high-rate sequence whose label is short and unaligned, so the whole subject turns on bridging that mismatch. This first part builds the spectral front-ends that compress a waveform into frames (STFT, mel spectrogram, MFCC, with a worked frame-count), derives CTC's marginalization over alignments and its forward-backward recursion with a two-frame numeric example, and contrasts it with attention-based seq2seq (LAS) and the RNN transducer. Self-supervised and weakly-supervised models, and text-to-speech, continue in part two.\n",{"path":7783,"title":7784,"module":7764,"summary":7785},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis","Self-Supervised Speech Models and Synthesis","The recognition front-ends and alignment losses of part one all need transcribed audio, which is scarce. This second part removes that dependence: wav2vec 2.0 learns speech representations from unlabeled audio by a masked contrastive objective, HuBERT swaps the contrast for masked prediction of clustered units, and Whisper trades curation for scale with weakly-supervised web audio and a multitask token interface. We close with text-to-speech (the same length mismatch run backwards) and a tour of speech foundation models, discrete audio codecs, and neural TTS.\n",{"path":7787,"title":7788,"module":7764,"summary":7789},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents","AI Agents: Tools and Reasoning","A language model that only emits text is a function from prompt to prompt; an agent closes the loop, letting that model act on an environment, read back the result, and decide again. This first part formalizes the agent as a policy over interaction histories, builds out tool calling and the executor trust boundary, the ReAct interleaving of reasoning and action (with concrete traces), and search over thoughts: chain-of-thought, self-consistency, least-to-most, and Tree of Thoughts. Memory, retrieval, reflection, and multi-agent orchestration continue in part two.\n",{"path":7791,"title":7792,"module":7764,"summary":7793},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration","Agent Memory, Retrieval, and Orchestration","An agent's reasoning and tool use only matter if it can remember what it learned and coordinate work larger than one context window. This second part builds the systems around the loop: short-term scratchpad versus long-term vector store, retrieval-augmented generation with a worked softmax over passage scores, reflection (Reflexion, Self-Refine), and multi-agent orchestration. It closes on the failure modes that bound agents — invalid tool calls, horizon-error compounding, context overflow, non-terminating loops — and the benchmarks that score the full loop.\n",{"path":7795,"title":7796,"module":7764,"summary":7797},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts","Mixture-of-Experts","A mixture-of-experts layer replaces one feed-forward network with many and a router that sends each token to only a few of them, so the parameter count and the per-token compute become separate dials. We derive the gated output, sparse top-$k$ routing softmax, the load-balancing loss that stops the router from collapsing onto a single expert, and expert\u002Ftoken capacity with dropping, then work the dimension-annotated tensor shapes and FLOP arithmetic. We trace the architectures from the sparsely-gated LSTM through GShard, Switch Transformer, and Mixtral, cover distributed expert parallelism, and close on the training dynamics, failure modes, and serving costs of a sparse model.\n",{"path":7799,"title":7800,"module":7764,"summary":7801},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models","Multimodal Contrastive Learning","A multimodal model places images, text, and audio in one representation space, so a picture and its caption land close together. This first part builds the contrastive route: the shared embedding space and its residual modality gap, the Vision Transformer image encoder (patch embedding, CLS token, position embeddings, with shapes), the symmetric InfoNCE loss that trains the CLIP dual encoder from a batch similarity matrix (with a worked numeric step), and zero-shot classification as a softmax over class-prompt embeddings. Fusion and vision-language models continue in part two.\n",{"path":7803,"title":7804,"module":7764,"summary":7805},"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models","Fusion and Vision-Language Models","A contrastive model compares modalities but never lets one read another. This second part builds the fusion route: early, late, and cross-attention fusion, then the three designs that connect a frozen vision encoder to a frozen language model — Flamingo's zero-initialized gated cross-attention, BLIP-2's Q-Former, and LLaVA's linear projector. We work the token-budget arithmetic that separates them, name the object-hallucination and fine-detail failure modes, cover the contrastive-then- instruction-tune recipe and its retrieval\u002Fcaptioning\u002FVQA benchmarks, and close on natively multimodal models.\n",{"path":7807,"title":7808,"module":7809,"summary":7810},"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning","Foundations of Reinforcement Learning","Reinforcement Learning","Reinforcement learning is the third paradigm: an agent learns to act by interacting with an environment that returns rewards, not labels. We formalize the interaction as a Markov decision process, define the value functions that rank states and actions, and derive the Bellman expectation and optimality equations that every method downstream solves. Dynamic programming gives the exact answer when the model is known, and its convergence rests on a single fact: the Bellman operator is a contraction.\n",{"path":7812,"title":7813,"module":7809,"summary":7814},"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control","Model-Free Prediction and Control","When the dynamics are unknown, an agent cannot plan against a model; it must learn directly from sampled experience. We build prediction and control from two estimators of the same return: Monte Carlo averages whole episodes, while temporal-difference learning bootstraps from its own next estimate. We trace the bias-variance contrast between them, derive SARSA and Q-learning as the on-policy and off-policy forms of control, unify everything through n-step returns and eligibility traces, and close on the deadly triad that makes off-policy bootstrapping with function approximation diverge.\n",{"path":7816,"title":7817,"module":7809,"summary":7818},"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks","Deep Q-Networks","A Deep Q-Network replaces the tabular action-value function with a neural approximator $Q(s,a;\\theta)$ and trains it by regression toward a bootstrapped target. Naive online Q-learning with a network diverges, so DQN adds two stabilizers: an experience-replay buffer that decorrelates samples, and a periodically-frozen target network that holds the regression target still. We derive the loss, give the full algorithm and the Atari pipeline, and then layer on Double DQN, the dueling split, prioritized replay, and the Rainbow combination.\n",{"path":7820,"title":7821,"module":7809,"summary":7822},"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic","Policy Gradients and Actor-Critic Methods","Value-based reinforcement learning learns what each state is worth and acts greedily; policy-gradient methods skip the detour and optimize a parameterized policy directly by ascending the gradient of expected return. The policy gradient theorem makes this tractable through the log-derivative trick, turning an intractable gradient of an expectation into an expectation of a gradient. REINFORCE realizes the idea but suffers high variance; baselines, the advantage function, and actor-critic learning reduce it, and trust-region methods (TRPO, PPO) keep each update from destroying the policy it just learned.\n",{"path":7824,"title":7825,"module":7809,"summary":7826},"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback","Reinforcement Learning from Human Feedback","Many objectives we want from a model, that it be helpful and harmless, are hard to write down but easy to judge by comparison. RLHF turns that asymmetry into a training signal: fit a reward model to pairwise human preferences under the Bradley-Terry likelihood, then fine-tune the policy to maximize that reward under a KL penalty toward a reference. We derive the reward loss, the KL-regularized RL objective and its closed-form optimum, then show how DPO inverts that optimum to collapse the whole pipeline into one supervised log-sigmoid loss, and survey IPO, KTO, RLAIF, and GRPO.\n",{"path":7828,"title":7829,"module":6,"summary":6},"\u002Fdeep-learning","Deep Learning",{"path":7831,"title":7832,"module":5739,"summary":7833},"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law","Equilibrium, State Variables, and the Zeroth Law","Thermodynamics describes a many-body system by a handful of macroscopic variables and the equilibrium relations among them. This lesson fixes the vocabulary: systems and the walls that separate them, state variables versus path-dependent process quantities, quasi-static and reversible idealizations, and the zeroth law, whose transitivity of thermal equilibrium is what lets temperature exist as a number. The ideal-gas thermometer turns that number into a scale, and an equation of state ties the variables into a surface.\n",{"path":7835,"title":7836,"module":5739,"summary":7837},"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work","The First Law: Internal Energy, Heat, and Work","The first law is energy conservation for a system that exchanges energy as both heat and work. Internal energy is a state function with an exact differential; heat and work are path-dependent process quantities. This lesson states $\\d U=\\delta Q+\\delta W$, computes compression work as an area on the $P$–$V$ plane, defines the heat capacities $C_V$ and $C_P$ and the enthalpy that makes $C_P$ natural, and works the isothermal and adiabatic processes of an ideal gas, including the adiabat $PV^\\gamma=\\text{const}$.\n",{"path":7839,"title":7840,"module":5739,"summary":7841},"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound","The Second Law, Carnot Cycles, and Entropy","The second law forbids the free conversion of heat into work. This lesson states the Kelvin and Clausius forms, proves them equivalent, and analyzes the Carnot cycle to get the efficiency bound $1-T_c\u002FT_h$. Carnot's theorem makes that bound universal and defines the thermodynamic temperature scale. The Clausius inequality $\\oint \\delta Q\u002FT\\le 0$ then constructs entropy as a state function, $\\d S=\\delta Q_{\\rm rev}\u002FT$, whose non-decrease in isolated systems is the arrow of time.\n",{"path":7843,"title":7844,"module":5739,"summary":7845},"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations","Thermodynamic Potentials and Maxwell Relations","The fundamental relation $\\d U=T\\,\\d S-P\\,\\d V+\\mu\\,\\d N$ packages the first and second laws into one exact differential. Legendre transforms swap each conjugate pair to produce the Helmholtz, enthalpy, Gibbs, and grand potentials, each minimized under its own natural variables. Equality of mixed second partials of these potentials gives the Maxwell relations, which convert unmeasurable entropy derivatives into measurable ones from the equation of state.\n",{"path":7847,"title":7848,"module":5739,"summary":7849},"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law","Response Functions, Stability, and the Third Law","Response functions — heat capacities, compressibilities, thermal expansion — are the second derivatives of the potentials and the quantities an experiment actually measures. This lesson derives the general relation $C_P-C_V=TV\\alpha^2\u002F\\kappa_T$, shows that convexity of the potentials forces the stability conditions $C_V>0$ and $\\kappa_T>0$, and states the third law: entropy approaches a constant as $T\\to0$, so heat capacities and expansion coefficients vanish there and absolute zero is unattainable.\n",{"path":7851,"title":7852,"module":7853,"summary":7854},"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition","Classical Statistics and Equipartition","Microstates, Phase Space, and Statistical Entropy","A liter of gas holds on the order of a trillion trillion molecules, far too many to track by their equations of motion. Classical statistical mechanics replaces the trajectories with a single probability law, the Boltzmann distribution, and reads the measurable properties of matter off it: the Maxwell speed distribution, the average energy per degree of freedom, and the heat capacities of gases and solids — together with the low-temperature failures that forced the quantum revision.\n",{"path":7856,"title":7857,"module":7853,"summary":7858},"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem","Phase Space, Trajectories, and Liouville's Theorem","A classical system of N particles is one point in a 6N-dimensional phase space, and its evolution is a single trajectory driven by Hamilton's equations. This lesson builds that geometric picture, introduces the phase-space density of an ensemble, and proves Liouville's theorem: the density is carried by the flow as an incompressible fluid, so phase-space volume is conserved. The stationary densities of equilibrium follow as functions of the conserved quantities alone.\n",{"path":7860,"title":7861,"module":7853,"summary":7862},"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate","Ensembles and the Postulate of Equal a Priori Probabilities","An ensemble is a probability distribution over the microstates of a system. This lesson states the single postulate on which equilibrium statistical mechanics rests — that an isolated system in equilibrium is equally likely to be in any of its accessible microstates — and works out its consequences: the accessible phase-space volume, the overwhelming dominance of the most probable macrostate as the particle number grows, and the ergodic hypothesis that lets a time average be replaced by an ensemble average.\n",{"path":7864,"title":7865,"module":7853,"summary":7866},"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs","Statistical Entropy: Boltzmann and Gibbs","Entropy is the logarithm of the number of accessible microstates. This lesson builds the two statistical entropies — Boltzmann's S = k ln Omega for an isolated system and Gibbs's S = -k sum p ln p for any ensemble — proves they agree for a uniform distribution, and connects both to Shannon's measure of missing information. The second law emerges as the drift toward maximum multiplicity, and maximizing the Gibbs entropy under constraints previews the canonical distribution.\n",{"path":7868,"title":7869,"module":7870,"summary":7871},"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy","The Microcanonical Ensemble and Statistical Entropy","The Microcanonical Ensemble","An isolated system holds its energy, volume, and particle number fixed, and the fundamental postulate assigns equal probability to every microstate on its energy shell. This lesson builds the microcanonical distribution, defines the enclosed phase-space volume $\\Gamma(E)$, the surface density of states $\\omega(E)=\\d\\Gamma\u002F\\d E$, and the shell count $\\Omega(E)$, shows their logarithms agree to $O(\\ln N)$ for large $N$, and reads the Boltzmann entropy $S=k\\ln\\Omega$ off the count. The measure factors $h^{3N}$ and $N!$ enter here and make $S$ extensive.\n",{"path":7873,"title":7874,"module":7870,"summary":7875},"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential","Thermal, Mechanical, and Diffusive Equilibrium","Two isolated subsystems that can exchange energy, volume, or particles reach equilibrium at the partition that maximizes their combined entropy. Setting the derivative of the total entropy to zero identifies the statistical definitions $1\u002FT=(\\partial S\u002F\\partial E)$, $P\u002FT=(\\partial S\u002F\\partial V)$, and $-\\mu\u002FT=(\\partial S\u002F\\partial N)$, shows heat flows from hot to cold as an entropy increase, and recovers the fundamental relation $\\d S=(\\d E+P\\,\\d V-\\mu\\,\\d N)\u002FT$ from pure counting.\n",{"path":7877,"title":7878,"module":7870,"summary":7879},"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy","The Ideal Gas, Phase-Space Volume, and the Sackur–Tetrode Entropy","The monatomic ideal gas is the first system whose microcanonical count can be done in closed form. The momentum integral is the volume of a $3N$-dimensional ball of radius $\\sqrt{2mE}$, the configuration integral is $V^N$, and together they give the Sackur–Tetrode entropy $S=Nk[\\ln(V\u002FN\\lambda^3)+5\u002F2]$ with the thermal wavelength $\\lambda=h\u002F\\sqrt{2\\pi mkT}$. The formula matches the measured entropy of helium, fixes the classical regime $n\\ll n_Q$, and shows why the $N!$ is needed for extensivity.\n",{"path":7881,"title":7882,"module":7870,"summary":7883},"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature","Two-State Systems, Paramagnets, and Negative Temperature","The ideal two-state paramagnet has a multiplicity counted by the binomial coefficient, an entropy that is an inverted dome in the energy, and a temperature read from the slope $1\u002FT=\\partial S\u002F\\partial E$. Because the energy is bounded above, the slope changes sign past the entropy maximum: a population-inverted spin system has a negative absolute temperature, which is hotter than any positive temperature. Nuclear-spin experiments and lasers realize the inverted state.\n",{"path":7885,"title":7886,"module":7887,"summary":7888},"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution","The Canonical Ensemble and the Boltzmann Distribution","The Canonical Ensemble","A system held at fixed temperature by contact with a heat reservoir is described by the canonical ensemble. Expanding the reservoir entropy to first order in the system energy gives the Boltzmann distribution $p_i\\propto e^{-\\beta E_i}$, and the same law follows from maximizing the Gibbs entropy at fixed mean energy. Both routes identify $\\beta=1\u002Fk_BT$ and fix the probability of every microstate from the temperature alone.\n",{"path":7890,"title":7891,"module":7887,"summary":7892},"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy","The Partition Function and the Helmholtz Free Energy","The normalizing sum of the Boltzmann distribution, the partition function $Z=\\sum_i e^{-\\beta E_i}$, is a generating function for the thermodynamics. The mean energy is $-\\partial\\ln Z\u002F\\partial\\beta$, and the Gibbs entropy of the canonical distribution collapses to the bridge relation $F=-k_BT\\ln Z$. From $F$ every thermodynamic quantity follows by differentiation, and $Z$ factorizes over independent degrees of freedom.\n",{"path":7894,"title":7895,"module":7887,"summary":7896},"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence","Energy Fluctuations and the Equivalence of Ensembles","In the canonical ensemble the energy fluctuates, and the second derivative of $\\ln Z$ gives its variance. The fluctuation–response identity $\\langle\\Delta E^2\\rangle = k_BT^2C_V$ ties the spread of the energy to the heat capacity, and the relative fluctuation falls as $1\u002F\\sqrt{N}$. In the thermodynamic limit the canonical energy distribution is a sharp spike, and the canonical and microcanonical ensembles predict the same thermodynamics.\n",{"path":7898,"title":7899,"module":7887,"summary":7900},"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems","Harmonic Systems: The Einstein Solid and Vibrational Heat Capacity","A quantum harmonic oscillator has a geometric partition function summed in closed form, giving a mean energy $\\hbar\\omega(\\tfrac12+\\langle n\\rangle)$ with the Bose occupation factor. Modeling a solid as $3N$ independent oscillators yields a heat capacity that rises from zero and saturates at the Dulong–Petit value $3Nk_B$. The Einstein temperature sets the crossover, and the model's exponential low-temperature falloff, too steep against the observed $T^3$, motivates the Debye theory.\n",{"path":7902,"title":7903,"module":7887,"summary":7904},"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly","Paramagnetism, Two-Level Systems, and the Schottky Anomaly","A magnetic moment in a field is a two-level system whose partition function is a hyperbolic cosine. The magnetization of a spin-$\\tfrac12$ paramagnet is $N\\mu\\tanh(\\mu B\u002Fk_BT)$, generalizing to the Brillouin function for spin $J$; it gives Curie's law $\\chi\\propto 1\u002FT$ at high temperature and saturates at low temperature. A finite level gap produces the Schottky heat-capacity peak, and the temperature dependence of the entropy on the field is the basis of adiabatic demagnetization cooling.\n",{"path":7906,"title":7907,"module":7908,"summary":7909},"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox","The Ideal Gas Partition Function and the Gibbs Paradox","The Classical Ideal Gas","The classical monatomic ideal gas built from the partition function. The single-particle sum is $z_1=V\u002F\\lambda^3$ with the thermal de Broglie wavelength $\\lambda$; the $N$-particle partition function is $z_1^N\u002FN!$, and the $N!$ is forced by indistinguishability. From $Z$ the ideal-gas law, $U=\\tfrac32 Nk_BT$, and the Sackur–Tetrode entropy follow. The $N!$ makes the entropy extensive and resolves the Gibbs paradox: mixing identical gases produces no entropy change.\n",{"path":7911,"title":7912,"module":7908,"summary":7913},"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem","Equipartition and the Virial Theorem","The equipartition theorem derived from the canonical ensemble: every phase-space coordinate that enters the Hamiltonian quadratically carries a mean energy $\\tfrac12 k_BT$. The generalized form $\\langle x_i\\,\\partial H\u002F\\partial x_j\\rangle = k_BT\\,\\delta_{ij}$ contains equipartition and the classical virial theorem as special cases. Equipartition fixes the classical heat capacities, fails by quantum freeze-out when a level gap exceeds $k_BT$, and shifts for a relativistic gas whose energy is linear rather than quadratic in momentum.\n",{"path":7915,"title":7916,"module":7908,"summary":7917},"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration","Molecular Gases: Rotational and Vibrational Degrees of Freedom","The internal partition function of a diatomic gas factorizes into translational, rotational, vibrational, and electronic parts. The rigid rotor gives a rotational temperature $\\theta_{\\rm rot}$; the harmonic bond gives a vibrational temperature $\\theta_{\\rm vib}$. Each mode contributes to the heat capacity only above its characteristic temperature, producing the diatomic $C_V$ staircase from $\\tfrac32 R$ to $\\tfrac52 R$ to $\\tfrac72 R$. Homonuclear molecules carry a symmetry number, and hydrogen splits into ortho and para species.\n",{"path":7919,"title":7920,"module":7921,"summary":7922},"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function","The Grand Canonical Ensemble","Grand Canonical Ensemble","When a system exchanges both energy and particles with a reservoir, the reservoir fixes its temperature and its chemical potential. Expanding the reservoir entropy to first order in the exchanged energy and particle number gives the Gibbs factor $e^{-\\beta(E-\\mu N)}$, and summing it over every microstate of every particle number gives the grand partition function $\\Xi$. The grand potential $\\Phi = -k_BT\\ln\\Xi = -PV$ generates the mean particle number, energy, entropy, and pressure by differentiation.\n",{"path":7924,"title":7925,"module":7921,"summary":7926},"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations","Chemical Potential, Fugacity, and Number Fluctuations","The chemical potential is the energy to add one particle at fixed entropy and volume, equal to the slope of the free energy in the particle number. For the classical ideal gas $\\mu=k_BT\\ln(n\\lambda^3)$ is large and negative, and the fugacity $z=n\\lambda^3$ is small. The grand ensemble makes the particle number fluctuate; its variance $\\langle\\Delta N^2\\rangle=k_BT(\\partial N\u002F\\partial\\mu)$ equals $k_BT\\,N^2\\kappa_T\u002FV$, tying density fluctuations to the isothermal compressibility. Equality of $\\mu$ is the condition for diffusive equilibrium and phase coexistence.\n",{"path":7928,"title":7929,"module":7921,"summary":7930},"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web","The Three Ensembles and the Thermodynamic Web","The microcanonical, canonical, and grand canonical ensembles hold different variables fixed and generate different potentials — the entropy $S$, the Helmholtz free energy $F$, and the grand potential $\\Phi$ — linked by Legendre transforms that trade each fixed variable for its conjugate. Each successive ensemble lets one more quantity fluctuate. In the thermodynamic limit the three agree, the relative fluctuations vanishing as $1\u002F\\sqrt{N}$; the ideal gas gives the same equation of state in all three. The choice of ensemble is a matter of convenience, set by which sum is easiest.\n",{"path":7932,"title":7933,"module":7934,"summary":7935},"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac","Quantum Statistics — Bose-Einstein and Fermi-Dirac","Quantum Statistics","Quantum particles of the same kind are genuinely indistinguishable: no label survives an overlap of their wave functions. Counting states with that constraint replaces the Boltzmann distribution with two quantum laws — the Bose-Einstein distribution for integer-spin particles, which clump into shared states, and the Fermi-Dirac distribution for half-integer-spin particles, which exclude one another. Both reduce to Boltzmann in the dilute, hot limit, and a de Broglie criterion says exactly when.\n",{"path":7937,"title":7938,"module":7934,"summary":7939},"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions","Deriving the Quantum Distributions from the Grand Ensemble","The Bose-Einstein and Fermi-Dirac distributions follow from one observation: in the occupation-number representation the single-particle modes are independent, so the grand partition function factorizes into one factor per mode. A boson mode sums a geometric series over all occupancies; a fermion mode sums two terms. Differentiating each factor gives the mean occupation $1\u002F(e^{\\beta(\\varepsilon-\\mu)}\\mp 1)$, the Maxwell-Boltzmann limit when occupancies are small, and the occupation fluctuations that distinguish bunching from anti-bunching.\n",{"path":7941,"title":7942,"module":7934,"summary":7943},"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration","The Classical Limit and Quantum Concentration","When every single-particle level is nearly empty, both quantum distributions collapse to the Maxwell-Boltzmann form, and the fugacity equals the ratio of the number density to the quantum concentration $n_Q = 1\u002F\\lambda^3$. The gas is classical when $n \\ll n_Q$, degenerate when $n \\gtrsim n_Q$. The chemical potential is large and negative in the classical regime and rises through zero as the gas degenerates. The leading quantum correction to the ideal-gas law is a second virial term that lowers the pressure for bosons and raises it for fermions — a statistical attraction and repulsion with no interaction behind it.\n",{"path":7945,"title":7946,"module":7934,"summary":7947},"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework","Ideal Quantum Gases: The General Framework","Every ideal quantum gas is handled by one calculation. The sum over single-particle modes becomes an energy integral weighted by a density of states $g(\\varepsilon)\\propto\\varepsilon^{1\u002F2}$, and the number and pressure reduce to the Bose and Fermi functions $g_\\nu(z)$ and $f_\\nu(z)$ of the fugacity. An integration by parts fixes $PV=\\tfrac23 U$ for a nonrelativistic gas and $PV=\\tfrac13 U$ for an ultrarelativistic one, independent of statistics. Specializing the density of states and the chemical potential then produces the photon gas, phonons, the Bose gas, and the Fermi gas as four branches of the same framework.\n",{"path":7949,"title":7950,"module":7951,"summary":7952},"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas","Bose-Einstein Condensation and the Fermion Gas","Bosonic Systems","Below a critical temperature a boson gas drops a macroscopic fraction of its particles into the single ground state — Bose-Einstein condensation, the mechanism behind superfluid helium and the dilute-atom condensates cooled to nanokelvin. The same statistics applied to a photon gas reproduces Planck's blackbody spectrum. Fermions do the opposite: forbidden from sharing states, they fill every level up to the Fermi energy, and that filled sea governs the electrons in metals and the pressure that holds up a white dwarf.\n",{"path":7954,"title":7955,"module":7951,"summary":7956},"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law","The Photon Gas and Planck's Radiation Law","Electromagnetic radiation in equilibrium with cavity walls is a gas of non-conserved bosons, and non-conservation forces the chemical potential to zero. Counting standing-wave modes with two polarizations and weighting each by the Bose occupation gives the Planck spectral energy density. Its low-frequency tail reproduces the classical Rayleigh-Jeans law and the ultraviolet catastrophe; the Bose factor cuts the divergence off at high frequency and the peak obeys Wien's displacement law.\n",{"path":7958,"title":7959,"module":7951,"summary":7960},"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure","Blackbody Thermodynamics and Radiation Pressure","Integrating the Planck spectrum over all frequencies gives the total energy density proportional to the fourth power of temperature — the Stefan-Boltzmann law — and the isotropy of a relativistic gas fixes the radiation pressure at one third of the energy density. From the free energy follow the entropy and heat capacity, both proportional to T cubed, and the adiabatic law for radiation. The results govern the pressure inside stars and the cooling of the cosmic microwave background as the universe expands.\n",{"path":7962,"title":7963,"module":7951,"summary":7964},"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model","Phonons and the Debye Model","The vibrations of a crystal lattice are quantized into phonons — bosons of zero chemical potential, counted exactly like cavity photons but with three polarizations, a finite sound speed, and a total of 3N modes. The Debye model replaces the true dispersion by a linear one cut off at a frequency that enforces that count. It gives the correct low-temperature T-cubed heat capacity the Einstein model missed and recovers the Dulong-Petit value at high temperature.\n",{"path":7966,"title":7967,"module":7951,"summary":7968},"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived","Bose-Einstein Condensation Derived","For a gas of conserved bosons the excited states can hold only a finite number of particles at fixed temperature, set by the Bose function at unit fugacity. When the total exceeds that ceiling the surplus collapses into the single ground state, which the continuum density-of-states integral misses and which must be restored by hand. This fixes the critical temperature, the condensate fraction, and the fact that a uniform gas condenses only in three or more dimensions.\n",{"path":7970,"title":7971,"module":7951,"summary":7972},"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity","Thermodynamics of the Bose Gas and Superfluidity","The energy and pressure of the ideal Bose gas follow from the Bose function at the order above the density, and below the critical temperature the pressure depends on temperature alone because the condensate carries none. The heat capacity rises to a cusp at the transition. Real superfluid helium departs from the ideal gas because interactions matter: the Landau criterion ties frictionless flow to the phonon-roton excitation spectrum, and the two-fluid model carries a second sound.\n",{"path":7974,"title":7975,"module":7976,"summary":7977},"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature","The Ideal Fermi Gas at Zero Temperature","Degenerate Fermi Gas","At absolute zero a gas of non-interacting fermions fills every single-particle state up to the Fermi energy and leaves the rest empty, a filled Fermi sphere in momentum space. This lesson computes the Fermi momentum, energy, and temperature from the density, the density of states, the total ground-state energy, and the degeneracy pressure that grows as $n^{5\u002F3}$. Numerical Fermi energies for metals set the scale: they are electron-volts, so room temperature is deep in the degenerate regime.\n",{"path":7979,"title":7980,"module":7976,"summary":7981},"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals","The Sommerfeld Expansion and Electrons in Metals","Turning on a small temperature blurs the Fermi step over a shell of width $k_BT$ around $\\epsilon_F$. The Sommerfeld expansion turns integrals over the Fermi function into a power series in $(k_BT\u002F\\epsilon_F)^2$, giving the shift of the chemical potential and a heat capacity linear in $T$. This resolves the old puzzle of the missing electronic heat capacity, predicts the combined $C=\\gamma T+AT^3$ of a metal, and gives the temperature-independent Pauli paramagnetism of the electron gas.\n",{"path":7983,"title":7984,"module":7976,"summary":7985},"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit","White Dwarfs and the Chandrasekhar Limit","A white dwarf is held up against its own gravity by the degeneracy pressure of its electrons. Balancing that pressure against gravity gives a mass-radius relation $R\\propto M^{-1\u002F3}$: heavier white dwarfs are smaller and denser. As the density rises the electrons turn relativistic, the pressure softens from $n^{5\u002F3}$ to $n^{4\u002F3}$, and the star can no longer support itself above a critical mass. This lesson derives that Chandrasekhar mass, about $1.4\\,M_\\odot$, and what lies beyond it.\n",{"path":7987,"title":7988,"module":7976,"summary":7989},"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter","Neutron Stars and Dense Matter","When a collapsing core passes nuclear density, electron capture converts the matter to neutrons and their degeneracy pressure takes over. The same balance that fixes a white dwarf, rescaled by the neutron mass, gives a neutron star of a few solar masses in a ten-kilometre radius. General relativity is no longer a correction: the Tolman-Oppenheimer-Volkoff equation replaces the Newtonian balance and sets a maximum mass around two solar masses. This lesson rescales the Fermi-gas argument, states where it breaks, and places the compact objects in one stability sequence.\n",{"path":7991,"title":7992,"module":7993,"summary":7994},"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients","The Cluster Expansion and Virial Coefficients","Interacting Gases","A real gas departs from $PV=Nk_BT$ because its molecules interact. The configuration integral factors through the Mayer function $f_{ij}=e^{-\\beta u_{ij}}-1$, and expanding it in powers of density produces the virial expansion $PV\u002FNk_BT = 1 + B_2(T)n + B_3(T)n^2 + \\cdots$. The second virial coefficient $B_2(T)=-\\tfrac12\\int f\\,\\d^3r$ is a single integral over the pair potential; it is positive for a hard core, negative for an attractive well, and vanishes at the Boyle temperature where the two balance.\n",{"path":7996,"title":7997,"module":7993,"summary":7998},"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence","The van der Waals Gas and Liquid-Gas Coexistence","Resumming the second virial coefficient $B_2=b-a\u002Fk_BT$ into an equation of state gives the van der Waals model $(P+a\u002Fv^2)(v-b)=k_BT$, the simplest theory of a fluid that condenses. Below the critical temperature its isotherms develop a mechanically unstable loop; the Maxwell equal-area construction replaces the loop with a coexistence tie line. The critical point sits at $v_c=3b$, $k_BT_c=8a\u002F27b$, $P_c=a\u002F27b^2$, and the model predicts universal but incorrect critical exponents because it ignores fluctuations.\n",{"path":8000,"title":8001,"module":7993,"summary":8002},"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange","Quantum Gases with Interactions and Statistical Exchange","A quantum gas has a nonzero second virial coefficient even with no forces between the particles: symmetrization alone produces an effective statistical interaction, attractive for bosons and repulsive for fermions, with range the thermal wavelength $\\lambda$. This lesson derives that exchange contribution $B_2=\\mp\\lambda^3\u002F2^{5\u002F2}g$, writes it as a statistical potential $v_s(r)=-k_BT\\ln(1\\pm e^{-2\\pi r^2\u002F\\lambda^2})$, and shows how real interactions add on top through the Beth-Uhlenbeck phase-shift formula, reducing at low temperature to a single scattering length.\n",{"path":8004,"title":8005,"module":8006,"summary":8007},"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification","Phases, Coexistence, and the Classification of Transitions","Phase Transitions","A phase transition is a point where the free energy of a substance loses analyticity, so a small change in temperature or pressure produces a qualitative change of state. This lesson maps the coexistence curves of a pure substance, derives the Clausius-Clapeyron relation between the slope of a coexistence line and its latent heat, and separates first-order transitions (discontinuous entropy and density) from continuous ones (a vanishing order parameter and divergent response). The Ehrenfest scheme, the order parameter, and the triple and critical points fix the vocabulary the rest of the module builds on.\n",{"path":8009,"title":8010,"module":8006,"summary":8011},"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions","The Ising Model and Exact Results","The Ising model reduces cooperative ordering to spins on a lattice coupled to their neighbors, and the same Hamiltonian describes uniaxial magnets, the liquid-gas critical point through the lattice gas, and binary alloys. This lesson solves the one-dimensional chain exactly with the transfer matrix, shows by a domain-wall argument why one dimension has no ordered phase at any positive temperature, contrasts the survival of order in two dimensions, and quotes Onsager's exact two-dimensional results: the critical temperature, the logarithmically divergent heat capacity, and the magnetization exponent one eighth.\n",{"path":8013,"title":8014,"module":8006,"summary":8015},"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model","Mean-Field Theory and Spontaneous Symmetry Breaking","Mean-field theory replaces the neighbors of each spin by their average, turning the interacting Ising model into a single spin in a self-consistent field. The resulting equation m = tanh(beta J z m + beta h) has only the zero solution above a critical temperature and gains a nonzero root below it, giving spontaneous magnetization and a mean-field critical temperature k T_c = J z. The Bragg-Williams free energy turns single-welled above T_c and double-welled below, the picture of spontaneous symmetry breaking. The approximation is exact in high dimension and fails below the upper critical dimension four, quantified by the Ginzburg criterion.\n",{"path":8017,"title":8018,"module":8006,"summary":8019},"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory","Critical Exponents, Scaling, and Landau Theory","Near a continuous transition every singular quantity follows a power law in the reduced temperature, and the exponents alpha, beta, gamma, delta, nu, and eta encode the transition more sharply than T_c itself. Landau theory expands the free energy in the order parameter and delivers the mean-field exponents in a few lines. They disagree with experiment and with the exact two-dimensional Ising values, but the exponents are not independent: the scaling relations of Rushbrooke, Widom, Fisher, and Josephson tie them together, and the correlation length sets the length scale that organizes universality classes.\n",{"path":8021,"title":8022,"module":8006,"summary":8023},"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea","Scaling and the Renormalization-Group Idea","At a critical point fluctuations exist on every length scale, so the system looks the same after coarse-graining. The renormalization group makes this self-similarity a computation: group spins into blocks, integrate out the short scales, and track how the couplings change. The transformation has fixed points, and the flow near a critical fixed point separates relevant couplings that grow from irrelevant ones that shrink, which is why only dimension and symmetry survive to set the exponents. The one-dimensional Ising decimation carries the whole scheme through in closed form and reproduces the absence of a finite-temperature transition.\n",{"path":8025,"title":8026,"module":8027,"summary":8028},"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response","Thermodynamic Fluctuations and Response Functions","Fluctuations and Response","Thermodynamic variables are sharp only on average; a macroscopic system in equilibrium fluctuates about its mean values. Einstein inverted Boltzmann's $S=k_B\\ln\\Omega$ into a Gaussian probability for a fluctuation, $w\\propto e^{\\Delta S\u002Fk_B}$, and the second moments it predicts reproduce the response functions: $\\langle\\Delta E^2\\rangle=k_BT^2C_V$, $\\langle\\Delta V^2\\rangle=k_BTV\\kappa_T$, $\\langle\\Delta M^2\\rangle=k_BT\\chi_T$. The variances diverge where the responses diverge, at a critical point, producing critical opalescence and the breakdown of the thermodynamic description.\n",{"path":8030,"title":8031,"module":8027,"summary":8032},"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation","Brownian Motion and the Langevin Equation","A pollen grain in water executes a random walk driven by molecular collisions. Einstein tied its diffusion constant to its mobility, $D=\\mu_{\\mathrm{mob}}k_BT$, turning a visible motion into a measurement of Avogadro's number. The Langevin equation splits the collisions into a systematic drag and a random force whose strength is fixed by the drag through $\\langle\\xi(t)\\xi(t')\\rangle=2\\gamma k_BT\\,\\delta(t-t')$ — the first fluctuation–dissipation relation. The mean-square displacement grows ballistically at short times and linearly, $\\langle r^2\\rangle=2dDt$, at long times, and the Stokes–Einstein relation $D=k_BT\u002F6\\pi\\eta a$ closes the loop to Perrin's experiments.\n",{"path":8034,"title":8035,"module":8027,"summary":8036},"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem","Linear Response and the Fluctuation-Dissipation Theorem","A system driven by a weak external field responds through a generalized susceptibility $\\chi(\\omega)$ whose imaginary part measures dissipation. The Wiener–Khinchin theorem makes the power spectrum of equilibrium fluctuations the Fourier transform of their correlation function, and the fluctuation–dissipation theorem ties the two together: $S_x(\\omega)=(2k_BT\u002F\\omega)\\,\\chi''(\\omega)$, so the spectrum of spontaneous fluctuations is fixed by the dissipative response. The Johnson–Nyquist noise of a resistor, $\\langle V^2\\rangle=4k_BTR\\,\\Delta f$, is the canonical example, and Onsager reciprocity closes the subject.\n",{"path":8038,"title":8039,"module":6,"summary":6},"\u002Fstatistical-mechanics","Statistical Mechanics",{"path":8041,"title":8042,"module":8043,"summary":8044},"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms","Bonding Mechanisms","Molecules and Chemical Bonding","A molecule forms when the total energy of two atoms drops below the energy of the separated pair. This lesson works through the four mechanisms that produce that minimum: the ionic bond from charge transfer, the covalent bond from shared electron wave functions, the metallic bond, and the weak dipole-dipole and hydrogen bonds, computing bond lengths and dissociation energies for NaCl, H₂, and H₂⁺.\n",{"path":8046,"title":8047,"module":8043,"summary":8048},"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus","The Molecular-Orbital Method and H₂⁺","The hydrogen molecule ion is the two-center problem that fixes the language of chemical bonding. This lesson builds the molecular orbital as a linear combination of atomic orbitals, minimizes the energy through the variational secular equation, and reduces the result to three two-center integrals: the overlap, the Coulomb term, and the exchange (resonance) integral. The bonding and antibonding levels, their potential-energy curves, and the charge piled between the nuclei follow from those integrals.\n",{"path":8050,"title":8051,"module":8043,"summary":8052},"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange","The Hydrogen Molecule, Exchange, and Hybridization","Adding the second electron turns the one-electron ion into the two-electron hydrogen molecule, where electron-electron repulsion and the Pauli principle govern the bond. This lesson contrasts the Heitler-London valence-bond and molecular-orbital wave functions, derives the singlet-triplet splitting as an exchange energy, shows why naive molecular orbitals fail at dissociation, and builds the sp, sp², and sp³ hybrids that fix the directed geometry of covalent bonds.\n",{"path":8054,"title":8055,"module":8043,"summary":8056},"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces","Van der Waals Forces","The bond of last resort acts between all atoms, even closed-shell noble gases with no permanent moment. This lesson separates the three van der Waals contributions — Keesom orientation, Debye induction, and London dispersion — derives the London 1\u002Fr⁶ attraction from the coupled-oscillator and second-order perturbation pictures, and assembles the Lennard-Jones potential to compute the equilibrium spacing and cohesive energy of the noble-gas crystals, argon in particular.\n",{"path":8058,"title":8059,"module":8060,"summary":8061},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra","Rotational and Vibrational Spectra of Molecules","Molecular Spectra","A diatomic molecule stores energy in three well-separated ledgers: electronic, vibrational, and rotational. Quantizing the rigid rotor gives levels spaced as ℓ(ℓ+1); quantizing the bond as a harmonic oscillator gives equally spaced vibrational levels. Their combination produces the P and R branches of an infrared absorption band, from which the bond length and force constant are read directly.\n",{"path":8063,"title":8064,"module":8060,"summary":8065},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure","Anharmonicity and Rovibrational Structure","The rigid rotor and harmonic oscillator are first approximations. A real bond follows the Morse potential, whose levels converge toward dissociation; a real rotor stretches centrifugally; and vibration couples to rotation, so the rotational constant depends on the vibrational level. This lesson works out the anharmonic and centrifugal corrections, the Birge-Sponer route to the dissociation energy, the isotope shift, and the thermal band envelope.\n",{"path":8067,"title":8068,"module":8060,"summary":8069},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands","Raman Scattering and Electronic Bands","Not every vibration absorbs in the infrared. Raman scattering reaches modes that modulate the polarizability, giving Stokes and anti-Stokes lines whose intensity ratio measures temperature, and the mutual-exclusion rule pairs it with infrared absorption. Electronic transitions add the vibronic structure of band spectra, governed by the Franck-Condon principle, and the radiative fates of an excited state are sorted by the Jablonski diagram into fluorescence and phosphorescence.\n",{"path":8071,"title":8072,"module":8060,"summary":8073},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers","Lasers, Masers, and Stimulated Emission","Einstein's three radiative processes — absorption, spontaneous emission, and stimulated emission — and the coefficients that relate them. Stimulated emission produces coherent photons, and inverting the level populations turns it into net amplification. We build the ruby three-level laser and the helium-neon four-level laser, and show why the fourth level makes inversion easy.\n",{"path":8075,"title":8076,"module":8077,"summary":8078},"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids","The Structure of Solids","Crystal Structure","A crystal is a unit cell repeated in three dimensions. We classify the common cubic lattices, compute the Coulomb energy of an ionic crystal through the Madelung constant, and show how the divergent naive lattice sum is tamed by cubic shells. The cohesive energy that results predicts melting points and connects the diatomic bond of an earlier lesson to the bulk solid.\n",{"path":8080,"title":8081,"module":8077,"summary":8082},"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems","Bravais Lattices, Bases, and Crystal Structures","A crystal is a Bravais lattice decorated by a basis. This lesson separates the two, builds primitive and Wigner-Seitz cells, enumerates the seven crystal systems and fourteen Bravais lattices, and fixes the language of point and space groups. Miller indices label planes and directions, and the packing fractions of the close-packed, cubic, and diamond structures follow from the geometry.\n",{"path":8084,"title":8085,"module":8077,"summary":8086},"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones","The Reciprocal Lattice and Brillouin Zones","Every periodic crystal has a dual lattice in wavevector space. This lesson defines the reciprocal lattice through the condition b_i dot a_j equals two pi delta, derives its properties, shows the reciprocal of fcc is bcc, links reciprocal vectors to families of lattice planes, and builds the first Brillouin zone as the Wigner-Seitz cell of the reciprocal lattice, including the higher zones.\n",{"path":8088,"title":8089,"module":8077,"summary":8090},"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors","X-ray and Neutron Diffraction","A crystal diffracts radiation whose wavelength matches its atomic spacing. This lesson derives the Bragg condition, the equivalent Laue condition 2k dot G equals G squared, and the Ewald-sphere construction, then computes the geometric structure factor that produces systematic absences for bcc and fcc, the atomic form factor, and the powder method. It closes on why neutrons and electrons complement X-rays.\n",{"path":8092,"title":8093,"module":8094,"summary":8095},"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion","The Harmonic Crystal and Phonon Dispersion","Lattice Dynamics","Atoms in a crystal vibrate about their equilibrium sites, and expanding the potential to second order turns the whole lattice into a set of coupled harmonic oscillators. This lesson sets up the harmonic approximation and the dynamical matrix, solves the monatomic linear chain for its dispersion omega(k) = 2 sqrt(K\u002FM) times the absolute sine of ka over two, explains why wavevectors outside the first Brillouin zone are redundant, and extends the chain to two atoms per cell to produce acoustic and optical branches with a frequency gap.\n",{"path":8097,"title":8098,"module":8094,"summary":8099},"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos","Phonons, Density of States, and Crystal Momentum","Quantizing the normal modes of a harmonic crystal turns each vibrational mode into a quantum oscillator whose excitations are phonons. This lesson counts phonons with Bose-Einstein statistics, defines crystal momentum and the normal versus Umklapp distinction in momentum conservation, builds the density of states with its van Hove singularities, and shows how inelastic neutron scattering measures a dispersion curve point by point.\n",{"path":8101,"title":8102,"module":8094,"summary":8103},"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity","Thermal Properties — Einstein and Debye Models","The lattice heat capacity follows the classical Dulong-Petit value at high temperature but collapses toward zero as T approaches zero, a purely quantum effect. This lesson derives that behavior from the Einstein model of a single frequency, then the Debye model of a linear phonon spectrum with a cutoff, obtaining the Debye T-cubed law at low temperature and the Debye interpolation across all temperatures, and closes with thermal expansion and the Gruneisen parameter.\n",{"path":8105,"title":8106,"module":8094,"summary":8107},"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport","Anharmonicity, Thermal Expansion, and Heat Conduction","A perfectly harmonic crystal neither expands when heated nor resists heat flow. Both effects come from the cubic and higher terms the harmonic approximation discards. This lesson derives thermal expansion from an asymmetric interatomic potential, treats phonon-phonon scattering as the decay channel these terms open, shows why Umklapp processes are what make lattice thermal conductivity finite, and traces the temperature dependence of the conductivity and the phonon mean free path.\n",{"path":8109,"title":8110,"module":8111,"summary":8112},"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction","Conduction and the Free-Electron Gas","Free-Electron Fermi Gas","Drude's classical free-electron model gets Ohm's law right but the resistivity, its temperature dependence, and the heat capacity wrong. Replacing the Maxwell-Boltzmann distribution with the Fermi-Dirac distribution and treating electron-lattice collisions as wave scattering repairs all three: the Fermi energy, Fermi speed, and a mean free path set by thermal lattice vibrations.\n",{"path":8114,"title":8115,"module":8111,"summary":8116},"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity","The Sommerfeld Model: Ground State and Heat Capacity","Quantizing the free-electron gas in a box fills a Fermi sphere in k-space. The density of states grows as the square root of energy in three dimensions, and the Fermi energy, temperature, and wavevector follow for real metals. The Sommerfeld expansion shows only a thermal shell of width k_BT near E_F is excited, giving an electronic heat capacity linear in T that sits beneath the phonon T-cubed term.\n",{"path":8118,"title":8119,"module":8111,"summary":8120},"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect","Transport, Wiedemann–Franz, and the Hall Effect","The relaxation-time picture displaces the Fermi sphere under an applied field and gives the electrical conductivity ne-squared-tau over m. The same electrons carry heat, and their ratio yields the Wiedemann–Franz law with the universal Lorenz number. A magnetic field bends the carriers into cyclotron orbits and produces the Hall voltage, whose sign reveals the charge of the carriers.\n",{"path":8122,"title":8123,"module":8111,"summary":8124},"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons","Screening, Plasmons, and the Limits of Free Electrons","A mobile electron gas rearranges to screen any foreign charge, turning the bare Coulomb potential into a short-ranged Yukawa form over the Thomas–Fermi length. Displaced collectively, the gas rings at the plasma frequency, whose quantum is the plasmon and whose value sets the reflectivity edge of metals. A ledger of free-electron successes and failures then motivates band theory.\n",{"path":8126,"title":8127,"module":8128,"summary":8129},"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands","Bloch's Theorem and Energy Bands","Band Theory","An electron in a periodic potential has stationary states that are plane waves modulated by a lattice-periodic envelope. This lesson proves Bloch's theorem two ways, defines crystal momentum and the band index, counts the allowed wavevectors from Born–von Kármán boundary conditions, and sets up the extended, reduced, and repeated-zone descriptions of a band.\n",{"path":8131,"title":8132,"module":8128,"summary":8133},"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model","The Nearly-Free-Electron Model","A weak periodic potential leaves the free-electron parabola almost intact except near Brillouin-zone boundaries, where two nearly degenerate plane waves mix. This lesson solves the resulting two-by-two secular problem, shows the gap of size twice the potential component opening at each boundary, identifies the two standing waves that pile charge on and between the ions, and works the exactly solvable Kronig–Penney model.\n",{"path":8135,"title":8136,"module":8128,"summary":8137},"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method","The Tight-Binding Method","The opposite limit to nearly-free electrons builds bands from atomic orbitals. A Bloch sum of one orbital per site gives a dispersion set by the hopping integral between neighbours; the band widens from a sharp atomic level as the atoms approach. This lesson derives the s-band cosine dispersion, extends it to p-bands, and introduces Wannier functions as the localized dual of Bloch states.\n",{"path":8139,"title":8140,"module":8128,"summary":8141},"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics","Fermi Surfaces, Effective Mass, and Metals vs Insulators","Filling the bands settles which crystals conduct. A filled band carries no current, so a crystal with filled bands and a gap is an insulator, while a partly filled band makes a metal. This lesson derives the no-current theorem for a filled band, defines the Fermi surface and Harrison's construction, introduces holes and the effective mass from band curvature, and states the semiclassical equations of motion that lead to Bloch oscillations.\n",{"path":8143,"title":8144,"module":8145,"summary":8146},"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions","Band Theory and Semiconductors","Semiconductors","The periodic lattice splits atomic levels into allowed energy bands separated by forbidden gaps. Whether the highest occupied band is full or partly full, and how wide the gap above it is, sorts every solid into conductor, insulator, or semiconductor. Doping adds donor or acceptor levels inside the gap, and a p-n junction built from doped regions gives the diode, the solar cell, the LED, and the transistor.\n",{"path":8148,"title":8149,"module":8145,"summary":8150},"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors","Carrier Statistics: Intrinsic and Extrinsic Semiconductors","The number of mobile electrons and holes in a semiconductor follows from the density of states near each band edge and the Fermi-Dirac tail that reaches into it. This lesson derives the effective densities of states, the intrinsic concentration and its exponential gap dependence, the law of mass action, the temperature march of the Fermi level, and the freeze-out, saturation, and intrinsic regimes of a doped crystal.\n",{"path":8152,"title":8153,"module":8145,"summary":8154},"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination","Carrier Transport and Recombination","Carriers move by drift in a field and by diffusion down a concentration gradient, the two tied together by the Einstein relation. This lesson derives mobility and its scattering-limited temperature dependence, the drift and diffusion currents, the continuity equations, band-to-band and trap-assisted recombination, and the minority-carrier lifetime and diffusion length that set the length scale of every junction device.\n",{"path":8156,"title":8157,"module":8145,"summary":8158},"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction","The p-n Junction in Depth","Joining p-type and n-type silicon aligns their Fermi levels and leaves a depletion region of fixed charge with a built-in potential. This lesson derives the space-charge field and potential from Poisson's equation in the depletion approximation, the built-in voltage from Fermi-level alignment, the Shockley diode equation from minority-carrier diffusion, junction and diffusion capacitance, and the avalanche and Zener breakdown mechanisms.\n",{"path":8160,"title":8161,"module":8145,"summary":8162},"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics","Transistors and Optoelectronic Devices","Two junctions in series make a bipolar transistor whose thin base gives current gain; a gate over an oxide makes a MOSFET whose inversion channel switches digital logic. Run in reverse, a junction converts photons to current. This lesson derives the transistor current gain and the MOSFET channel current, then treats the LED, the diode laser, and the illuminated solar-cell characteristic.\n",{"path":8164,"title":8165,"module":8166,"summary":8167},"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization","Dielectrics, Polarization, and the Local Field","Dielectrics and Ferroelectrics","An insulator responds to an electric field by polarizing. This lesson builds the macroscopic polarization and the dielectric constant, sorts the microscopic response into electronic, ionic, and orientational polarizability, and corrects the field an atom actually feels to the Lorentz local field E + P\u002F3 epsilon-0. The Clausius-Mossotti relation links the measured permittivity to the atomic polarizability, and the frequency dependence of each mechanism explains why the static and optical dielectric constants differ.\n",{"path":8169,"title":8170,"module":8166,"summary":8171},"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics","Ferroelectrics, Piezoelectrics, and Structural Transitions","Some crystals carry a polarization with no applied field and switch it under a reversing field, tracing a hysteresis loop. This lesson develops the ferroelectric transition through the perovskite BaTiO3 displacive instability and its soft transverse-optical mode, builds the Landau free-energy theory of first- and second-order polar transitions, derives the Curie-Weiss divergence of the dielectric constant, and closes with piezoelectricity and pyroelectricity and their devices.\n",{"path":8173,"title":8174,"module":8175,"summary":8176},"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism","Diamagnetism and Paramagnetism","Magnetism in Solids","Every solid responds to a magnetic field. Filled shells give a small negative diamagnetic susceptibility from induced Larmor currents; localized moments give a positive Curie paramagnetism described by the Brillouin function, with the ground-state moment fixed by Hund's rules. The conduction electrons add a temperature-independent Pauli paramagnetism from the thermal shell near the Fermi surface, partly cancelled by Landau diamagnetism of their orbital motion.\n",{"path":8178,"title":8179,"module":8175,"summary":8180},"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism","Exchange and Ferromagnetism","Magnetic ordering at hundreds of kelvin cannot be dipolar; it is an exchange effect, the Coulomb repulsion sorted by the Pauli principle into a spin-dependent energy captured by the Heisenberg Hamiltonian. Weiss molecular-field theory replaces the exchange field by an average proportional to the magnetization, giving a self-consistent equation whose solution is spontaneous magnetization below a Curie temperature and a Curie–Weiss susceptibility above it. Itinerant ferromagnetism follows from the Stoner criterion on the band density of states.\n",{"path":8182,"title":8183,"module":8175,"summary":8184},"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains","Antiferromagnetism, Ferrimagnetism, and Domains","A negative exchange coupling orders neighboring spins antiparallel. Two-sublattice molecular-field theory gives a Néel temperature marked by a cusp in the susceptibility, and unequal sublattices leave a net moment — ferrimagnetism, the magnetism of the ferrites. A ferromagnet breaks into domains to reduce its magnetostatic energy, separated by Bloch walls whose width is set by the competition between exchange and magnetocrystalline anisotropy, and the irreversible motion of those walls produces the hysteresis loop.\n",{"path":8186,"title":8187,"module":8175,"summary":8188},"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons","Spin Waves and Magnons","The lowest excitations of a ferromagnet are not single flipped spins but collective precessions in which every moment tips slightly and its phase advances along the crystal. These spin waves have a quadratic dispersion at long wavelength, quantize into magnons obeying Bose statistics, and their thermal population removes magnetization as the Bloch T-to-the-three-halves law. Antiferromagnetic magnons disperse linearly, and inelastic neutron scattering measures both.\n",{"path":8190,"title":8191,"module":8192,"summary":8193},"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology","Superconductivity: Phenomenology and BCS","Superconductivity","Below a critical temperature some materials lose all resistance and expel magnetic flux — the Meissner effect that defines the state. The isotope effect points to lattice vibrations, and BCS theory binds electrons into Cooper pairs through phonon exchange. The paired condensate opens an energy gap, quantizes magnetic flux, and drives the Josephson effects.\n",{"path":8195,"title":8196,"module":8192,"summary":8197},"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect","London Theory and the Meissner Effect","A perfect conductor freezes the field it was cooled in; a superconductor expels it. The distinction needs a constitutive law beyond zero resistance — the two London equations — whose solution is exponential flux decay over the penetration depth. The same rigidity follows from a macroscopic condensate wave function, and the thermodynamics of the critical field fixes the condensation energy, the latent heat, and the specific-heat jump.\n",{"path":8199,"title":8200,"module":8192,"summary":8201},"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory","Ginzburg–Landau Theory, Vortices, and Type-II","A complex order parameter and a free-energy expansion turn the superconducting transition into a Landau theory. Two lengths emerge — the coherence length and the penetration depth — whose ratio kappa sorts superconductors into type I and type II. Type-II materials admit flux as an Abrikosov lattice of vortices, each threading exactly one quantum h\u002F2e, between a lower and an upper critical field.\n",{"path":8203,"title":8204,"module":8192,"summary":8205},"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory","Microscopic BCS Theory","A phonon-mediated attraction, however weak, binds two electrons above the Fermi sea — the Cooper problem shows the sea is unstable. The BCS variational ground state pairs all electrons near the Fermi surface and, through a self-consistent gap equation, opens an energy gap. Weak-coupling solution gives the exponential T_c and the universal ratios 2 Delta(0) = 3.53 k_B T_c and Delta C \u002F C_n = 1.43.\n",{"path":8207,"title":8208,"module":8192,"summary":8209},"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc","Josephson Effects and Unconventional Superconductors","Two superconductors joined by a thin barrier carry a supercurrent set by their phase difference — the dc Josephson effect — and oscillate at 2eV\u002Fh under a voltage. A two-junction loop turns flux quantization into a magnetometer of single-quantum sensitivity. The cuprates superconduct in CuO2 planes with a doping-dependent dome, d-wave pairing, and a pseudogap that lie outside the phonon picture.\n",{"path":8211,"title":8212,"module":8213,"summary":8214},"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots","Quantum Wells, Wires, and Dots","Nanostructures","When a crystal is shrunk until one or more of its dimensions approaches the electron wavelength, the continuous bands of the bulk break into discrete subbands. Confining in one direction gives a quantum well with a step-like density of states, in two directions a quantum wire with inverse-square-root singularities, and in all three a quantum dot whose levels are sharp like an atom's. This lesson derives the density of states in each case and applies it to size-tunable dot emission and the Coulomb blockade of a single-electron transistor.\n",{"path":8216,"title":8217,"module":8213,"summary":8218},"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect","The 2D Electron Gas and the Integer Quantum Hall Effect","A two-dimensional electron gas in a strong perpendicular magnetic field has its continuous density of states collapse into macroscopically degenerate Landau levels. As the field is swept, the Hall resistance locks onto exact plateaus at h over an integer times e squared, while the longitudinal resistance drops to zero. This lesson derives the Landau levels and their degeneracy, explains the plateaus through disorder-localized states and current-carrying edge channels, and states why the von Klitzing constant is now a resistance standard.\n",{"path":8220,"title":8221,"module":8213,"summary":8222},"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology","The Fractional Quantum Hall Effect and Topological Order","When the lowest Landau level is only partly filled, the non-interacting theory predicts no gap, yet a plateau appears at filling one-third. It is a many-body effect: Coulomb repulsion selects a correlated ground state, the Laughlin wavefunction, whose excitations carry a fraction of the electron charge. This lesson builds the Laughlin state, introduces composite fermions that map the fractional effect onto an integer one, and explains how the quantum Hall effect brought the Chern number and topology into condensed-matter physics.\n",{"path":8224,"title":8225,"module":8213,"summary":8226},"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials","Graphene and Dirac Materials","Graphene is one atomic layer of carbon on a honeycomb lattice. A tight-binding calculation on its two-atom basis gives valence and conduction bands that touch at the corners of the Brillouin zone, where the dispersion is linear and the electrons behave as massless two-dimensional Dirac particles with a fixed speed. This lesson derives the Dirac cones, the Berry phase of pi and the sublattice chirality, the anomalous half-integer quantum Hall effect that follows, and how opening a gap in a Dirac cone points toward topological insulators.\n",{"path":8228,"title":8229,"module":6,"summary":6},"\u002Fcondensed-matter","Condensed Matter Physics",{"path":8231,"title":8232,"module":4995,"summary":8233},"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model","Logic as a Mathematical Model of Deduction","Symbolic logic models deductive reasoning the way probability theory models chance: it keeps the form of a correct deduction and discards its content. A deduction is valid when its conclusion follows from the form of the premises alone, independent of what the non-logical words mean. Two models carry the subject — coarse sentential logic and fine first-order logic — and four questions organize it: logical consequence, methods of proof, the gap between provable and true, and the link between logic and computability. Tuples, relations, functions, equivalence classes, and cardinality supply the set-theoretic vocabulary every later chapter uses.\n",{"path":8235,"title":8236,"module":8237,"summary":8238},"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas","Formal Languages and Well-Formed Formulas","Sentential Logic","The language of sentential logic has an alphabet of sentence symbols, five connectives, and two parentheses, with formation rules that pick out the well-formed formulas. The wffs are the least set of expressions closed under the five formula-building operations, and every such generated set carries an induction principle.\n",{"path":8240,"title":8241,"module":8237,"summary":8242},"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies","Truth Assignments, Tautologies, and Consequence","A truth assignment fixes the sentence symbols true or false, and a recursion extends it uniquely to every formula. Satisfaction, tautologies, and tautological implication — one formula following semantically from others — rest on that extension, and the truth-table procedure decides implication for finite premise sets.\n",{"path":8244,"title":8245,"module":8237,"summary":8246},"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing","Unique Readability and a Parsing Algorithm","Parentheses keep a formula from being read two ways. The parenthesis lemmas and a top-down parsing algorithm recover a formula's structure and yield unique readability: every wff has exactly one formation tree, which is what makes the truth recursion well defined.\n",{"path":8248,"title":8249,"module":8237,"summary":8250},"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion","Induction and Recursion on Formulas","Two principles govern any set generated from initial elements by operations: prove a property of all its members by covering the initial elements and the closure steps, and define a function on it by recursion on structure. The recursion theorem needs the set to be freely generated, and unique readability supplies that condition for the well-formed formulas.\n",{"path":8252,"title":8253,"module":8237,"summary":8254},"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms","Sentential Connectives and Normal Forms","Every formula computes a Boolean function of its atoms, and Post's theorem gives the converse: every Boolean function is realized by a wff in disjunctive normal form, so the five connectives are more than enough. Minimal complete sets follow, down to the single connectives NAND and NOR, together with a method for proving a set of connectives incomplete.\n",{"path":8256,"title":8257,"module":8237,"summary":8258},"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits","Switching Circuits","A memoryless two-valued circuit computes a Boolean function, so every formula names a gate network and every network a formula. Cost and delay are read off the formula by recursion, and tautological equivalence and normal forms design and simplify circuits realizing a given specification.\n",{"path":8260,"title":8261,"module":8237,"summary":8262},"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness","Compactness and Effectiveness","The compactness theorem reduces satisfiability of an infinite set of formulas to its finite subsets, proved by extension to a maximal finitely satisfiable set and applied to color infinite graphs. Effectiveness fixes what \"decidable\" and \"effectively enumerable\" mean and settles the decidability of tautologyhood.\n",{"path":8264,"title":8265,"module":8266,"summary":8267},"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages","First-Order Languages","First-Order Languages and Structures","Sentential logic cannot see inside a simple statement, so it misses valid arguments that turn on quantifiers and predicates. A first-order language adds a quantifier, variables, and a chosen vocabulary of predicate, function, and constant symbols. Terms and well-formed formulas are built by recursion over this alphabet, and a variable occurs free or bound according to the quantifiers that reach it.\n",{"path":8269,"title":8270,"module":8266,"summary":8271},"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction","Structures, Truth, and Satisfaction","A structure interprets a language: a nonempty universe plus a meaning for every predicate, function, and constant symbol. Tarski's recursion defines when a structure satisfies a formula under a variable assignment, and hence when a sentence is true. From satisfaction we recover logical implication, validity, and logical equivalence for first-order logic.\n",{"path":8273,"title":8274,"module":8266,"summary":8275},"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence","Definability and Elementary Equivalence","Fix a structure and ask which relations a formula can pick out: the definable ones. A set of sentences picks out a class of structures, the elementary classes. Homomorphisms and isomorphisms compare structures, and the homomorphism theorem shows isomorphic structures satisfy the same sentences. Automorphisms bound what first-order logic can distinguish, giving a tool for proving relations undefinable.\n",{"path":8277,"title":8278,"module":8266,"summary":8279},"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing","Parsing, Substitution, and Substitutability","Every recursion on first-order syntax rests on unique readability. A parenthesis-counting function proves that terms and formulas decompose in exactly one way, and a parsing algorithm recovers the decomposition. Substituting a term for a free variable can capture it under a quantifier; the substitutability condition rules that out, and the substitution lemma trades syntactic substitution for a change of assignment.\n",{"path":8281,"title":8282,"module":8283,"summary":8284},"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus","A Deductive Calculus for First-Order Logic","The Deductive Calculus and Its Metatheorems","A proof must be finite and mechanically checkable. A Hilbert-style calculus meets both demands: six schemas of logical axioms, a single rule of inference (modus ponens), and the syntactic consequence relation they generate. Substitution and substitutability are defined by recursion, and the bridge theorem reduces deducibility to tautological implication from the axioms.\n",{"path":8286,"title":8287,"module":8283,"summary":8288},"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules","The Deduction Theorem and Derived Rules","Raw deductions from axioms are unusable by hand. The generalization theorem, the deduction theorem, contraposition, reductio ad absurdum, and rule T reduce the calculus to the moves of ordinary mathematics, each proved once to license a block of axiom-level steps. Generalization on constants and alphabetic variants handle the quantifier and substitution bookkeeping.\n",{"path":8290,"title":8291,"module":8283,"summary":8292},"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness","The Soundness Theorem","Soundness is the easy half of the match between proof and truth. Whatever the calculus deduces is logically implied, by an induction on deduction length that rests on one lemma: every logical axiom is valid. The only hard case, quantifier instantiation, needs the substitution lemma. The contrapositive corollary states that every satisfiable set is consistent.\n",{"path":8294,"title":8295,"module":8283,"summary":8296},"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency","The Completeness Theorem","Gödel's completeness theorem is the deep converse of soundness: whatever is logically implied can be deduced. Equivalently, every consistent set has a model. The Henkin proof manufactures that model out of syntax alone: add witnessing constants, extend to a maximal consistent set, and read a term model off the formulas it contains. Compactness and the enumerability theorem drop out.\n",{"path":8298,"title":8299,"module":8300,"summary":8301},"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem","Compactness and the Löwenheim–Skolem Theorems","Models, Compactness, and Theories","A set of first-order sentences has a model whenever each of its finite subsets does. This compactness theorem follows from completeness and yields the finiteness limitation, the downward and upward Löwenheim–Skolem theorems, models of every infinite cardinality, and nonstandard models of arithmetic.\n",{"path":8303,"title":8304,"module":8300,"summary":8305},"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity","Theories, Elementary Classes, and Categoricity","A theory is a set of sentences closed under logical consequence. Theories correspond to classes of models; a theory may be complete, axiomatizable, or finitely axiomatizable, and completeness together with axiomatizability yields decidability. The Łoś–Vaught test derives completeness from categoricity in a cardinal, applied to dense linear orders and to algebraically closed fields.\n",{"path":8307,"title":8308,"module":8300,"summary":8309},"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories","Interpretations Between Theories","An interpretation translates the vocabulary of one theory into formulas of another, relativizing quantifiers to a definable domain and mapping symbols to defining formulas. Defined function symbols meet a noncreativity criterion; the syntactic translation of formulas carries theoremhood forward, and a faithful interpretation transfers decidability and undecidability between theories.\n",{"path":8311,"title":8312,"module":8300,"summary":8313},"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis","Nonstandard Analysis","Compactness builds a model of the real ordered field containing infinite elements and nonzero infinitesimals. The transfer principle carries every first-order truth from the reals to this extension, the standard-part map collapses finite hyperreals back onto the reals, and continuity and the derivative are rederived by working with infinitely small quantities directly.\n",{"path":8315,"title":8316,"module":8317,"summary":8318},"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic","The Structure of Arithmetic and Definability","Number Theory and Definability","Number theory is the theory of one fixed structure, the natural numbers under successor, order, addition, multiplication, and exponentiation. Every number is named by a numeral, and a relation is definable when a single formula picks out exactly its tuples. The central gap separates the sentences true in that structure from those any reasonable set of axioms can prove.\n",{"path":8320,"title":8321,"module":8317,"summary":8322},"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor","Natural Numbers with Successor","The weakest reduct keeps only zero and successor. Its models are a standard chain together with disjoint copies of the integers, which makes the theory categorical in every uncountable power, hence complete and decidable. A quantifier-elimination procedure gives a practical decision method and shows a subset is definable if and only if it is finite or cofinite.\n",{"path":8324,"title":8325,"module":8317,"summary":8326},"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts","Reducts: Order, Addition, and Multiplication","Adding order to the successor reduct keeps decidability and makes the theory finitely axiomatizable; adding addition gives Presburger arithmetic, still decidable by quantifier elimination once congruence predicates are included, with definable sets exactly the eventually periodic ones. Multiplication is the break point: neither addition nor order can define it, and once it joins addition the theory stops being decidable.\n",{"path":8328,"title":8329,"module":8317,"summary":8330},"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability","A Subtheory of Number Theory and Representability","A finite set of eleven axioms, the recursion equations for successor, order, addition, multiplication, and exponentiation, already proves every true quantifier-free and existential sentence. Representability asks a theory to prove the right instances of a formula rather than merely make them true, and a relation is defined to be recursive exactly when some consistent finite theory represents it. Church's thesis identifies that with decidability, and closure under composition, minimization, and primitive recursion builds the catalog the incompleteness proofs need.\n",{"path":8332,"title":8333,"module":8334,"summary":8335},"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax","Arithmetization of Syntax","Arithmetization and the Incompleteness Theorems","Gödel numbering assigns a natural number to every symbol, expression, formula, and deduction, turning statements about syntax into statements about numbers. The syntactic operations — substitution, \"is a wff\", \"is an axiom\", \"d codes a deduction of a\" — come out primitive recursive and hence representable in the subtheory, which lets a formula of arithmetic talk about formulas, including itself.\n",{"path":8337,"title":8338,"module":8334,"summary":8339},"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability","Incompleteness, Undecidability, and Church's Theorem","The fixed-point lemma manufactures a sentence that talks about its own Gödel number. Pointed at truth it gives Tarski's theorem — arithmetic truth is not arithmetically definable; pointed at provability it gives Gödel's first incompleteness theorem and the undecidability of the theory of the natural numbers, and, applied to validity, Church's theorem that first-order logic is undecidable. The set of theorems of a recursive theory is only recursively enumerable — the gap between provable and true.\n",{"path":8341,"title":8342,"module":8334,"summary":8343},"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem","The Second Incompleteness Theorem","Consistency of a recursively axiomatized theory is itself an arithmetic sentence, built from a provability predicate. When the theory is strong enough to formalize its own reflection and modus ponens — the Hilbert–Bernays–Löb derivability conditions — it cannot prove that sentence unless it is inconsistent. Löb's theorem is the companion result, and set theory is the case that closes Hilbert's program.\n",{"path":8345,"title":8346,"module":8347,"summary":8348},"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions","Recursive Functions and Church's Thesis","Recursive Functions and Representability","The recursive functions are the formal counterpart of the effectively computable ones: built from three initial functions by composition, primitive recursion, and minimization, and equivalently the functions representable in a finitely axiomatized arithmetic. Church's thesis identifies the class with effective calculability; Kleene's normal form theorem and the unsolvable halting problem place the recursive sets strictly inside the recursively enumerable ones.\n",{"path":8350,"title":8351,"module":8347,"summary":8352},"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation","Representing Exponentiation and the β-Function","Coding finite sequences by prime-power exponents already assumes exponentiation, so representing exponentiation from addition and multiplication alone needs a different encoder. Gödel's β-function, built from a pairing function and the Chinese remainder theorem, reads back arbitrary finite sequences using only plus and times. This represents exponentiation in the addition-multiplication arithmetic and closes the last gap in the representability of every recursive syntactic operation.\n",{"path":8354,"title":8355,"module":8356,"summary":8357},"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages","Second-Order Languages","Second-Order Logic and Beyond","Second-order logic quantifies over relations and functions, not just individuals. Second-order Peano arithmetic and the second-order theory of the reals become categorical, and finiteness is definable by a single sentence. Compactness, completeness, and the Löwenheim–Skolem theorems all fail for the standard semantics.\n",{"path":8359,"title":8360,"module":8356,"summary":8361},"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic","Skolem Functions and Many-Sorted Logic","Skolem functions replace existential quantifiers with named witnesses, putting any first-order formula into a prenex form with all existentials — now over functions — pulled to the front. The Skolemized formula is equisatisfiable with the original, which reduces satisfiability to universal sentences and, through Herbrand expansions, to sentential logic. Many-sorted logic then adds several universes at once and reduces cleanly to ordinary one-sorted logic.\n",{"path":8363,"title":8364,"module":8356,"summary":8365},"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures","General (Henkin) Structures","General semantics reinterprets second-order logic by letting the predicate and function quantifiers range over a designated collection of relations and functions rather than all of them. Recast as many-sorted first-order logic with comprehension axioms, general second-order logic recovers a sound and complete calculus together with compactness and Löwenheim–Skolem, giving up the categoricity of the standard semantics. The ω-models of analysis show the trade.\n",{"path":8367,"title":8368,"module":6,"summary":6},"\u002Flogic","Logic",{"path":8370,"title":8371,"module":4995,"summary":8372},"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning","What Is Reinforcement Learning?","Reinforcement learning is learning what to do — how to map situations to actions — so as to maximize a numerical reward signal, discovered by trial and error rather than told. We set up the agent–environment loop, separate it from supervised and unsupervised learning, name the four elements (policy, reward, value, and an optional model), and train a tic-tac-toe player with a temporal-difference value update.\n",{"path":8374,"title":8375,"module":4995,"summary":8376},"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl","A Brief History of Reinforcement Learning","The origins of reinforcement learning. Three threads — trial-and-error learning from animal psychology, optimal control and dynamic programming, and temporal-difference learning — ran independently for decades and merged around 1989 into the modern field. Replacing the lookup table with a neural network then produced deep reinforcement learning: DQN, AlphaGo, AlphaZero, MuZero, and RLHF.\n",{"path":8378,"title":8379,"module":4995,"summary":8380},"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits","Multi-Armed Bandits","A bandit is reinforcement learning stripped to a single decision, repeated: no state, no consequences, only the tension between exploiting the arm that looks best and exploring the ones that might be better. We build up the whole toolkit — sample-average value estimates, the incremental update rule, ε-greedy, optimistic initialization, UCB, and gradient bandits — and use it to study exploration in isolation, the one problem that carries over to the full setting.\n",{"path":8382,"title":8383,"module":4995,"summary":8384},"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms","Bandit Exploration Algorithms","Better ways to explore than picking at random. Upper-confidence-bound selection explores by optimism about what it hasn't measured; gradient bandits learn action preferences by stochastic gradient ascent on reward. We then add context to get the contextual bandit, the bridge to full RL, and measure everything by regret — where UCB1 and Thompson sampling reach the logarithmic optimum that fixed-ε greedy cannot.\n",{"path":8386,"title":8387,"module":4995,"summary":8388},"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes","Markov Decision Processes","A Markov decision process is the formal interface between an agent and its environment: at each step the agent reads a state, chooses an action, and receives a reward and a next state. We fix that loop, the dynamics function that governs it, and the Markov property that makes the state sufficient; then turn goals into a scalar reward and rewards into a discounted return, with one notation that covers both episodic and continuing tasks.\n",{"path":8390,"title":8391,"module":4995,"summary":8392},"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality","Value Functions and Optimality","A value function scores how good a state (or state–action pair) is under a policy: the expected return from there onward. Its defining property is the Bellman equation, a self-consistency condition linking a state's value to its successors' values, which we derive from the return and the dynamics. Pushing the same idea to the best-achievable value gives the Bellman optimality equations, whose solution yields an optimal policy — and whose intractability is what the rest of the course is about.\n",{"path":8394,"title":5214,"module":8395,"summary":8396},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming","Tabular Solution Methods","Dynamic programming computes optimal policies when a perfect model of the MDP is given, by turning the Bellman equations into assignment statements. We build up iterative policy evaluation (the expected update), the policy improvement theorem, and the two classic algorithms that alternate them — policy iteration and value iteration — worked on the gridworld, a two-state MDP, Jack's car rental, and the gambler's problem.\n",{"path":8398,"title":8399,"module":8395,"summary":8400},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi","Dynamic Programming: Asynchronous DP and Generalized Policy Iteration","Policy and value iteration both sweep the entire state set on every pass, which is impossible once the state space is huge. This lesson loosens the schedule: asynchronous DP updates states in any order, generalized policy iteration names the alternation of evaluation and improvement that underlies nearly every RL method, and a look at efficiency and the curse of dimensionality places DP among the alternatives. We close past Sutton & Barto with prioritized sweeping, neuro-dynamic programming, value-iteration networks, and MuZero.\n",{"path":8402,"title":8403,"module":8395,"summary":8404},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods","Monte Carlo Methods","Monte Carlo methods learn value functions and optimal policies from complete sampled episodes, with no model of the environment: they simply average the returns that actually followed each state. We build prediction (first-visit and every-visit averaging), see why estimating action values forces the exploration question, and answer it two ways on-policy — exploring starts and epsilon-soft control. Throughout, Monte Carlo samples one whole trajectory to termination and never bootstraps.\n",{"path":8406,"title":8407,"module":8395,"summary":8408},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy","Monte Carlo Methods: Off-Policy Learning","On-policy Monte Carlo can only reach the best exploring policy, not the true optimum. Off-policy methods remove that ceiling by learning about a greedy target policy from data generated by a soft behavior policy, corrected with importance sampling. We derive the importance-sampling ratio, weigh ordinary against weighted estimators on real numbers, give the incremental off-policy algorithm, sharpen it with discounting-aware sampling, and close by placing Monte Carlo on the model\u002Fbootstrap map beside DP and temporal-difference learning.\n",{"path":8410,"title":8411,"module":8395,"summary":8412},"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning","Temporal-Difference Learning","Temporal-difference learning is the one idea most central to reinforcement learning: learn a value directly from experience, like Monte Carlo, but update each guess toward the next guess before the episode ends, like dynamic programming. We derive the TD(0) prediction rule and its reward-prediction error, contrast its one-step backup with MC and DP, work the driving-home and random-walk examples, and show the batch-updating optimality that makes TD approximate the certainty-equivalence estimate.\n",{"path":8414,"title":8415,"module":8395,"summary":8416},"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning","TD Control: Sarsa, Q-learning, and Double Learning","With TD prediction in hand, control follows the generalized-policy-iteration pattern with TD as the evaluation step. We build Sarsa (on-policy), Q-learning (off-policy, targeting the optimal policy), and Expected Sarsa that spans the two, then confront the maximization bias every max-based method inherits and fix it with Double Q-learning. We close past Sutton & Barto, following each one-step tabular update into its deep-RL descendant — DQN, Double DQN, and Rainbow.\n",{"path":8418,"title":8419,"module":8395,"summary":8420},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping","n-Step Bootstrapping","Monte Carlo waits for the full return; one-step TD bootstraps after a single reward. Between them lies a whole spectrum, indexed by one integer n: look ahead n real rewards, then bootstrap from the value n steps out. The n-step return unifies the previous two lessons, and — on the random walk — an intermediate n beats both extremes. We build the n-step return, the n-step TD update, the backup-diagram spectrum, and n-step Sarsa for control.\n",{"path":8422,"title":8423,"module":8395,"summary":8424},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods","n-Step Bootstrapping: Off-Policy Methods","Taking the n-step family off-policy raises the same importance-sampling questions Monte Carlo did, now over a window of exactly n actions. We reweight n-step returns by the policy ratio, watch the ratio product inflate variance on real numbers, then build the tree-backup algorithm that learns off-policy with no ratios at all — and finally n-step Q(sigma), one algorithm whose per-step switch recovers Sarsa, tree backup, and Expected Sarsa as special cases.\n",{"path":8426,"title":8427,"module":8395,"summary":8428},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning","Planning and Learning","Planning and learning are the same operation run on two kinds of experience. A model turns states and actions into simulated transitions; planning backs up values over that simulated experience exactly as learning backs them up over real experience. We build the Dyna architecture that interleaves acting, model-learning, direct RL, and planning in one loop, trace a single Dyna-Q step by hand, and patch the architecture for when the model goes stale.\n",{"path":8430,"title":8431,"module":8395,"summary":8432},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time","Planning: Focusing Updates and Decision-Time Search","Dyna plans by replaying remembered transitions, but sampling them uniformly wastes most of the effort. This lesson sharpens planning: prioritized sweeping works backward from states whose value just changed, expected versus sample updates weigh thoroughness against cost, and trajectory sampling and real-time DP focus updates on the states the policy actually visits. We trace Dyna forward to model-based deep RL, then turn to decision-time planning — heuristic search, rollouts, and Monte Carlo Tree Search.\n",{"path":8434,"title":8435,"module":8395,"summary":8436},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning","Decision-Time Planning","Planning need not build a global policy. Decision-time planning runs a fresh lookahead every time a state arrives and returns just one action, then throws the work away. We start from real-time dynamic programming — asynchronous value iteration on the states the agent actually visits — then move through heuristic search and rollout algorithms, each a one-step policy improvement applied on the fly to the current state.\n",{"path":8438,"title":8439,"module":8395,"summary":8440},"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search","Monte Carlo Tree Search","Monte Carlo Tree Search is a rollout algorithm with memory: it accumulates value estimates across simulations and steers later ones toward promising branches. We work through the four steps — selection, expansion, simulation, backup — the UCT selection rule computed on real numbers, the asymmetric growing tree, and the full pseudocode. We close past Sutton & Barto with the lineage from UCT to AlphaGo, AlphaZero, and MuZero, where a learned network stands in for the leaf value and the rollout.\n",{"path":8442,"title":8443,"module":8444,"summary":8445},"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction","On-Policy Prediction with Approximation","Approximate Solution Methods","Every tabular method so far stored one number per state, which fails once the state space is large or continuous. We replace the table with a parameterized value function $\\hat v(s,\\mathbf{w})$, define the mean squared value error it should minimize under the on-policy distribution, and derive stochastic- and semi-gradient learning rules — the semi-gradient TD(0) update that bootstraps and so is not a true gradient. Linear methods make the analysis clean and give the TD fixed point; feature construction (polynomials, Fourier basis, coarse and tile coding, RBFs) supplies the vectors $\\mathbf{x}(s)$, and neural networks are the nonlinear bridge to deep RL.\n",{"path":8447,"title":8448,"module":8444,"summary":8449},"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear","Feature Construction and Nonlinear Approximation","Linear methods are only as good as the feature vectors $\\mathbf{x}(s)$ fed to them, and this lesson builds those vectors. Polynomials and the Fourier basis turn a state's coordinates into smooth global features; coarse coding, tile coding, and radial basis functions cover a continuous space with overlapping local receptive fields whose size sets the reach of generalization. Then we stop designing features by hand: a neural network learns the representation itself by gradient descent, trading the convergence guarantees of the linear case for expressiveness — the bridge to deep reinforcement learning.\n",{"path":8451,"title":8452,"module":8444,"summary":8453},"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control","On-Policy Control with Approximation","Prediction learned a value function from features; control learns to act. We carry semi-gradient methods over to action values $\\hat q(s,a,\\mathbf{w})$, giving episodic semi-gradient Sarsa and its n-step form, and solve Mountain Car by descending a cost-to-go surface. In the continuing case, function approximation makes discounting unable to affect which policy is best, so we replace it with the average-reward setting — the differential return, differential value functions, and differential semi-gradient Sarsa.\n",{"path":8455,"title":8456,"module":8444,"summary":8457},"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control","Average-Reward Control for Continuing Tasks","With function approximation, discounting has no effect on a continuing task: averaged over the on-policy distribution, the discounted objective equals the average reward times a policy-independent constant, so $\\gamma$ cannot change which policy is best. This lesson replaces discounting with the average-reward setting — the long-run reward rate $r(\\pi)$, the differential return that measures each state's transient advantage over that rate, differential value functions and TD error, and differential semi-gradient Sarsa, the control method for continuing tasks that never invokes a discount factor.\n",{"path":8459,"title":8460,"module":8444,"summary":8461},"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad","Off-Policy Methods and the Deadly Triad","Off-policy learning with function approximation is where the convergence guarantees of reinforcement learning fail. We extend the tabular off-policy updates to semi-gradient form with per-step importance sampling, show Baird's counterexample driving the weights to infinity, and identify the cause: the deadly triad of function approximation, bootstrapping, and off-policy training — any two are safe, all three can diverge. The divergence is not caused by sampling noise: a fully synchronous dynamic-programming update blows up just the same, which is what makes the triad a structural hazard rather than a fluke.\n",{"path":8463,"title":8464,"module":8444,"summary":8465},"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td","Value-Function Geometry and Gradient-TD Methods","Why does the deadly triad diverge, and how do you stop it? This lesson develops the geometry that explains the failure: value functions as vectors, the projection operator onto the representable subspace, and the split between the Bellman error, the value error, and the projected Bellman error: the three objectives have different minimizers. The projected Bellman error is the learnable one, and Gradient-TD methods (GTD2, TDC) do true stochastic gradient descent on it, staying stable even off-policy at $O(d)$ cost. Emphatic TD reweights states instead, and a survey of variance-reduction techniques closes the gap between stability and usable learning.\n",{"path":8467,"title":8468,"module":8444,"summary":8469},"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces","Eligibility Traces","n-step methods unify TD and Monte Carlo by storing the last n feature vectors; eligibility traces do the same job with a single short-term memory vector. The λ-return averages every n-step return under a geometric weighting; the forward view looks ahead to that average, and the backward view produces nearly the same updates online through a decaying trace vector. We build the λ-return, TD(λ) with its trace, the two ways λ recovers TD(0) and Monte Carlo, a note on the exact equivalence of true online TD(λ), and Sarsa(λ) for control.\n",{"path":8471,"title":8472,"module":8444,"summary":8473},"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda","True Online TD(λ) and Sarsa(λ)","Plain TD(λ) makes the forward and backward views nearly agree; this lesson closes the gap. True online TD(λ) uses a dutch trace and a small correction term to produce exactly the same weight sequence as the online λ-return algorithm, at the same memory and only a constant factor more compute — the sharpest statement of the forward\u002Fbackward duality. The whole apparatus then lifts to control unchanged: Sarsa(λ) threads a single delayed reward back along an entire trajectory in one sweep, and the λ-weighting reappears in modern deep RL as generalized advantage estimation.\n",{"path":8475,"title":8476,"module":8444,"summary":8477},"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods","Policy Gradient Methods","Every method so far learned values and read a policy off them. Policy gradient methods drop the intermediary: parameterize the policy directly and climb the performance gradient. We build the softmax-in-preferences parameterization, prove the policy gradient theorem that makes the gradient computable without the unknown state distribution, and derive REINFORCE and its variance-cutting state-value baseline — the launch point for the bootstrapping actor-critic that follows.\n",{"path":8479,"title":8480,"module":8444,"summary":8481},"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions","Actor-Critic Methods and Continuous Actions","REINFORCE with a baseline learns a value function but never bootstraps; this lesson adds the bootstrapping critic that completes the actor-critic architecture. The critic scores each transition into a single TD error that steers both the actor's policy step and its own value step, trading a little bias for much lower variance and fully online, continuing-task learning. The policy gradient theorem carries over unchanged to the average-reward setting, a Gaussian policy handles real-valued actions with self-tuning exploration, and the natural policy gradient leads straight to TRPO, PPO, and the deep actor-critic methods that train today's agents.\n",{"path":8483,"title":8484,"module":8444,"summary":8485},"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods","Least-Squares TD","Semi-gradient TD spends one cheap step per example and needs many examples; this lesson makes the opposite tradeoff. Least-Squares TD (LSTD) accumulates the matrices $\\mathbf{A}$ and $\\mathbf{b}$ and solves the TD fixed point $\\mathbf{w} = \\mathbf{A}^{-1}\\mathbf{b}$ directly, using the Sherman-Morrison identity to maintain the inverse in $O(d^2)$ — the most data-efficient linear TD method, at a quadratic cost. We work a solve by hand, weigh the quadratic cost against semi-gradient TD's cheap steps, and note that LSTD never forgets — a problem in control, where least-squares policy iteration is the natural extension.\n",{"path":8487,"title":8488,"module":8444,"summary":8489},"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods","Memory-Based and Kernel Methods","Least-squares TD spent more compute to extract more from each example; this lesson drops the parametric form entirely. Memory-based methods store training examples untouched and answer a query locally at retrieval time — nearest neighbor, weighted average, locally weighted regression — so accuracy grows with the data and effort concentrates where the agent actually goes. Kernel-based methods weight stored examples by a similarity kernel $k(s,s')$, and every linear method turns out to be a kernel method. Interest and emphasis, finally, make the on-policy weighting itself a design choice, aiming scarce approximation capacity at the states that matter.\n",{"path":8491,"title":8492,"module":8444,"summary":8493},"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces","Off-Policy Eligibility Traces","Eligibility traces meet off-policy learning and function approximation — the corner where stability gets hard. We first let the bootstrapping and discounting parameters vary with state, so a single generalized return covers episodic and continuing tasks and folds termination into the discount. Then we fold the per-decision importance ratio into the trace with a control-variate correction, and build Watkins's Q(λ) and its importance-sampling-free successor Tree-Backup(λ) — all correct in expectation, but still semi-gradient, so the deadly triad and its fixes wait for the next lesson.\n",{"path":8495,"title":8496,"module":8444,"summary":8497},"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces","Stable Off-Policy Methods with Traces","Off-policy traces get the expected target right, but with $\\lambda \u003C 1$ they bootstrap, so off-policy plus bootstrapping plus function approximation is the deadly triad and the weights can diverge. This lesson carries the two one-step fixes to traces: GTD(λ) and GQ(λ) add a second weight vector and a gradient correction for true gradient descent on the projected Bellman error, while Emphatic TD(λ) reweights updates through a followon trace and interest to recover the on-policy stability. It closes with the implementation reality that traces are cheap because they are sparse, and with Retrace and V-trace — the clipped-ratio descendants that make off-policy traces work at deep-RL scale.\n",{"path":8499,"title":7817,"module":8500,"summary":8501},"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks","Deep Reinforcement Learning","Deep Q-networks replace the linear value function with a neural network $Q(s,a;\\mathbf{w})$ and confront the fact that a nonlinear approximator, off-policy bootstrapping, and correlated online data — the deadly triad — make naive Q-learning diverge. DQN counters this empirically with two stabilizers: an experience replay buffer that decorrelates and reuses samples, and a periodically-frozen target network that fixes the bootstrap target. We derive the DQN loss and gradient, walk through the Atari convolutional architecture and its results, and then add the three refinements that define modern value-based deep RL — Double DQN, dueling networks, and prioritized experience replay.\n",{"path":8503,"title":8504,"module":8500,"summary":8505},"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements","DQN Improvements: Double, Dueling, and Prioritized Replay","Three refinements that turn plain DQN into the standard modern value-based agent, each touching a different part of the system. Double DQN fixes the maximization bias in the target by splitting action selection from evaluation; dueling networks restructure the network around a state value and per-action advantages; prioritized replay changes which transitions are learned from. We close with Rainbow, which combines them, and the distributional view that predicts the whole return distribution rather than its mean.\n",{"path":8507,"title":8508,"module":8500,"summary":8509},"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo","Actor–Critic and GAE","Make the actor and the critic deep networks and the policy-gradient architecture becomes modern deep RL. We build the neural actor-critic, the advantage estimate that replaces the raw return, and Generalized Advantage Estimation as a λ-blend of n-step advantages, then the parallel-worker methods A3C and A2C that decorrelate on-policy data. The step-size constraints — trust regions, PPO, and the continuous-control family — follow in the next lesson.\n",{"path":8511,"title":8512,"module":8500,"summary":8513},"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control","PPO and Continuous Control","Keeping the policy-gradient step from destroying the policy, and the algorithms that result. Trust-region optimization bounds each update by a KL constraint; PPO keeps that goal but replaces the second-order machinery with a first-order clip on the probability ratio, which is why it is the modern default and the optimizer inside RLHF. We then tour the off-policy continuous-control family — DDPG, TD3, and SAC — and where actor-critic went at scale, from OpenAI Five to language-model alignment.\n",{"path":8515,"title":8516,"module":8500,"summary":8517},"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies","Case Studies: Learning to Play","The game-playing systems that turned reinforcement learning from a theory into a track record: Samuel's checkers player, TD-Gammon, Watson's Daily-Double wagering, a reinforcement-learning memory controller, DQN, and AlphaGo through AlphaGo Zero. Read as a set they draw one line — a value function, learned by self-play or interaction, refined by search, carried by a deep network — that runs from a 1959 checkers program to superhuman Go.\n",{"path":8519,"title":8520,"module":8500,"summary":8521},"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games","Reinforcement Learning Beyond Games","The same value-and-reward machinery, pointed at problems with no opponent. Web personalization as a contextual bandit and then a full MDP for life-time value; thermal soaring, where a glider learns to climb on turbulent air and reward design does most of the work; and the industrial-scale systems that carried the same design past Sutton & Barto — AlphaStar, OpenAI Five, GT Sophy, and RLHF, where the reward itself is learned from human preference.\n",{"path":8523,"title":8524,"module":8500,"summary":8525},"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers","Frontiers: Beyond the Standard MDP","The standard MDP fixes three things — state, reward, and single-step actions — and this lesson loosens two of them. We generalize the value function into a general value function that predicts any signal, and use those predictions as auxiliary tasks that shape representations; we extend actions in time with the options framework; and we treat state as a construction the agent builds from a stream of observations. Reward design and the open problems follow in the next lesson.\n",{"path":8527,"title":8528,"module":8500,"summary":8529},"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems","Reward Design and Open Problems","How to design a reward signal that encodes the intended goal — sparse reward, shaping, and reward hacking — and the problems the whole tabular, approximate, and deep arc leaves unsolved. We close with how the frontiers were pushed after Sutton & Barto: auxiliary tasks, learned options, intrinsic-motivation bonuses, learned world models, and offline RL, then the two concerns of reward hacking and safety that any real-world agent must address.\n",{"path":8531,"title":8532,"module":8533,"summary":8534},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow","Sharpening DQN: Improvements and the Distributional Idea","Modern Deep Reinforcement Learning","In the years after the 2015 DQN paper, a stream of focused improvements each fixed one weakness of the baseline without disturbing its frame. This lesson recaps five that keep the scalar $Q$-value — Double DQN, multi-step returns, dueling networks, prioritized replay, and NoisyNets, each changing a different slot of the same Q-learning loop — then develops the sixth, distributional RL, which changes the objective itself: learn the whole return distribution $Z(s,a)$. We build the distributional Bellman equation and the C51 categorical algorithm, projection step and all, worked end to end on real numbers. A companion lesson takes up QR-DQN, Rainbow, and the modern distributional line.\n",{"path":8536,"title":8537,"module":8533,"summary":8538},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2","Distributional RL and Rainbow","A companion to the DQN improvements lesson. C51 fixed the return atoms and learned their probabilities; QR-DQN does the reverse — fix the probabilities, learn the values — which removes the projection and trains with a quantile loss. We cover why the distribution helps even when you act on the mean, then assemble Rainbow: all six improvements in one Q-learning loop, with the component ablation that shows each one's real weight. The distributional line then runs on through IQN, FQF, and Agent57, the first agent to beat the human baseline on all 57 Atari games.\n",{"path":8540,"title":8541,"module":8533,"summary":8542},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control","Continuous Control: DDPG and TD3","When actions are real-valued, the $\\arg\\max_a Q(s,a)$ in Q-learning becomes an optimization problem on every step. This lesson builds the off-policy actor-critic family that sidesteps it: the deterministic policy gradient and DDPG, which replaces the max with a learned actor, and the three fixes of TD3 that counter the value overestimation DDPG inherits. A companion lesson takes up SAC's maximum-entropy objective and the methods built on this template.\n",{"path":8544,"title":8545,"module":8533,"summary":8546},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2","Continuous Control: SAC and Beyond","A companion to the DDPG and TD3 lesson. Where those actors are deterministic and explore with bolted-on noise, soft actor-critic (SAC) changes the objective itself: maximize return plus the entropy of the policy, so exploration becomes intrinsic and the agent stays robust. We develop the maximum-entropy objective, the reparameterized squashed-Gaussian actor, and automatic temperature tuning, then survey the methods built on this off-policy template — distributional critics (D4PG), critic ensembles (REDQ), and control from pixels (DrQ, RAD).\n",{"path":8548,"title":8549,"module":8533,"summary":8550},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl","Model-Based Deep RL: Sample Efficiency and PETS","A model turns experience into imagined planning. This lesson makes the sample-efficiency case for learning a dynamics model, works through why a learned model's errors compound over the planning horizon, and builds the most direct model-based method: PETS plans online with a probabilistic ensemble under model-predictive control, distrusting the model exactly where its members disagree. A companion lesson takes up latent world models (Dreamer) and MuZero.\n",{"path":8552,"title":8553,"module":8533,"summary":8554},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2","Model-Based Deep RL: World Models, Dreamer, and MuZero","A companion to the PETS lesson. PETS plans in the environment's native state space; these methods change what the model represents. World Models and Dreamer learn a compact latent state and do almost all their learning by imagining inside it, with value gradients flowing through the differentiable dynamics. MuZero predicts neither states nor pixels — only the reward, value, and policy that MCTS reads — and plans with search against that learned model, AlphaZero without the rules. We close with MBPO, TD-MPC, and EfficientZero.\n",{"path":8556,"title":8557,"module":8533,"summary":8558},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration","Exploration in Deep RL: Novelty as Reward","When the state space is enormous and reward is rare, ε-greedy amounts to a random walk that almost never reaches the first reward. This lesson scales the bandit's exploration ideas up to deep RL through the dominant approach — manufacture a reward for novelty and let the agent chase it: optimism and pseudo-counts from density models, and intrinsic motivation and curiosity (the Intrinsic Curiosity Module and Random Network Distillation). A companion lesson takes up posterior sampling, Go-Explore, and the modern methods.\n",{"path":8560,"title":8561,"module":8533,"summary":8562},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2","Exploration in Deep RL: Posterior Sampling and Go-Explore","A companion to the novelty-as-reward lesson. Pseudo-counts and curiosity reward the unfamiliar after the agent stumbles into it; this lesson covers two ideas that go further. Bootstrapped DQN keeps an ensemble that approximates a posterior over value functions and explores by committing to one sampled hypothesis per episode — the deep, directed exploration ε-greedy cannot manage. Go-Explore remembers and returns to the frontier, defeating detachment and derailment to solve Montezuma's Revenge. We close with episodic memory (Never Give Up), Agent57, and model-based exploration.\n",{"path":8564,"title":8565,"module":8533,"summary":8566},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl","Offline RL: The Problem and Value-Based Fixes","Offline reinforcement learning learns a policy from a fixed logged dataset with no further environment interaction — off-policy learning pushed to the extreme, and it breaks for the extreme version of the same reason. Bootstrapping queries the value function at out-of-distribution actions the data never covers, those errors are optimistic, and with no online feedback to correct them they compound through the Bellman backup. This lesson sets up the failure and off-policy evaluation, then builds the first two families of pessimistic fixes: policy constraint (BCQ) and conservative value estimation (CQL). A companion lesson takes up implicit methods, model-based offline RL, and Decision Transformer.\n",{"path":8568,"title":8569,"module":8533,"summary":8570},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2","Offline RL: Implicit Methods, Sequence Models, and Beyond","A companion to the offline-RL problem lesson. Policy constraint and conservative value estimation both still query a learned value function; implicit methods (IQL) avoid querying it off the data at all, using an in-sample expectile backup. We then build pessimism into a learned model (MOPO, COMBO) and drop bootstrapping entirely with Decision Transformer's return-conditioned sequence modeling, closing with offline-to-online fine-tuning, diffusion planners, and the offline view of RLHF. The one rule throughout: without online correction, be pessimistic about what you cannot verify.\n",{"path":8572,"title":8573,"module":8533,"summary":8574},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl","Imitation Learning: Cloning, DAgger, and Inverse RL","When a reward is hard to specify but an expert is easy to watch, learn from demonstrations instead. Behavioral cloning treats control as supervised learning of the expert's state-to-action map, and fails through compounding error: small mistakes carry the agent off the expert's distribution, where it was never trained. DAgger fixes the mismatch by querying the expert on the learner's own states. Inverse RL instead recovers the reward the expert seems to optimize — an ill-posed problem that maximum-entropy IRL disambiguates. A companion lesson casts imitation as adversarial occupancy matching (GAIL, AIRL).\n",{"path":8576,"title":8577,"module":8533,"summary":8578},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2","Imitation as Adversarial Matching: GAIL and AIRL","A companion to the imitation-learning lesson. If the point of recovering a reward is only to re-run RL and match the expert, you can skip the reward and match the behavior directly. GAIL casts imitation as a GAN — a discriminator separating expert from learner state-action pairs supplies the reward a policy-gradient method optimizes — matching occupancy measures without ever naming a reward. AIRL reads a transferable reward back out of the discriminator. We compare all four methods and close with reward models in RLHF, scaled cloning, and diffusion policies.\n",{"path":8580,"title":8581,"module":8533,"summary":8582},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl","Multi-Agent RL: Markov Games and Centralized Training","With more than one learning agent in an environment, each agent's world becomes non-stationary because the others are changing too. This lesson builds the Markov-game generalization of the MDP, diagnoses non-stationarity as the central obstacle, shows why the naive baselines fail, and develops the dominant fix — centralized training with decentralized execution (MADDPG, VDN, QMIX). A companion lesson takes up self-play, the landmark game-playing systems, and the equilibrium concepts that define what \"solved\" means.\n",{"path":8584,"title":8585,"module":8533,"summary":8586},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2","Multi-Agent RL: Self-Play and Solution Concepts","A companion to the Markov-games lesson. In the purely competitive setting, an agent can generate its own training curriculum by playing against copies of itself — self-play, the method behind AlphaGo, OpenAI Five, and AlphaStar. We develop why self-play produces an ever-improving opponent, the systems it built, and then the equilibrium solution concepts (Nash, correlated, coarse-correlated) that define what \"solved\" means once there is an opponent, closing with PSRO, MAPPO, and the language-model-agent frontier.\n",{"path":8588,"title":8589,"module":8533,"summary":8590},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl","Hierarchical RL: Options and the Option-Critic","Flat RL cannot explore a long horizon: reaching reward through hundreds of primitive actions is exponentially unlikely, and every credit-assignment update crawls one step at a time. Hierarchy breaks one hard long-horizon problem into many short ones. This lesson develops temporal abstraction — the options framework and its semi-Markov view, and learning options end to end with the option-critic. A companion lesson takes up goal-conditioned manager\u002Fworker hierarchies (FeUdal Networks and HIRO), hindsight relabeling, and unsupervised skill discovery.\n",{"path":8592,"title":8593,"module":8533,"summary":8594},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2","Hierarchical RL: Goal-Conditioned Hierarchies and Skills","A companion to the options lesson. Options package a behavior; goal-conditioned hierarchies instead give the top level an explicit language of goals — a manager proposes a target state or a latent direction, and a worker is rewarded for reaching it (FeUdal Networks, HIRO). We develop that architecture, the hindsight relabeling that lets it learn from sparse reward, and unsupervised skill discovery (DIAYN) that learns a repertoire of behaviors with no reward at all. The shared idea throughout: shorten the horizon by inserting a level that decides less often.\n",{"path":8596,"title":8597,"module":8533,"summary":8598},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models","RLHF and Language Models","A language model trained to predict the next token is fluent but not helpful, honest, or harmless — the objective it was optimized for is not the objective we want. RLHF closes that gap by turning the one thing humans do reliably, comparing two outputs, into a reward. We build the three-stage pipeline: supervised fine-tuning, a Bradley-Terry reward model fit to preference pairs, then PPO against that reward with a KL penalty keeping it near the reference policy. We then cover reward hacking and why the KL penalty matters, Direct Preference Optimization, which folds the reward model into a single classification loss, and the RLAIF and verifiable-reward variants. This pipeline is what makes the largest models usable as assistants.\n",{"path":8600,"title":8601,"module":8533,"summary":8602},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps","Partial Observability: POMDPs and the Belief State","Drop the assumption that the agent sees the state. It sees an observation, a partial and noisy function of a hidden state, and one observation is no longer a Markov signal. This lesson builds the POMDP tuple, shows that the belief state — the posterior over hidden states — is a sufficient statistic that turns a POMDP back into an MDP over beliefs, and works the Bayes-filter belief update step by step. A companion lesson explains why exact planning is intractable and develops the deep-RL answer of recurrent, history-based policies.\n",{"path":8604,"title":8605,"module":8533,"summary":8606},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2","Partial Observability: Planning and Recurrent Policies","A companion to the belief-state lesson. In principle a POMDP reduces to an MDP over beliefs; in practice two obstacles block that. Exact planning over the belief simplex is intractable — the value function is piecewise-linear-and-convex with a number of pieces that can explode — and computing the belief needs a model the agent rarely has. This lesson develops the intractability, the point-based approximations that address it, and the deep-RL answer: make the policy a function of history with a recurrent network (DRQN, R2D2), with frame-stacking, attention, and world-model latents as learned beliefs.\n",{"path":8608,"title":8609,"module":8533,"summary":8610},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl","Safe and Constrained RL: The CMDP and Policy Methods","Maximizing a scalar reward is not the same as behaving well: a capable optimizer will find and exploit any gap between the reward and what its designer actually meant, a failure called specification gaming or reward hacking. The remedy is to add explicit cost constraints — the constrained MDP — maximizing return subject to an expected-cost budget. This lesson builds the core toolkit: the CMDP itself, Lagrangian primal-dual methods that learn a multiplier on the constraint (RCPO), and constrained policy optimization (CPO) with its trust-region cost bound. A companion lesson covers risk-sensitivity, safe exploration, and the alignment framing.\n",{"path":8612,"title":8613,"module":8533,"summary":8614},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2","Safe RL: Risk, Safe Exploration, and Alignment","A companion to the constrained-MDP lesson. Constraining the mean cost is not enough: a policy safe on average can be catastrophic in the tail, and a policy safe at convergence can violate its limits wildly while learning. This lesson optimizes the tail with risk-sensitive objectives (CVaR), then makes exploration itself safe with shields, Lyapunov methods, and safety layers that project unsafe actions onto the feasible set — closing with benchmarks, safe RLHF, robustness, and the alignment framing that ties safety back to the problem of incompletely specified reward.\n",{"path":8616,"title":8617,"module":8533,"summary":8618},"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization","Meta-RL and Generalization","An agent that masters one task often fails on the next; it has overfit to a single environment. This lesson treats fast adaptation as a meta-problem over a distribution of tasks: meta-train so that a few episodes at meta-test time suffice. We cover the two families — optimization-based (MAML learns an initialization) and context-based (RL-squared and PEARL infer a latent task) — the exploration cost of adaptation, and the parallel problem of generalization: why deep RL memorizes environments and what fixes it (domain randomization, procedural generation, augmentation, regularization). It closes on foundation models and sequence-model agents as the generalist endpoint.\n",{"path":8620,"title":8621,"module":8622,"summary":8623},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement","The Psychology of Reinforcement","Reinforcement Learning in Minds and Brains","Reinforcement learning is both an engineering method and a theory of how animals learn. The prediction\u002Fcontrol split of the algorithms mirrors the psychologist's split between classical and instrumental conditioning. We trace the correspondence: the Rescorla–Wagner model as a prediction-error rule that explains blocking, its real-time TD extension, Thorndike's Law of Effect behind trial-and-error control, and the habitual\u002Fgoal-directed distinction that maps onto model-free versus model-based learning.\n",{"path":8625,"title":8626,"module":8622,"summary":8627},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control","The Psychology of Reinforcement: Instrumental Control","Classical conditioning was prediction; instrumental conditioning is control. Thorndike's Law of Effect is trial-and-error control — selection plus association, search plus memory — and Skinner's shaping and schedules are reward engineering. The habitual\u002Fgoal-directed distinction maps onto model-free versus model-based control, dissociated by outcome devaluation and arbitrated by uncertainty. Delayed reinforcement is the credit-assignment problem, and the stimulus traces and secondary reinforcers of animal-learning theory are eligibility traces and value functions.\n",{"path":8629,"title":8630,"module":8622,"summary":8631},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error","Dopamine and the TD Error","The TD error was invented as an algorithm; a decade later it turned out to closely describe the firing of the brain's dopamine neurons. We follow Schultz's experiments — dopamine fires at an unpredicted reward, shifts to the earliest predictive cue, and dips below baseline when a predicted reward is withheld — and match each result to the TD error term by term. We then read the basal ganglia as a neural actor–critic with dopamine as its shared training signal, and close on addiction as a hijacking of that signal.\n",{"path":8633,"title":8634,"module":8622,"summary":8635},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain","Dopamine in the Brain: The Neural Actor–Critic","If phasic dopamine is a TD error, where does it go and what does it change? We follow the axons into the basal ganglia, read the corticostriatal synapse as the place where state, action, and error meet, and map the ventral and dorsal striatum onto the critic and the actor of an actor–critic. Addiction becomes a broken cancellation in the same learning signal, and distributional dopamine extends the scalar RPE into a population code.\n",{"path":8637,"title":8638,"module":8622,"summary":8639},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition","Animal Learning and Cognition","Three classic associative phenomena turn out to be reinforcement-learning mechanisms seen in behavior. Blocking says learning is driven by prediction error, not co-occurrence, and reduces to least-squares regression fitting a collinear feature. Higher-order conditioning and conditioned reinforcement make a value estimate a secondary reinforcer — bootstrapping in an animal. Delayed reinforcement is the credit-assignment problem, and the stimulus traces and goal gradients of Pavlov and Hull are eligibility traces and TD-learned value functions.\n",{"path":8641,"title":8642,"module":8622,"summary":8643},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning","Cognitive Maps and Model-Based Learning","Tolman's rats learned the layout of a maze with no reward, then used it the moment food appeared — latent learning, a cognitive map, and the behavioral face of model-based reinforcement learning. The map is learned by system identification (stimulus–stimulus associations), which fills in whether or not reward is present, and queried by planning, which re-solves a route from a single changed reward. The successor representation sits between cache and model, and hippocampal predictive maps and scaled-up world models carry the same idea into brain and machine.\n",{"path":8645,"title":8646,"module":8622,"summary":8647},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement","The Neuroscience of Reinforcement","The dopamine story is one contact point between reinforcement learning and the brain; this lesson fills in the surrounding neuroscience so the mapping stands on its own. We build a working primer of neurons, synapses, and neuromodulation; separate four signals that casual usage conflates — reward, reinforcement, value, and prediction error; and read the actor and critic as corticostriatal synapses updated by two- and three-factor rules, grounded in spike-timing-dependent and reward-modulated plasticity.\n",{"path":8649,"title":8650,"module":8622,"summary":8651},"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems","The Brain's Several Learning Systems","The actor's three-factor rule has an ancestor in Klopf's hedonistic neuron — a single cell as a reinforcement-seeking agent — and a bacterium's run-and-twiddle shows the Law of Effect with no synapses at all. Teams of such neurons implement policy gradient collectively, the broadcast reward replacing backpropagation. And the brain is not only model-free: outcome devaluation, prefrontal value coding, and hippocampal forward sweeps localize a model-based system. The recurring conclusion is that the brain is several interacting learning systems, not one algorithm.\n",{"path":8653,"title":7809,"module":6,"summary":6},"\u002Freinforcement-learning",{"path":8655,"title":8656,"module":4995,"summary":8657},"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai","What Is Artificial Intelligence?","Eight definitions of AI fall into a two-by-two grid: think versus act, and measure success against human performance versus an ideal standard of rationality. We work through all four schools — the Turing test, cognitive modelling, the laws of thought, and the rational agent — and adopt the last as the frame for the whole course: AI is the study and design of rational agents.\n",{"path":8659,"title":8660,"module":4995,"summary":8661},"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai","The Foundations of AI","Where the rational-agent idea came from and what surrounds it. AI inherited its core tools from eight older disciplines — philosophy, mathematics, economics, neuroscience, psychology, computer engineering, control theory, and linguistics. Its history runs in cycles of boom and winter, from the 1956 Dartmouth workshop through expert systems to the statistical turn. And the deep-learning era — AlexNet, the Transformer, GPT-3, AlphaGo — is a new way of computing the agent function at scale, not a new definition of AI.\n",{"path":8663,"title":8664,"module":4995,"summary":8665},"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents","Intelligent Agents","An agent perceives an environment through sensors and acts on it through actuators; its behavior is an agent function mapping percept sequences to actions. A rational agent chooses, for each percept sequence, the action that maximizes its expected performance measure given its knowledge. We build the first half of the vocabulary the whole course rests on — the agent function, rationality, PEAS task specifications, and the six axes along which task environments vary.\n",{"path":8667,"title":8668,"module":4995,"summary":8669},"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures","Agent Architectures","How to build a program that computes a good agent function without storing an astronomically large lookup table. Four skeleton architectures in order of increasing power — simple reflex, model-based, goal-based, and utility-based — plus the learning agent that improves any of them, the scale of world representations (atomic, factored, structured) they rest on, and how a modern language-model agent fits the same frame.\n",{"path":8671,"title":8672,"module":8673,"summary":8674},"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search","Uninformed Search","Search","A goal-based agent that cannot see which action is best turns the problem into a state space — an initial state, a set of actions, a transition model, a goal test, and a path cost — and searches for a sequence of actions reaching the goal. We build the state-space formulation on the 8-puzzle and route-finding, give the one TREE-SEARCH \u002F GRAPH-SEARCH skeleton every algorithm specializes, and measure strategies by completeness, optimality, and complexity. This lesson develops the first two frontier disciplines — breadth-first and uniform-cost search; the rest follow in the next lesson.\n",{"path":8676,"title":8677,"module":8673,"summary":8678},"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared","Search Strategies Compared","Breadth-first and uniform-cost search pay for optimality in memory. This lesson develops the strategies that trade memory for depth: depth-first search, which keeps only the current path; depth-limited and iterative-deepening search, which fix DFS's failure on infinite paths; and bidirectional search, which meets in the middle for a square-root saving. It closes by lining up all six uninformed strategies against completeness, optimality, and complexity, and tracing where the algorithms came from and where they went.\n",{"path":8680,"title":8681,"module":8673,"summary":8682},"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search","Informed Search and A*","An informed search uses a heuristic $h(n)$, an estimate of the cost from a node to the goal, to decide what to expand next. Greedy best-first search follows the heuristic blindly and gives up optimality; A* corrects it by ranking nodes on $f(n) = g(n) + h(n)$, and is optimal when the heuristic is admissible (tree search) or consistent (graph search). This lesson defines the heuristic, builds best-first search, and proves why A* is optimal, with the contour picture that explains its pruning. Where good heuristics come from is the next lesson.\n",{"path":8684,"title":8685,"module":8673,"summary":8686},"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions","Heuristic Functions and Memory-Bounded Search","A* is only as good as its heuristic, so this lesson answers where good heuristics come from: relaxed problems, whose exact solution cost is an admissible heuristic, and pattern databases, which precompute subproblem costs. It measures heuristic quality with dominance and the effective branching factor, then tackles A*'s memory problem with IDA*, RBFS, and SMA*. It closes with modern heuristic search — weighted A*, learned and disjoint pattern-database heuristics, and bidirectional A*.\n",{"path":8688,"title":8689,"module":8673,"summary":8690},"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search","Local Search and Optimization","When the path to a goal is irrelevant and only the final state matters, we can discard the search tree entirely and keep just the current state, moving to a better neighbor at each step. This lesson builds the state-space landscape metaphor, works through hill climbing and the three obstacles that defeat it (local maxima, ridges, plateaus), then develops the first escapes: random restarts and simulated annealing with its temperature schedule. The population-based methods and continuous-space calculus follow in the next lesson.\n",{"path":8692,"title":8693,"module":8673,"summary":8694},"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search","Population and Continuous Search","Single-state local search escapes a trap by restarting or tolerating downhill moves. This lesson develops the alternatives that keep several states at once — local beam search, which shares successors across parallel threads, and genetic algorithms, which recombine two parents through crossover and mutation — then crosses into continuous spaces, where calculus replaces the finite neighbor set: gradient ascent, line search, and Newton's method. It closes with the industrial descendants of these methods and the loop they all share.\n",{"path":8696,"title":8697,"module":8673,"summary":8698},"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search","Adversarial Search and Games","When another agent plans against you, search becomes a game. We formalize two-player, zero-sum, perfect-information games as search problems, define the minimax value that optimal play backs up through the game tree, and give the MINIMAX algorithm that computes it. Alpha–beta pruning then cuts the cost of that search roughly in half in the exponent without changing the answer, and a heuristic evaluation function plus a cutoff test turns the exact algorithm into a real-time player that copes with the horizon effect.\n",{"path":8700,"title":8701,"module":8673,"summary":8702},"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information","Games of Chance and Imperfect Information","Minimax and alpha–beta assume a deterministic game both players can see in full. Drop either assumption and search must change. This lesson adds chance nodes and the expectiminimax value for games with dice, then belief-state reasoning for partially observable games — Kriegspiel and card games — where averaging over clairvoyance both helps and misleads. It closes with the line from Deep Blue's alpha–beta to AlphaGo's learned evaluation and Monte Carlo tree search, and the provable-pruning and self-play research around each end of that story.\n",{"path":8704,"title":8705,"module":8673,"summary":8706},"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction","Constraint Satisfaction Problems","A constraint satisfaction problem replaces the black-box state with a factored one: variables, domains, and constraints. That structure supports inference before any search runs. This lesson defines the CSP on map coloring, Sudoku, and scheduling, then develops constraint propagation: node and arc consistency, the AC-3 algorithm that makes a whole network arc-consistent, and the way one deleted value cascades across the graph to prune impossible options ahead of search.\n",{"path":8708,"title":8709,"module":8673,"summary":8710},"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure","CSP Search and Structure","Propagation prunes a CSP but rarely finishes it, so we search. This lesson builds backtracking search over partial assignments and the general-purpose heuristics that make it fast — MRV, degree, least-constraining-value, forward checking, MAC, and intelligent backtracking. It then shows how the shape of the constraint graph controls difficulty: tree-structured problems fall in linear time, cutset conditioning handles the rest, and min-conflicts local search solves a million queens in a constant number of steps.\n",{"path":8712,"title":8713,"module":8673,"summary":8714},"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty","Search Under Uncertainty","Classical search assumes the agent knows the state it is in and exactly what each action does. Drop the second assumption and a plan can no longer be a fixed sequence of actions. This lesson develops the first response: AND-OR search over nondeterministic actions, which returns a branching contingency plan rather than a straight line. We build it on the erratic vacuum world, show how OR nodes (the agent's choices) alternate with AND nodes (nature's outcomes), trace the recursion that finds a plan, and handle the case where the only solution is a cyclic \"try, try again.\"\n",{"path":8716,"title":8717,"module":8673,"summary":8718},"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search","Belief-State and Online Search","When the agent cannot see the full state, a plan can no longer test where it actually is — it must reason over the set of states it might be in. This lesson develops belief-state search, from sensorless (conformant) planning that coerces an unknown world into a goal, through the predict-observe-update cycle of contingent planning with percepts, to online search in unknown environments, where the agent must act in order to learn. It closes with LRTA*, which refines its own heuristic as it explores, one step from reinforcement learning.\n",{"path":8720,"title":8721,"module":8722,"summary":8723},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic","Logical Agents and Propositional Logic","Logic and Planning","A knowledge-based agent keeps a store of sentences and acts by asking it what to do. To make \"asking\" mean something we need entailment — the relation $KB \\models \\alpha$ that holds when every model of the knowledge base is a model of the query. Propositional logic gives a syntax and a truth-table semantics for which entailment is decidable. This first part builds the foundations: the agent loop, the Wumpus World, models and entailment, the connectives and truth tables, theorem proving by refutation, and the resolution rule with its CNF conversion — a single complete inference procedure for all of propositional logic.\n",{"path":8725,"title":8726,"module":8722,"summary":8727},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference","Propositional Inference and Logical Agents","Model checking and resolution decide entailment, but both can blow up. This part turns propositional logic into a practical engine and a working agent. Horn clauses give linear-time forward and backward chaining — the basis of logic programming. DPLL and WalkSAT make satisfiability testing fast in the common case. Then we make the agent situated: time-indexed fluents, the frame problem and its solution by successor-state axioms, a hybrid agent that deduces a safe map and plans a route through it, and SATPlan, which finds a plan by asking a SAT solver for a satisfying model.\n",{"path":8729,"title":8730,"module":8722,"summary":8731},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic","First-Order Logic","Propositional logic can only say that facts hold; it cannot talk about the objects a fact is about, or state a rule once and have it cover every object. First-order logic fixes this by committing to a world of objects, relations, and functions. This first part builds the language from the ground up: the ontology it commits to, the model that gives a sentence a truth value, the syntax of terms and sentences, the two quantifiers with their standard mistakes, and equality.\n",{"path":8733,"title":8734,"module":8722,"summary":8735},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use","First-Order Logic in Use","With the language of first-order logic in hand, this part is about using it well. Database semantics trades expressive power for the convenience of a single intended model; higher-order logic shows what first-order logic gives up for decidability. Then we put the language to work: the Tell\u002FAsk interface, the kinship domain axiomatized from scratch, and the seven-step knowledge-engineering process applied to a digital circuit.\n",{"path":8737,"title":8738,"module":8722,"summary":8739},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution","Inference in First-Order Logic","Propositional inference lifts to first-order logic once we can make terms match. Unification is that machinery: the algorithm that finds the substitution making two expressions identical, and the basis of generalized modus ponens. This first part builds the lifted inference rules and the two chaining algorithms they drive — forward chaining, the data-driven procedure behind production systems and Datalog, and backward chaining, the goal-driven procedure behind Prolog.\n",{"path":8741,"title":8742,"module":8722,"summary":8743},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution","First-Order Resolution","Chaining is complete only for Horn knowledge bases. General first-order sentences — with disjunctive conclusions and negations — need a single sound and complete rule: resolution. This part converts arbitrary sentences to CNF by skolemizing away the existentials, lifts the resolution rule with unification, and proves entailment by refuting the negated goal. The result is the proof procedure Gödel's completeness theorem guarantees will find any entailment, together with the search strategies that make it usable.\n",{"path":8745,"title":8746,"module":8722,"summary":8747},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning","Classical Planning","Classical planning represents a problem in a factored language, PDDL: states are sets of ground fluents, and actions are lifted schemas with a precondition and an effect. That structure turns planning into search — forward through states or backward through goals — and lets a program read heuristics straight off the schemas by relaxing the problem. This first part develops the representation, the two search directions, and the domain-independent heuristics that come from ignoring preconditions or delete lists.\n",{"path":8749,"title":8750,"module":8722,"summary":8751},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan","Planning Heuristics and GraphPlan","Every relaxation heuristic can be inaccurate, and none can tell how far apart subgoals sit. The planning graph is a polynomial-size structure that does better: leveled off the problem, it yields admissible distance estimates and a record of which actions and fluents cannot coexist. This part builds the graph, reads heuristics from it, extracts plans with GraphPlan, and closes with the other classical approaches — SATPlan and partial-order planning — and the representational trade that makes all of it work.\n",{"path":8753,"title":8754,"module":8722,"summary":8755},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world","Planning and Acting in the Real World","Classical planning's clean theory rests on four assumptions: time is ignored, actions are atomic, the world is deterministic and fully observable, and the agent is alone. This first part drops the first two. We add durations and resource constraints — turning a plan into a schedule, solved by the critical-path method and, once resources contend, by NP-hard job-shop scheduling — and let a planner reason at multiple levels of abstraction through high-level actions and their angelic reachable sets.\n",{"path":8757,"title":8758,"module":8722,"summary":8759},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty","Planning Under Uncertainty","Classical planning assumed the world was deterministic, fully observable, and the agent alone. This part drops the last two assumptions. When the agent cannot see or predict the world, planning moves into belief-state space: sensorless plans that coerce the world into the goal without sensing, contingent plans that branch on what is sensed, and online agents that monitor and replan when execution diverges. Then we add other agents — joint plans, the coordination problem, and the conventions that let a team act without constant negotiation.\n",{"path":8761,"title":8762,"module":8722,"summary":8763},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation","Knowledge Representation","First-order logic gives you the language; this lesson is about what to say in it. This first part builds the content: a general upper ontology from the top down, categories as first-class objects with taxonomies and inheritance, physical composition and the count-noun\u002Fmass-noun split, events and time reified through the event calculus, and belief modeled with modal logic — the machinery for representing the world an agent reasons about.\n",{"path":8765,"title":8766,"module":8722,"summary":8767},"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults","Reasoning Systems and Default Logic","Having represented the world, this part is about reasoning with it at scale. Semantic networks give a graphical notation with fast inheritance; description logics keep subsumption and classification tractable by design. Then we confront the fact that most useful rules hold only by default: circumscription and default logic give a logical account of nonmonotonic reasoning, and truth maintenance systems retract conclusions cleanly when the beliefs beneath them change.\n",{"path":8769,"title":8770,"module":8771,"summary":8772},"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes","Quantifying Uncertainty","Uncertainty","Logic breaks down in any domain where the rules have exceptions you cannot enumerate — the qualification problem. Probability replaces truth values with degrees of belief that obey Kolmogorov's axioms, and the full joint distribution becomes a knowledge base from which any query is answered by summing entries: marginalization, conditioning, and normalization. Independence factors that joint into smaller pieces — the first step toward a calculus of rational belief that an agent can actually compute with.\n",{"path":8774,"title":8775,"module":8771,"summary":8776},"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes","Bayes' Rule and Naive Bayes","Bayes' rule inverts a causal model into a diagnostic one, turning \"how a cause produces its symptoms\" into \"which cause explains what I observed.\" Ignoring the prior is the base-rate fallacy behind overconfident test results. Conditional independence then lets several pieces of evidence combine by multiplying likelihood ratios instead of building an exponential joint, giving the naive Bayes model and pointing directly at Bayesian networks.\n",{"path":8778,"title":8779,"module":8771,"summary":8780},"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks","Bayesian Networks","A Bayesian network is a directed acyclic graph of random variables in which each node carries a conditional probability table for itself given its parents. That structure factors the full joint distribution into a product of local terms, turning an exponential table into a linear one, and it makes the conditional independences of the domain explicit. We build the canonical burglary–alarm network, read compactness and d-separation off the graph, run exact inference by variable elimination, and, where that is intractable, estimate answers by sampling.\n",{"path":8782,"title":8783,"module":8771,"summary":8784},"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks","Bayesian Networks: Inference and Relational Models","When exact inference is intractable, sampling estimates the posterior instead: prior and rejection sampling, likelihood weighting, and Gibbs\u002FMCMC, whose error shrinks as one over the square root of the sample count. The same graphical idea then lifts from a fixed set of variables to whole populations — relational and open-universe probability models write dependencies once and unroll them over objects — and we close by placing probability against the rule-based, Dempster–Shafer, and fuzzy alternatives it displaced.\n",{"path":8786,"title":8787,"module":8771,"summary":8788},"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time","Probabilistic Reasoning over Time","A world that changes needs a state variable at every point in time. The Markov assumption cuts the dependence on history down to the previous slice, leaving a transition model and a sensor model that define a temporal Bayesian network. Four recursive tasks fall out — filtering, prediction, smoothing, and the most likely explanation — each a message passed along the sequence. We ground them in hidden Markov models and their matrix form, sketch the Kalman filter for continuous state, and reach dynamic Bayesian networks with particle filtering as the general approximate method.\n",{"path":8790,"title":8791,"module":8771,"summary":8792},"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association","Reasoning over Time: Tracking and Data Association","Dynamic Bayesian networks generalize HMMs and Kalman filters to arbitrarily many state variables per slice, and when exact inference blows up, particle filtering approximates the belief state with a population of weighted samples that propagate, reweight, and resample. Tracking several objects at once adds the data-association problem — which observation came from which object — whose combinatorics defeat any exact filter, so particle filters and MCMC keep many hypotheses alive. We close with SLAM and learned state-space models.\n",{"path":8794,"title":8795,"module":8771,"summary":8796},"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions","Making Decisions: Utility Theory","A rational agent chooses the action that maximizes expected utility — the probability of each outcome weighted by how much the agent wants it. We derive the utility function from six axioms on preferences, so maximizing expected utility is forced by consistency rather than assumed; look at risk aversion in the utility-of-money curve; package one-shot choices into decision networks; and quantify what an observation is worth with the value of information.\n",{"path":8798,"title":8387,"module":8771,"summary":8799},"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes","When an agent must act repeatedly in a stochastic world, a fixed plan is useless — it needs a policy, an action for every state. The Markov decision process makes this precise with a transition model, a reward, and a discount factor; the Bellman equation characterizes the optimal state utilities, and value iteration and policy iteration solve it. Partial observability lifts the problem to belief states, and bandits, Monte-Carlo tree search, and scalable POMDP solvers extend it — this is the model-known half of reinforcement learning.\n",{"path":8801,"title":8802,"module":8771,"summary":8803},"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory","Decision Analysis: Multi-Attribute Utility and Decision Networks","Decision analysis takes the single-agent utility framework and makes it practical: utility over several attributes, dominance and additive value functions, influence diagrams that fold Bayesian networks together with decision and utility nodes, and the value of information that tells an agent which questions are worth asking. Structure in an agent's preferences — dominance, preferential and utility independence — collapses an exponential utility table into a few one-dimensional functions, the same move that made Bayesian networks compact.\n",{"path":8805,"title":8806,"module":8771,"summary":8807},"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design","Game Theory and Mechanism Design","When outcomes depend on other rational agents, single-agent utility maximization no longer suffices. Game theory studies decisions among agents — normal-form games, dominant strategies, Nash and maximin equilibria, and repeated games — and mechanism design runs the logic backwards, engineering rules (auctions, VCG) so that self-interested play produces a good collective outcome. Algorithmic game theory then asks whether equilibria can be computed, what selfishness costs society, and how the mechanisms deployed at internet scale actually behave.\n",{"path":8809,"title":8810,"module":8811,"summary":8812},"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples","Learning from Examples","Learning","An agent that improves with experience does not need its designer to anticipate every situation. Inductive learning takes that ambition and narrows it to one tractable problem: from labelled input-output pairs, recover a function that predicts the output for inputs never seen. This first part builds the foundation around a single organizing question — generalization — through decision trees and information gain, and the training\u002Fvalidation\u002Ftest discipline for evaluating and choosing hypotheses. A second part takes up the theory of learning and the main model families.\n",{"path":8814,"title":8815,"module":8811,"summary":8816},"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families","The Theory of Learning and Model Families","Cross-validation measures generalization but does not explain it. This part supplies the theory — PAC learning, sample complexity, and the VC dimension — that says when a hypothesis consistent with enough data is probably approximately correct, and why an unrestricted hypothesis space can never generalize. It then surveys the model families a practitioner reaches for: linear regression and gradient descent, the perceptron and logistic regression, support vector machines and the kernel trick, and ensembles by bagging and boosting — closing with what deep learning changed about the classical picture.\n",{"path":8818,"title":8819,"module":8811,"summary":8820},"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning","Learning Probabilistic Models","A [Bayesian network](\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks) is useless until its numbers are filled in, and those numbers come from data. This first part casts learning itself as probabilistic inference: hypotheses carry a prior, data update it to a posterior, and predictions average over what remains. From that frame fall the standard estimators — maximum likelihood by counting, MAP with a conjugate prior, full Bayesian updating — for the case where every variable is observed. A second part takes up the harder case of hidden variables and the EM algorithm.\n",{"path":8822,"title":8823,"module":8811,"summary":8824},"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization","Learning with Hidden Variables: The EM Algorithm","Complete data can be learned by counting; real data usually hide some variables — the disease behind the symptoms, the cluster behind the points. This part develops the expectation-maximization algorithm, which learns those models by alternating an expected completion of the missing data with a re-estimation of the parameters. It works the idea through mixtures of Gaussians, Bayesian networks, and hidden Markov models, proves the monotone-likelihood guarantee from the evidence lower bound, and traces the line from EM to variational inference and the variational autoencoder.\n",{"path":8826,"title":7809,"module":8811,"summary":8827},"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning","Reinforcement learning is an MDP with the model unknown: the agent knows neither how its actions move the world nor which states are rewarded, and must recover good behaviour from experienced transitions and rewards alone. This first part builds the classical tabular theory — passive learning (fix a policy, learn its value, by direct estimation, adaptive dynamic programming, and temporal differences) and active learning (choose actions, trade exploration against exploitation, and learn control with Q-learning and SARSA). A second part lifts it off the lookup table with function approximation and policy search.\n",{"path":8829,"title":8830,"module":8811,"summary":8831},"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search","Reinforcement Learning: Generalization and Policy Search","Tabular reinforcement learning stores one number per state, which is hopeless for backgammon or chess. This part lifts RL off the lookup table with function approximation, so that updating one state generalizes to related ones, then turns to policy search — representing and optimizing the policy directly, up to the REINFORCE policy gradient and correlated sampling. It closes with the bridge to deep reinforcement learning (deep Q-networks, actor-critic, PPO), the classic applications, and the hand-off to the dedicated RL subject.\n",{"path":8833,"title":8834,"module":8811,"summary":8835},"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning","Knowledge in Learning","Pure induction learns a function from labelled examples while knowing almost nothing to begin with. This first part brings prior knowledge into the loop by recasting learning as logical inference — hypotheses, examples, and classifications as sentences. It develops current-best-hypothesis search, the version space and its general\u002Fspecific boundary maintained by candidate elimination, and states the three entailment constraints that fix how background knowledge enters. A second part builds the three knowledge-based methods those constraints define.\n",{"path":8837,"title":8838,"module":8811,"summary":8839},"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods","Knowledge-Based Learning: EBL, Relevance, and ILP","Once learning is cast as logical inference, three methods follow from the three ways prior knowledge can enter. Explanation-based learning generalizes a single example by explaining it with the domain theory, gaining speed but nothing new. Relevance-based learning uses determinations to shrink the hypothesis space and converge from fewer examples. Inductive logic programming learns genuinely new first-order rules — top-down with FOIL, bottom-up by inverting resolution, even inventing new predicates — and connects to modern statistical relational and neuro-symbolic learning.\n",{"path":8841,"title":8842,"module":8843,"summary":8844},"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception","Vision and Perception","Frontiers","Perception connects an agent to the physical world. We follow one modality — vision — from the physics of image formation (the pinhole camera, perspective projection, lenses, shading, color) through the early operations that turn a pixel array into edges, texture, and motion, and into recognition by appearance. The recurring problem is inversion: a camera collapses a 3-D world onto a 2-D grid, and an agent that wants to act must build the scene back up. Rebuilding the scene is the subject of the companion lesson.\n",{"path":8846,"title":8847,"module":8843,"summary":8848},"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world","Vision: Reconstructing the 3D World","A camera collapses a three-dimensional world onto a flat grid; this lesson inverts that collapse. We build the camera projection matrix (intrinsics and extrinsics), triangulate a point from two views, then work through the toolbox of depth cues — motion parallax, binocular stereopsis, multiple views, texture, shading, and contour — that turn an ambiguous image back into a scene. We add structural recognition (pictorial-structure \"cardboard people\"), the task-driven use of vision in cars and robots, and the shift from hand-built pipelines to learned deep-vision networks.\n",{"path":8850,"title":8851,"module":8843,"summary":8852},"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics","Robotics","A robot is an agent with a body: sensors that read the physical world and effectors that push back on it. This lesson grounds the abstract AI machinery in that body. We build up the hardware (range finders, proprioception, degrees of freedom), then cast perception as probabilistic filtering — the kinematic motion and sensor models, Monte Carlo localization, the extended Kalman filter, and simultaneous localization and mapping (SLAM). The companion lesson takes the estimated pose forward into planning and control.\n",{"path":8854,"title":8855,"module":8843,"summary":8856},"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control","Robotics: Planning and Control","A robot that knows where it is still has to decide how to move, and then make a slipping, sensing-imperfect body actually go there. This lesson takes the pose estimate forward: planning motion in configuration space with cell decomposition and sampling-based roadmaps (PRMs and RRTs), planning under uncertainty with most-likely-state and online replanning, closing the loop with P\u002FPD\u002FPID control and potential fields, and finally the software architectures — subsumption, three-layer, and pipeline — that assemble it all, plus the learning-based turn in modern robotics.\n",{"path":8858,"title":8859,"module":8843,"summary":8860},"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai","Natural Language for AI Agents","Language is how agents acquire the knowledge already written down and how they communicate with the humans they serve. This lesson gives the classical AI account of language as a source of information: n-gram language models and the information-seeking tasks built on them — text classification, information retrieval (BM25, the inverted index, PageRank), and information extraction with finite-state templates and hidden Markov models. Throughout, we point to the dedicated NLP subject for the modern deep-learning treatment; the companion lesson takes up grammar, translation, and speech.\n",{"path":8862,"title":8863,"module":8843,"summary":8864},"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech","Language for AI Agents: Grammar, Translation, and Speech","N-gram models see only a local window; they cannot say why \"black dog\" is well-formed English and \"dog black\" is not, because that is a fact about structure. This lesson takes up structure: phrase-structure and probabilistic context-free grammars, syntactic analysis by chart parsing and CYK, augmented grammars and compositional semantics, then the two major statistical successes — machine translation and speech recognition — cast as noisy-channel problems. It closes with the bridge from n-grams to transformers and where the classical account sits relative to modern NLP.\n",{"path":8866,"title":8867,"module":8843,"summary":8868},"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future","Philosophy, Ethics, and the Future of AI","Two questions have shadowed the field since its founding: can machines act intelligently (weak AI), and can they really think (strong AI)? We work through Turing's objections and their rebuttals — the arguments from disability, mathematics, and informality — then the strong-AI debate: the mind-body problem, functionalism and the brain prosthesis, Searle's Chinese Room and the systems reply, and consciousness and qualia. The companion lesson turns from what AI can do to what it should, and closes the course.\n",{"path":8870,"title":8871,"module":8843,"summary":8872},"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future","The Ethics and Future of AI","Having asked whether machines can act intelligently and really think, we turn to whether we should build them at all. This lesson works through the six ethical risks — lost jobs, autonomous weapons, surveillance and privacy, biased decisions, the safety of superintelligence, and the erosion of accountability — then the value-alignment problem in the LLM era, and where the classical agent components could go next. It closes the course by tying search, logic, probability, and learning into a single picture of intelligence as rational agency.\n",{"path":8874,"title":8875,"module":6,"summary":6},"\u002Fartificial-intelligence","Artificial Intelligence",{"path":8877,"title":8878,"module":8879,"summary":8880},"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart","Nuclear Composition and Ground-State Properties","Nuclear Properties","The nucleus is a bound assembly of Z protons and N neutrons packed to a radius R = R0 A^(1\u002F3) at a nearly constant density of about 10^17 kg\u002Fm^3. We fix the vocabulary of nuclides, derive nuclear size from mirror-nuclide and electron-scattering data, read the binding-energy-per-nucleon curve, and model it with the liquid-drop semiempirical mass formula.\n",{"path":8882,"title":8883,"module":8879,"summary":8884},"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions","Nuclear Size, Shape, and Charge Distributions","Elastic electron scattering resolves the nucleus by its de Broglie wavelength. The measured cross section is the Mott point-charge cross section modulated by a form factor, and that form factor is the Fourier transform of the charge density. Diffraction minima fix the radius, the small-angle slope fixes the mean-square radius, and the fitted Woods-Saxon profile gives a central density and a skin thickness. Mirror-nucleus Coulomb energies, muonic-atom X-rays, and optical isotope shifts give independent radii that all track R = R0 A^(1\u002F3).\n",{"path":8886,"title":8887,"module":8879,"summary":8888},"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy","Nuclear Masses, Mass Excess, and Separation Energies","The atomic mass unit fixes the scale, and the mass excess collects the small binding-driven deviation from the integer mass number. Penning-trap cyclotron frequencies now measure masses to parts in a billion, and every decay and reaction Q-value is a difference of these masses. One- and two-nucleon separation energies read the binding difference between neighbouring nuclides directly, showing the even-odd pairing stagger and the sharp drops at magic numbers, and their vanishing marks the neutron and proton drip lines that bound the chart of the nuclides.\n",{"path":8890,"title":8891,"module":8879,"summary":8892},"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula","The Semi-Empirical Mass Formula and the Valley of Stability","Five physical terms reproduce nuclear binding across the chart: a volume term from saturation, a surface term from the deficit of edge neighbours, a Coulomb term from the electrostatic self-energy of a charged sphere, an asymmetry term from the Pauli cost of unequal proton and neutron filling, and a pairing term. The formula is quadratic in Z at fixed A, so isobars lie on a mass parabola whose minimum sets the most stable charge and whose slope dictates the direction of beta decay. The same competition between surface and Coulomb energy defines the fissility parameter and the onset of fission.\n",{"path":8894,"title":8895,"module":8879,"summary":8896},"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles","Nuclear Spin, Magnetic Dipole, and Electric Quadrupole Moments","The ground state of a nucleus carries a definite spin and parity, a magnetic dipole moment of order the nuclear magneton, and, when its spin exceeds one-half, an electric quadrupole moment that measures its shape. The single-particle Schmidt lines predict the magnetic moment of an odd-A nucleus from the last unpaired nucleon, and the measured moments fall between them. The quadrupole moment distinguishes prolate from oblate deformation, and hyperfine structure is the experimental handle that fixes the spin and the moments from an atomic spectrum.\n",{"path":8898,"title":8899,"module":8900,"summary":8901},"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview","The Nuclear Force and the Shell Model","The Nuclear Force","The strong force between nucleons is short-range, charge-independent, saturated, and repulsive at its core, about a hundred times stronger than Coulomb. Yukawa explained it as an exchange of massive mesons, tying the force's range to the meson mass through the uncertainty principle. Layered on top, an independent-particle shell model with strong spin-orbit coupling reproduces the magic numbers 2, 8, 20, 28, 50, 82, 126.\n",{"path":8903,"title":8904,"module":8900,"summary":8905},"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron","The Deuteron and the Tensor Force","The deuteron is the only bound two-nucleon state: one shallow level at 2.22 MeV, no excited states. A square-well fit fixes a depth near 35 MeV over a 2 fm range, yet the wavefunction leaks so far past the edge that most of the probability lies outside the force. Its spin-1 ground state, magnetic moment close to the sum of the free-nucleon moments, and small but nonzero electric quadrupole moment together force a D-state admixture and a non-central tensor force.\n",{"path":8907,"title":8908,"module":8900,"summary":8909},"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering","Nucleon-Nucleon Scattering and the Interaction's Structure","Scattering probes the nuclear force above threshold. Partial-wave analysis reduces low-energy data to a single s-wave phase shift, and the effective-range expansion packages that into a scattering length and an effective range. The triplet channel binds (the deuteron) while the singlet is only virtual, which together explain the anomalously large free neutron-proton cross section. Comparing pp, nn, and np results establishes charge symmetry and charge independence, and polarization experiments expose the spin-orbit and tensor pieces.\n",{"path":8911,"title":8912,"module":8900,"summary":8913},"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin","Meson Exchange, the Yukawa Potential, and Isospin","Yukawa's massive-field propagator turns the range of the nuclear force into a meson mass: the exchanged quantum's Compton wavelength is the range. One-pion exchange fixes the long-range tail, complete with the tensor structure the deuteron demanded, while heavier mesons build the intermediate attraction and the repulsive core. Charge independence becomes an isospin symmetry, the force is diagonalized by the total isospin through a tau-dot-tau interaction, and the whole picture sits inside QCD as a residual color force between color-neutral nucleons.\n",{"path":8915,"title":8916,"module":8917,"summary":8918},"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model","The Fermi Gas Model","Nuclear Models","Treating the nucleus as two degenerate Fermi gases of protons and neutrons confined in a common well fixes the Fermi momentum near 250 MeV\u002Fc and the Fermi energy near 33 MeV from the nuclear density alone. The average kinetic energy per nucleon is about 20 MeV, the well depth is the Fermi energy plus the separation energy, and unequal proton and neutron Fermi levels reproduce the asymmetry term of the mass formula.\n",{"path":8920,"title":8921,"module":8917,"summary":8922},"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates","The Liquid-Drop Model and Collective Deformation","Deforming a charged liquid drop into a spheroid raises its surface energy and lowers its Coulomb energy; the two effects compete through the deformation parameter to set a stability minimum and a fission barrier. The ratio of Coulomb to twice the surface energy is the fissility Z-squared over A, which crosses one near 49 and marks the point where the sphere is unstable. The same surface tension that restores small deformations quantizes into collective vibrations, carrying the static mass formula into dynamic collective motion.\n",{"path":8924,"title":8925,"module":8917,"summary":8926},"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle","The Shell Model: Single-Particle States and Spin-Orbit Coupling","A harmonic-oscillator well reproduces the first three magic numbers but fails above twenty; adding a strong inverted spin-orbit term that drives the stretched j equals l plus one-half level down closes the gaps at 28, 50, 82, and 126. The filled shells couple to zero, so the last unpaired nucleon fixes the ground-state spin and parity, and its single-particle magnetic moment falls on the Schmidt lines. Configuration mixing sets the limits of the extreme single-particle model.\n",{"path":8928,"title":8929,"module":8917,"summary":8930},"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations","The Collective Model: Rotations, Vibrations, and Deformed Nuclei","Deformed nuclei rotate with energies proportional to I times I plus one, giving the ground-state band its characteristic level ratios, while near-spherical nuclei vibrate in quantized surface phonons that build one- and two-phonon multiplets. The Nilsson model tracks single-particle levels as the well deforms, moments of inertia fall between the rigid and irrotational limits, backbending marks the sudden alignment of a broken pair, and giant resonances are the bulk dipole and quadrupole modes of the whole nucleus.\n",{"path":8932,"title":8933,"module":8934,"summary":8935},"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes","Radioactivity and Decay Modes","Radioactive Decay","Unstable nuclei decay at a rate proportional to how many remain, giving the exponential law N(t) = N0 e^(-lambda t) with half-life t = 0.693\u002Flambda. We work through the three common modes: alpha decay as Coulomb-barrier tunneling with the Geiger-Nuttall rule, beta decay whose continuous spectrum demands the neutrino, and gamma de-excitation, and follow a decay chain across the chart of nuclides.\n",{"path":8937,"title":8938,"module":8934,"summary":8939},"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium","Serial Decay, the Bateman Equations, and Radioactive Equilibrium","A radioactive parent that decays into a radioactive daughter obeys a coupled pair of rate equations whose solution is the Bateman formula. Depending on the half-life ordering the chain settles into secular equilibrium (equal activities), transient equilibrium (a fixed activity ratio), or no equilibrium. Constant production under irradiation drives the activity toward a saturation value equal to the production rate, competing decay modes split the total decay constant into partial constants, and the natural decay series in secular equilibrium underpin radiometric dating.\n",{"path":8941,"title":8942,"module":8943,"summary":8944},"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory","Alpha Decay and the Gamow Theory of Tunneling","Alpha Decay","The alpha Q-value turns positive above mass number 150 because the emitted helium-4 is exceptionally tightly bound. Emission proceeds by quantum tunneling through the Coulomb barrier: a WKB integral from the nuclear surface to the outer turning point gives the Gamow factor, and multiplying its penetrability by the assault frequency yields half-lives spanning more than twenty orders of magnitude. The leading term reproduces the Geiger-Nuttall relation, log t½ proportional to the daughter charge over the square root of Q.\n",{"path":8946,"title":8947,"module":8943,"summary":8948},"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance","Fine Structure, Angular Momentum, and Hindrance Factors","A single parent emits several alpha groups of slightly different energy, each feeding a distinct level of the daughter, so the alpha spectrum maps the daughter's low-lying states. Emission with orbital angular momentum L raises the barrier by a centrifugal term and is allowed only when angular-momentum and parity selection rules permit. Comparing the measured partial half-life to the Gamow estimate defines a hindrance factor near unity for even-even ground-state transitions and large for odd-A decays that must rearrange the unpaired nucleon.\n",{"path":8950,"title":8951,"module":8952,"summary":8953},"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino","Beta Decay Energetics and the Neutrino","Beta Decay and the Weak Interaction","Beta decay converts a neutron into a proton or the reverse, adjusting Z at fixed A along an isobaric mass parabola. We write the three processes (beta-minus, beta-plus, electron capture), reduce every Q-value to a difference of neutral atomic masses, and read the continuous electron spectrum as the fingerprint of a third, nearly massless particle. Pauli's neutrino, its detection by Reines and Cowan, and the endpoint bound on its mass close the lesson.\n",{"path":8955,"title":8956,"module":8952,"summary":8957},"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay","Fermi's Theory: Kurie Plots and ft Values","Fermi treated beta decay as a point-contact weak transition and read its rate from the golden rule. The electron spectrum then follows from phase space and the Coulomb Fermi function; the Kurie plot straightens it to a line whose intercept is the endpoint. Integrating the spectrum gives the comparative half-life ft, whose logarithm sorts transitions into superallowed, allowed, and forbidden classes governed by the Fermi and Gamow-Teller selection rules.\n",{"path":8959,"title":8960,"module":8952,"summary":8961},"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation","The Weak Interaction and Parity Violation","Beta decay violates mirror symmetry. The Wu experiment on polarized cobalt-60 showed electrons emitted preferentially against the nuclear spin, a pseudoscalar correlation forbidden if parity were conserved. The result fixes the weak charged current as left-handed V minus A, forces neutrinos to be left-handed and antineutrinos right-handed (measured by Goldhaber), and places beta decay within the electroweak theory as W-boson exchange turning a down quark into an up quark.\n",{"path":8963,"title":8964,"module":8952,"summary":8965},"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass","Double Beta Decay and Neutrino Mass","For even-A isobars the pairing term splits the mass parabola into two curves, and a handful of even-even nuclides sit below their odd-odd neighbor yet above the next even-even one: single beta decay is forbidden but second-order double beta decay is allowed. The two-neutrino mode is a standard-model process with the longest measured lifetimes in nature; the neutrinoless mode would require the neutrino to be its own antiparticle and its rate measures the effective Majorana mass, the sharpest probe of the absolute neutrino mass scale.\n",{"path":8967,"title":8968,"module":8969,"summary":8970},"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation","Multipole Radiation and Selection Rules","Gamma Decay","Gamma decay carries a nucleus from an excited state to a lower one by emitting a photon of definite angular momentum and parity. We correct the photon energy for nuclear recoil, expand the radiation field into electric and magnetic multipoles, and read off how the transition rate collapses with each increase in multipole order. The Weisskopf single-particle estimates set the scale, and angular-momentum and parity conservation fix which multipole dominates.\n",{"path":8972,"title":8973,"module":8969,"summary":8974},"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers","Internal Conversion and Isomers","A nucleus can shed excitation energy without emitting a photon by handing it directly to an atomic electron. We define the internal-conversion coefficient, trace its growth with atomic number, multipole order, and decreasing energy, and treat the electron-only E0 transitions and internal pair formation. When the lowest allowed multipole is high and the energy low, the gamma rate falls so far that the excited state survives as a metastable isomer.\n",{"path":8976,"title":8977,"module":8969,"summary":8978},"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer","Angular Correlations and the Mössbauer Effect","Two gammas emitted in cascade are not independent in direction: detecting the first selects magnetic substates of the intermediate level and makes the second anisotropic, so the correlation function fixes the intermediate spin. The same nuclear resonance that recoil normally destroys is recovered when the emitter is locked in a lattice, giving the Mössbauer effect and its part-in-a-trillion resolution of isomer shifts and hyperfine fields.\n",{"path":8980,"title":8981,"module":8982,"summary":8983},"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections","Nuclear Reactions, Fission, and Fusion","Nuclear Reactions","A nuclear reaction X(x, y)Y is governed by its Q value and its cross section, the effective target area for a given process. Splitting the curve of binding energy near iron in either direction releases energy: fission of heavy nuclei by neutron capture and a chain reaction, and fusion of light nuclei that powers the Sun and needs Lawson's density-confinement criterion to be practical.\n",{"path":8985,"title":8986,"module":8982,"summary":8987},"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances","The Compound Nucleus and Resonance Reactions","Low-energy reactions proceed through a long-lived intermediate state whose decay forgets how it formed. Bohr's independence hypothesis factorizes the cross section into a formation step and a branching ratio, an isolated level gives the single-level Breit-Wigner line shape with total width Γ tied to the lifetime by Γτ = ħ, and at high excitation overlapping levels merge into a statistical continuum described by evaporation spectra and the Hauser-Feshbach average.\n",{"path":8989,"title":8990,"module":8982,"summary":8991},"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model","Direct Reactions and the Optical Model","A complex optical potential replaces the many-body target by a single particle moving in an average field whose imaginary part removes flux into non-elastic channels, reproducing the diffraction pattern of elastic scattering. Direct reactions bypass the compound nucleus, transferring a nucleon in one step: stripping and pickup deposit or remove a single nucleon, the angle of the first peak in the distorted-wave angular distribution fixes the transferred orbital angular momentum, and its magnitude gives the spectroscopic factor.\n",{"path":8993,"title":8994,"module":8995,"summary":8996},"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics","The Fission Barrier and Fragment Energetics","Nuclear Fission","Fission is the large-amplitude collective deformation of a heavy nucleus into two fragments. The liquid-drop model sets a barrier from the competition between rising surface energy and falling Coulomb energy under quadrupole deformation, with the fissility parameter Z²\u002FA measuring how close a nucleus is to instability. Bohr-Wheeler theory separates spontaneous from neutron-induced fission, the fragment mass yield is double-humped and asymmetric, about 200 MeV is released per event, and shell corrections add a second minimum that produces fission isomers.\n",{"path":8998,"title":8999,"module":8995,"summary":9000},"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics","Chain Reactions and Reactor Physics","A self-sustaining chain reaction is a fixed point of neutron bookkeeping: the multiplication factor k counts the neutrons in one generation per neutron in the last, and criticality is k = 1. The four-factor formula tracks a neutron through fast fission, resonance escape, thermal utilization, and reproduction; moderation slows fission neutrons to the thermal energies where the fission cross section is largest; and the small delayed-neutron fraction sets the timescale that makes a reactor controllable. Breeding converts fertile U-238 and Th-232 into new fissile fuel.\n",{"path":9002,"title":9003,"module":9004,"summary":9005},"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement","Fusion Reactions and Confinement","Fusion and Nucleosynthesis","Light nuclei release energy when they fuse because binding per nucleon rises steeply toward the iron peak, but the Coulomb barrier suppresses the rate at reactor temperatures. The thermonuclear rate is a convolution of the Maxwell distribution with the tunneling probability, sharply peaked at the Gamow energy. The deuterium-tritium reaction has the lowest barrier and largest cross section; sustained energy gain requires the Lawson triple product of density, temperature, and confinement time, reached by magnetic or inertial confinement.\n",{"path":9007,"title":9008,"module":9004,"summary":9009},"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis","Stellar Nucleosynthesis","Main-sequence stars burn hydrogen to helium through the proton-proton chain and the CNO cycle, both releasing 26.7 MeV per helium nucleus. Helium burning bridges the mass-5 and mass-8 gaps by the triple-alpha process through the Beryllium-8 and Hoyle resonances, and successive carbon-to-silicon burning stages climb to the iron peak, where fusion stops. The elements beyond iron are built by slow and rapid neutron capture, and the solar neutrino flux confirms the reactions directly.\n",{"path":9011,"title":9012,"module":9004,"summary":9013},"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis","Big-Bang Nucleosynthesis","In the first three minutes the expanding universe forged the light elements. The weak interaction froze the neutron-to-proton ratio near one in six when the reaction rate fell below the expansion rate, and free-neutron decay lowered it to about one in seven before the deuterium bottleneck broke. Almost every surviving neutron ended in helium-4, fixing the primordial helium mass fraction near 0.25, with trace deuterium, helium-3, and lithium-7. The deuterium abundance measures the cosmic baryon density.\n",{"path":9015,"title":9016,"module":9017,"summary":9018},"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power","Stopping Power and the Range of Charged Particles","Radiation and Applications","A heavy charged particle loses energy in a dense sequence of small Coulomb collisions with atomic electrons, at a rate the Bethe-Bloch formula fixes from the particle's charge and speed and the medium's electron density and mean excitation energy. The rate scales as the inverse square of the speed, so most energy is deposited at the end of the track in the Bragg peak, and integrating the reciprocal rate gives a sharp range. Electrons differ: they also radiate, and above a critical energy bremsstrahlung dominates. Fast particles above the phase velocity of light in the medium emit Cherenkov radiation.\n",{"path":9020,"title":9021,"module":9017,"summary":9022},"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions","Interactions of Photons and Neutrons","Photons are removed from a beam in single events, so their intensity falls exponentially with a linear attenuation coefficient built from three processes: the photoelectric effect at low energy, Compton scattering at intermediate energy, and pair production above twice the electron rest energy, each with its own atomic-number and energy dependence. Neutrons carry no charge and interact only with nuclei, moderating by elastic scattering and being captured with a cross section that rises as one over speed away from resonances.\n",{"path":9024,"title":9025,"module":9017,"summary":9026},"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors","Radiation Detectors and Nuclear Spectroscopy","Every detector converts the energy a radiation deposits into a measurable electrical signal. Gas counters read the ionization directly, in three operating regions set by the applied voltage; scintillators convert the energy to light read out by a photomultiplier; semiconductor detectors collect electron-hole pairs and give the best energy resolution because so many carriers are made per event. The resolution is governed by the number of independent charge carriers, and the pulse-height spectrum of a gamma line shows a full-energy photopeak, a Compton continuum with its edge, and escape peaks.\n",{"path":9028,"title":9029,"module":9017,"summary":9030},"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology","Dosimetry, Radiation Biology, and Protection","Absorbed dose is the energy deposited per unit mass, measured in gray. Equal absorbed doses do unequal biological damage because densely ionizing radiation deposits its energy along short tracks: weighting the dose by a radiation factor gives the equivalent dose, and weighting by tissue sensitivity gives the effective dose, both in sieverts. Deterministic effects have a threshold and a severity that grows with dose; stochastic effects are assumed to follow a linear-no-threshold probability. Natural background dominates the dose to the population, and protection rests on time, distance, and shielding.\n",{"path":9032,"title":9033,"module":9017,"summary":9034},"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine","Applications — Dating, Analysis, and Nuclear Medicine","Charged particles lose energy continuously and stop at a well-defined range with a Bragg peak, while gamma rays are attenuated exponentially. These interactions define radiation detectors and dosimetry (gray and sievert) and drive the applications: neutron activation analysis, magnetic resonance imaging, PET, and radiometric dating with carbon-14 and long-lived rock clocks.\n",{"path":9036,"title":9037,"module":6,"summary":6},"\u002Fnuclear-physics","Nuclear Physics",{"path":9039,"title":9040,"module":4995,"summary":9041},"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp","What Is Natural Language Processing?","Natural language processing is the computational treatment of human language: reading it, representing it, and generating it. We set up why the problem is hard — ambiguity at every level, from sound to intent — trace the field from ELIZA's pattern-matching through statistical methods to today's neural models, lay out the linguistic levels and task families the course covers, and fix the vocabulary of tokens, types, and corpora the rest of the notes rely on.\n",{"path":9043,"title":9044,"module":4995,"summary":9045},"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization","Regular Expressions and Text Normalization","Before any model touches text, the text has to be found and cleaned. Regular expressions give an algebra for describing string patterns; tokenization, case folding, and stemming turn raw characters into the units a model counts; and byte-pair encoding builds a subword vocabulary that spells out any word. Measuring how far apart two strings are — minimum edit distance — is the next lesson.\n",{"path":9047,"title":9048,"module":4995,"summary":9049},"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance","Minimum Edit Distance","Much of language processing needs to measure how similar two strings are — a speller ranking corrections, a diff tool, a coreference resolver. Minimum edit distance counts the insertions, deletions, and substitutions that turn one string into another, computed by a dynamic-programming table. We fill the table for intention to execution, backtrace to recover the alignment, and see how the same machinery generalizes to weighted edits, Viterbi, and biological sequence alignment.\n",{"path":9051,"title":9052,"module":4995,"summary":9053},"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models","N-Gram Language Models","A language model assigns a probability to a sequence of words and, equivalently, predicts the next word from its history. The n-gram model makes this tractable by truncating the history to the last few words, estimates the resulting conditional probabilities by counting, and is scored by perplexity. We build the model from the chain rule, work a bigram example on a small corpus, and read perplexity as a branching factor. The next lesson covers the zero counts that break this model and the smoothing that repairs them.\n",{"path":9055,"title":9056,"module":4995,"summary":9057},"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff","Smoothing and Backoff","Every finite corpus is missing good word sequences it simply never saw, so a raw n-gram model assigns them probability zero and breaks. Smoothing repairs the zeros: add-one and add-k shave mass off seen events, backoff and interpolation fall back on shorter contexts, and Kneser-Ney — worked here by hand — replaces raw frequency with how many contexts a word completes. We close on web-scale stupid backoff and the neural models that dissolve the zero problem rather than patch it.\n",{"path":9059,"title":9060,"module":9061,"summary":9062},"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment","Naive Bayes and Sentiment Classification","Text Classification","Text classification assigns a category to a document — positive or negative, spam or not, one topic among many. Naive Bayes is a generative solution: apply Bayes' rule, assume the words are conditionally independent given the class, and the winning class is the one maximizing the product of a prior and per-word likelihoods. We train it by counting with add-one smoothing, work a full sentiment example by hand, sharpen it for sentiment (binary counts, negation, lexicons), and place it among the transformer classifiers that came after.\n",{"path":9064,"title":9065,"module":9061,"summary":9066},"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers","Evaluating Classifiers","A trained classifier is only useful once we can measure how good it is. We build the confusion matrix, see why accuracy misleads on unbalanced data, and define precision, recall, and the F-measure that balances them. Multi-class tasks need macro- versus micro-averaging; reliable estimates need cross-validation. We close on statistical significance — the paired bootstrap test for whether one system's lead over another is significant.\n",{"path":9068,"title":9069,"module":9061,"summary":9070},"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression","Logistic Regression","Logistic regression is the discriminative counterpart to naive Bayes: instead of modelling how a document is generated, it learns weights that directly separate the classes. We build it from the sigmoid, derive the cross-entropy loss from maximum likelihood, learn the weights by stochastic gradient descent, regularize to curb overfitting, and generalize to many classes with the softmax. The two-class model is already a one-neuron network, so this is the bridge to neural language models.\n",{"path":9072,"title":9073,"module":9061,"summary":9074},"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons","Sentiment and Affect Lexicons","A sentiment lexicon is a list of words annotated with the affective meaning they carry — positive or negative, or scores along valence, arousal, and dominance. We fix what \"emotion\" means (basic-emotion versus dimensional models), survey the standard lexicons, and then build lexicons three ways: by human labeling with best-worst scaling, by semi-supervised induction from seed words over an embedding space, and by supervised learning from starred reviews. We close on connotation frames, which record the sentiment a verb implies about each of its arguments.\n",{"path":9076,"title":9077,"module":9078,"summary":9079},"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings","Vector Semantics and Embeddings","Semantics","Vector semantics represents a word's meaning as a point in space, derived from the company the word keeps. This first part builds the count-based side: the distributional hypothesis, co-occurrence matrices in their term-document and word-word forms, cosine as the similarity measure, and the two weightings — tf-idf and PPMI — that fix what raw counts get wrong. The result is a sparse, interpretable vector for every word, and the setup for the dense embeddings of the next lesson.\n",{"path":9081,"title":9082,"module":9078,"summary":9083},"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings","Static Word Embeddings: word2vec and After","Count-based vectors are long and sparse; embeddings are the short, dense alternative. This lesson builds them with word2vec's skip-gram and negative sampling — a classifier whose learned weights are the vectors — derives its gradient, and works one update by hand. It then reads relations off the analogy parallelogram, surveys the papers that framed the static-embedding era (word2vec, GloVe, the SGNS-as-PPMI equivalence, fastText, ELMo), and closes on the biases embeddings inherit and the single-vector-per-word ceiling that contextual models break.\n",{"path":9085,"title":9086,"module":9078,"summary":9087},"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models","Neural Networks and Neural Language Models","A neural network is a stack of units, each a weighted sum passed through a non-linearity — a single unit on its own is logistic regression. We build the network up from that unit: the activation functions that give it power, the XOR problem that forces a hidden layer, the feedforward forward pass in matrix form, and the Bengio-style feedforward neural language model that concatenates word embeddings and predicts the next word with a softmax. Training is cross-entropy minimized by gradient descent, with backpropagation supplying the gradient. Embeddings let the model share statistical strength across similar words, avoiding the sparsity that limits n-gram models.\n",{"path":9089,"title":9090,"module":5461,"summary":9091},"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling","Sequence Labeling: POS and NER","Sequence labeling assigns one tag to every token in a sentence. This first part sets up the task through its two canonical cases — part-of-speech tagging over the Penn Treebank tagset, and named-entity recognition reframed as token labeling with the BIO scheme — then builds the hidden Markov model, the classic probabilistic tagger. The HMM tags by Bayesian inference: transition and emission probabilities under two Markov assumptions, reducing tagging to an argmax over tag sequences. That argmax is exponential to enumerate, which sets up the Viterbi decoder, the CRF, and neural taggers of the next lesson.\n",{"path":9093,"title":9094,"module":5461,"summary":9095},"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers","Viterbi Decoding, CRFs, and Neural Taggers","The HMM reduced tagging to an argmax over exponentially many tag sequences. This lesson builds the decoder that makes it tractable — the Viterbi dynamic program, worked through a full numeric trace on real WSJ probabilities — then keeps that same decoder while replacing the HMM's rigid tables. The linear-chain conditional random field is a discriminative log-linear model whose global feature functions can inspect any part of the input, which is why CRFs win for NER. Finally it traces the shift to neural taggers (biLSTM-CRF, character-aware NER, ELMo), where hand-built features become learned representations while the Viterbi decoder carries over unchanged.\n",{"path":9097,"title":9098,"module":5461,"summary":9099},"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms","RNNs and LSTMs","A feedforward neural language model sees a fixed window of words and can look no further back. The recurrent neural network removes that limit: it carries a hidden state across time, so each word is read in the context of everything before it. We build the RNN from its one recurrent equation, use it as a language model, train it by backpropagation through time, and diagnose the vanishing-gradient problem that makes plain RNNs forget. The LSTM fixes the forgetting with a cell state and three gates, and the encoder-decoder stacks two RNNs into a sequence-to-sequence model — and its single-vector bottleneck is the problem attention was invented to remove.\n",{"path":9101,"title":9102,"module":5943,"summary":9103},"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention","Transformers and Self-Attention","Recurrence forced language models to read one word at a time and to squeeze every dependency through a chain of hidden states. Self-attention removes the recurrence: at every layer each position compares itself to every other and reads a weighted mixture of them, in a single parallel step. This first part builds the attention operation from the ground up — the soft lookup, queries and keys and values, the scaled dot-product, the numeric trace, the matrix form, and the causal mask — and sets up the full transformer architecture that follows.\n",{"path":9105,"title":7655,"module":5943,"summary":9106},"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture","This part takes the scaled dot-product attention of the previous lesson and assembles the full transformer architecture around it: multi-head attention so several relations can be read at once, the transformer block of residual connections and layer norm that makes deep stacks trainable, positional embeddings that restore word order, the decoder-only language model, and the encoder, decoder, and encoder-decoder shapes — closing with the 2017 paper and the pre-norm, FlashAttention, and RoPE refinements that scaled it up.\n",{"path":9108,"title":7763,"module":5943,"summary":9109},"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models","A large language model is a decoder-only transformer trained on one objective — predict the next token. This first part assembles the inference side: the language-modeling head that turns a hidden state into a distribution over the vocabulary, autoregressive generation, and the decoding strategies — greedy, beam, and sampling with temperature, top-k, and nucleus — that read text back out of that distribution. Training the distribution at web scale comes next.\n",{"path":9111,"title":9112,"module":5943,"summary":9113},"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling","Large Language Models: Pretraining and Scaling","A language model's next-token distribution is only as good as the parameters behind it. This part is where those parameters come from: self-supervised pretraining on web-scale text with teacher forcing and cross-entropy, the scaling laws that make test loss a predictable power law in parameters, data, and compute, the KV cache that keeps long-context inference affordable, and how a finished model is evaluated by perplexity and benchmarks — closing with the Kaplan, Chinchilla, GPT-3, and emergence papers behind the scaling story.\n",{"path":9115,"title":9116,"module":5943,"summary":9117},"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting","Fine-Tuning and Prompting","A pretrained transformer is a general-purpose knowledge source; a task is what you do with it. There are two ways to adapt one, and this first part covers the one that updates the weights: fine-tuning. A bidirectional encoder like BERT is pretrained by masked language modeling, then a small task head is bolted on and the whole thing is trained on labelled data for classification, sequence labeling, or span-based question answering — with parameter-efficient variants (adapters, LoRA) that touch only a sliver of the weights. Prompting, the family that leaves the weights frozen, comes next.\n",{"path":9119,"title":9120,"module":5943,"summary":9121},"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment","Prompting and Alignment","Fine-tuning adapts a model by changing its weights. The second family of adaptation changes nothing: a large frozen model performs a task from an instruction and a few examples placed in its context. This part covers prompting and in-context learning, chain-of-thought that elicits reasoning, and the two training stages — instruction tuning and RLHF — that turn a fluent base predictor into an aligned assistant, closing with the BERT, LoRA, chain-of-thought, InstructGPT, and retrieval-augmentation papers behind the modern adaptation pipeline.\n",{"path":9123,"title":9124,"module":9125,"summary":9126},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing","Constituency Parsing","Linguistic Structure","A constituency parse groups a sentence into nested phrases described by a context-free grammar. We build the CFG formalism, read the phrase structure of English off a treebank, confront the structural ambiguity that makes parsing hard, convert to Chomsky normal form, and then solve it with CKY — the dynamic-programming chart that fills a triangular table bottom-up. Probabilistic and neural span parsers, evaluation, and shallow parsing follow in the companion lesson.\n",{"path":9128,"title":9129,"module":9125,"summary":9130},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation","CKY Scoring, Evaluation, and Shallow Parsing","The CKY chart returns every parse but does not say which is correct. Disambiguation needs a score on trees. This lesson attaches probabilities to a grammar (the PCFG and lexicalization), replaces the grammar with a neural span scorer over a pretrained encoder, states the self-attentive results that made it the state of the art, evaluates parsers against a treebank with PARSEVAL, and closes with chunking and shallow parsing for tasks that need only the flat phrases.\n",{"path":9132,"title":9133,"module":9125,"summary":9134},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing","Dependency Parsing","A dependency parse throws away phrases and keeps only directed, labeled arcs from heads to their dependents, so the subject and object of a verb hang off the verb directly. We fix the formalism (rooted trees, typed Universal-Dependency relations, projectivity), then build the first parser family: transition-based arc-standard and arc-eager parsing, a greedy stack-and-buffer machine trained from an oracle. Graph-based and neural dependency parsing follow in the companion lesson.\n",{"path":9136,"title":9137,"module":9125,"summary":9138},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing","Graph-Based and Neural Dependency Parsing","Greedy transition parsing commits locally; the graph-based family scores whole trees instead. This lesson scores every candidate head-dependent edge and extracts the maximum spanning tree with Chu-Liu\u002FEdmonds, develops the biaffine neural scorer that made graph-based parsing the accuracy leader, evaluates parsers with the unlabeled and labeled attachment scores (UAS and LAS), and closes on where the two parser families sit and what they feed downstream.\n",{"path":9140,"title":9141,"module":9125,"summary":9142},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd","Word Senses and Disambiguation","A word is not an atom of meaning: \"bass\" names a fish, a voice, and an instrument, and one static embedding blurs them into a single point. This lesson pulls those senses apart. We define polysemy and the relations that organize senses — synonymy, antonymy, hyponymy, meronymy — build them into WordNet's synset graph, measure similarity along that graph, and then solve the core of word sense disambiguation: the most-frequent-sense baseline, the Lesk gloss-overlap algorithm, feature-based classifiers, and the nearest-neighbor method over BERT embeddings. WSD variants, embeddings, and evaluation follow in the companion lesson.\n",{"path":9144,"title":9145,"module":9125,"summary":9146},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction","WSD in Practice and Word Sense Induction","Beyond core word sense disambiguation lie the variants and loose ends: the sense-inventory-free Word-in-Context task, retrofitting static embeddings to a thesaurus, discovering senses without a fixed inventory (word sense induction), the gloss-aware and bi-encoder neural systems that hold the state of the art, and how WSD and its cousins are evaluated. Together they connect one-vector-per-word embeddings to sense-aware contextual representations.\n",{"path":9148,"title":9149,"module":9125,"summary":9150},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction","Semantic Roles and Information Extraction","Semantic roles answer \"who did what to whom\" for a single event, abstracting away the syntax that expresses it. We show why syntax alone is not enough, generalize over diathesis alternations with thematic roles, number a predicate's arguments with PropBank and group predicates into frames with FrameNet, tag each argument automatically with semantic role labeling, and factor predicates into primitives. Information extraction scales the idea to a corpus in the companion lesson.\n",{"path":9152,"title":9153,"module":9125,"summary":9154},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates","Relations, Events, and Templates","Semantic roles answer \"who did what\" for one predicate; information extraction scales the idea to a whole corpus. This lesson turns unstructured text into structured data: relation extraction pulls entity-relation-entity triples out of sentences by patterns, supervision, and distant supervision; event and temporal extraction place those facts on a timeline; and template filling and knowledge-base population assemble them into a database a downstream system can query.\n",{"path":9156,"title":9157,"module":9125,"summary":9158},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse","Coreference and Discourse","A text is more than a bag of sentences: entities recur under different names. Coreference resolution links every mention to the discourse entity it evokes — the linguistic background of pronouns, definite NPs, and names; mention detection; the mention-pair, mention-ranking, and entity-based architectures; a neural end-to-end span model that scores candidate antecedents; features, evaluation by the CoNLL F1, gender bias, and the neural coreference lineage. Discourse coherence follows in the companion lesson.\n",{"path":9160,"title":9161,"module":9125,"summary":9162},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure","Coherence and Discourse Structure","Coherence is what makes a run of sentences a discourse rather than an arbitrary collection. This lesson develops coherence relations and Rhetorical Structure Theory trees, discourse-structure parsing, Centering and the entity grid for entity-based coherence, and representation-learning models of local coherence, measured in part over the coreference chains recovered in the companion lesson.\n",{"path":9164,"title":9165,"module":9125,"summary":9166},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics","Logical Representations of Meaning","A meaning representation turns a sentence into a formal structure a machine can check against a world and reason over. We set the desiderata a good representation must meet, ground truth in a model, build up first-order logic for sentences with its connectives, quantifiers, and inference, and reify events with the neo-Davidsonian event variable to escape fixed predicate arity. The compositional lambda calculus, quantifier scope, and description logics follow in the companion lesson.\n",{"path":9168,"title":9169,"module":9125,"summary":9170},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics","Compositional Semantics and Description Logics","How do you compute a logical form from a sentence automatically? This lesson builds the compositional machinery: the lambda calculus that assembles a formula from a parse tree one beta-reduction at a time, the quantifier-scope ambiguity a single syntax tree leaves open, and the decidable description logics — TBox, ABox, subsumption, role restrictions — behind the Web Ontology Language, closing with how the map from string to logical form can be learned.\n",{"path":9172,"title":9173,"module":9125,"summary":9174},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing","Semantic Parsing","Turning a sentence into a structured, executable meaning, the grammar-based way. We take the logical forms defined earlier and build them compositionally: a rule-based parser that walks a syntax tree applying lambda terms, then Combinatory Categorial Grammar (CCG), which fuses syntax and semantics so one lexicalized derivation produces both — including supertagging and A* parsing. Learned and neural semantic parsers follow in the companion lesson.\n",{"path":9176,"title":9177,"module":9125,"summary":9178},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing","Learned and Neural Semantic Parsing","Hand-writing a lexicon of lambda terms does not scale, so this lesson learns the parser instead. We cover the two supervision regimes (from logical forms and from denotations), Abstract Meaning Representation as a rooted concept graph, neural sequence-to-sequence parsing with constrained decoding and copy mechanisms, executable text-to-SQL and knowledge-based question answering, the practical systems that made learned parsers accurate, and how the task is evaluated.\n",{"path":9180,"title":9181,"module":9125,"summary":9182},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction","Information Extraction","Information extraction turns free text into a database, and the first step is relation extraction: pulling entity-relation-entity triples out of sentences. We cover all five families — hand-built patterns, supervised classifiers, semi-supervised bootstrapping, distant supervision, and unsupervised Open IE — with worked bootstrapping and distant-supervision traces, then the neural and LLM systems that extended them. Times, events, and templates follow in the companion lesson.\n",{"path":9184,"title":9185,"module":9125,"summary":9186},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates","Extracting Times, Events, and Templates","Once relation extraction has produced typed triples, the information-extraction pipeline still has to place facts in time and assemble them into records. This lesson detects and normalizes temporal expressions to ISO 8601 values, detects events and orders them on a timeline with the 13 Allen relations, and fills slot-and-filler templates — flat and hierarchical — for stereotyped situations, closing the loop from text to a queryable database.\n",{"path":9188,"title":9189,"module":9125,"summary":9190},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence","Discourse Coherence","A text is more than a set of sentences. What binds a run of sentences into a discourse is coherence, and one of its sources is structured relations between clauses. This lesson develops relational coherence — RST and the PDTB models of coherence relations — and discourse-structure parsing: EDU segmentation and shift-reduce RST parsing, then PDTB relation classification. Entity-based and global coherence follow in the companion lesson.\n",{"path":9192,"title":9193,"module":9125,"summary":9194},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence","Entity-Based and Global Coherence","A text coheres not only through relations between clauses but by staying about the same entities and the same topic, and by obeying the macro-structure of its genre. This lesson develops Centering Theory and the entity grid for entity-based coherence, representation-learning models of local coherence, and global coherence — topic segmentation, narrative and argumentation structure, and scientific discourse — then the neural models that learn each.\n",{"path":9196,"title":9197,"module":9125,"summary":9198},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars","Constituency Grammars","A constituency grammar is the declarative theory of sentence structure that a parser operates on. We build the context-free grammar formalism from its four parts, show how derivations become parse trees, and work through the phrase structure of English — noun phrases, verb phrases and their subcategorization frames, agreement, coordination, and long-distance dependencies. The treebank, normal-form, and lexicalized views follow in the companion lesson.\n",{"path":9200,"title":9201,"module":9125,"summary":9202},"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars","Treebanks and Lexicalized Grammars","Where does a grammar come from, and how is it prepared for a parser? We read a context-free grammar off the Penn Treebank, normalize it to Chomsky Normal Form for the CKY chart, then invert the phrase-structure emphasis with lexicalized grammars — Combinatory Categorial Grammar and its slash categories — and close with the grammar's fate in the neural era: span scoring, self-attention, and grammar induction.\n",{"path":9204,"title":9205,"module":7751,"summary":9206},"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation","Machine Translation","Machine translation is the task that built the modern toolkit: the encoder-decoder was invented for it, attention was invented to fix its fixed-context bottleneck, and both were later folded into the general transformer. We work through why translation is hard (word order, morphology, lexical and structural divergences), the sequence-to-sequence model and its attention mechanism, transformer-based NMT with cross-attention, subword tokenization with a shared vocabulary, beam-search decoding, and evaluation by BLEU and its successors chrF, BERTScore, and COMET — closing on multilingual and low-resource translation and backtranslation.\n",{"path":9208,"title":9209,"module":7751,"summary":9210},"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation","Machine Translation: Decoding, Evaluation, and Scale","Having built the transformer translation model, we now decode from it and measure the output. Beam search turns the decoder's per-step distributions into a single output string; length normalization keeps it from favoring short translations. We then score translations automatically — BLEU with its n-gram precision, clipping, and brevity penalty, worked through by hand, then its successors chrF, BERTScore, and COMET — and close on the parts of MT that scale beyond one language pair: multilingual and low-resource translation, backtranslation, gender bias, and the lineage from the Transformer to massively multilingual models like NLLB-200.\n",{"path":9212,"title":9213,"module":7751,"summary":9214},"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering","Question Answering","A question-answering system takes a natural-language question and returns an answer, not a ranked list of documents. Almost every modern system is built on one pattern: retrieve then read. We start with the information-retrieval machinery that finds candidate text — tf-idf and BM25 term weighting, a worked ranking example, the inverted index, and dense embedding retrieval — then build the retriever-reader pipeline that extracts an answer span with BERT and trace a full retrieve-and-read example end to end.\n",{"path":9216,"title":9217,"module":7751,"summary":9218},"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms","Question Answering: Knowledge Bases and Language Models","The retrieve-and-read pipeline extracts an answer span from prose, but not all knowledge lives in prose. This part covers the rest of the QA stack: entity linking (Wikification) that grounds a question's entities to a knowledge base, knowledge-based QA by semantic parsing a question into an executable query, and the modern default — closed-book QA and retrieval-augmented generation with a large language model — closing on the DPR\u002FRAG\u002Ffusion-in-decoder lineage and how factoid answers are scored by exact match and F1.\n",{"path":9220,"title":9221,"module":7751,"summary":9222},"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots","Dialogue and Chatbots","Conversation is the most natural interface to a machine and one of the hardest to build. We set up what makes human dialogue work — turns, speech acts, grounding, and the local structure of adjacency pairs — then trace the two traditions that answer it: chatbots built to chat (ELIZA's pattern-matching, corpus retrieval, and seq2seq generation with its blandness problem) and task-oriented systems built to get something done (the GUS frame-and-slot architecture and the modern NLU \u002F state-tracker \u002F policy \u002F NLG pipeline that accumulates a frame across turns).\n",{"path":9224,"title":9225,"module":7751,"summary":9226},"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants","Dialogue Systems: LLM Assistants, Evaluation, and Design","Two dialogue traditions — chatbots built to chat and task-oriented frame systems built to get something done — met in the aligned LLM assistant. Instruction tuning plus RLHF fold chit-chat and task dialogue into one model; the LaMDA \u002F InstructGPT \u002F ChatGPT lineage fills in how. The lesson then turns to evaluation (human ratings and acute-eval for chatbots, task success and slot error rate for task systems), user-centered design with Wizard-of-Oz prototyping, and the ethical stakes of building agents people talk to.\n",{"path":9228,"title":9229,"module":7751,"summary":9230},"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization","Text Summarization","Summarization compresses a document to its essential meaning, by either selecting sentences to keep (extractive) or writing new ones (abstractive). This part fixes the task and its flavors — single vs. multi-document, generic vs. query-focused, extractive vs. abstractive — then works through extractive summarization in full: scoring by position and centrality, the TextRank\u002FLexRank graph algorithm run as PageRank over a sentence-similarity graph with a worked iteration, and supervised sentence selection.\n",{"path":9232,"title":9233,"module":7751,"summary":9234},"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation","Abstractive Summarization and Evaluation","Extractive methods can only reuse the source's own sentences; to compress within a sentence or paraphrase, a summarizer has to generate. This part covers abstractive summarization: the sequence-to-sequence approach, the pointer-generator's copy switch and coverage mechanism, pretrained summarizers (BART, PEGASUS) and zero-shot LLM prompting, the long-document and factuality problems, and ROUGE evaluation with a worked example and its limits — closing on the abstractive lineage from See 2017 through faithfulness metrics.\n",{"path":9236,"title":9237,"module":9238,"summary":9239},"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics","Phonetics","Speech","Before a recognizer can read speech it has to know what speech is. This first part covers the linguistic substrate: phones and their transcription in the IPA and ARPAbet; articulatory phonetics — how the vocal tract shapes airflow into consonants and vowels; and prosody — stress, tune, and the F0 contour. The acoustic side — the waveform, its spectrum, formants, and the spectrogram — is the second part.\n",{"path":9241,"title":9242,"module":9238,"summary":9243},"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics","Acoustic Phonetics","Articulation is the cause; the acoustic signal is the effect, and the effect is all a microphone ever gets. This part follows the sound out of the mouth: waves, sampling and the Nyquist limit, F0 and the pitch track, the mel scale, the spectrum and Fourier analysis, the source-filter model that explains why each vowel carries its own formants, and the spectrogram the log-mel front end of every ASR system sits directly on top of — closing with neural TTS, wav2vec, HuBERT, and Whisper, where phonetics went in neural speech.\n",{"path":9245,"title":9246,"module":9238,"summary":9247},"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition","Automatic Speech Recognition","Speech recognition maps an acoustic waveform to a string of words, and once the waveform is turned into a sequence of log-mel spectrogram frames the problem is the same sequence-to-sequence transduction the rest of the course already solved. This first part builds the feature front end (framing, the DFT, the mel filterbank, the log), then the modern architectures: the attention-based encoder-decoder, the CTC alignment trick that collapses repeated and blank frames, and RNN-T for streaming. Training-data advances, evaluation, TTS, and the other speech tasks come next.\n",{"path":9249,"title":9250,"module":9238,"summary":9251},"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications","ASR Evaluation and Speech Applications","A recognizer turns a waveform into text; this part scores that text and puts the same machinery to other uses. It opens with the self-supervised and weakly- supervised systems (wav2vec 2.0, HuBERT, Whisper) that made ASR error rates fall. Word error rate reuses the edit distance from the first module, run over words. Text-to-speech runs the whole pipeline in reverse — text to mel spectrogram to waveform. And a family of smaller tasks — wake-word detection, speaker recognition and diarization, language identification — reuse the same log-mel front end without the decoder.\n",{"path":9253,"title":9254,"module":6,"summary":6},"\u002Fnatural-language-processing","Natural Language Processing",{"path":9256,"title":9257,"module":4995,"summary":9258},"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo","From the Electron to the Particle Zoo","A timeline of the subject, from J. J. Thomson's electron in 1897 to the Higgs boson in 2012. The electron, photon, nucleus, proton, and neutron gave a tidy picture that Yukawa's meson prediction and the muon–pion confusion complicated; strange particles in cosmic rays and the accelerator-era flood of hadrons then produced a \"particle zoo\" that only the quark model organized.\n",{"path":9260,"title":9261,"module":4995,"summary":9262},"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts","Basic Concepts and Particle Classification","Every particle has an antiparticle of equal mass and opposite charge, a consequence of the Dirac equation confirmed by the positron. Feynman diagrams track interactions in spacetime; the material particles sort into leptons and the composite hadrons built from quarks, with baryons carrying three quarks and mesons a quark-antiquark pair.\n",{"path":9264,"title":9265,"module":4995,"summary":9266},"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers","Fundamental Interactions and Force Carriers","Four interactions account for every force in nature: strong, electromagnetic, weak, and gravitational, in decreasing strength. Each is carried by a boson — the gluon, photon, W and Z, and the graviton — with a range fixed by the carrier's mass through the Yukawa relation, and a coupling constant that itself varies with distance.\n",{"path":9268,"title":9269,"module":9270,"summary":9271},"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales","Natural Units and Scales","Units and Kinematics","Setting $\\hbar = c = 1$ collapses mass, momentum, and energy into a single unit, the GeV, and turns lengths and times into inverse energies through the conversion $\\hbar c = 197.3$ MeV·fm. This lesson fixes the natural-unit conventions used for the rest of the course, converts cross sections between barns and GeV$^{-2}$, and shows how to restore factors of $\\hbar$ and $c$ by dimensional analysis.\n",{"path":9273,"title":9274,"module":9270,"summary":9275},"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass","Four-Vectors and Invariant Mass","The energy and momentum of a particle form a four-vector whose square is the frame-independent quantity $p^2 = m^2$. This lesson develops the metric and four-vector products, the invariant mass of a multiparticle system, the center-of-momentum and laboratory frames, and the description of collinear boosts by rapidity, whose additivity replaces the awkward velocity-addition law.\n",{"path":9277,"title":9278,"module":9270,"summary":9279},"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam","Decay, Scattering, and Mandelstam Variables","Two-body decay in the rest frame fixes the daughter momenta from the three masses alone; production thresholds follow from the minimum invariant mass. This lesson works both, then introduces the Mandelstam invariants $s$, $t$, $u$ for $2\\to2$ scattering, proves the identity $s+t+u=\\sum m_i^2$, and maps the physical regions and the crossing that relates channels.\n",{"path":9281,"title":9282,"module":9270,"summary":9283},"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule","Cross Sections and the Golden Rule","The cross section measures how often a scattering happens and the decay width how fast a particle disintegrates. This lesson defines both, relates event rate to luminosity through $R=\\mathcal L\\,\\sigma$ and lifetime to width through $\\tau=\\hbar\u002F\\Gamma$, and states Fermi's golden rule with Lorentz-invariant phase space, giving the master formulas that turn an amplitude $\\mathcal M$ into a measurable rate for $1\\to2$ decay and $2\\to2$ scattering.\n",{"path":9285,"title":9286,"module":9287,"summary":9288},"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries","Conservation Laws and Symmetries","Symmetries and Conservation Laws","Which decays occur is decided by conservation laws, each tied by Noether's theorem to a symmetry of physical law. Energy, charge, baryon number, and lepton number are conserved universally; strangeness, isospin, and parity hold in the strong and electromagnetic interactions but break in the weak one, whose parity and CP violation distinguish matter from antimatter.\n",{"path":9290,"title":9291,"module":9287,"summary":9292},"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt","Discrete Symmetries — C, P, T, and CPT","Parity reflects space, charge conjugation swaps particle for antiparticle, and time reversal runs the clock backward. Each assigns multiplicative quantum numbers that act as selection rules — intrinsic parities, the photon's C = −1, the C-parity argument fixing the pion's two-photon decay. Their product CPT is a theorem of any local relativistic field theory, forcing particle and antiparticle to share mass and lifetime.\n",{"path":9294,"title":9295,"module":9287,"summary":9296},"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak","Parity Violation and the Weak Force","The tau–theta puzzle forced a choice: two particles with identical mass but opposite parity, or one particle whose decay violates parity. Lee and Yang proposed the latter, Wu's polarized cobalt-60 confirmed it, and the violation proved maximal. The charged weak force couples only to left-handed chirality — the Goldhaber experiment showed the neutrino is left-handed — which is why the mirror image of a weak decay is something nature never produces.\n",{"path":9298,"title":9299,"module":9287,"summary":9300},"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry","Isospin, SU(2), and Flavor SU(3)","The near-equal masses of the proton and neutron, and of the three pions, signal a continuous internal symmetry of the strong force: isospin, an SU(2) whose ladder operators move between the members of a multiplet. Adding strangeness enlarges it to an approximate SU(3) flavor symmetry, and the Gell-Mann–Nishijima relation Q = I3 + Y\u002F2 places every hadron on a weight diagram in the isospin–hypercharge plane — the language in which the quark model is written.\n",{"path":9302,"title":9303,"module":9304,"summary":9305},"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3","The Eightfold Way and SU(3) Flavor","The Quark Model","Gell-Mann and Ne'eman's classification of the hadrons into geometric multiplets, read as representations of an approximate flavor SU(3). The fundamental triplet (u, d, s) and its antitriplet combine into the meson nonet from 3⊗3̄ = 8⊕1 and the baryon octet and decuplet from 3⊗3⊗3, and the empty corner of the decuplet forecast the Ω⁻.\n",{"path":9307,"title":9308,"module":9304,"summary":9309},"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy","Meson Multiplets and Quantum Numbers","Mesons as quark–antiquark bound states. The spin singlet and triplet, orbital excitations, and the assignment of J^PC from the quark spins and orbital angular momentum, giving the pseudoscalar and vector nonets. The η–η' and ω–φ mixing problems, and the charmonium and bottomonium spectra read as heavy-quark positronium.\n",{"path":9311,"title":9312,"module":9304,"summary":9313},"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy","Baryon Multiplets, Spin, and the Color Puzzle","Baryons as three-quark states, with a wavefunction factored into space, spin, flavor, and color. The spin-3\u002F2 Δ⁺⁺ = uuu forces a totally symmetric state that the Pauli principle forbids, and the resolution is an antisymmetric color factor — the first evidence for color. The octet and decuplet spin content, and baryon magnetic moments as a quantitative test of the model.\n",{"path":9315,"title":9316,"module":9304,"summary":9317},"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics","Color, Confinement, and Exotic Hadrons","Color as the gauged SU(3) charge, and the requirement that every physical hadron be a color singlet — which selects q-qbar mesons and qqq baryons as the simplest states. The R-ratio of e⁺e⁻ annihilation measures three colors directly. Beyond the simplest singlets lie glueballs, tetraquarks, and pentaquarks, and the recent XYZ states, read as either compact multiquarks or loose hadronic molecules.\n",{"path":9319,"title":9320,"module":9321,"summary":9322},"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation","The Klein-Gordon Equation","Relativistic Wave Equations","Quantizing the relativistic energy relation $E^2 = p^2 + m^2$ produces the Klein-Gordon equation for a scalar field. Its plane-wave solutions come in positive- and negative-energy branches, and the conserved density it supplies is not positive-definite — the two difficulties that first drove physicists to seek a first-order equation. The static Klein-Gordon equation with a point source gives the Yukawa potential, and the free equation gives the scalar propagator that later modules attach to exchanged lines.\n",{"path":9324,"title":9325,"module":9321,"summary":9326},"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors","The Dirac Equation and Spinors","Dirac demanded a wave equation first order in time to fix the Klein-Gordon density problem. Factorizing $E^2 = p^2 + m^2$ into a linear form forces the coefficients to be anticommuting matrices — the gamma matrices of the Clifford algebra — so the wavefunction becomes a four-component spinor. The plane-wave solutions split into two particle and two antiparticle states, spin appears automatically with the correct $g = 2$ magnetic moment, and the chirality projectors that the weak interaction later needs fall straight out of the fifth gamma matrix.\n",{"path":9328,"title":9329,"module":9321,"summary":9330},"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory","Antiparticles and Hole Theory","The negative-energy solutions of the Dirac equation refuse to go away, so they must mean something. Dirac read them as a filled sea of occupied negative-energy states whose holes are positive-energy antiparticles, predicting the positron before its discovery. The picture works for fermions but not bosons, and the Feynman-Stückelberg interpretation replaces it: an antiparticle is a negative-energy solution propagating backward in time, equivalent to a positive-energy antiparticle going forward. Crossing symmetry ties incoming particles to outgoing antiparticles in a single amplitude.\n",{"path":9332,"title":9333,"module":9334,"summary":9335},"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed","Feynman Rules for QED","Quantum Electrodynamics","Quantum electrodynamics computes a process by summing diagrams, each a term in a power series in the coupling. Every diagram translates into an amplitude by a fixed dictionary: spinors and polarization vectors for external lines, propagators for internal lines, and the vertex factor $ie\\gamma^\\mu$ for each photon-fermion junction. Squaring the amplitude and feeding it to Fermi's golden rule produces a cross section or decay rate, with each extra vertex costing one power of $\\alpha$.\n",{"path":9337,"title":9338,"module":9334,"summary":9339},"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes","Tree-Level QED Processes","The Feynman rules become numbers on the reference reactions of QED. Muon pair production $e^+e^-\\to\\mu^+\\mu^-$ sets the scale with its $1+\\cos^2\\theta$ distribution and $4\\pi\\alpha^2\u002F3s$ total cross section, and its ratio to hadron production counts colors. Compton scattering gives the Klein-Nishina formula and the Thomson limit; Bhabha scattering shows $s$- and $t$-channel interference. Casimir's trick turns every spin-averaged square into a trace of gamma matrices.\n",{"path":9341,"title":9342,"module":9334,"summary":9343},"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling","Renormalization and the Running Coupling","Beyond tree level, QED loops diverge. The three primitive one-loop diagrams — vacuum polarization, electron self-energy, and vertex correction — carry ultraviolet divergences that regularization exposes as logarithms of a cutoff. Renormalization absorbs them into the measured mass, charge, and field normalization, leaving finite predictions. The surviving physical content is that the coupling runs: vacuum polarization screens charge, so $\\alpha$ grows from $1\u002F137$ at low energy to about $1\u002F128$ at the $Z$ mass.\n",{"path":9345,"title":9346,"module":9334,"summary":9347},"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2","The Anomalous Magnetic Moment","The Dirac equation predicts $g=2$; loops shift it. Schwinger's one-loop vertex correction gives the anomaly $a=(g-2)\u002F2=\\alpha\u002F2\\pi$, and the QED series continues to five loops. The electron $a_e$ agrees with theory to better than a part in a billion, the most precise confrontation of theory and experiment in physics. The muon $a_\\mu$, heavier and so more sensitive to virtual heavy states, is dominated by hadronic uncertainty and sits at the center of a long-running comparison with the Standard Model prediction.\n",{"path":9349,"title":9350,"module":9351,"summary":9352},"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak","The V–A Charged Weak Current","The Weak Interaction","Fermi modelled beta decay as a four-fermion contact interaction, but a coupling with dimensions of inverse mass squared makes cross sections grow without bound and the theory fails near 300 GeV. The cure is a heavy mediator: the $W$ boson, whose propagator collapses to Fermi's contact term at low energy and fixes $G_F\u002F\\sqrt2 = g^2\u002F8M_W^2$. Parity violation dictates the current's form — vector minus axial-vector, coupling only to left-chiral fields — and universality of the coupling ties muon decay, beta decay, and pion decay to one constant. Pion decay's helicity suppression of the electron channel is the sharpest test.\n",{"path":9354,"title":9355,"module":9351,"summary":9356},"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays","The W and Z Bosons","The contact theory hides a massive mediator. The charged $W^\\pm$ carries the current that changes flavour; the neutral $Z^0$ carries a current that does not. Both were found at CERN's proton–antiproton collider in 1983 at the masses the electroweak theory demanded. Their decay widths partition into leptonic and hadronic channels, and the $Z$ carries a decisive extra: an invisible width from decays to neutrinos that counts the number of light generations at exactly three. Beta decay and muon decay are re-read at the parton level as $W$ exchange.\n",{"path":9358,"title":9359,"module":9351,"summary":9360},"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix","Quark Mixing and the CKM Matrix","The quark eigenstates the weak force acts on are not the mass eigenstates. Cabibbo captured this with one rotation angle; the GIM mechanism added a fourth quark to cancel dangerous flavour-changing neutral currents and predicted charm before its discovery. Three generations promote the rotation to the unitary Cabibbo–Kobayashi–Maskawa matrix — three angles and one irreducible complex phase, the sole source of Standard-Model CP violation. The Wolfenstein parametrization exposes its steep hierarchy, and unitarity closes into a triangle whose area measures the phase.\n",{"path":9362,"title":9363,"module":9351,"summary":9364},"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons","CP Violation in Kaons and B Mesons","The neutral kaon is its own laboratory for CP. Weak box diagrams mix $K^0$ and its antiparticle into short- and long-lived states that should be pure CP eigenstates decaying to two and three pions. In 1964 Cronin and Fitch caught the long-lived kaon decaying to two pions — CP is violated, at the two-per-mille level of $\\epsilon$. Direct violation ($\\epsilon'$) followed, and the $B$ factories turned the CKM phase into a large, clean time-dependent asymmetry measuring $\\sin 2\\beta$. The effect is real but far too small to explain why the universe is made of matter.\n",{"path":9366,"title":9367,"module":9368,"summary":9369},"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons","Color SU(3), Gluons, and the QCD Lagrangian","Quantum Chromodynamics","Color is the exact gauged SU(3) charge of the strong force. Gauging it forces eight massless gluons in the adjoint representation and, because the gauge group is non-abelian, three- and four-gluon self-couplings absent from QED. This lesson builds the QCD Lagrangian from the covariant derivative and the non-abelian field strength, states the Feynman rules with their color factors, and computes the Casimir invariants that set the strength of quark-gluon and gluon-gluon coupling.\n",{"path":9371,"title":9372,"module":9368,"summary":9373},"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement","Asymptotic Freedom and Confinement","The QCD beta function is negative: gluon self-interaction antiscreens color, so the coupling weakens at short distance (asymptotic freedom) and strengthens at long distance (confinement). This lesson computes the one-loop beta coefficient, solves for the running of alpha_s and the emergent scale Lambda_QCD, and reads the strong-coupling regime as the linear quark-antiquark potential of a color flux tube that breaks by pair creation.\n",{"path":9375,"title":9376,"module":9368,"summary":9377},"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons","Deep Inelastic Scattering and the Parton Model","Scattering electrons hard off a proton resolves pointlike constituents. This lesson sets up the deep-inelastic kinematics, defines the structure functions F1 and F2, and reads Bjorken scaling as the signature of free spin-half partons. The Callan-Gross relation fixes the parton spin, the structure function becomes a charge-weighted sum of parton distributions, and the slow logarithmic scaling violations expose the gluon through DGLAP evolution.\n",{"path":9379,"title":9380,"module":9368,"summary":9381},"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization","Jets, Hadronization, and Testing QCD","Quarks and gluons produced in a collision fragment into collimated sprays of hadrons — jets — whose directions track the underlying partons. This lesson reads two-jet events as the quark and antiquark of electron-positron annihilation, three-jet events as direct evidence of the radiated gluon, and the hadronization step as the flux tube breaking into color singlets. Jet algorithms and event-shape variables turn the pattern into precision measurements of alpha_s.\n",{"path":9383,"title":9384,"module":9385,"summary":9386},"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1","The Electroweak Theory","Electroweak Unification and the Higgs","The electromagnetic and weak interactions are two faces of a single gauge theory built on $SU(2)_L \\times U(1)_Y$. Left-handed fermions sit in weak-isospin doublets and right-handed fermions in singlets, each carrying a hypercharge fixed by the Gell-Mann–Nishijima relation $Q = T_3 + Y\u002F2$. The four gauge fields $W^{1,2,3}$ and $B$ mix: the charged combinations $W^\\pm$ mediate the charged current, while $W^3$ and $B$ rotate through the Weinberg angle into the massless photon and the massive $Z$. The single angle $\\theta_W$ ties the couplings, the boson masses, and the neutral-current strengths together.\n",{"path":9388,"title":9389,"module":9385,"summary":9390},"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking","Spontaneous Symmetry Breaking","A symmetry of the Lagrangian need not be a symmetry of the ground state. When the lowest-energy configuration sits away from the symmetric point, the symmetry is spontaneously broken and the vacuum is one of a degenerate family. Breaking a continuous global symmetry produces one massless scalar — a Goldstone boson — for every broken generator, the flat direction along the vacuum manifold. The Mexican-hat potential and the ferromagnet below its Curie point are the working pictures.\n",{"path":9392,"title":9393,"module":9385,"summary":9394},"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism","The Higgs Mechanism","Gauging a spontaneously broken symmetry converts the would-be Goldstone bosons into the longitudinal polarizations of the gauge fields, which thereby acquire mass. Applied to $SU(2)_L \\times U(1)_Y$ with a single Higgs doublet, three of the four scalar degrees of freedom are eaten by the $W^\\pm$ and $Z$; the fourth survives as the physical Higgs boson, and the photon stays massless. Fermion masses come from Yukawa couplings to the same field, each mass proportional to its coupling times the vacuum expectation value $v \\approx 246$ GeV.\n",{"path":9396,"title":9397,"module":9385,"summary":9398},"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery","The Higgs Boson","The Higgs boson is produced at the LHC chiefly through gluon fusion, with vector-boson fusion and associated production as cleaner but rarer channels. It decays most often to $b\\bar b$ and $WW^\\ast$, but the discovery rested on two rare clean modes, $H \\to \\gamma\\gamma$ and $H \\to ZZ^\\ast \\to 4\\ell$, whose narrow invariant-mass peaks emerged over smooth backgrounds. ATLAS and CMS announced a boson near 125 GeV in 2012; its measured spin-parity $0^+$ and its couplings, which scale with particle mass, identify it as the Standard Model Higgs.\n",{"path":9400,"title":9401,"module":9385,"summary":9402},"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model","The Standard Model","The Standard Model combines the quark model, quantum chromodynamics, and the electroweak theory. SU(3) symmetry sorts the hadrons and predicted the omega; color explains why only colorless quark combinations exist; QCD gives asymptotic freedom and confinement; and spontaneous symmetry breaking through the Higgs field gives the weak bosons their mass.\n",{"path":9404,"title":9405,"module":9406,"summary":9407},"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations","Neutrino Oscillations","Neutrino Physics","Neutrinos are produced and detected in flavour states, but they propagate as mass states, and the two bases are misaligned. A flavour therefore evolves coherently into a superposition of other flavours with a probability set by the mass-squared splitting and the ratio L\u002FE. This lesson derives the two-flavour oscillation formula, applies it to the solar and atmospheric neutrino deficits, shows how the SNO neutral-current measurement resolved the solar problem, and works out the MSW resonance that amplifies mixing inside the Sun.\n",{"path":9409,"title":9410,"module":9406,"summary":9411},"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns","Neutrino Mass and the PMNS Matrix","Three-flavour mixing promotes the single oscillation angle to the unitary Pontecorvo–Maki–Nakagawa–Sakata matrix, parametrised by three angles and a Dirac CP phase. This lesson decomposes the PMNS matrix into three rotations, records the measured angles and mass-squared splittings, lays out the normal and inverted mass orderings, contrasts the large leptonic mixing with the near-diagonal CKM matrix, and collects the absolute-mass bounds from beta decay and cosmology.\n",{"path":9413,"title":9414,"module":9406,"summary":9415},"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments","Dirac, Majorana, and Neutrino Experiments","A neutral fermion can carry a mass term forbidden to every charged particle, so the neutrino may be its own antiparticle. This lesson contrasts the Dirac and Majorana mass terms and their state content, derives the seesaw mechanism that ties a tiny light mass to a heavy right-handed partner, presents neutrinoless double-beta decay as the decisive lepton-number test, surveys the reactor, accelerator, solar, and atmospheric sources on a baseline–energy map, and explains why neutrino mass is physics beyond the original Standard Model.\n",{"path":9417,"title":9418,"module":9419,"summary":9420},"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity","Accelerators, Colliders, and Luminosity","Accelerators and Detectors","Fixed-target machines waste energy in the center-of-mass motion of the whole system, so the reachable $\\sqrt s$ grows only as the square root of the beam energy, while colliders put the full beam energy into the collision. Circular electron machines are limited by synchrotron radiation scaling as $E^4\u002Fm^4R$; proton machines are limited by bending fields. Luminosity, set by beam current and focusing, converts a cross section into an event rate through $R=\\mathcal L\\,\\sigma$, and integrated luminosity sets the total event count.\n",{"path":9422,"title":9423,"module":9419,"summary":9424},"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems","Particle Detectors and Subsystems","A detector reads a collision by the energy particles deposit as they cross matter. Charged particles ionize at the Bethe-Bloch rate, radiate in the field of nuclei above a critical energy, and emit Cherenkov light above a velocity threshold; electrons and photons build electromagnetic showers over a radiation length, and hadrons build wider showers over a nuclear interaction length. The onion of tracker, electromagnetic and hadronic calorimeters, and outer muon chambers turns these processes into momentum, energy, and identity, with neutrinos inferred from missing transverse momentum.\n",{"path":9426,"title":9427,"module":9419,"summary":9428},"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made","From Collisions to Discoveries","A discovery is a peak that survives statistics. Events are reconstructed into invariant masses, a signal accumulates as a bump over a smooth background, and its significance is judged by a p-value; the field's threshold is five sigma. The expected yield is a product — luminosity times cross section times branching ratio times acceptance and efficiency — that must be balanced by a trigger and data-reduction chain against an overwhelming rate. Worked reconstructions of $Z\\to\\ell\\ell$, the $J\u002F\\psi$, and the Higgs show the same peak-over-background logic at three scales.\n",{"path":9430,"title":9431,"module":9431,"summary":9432},"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model","Beyond the Standard Model","The Standard Model leaves the four interactions ununified and the neutrinos massless, both now known to be wrong. Grand unification predicts the couplings merge near ten-to-the-sixteen GeV and the proton decays; supersymmetry pairs each particle with a superpartner; and the confirmed oscillation of neutrinos proves they carry mass, the first crack in the model.\n",{"path":9434,"title":9435,"module":9431,"summary":9436},"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories","Grand Unified Theories and Proton Decay","The Standard Model gauge group is a product of three factors with three independent couplings. A grand unified theory embeds them in a single simple group — SU(5) is the minimal choice — so that one coupling runs into all three and the fractional quark charges follow from a tracelessness condition. The same embedding places quarks and leptons in shared multiplets, mediates baryon-number violation through superheavy gauge bosons, and predicts the proton decays with a lifetime that Super-Kamiokande has pushed past ten-to-the-thirty-four years.\n",{"path":9438,"title":9439,"module":9431,"summary":9440},"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry","Supersymmetry","Supersymmetry relates fermions and bosons, pairing every Standard Model particle with a superpartner whose spin differs by one half. The pairing makes the scalar and fermion loop corrections to the Higgs mass cancel, removing the quadratic sensitivity to high scales; it sharpens the meeting of the three gauge couplings; and, when R-parity is conserved, it leaves the lightest superpartner stable and neutral, a natural dark-matter candidate. The LHC has excluded gluinos and light squarks below roughly two TeV.\n",{"path":9442,"title":9443,"module":9431,"summary":9444},"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness","The Hierarchy Problem and Naturalness","The electroweak scale sits sixteen orders of magnitude below the Planck scale, and nothing in the Standard Model protects that gap. The Higgs mass squared picks up quadratic corrections proportional to the highest scale in the theory, so keeping it at the observed value requires the bare mass and its counterterm to cancel to some thirty significant figures. Naturalness treats that cancellation as a symptom of missing physics. Supersymmetry, compositeness, and extra dimensions each remove the quadratic sensitivity, but the LHC has found none of them at the predicted scale.\n",{"path":9446,"title":9447,"module":9431,"summary":9448},"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates","Dark Matter and Particle Candidates","Flat galactic rotation curves, gravitational lensing, the cosmic microwave background, and structure formation all require about five times more matter than the visible baryons, none of it interacting electromagnetically. A stable weakly interacting particle of roughly weak-scale mass freezes out of the early universe with close to the observed abundance — the WIMP miracle — and is the leading candidate, with axions and sterile neutrinos as alternatives. Direct, indirect, and collider searches have so far only tightened the limits.\n",{"path":9450,"title":9451,"module":9431,"summary":9452},"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions","Matter-Antimatter Asymmetry and Open Questions","The universe is made of matter, with about one extra baryon for every billion photons and no antimatter regions. Sakharov identified the three conditions any dynamical explanation must meet: baryon-number violation, C and CP violation, and a departure from thermal equilibrium. The Standard Model contains all three in principle, but its CP violation falls short by some ten orders of magnitude, so baryogenesis requires new physics — leptogenesis being the leading route. A closing survey collects the open questions and the experiments aimed at them.\n",{"path":9454,"title":9455,"module":6,"summary":6},"\u002Fparticle-physics","Particle Physics",{"path":9457,"title":9458,"module":9459,"summary":9460},"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars","The Sun and the Life of Stars","Orientation","The Sun is the one star close enough to study in detail: its luminosity fixes a surface temperature of 5780 K, and the proton-proton fusion cycle in its 1.5-million-kelvin core supplies its power. Measuring other stars needs the magnitude scale, parallax, and the distance ladder; plotting luminosity against temperature builds the Hertzsprung-Russell diagram, on which a star's mass sets its lifetime and its evolutionary track off the main sequence.\n",{"path":9462,"title":9463,"module":9459,"summary":9464},"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states","Cataclysmic Events and the Final States of Stars","A star's death is set by its mass. In close binaries, matter poured across the Roche lobe onto a white dwarf produces novae and, at the Chandrasekhar limit of 1.4 solar masses, a Type Ia supernova; a massive star fusing to an iron core collapses into a Type II supernova. The remnant is a white dwarf held by electron degeneracy, a neutron star held by neutron degeneracy, or, above the neutron-star limit, a black hole inside its Schwarzschild radius.\n",{"path":9466,"title":9467,"module":9459,"summary":9468},"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology","Galaxies, Cosmology, and the Evolving Universe","Galaxies come in elliptical, spiral, and irregular forms, and their redshifts obey Hubble's law, evidence that space itself is expanding. The critical density and the density parameter decide whether the universe is open, flat, or closed; baryons, dark matter, and dark energy each contribute. The cosmic microwave background and primordial helium anchor the Big Bang, whose thermal history runs from inflation through nucleosynthesis to the atoms of today.\n",{"path":9470,"title":9471,"module":9472,"summary":9473},"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus","Magnitudes, Fluxes, and the Distance Modulus","Observational Foundations","The brightness of a star reaches us as a radiant flux that falls off as the inverse square of distance. The magnitude scale encodes flux logarithmically through the Pogson ratio; the apparent and absolute magnitudes differ by the distance modulus, which converts a measured brightness into a distance. The bolometric correction folds a filtered magnitude into a total luminosity, and the difference of two magnitudes in different bands, the color index, measures surface temperature.\n",{"path":9475,"title":9476,"module":9472,"summary":9477},"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification","Stellar Spectra and Spectral Classification","A stellar spectrum is a continuum crossed by absorption lines whose strengths are set by the temperature of the atmosphere. The Boltzmann factor governs how atoms populate excited states, and the Saha equation governs how they ionize; their product explains why each line, such as the hydrogen Balmer series, peaks in strength at a characteristic temperature. This behavior orders stars into the OBAFGKM sequence, and the luminosity classes of the MK system add a second dimension for surface gravity.\n",{"path":9479,"title":9480,"module":9472,"summary":9481},"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum","Telescopes and Detectors Across the Spectrum","A telescope collects light in proportion to its collecting area and resolves detail down to the diffraction limit set by its aperture and the observing wavelength. The atmosphere blurs and blocks large parts of the spectrum, which drives the choice between ground and space and between refractors, reflectors, and radio dishes. CCDs record the light with high quantum efficiency, and interferometry synthesizes an aperture as large as the separation of two telescopes.\n",{"path":9483,"title":9484,"module":9472,"summary":9485},"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder","The Cosmic Distance Ladder","No single method measures distances from the nearest stars to the far reaches of the universe. Instead a ladder of overlapping techniques, each calibrated by the one below it, extends the scale rung by rung: trigonometric parallax, main-sequence fitting, pulsating variables, the tip of the red-giant branch, the Tully-Fisher relation, and Type Ia supernovae. Each rung inherits the uncertainty of every rung beneath it, so the whole chain sets the accuracy of the Hubble constant.\n",{"path":9487,"title":9488,"module":4056,"summary":9489},"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity","Blackbody Radiation and Specific Intensity","Specific intensity is the fundamental measure of a radiation field: energy per unit area, time, frequency, and solid angle. It is conserved along a ray in empty space, and its angular moments give the mean intensity, flux, and radiation pressure. In thermal equilibrium the intensity equals the Planck function, whose limits and integrals reproduce the Rayleigh-Jeans law, the Wien law, Stefan-Boltzmann, and Wien's displacement law.\n",{"path":9491,"title":9492,"module":4056,"summary":9493},"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation","Radiative Transfer and the Transfer Equation","Along a ray, matter adds intensity through emission and removes it through absorption. Measuring path length in optical depth turns this into the transfer equation, whose formal solution superposes an attenuated background on the source function integrated along the line of sight. In local thermodynamic equilibrium the source function is the Planck function, and the Eddington-Barbier relation shows that the emergent intensity samples the source function at optical depth of order unity, explaining absorption lines and solar limb darkening.\n",{"path":9495,"title":9496,"module":4056,"summary":9497},"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening","Spectral-Line Formation and Broadening","A spectral line is a bound-bound transition whose strength is set by an oscillator strength and whose shape is set by three broadening mechanisms: the Lorentzian natural and collisional wings, the Gaussian thermal Doppler core, and their Voigt convolution. Equivalent width measures the total absorption, and the curve of growth relates it to the number of absorbers through a linear, saturated, and damping regime, turning line strengths into abundances.\n",{"path":4058,"title":5,"module":4056,"summary":4076},{"path":9500,"title":9501,"module":9502,"summary":9503},"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem","Hydrostatic Equilibrium and the Virial Theorem","Stellar Structure","A star holds itself up by balancing the inward pull of gravity against an outward pressure gradient. This balance, hydrostatic equilibrium, fixes a lower bound on the central pressure and, combined with the gravitational potential energy, yields the virial theorem. The virial relation gives a star a negative heat capacity, so that losing energy makes it hotter, and sets the Kelvin-Helmholtz timescale over which contraction alone can power the Sun.\n",{"path":9505,"title":9506,"module":9502,"summary":9507},"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure","The Equations of Stellar Structure","A static star is described by four coupled first-order differential equations in the interior mass or radius: mass conservation, hydrostatic equilibrium, energy generation, and energy transport. Closed with an equation of state, opacity, and reaction rates, and subject to central and surface boundary conditions, they determine the structure uniquely from mass and composition, the Vogt-Russell theorem. Energy moves by radiation until the temperature gradient exceeds the Schwarzschild limit, where convection takes over.\n",{"path":9509,"title":9510,"module":9502,"summary":9511},"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes","The Equation of State and Polytropes","Stellar pressure comes from gas, radiation, and, at high density, degenerate electrons. When pressure depends on density as a power law, hydrostatic equilibrium reduces to the Lane-Emden equation, whose solutions describe polytropes of index n. The relativistic degenerate case, n equal to three, gives a mass independent of radius, the Chandrasekhar mass. Eddington's standard model treats a radiation-supported star as an n equal to three polytrope and yields the quartic relating radiation fraction to mass.\n",{"path":9513,"title":9514,"module":9502,"summary":9515},"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model","The Standard Solar Model","The standard solar model integrates the structure equations for one solar mass and calibrates the composition and convection parameter to reproduce the Sun's observed luminosity, radius, and age. Helioseismology tests the model's sound speed through the Sun's acoustic p-mode oscillations, and the model predicts a neutrino flux by production channel. The measured deficit, the solar-neutrino problem, is resolved by matter-enhanced flavor oscillation, confirmed when SNO measured the total flux across all flavors.\n",{"path":9517,"title":9518,"module":9519,"summary":9520},"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak","Thermonuclear Reaction Rates and the Gamow Peak","Nuclear Astrophysics","Stellar fusion proceeds only by quantum tunneling through the Coulomb barrier, because thermal energies are a thousand times smaller than the barrier height. The reaction rate is an integral over the Maxwell–Boltzmann distribution and the tunneling probability, whose product is sharply peaked at the Gamow energy. The astrophysical S-factor isolates the nuclear physics from the barrier penetration, and the steep temperature dependence follows from the width and position of the Gamow peak.\n",{"path":9522,"title":9523,"module":9519,"summary":9524},"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno","Hydrogen Burning: pp Chains and the CNO Cycle","Four protons fuse into one helium-4 nucleus, releasing 26.7 MeV, through two competing networks. The pp chain begins with a weak-interaction bottleneck and branches three ways; the CNO cycle uses carbon, nitrogen, and oxygen as catalysts and is limited by nitrogen-14 proton capture. Their steep and gentle temperature dependences cross near 1.8e7 K, which divides pp-powered lower-main-sequence stars from CNO-powered upper-main-sequence stars.\n",{"path":9526,"title":9527,"module":9519,"summary":9528},"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process","Helium Burning and the Triple-Alpha Process","Helium fuses to carbon in two steps through the unbound beryllium-8 nucleus and a resonant excited state of carbon-12, the Hoyle state, whose existence was predicted from the observed carbon abundance. The rate scales as roughly the fortieth power of temperature, and in a degenerate low-mass core this drives the runaway helium flash. A competing alpha capture on carbon-12 sets the carbon-to-oxygen ratio and the composition of the resulting white dwarf.\n",{"path":9530,"title":9531,"module":9519,"summary":9532},"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis","Advanced Burning, the Iron Peak, and the s\u002Fr Processes","Massive stars burn carbon, neon, oxygen, and silicon in ever-shorter stages, building an onion-shell interior and reaching nuclear statistical equilibrium at the iron peak, where the binding-energy-per-nucleon curve turns over and fusion can release no more energy. Elements beyond iron form by neutron capture: the slow s-process in AGB stars tracks the valley of stability, while the rapid r-process in supernovae and neutron-star mergers builds the heaviest nuclei far from it.\n",{"path":9534,"title":9535,"module":9536,"summary":9537},"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium","The Phases of the Interstellar Medium","The Interstellar Medium","The gas between the stars separates into distinct thermal phases, from cold molecular clouds at 10 K to a diffuse million-degree corona, held near a common pressure by a balance of photoelectric heating and radiative cooling. Neutral hydrogen is traced by the 21-cm hyperfine line, dust reddens and extinguishes starlight along a characteristic wavelength law, and the ultraviolet output of hot stars carves ionized Strömgren spheres out of the surrounding gas.\n",{"path":9539,"title":9540,"module":9536,"summary":9541},"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse","Molecular Clouds and Gravitational Collapse","Stars form in cold, dense molecular clouds when self-gravity overcomes thermal and magnetic support. The virial theorem fixes the Jeans mass and length at which a clump becomes unstable, the free-fall time sets how fast it collapses, and a fragmentation cascade — cut off at a minimum mass by the onset of opacity — turns one cloud into a whole cluster, imprinting the stellar initial mass function.\n",{"path":9543,"title":9544,"module":9536,"summary":9545},"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence","Protostars and Pre-Main-Sequence Evolution","A collapsing core becomes optically thick and forms a protostar that grows by accretion through a disk while driving bipolar outflows. The newborn star appears on the birthline and contracts down the fully convective Hayashi track, then crosses the radiative Henyey track to the zero-age main sequence, powered by gravitational contraction until hydrogen ignites. Below about 0.08 solar masses degeneracy halts contraction before ignition, dividing stars from brown dwarfs.\n",{"path":9547,"title":9548,"module":9549,"summary":9550},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure","The Main Sequence and Its Structure","Stellar Evolution","A star settles onto the zero-age main sequence when core hydrogen ignition halts contraction. Homology scaling of the structure equations reproduces the mass–luminosity relation, and the burning mode splits the sequence into an upper branch with a convective core and a lower branch with a convective envelope. The main-sequence lifetime falls steeply with mass, and the turnoff of a coeval cluster serves as a clock.\n",{"path":9552,"title":9553,"module":9549,"summary":9554},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution","Post-Main-Sequence Evolution of Low-Mass Stars","When a low-mass star exhausts core hydrogen, burning moves to a shell, the core contracts, and the envelope swells into a red giant. A degenerate helium core ignites in a flash, settles onto the horizontal branch, and after a second contraction the star climbs the asymptotic giant branch with two burning shells. Thermal pulses and dredge-up enrich the surface, and mass loss ejects a planetary nebula, leaving a carbon–oxygen white dwarf.\n",{"path":9556,"title":9557,"module":9549,"summary":9558},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars","The Evolution of Massive Stars","Stars above about eight solar masses burn through hydrogen, helium, carbon, neon, oxygen, and silicon in stages that grow shorter as neutrino losses accelerate contraction. The interior becomes an onion of concentric burning shells around an inert iron core. Radiation pressure near the Eddington limit drives fierce winds that can strip the hydrogen envelope entirely, and silicon burning builds an iron core toward the threshold of collapse.\n",{"path":9560,"title":9561,"module":9549,"summary":9562},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip","Stellar Pulsation and the Instability Strip","Radial pulsation is a standing sound wave whose period scales inversely with the square root of the mean density. The kappa mechanism, an opacity valve seated in the helium partial-ionization zone, turns a star into a heat engine that pumps the oscillation. Stars in the instability strip pulsate as Cepheids, RR Lyrae, and Mira variables, and the Cepheid period–luminosity relation calibrates the distance ladder.\n",{"path":9564,"title":7984,"module":9565,"summary":9566},"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit","Stellar Death and Compact Remnants","A white dwarf is held up by the degeneracy pressure of its electrons, a quantum-mechanical stiffness that survives to zero temperature. Filling the Fermi sea sets a pressure that scales as density to the five-thirds power when the electrons are slow and only four-thirds when they are relativistic. The softer relativistic law produces the inverted mass-radius relation and a maximum mass, the Chandrasekhar limit near 1.4 solar masses, above which no cold equilibrium exists. Cooling and crystallization then turn the white-dwarf population into a clock for the Galactic disk.\n",{"path":9568,"title":9569,"module":9565,"summary":9570},"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae","Core-Collapse Supernovae","When a massive star builds an iron core past the Chandrasekhar mass, degeneracy fails and the core collapses in less than a second. Photodisintegration and electron capture remove pressure support and neutronize the matter; the collapse halts abruptly at nuclear density, launching a shock that stalls and is revived by neutrino heating. The event is a Type II or stripped-envelope Ib\u002FIc supernova, and the neutrinos from SN 1987A confirmed the picture directly.\n",{"path":9572,"title":9573,"module":9565,"summary":9574},"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia","Thermonuclear Supernovae","A carbon-oxygen white dwarf driven toward the Chandrasekhar mass ignites its degenerate fuel and unbinds itself in a thermonuclear runaway, the Type Ia supernova. The light curve is powered by the radioactive decay of nickel-56 to cobalt-56 to iron-56, and the Phillips relation between peak brightness and decline rate makes these events standardizable candles. Their near-uniform luminosity turns them into the distance indicators that revealed cosmic acceleration.\n",{"path":9576,"title":9577,"module":9565,"summary":9578},"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars","Neutron Stars and Pulsars","A neutron star is held up by neutron degeneracy and the repulsive nuclear force, with a maximum mass, the Tolman-Oppenheimer-Volkoff limit, set by an uncertain dense-matter equation of state. Its rotating magnetic dipole sweeps a beam past Earth as a pulsar, and magnetic braking traces a track across the period-period- derivative diagram. Millisecond pulsars, magnetars, glitches, and the orbital decay of the Hulse-Taylor binary follow from the same structure.\n",{"path":9580,"title":9581,"module":9565,"summary":9582},"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr","Black Holes, Schwarzschild and Kerr","Above the neutron-star mass limit gravity wins completely and the remnant is a black hole. The Schwarzschild solution gives the event horizon, gravitational redshift, and time dilation; the innermost stable circular orbit sets the efficiency of accretion. Rotating Kerr black holes drag spacetime and carry an ergosphere. Stellar-mass black holes are found in X-ray binaries, and the Event Horizon Telescope has imaged the shadow of a supermassive one.\n",{"path":9584,"title":9585,"module":9586,"summary":9587},"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer","Binary Systems and Mass Transfer","Binaries and Gravitational Waves","Most stars are born in pairs, and a binary is the only setting where a stellar mass can be measured directly. Visual, spectroscopic, and eclipsing binaries each expose a different combination of the orbital elements, and together they calibrate the mass-luminosity relation. When one star swells to fill its Roche lobe, gas streams through the inner Lagrange point onto its companion. Conservative transfer widens or shrinks the orbit depending on the mass ratio, and the sign of that response explains the Algol paradox.\n",{"path":9589,"title":9590,"module":9586,"summary":9591},"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects","Accreting Compact Objects","Gas falling onto a compact object converts gravitational binding energy into radiation with an efficiency set by the depth of the potential well, up to tens of percent of the rest mass for a neutron star or black hole. Angular momentum forces the flow into a disk, and viscous dissipation gives a temperature profile that falls as radius to the minus three-quarters, producing a multicolor blackbody spectrum. Radiation pressure caps the steady luminosity at the Eddington limit. Unstable nuclear burning of the accreted fuel powers classical novae on white dwarfs and Type I X-ray bursts on neutron stars.\n",{"path":9593,"title":9594,"module":9586,"summary":9595},"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries","Gravitational Waves from Inspiraling Binaries","A time-varying mass quadrupole radiates gravitational waves, ripples in spacetime that stretch and squeeze a ring of free masses along two polarizations. The radiated power drains a binary's orbital energy, shrinking the orbit and sweeping the wave frequency upward in a chirp whose rate fixes the chirp mass. Laser interferometers with kilometre arms measure the resulting strain of order ten to the minus twenty-one. The first detection, GW150914, matched a template for two merging black holes near thirty solar masses each.\n",{"path":9597,"title":9598,"module":9586,"summary":9599},"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts","Multimessenger Astronomy and Gamma-Ray Bursts","Gamma-ray bursts split into two populations: long bursts from the collapse of massive stars and short bursts from merging compact objects. The compactness problem forces the emitting plasma to move at ultra-relativistic speed, beaming the radiation into a narrow jet. The neutron-star merger GW170817 tied a gravitational chirp to a short gamma-ray burst, a radioactive kilonova, and a broadband afterglow, confirming that mergers forge r-process elements. A merger with a measured redshift is a standard siren that reads the Hubble constant from gravitational data alone.\n",{"path":9601,"title":9602,"module":9603,"summary":9604},"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way","The Milky Way Galaxy","Galaxies and Dark Matter","The Galaxy resolves into a thin disk of gas and young stars, a central bar and bulge, and a diffuse old halo studded with globular clusters. Star counts and the reddening of distant light map these components, while the differential rotation of the disk — encoded in the Oort constants and the flat rotation curve — measures the enclosed mass and reveals more than the stars can account for. Spiral arms are density waves, not material structures, and the innermost stellar orbits around Sgr A* weigh a four-million-solar-mass black hole.\n",{"path":9606,"title":9607,"module":9603,"summary":9608},"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification","Galaxy Morphology and Classification","Galaxies sort along the Hubble tuning fork from smooth ellipticals through lenticulars to grand-design and barred spirals, with irregulars off the end. The light of a spheroid follows the de Vaucouleurs quarter-power law while a disk fades exponentially, and the general Sérsic profile interpolates between them. Virial scaling relations — Tully–Fisher for disks, Faber–Jackson and the fundamental plane for spheroids — tie luminosity to internal motions, and the Schechter function fixes the abundance of galaxies as a function of luminosity.\n",{"path":9610,"title":9611,"module":9603,"summary":9612},"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter","Galaxy Rotation Curves and Dark Matter","The rotation curves of disk galaxies stay flat far beyond the light, demanding an extended halo whose density falls as the inverse square of radius. Decomposing the curve into disk, bulge, and halo, and fitting isothermal or NFW profiles, quantifies the missing mass. Gravitational lensing weighs the same mass without dynamics, the mass-to-light ratio climbs from stars to clusters, and the Bullet Cluster separates the collisionless dark matter from the colliding gas — evidence that MOND strains to match.\n",{"path":9614,"title":9615,"module":9603,"summary":9616},"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes","Active Galactic Nuclei","A small fraction of galaxies pour out enormous luminosity from a region smaller than the solar system. Accretion onto a supermassive black hole, limited by the Eddington balance of radiation pressure and gravity, powers the Seyferts, quasars, radio galaxies, and blazars — one engine seen from different angles through an obscuring torus. Relativistic jets produce apparent superluminal motion, reverberation mapping and stellar dynamics weigh the central mass, and the M–sigma relation ties that mass to the host bulge.\n",{"path":9618,"title":9619,"module":9603,"summary":9620},"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure","Galaxy Clusters and Large-Scale Structure","Galaxies gather into groups and rich clusters bound by a common dark halo and filled with hot X-ray gas. Three independent probes — the virial theorem, the hydrostatic X-ray temperature, and gravitational lensing — agree on a mass that dwarfs the stars. On the largest scales galaxies trace a cosmic web of filaments, walls, and voids, quantified by the two-point correlation function, whose baryon acoustic oscillation bump provides a standard ruler for cosmology.\n",{"path":9622,"title":9623,"module":9624,"summary":9625},"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law","The Expanding Universe and Hubble's Law","Cosmic Expansion and Dynamics","The universe is homogeneous and isotropic on large scales, so its expansion is captured by a single function of time, the scale factor. Comoving coordinates stay fixed while proper distances grow in proportion to the scale factor, producing Hubble's law and a cosmological redshift that measures stretched space rather than a Doppler shift. A Newtonian energy argument reproduces the dynamics, and the same finite, expanding cosmos resolves Olbers' paradox.\n",{"path":9627,"title":9628,"module":9624,"summary":9629},"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift","The FRW Metric and Cosmological Redshift","The geometry of a homogeneous, isotropic universe is fixed by symmetry to the Robertson-Walker metric, with the entire freedom reduced to a scale factor and a single curvature constant selecting an open, flat, or closed space. From the metric the null geodesic of light gives comoving distance, the exact cosmological redshift, and the distinction between the proper distance we cannot measure and the redshift we can.\n",{"path":9631,"title":6702,"module":9624,"summary":9632},"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics","The scale factor obeys the Friedmann equation, the acceleration equation, and the fluid equation, only two of which are independent. An equation of state fixes how each component behaves under expansion, so radiation dilutes as the inverse fourth power of the scale factor, matter as the inverse cube, and vacuum energy not at all. The critical density defines the density parameters, and the deceleration parameter encodes whether gravity or dark energy is winning.\n",{"path":9634,"title":9635,"module":9624,"summary":9636},"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances","Cosmological Models and Distances","Integrating the Friedmann equation for particular mixtures gives the benchmark models, from the matter-only Einstein-de Sitter universe to the concordance Lambda-CDM, each with its own scale-factor history and age. Because the redshift is the only direct observable, several distance measures diverge at high redshift, and the angular-diameter distance even turns over so that the most distant objects look larger. The horizon and lookback time set what is causally and observationally reachable.\n",{"path":9638,"title":9639,"module":9624,"summary":9640},"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe","Dark Energy and the Accelerating Universe","In 1998 two teams found that distant Type Ia supernovae are fainter than a decelerating universe predicts, revealing that the expansion is accelerating and that a component with negative pressure dominates the energy budget. The simplest candidate is the cosmological constant, or vacuum energy, with an equation of state near minus one. It works observationally but leaves two deep puzzles: why the vacuum energy is a hundred and twenty orders of magnitude smaller than expected, and why it is comparable to the matter density just now.\n",{"path":9642,"title":9643,"module":9644,"summary":9645},"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe","The Thermal History of the Universe","The Hot Big Bang","Running the expansion backward compresses and heats the universe, so its past is a sequence of thermal epochs set by temperature. Temperature scales as the inverse scale factor; species stay in equilibrium while their interaction rate exceeds the expansion rate and freeze out when it drops below. The effective degrees of freedom count the relativistic species and step down through mass thresholds, and neutrino decoupling just before electron-positron annihilation leaves a relic neutrino background slightly cooler than the photons.\n",{"path":9647,"title":9648,"module":9644,"summary":9649},"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis","Big Bang Nucleosynthesis","In the first three minutes the weak interactions freeze out the neutron-to-proton ratio, and once deuterium survives photodissociation a fast reaction network converts nearly all free neutrons into helium-4. The primordial abundances of deuterium, helium-3, helium-4, and lithium-7 depend on a single free parameter, the baryon-to-photon ratio, so measuring them fixes the baryon density. The predictions match observation across nine decades of abundance, with a persistent discrepancy in lithium-7.\n",{"path":9651,"title":9652,"module":9644,"summary":9653},"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background","Recombination and the Cosmic Microwave Background","As the universe cooled through a few thousand kelvin the free electrons bound to protons, and the Saha equation tracks the falling ionization fraction. Once the plasma neutralized, photons stopped scattering and streamed freely from a spherical surface of last scattering at redshift about 1100. Those photons are the cosmic microwave background, an almost perfect blackbody at 2.725 kelvin with a dipole from our motion through it.\n",{"path":9655,"title":9656,"module":9644,"summary":9657},"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters","CMB Anisotropies and Cosmological Parameters","The cosmic microwave background carries temperature fluctuations at the ten-parts-per-million level, imprinted by sound waves in the photon-baryon plasma before recombination. Decomposed into spherical harmonics, the fluctuations form an angular power spectrum whose acoustic peaks encode the geometry and contents of the universe: the first peak fixes spatial flatness, the odd-even peak ratio the baryon density, and the third peak the dark-matter density. Polarization adds an independent channel, and the Planck measurements pin the concordance parameters.\n",{"path":9659,"title":9660,"module":9644,"summary":9661},"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation","Cosmic Inflation","The hot Big Bang leaves three initial-condition puzzles unexplained: why causally disconnected patches share a temperature, why the geometry is so nearly flat, and why no magnetic monopoles are seen. A brief epoch of accelerated expansion driven by a slowly rolling scalar field solves all three by stretching a small causal patch across the observable universe. The same accelerated expansion freezes quantum fluctuations into a near-scale-invariant spectrum of density perturbations, seeding all later structure.\n",{"path":9663,"title":9664,"module":9644,"summary":9665},"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations","Structure Formation and the Growth of Perturbations","The near-uniform early universe grew its galaxies and clusters by gravitational instability acting on the tiny inflationary perturbations. In an expanding background the growth is slowed to a power law rather than the exponential of a static medium; perturbations stall during radiation domination and grow with the scale factor once matter dominates. The transfer function turns the primordial spectrum into the processed matter power spectrum, and cold dark matter builds structure from the bottom up.\n",{"path":9667,"title":9668,"module":9644,"summary":9669},"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions","Dark Matter, Dark Energy, and Open Questions","Five independent lines of evidence converge on a universe whose energy budget is dominated by dark energy and dark matter, with ordinary baryons a small remainder. The candidate particles for dark matter range from WIMPs to axions to sterile neutrinos, each with its own detection strategy. The concordance model fits the data with six parameters but leaves the nature of dark energy, the Hubble tension, small-scale structure, and the matter-antimatter asymmetry unexplained.\n",{"path":9671,"title":9672,"module":6,"summary":6},"\u002Fastrophysics-cosmology","Astrophysics & Cosmology",{"path":9674,"title":9675,"module":6,"summary":6},"\u002Fcolophon","Colophon",{"path":3255,"title":9677,"module":6,"summary":6},"Study Notes",[9679,9698,9709,9720,9731,9743,9753,9765,9779,9791,9805,9821],{"module":9459,"moduleNumber":9680,"slug":9681,"lessons":9682},1,"orientation",[9683,9688,9693],{"title":9458,"path":9457,"lessonNumber":9680,"topics":9684,"summary":9460},[9685,9686,9687],"The Sun","Stellar magnitudes","The H-R diagram",{"title":9463,"path":9462,"lessonNumber":4040,"topics":9689,"summary":9464},[9690,9691,9692],"Supernovae","Degenerate remnants","Black holes",{"title":9467,"path":9466,"lessonNumber":4053,"topics":9694,"summary":9468},[9695,9696,9697],"Galaxies","Hubble's law","The Big Bang",{"module":9472,"moduleNumber":4040,"slug":9699,"lessons":9700},"observational-foundations",[9701,9703,9705,9707],{"title":9471,"path":9470,"lessonNumber":9680,"topics":9702,"summary":9473},[9472],{"title":9476,"path":9475,"lessonNumber":4040,"topics":9704,"summary":9477},[9472],{"title":9480,"path":9479,"lessonNumber":4053,"topics":9706,"summary":9481},[9472],{"title":9484,"path":9483,"lessonNumber":4054,"topics":9708,"summary":9485},[9472],{"module":4056,"moduleNumber":4053,"slug":9710,"lessons":9711},"radiation-and-matter",[9712,9714,9716,9718],{"title":9488,"path":9487,"lessonNumber":9680,"topics":9713,"summary":9489},[4056],{"title":9492,"path":9491,"lessonNumber":4040,"topics":9715,"summary":9493},[4056],{"title":9496,"path":9495,"lessonNumber":4053,"topics":9717,"summary":9497},[4056],{"title":5,"path":4058,"lessonNumber":4054,"topics":9719,"summary":4076},[4056],{"module":9502,"moduleNumber":4054,"slug":9721,"lessons":9722},"stellar-structure",[9723,9725,9727,9729],{"title":9501,"path":9500,"lessonNumber":9680,"topics":9724,"summary":9503},[9502],{"title":9506,"path":9505,"lessonNumber":4040,"topics":9726,"summary":9507},[9502],{"title":9510,"path":9509,"lessonNumber":4053,"topics":9728,"summary":9511},[9502],{"title":9514,"path":9513,"lessonNumber":4054,"topics":9730,"summary":9515},[9502],{"module":9519,"moduleNumber":9732,"slug":9733,"lessons":9734},5,"nuclear-astrophysics",[9735,9737,9739,9741],{"title":9518,"path":9517,"lessonNumber":9680,"topics":9736,"summary":9520},[9519],{"title":9523,"path":9522,"lessonNumber":4040,"topics":9738,"summary":9524},[9519],{"title":9527,"path":9526,"lessonNumber":4053,"topics":9740,"summary":9528},[9519],{"title":9531,"path":9530,"lessonNumber":4054,"topics":9742,"summary":9532},[9519],{"module":9536,"moduleNumber":9744,"slug":9745,"lessons":9746},6,"ism-and-star-formation",[9747,9749,9751],{"title":9535,"path":9534,"lessonNumber":9680,"topics":9748,"summary":9537},[9536],{"title":9540,"path":9539,"lessonNumber":4040,"topics":9750,"summary":9541},[9536],{"title":9544,"path":9543,"lessonNumber":4053,"topics":9752,"summary":9545},[9536],{"module":9549,"moduleNumber":9754,"slug":9755,"lessons":9756},7,"stellar-evolution",[9757,9759,9761,9763],{"title":9548,"path":9547,"lessonNumber":9680,"topics":9758,"summary":9550},[9549],{"title":9553,"path":9552,"lessonNumber":4040,"topics":9760,"summary":9554},[9549],{"title":9557,"path":9556,"lessonNumber":4053,"topics":9762,"summary":9558},[9549],{"title":9561,"path":9560,"lessonNumber":4054,"topics":9764,"summary":9562},[9549],{"module":9565,"moduleNumber":9766,"slug":9767,"lessons":9768},8,"stellar-death-and-compact-remnants",[9769,9771,9773,9775,9777],{"title":7984,"path":9564,"lessonNumber":9680,"topics":9770,"summary":9566},[9565],{"title":9569,"path":9568,"lessonNumber":4040,"topics":9772,"summary":9570},[9565],{"title":9573,"path":9572,"lessonNumber":4053,"topics":9774,"summary":9574},[9565],{"title":9577,"path":9576,"lessonNumber":4054,"topics":9776,"summary":9578},[9565],{"title":9581,"path":9580,"lessonNumber":9732,"topics":9778,"summary":9582},[9565],{"module":9586,"moduleNumber":9780,"slug":9781,"lessons":9782},9,"binaries-and-gravitational-waves",[9783,9785,9787,9789],{"title":9585,"path":9584,"lessonNumber":9680,"topics":9784,"summary":9587},[9586],{"title":9590,"path":9589,"lessonNumber":4040,"topics":9786,"summary":9591},[9586],{"title":9594,"path":9593,"lessonNumber":4053,"topics":9788,"summary":9595},[9586],{"title":9598,"path":9597,"lessonNumber":4054,"topics":9790,"summary":9599},[9586],{"module":9603,"moduleNumber":9792,"slug":9793,"lessons":9794},10,"galaxies",[9795,9797,9799,9801,9803],{"title":9602,"path":9601,"lessonNumber":9680,"topics":9796,"summary":9604},[9603],{"title":9607,"path":9606,"lessonNumber":4040,"topics":9798,"summary":9608},[9603],{"title":9611,"path":9610,"lessonNumber":4053,"topics":9800,"summary":9612},[9603],{"title":9615,"path":9614,"lessonNumber":4054,"topics":9802,"summary":9616},[9603],{"title":9619,"path":9618,"lessonNumber":9732,"topics":9804,"summary":9620},[9603],{"module":9624,"moduleNumber":9806,"slug":9807,"lessons":9808},11,"cosmology-expansion-and-dynamics",[9809,9812,9814,9816,9818],{"title":9623,"path":9622,"lessonNumber":9680,"topics":9810,"summary":9625},[9811],"Cosmology",{"title":9628,"path":9627,"lessonNumber":4040,"topics":9813,"summary":9629},[9811],{"title":6702,"path":9631,"lessonNumber":4053,"topics":9815,"summary":9632},[9811],{"title":9635,"path":9634,"lessonNumber":4054,"topics":9817,"summary":9636},[9811],{"title":9639,"path":9638,"lessonNumber":9732,"topics":9819,"summary":9640},[9811,9820],"Dark Energy",{"module":9644,"moduleNumber":9822,"slug":9823,"lessons":9824},12,"the-hot-big-bang",[9825,9827,9829,9831,9833,9835,9837],{"title":9643,"path":9642,"lessonNumber":9680,"topics":9826,"summary":9645},[9644],{"title":9648,"path":9647,"lessonNumber":4040,"topics":9828,"summary":9649},[9644],{"title":9652,"path":9651,"lessonNumber":4053,"topics":9830,"summary":9653},[9644],{"title":9656,"path":9655,"lessonNumber":4054,"topics":9832,"summary":9657},[9644],{"title":9660,"path":9659,"lessonNumber":9732,"topics":9834,"summary":9661},[9644],{"title":9664,"path":9663,"lessonNumber":9744,"topics":9836,"summary":9665},[9644],{"title":9668,"path":9667,"lessonNumber":9754,"topics":9838,"summary":9669},[9644],"\u003Csvg style=\"width:100%;max-width:376.736px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 282.552 87.691\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-60.729-14.324h39.834M-60.729-42.777h39.834\"\u002F>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M-46.502-14.324v-27.253\"\u002F>\u003Cpath fill=\"none\" d=\"M-50.347-39.137c2.307-.555 3.396-1.793 3.845-3.04.448 1.247 1.538 2.485 3.845 3.04\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-4.875 13.356)\">\u003Cpath d=\"M-59.577-14.324L-59.858-14.324L-59.858-19.043Q-59.858-19.258-59.920-19.353Q-59.983-19.449-60.100-19.470Q-60.217-19.492-60.463-19.492L-60.463-19.789L-59.241-19.875L-59.241-17.386Q-58.764-17.851-58.065-17.851Q-57.584-17.851-57.176-17.607Q-56.768-17.363-56.532-16.949Q-56.295-16.535-56.295-16.051Q-56.295-15.676-56.444-15.347Q-56.592-15.019-56.862-14.767Q-57.131-14.515-57.475-14.381Q-57.819-14.246-58.178-14.246Q-58.499-14.246-58.797-14.394Q-59.096-14.543-59.303-14.804L-59.577-14.324M-59.217-16.996L-59.217-15.156Q-59.065-14.859-58.805-14.679Q-58.545-14.500-58.233-14.500Q-57.807-14.500-57.540-14.719Q-57.272-14.937-57.157-15.283Q-57.041-15.629-57.041-16.051Q-57.041-16.699-57.290-17.148Q-57.538-17.597-58.135-17.597Q-58.471-17.597-58.760-17.439Q-59.049-17.281-59.217-16.996\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-4.875 13.356)\">\u003Cpath d=\"M-55.532-16.019Q-55.532-16.523-55.276-16.955Q-55.020-17.386-54.584-17.638Q-54.149-17.890-53.649-17.890Q-53.262-17.890-52.920-17.746Q-52.579-17.601-52.317-17.340Q-52.055-17.078-51.913-16.742Q-51.770-16.406-51.770-16.019Q-51.770-15.527-52.034-15.117Q-52.297-14.707-52.727-14.476Q-53.157-14.246-53.649-14.246Q-54.141-14.246-54.575-14.478Q-55.008-14.711-55.270-15.119Q-55.532-15.527-55.532-16.019M-53.649-14.523Q-53.192-14.523-52.940-14.746Q-52.688-14.969-52.600-15.320Q-52.512-15.672-52.512-16.117Q-52.512-16.547-52.606-16.885Q-52.700-17.222-52.954-17.429Q-53.208-17.636-53.649-17.636Q-54.297-17.636-54.541-17.220Q-54.786-16.804-54.786-16.117Q-54.786-15.672-54.698-15.320Q-54.610-14.969-54.358-14.746Q-54.106-14.523-53.649-14.523M-50.602-15.277L-50.602-17.019Q-50.602-17.234-50.665-17.330Q-50.727-17.426-50.846-17.447Q-50.965-17.469-51.211-17.469L-51.211-17.765L-49.965-17.851L-49.965-15.301L-49.965-15.277Q-49.965-14.965-49.911-14.803Q-49.856-14.640-49.706-14.570Q-49.555-14.500-49.235-14.500Q-48.805-14.500-48.532-14.838Q-48.258-15.176-48.258-15.621L-48.258-17.019Q-48.258-17.234-48.321-17.330Q-48.383-17.426-48.502-17.447Q-48.622-17.469-48.868-17.469L-48.868-17.765L-47.622-17.851L-47.622-15.066Q-47.622-14.855-47.559-14.760Q-47.497-14.664-47.377-14.642Q-47.258-14.621-47.012-14.621L-47.012-14.324L-48.235-14.246L-48.235-14.867Q-48.403-14.578-48.684-14.412Q-48.965-14.246-49.286-14.246Q-50.602-14.246-50.602-15.277M-44.637-14.324L-46.493-14.324L-46.493-14.621Q-46.219-14.621-46.051-14.668Q-45.883-14.715-45.883-14.883L-45.883-17.019Q-45.883-17.234-45.946-17.330Q-46.008-17.426-46.127-17.447Q-46.247-17.469-46.493-17.469L-46.493-17.765L-45.301-17.851L-45.301-17.117Q-45.188-17.332-44.995-17.500Q-44.801-17.668-44.563-17.760Q-44.325-17.851-44.071-17.851Q-42.903-17.851-42.903-16.773L-42.903-14.883Q-42.903-14.715-42.733-14.668Q-42.563-14.621-42.293-14.621L-42.293-14.324L-44.149-14.324L-44.149-14.621Q-43.875-14.621-43.708-14.668Q-43.540-14.715-43.540-14.883L-43.540-16.758Q-43.540-17.140-43.661-17.369Q-43.782-17.597-44.133-17.597Q-44.446-17.597-44.700-17.435Q-44.954-17.273-45.100-17.004Q-45.247-16.734-45.247-16.437L-45.247-14.883Q-45.247-14.715-45.077-14.668Q-44.907-14.621-44.637-14.621L-44.637-14.324M-40.032-14.246Q-40.512-14.246-40.920-14.490Q-41.329-14.734-41.567-15.148Q-41.805-15.562-41.805-16.051Q-41.805-16.543-41.547-16.959Q-41.290-17.375-40.858-17.613Q-40.426-17.851-39.934-17.851Q-39.313-17.851-38.864-17.414L-38.864-19.043Q-38.864-19.258-38.926-19.353Q-38.989-19.449-39.106-19.470Q-39.223-19.492-39.469-19.492L-39.469-19.789L-38.247-19.875L-38.247-15.066Q-38.247-14.855-38.184-14.760Q-38.122-14.664-38.004-14.642Q-37.887-14.621-37.637-14.621L-37.637-14.324L-38.887-14.246L-38.887-14.730Q-39.352-14.246-40.032-14.246M-39.965-14.500Q-39.625-14.500-39.333-14.691Q-39.040-14.883-38.887-15.179L-38.887-17.011Q-39.036-17.285-39.297-17.441Q-39.559-17.597-39.872-17.597Q-40.497-17.597-40.780-17.150Q-41.063-16.703-41.063-16.043Q-41.063-15.398-40.811-14.949Q-40.559-14.500-39.965-14.500M-35.016-15.773L-37.270-15.773L-37.270-16.324L-35.016-16.324L-35.016-15.773M-33.383-14.324L-33.665-14.324L-33.665-19.043Q-33.665-19.258-33.727-19.353Q-33.790-19.449-33.907-19.470Q-34.024-19.492-34.270-19.492L-34.270-19.789L-33.047-19.875L-33.047-17.386Q-32.571-17.851-31.872-17.851Q-31.391-17.851-30.983-17.607Q-30.575-17.363-30.338-16.949Q-30.102-16.535-30.102-16.051Q-30.102-15.676-30.250-15.347Q-30.399-15.019-30.668-14.767Q-30.938-14.515-31.282-14.381Q-31.625-14.246-31.985-14.246Q-32.305-14.246-32.604-14.394Q-32.903-14.543-33.110-14.804L-33.383-14.324M-33.024-16.996L-33.024-15.156Q-32.872-14.859-32.612-14.679Q-32.352-14.500-32.040-14.500Q-31.614-14.500-31.346-14.719Q-31.079-14.937-30.963-15.283Q-30.848-15.629-30.848-16.051Q-30.848-16.699-31.096-17.148Q-31.344-17.597-31.942-17.597Q-32.278-17.597-32.567-17.439Q-32.856-17.281-33.024-16.996\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-4.875 13.356)\">\u003Cpath d=\"M-29.323-16.019Q-29.323-16.523-29.067-16.955Q-28.811-17.386-28.375-17.638Q-27.940-17.890-27.440-17.890Q-27.053-17.890-26.711-17.746Q-26.370-17.601-26.108-17.340Q-25.846-17.078-25.704-16.742Q-25.561-16.406-25.561-16.019Q-25.561-15.527-25.825-15.117Q-26.088-14.707-26.518-14.476Q-26.948-14.246-27.440-14.246Q-27.932-14.246-28.366-14.478Q-28.799-14.711-29.061-15.119Q-29.323-15.527-29.323-16.019M-27.440-14.523Q-26.983-14.523-26.731-14.746Q-26.479-14.969-26.391-15.320Q-26.303-15.672-26.303-16.117Q-26.303-16.547-26.397-16.885Q-26.491-17.222-26.745-17.429Q-26.998-17.636-27.440-17.636Q-28.088-17.636-28.332-17.220Q-28.577-16.804-28.577-16.117Q-28.577-15.672-28.489-15.320Q-28.401-14.969-28.149-14.746Q-27.897-14.523-27.440-14.523M-24.393-15.277L-24.393-17.019Q-24.393-17.234-24.456-17.330Q-24.518-17.426-24.637-17.447Q-24.756-17.469-25.002-17.469L-25.002-17.765L-23.756-17.851L-23.756-15.301L-23.756-15.277Q-23.756-14.965-23.702-14.803Q-23.647-14.640-23.497-14.570Q-23.346-14.500-23.026-14.500Q-22.596-14.500-22.323-14.838Q-22.049-15.176-22.049-15.621L-22.049-17.019Q-22.049-17.234-22.112-17.330Q-22.174-17.426-22.293-17.447Q-22.413-17.469-22.659-17.469L-22.659-17.765L-21.413-17.851L-21.413-15.066Q-21.413-14.855-21.350-14.760Q-21.288-14.664-21.168-14.642Q-21.049-14.621-20.803-14.621L-20.803-14.324L-22.026-14.246L-22.026-14.867Q-22.194-14.578-22.475-14.412Q-22.756-14.246-23.077-14.246Q-24.393-14.246-24.393-15.277M-18.428-14.324L-20.284-14.324L-20.284-14.621Q-20.010-14.621-19.842-14.668Q-19.674-14.715-19.674-14.883L-19.674-17.019Q-19.674-17.234-19.737-17.330Q-19.799-17.426-19.918-17.447Q-20.038-17.469-20.284-17.469L-20.284-17.765L-19.092-17.851L-19.092-17.117Q-18.979-17.332-18.786-17.500Q-18.592-17.668-18.354-17.760Q-18.116-17.851-17.862-17.851Q-16.694-17.851-16.694-16.773L-16.694-14.883Q-16.694-14.715-16.524-14.668Q-16.354-14.621-16.084-14.621L-16.084-14.324L-17.940-14.324L-17.940-14.621Q-17.666-14.621-17.498-14.668Q-17.331-14.715-17.331-14.883L-17.331-16.758Q-17.331-17.140-17.452-17.369Q-17.573-17.597-17.924-17.597Q-18.237-17.597-18.491-17.435Q-18.745-17.273-18.891-17.004Q-19.038-16.734-19.038-16.437L-19.038-14.883Q-19.038-14.715-18.868-14.668Q-18.698-14.621-18.428-14.621L-18.428-14.324M-13.823-14.246Q-14.303-14.246-14.711-14.490Q-15.120-14.734-15.358-15.148Q-15.596-15.562-15.596-16.051Q-15.596-16.543-15.338-16.959Q-15.081-17.375-14.649-17.613Q-14.217-17.851-13.725-17.851Q-13.104-17.851-12.655-17.414L-12.655-19.043Q-12.655-19.258-12.717-19.353Q-12.780-19.449-12.897-19.470Q-13.014-19.492-13.260-19.492L-13.260-19.789L-12.038-19.875L-12.038-15.066Q-12.038-14.855-11.975-14.760Q-11.913-14.664-11.795-14.642Q-11.678-14.621-11.428-14.621L-11.428-14.324L-12.678-14.246L-12.678-14.730Q-13.143-14.246-13.823-14.246M-13.756-14.500Q-13.416-14.500-13.123-14.691Q-12.831-14.883-12.678-15.179L-12.678-17.011Q-12.827-17.285-13.088-17.441Q-13.350-17.597-13.663-17.597Q-14.288-17.597-14.571-17.150Q-14.854-16.703-14.854-16.043Q-14.854-15.398-14.602-14.949Q-14.350-14.500-13.756-14.500\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M13.249-14.324h39.833\"\u002F>\u003Cpath fill=\"none\" d=\"M13.249-54.158h39.833\" style=\"stroke-dasharray:3.0,2.0\"\u002F>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M27.475-14.324v-44.325\"\u002F>\u003Cpath fill=\"none\" d=\"M23.63-56.209c2.307-.555 3.397-1.793 3.845-3.04.449 1.247 1.538 2.485 3.845 3.04\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(81.47 -49.058)\">\u003Cpath d=\"M-58.424-14.324L-60.409-14.324L-60.409-14.621Q-60.135-14.621-59.967-14.668Q-59.799-14.715-59.799-14.883L-59.799-17.476L-60.440-17.476L-60.440-17.773L-59.799-17.773L-59.799-18.707Q-59.799-18.972-59.682-19.209Q-59.565-19.445-59.372-19.609Q-59.178-19.773-58.930-19.865Q-58.682-19.957-58.416-19.957Q-58.131-19.957-57.907-19.799Q-57.682-19.640-57.682-19.363Q-57.682-19.207-57.788-19.097Q-57.893-18.988-58.057-18.988Q-58.213-18.988-58.323-19.097Q-58.432-19.207-58.432-19.363Q-58.432-19.570-58.272-19.676Q-58.370-19.699-58.463-19.699Q-58.694-19.699-58.866-19.543Q-59.038-19.386-59.124-19.150Q-59.209-18.914-59.209-18.691L-59.209-17.773L-58.241-17.773L-58.241-17.476L-59.186-17.476L-59.186-14.883Q-59.186-14.715-58.959-14.668Q-58.733-14.621-58.424-14.621L-58.424-14.324M-55.889-14.324L-57.870-14.324L-57.870-14.621Q-57.600-14.621-57.432-14.666Q-57.264-14.711-57.264-14.883L-57.264-17.019Q-57.264-17.234-57.327-17.330Q-57.389-17.426-57.506-17.447Q-57.624-17.469-57.870-17.469L-57.870-17.765L-56.702-17.851L-56.702-17.066Q-56.624-17.277-56.471-17.463Q-56.319-17.648-56.120-17.750Q-55.920-17.851-55.694-17.851Q-55.448-17.851-55.256-17.707Q-55.065-17.562-55.065-17.332Q-55.065-17.176-55.170-17.066Q-55.276-16.957-55.432-16.957Q-55.588-16.957-55.698-17.066Q-55.807-17.176-55.807-17.332Q-55.807-17.492-55.702-17.597Q-56.026-17.597-56.241-17.369Q-56.456-17.140-56.551-16.801Q-56.647-16.461-56.647-16.156L-56.647-14.883Q-56.647-14.715-56.420-14.668Q-56.194-14.621-55.889-14.621L-55.889-14.324M-54.584-16.078Q-54.584-16.558-54.352-16.974Q-54.120-17.390-53.709-17.640Q-53.299-17.890-52.823-17.890Q-52.092-17.890-51.694-17.449Q-51.295-17.008-51.295-16.277Q-51.295-16.172-51.389-16.148L-53.838-16.148L-53.838-16.078Q-53.838-15.668-53.717-15.312Q-53.596-14.957-53.325-14.740Q-53.053-14.523-52.624-14.523Q-52.260-14.523-51.963-14.752Q-51.666-14.980-51.565-15.332Q-51.557-15.379-51.471-15.394L-51.389-15.394Q-51.295-15.367-51.295-15.285Q-51.295-15.277-51.303-15.246Q-51.366-15.019-51.504-14.836Q-51.643-14.652-51.834-14.519Q-52.026-14.386-52.245-14.316Q-52.463-14.246-52.702-14.246Q-53.073-14.246-53.411-14.383Q-53.749-14.519-54.016-14.771Q-54.284-15.023-54.434-15.363Q-54.584-15.703-54.584-16.078M-53.831-16.386L-51.870-16.386Q-51.870-16.691-51.971-16.982Q-52.073-17.273-52.290-17.455Q-52.506-17.636-52.823-17.636Q-53.124-17.636-53.354-17.449Q-53.584-17.261-53.708-16.970Q-53.831-16.679-53.831-16.386M-50.807-16.078Q-50.807-16.558-50.575-16.974Q-50.342-17.390-49.932-17.640Q-49.522-17.890-49.045-17.890Q-48.315-17.890-47.916-17.449Q-47.518-17.008-47.518-16.277Q-47.518-16.172-47.612-16.148L-50.061-16.148L-50.061-16.078Q-50.061-15.668-49.940-15.312Q-49.819-14.957-49.547-14.740Q-49.276-14.523-48.846-14.523Q-48.483-14.523-48.186-14.752Q-47.889-14.980-47.788-15.332Q-47.780-15.379-47.694-15.394L-47.612-15.394Q-47.518-15.367-47.518-15.285Q-47.518-15.277-47.526-15.246Q-47.588-15.019-47.727-14.836Q-47.866-14.652-48.057-14.519Q-48.249-14.386-48.467-14.316Q-48.686-14.246-48.924-14.246Q-49.295-14.246-49.633-14.383Q-49.971-14.519-50.239-14.771Q-50.506-15.023-50.657-15.363Q-50.807-15.703-50.807-16.078M-50.053-16.386L-48.092-16.386Q-48.092-16.691-48.194-16.982Q-48.295-17.273-48.512-17.455Q-48.729-17.636-49.045-17.636Q-49.346-17.636-49.577-17.449Q-49.807-17.261-49.930-16.970Q-50.053-16.679-50.053-16.386\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(74.057 13.356)\">\u003Cpath d=\"M-59.577-14.324L-59.858-14.324L-59.858-19.043Q-59.858-19.258-59.920-19.353Q-59.983-19.449-60.100-19.470Q-60.217-19.492-60.463-19.492L-60.463-19.789L-59.241-19.875L-59.241-17.386Q-58.764-17.851-58.065-17.851Q-57.584-17.851-57.176-17.607Q-56.768-17.363-56.532-16.949Q-56.295-16.535-56.295-16.051Q-56.295-15.676-56.444-15.347Q-56.592-15.019-56.862-14.767Q-57.131-14.515-57.475-14.381Q-57.819-14.246-58.178-14.246Q-58.499-14.246-58.797-14.394Q-59.096-14.543-59.303-14.804L-59.577-14.324M-59.217-16.996L-59.217-15.156Q-59.065-14.859-58.805-14.679Q-58.545-14.500-58.233-14.500Q-57.807-14.500-57.540-14.719Q-57.272-14.937-57.157-15.283Q-57.041-15.629-57.041-16.051Q-57.041-16.699-57.290-17.148Q-57.538-17.597-58.135-17.597Q-58.471-17.597-58.760-17.439Q-59.049-17.281-59.217-16.996\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(74.057 13.356)\">\u003Cpath d=\"M-55.532-16.019Q-55.532-16.523-55.276-16.955Q-55.020-17.386-54.584-17.638Q-54.149-17.890-53.649-17.890Q-53.262-17.890-52.920-17.746Q-52.579-17.601-52.317-17.340Q-52.055-17.078-51.913-16.742Q-51.770-16.406-51.770-16.019Q-51.770-15.527-52.034-15.117Q-52.297-14.707-52.727-14.476Q-53.157-14.246-53.649-14.246Q-54.141-14.246-54.575-14.478Q-55.008-14.711-55.270-15.119Q-55.532-15.527-55.532-16.019M-53.649-14.523Q-53.192-14.523-52.940-14.746Q-52.688-14.969-52.600-15.320Q-52.512-15.672-52.512-16.117Q-52.512-16.547-52.606-16.885Q-52.700-17.222-52.954-17.429Q-53.208-17.636-53.649-17.636Q-54.297-17.636-54.541-17.220Q-54.786-16.804-54.786-16.117Q-54.786-15.672-54.698-15.320Q-54.610-14.969-54.358-14.746Q-54.106-14.523-53.649-14.523M-50.602-15.277L-50.602-17.019Q-50.602-17.234-50.665-17.330Q-50.727-17.426-50.846-17.447Q-50.965-17.469-51.211-17.469L-51.211-17.765L-49.965-17.851L-49.965-15.301L-49.965-15.277Q-49.965-14.965-49.911-14.803Q-49.856-14.640-49.706-14.570Q-49.555-14.500-49.235-14.500Q-48.805-14.500-48.532-14.838Q-48.258-15.176-48.258-15.621L-48.258-17.019Q-48.258-17.234-48.321-17.330Q-48.383-17.426-48.502-17.447Q-48.622-17.469-48.868-17.469L-48.868-17.765L-47.622-17.851L-47.622-15.066Q-47.622-14.855-47.559-14.760Q-47.497-14.664-47.377-14.642Q-47.258-14.621-47.012-14.621L-47.012-14.324L-48.235-14.246L-48.235-14.867Q-48.403-14.578-48.684-14.412Q-48.965-14.246-49.286-14.246Q-50.602-14.246-50.602-15.277M-44.637-14.324L-46.493-14.324L-46.493-14.621Q-46.219-14.621-46.051-14.668Q-45.883-14.715-45.883-14.883L-45.883-17.019Q-45.883-17.234-45.946-17.330Q-46.008-17.426-46.127-17.447Q-46.247-17.469-46.493-17.469L-46.493-17.765L-45.301-17.851L-45.301-17.117Q-45.188-17.332-44.995-17.500Q-44.801-17.668-44.563-17.760Q-44.325-17.851-44.071-17.851Q-42.903-17.851-42.903-16.773L-42.903-14.883Q-42.903-14.715-42.733-14.668Q-42.563-14.621-42.293-14.621L-42.293-14.324L-44.149-14.324L-44.149-14.621Q-43.875-14.621-43.708-14.668Q-43.540-14.715-43.540-14.883L-43.540-16.758Q-43.540-17.140-43.661-17.369Q-43.782-17.597-44.133-17.597Q-44.446-17.597-44.700-17.435Q-44.954-17.273-45.100-17.004Q-45.247-16.734-45.247-16.437L-45.247-14.883Q-45.247-14.715-45.077-14.668Q-44.907-14.621-44.637-14.621L-44.637-14.324M-40.032-14.246Q-40.512-14.246-40.920-14.490Q-41.329-14.734-41.567-15.148Q-41.805-15.562-41.805-16.051Q-41.805-16.543-41.547-16.959Q-41.290-17.375-40.858-17.613Q-40.426-17.851-39.934-17.851Q-39.313-17.851-38.864-17.414L-38.864-19.043Q-38.864-19.258-38.926-19.353Q-38.989-19.449-39.106-19.470Q-39.223-19.492-39.469-19.492L-39.469-19.789L-38.247-19.875L-38.247-15.066Q-38.247-14.855-38.184-14.760Q-38.122-14.664-38.004-14.642Q-37.887-14.621-37.637-14.621L-37.637-14.324L-38.887-14.246L-38.887-14.730Q-39.352-14.246-40.032-14.246M-39.965-14.500Q-39.625-14.500-39.333-14.691Q-39.040-14.883-38.887-15.179L-38.887-17.011Q-39.036-17.285-39.297-17.441Q-39.559-17.597-39.872-17.597Q-40.497-17.597-40.780-17.150Q-41.063-16.703-41.063-16.043Q-41.063-15.398-40.811-14.949Q-40.559-14.500-39.965-14.500M-35.016-15.773L-37.270-15.773L-37.270-16.324L-35.016-16.324L-35.016-15.773M-32.231-14.324L-34.215-14.324L-34.215-14.621Q-33.942-14.621-33.774-14.668Q-33.606-14.715-33.606-14.883L-33.606-17.476L-34.247-17.476L-34.247-17.773L-33.606-17.773L-33.606-18.707Q-33.606-18.972-33.489-19.209Q-33.372-19.445-33.178-19.609Q-32.985-19.773-32.737-19.865Q-32.489-19.957-32.223-19.957Q-31.938-19.957-31.713-19.799Q-31.489-19.640-31.489-19.363Q-31.489-19.207-31.594-19.097Q-31.700-18.988-31.864-18.988Q-32.020-18.988-32.129-19.097Q-32.239-19.207-32.239-19.363Q-32.239-19.570-32.079-19.676Q-32.176-19.699-32.270-19.699Q-32.500-19.699-32.672-19.543Q-32.844-19.386-32.930-19.150Q-33.016-18.914-33.016-18.691L-33.016-17.773L-32.047-17.773L-32.047-17.476L-32.993-17.476L-32.993-14.883Q-32.993-14.715-32.766-14.668Q-32.540-14.621-32.231-14.621L-32.231-14.324M-29.696-14.324L-31.676-14.324L-31.676-14.621Q-31.407-14.621-31.239-14.666Q-31.071-14.711-31.071-14.883L-31.071-17.019Q-31.071-17.234-31.133-17.330Q-31.196-17.426-31.313-17.447Q-31.430-17.469-31.676-17.469L-31.676-17.765L-30.508-17.851L-30.508-17.066Q-30.430-17.277-30.278-17.463Q-30.125-17.648-29.926-17.750Q-29.727-17.851-29.500-17.851Q-29.254-17.851-29.063-17.707Q-28.872-17.562-28.872-17.332Q-28.872-17.176-28.977-17.066Q-29.083-16.957-29.239-16.957Q-29.395-16.957-29.504-17.066Q-29.614-17.176-29.614-17.332Q-29.614-17.492-29.508-17.597Q-29.833-17.597-30.047-17.369Q-30.262-17.140-30.358-16.801Q-30.454-16.461-30.454-16.156L-30.454-14.883Q-30.454-14.715-30.227-14.668Q-30-14.621-29.696-14.621L-29.696-14.324M-28.391-16.078Q-28.391-16.558-28.159-16.974Q-27.926-17.390-27.516-17.640Q-27.106-17.890-26.629-17.890Q-25.899-17.890-25.500-17.449Q-25.102-17.008-25.102-16.277Q-25.102-16.172-25.196-16.148L-27.645-16.148L-27.645-16.078Q-27.645-15.668-27.524-15.312Q-27.403-14.957-27.131-14.740Q-26.860-14.523-26.430-14.523Q-26.067-14.523-25.770-14.752Q-25.473-14.980-25.372-15.332Q-25.364-15.379-25.278-15.394L-25.196-15.394Q-25.102-15.367-25.102-15.285Q-25.102-15.277-25.110-15.246Q-25.172-15.019-25.311-14.836Q-25.450-14.652-25.641-14.519Q-25.833-14.386-26.051-14.316Q-26.270-14.246-26.508-14.246Q-26.879-14.246-27.217-14.383Q-27.555-14.519-27.823-14.771Q-28.090-15.023-28.241-15.363Q-28.391-15.703-28.391-16.078M-27.637-16.386L-25.676-16.386Q-25.676-16.691-25.778-16.982Q-25.879-17.273-26.096-17.455Q-26.313-17.636-26.629-17.636Q-26.930-17.636-27.161-17.449Q-27.391-17.261-27.514-16.970Q-27.637-16.679-27.637-16.386M-24.614-16.078Q-24.614-16.558-24.381-16.974Q-24.149-17.390-23.739-17.640Q-23.329-17.890-22.852-17.890Q-22.122-17.890-21.723-17.449Q-21.325-17.008-21.325-16.277Q-21.325-16.172-21.418-16.148L-23.868-16.148L-23.868-16.078Q-23.868-15.668-23.747-15.312Q-23.625-14.957-23.354-14.740Q-23.083-14.523-22.653-14.523Q-22.290-14.523-21.993-14.752Q-21.696-14.980-21.594-15.332Q-21.586-15.379-21.500-15.394L-21.418-15.394Q-21.325-15.367-21.325-15.285Q-21.325-15.277-21.333-15.246Q-21.395-15.019-21.534-14.836Q-21.672-14.652-21.864-14.519Q-22.055-14.386-22.274-14.316Q-22.493-14.246-22.731-14.246Q-23.102-14.246-23.440-14.383Q-23.778-14.519-24.045-14.771Q-24.313-15.023-24.463-15.363Q-24.614-15.703-24.614-16.078M-23.860-16.386L-21.899-16.386Q-21.899-16.691-22-16.982Q-22.102-17.273-22.319-17.455Q-22.536-17.636-22.852-17.636Q-23.153-17.636-23.383-17.449Q-23.614-17.261-23.737-16.970Q-23.860-16.679-23.860-16.386\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M109.642-20.014a2.5 2.5 0 1 0-5 0 2.5 2.5 0 0 0 5 0m-2.5 0\"\u002F>\u003Cg transform=\"translate(162.204 4.63)\">\u003Cpath d=\"M-58.631-14.324L-60.409-14.324L-60.409-14.621Q-60.135-14.621-59.967-14.668Q-59.799-14.715-59.799-14.883L-59.799-17.019Q-59.799-17.234-59.856-17.330Q-59.913-17.426-60.026-17.447Q-60.139-17.469-60.385-17.469L-60.385-17.765L-59.186-17.851L-59.186-14.883Q-59.186-14.715-59.040-14.668Q-58.893-14.621-58.631-14.621L-58.631-14.324M-60.073-19.246Q-60.073-19.437-59.938-19.568Q-59.803-19.699-59.608-19.699Q-59.487-19.699-59.383-19.636Q-59.280-19.574-59.217-19.470Q-59.155-19.367-59.155-19.246Q-59.155-19.051-59.286-18.916Q-59.416-18.781-59.608-18.781Q-59.807-18.781-59.940-18.914Q-60.073-19.047-60.073-19.246M-58.131-16.019Q-58.131-16.523-57.875-16.955Q-57.620-17.386-57.184-17.638Q-56.749-17.890-56.249-17.890Q-55.862-17.890-55.520-17.746Q-55.178-17.601-54.916-17.340Q-54.655-17.078-54.512-16.742Q-54.370-16.406-54.370-16.019Q-54.370-15.527-54.633-15.117Q-54.897-14.707-55.327-14.476Q-55.756-14.246-56.249-14.246Q-56.741-14.246-57.174-14.478Q-57.608-14.711-57.870-15.119Q-58.131-15.527-58.131-16.019M-56.249-14.523Q-55.791-14.523-55.540-14.746Q-55.288-14.969-55.200-15.320Q-55.112-15.672-55.112-16.117Q-55.112-16.547-55.206-16.885Q-55.299-17.222-55.553-17.429Q-55.807-17.636-56.249-17.636Q-56.897-17.636-57.141-17.220Q-57.385-16.804-57.385-16.117Q-57.385-15.672-57.297-15.320Q-57.209-14.969-56.958-14.746Q-56.706-14.523-56.249-14.523M-51.956-14.324L-53.811-14.324L-53.811-14.621Q-53.538-14.621-53.370-14.668Q-53.202-14.715-53.202-14.883L-53.202-17.019Q-53.202-17.234-53.264-17.330Q-53.327-17.426-53.446-17.447Q-53.565-17.469-53.811-17.469L-53.811-17.765L-52.620-17.851L-52.620-17.117Q-52.506-17.332-52.313-17.500Q-52.120-17.668-51.881-17.760Q-51.643-17.851-51.389-17.851Q-50.221-17.851-50.221-16.773L-50.221-14.883Q-50.221-14.715-50.051-14.668Q-49.881-14.621-49.612-14.621L-49.612-14.324L-51.467-14.324L-51.467-14.621Q-51.194-14.621-51.026-14.668Q-50.858-14.715-50.858-14.883L-50.858-16.758Q-50.858-17.140-50.979-17.369Q-51.100-17.597-51.452-17.597Q-51.764-17.597-52.018-17.435Q-52.272-17.273-52.418-17.004Q-52.565-16.734-52.565-16.437L-52.565-14.883Q-52.565-14.715-52.395-14.668Q-52.225-14.621-51.956-14.621\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M90.071-51.313c11.381 11.382 22.762 11.382 34.143-2.845\" style=\"stroke-width:1.2\"\u002F>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m124.214-54.158 7.97-7.97\"\u002F>\u003Cpath fill=\"none\" d=\"M128.45-62.808c1.655.994 3.017.882 4.017.397-.485 1-.596 2.363.398 4.018\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799992\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(152.989 19.047)\">\u003Cpath d=\"M-58.424-14.324L-60.409-14.324L-60.409-14.621Q-60.135-14.621-59.967-14.668Q-59.799-14.715-59.799-14.883L-59.799-17.476L-60.440-17.476L-60.440-17.773L-59.799-17.773L-59.799-18.707Q-59.799-18.972-59.682-19.209Q-59.565-19.445-59.372-19.609Q-59.178-19.773-58.930-19.865Q-58.682-19.957-58.416-19.957Q-58.131-19.957-57.907-19.799Q-57.682-19.640-57.682-19.363Q-57.682-19.207-57.788-19.097Q-57.893-18.988-58.057-18.988Q-58.213-18.988-58.323-19.097Q-58.432-19.207-58.432-19.363Q-58.432-19.570-58.272-19.676Q-58.370-19.699-58.463-19.699Q-58.694-19.699-58.866-19.543Q-59.038-19.386-59.124-19.150Q-59.209-18.914-59.209-18.691L-59.209-17.773L-58.241-17.773L-58.241-17.476L-59.186-17.476L-59.186-14.883Q-59.186-14.715-58.959-14.668Q-58.733-14.621-58.424-14.621L-58.424-14.324M-55.889-14.324L-57.870-14.324L-57.870-14.621Q-57.600-14.621-57.432-14.666Q-57.264-14.711-57.264-14.883L-57.264-17.019Q-57.264-17.234-57.327-17.330Q-57.389-17.426-57.506-17.447Q-57.624-17.469-57.870-17.469L-57.870-17.765L-56.702-17.851L-56.702-17.066Q-56.624-17.277-56.471-17.463Q-56.319-17.648-56.120-17.750Q-55.920-17.851-55.694-17.851Q-55.448-17.851-55.256-17.707Q-55.065-17.562-55.065-17.332Q-55.065-17.176-55.170-17.066Q-55.276-16.957-55.432-16.957Q-55.588-16.957-55.698-17.066Q-55.807-17.176-55.807-17.332Q-55.807-17.492-55.702-17.597Q-56.026-17.597-56.241-17.369Q-56.456-17.140-56.551-16.801Q-56.647-16.461-56.647-16.156L-56.647-14.883Q-56.647-14.715-56.420-14.668Q-56.194-14.621-55.889-14.621L-55.889-14.324M-54.584-16.078Q-54.584-16.558-54.352-16.974Q-54.120-17.390-53.709-17.640Q-53.299-17.890-52.823-17.890Q-52.092-17.890-51.694-17.449Q-51.295-17.008-51.295-16.277Q-51.295-16.172-51.389-16.148L-53.838-16.148L-53.838-16.078Q-53.838-15.668-53.717-15.312Q-53.596-14.957-53.325-14.740Q-53.053-14.523-52.624-14.523Q-52.260-14.523-51.963-14.752Q-51.666-14.980-51.565-15.332Q-51.557-15.379-51.471-15.394L-51.389-15.394Q-51.295-15.367-51.295-15.285Q-51.295-15.277-51.303-15.246Q-51.366-15.019-51.504-14.836Q-51.643-14.652-51.834-14.519Q-52.026-14.386-52.245-14.316Q-52.463-14.246-52.702-14.246Q-53.073-14.246-53.411-14.383Q-53.749-14.519-54.016-14.771Q-54.284-15.023-54.434-15.363Q-54.584-15.703-54.584-16.078M-53.831-16.386L-51.870-16.386Q-51.870-16.691-51.971-16.982Q-52.073-17.273-52.290-17.455Q-52.506-17.636-52.823-17.636Q-53.124-17.636-53.354-17.449Q-53.584-17.261-53.708-16.970Q-53.831-16.679-53.831-16.386M-50.807-16.078Q-50.807-16.558-50.575-16.974Q-50.342-17.390-49.932-17.640Q-49.522-17.890-49.045-17.890Q-48.315-17.890-47.916-17.449Q-47.518-17.008-47.518-16.277Q-47.518-16.172-47.612-16.148L-50.061-16.148L-50.061-16.078Q-50.061-15.668-49.940-15.312Q-49.819-14.957-49.547-14.740Q-49.276-14.523-48.846-14.523Q-48.483-14.523-48.186-14.752Q-47.889-14.980-47.788-15.332Q-47.780-15.379-47.694-15.394L-47.612-15.394Q-47.518-15.367-47.518-15.285Q-47.518-15.277-47.526-15.246Q-47.588-15.019-47.727-14.836Q-47.866-14.652-48.057-14.519Q-48.249-14.386-48.467-14.316Q-48.686-14.246-48.924-14.246Q-49.295-14.246-49.633-14.383Q-49.971-14.519-50.239-14.771Q-50.506-15.023-50.657-15.363Q-50.807-15.703-50.807-16.078M-50.053-16.386L-48.092-16.386Q-48.092-16.691-48.194-16.982Q-48.295-17.273-48.512-17.455Q-48.729-17.636-49.045-17.636Q-49.346-17.636-49.577-17.449Q-49.807-17.261-49.930-16.970Q-50.053-16.679-50.053-16.386M-44.916-15.773L-47.170-15.773L-47.170-16.324L-44.916-16.324L-44.916-15.773M-42.131-14.324L-44.116-14.324L-44.116-14.621Q-43.842-14.621-43.674-14.668Q-43.506-14.715-43.506-14.883L-43.506-17.476L-44.147-17.476L-44.147-17.773L-43.506-17.773L-43.506-18.707Q-43.506-18.972-43.389-19.209Q-43.272-19.445-43.079-19.609Q-42.885-19.773-42.637-19.865Q-42.389-19.957-42.124-19.957Q-41.838-19.957-41.614-19.799Q-41.389-19.640-41.389-19.363Q-41.389-19.207-41.495-19.097Q-41.600-18.988-41.764-18.988Q-41.920-18.988-42.030-19.097Q-42.139-19.207-42.139-19.363Q-42.139-19.570-41.979-19.676Q-42.077-19.699-42.170-19.699Q-42.401-19.699-42.573-19.543Q-42.745-19.386-42.831-19.150Q-42.916-18.914-42.916-18.691L-42.916-17.773L-41.948-17.773L-41.948-17.476L-42.893-17.476L-42.893-14.883Q-42.893-14.715-42.666-14.668Q-42.440-14.621-42.131-14.621L-42.131-14.324M-39.596-14.324L-41.577-14.324L-41.577-14.621Q-41.307-14.621-41.139-14.666Q-40.971-14.711-40.971-14.883L-40.971-17.019Q-40.971-17.234-41.034-17.330Q-41.096-17.426-41.213-17.447Q-41.331-17.469-41.577-17.469L-41.577-17.765L-40.409-17.851L-40.409-17.066Q-40.331-17.277-40.178-17.463Q-40.026-17.648-39.827-17.750Q-39.627-17.851-39.401-17.851Q-39.155-17.851-38.963-17.707Q-38.772-17.562-38.772-17.332Q-38.772-17.176-38.877-17.066Q-38.983-16.957-39.139-16.957Q-39.295-16.957-39.405-17.066Q-39.514-17.176-39.514-17.332Q-39.514-17.492-39.409-17.597Q-39.733-17.597-39.948-17.369Q-40.163-17.140-40.258-16.801Q-40.354-16.461-40.354-16.156L-40.354-14.883Q-40.354-14.715-40.127-14.668Q-39.901-14.621-39.596-14.621L-39.596-14.324M-38.291-16.078Q-38.291-16.558-38.059-16.974Q-37.827-17.390-37.416-17.640Q-37.006-17.890-36.530-17.890Q-35.799-17.890-35.401-17.449Q-35.002-17.008-35.002-16.277Q-35.002-16.172-35.096-16.148L-37.545-16.148L-37.545-16.078Q-37.545-15.668-37.424-15.312Q-37.303-14.957-37.032-14.740Q-36.760-14.523-36.331-14.523Q-35.967-14.523-35.670-14.752Q-35.374-14.980-35.272-15.332Q-35.264-15.379-35.178-15.394L-35.096-15.394Q-35.002-15.367-35.002-15.285Q-35.002-15.277-35.010-15.246Q-35.073-15.019-35.211-14.836Q-35.350-14.652-35.541-14.519Q-35.733-14.386-35.952-14.316Q-36.170-14.246-36.409-14.246Q-36.780-14.246-37.118-14.383Q-37.456-14.519-37.723-14.771Q-37.991-15.023-38.141-15.363Q-38.291-15.703-38.291-16.078M-37.538-16.386L-35.577-16.386Q-35.577-16.691-35.678-16.982Q-35.780-17.273-35.997-17.455Q-36.213-17.636-36.530-17.636Q-36.831-17.636-37.061-17.449Q-37.291-17.261-37.415-16.970Q-37.538-16.679-37.538-16.386M-34.514-16.078Q-34.514-16.558-34.282-16.974Q-34.049-17.390-33.639-17.640Q-33.229-17.890-32.752-17.890Q-32.022-17.890-31.624-17.449Q-31.225-17.008-31.225-16.277Q-31.225-16.172-31.319-16.148L-33.768-16.148L-33.768-16.078Q-33.768-15.668-33.647-15.312Q-33.526-14.957-33.254-14.740Q-32.983-14.523-32.553-14.523Q-32.190-14.523-31.893-14.752Q-31.596-14.980-31.495-15.332Q-31.487-15.379-31.401-15.394L-31.319-15.394Q-31.225-15.367-31.225-15.285Q-31.225-15.277-31.233-15.246Q-31.295-15.019-31.434-14.836Q-31.573-14.652-31.764-14.519Q-31.956-14.386-32.174-14.316Q-32.393-14.246-32.631-14.246Q-33.002-14.246-33.340-14.383Q-33.678-14.519-33.946-14.771Q-34.213-15.023-34.364-15.363Q-34.514-15.703-34.514-16.078M-33.760-16.386L-31.799-16.386Q-31.799-16.691-31.901-16.982Q-32.002-17.273-32.219-17.455Q-32.436-17.636-32.752-17.636Q-33.053-17.636-33.284-17.449Q-33.514-17.261-33.637-16.970Q-33.760-16.679-33.760-16.386\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M183.62-34.24a2.5 2.5 0 1 0-5 0 2.5 2.5 0 0 0 5 0m-2.5 0\"\u002F>\u003Cg transform=\"translate(227.206 -5.138)\">\u003Cpath d=\"M-60.491-16.078Q-60.491-16.558-60.258-16.974Q-60.026-17.390-59.616-17.640Q-59.206-17.890-58.729-17.890Q-57.999-17.890-57.600-17.449Q-57.202-17.008-57.202-16.277Q-57.202-16.172-57.295-16.148L-59.745-16.148L-59.745-16.078Q-59.745-15.668-59.624-15.312Q-59.502-14.957-59.231-14.740Q-58.959-14.523-58.530-14.523Q-58.166-14.523-57.870-14.752Q-57.573-14.980-57.471-15.332Q-57.463-15.379-57.377-15.394L-57.295-15.394Q-57.202-15.367-57.202-15.285Q-57.202-15.277-57.209-15.246Q-57.272-15.019-57.411-14.836Q-57.549-14.652-57.741-14.519Q-57.932-14.386-58.151-14.316Q-58.370-14.246-58.608-14.246Q-58.979-14.246-59.317-14.383Q-59.655-14.519-59.922-14.771Q-60.190-15.023-60.340-15.363Q-60.491-15.703-60.491-16.078M-59.737-16.386L-57.776-16.386Q-57.776-16.691-57.877-16.982Q-57.979-17.273-58.196-17.455Q-58.413-17.636-58.729-17.636Q-59.030-17.636-59.260-17.449Q-59.491-17.261-59.614-16.970Q-59.737-16.679-59.737-16.386M-54.799-14.324L-56.631-14.324L-56.631-14.621Q-56.358-14.621-56.190-14.668Q-56.022-14.715-56.022-14.883L-56.022-19.043Q-56.022-19.258-56.084-19.353Q-56.147-19.449-56.266-19.470Q-56.385-19.492-56.631-19.492L-56.631-19.789L-55.409-19.875L-55.409-14.883Q-55.409-14.715-55.241-14.668Q-55.073-14.621-54.799-14.621L-54.799-14.324M-54.354-16.078Q-54.354-16.558-54.122-16.974Q-53.889-17.390-53.479-17.640Q-53.069-17.890-52.592-17.890Q-51.862-17.890-51.463-17.449Q-51.065-17.008-51.065-16.277Q-51.065-16.172-51.159-16.148L-53.608-16.148L-53.608-16.078Q-53.608-15.668-53.487-15.312Q-53.366-14.957-53.094-14.740Q-52.823-14.523-52.393-14.523Q-52.030-14.523-51.733-14.752Q-51.436-14.980-51.334-15.332Q-51.327-15.379-51.241-15.394L-51.159-15.394Q-51.065-15.367-51.065-15.285Q-51.065-15.277-51.073-15.246Q-51.135-15.019-51.274-14.836Q-51.413-14.652-51.604-14.519Q-51.795-14.386-52.014-14.316Q-52.233-14.246-52.471-14.246Q-52.842-14.246-53.180-14.383Q-53.518-14.519-53.786-14.771Q-54.053-15.023-54.204-15.363Q-54.354-15.703-54.354-16.078M-53.600-16.386L-51.639-16.386Q-51.639-16.691-51.741-16.982Q-51.842-17.273-52.059-17.455Q-52.276-17.636-52.592-17.636Q-52.893-17.636-53.124-17.449Q-53.354-17.261-53.477-16.970Q-53.600-16.679-53.600-16.386M-50.534-16.051Q-50.534-16.547-50.284-16.972Q-50.034-17.398-49.614-17.644Q-49.194-17.890-48.694-17.890Q-48.155-17.890-47.764-17.765Q-47.374-17.640-47.374-17.226Q-47.374-17.121-47.424-17.029Q-47.475-16.937-47.567-16.886Q-47.659-16.836-47.768-16.836Q-47.874-16.836-47.965-16.886Q-48.057-16.937-48.108-17.029Q-48.159-17.121-48.159-17.226Q-48.159-17.449-47.991-17.554Q-48.213-17.613-48.686-17.613Q-48.983-17.613-49.198-17.474Q-49.413-17.336-49.543-17.105Q-49.674-16.875-49.733-16.605Q-49.791-16.336-49.791-16.051Q-49.791-15.656-49.659-15.306Q-49.526-14.957-49.254-14.740Q-48.983-14.523-48.584-14.523Q-48.209-14.523-47.934-14.740Q-47.659-14.957-47.557-15.316Q-47.541-15.379-47.479-15.379L-47.374-15.379Q-47.338-15.379-47.313-15.351Q-47.288-15.324-47.288-15.285L-47.288-15.261Q-47.420-14.781-47.805-14.513Q-48.190-14.246-48.694-14.246Q-49.057-14.246-49.391-14.383Q-49.725-14.519-49.985-14.769Q-50.245-15.019-50.389-15.355Q-50.534-15.691-50.534-16.051M-46.174-15.285L-46.174-17.476L-46.877-17.476L-46.877-17.730Q-46.522-17.730-46.280-17.963Q-46.038-18.195-45.926-18.543Q-45.815-18.890-45.815-19.246L-45.534-19.246L-45.534-17.773L-44.358-17.773L-44.358-17.476L-45.534-17.476L-45.534-15.301Q-45.534-14.980-45.415-14.752Q-45.295-14.523-45.014-14.523Q-44.834-14.523-44.717-14.646Q-44.600-14.769-44.547-14.949Q-44.495-15.129-44.495-15.301L-44.495-15.773L-44.213-15.773L-44.213-15.285Q-44.213-15.031-44.319-14.791Q-44.424-14.551-44.622-14.398Q-44.819-14.246-45.077-14.246Q-45.393-14.246-45.645-14.369Q-45.897-14.492-46.036-14.726Q-46.174-14.961-46.174-15.285M-41.487-14.324L-43.467-14.324L-43.467-14.621Q-43.198-14.621-43.030-14.666Q-42.862-14.711-42.862-14.883L-42.862-17.019Q-42.862-17.234-42.924-17.330Q-42.987-17.426-43.104-17.447Q-43.221-17.469-43.467-17.469L-43.467-17.765L-42.299-17.851L-42.299-17.066Q-42.221-17.277-42.069-17.463Q-41.916-17.648-41.717-17.750Q-41.518-17.851-41.291-17.851Q-41.045-17.851-40.854-17.707Q-40.663-17.562-40.663-17.332Q-40.663-17.176-40.768-17.066Q-40.874-16.957-41.030-16.957Q-41.186-16.957-41.295-17.066Q-41.405-17.176-41.405-17.332Q-41.405-17.492-41.299-17.597Q-41.624-17.597-41.838-17.369Q-42.053-17.140-42.149-16.801Q-42.245-16.461-42.245-16.156L-42.245-14.883Q-42.245-14.715-42.018-14.668Q-41.791-14.621-41.487-14.621L-41.487-14.324M-40.182-16.019Q-40.182-16.523-39.926-16.955Q-39.670-17.386-39.235-17.638Q-38.799-17.890-38.299-17.890Q-37.913-17.890-37.571-17.746Q-37.229-17.601-36.967-17.340Q-36.706-17.078-36.563-16.742Q-36.420-16.406-36.420-16.019Q-36.420-15.527-36.684-15.117Q-36.948-14.707-37.377-14.476Q-37.807-14.246-38.299-14.246Q-38.791-14.246-39.225-14.478Q-39.659-14.711-39.920-15.119Q-40.182-15.527-40.182-16.019M-38.299-14.523Q-37.842-14.523-37.590-14.746Q-37.338-14.969-37.250-15.320Q-37.163-15.672-37.163-16.117Q-37.163-16.547-37.256-16.885Q-37.350-17.222-37.604-17.429Q-37.858-17.636-38.299-17.636Q-38.948-17.636-39.192-17.220Q-39.436-16.804-39.436-16.117Q-39.436-15.672-39.348-15.320Q-39.260-14.969-39.008-14.746Q-38.756-14.523-38.299-14.523M-34.006-14.324L-35.862-14.324L-35.862-14.621Q-35.588-14.621-35.420-14.668Q-35.252-14.715-35.252-14.883L-35.252-17.019Q-35.252-17.234-35.315-17.330Q-35.377-17.426-35.497-17.447Q-35.616-17.469-35.862-17.469L-35.862-17.765L-34.670-17.851L-34.670-17.117Q-34.557-17.332-34.364-17.500Q-34.170-17.668-33.932-17.760Q-33.694-17.851-33.440-17.851Q-32.272-17.851-32.272-16.773L-32.272-14.883Q-32.272-14.715-32.102-14.668Q-31.932-14.621-31.663-14.621L-31.663-14.324L-33.518-14.324L-33.518-14.621Q-33.245-14.621-33.077-14.668Q-32.909-14.715-32.909-14.883L-32.909-16.758Q-32.909-17.140-33.030-17.369Q-33.151-17.597-33.502-17.597Q-33.815-17.597-34.069-17.435Q-34.323-17.273-34.469-17.004Q-34.616-16.734-34.616-16.437L-34.616-14.883Q-34.616-14.715-34.446-14.668Q-34.276-14.621-34.006-14.621\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m161.203-51.313 17.883 15.133\"\u002F>\u003Cpath fill=\"none\" d=\"M179.455-39.959c-.854 1.732-.63 3.08-.063 4.037-1.037-.4-2.404-.398-3.971.73\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.79996\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m182.543-32.818 20.694-15.176\"\u002F>\u003Cpath fill=\"none\" d=\"M199.649-49.235c1.485 1.234 2.848 1.332 3.91 1.004-.63.915-.948 2.245-.217 4.032\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799968\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(223.64 18.857)\">\u003Cpath d=\"M-60.448-14.332L-60.448-15.554Q-60.448-15.582-60.416-15.613Q-60.385-15.644-60.362-15.644L-60.256-15.644Q-60.186-15.644-60.170-15.582Q-60.108-15.261-59.969-15.021Q-59.831-14.781-59.598-14.640Q-59.366-14.500-59.057-14.500Q-58.819-14.500-58.610-14.560Q-58.401-14.621-58.264-14.769Q-58.127-14.918-58.127-15.164Q-58.127-15.418-58.338-15.584Q-58.549-15.750-58.819-15.804L-59.440-15.918Q-59.846-15.996-60.147-16.252Q-60.448-16.508-60.448-16.883Q-60.448-17.250-60.247-17.472Q-60.045-17.695-59.721-17.793Q-59.397-17.890-59.057-17.890Q-58.592-17.890-58.295-17.683L-58.073-17.867Q-58.049-17.890-58.018-17.890L-57.967-17.890Q-57.936-17.890-57.909-17.863Q-57.881-17.836-57.881-17.804L-57.881-16.820Q-57.881-16.789-57.907-16.760Q-57.932-16.730-57.967-16.730L-58.073-16.730Q-58.108-16.730-58.135-16.758Q-58.163-16.785-58.163-16.820Q-58.163-17.219-58.415-17.439Q-58.666-17.660-59.065-17.660Q-59.420-17.660-59.704-17.537Q-59.987-17.414-59.987-17.109Q-59.987-16.890-59.786-16.758Q-59.584-16.625-59.338-16.582L-58.713-16.469Q-58.284-16.379-57.975-16.082Q-57.666-15.785-57.666-15.371Q-57.666-14.801-58.065-14.523Q-58.463-14.246-59.057-14.246Q-59.608-14.246-59.959-14.582L-60.256-14.269Q-60.280-14.246-60.315-14.246L-60.362-14.246Q-60.385-14.246-60.416-14.277Q-60.448-14.308-60.448-14.332M-57.096-16.051Q-57.096-16.547-56.846-16.972Q-56.596-17.398-56.176-17.644Q-55.756-17.890-55.256-17.890Q-54.717-17.890-54.327-17.765Q-53.936-17.640-53.936-17.226Q-53.936-17.121-53.987-17.029Q-54.038-16.937-54.129-16.886Q-54.221-16.836-54.331-16.836Q-54.436-16.836-54.528-16.886Q-54.620-16.937-54.670-17.029Q-54.721-17.121-54.721-17.226Q-54.721-17.449-54.553-17.554Q-54.776-17.613-55.249-17.613Q-55.545-17.613-55.760-17.474Q-55.975-17.336-56.106-17.105Q-56.237-16.875-56.295-16.605Q-56.354-16.336-56.354-16.051Q-56.354-15.656-56.221-15.306Q-56.088-14.957-55.817-14.740Q-55.545-14.523-55.147-14.523Q-54.772-14.523-54.497-14.740Q-54.221-14.957-54.120-15.316Q-54.104-15.379-54.041-15.379L-53.936-15.379Q-53.901-15.379-53.875-15.351Q-53.850-15.324-53.850-15.285L-53.850-15.261Q-53.983-14.781-54.368-14.513Q-54.752-14.246-55.256-14.246Q-55.620-14.246-55.954-14.383Q-56.288-14.519-56.547-14.769Q-56.807-15.019-56.952-15.355Q-57.096-15.691-57.096-16.051M-53.264-15.156Q-53.264-15.640-52.862-15.935Q-52.459-16.230-51.909-16.349Q-51.358-16.469-50.866-16.469L-50.866-16.758Q-50.866-16.984-50.981-17.191Q-51.096-17.398-51.293-17.517Q-51.491-17.636-51.721-17.636Q-52.147-17.636-52.432-17.531Q-52.362-17.504-52.315-17.449Q-52.268-17.394-52.243-17.324Q-52.217-17.254-52.217-17.179Q-52.217-17.074-52.268-16.982Q-52.319-16.890-52.411-16.840Q-52.502-16.789-52.608-16.789Q-52.713-16.789-52.805-16.840Q-52.897-16.890-52.948-16.982Q-52.999-17.074-52.999-17.179Q-52.999-17.597-52.610-17.744Q-52.221-17.890-51.721-17.890Q-51.389-17.890-51.036-17.760Q-50.682-17.629-50.454-17.375Q-50.225-17.121-50.225-16.773L-50.225-14.972Q-50.225-14.840-50.153-14.730Q-50.081-14.621-49.952-14.621Q-49.827-14.621-49.758-14.726Q-49.690-14.832-49.690-14.972L-49.690-15.484L-49.409-15.484L-49.409-14.972Q-49.409-14.769-49.526-14.611Q-49.643-14.453-49.825-14.369Q-50.006-14.285-50.209-14.285Q-50.440-14.285-50.592-14.457Q-50.745-14.629-50.776-14.859Q-50.936-14.578-51.245-14.412Q-51.553-14.246-51.905-14.246Q-52.416-14.246-52.840-14.469Q-53.264-14.691-53.264-15.156M-52.577-15.156Q-52.577-14.871-52.350-14.685Q-52.124-14.500-51.831-14.500Q-51.584-14.500-51.360-14.617Q-51.135-14.734-51-14.937Q-50.866-15.140-50.866-15.394L-50.866-16.226Q-51.131-16.226-51.416-16.172Q-51.702-16.117-51.973-15.988Q-52.245-15.859-52.411-15.652Q-52.577-15.445-52.577-15.156M-48.491-15.285L-48.491-17.476L-49.194-17.476L-49.194-17.730Q-48.838-17.730-48.596-17.963Q-48.354-18.195-48.243-18.543Q-48.131-18.890-48.131-19.246L-47.850-19.246L-47.850-17.773L-46.674-17.773L-46.674-17.476L-47.850-17.476L-47.850-15.301Q-47.850-14.980-47.731-14.752Q-47.612-14.523-47.331-14.523Q-47.151-14.523-47.034-14.646Q-46.916-14.769-46.864-14.949Q-46.811-15.129-46.811-15.301L-46.811-15.773L-46.530-15.773L-46.530-15.285Q-46.530-15.031-46.635-14.791Q-46.741-14.551-46.938-14.398Q-47.135-14.246-47.393-14.246Q-47.709-14.246-47.961-14.369Q-48.213-14.492-48.352-14.726Q-48.491-14.961-48.491-15.285M-45.186-15.285L-45.186-17.476L-45.889-17.476L-45.889-17.730Q-45.534-17.730-45.291-17.963Q-45.049-18.195-44.938-18.543Q-44.827-18.890-44.827-19.246L-44.545-19.246L-44.545-17.773L-43.370-17.773L-43.370-17.476L-44.545-17.476L-44.545-15.301Q-44.545-14.980-44.426-14.752Q-44.307-14.523-44.026-14.523Q-43.846-14.523-43.729-14.646Q-43.612-14.769-43.559-14.949Q-43.506-15.129-43.506-15.301L-43.506-15.773L-43.225-15.773L-43.225-15.285Q-43.225-15.031-43.331-14.791Q-43.436-14.551-43.633-14.398Q-43.831-14.246-44.088-14.246Q-44.405-14.246-44.657-14.369Q-44.909-14.492-45.047-14.726Q-45.186-14.961-45.186-15.285M-42.506-16.078Q-42.506-16.558-42.274-16.974Q-42.041-17.390-41.631-17.640Q-41.221-17.890-40.745-17.890Q-40.014-17.890-39.616-17.449Q-39.217-17.008-39.217-16.277Q-39.217-16.172-39.311-16.148L-41.760-16.148L-41.760-16.078Q-41.760-15.668-41.639-15.312Q-41.518-14.957-41.247-14.740Q-40.975-14.523-40.545-14.523Q-40.182-14.523-39.885-14.752Q-39.588-14.980-39.487-15.332Q-39.479-15.379-39.393-15.394L-39.311-15.394Q-39.217-15.367-39.217-15.285Q-39.217-15.277-39.225-15.246Q-39.288-15.019-39.426-14.836Q-39.565-14.652-39.756-14.519Q-39.948-14.386-40.166-14.316Q-40.385-14.246-40.624-14.246Q-40.995-14.246-41.333-14.383Q-41.670-14.519-41.938-14.771Q-42.206-15.023-42.356-15.363Q-42.506-15.703-42.506-16.078M-41.752-16.386L-39.791-16.386Q-39.791-16.691-39.893-16.982Q-39.995-17.273-40.211-17.455Q-40.428-17.636-40.745-17.636Q-41.045-17.636-41.276-17.449Q-41.506-17.261-41.629-16.970Q-41.752-16.679-41.752-16.386M-36.721-14.324L-38.702-14.324L-38.702-14.621Q-38.432-14.621-38.264-14.666Q-38.096-14.711-38.096-14.883L-38.096-17.019Q-38.096-17.234-38.159-17.330Q-38.221-17.426-38.338-17.447Q-38.456-17.469-38.702-17.469L-38.702-17.765L-37.534-17.851L-37.534-17.066Q-37.456-17.277-37.303-17.463Q-37.151-17.648-36.952-17.750Q-36.752-17.851-36.526-17.851Q-36.280-17.851-36.088-17.707Q-35.897-17.562-35.897-17.332Q-35.897-17.176-36.002-17.066Q-36.108-16.957-36.264-16.957Q-36.420-16.957-36.530-17.066Q-36.639-17.176-36.639-17.332Q-36.639-17.492-36.534-17.597Q-36.858-17.597-37.073-17.369Q-37.288-17.140-37.383-16.801Q-37.479-16.461-37.479-16.156L-37.479-14.883Q-37.479-14.715-37.252-14.668Q-37.026-14.621-36.721-14.621L-36.721-14.324M-33.557-14.324L-35.334-14.324L-35.334-14.621Q-35.061-14.621-34.893-14.668Q-34.725-14.715-34.725-14.883L-34.725-17.019Q-34.725-17.234-34.782-17.330Q-34.838-17.426-34.952-17.447Q-35.065-17.469-35.311-17.469L-35.311-17.765L-34.112-17.851L-34.112-14.883Q-34.112-14.715-33.965-14.668Q-33.819-14.621-33.557-14.621L-33.557-14.324M-34.999-19.246Q-34.999-19.437-34.864-19.568Q-34.729-19.699-34.534-19.699Q-34.413-19.699-34.309-19.636Q-34.206-19.574-34.143-19.470Q-34.081-19.367-34.081-19.246Q-34.081-19.051-34.211-18.916Q-34.342-18.781-34.534-18.781Q-34.733-18.781-34.866-18.914Q-34.999-19.047-34.999-19.246M-31.127-14.324L-32.983-14.324L-32.983-14.621Q-32.709-14.621-32.541-14.668Q-32.374-14.715-32.374-14.883L-32.374-17.019Q-32.374-17.234-32.436-17.330Q-32.499-17.426-32.618-17.447Q-32.737-17.469-32.983-17.469L-32.983-17.765L-31.791-17.851L-31.791-17.117Q-31.678-17.332-31.485-17.500Q-31.291-17.668-31.053-17.760Q-30.815-17.851-30.561-17.851Q-29.393-17.851-29.393-16.773L-29.393-14.883Q-29.393-14.715-29.223-14.668Q-29.053-14.621-28.784-14.621L-28.784-14.324L-30.639-14.324L-30.639-14.621Q-30.366-14.621-30.198-14.668Q-30.030-14.715-30.030-14.883L-30.030-16.758Q-30.030-17.140-30.151-17.369Q-30.272-17.597-30.624-17.597Q-30.936-17.597-31.190-17.435Q-31.444-17.273-31.590-17.004Q-31.737-16.734-31.737-16.437L-31.737-14.883Q-31.737-14.715-31.567-14.668Q-31.397-14.621-31.127-14.621L-31.127-14.324M-28.338-13.715Q-28.338-13.996-28.127-14.207Q-27.916-14.418-27.631-14.508Q-27.788-14.633-27.866-14.822Q-27.944-15.011-27.944-15.211Q-27.944-15.566-27.713-15.859Q-28.081-16.199-28.081-16.668Q-28.081-17.019-27.877-17.289Q-27.674-17.558-27.354-17.705Q-27.034-17.851-26.690-17.851Q-26.170-17.851-25.799-17.570Q-25.436-17.941-24.889-17.941Q-24.709-17.941-24.583-17.814Q-24.456-17.687-24.456-17.508Q-24.456-17.402-24.534-17.324Q-24.612-17.246-24.721-17.246Q-24.831-17.246-24.907-17.322Q-24.983-17.398-24.983-17.508Q-24.983-17.609-24.944-17.660Q-24.936-17.668-24.932-17.674Q-24.928-17.679-24.928-17.683Q-25.303-17.683-25.624-17.429Q-25.303-17.090-25.303-16.668Q-25.303-16.398-25.420-16.181Q-25.538-15.965-25.743-15.806Q-25.948-15.648-26.190-15.566Q-26.432-15.484-26.690-15.484Q-26.909-15.484-27.122-15.543Q-27.334-15.601-27.530-15.722Q-27.624-15.582-27.624-15.402Q-27.624-15.195-27.487-15.043Q-27.350-14.890-27.143-14.890L-26.448-14.890Q-25.959-14.890-25.547-14.806Q-25.135-14.722-24.856-14.465Q-24.577-14.207-24.577-13.715Q-24.577-13.351-24.897-13.119Q-25.217-12.886-25.659-12.785Q-26.100-12.683-26.456-12.683Q-26.811-12.683-27.254-12.785Q-27.698-12.886-28.018-13.119Q-28.338-13.351-28.338-13.715M-27.834-13.715Q-27.834-13.519-27.690-13.371Q-27.545-13.222-27.333-13.133Q-27.120-13.043-26.879-12.996Q-26.639-12.949-26.456-12.949Q-26.213-12.949-25.883-13.027Q-25.553-13.105-25.317-13.279Q-25.081-13.453-25.081-13.715Q-25.081-14.121-25.491-14.230Q-25.901-14.340-26.463-14.340L-27.143-14.340Q-27.413-14.340-27.624-14.162Q-27.834-13.984-27.834-13.715M-26.690-15.750Q-25.967-15.750-25.967-16.668Q-25.967-17.590-26.690-17.590Q-27.416-17.590-27.416-16.668Q-27.416-15.750-26.690-15.750\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The four opacity processes as electron transitions: a bound-bound jump between levels, a bound-free ejection into the continuum, a free-free absorption by an electron passing an ion, and photon scattering off a free electron.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:456.567px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 342.425 157.748\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-40.992 72.59h238.603\"\u002F>\u003Cpath fill=\"none\" d=\"M195.73 70.19c.38 1.44 1.228 2.12 2.08 2.4-.852.28-1.7.96-2.08 2.4\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(242.536 2)\">\u003Cpath d=\"M-38.840 72.590L-40.672 72.590L-40.672 72.293Q-40.398 72.293-40.230 72.246Q-40.062 72.199-40.062 72.031L-40.062 67.871Q-40.062 67.656-40.125 67.561Q-40.187 67.465-40.306 67.444Q-40.426 67.422-40.672 67.422L-40.672 67.125L-39.449 67.039L-39.449 72.031Q-39.449 72.199-39.281 72.246Q-39.113 72.293-38.840 72.293L-38.840 72.590M-38.394 70.895Q-38.394 70.391-38.138 69.959Q-37.883 69.528-37.447 69.276Q-37.012 69.024-36.512 69.024Q-36.125 69.024-35.783 69.168Q-35.441 69.313-35.179 69.574Q-34.918 69.836-34.775 70.172Q-34.633 70.508-34.633 70.895Q-34.633 71.387-34.896 71.797Q-35.160 72.207-35.590 72.438Q-36.019 72.668-36.512 72.668Q-37.004 72.668-37.437 72.436Q-37.871 72.203-38.133 71.795Q-38.394 71.387-38.394 70.895M-36.512 72.391Q-36.054 72.391-35.803 72.168Q-35.551 71.945-35.463 71.594Q-35.375 71.242-35.375 70.797Q-35.375 70.367-35.469 70.029Q-35.562 69.692-35.816 69.485Q-36.070 69.278-36.512 69.278Q-37.160 69.278-37.404 69.694Q-37.648 70.110-37.648 70.797Q-37.648 71.242-37.560 71.594Q-37.472 71.945-37.221 72.168Q-36.969 72.391-36.512 72.391M-34.148 73.199Q-34.148 72.918-33.937 72.707Q-33.726 72.496-33.441 72.406Q-33.597 72.281-33.676 72.092Q-33.754 71.903-33.754 71.703Q-33.754 71.348-33.523 71.055Q-33.890 70.715-33.890 70.246Q-33.890 69.895-33.687 69.625Q-33.484 69.356-33.164 69.209Q-32.844 69.063-32.500 69.063Q-31.980 69.063-31.609 69.344Q-31.246 68.973-30.699 68.973Q-30.519 68.973-30.392 69.100Q-30.265 69.227-30.265 69.406Q-30.265 69.512-30.344 69.590Q-30.422 69.668-30.531 69.668Q-30.640 69.668-30.717 69.592Q-30.793 69.516-30.793 69.406Q-30.793 69.305-30.754 69.254Q-30.746 69.246-30.742 69.240Q-30.738 69.235-30.738 69.231Q-31.113 69.231-31.433 69.485Q-31.113 69.824-31.113 70.246Q-31.113 70.516-31.230 70.733Q-31.347 70.949-31.553 71.108Q-31.758 71.266-32 71.348Q-32.242 71.430-32.500 71.430Q-32.719 71.430-32.931 71.371Q-33.144 71.313-33.340 71.192Q-33.433 71.332-33.433 71.512Q-33.433 71.719-33.297 71.871Q-33.160 72.024-32.953 72.024L-32.258 72.024Q-31.769 72.024-31.357 72.108Q-30.945 72.192-30.666 72.449Q-30.387 72.707-30.387 73.199Q-30.387 73.563-30.707 73.795Q-31.027 74.028-31.469 74.129Q-31.910 74.231-32.265 74.231Q-32.621 74.231-33.064 74.129Q-33.508 74.028-33.828 73.795Q-34.148 73.563-34.148 73.199M-33.644 73.199Q-33.644 73.395-33.500 73.543Q-33.355 73.692-33.142 73.781Q-32.929 73.871-32.689 73.918Q-32.449 73.965-32.265 73.965Q-32.023 73.965-31.693 73.887Q-31.363 73.809-31.127 73.635Q-30.890 73.461-30.890 73.199Q-30.890 72.793-31.301 72.684Q-31.711 72.574-32.273 72.574L-32.953 72.574Q-33.222 72.574-33.433 72.752Q-33.644 72.930-33.644 73.199M-32.500 71.164Q-31.777 71.164-31.777 70.246Q-31.777 69.324-32.500 69.324Q-33.226 69.324-33.226 70.246Q-33.226 71.164-32.500 71.164\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(242.536 2)\">\u003Cpath d=\"M-26.434 71.629L-26.434 69.438L-27.137 69.438L-27.137 69.184Q-26.781 69.184-26.539 68.951Q-26.297 68.719-26.186 68.371Q-26.074 68.024-26.074 67.668L-25.793 67.668L-25.793 69.141L-24.617 69.141L-24.617 69.438L-25.793 69.438L-25.793 71.613Q-25.793 71.934-25.674 72.162Q-25.555 72.391-25.274 72.391Q-25.094 72.391-24.977 72.268Q-24.860 72.145-24.807 71.965Q-24.754 71.785-24.754 71.613L-24.754 71.141L-24.473 71.141L-24.473 71.629Q-24.473 71.883-24.578 72.123Q-24.684 72.363-24.881 72.516Q-25.078 72.668-25.336 72.668Q-25.652 72.668-25.904 72.545Q-26.156 72.422-26.295 72.188Q-26.434 71.953-26.434 71.629M-23.754 70.836Q-23.754 70.356-23.522 69.940Q-23.289 69.524-22.879 69.274Q-22.469 69.024-21.992 69.024Q-21.262 69.024-20.863 69.465Q-20.465 69.906-20.465 70.637Q-20.465 70.742-20.559 70.766L-23.008 70.766L-23.008 70.836Q-23.008 71.246-22.887 71.602Q-22.766 71.957-22.494 72.174Q-22.223 72.391-21.793 72.391Q-21.430 72.391-21.133 72.162Q-20.836 71.934-20.735 71.582Q-20.727 71.535-20.641 71.520L-20.559 71.520Q-20.465 71.547-20.465 71.629Q-20.465 71.637-20.473 71.668Q-20.535 71.895-20.674 72.078Q-20.813 72.262-21.004 72.395Q-21.195 72.528-21.414 72.598Q-21.633 72.668-21.871 72.668Q-22.242 72.668-22.580 72.531Q-22.918 72.395-23.186 72.143Q-23.453 71.891-23.604 71.551Q-23.754 71.211-23.754 70.836M-23 70.528L-21.039 70.528Q-21.039 70.223-21.141 69.932Q-21.242 69.641-21.459 69.459Q-21.676 69.278-21.992 69.278Q-22.293 69.278-22.524 69.465Q-22.754 69.653-22.877 69.944Q-23 70.235-23 70.528M-18.047 72.590L-19.902 72.590L-19.902 72.293Q-19.629 72.293-19.461 72.246Q-19.293 72.199-19.293 72.031L-19.293 69.895Q-19.293 69.680-19.356 69.584Q-19.418 69.488-19.537 69.467Q-19.656 69.445-19.902 69.445L-19.902 69.149L-18.711 69.063L-18.711 69.797Q-18.598 69.582-18.404 69.414Q-18.211 69.246-17.973 69.154Q-17.735 69.063-17.481 69.063Q-16.520 69.063-16.344 69.774Q-16.160 69.445-15.832 69.254Q-15.504 69.063-15.125 69.063Q-13.949 69.063-13.949 70.141L-13.949 72.031Q-13.949 72.199-13.781 72.246Q-13.613 72.293-13.344 72.293L-13.344 72.590L-15.199 72.590L-15.199 72.293Q-14.926 72.293-14.758 72.248Q-14.590 72.203-14.590 72.031L-14.590 70.156Q-14.590 69.770-14.715 69.543Q-14.840 69.317-15.192 69.317Q-15.496 69.317-15.752 69.479Q-16.008 69.641-16.156 69.910Q-16.305 70.180-16.305 70.477L-16.305 72.031Q-16.305 72.199-16.135 72.246Q-15.965 72.293-15.695 72.293L-15.695 72.590L-17.551 72.590L-17.551 72.293Q-17.277 72.293-17.110 72.246Q-16.942 72.199-16.942 72.031L-16.942 70.156Q-16.942 69.770-17.067 69.543Q-17.192 69.317-17.543 69.317Q-17.848 69.317-18.104 69.479Q-18.360 69.641-18.508 69.910Q-18.656 70.180-18.656 70.477L-18.656 72.031Q-18.656 72.199-18.486 72.246Q-18.317 72.293-18.047 72.293L-18.047 72.590M-11.016 74.141L-12.871 74.141L-12.871 73.848Q-12.602 73.848-12.434 73.803Q-12.266 73.758-12.266 73.582L-12.266 69.758Q-12.266 69.551-12.422 69.498Q-12.578 69.445-12.871 69.445L-12.871 69.149L-11.649 69.063L-11.649 69.528Q-11.418 69.305-11.104 69.184Q-10.789 69.063-10.449 69.063Q-9.977 69.063-9.572 69.309Q-9.168 69.555-8.936 69.971Q-8.703 70.387-8.703 70.863Q-8.703 71.238-8.852 71.567Q-9 71.895-9.270 72.147Q-9.539 72.399-9.883 72.533Q-10.227 72.668-10.586 72.668Q-10.875 72.668-11.147 72.547Q-11.418 72.426-11.625 72.215L-11.625 73.582Q-11.625 73.758-11.457 73.803Q-11.289 73.848-11.016 73.848L-11.016 74.141M-11.625 69.926L-11.625 71.766Q-11.473 72.055-11.211 72.235Q-10.949 72.414-10.641 72.414Q-10.356 72.414-10.133 72.276Q-9.910 72.137-9.758 71.906Q-9.606 71.676-9.527 71.404Q-9.449 71.133-9.449 70.863Q-9.449 70.531-9.574 70.174Q-9.699 69.817-9.947 69.580Q-10.195 69.344-10.543 69.344Q-10.867 69.344-11.162 69.500Q-11.457 69.656-11.625 69.926\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(242.536 2)\">\u003Cpath d=\"M-7.934 70.836Q-7.934 70.356-7.701 69.940Q-7.469 69.524-7.059 69.274Q-6.649 69.024-6.172 69.024Q-5.442 69.024-5.043 69.465Q-4.645 69.906-4.645 70.637Q-4.645 70.742-4.738 70.766L-7.188 70.766L-7.188 70.836Q-7.188 71.246-7.067 71.602Q-6.945 71.957-6.674 72.174Q-6.402 72.391-5.973 72.391Q-5.610 72.391-5.313 72.162Q-5.016 71.934-4.914 71.582Q-4.906 71.535-4.820 71.520L-4.738 71.520Q-4.645 71.547-4.645 71.629Q-4.645 71.637-4.652 71.668Q-4.715 71.895-4.854 72.078Q-4.992 72.262-5.184 72.395Q-5.375 72.528-5.594 72.598Q-5.813 72.668-6.051 72.668Q-6.422 72.668-6.760 72.531Q-7.098 72.395-7.365 72.143Q-7.633 71.891-7.783 71.551Q-7.934 71.211-7.934 70.836M-7.180 70.528L-5.219 70.528Q-5.219 70.223-5.320 69.932Q-5.422 69.641-5.639 69.459Q-5.856 69.278-6.172 69.278Q-6.473 69.278-6.703 69.465Q-6.934 69.653-7.057 69.944Q-7.180 70.235-7.180 70.528M-2.149 72.590L-4.129 72.590L-4.129 72.293Q-3.860 72.293-3.692 72.248Q-3.524 72.203-3.524 72.031L-3.524 69.895Q-3.524 69.680-3.586 69.584Q-3.649 69.488-3.766 69.467Q-3.883 69.445-4.129 69.445L-4.129 69.149L-2.961 69.063L-2.961 69.848Q-2.883 69.637-2.731 69.451Q-2.578 69.266-2.379 69.164Q-2.180 69.063-1.953 69.063Q-1.707 69.063-1.516 69.207Q-1.324 69.352-1.324 69.582Q-1.324 69.738-1.430 69.848Q-1.535 69.957-1.692 69.957Q-1.848 69.957-1.957 69.848Q-2.067 69.738-2.067 69.582Q-2.067 69.422-1.961 69.317Q-2.285 69.317-2.500 69.545Q-2.715 69.774-2.811 70.113Q-2.906 70.453-2.906 70.758L-2.906 72.031Q-2.906 72.199-2.680 72.246Q-2.453 72.293-2.149 72.293L-2.149 72.590M-0.746 71.758Q-0.746 71.274-0.344 70.979Q0.058 70.684 0.609 70.565Q1.160 70.445 1.652 70.445L1.652 70.156Q1.652 69.930 1.537 69.723Q1.422 69.516 1.224 69.397Q1.027 69.278 0.797 69.278Q0.371 69.278 0.086 69.383Q0.156 69.410 0.203 69.465Q0.250 69.520 0.275 69.590Q0.301 69.660 0.301 69.735Q0.301 69.840 0.250 69.932Q0.199 70.024 0.107 70.074Q0.015 70.125-0.090 70.125Q-0.195 70.125-0.287 70.074Q-0.379 70.024-0.430 69.932Q-0.481 69.840-0.481 69.735Q-0.481 69.317-0.092 69.170Q0.297 69.024 0.797 69.024Q1.129 69.024 1.482 69.154Q1.836 69.285 2.064 69.539Q2.293 69.793 2.293 70.141L2.293 71.942Q2.293 72.074 2.365 72.184Q2.437 72.293 2.566 72.293Q2.691 72.293 2.760 72.188Q2.828 72.082 2.828 71.942L2.828 71.430L3.109 71.430L3.109 71.942Q3.109 72.145 2.992 72.303Q2.875 72.461 2.693 72.545Q2.512 72.629 2.308 72.629Q2.078 72.629 1.926 72.457Q1.773 72.285 1.742 72.055Q1.582 72.336 1.273 72.502Q0.965 72.668 0.613 72.668Q0.101 72.668-0.322 72.445Q-0.746 72.223-0.746 71.758M-0.059 71.758Q-0.059 72.043 0.168 72.229Q0.394 72.414 0.687 72.414Q0.933 72.414 1.158 72.297Q1.383 72.180 1.517 71.977Q1.652 71.774 1.652 71.520L1.652 70.688Q1.387 70.688 1.101 70.742Q0.816 70.797 0.545 70.926Q0.273 71.055 0.107 71.262Q-0.059 71.469-0.059 71.758M4.027 71.629L4.027 69.438L3.324 69.438L3.324 69.184Q3.680 69.184 3.922 68.951Q4.164 68.719 4.275 68.371Q4.387 68.024 4.387 67.668L4.668 67.668L4.668 69.141L5.844 69.141L5.844 69.438L4.668 69.438L4.668 71.613Q4.668 71.934 4.787 72.162Q4.906 72.391 5.187 72.391Q5.367 72.391 5.484 72.268Q5.601 72.145 5.654 71.965Q5.707 71.785 5.707 71.613L5.707 71.141L5.988 71.141L5.988 71.629Q5.988 71.883 5.883 72.123Q5.777 72.363 5.580 72.516Q5.383 72.668 5.125 72.668Q4.808 72.668 4.557 72.545Q4.305 72.422 4.166 72.188Q4.027 71.953 4.027 71.629M7.390 71.637L7.390 69.895Q7.390 69.680 7.328 69.584Q7.265 69.488 7.146 69.467Q7.027 69.445 6.781 69.445L6.781 69.149L8.027 69.063L8.027 71.613L8.027 71.637Q8.027 71.949 8.082 72.111Q8.137 72.274 8.287 72.344Q8.437 72.414 8.758 72.414Q9.187 72.414 9.461 72.076Q9.734 71.738 9.734 71.293L9.734 69.895Q9.734 69.680 9.672 69.584Q9.609 69.488 9.490 69.467Q9.371 69.445 9.125 69.445L9.125 69.149L10.371 69.063L10.371 71.848Q10.371 72.059 10.433 72.154Q10.496 72.250 10.615 72.272Q10.734 72.293 10.980 72.293L10.980 72.590L9.758 72.668L9.758 72.047Q9.590 72.336 9.308 72.502Q9.027 72.668 8.707 72.668Q7.390 72.668 7.390 71.637M13.433 72.590L11.453 72.590L11.453 72.293Q11.723 72.293 11.890 72.248Q12.058 72.203 12.058 72.031L12.058 69.895Q12.058 69.680 11.996 69.584Q11.933 69.488 11.816 69.467Q11.699 69.445 11.453 69.445L11.453 69.149L12.621 69.063L12.621 69.848Q12.699 69.637 12.851 69.451Q13.004 69.266 13.203 69.164Q13.402 69.063 13.629 69.063Q13.875 69.063 14.066 69.207Q14.258 69.352 14.258 69.582Q14.258 69.738 14.152 69.848Q14.047 69.957 13.890 69.957Q13.734 69.957 13.625 69.848Q13.515 69.738 13.515 69.582Q13.515 69.422 13.621 69.317Q13.297 69.317 13.082 69.545Q12.867 69.774 12.771 70.113Q12.676 70.453 12.676 70.758L12.676 72.031Q12.676 72.199 12.902 72.246Q13.129 72.293 13.433 72.293L13.433 72.590M14.738 70.836Q14.738 70.356 14.971 69.940Q15.203 69.524 15.613 69.274Q16.023 69.024 16.500 69.024Q17.230 69.024 17.629 69.465Q18.027 69.906 18.027 70.637Q18.027 70.742 17.933 70.766L15.484 70.766L15.484 70.836Q15.484 71.246 15.605 71.602Q15.726 71.957 15.998 72.174Q16.269 72.391 16.699 72.391Q17.062 72.391 17.359 72.162Q17.656 71.934 17.758 71.582Q17.765 71.535 17.851 71.520L17.933 71.520Q18.027 71.547 18.027 71.629Q18.027 71.637 18.019 71.668Q17.957 71.895 17.818 72.078Q17.680 72.262 17.488 72.395Q17.297 72.528 17.078 72.598Q16.859 72.668 16.621 72.668Q16.250 72.668 15.912 72.531Q15.574 72.395 15.307 72.143Q15.039 71.891 14.889 71.551Q14.738 71.211 14.738 70.836M15.492 70.528L17.453 70.528Q17.453 70.223 17.351 69.932Q17.250 69.641 17.033 69.459Q16.816 69.278 16.500 69.278Q16.199 69.278 15.969 69.465Q15.738 69.653 15.615 69.944Q15.492 70.235 15.492 70.528\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-40.992 72.59V-57.893\"\u002F>\u003Cpath fill=\"none\" d=\"M-43.392-56.013c1.44-.38 2.12-1.227 2.4-2.08.28.853.96 1.7 2.4 2.08\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-20.306 -135.971)\">\u003Cpath d=\"M-38.840 72.590L-40.672 72.590L-40.672 72.293Q-40.398 72.293-40.230 72.246Q-40.062 72.199-40.062 72.031L-40.062 67.871Q-40.062 67.656-40.125 67.561Q-40.187 67.465-40.306 67.444Q-40.426 67.422-40.672 67.422L-40.672 67.125L-39.449 67.039L-39.449 72.031Q-39.449 72.199-39.281 72.246Q-39.113 72.293-38.840 72.293L-38.840 72.590M-38.394 70.895Q-38.394 70.391-38.138 69.959Q-37.883 69.528-37.447 69.276Q-37.012 69.024-36.512 69.024Q-36.125 69.024-35.783 69.168Q-35.441 69.313-35.179 69.574Q-34.918 69.836-34.775 70.172Q-34.633 70.508-34.633 70.895Q-34.633 71.387-34.896 71.797Q-35.160 72.207-35.590 72.438Q-36.019 72.668-36.512 72.668Q-37.004 72.668-37.437 72.436Q-37.871 72.203-38.133 71.795Q-38.394 71.387-38.394 70.895M-36.512 72.391Q-36.054 72.391-35.803 72.168Q-35.551 71.945-35.463 71.594Q-35.375 71.242-35.375 70.797Q-35.375 70.367-35.469 70.029Q-35.562 69.692-35.816 69.485Q-36.070 69.278-36.512 69.278Q-37.160 69.278-37.404 69.694Q-37.648 70.110-37.648 70.797Q-37.648 71.242-37.560 71.594Q-37.472 71.945-37.221 72.168Q-36.969 72.391-36.512 72.391M-34.148 73.199Q-34.148 72.918-33.937 72.707Q-33.726 72.496-33.441 72.406Q-33.597 72.281-33.676 72.092Q-33.754 71.903-33.754 71.703Q-33.754 71.348-33.523 71.055Q-33.890 70.715-33.890 70.246Q-33.890 69.895-33.687 69.625Q-33.484 69.356-33.164 69.209Q-32.844 69.063-32.500 69.063Q-31.980 69.063-31.609 69.344Q-31.246 68.973-30.699 68.973Q-30.519 68.973-30.392 69.100Q-30.265 69.227-30.265 69.406Q-30.265 69.512-30.344 69.590Q-30.422 69.668-30.531 69.668Q-30.640 69.668-30.717 69.592Q-30.793 69.516-30.793 69.406Q-30.793 69.305-30.754 69.254Q-30.746 69.246-30.742 69.240Q-30.738 69.235-30.738 69.231Q-31.113 69.231-31.433 69.485Q-31.113 69.824-31.113 70.246Q-31.113 70.516-31.230 70.733Q-31.347 70.949-31.553 71.108Q-31.758 71.266-32 71.348Q-32.242 71.430-32.500 71.430Q-32.719 71.430-32.931 71.371Q-33.144 71.313-33.340 71.192Q-33.433 71.332-33.433 71.512Q-33.433 71.719-33.297 71.871Q-33.160 72.024-32.953 72.024L-32.258 72.024Q-31.769 72.024-31.357 72.108Q-30.945 72.192-30.666 72.449Q-30.387 72.707-30.387 73.199Q-30.387 73.563-30.707 73.795Q-31.027 74.028-31.469 74.129Q-31.910 74.231-32.265 74.231Q-32.621 74.231-33.064 74.129Q-33.508 74.028-33.828 73.795Q-34.148 73.563-34.148 73.199M-33.644 73.199Q-33.644 73.395-33.500 73.543Q-33.355 73.692-33.142 73.781Q-32.929 73.871-32.689 73.918Q-32.449 73.965-32.265 73.965Q-32.023 73.965-31.693 73.887Q-31.363 73.809-31.127 73.635Q-30.890 73.461-30.890 73.199Q-30.890 72.793-31.301 72.684Q-31.711 72.574-32.273 72.574L-32.953 72.574Q-33.222 72.574-33.433 72.752Q-33.644 72.930-33.644 73.199M-32.500 71.164Q-31.777 71.164-31.777 70.246Q-31.777 69.324-32.500 69.324Q-33.226 69.324-33.226 70.246Q-33.226 71.164-32.500 71.164\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-20.306 -135.971)\">\u003Cpath d=\"M-27.059 70.895Q-27.059 70.391-26.803 69.959Q-26.547 69.528-26.111 69.276Q-25.676 69.024-25.176 69.024Q-24.789 69.024-24.447 69.168Q-24.106 69.313-23.844 69.574Q-23.582 69.836-23.440 70.172Q-23.297 70.508-23.297 70.895Q-23.297 71.387-23.561 71.797Q-23.824 72.207-24.254 72.438Q-24.684 72.668-25.176 72.668Q-25.668 72.668-26.102 72.436Q-26.535 72.203-26.797 71.795Q-27.059 71.387-27.059 70.895M-25.176 72.391Q-24.719 72.391-24.467 72.168Q-24.215 71.945-24.127 71.594Q-24.039 71.242-24.039 70.797Q-24.039 70.367-24.133 70.029Q-24.227 69.692-24.481 69.485Q-24.735 69.278-25.176 69.278Q-25.824 69.278-26.068 69.694Q-26.313 70.110-26.313 70.797Q-26.313 71.242-26.225 71.594Q-26.137 71.945-25.885 72.168Q-25.633 72.391-25.176 72.391M-20.930 74.141L-22.785 74.141L-22.785 73.848Q-22.516 73.848-22.348 73.803Q-22.180 73.758-22.180 73.582L-22.180 69.758Q-22.180 69.551-22.336 69.498Q-22.492 69.445-22.785 69.445L-22.785 69.149L-21.563 69.063L-21.563 69.528Q-21.332 69.305-21.018 69.184Q-20.703 69.063-20.363 69.063Q-19.891 69.063-19.486 69.309Q-19.082 69.555-18.850 69.971Q-18.617 70.387-18.617 70.863Q-18.617 71.238-18.766 71.567Q-18.914 71.895-19.184 72.147Q-19.453 72.399-19.797 72.533Q-20.141 72.668-20.500 72.668Q-20.789 72.668-21.061 72.547Q-21.332 72.426-21.539 72.215L-21.539 73.582Q-21.539 73.758-21.371 73.803Q-21.203 73.848-20.930 73.848L-20.930 74.141M-21.539 69.926L-21.539 71.766Q-21.387 72.055-21.125 72.235Q-20.863 72.414-20.555 72.414Q-20.270 72.414-20.047 72.276Q-19.824 72.137-19.672 71.906Q-19.520 71.676-19.442 71.404Q-19.363 71.133-19.363 70.863Q-19.363 70.531-19.488 70.174Q-19.613 69.817-19.861 69.580Q-20.110 69.344-20.457 69.344Q-20.781 69.344-21.076 69.500Q-21.371 69.656-21.539 69.926M-17.996 71.758Q-17.996 71.274-17.594 70.979Q-17.192 70.684-16.641 70.565Q-16.090 70.445-15.598 70.445L-15.598 70.156Q-15.598 69.930-15.713 69.723Q-15.828 69.516-16.026 69.397Q-16.223 69.278-16.453 69.278Q-16.879 69.278-17.164 69.383Q-17.094 69.410-17.047 69.465Q-17 69.520-16.975 69.590Q-16.949 69.660-16.949 69.735Q-16.949 69.840-17 69.932Q-17.051 70.024-17.143 70.074Q-17.235 70.125-17.340 70.125Q-17.445 70.125-17.537 70.074Q-17.629 70.024-17.680 69.932Q-17.731 69.840-17.731 69.735Q-17.731 69.317-17.342 69.170Q-16.953 69.024-16.453 69.024Q-16.121 69.024-15.768 69.154Q-15.414 69.285-15.186 69.539Q-14.957 69.793-14.957 70.141L-14.957 71.942Q-14.957 72.074-14.885 72.184Q-14.813 72.293-14.684 72.293Q-14.559 72.293-14.490 72.188Q-14.422 72.082-14.422 71.942L-14.422 71.430L-14.141 71.430L-14.141 71.942Q-14.141 72.145-14.258 72.303Q-14.375 72.461-14.557 72.545Q-14.738 72.629-14.942 72.629Q-15.172 72.629-15.324 72.457Q-15.477 72.285-15.508 72.055Q-15.668 72.336-15.977 72.502Q-16.285 72.668-16.637 72.668Q-17.149 72.668-17.572 72.445Q-17.996 72.223-17.996 71.758M-17.309 71.758Q-17.309 72.043-17.082 72.229Q-16.856 72.414-16.563 72.414Q-16.317 72.414-16.092 72.297Q-15.867 72.180-15.733 71.977Q-15.598 71.774-15.598 71.520L-15.598 70.688Q-15.863 70.688-16.149 70.742Q-16.434 70.797-16.705 70.926Q-16.977 71.055-17.143 71.262Q-17.309 71.469-17.309 71.758M-13.805 70.863Q-13.805 70.367-13.555 69.942Q-13.305 69.516-12.885 69.270Q-12.465 69.024-11.965 69.024Q-11.426 69.024-11.035 69.149Q-10.645 69.274-10.645 69.688Q-10.645 69.793-10.695 69.885Q-10.746 69.977-10.838 70.028Q-10.930 70.078-11.039 70.078Q-11.145 70.078-11.236 70.028Q-11.328 69.977-11.379 69.885Q-11.430 69.793-11.430 69.688Q-11.430 69.465-11.262 69.360Q-11.485 69.301-11.957 69.301Q-12.254 69.301-12.469 69.440Q-12.684 69.578-12.815 69.809Q-12.945 70.039-13.004 70.309Q-13.063 70.578-13.063 70.863Q-13.063 71.258-12.930 71.608Q-12.797 71.957-12.526 72.174Q-12.254 72.391-11.856 72.391Q-11.481 72.391-11.205 72.174Q-10.930 71.957-10.828 71.598Q-10.813 71.535-10.750 71.535L-10.645 71.535Q-10.610 71.535-10.584 71.563Q-10.559 71.590-10.559 71.629L-10.559 71.653Q-10.692 72.133-11.076 72.401Q-11.461 72.668-11.965 72.668Q-12.328 72.668-12.662 72.531Q-12.996 72.395-13.256 72.145Q-13.516 71.895-13.660 71.559Q-13.805 71.223-13.805 70.863M-8.211 72.590L-9.988 72.590L-9.988 72.293Q-9.715 72.293-9.547 72.246Q-9.379 72.199-9.379 72.031L-9.379 69.895Q-9.379 69.680-9.436 69.584Q-9.492 69.488-9.606 69.467Q-9.719 69.445-9.965 69.445L-9.965 69.149L-8.766 69.063L-8.766 72.031Q-8.766 72.199-8.619 72.246Q-8.473 72.293-8.211 72.293L-8.211 72.590M-9.652 67.668Q-9.652 67.477-9.518 67.346Q-9.383 67.215-9.188 67.215Q-9.067 67.215-8.963 67.278Q-8.860 67.340-8.797 67.444Q-8.735 67.547-8.735 67.668Q-8.735 67.863-8.865 67.998Q-8.996 68.133-9.188 68.133Q-9.387 68.133-9.520 68Q-9.652 67.867-9.652 67.668M-7.086 71.629L-7.086 69.438L-7.789 69.438L-7.789 69.184Q-7.434 69.184-7.192 68.951Q-6.949 68.719-6.838 68.371Q-6.727 68.024-6.727 67.668L-6.445 67.668L-6.445 69.141L-5.270 69.141L-5.270 69.438L-6.445 69.438L-6.445 71.613Q-6.445 71.934-6.326 72.162Q-6.207 72.391-5.926 72.391Q-5.746 72.391-5.629 72.268Q-5.512 72.145-5.459 71.965Q-5.406 71.785-5.406 71.613L-5.406 71.141L-5.125 71.141L-5.125 71.629Q-5.125 71.883-5.231 72.123Q-5.336 72.363-5.533 72.516Q-5.731 72.668-5.988 72.668Q-6.305 72.668-6.557 72.545Q-6.809 72.422-6.947 72.188Q-7.086 71.953-7.086 71.629\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-20.306 -135.971)\">\u003Cpath d=\"M-4.210 73.887Q-4.096 73.965-3.921 73.965Q-3.632 73.965-3.411 73.752Q-3.190 73.539-3.065 73.238L-2.776 72.590L-4.050 69.703Q-4.132 69.528-4.276 69.483Q-4.421 69.438-4.690 69.438L-4.690 69.141L-2.971 69.141L-2.971 69.438Q-3.393 69.438-3.393 69.621Q-3.393 69.633-3.378 69.703L-2.440 71.828L-1.608 69.918Q-1.569 69.828-1.569 69.750Q-1.569 69.610-1.671 69.524Q-1.772 69.438-1.913 69.438L-1.913 69.141L-0.561 69.141L-0.561 69.438Q-0.815 69.438-1.009 69.563Q-1.202 69.688-1.307 69.918L-2.753 73.238Q-2.866 73.492-3.032 73.715Q-3.198 73.938-3.427 74.080Q-3.655 74.223-3.921 74.223Q-4.218 74.223-4.458 74.031Q-4.698 73.840-4.698 73.551Q-4.698 73.395-4.593 73.293Q-4.487 73.192-4.339 73.192Q-4.233 73.192-4.153 73.238Q-4.073 73.285-4.026 73.363Q-3.979 73.442-3.979 73.551Q-3.979 73.672-4.040 73.760Q-4.100 73.848-4.210 73.887\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-29.611 38.447H186.63\" style=\"stroke-dasharray:3.0,2.0;stroke-width:.8\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(155.555 -39.232)\">\u003Cpath d=\"M-40.754 70.836Q-40.754 70.356-40.521 69.940Q-40.289 69.524-39.879 69.274Q-39.469 69.024-38.992 69.024Q-38.262 69.024-37.863 69.465Q-37.465 69.906-37.465 70.637Q-37.465 70.742-37.558 70.766L-40.008 70.766L-40.008 70.836Q-40.008 71.246-39.887 71.602Q-39.765 71.957-39.494 72.174Q-39.222 72.391-38.793 72.391Q-38.429 72.391-38.133 72.162Q-37.836 71.934-37.734 71.582Q-37.726 71.535-37.640 71.520L-37.558 71.520Q-37.465 71.547-37.465 71.629Q-37.465 71.637-37.472 71.668Q-37.535 71.895-37.674 72.078Q-37.812 72.262-38.004 72.395Q-38.195 72.528-38.414 72.598Q-38.633 72.668-38.871 72.668Q-39.242 72.668-39.580 72.531Q-39.918 72.395-40.185 72.143Q-40.453 71.891-40.603 71.551Q-40.754 71.211-40.754 70.836M-40 70.528L-38.039 70.528Q-38.039 70.223-38.140 69.932Q-38.242 69.641-38.459 69.459Q-38.676 69.278-38.992 69.278Q-39.293 69.278-39.523 69.465Q-39.754 69.653-39.877 69.944Q-40 70.235-40 70.528M-35.062 72.590L-36.894 72.590L-36.894 72.293Q-36.621 72.293-36.453 72.246Q-36.285 72.199-36.285 72.031L-36.285 67.871Q-36.285 67.656-36.347 67.561Q-36.410 67.465-36.529 67.444Q-36.648 67.422-36.894 67.422L-36.894 67.125L-35.672 67.039L-35.672 72.031Q-35.672 72.199-35.504 72.246Q-35.336 72.293-35.062 72.293L-35.062 72.590M-34.617 70.836Q-34.617 70.356-34.385 69.940Q-34.152 69.524-33.742 69.274Q-33.332 69.024-32.855 69.024Q-32.125 69.024-31.726 69.465Q-31.328 69.906-31.328 70.637Q-31.328 70.742-31.422 70.766L-33.871 70.766L-33.871 70.836Q-33.871 71.246-33.750 71.602Q-33.629 71.957-33.357 72.174Q-33.086 72.391-32.656 72.391Q-32.293 72.391-31.996 72.162Q-31.699 71.934-31.597 71.582Q-31.590 71.535-31.504 71.520L-31.422 71.520Q-31.328 71.547-31.328 71.629Q-31.328 71.637-31.336 71.668Q-31.398 71.895-31.537 72.078Q-31.676 72.262-31.867 72.395Q-32.058 72.528-32.277 72.598Q-32.496 72.668-32.734 72.668Q-33.105 72.668-33.443 72.531Q-33.781 72.395-34.049 72.143Q-34.316 71.891-34.467 71.551Q-34.617 71.211-34.617 70.836M-33.863 70.528L-31.902 70.528Q-31.902 70.223-32.004 69.932Q-32.105 69.641-32.322 69.459Q-32.539 69.278-32.855 69.278Q-33.156 69.278-33.387 69.465Q-33.617 69.653-33.740 69.944Q-33.863 70.235-33.863 70.528M-30.797 70.863Q-30.797 70.367-30.547 69.942Q-30.297 69.516-29.877 69.270Q-29.457 69.024-28.957 69.024Q-28.418 69.024-28.027 69.149Q-27.637 69.274-27.637 69.688Q-27.637 69.793-27.687 69.885Q-27.738 69.977-27.830 70.028Q-27.922 70.078-28.031 70.078Q-28.137 70.078-28.228 70.028Q-28.320 69.977-28.371 69.885Q-28.422 69.793-28.422 69.688Q-28.422 69.465-28.254 69.360Q-28.476 69.301-28.949 69.301Q-29.246 69.301-29.461 69.440Q-29.676 69.578-29.806 69.809Q-29.937 70.039-29.996 70.309Q-30.054 70.578-30.054 70.863Q-30.054 71.258-29.922 71.608Q-29.789 71.957-29.517 72.174Q-29.246 72.391-28.847 72.391Q-28.472 72.391-28.197 72.174Q-27.922 71.957-27.820 71.598Q-27.804 71.535-27.742 71.535L-27.637 71.535Q-27.601 71.535-27.576 71.563Q-27.551 71.590-27.551 71.629L-27.551 71.653Q-27.683 72.133-28.068 72.401Q-28.453 72.668-28.957 72.668Q-29.320 72.668-29.654 72.531Q-29.988 72.395-30.248 72.145Q-30.508 71.895-30.652 71.559Q-30.797 71.223-30.797 70.863M-26.437 71.629L-26.437 69.438L-27.140 69.438L-27.140 69.184Q-26.785 69.184-26.543 68.951Q-26.301 68.719-26.189 68.371Q-26.078 68.024-26.078 67.668L-25.797 67.668L-25.797 69.141L-24.621 69.141L-24.621 69.438L-25.797 69.438L-25.797 71.613Q-25.797 71.934-25.678 72.162Q-25.558 72.391-25.277 72.391Q-25.097 72.391-24.980 72.268Q-24.863 72.145-24.810 71.965Q-24.758 71.785-24.758 71.613L-24.758 71.141L-24.476 71.141L-24.476 71.629Q-24.476 71.883-24.582 72.123Q-24.687 72.363-24.885 72.516Q-25.082 72.668-25.340 72.668Q-25.656 72.668-25.908 72.545Q-26.160 72.422-26.299 72.188Q-26.437 71.953-26.437 71.629M-21.750 72.590L-23.730 72.590L-23.730 72.293Q-23.461 72.293-23.293 72.248Q-23.125 72.203-23.125 72.031L-23.125 69.895Q-23.125 69.680-23.187 69.584Q-23.250 69.488-23.367 69.467Q-23.484 69.445-23.730 69.445L-23.730 69.149L-22.562 69.063L-22.562 69.848Q-22.484 69.637-22.332 69.451Q-22.179 69.266-21.980 69.164Q-21.781 69.063-21.554 69.063Q-21.308 69.063-21.117 69.207Q-20.926 69.352-20.926 69.582Q-20.926 69.738-21.031 69.848Q-21.137 69.957-21.293 69.957Q-21.449 69.957-21.558 69.848Q-21.668 69.738-21.668 69.582Q-21.668 69.422-21.562 69.317Q-21.887 69.317-22.101 69.545Q-22.316 69.774-22.412 70.113Q-22.508 70.453-22.508 70.758L-22.508 72.031Q-22.508 72.199-22.281 72.246Q-22.054 72.293-21.750 72.293L-21.750 72.590M-20.445 70.895Q-20.445 70.391-20.189 69.959Q-19.933 69.528-19.498 69.276Q-19.062 69.024-18.562 69.024Q-18.176 69.024-17.834 69.168Q-17.492 69.313-17.230 69.574Q-16.969 69.836-16.826 70.172Q-16.683 70.508-16.683 70.895Q-16.683 71.387-16.947 71.797Q-17.211 72.207-17.640 72.438Q-18.070 72.668-18.562 72.668Q-19.054 72.668-19.488 72.436Q-19.922 72.203-20.183 71.795Q-20.445 71.387-20.445 70.895M-18.562 72.391Q-18.105 72.391-17.853 72.168Q-17.601 71.945-17.513 71.594Q-17.426 71.242-17.426 70.797Q-17.426 70.367-17.519 70.029Q-17.613 69.692-17.867 69.485Q-18.121 69.278-18.562 69.278Q-19.211 69.278-19.455 69.694Q-19.699 70.110-19.699 70.797Q-19.699 71.242-19.611 71.594Q-19.523 71.945-19.271 72.168Q-19.019 72.391-18.562 72.391M-14.269 72.590L-16.125 72.590L-16.125 72.293Q-15.851 72.293-15.683 72.246Q-15.515 72.199-15.515 72.031L-15.515 69.895Q-15.515 69.680-15.578 69.584Q-15.640 69.488-15.760 69.467Q-15.879 69.445-16.125 69.445L-16.125 69.149L-14.933 69.063L-14.933 69.797Q-14.820 69.582-14.627 69.414Q-14.433 69.246-14.195 69.154Q-13.957 69.063-13.703 69.063Q-12.535 69.063-12.535 70.141L-12.535 72.031Q-12.535 72.199-12.365 72.246Q-12.195 72.293-11.926 72.293L-11.926 72.590L-13.781 72.590L-13.781 72.293Q-13.508 72.293-13.340 72.246Q-13.172 72.199-13.172 72.031L-13.172 70.156Q-13.172 69.774-13.293 69.545Q-13.414 69.317-13.765 69.317Q-14.078 69.317-14.332 69.479Q-14.586 69.641-14.732 69.910Q-14.879 70.180-14.879 70.477L-14.879 72.031Q-14.879 72.199-14.709 72.246Q-14.539 72.293-14.269 72.293\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(155.555 -39.232)\">\u003Cpath d=\"M-8.592 72.582L-8.592 71.360Q-8.592 71.332-8.560 71.301Q-8.529 71.270-8.506 71.270L-8.400 71.270Q-8.330 71.270-8.314 71.332Q-8.252 71.653-8.113 71.893Q-7.975 72.133-7.742 72.274Q-7.510 72.414-7.201 72.414Q-6.963 72.414-6.754 72.354Q-6.545 72.293-6.408 72.145Q-6.271 71.996-6.271 71.750Q-6.271 71.496-6.482 71.330Q-6.693 71.164-6.963 71.110L-7.584 70.996Q-7.990 70.918-8.291 70.662Q-8.592 70.406-8.592 70.031Q-8.592 69.664-8.391 69.442Q-8.189 69.219-7.865 69.121Q-7.541 69.024-7.201 69.024Q-6.736 69.024-6.439 69.231L-6.217 69.047Q-6.193 69.024-6.162 69.024L-6.111 69.024Q-6.080 69.024-6.053 69.051Q-6.025 69.078-6.025 69.110L-6.025 70.094Q-6.025 70.125-6.051 70.154Q-6.076 70.184-6.111 70.184L-6.217 70.184Q-6.252 70.184-6.279 70.156Q-6.307 70.129-6.307 70.094Q-6.307 69.695-6.559 69.475Q-6.810 69.254-7.209 69.254Q-7.564 69.254-7.848 69.377Q-8.131 69.500-8.131 69.805Q-8.131 70.024-7.930 70.156Q-7.728 70.289-7.482 70.332L-6.857 70.445Q-6.428 70.535-6.119 70.832Q-5.810 71.129-5.810 71.543Q-5.810 72.113-6.209 72.391Q-6.607 72.668-7.201 72.668Q-7.752 72.668-8.103 72.332L-8.400 72.645Q-8.424 72.668-8.459 72.668L-8.506 72.668Q-8.529 72.668-8.560 72.637Q-8.592 72.606-8.592 72.582M-5.240 70.863Q-5.240 70.367-4.990 69.942Q-4.740 69.516-4.320 69.270Q-3.900 69.024-3.400 69.024Q-2.861 69.024-2.471 69.149Q-2.080 69.274-2.080 69.688Q-2.080 69.793-2.131 69.885Q-2.182 69.977-2.273 70.028Q-2.365 70.078-2.475 70.078Q-2.580 70.078-2.672 70.028Q-2.764 69.977-2.814 69.885Q-2.865 69.793-2.865 69.688Q-2.865 69.465-2.697 69.360Q-2.920 69.301-3.393 69.301Q-3.689 69.301-3.904 69.440Q-4.119 69.578-4.250 69.809Q-4.381 70.039-4.439 70.309Q-4.498 70.578-4.498 70.863Q-4.498 71.258-4.365 71.608Q-4.232 71.957-3.961 72.174Q-3.689 72.391-3.291 72.391Q-2.916 72.391-2.641 72.174Q-2.365 71.957-2.264 71.598Q-2.248 71.535-2.185 71.535L-2.080 71.535Q-2.045 71.535-2.019 71.563Q-1.994 71.590-1.994 71.629L-1.994 71.653Q-2.127 72.133-2.512 72.401Q-2.896 72.668-3.400 72.668Q-3.764 72.668-4.098 72.531Q-4.432 72.395-4.691 72.145Q-4.951 71.895-5.096 71.559Q-5.240 71.223-5.240 70.863M-1.408 71.758Q-1.408 71.274-1.006 70.979Q-0.603 70.684-0.053 70.565Q0.498 70.445 0.990 70.445L0.990 70.156Q0.990 69.930 0.875 69.723Q0.760 69.516 0.563 69.397Q0.365 69.278 0.135 69.278Q-0.291 69.278-0.576 69.383Q-0.506 69.410-0.459 69.465Q-0.412 69.520-0.387 69.590Q-0.361 69.660-0.361 69.735Q-0.361 69.840-0.412 69.932Q-0.463 70.024-0.555 70.074Q-0.646 70.125-0.752 70.125Q-0.857 70.125-0.949 70.074Q-1.041 70.024-1.092 69.932Q-1.143 69.840-1.143 69.735Q-1.143 69.317-0.754 69.170Q-0.365 69.024 0.135 69.024Q0.467 69.024 0.820 69.154Q1.174 69.285 1.402 69.539Q1.631 69.793 1.631 70.141L1.631 71.942Q1.631 72.074 1.703 72.184Q1.775 72.293 1.904 72.293Q2.029 72.293 2.098 72.188Q2.166 72.082 2.166 71.942L2.166 71.430L2.447 71.430L2.447 71.942Q2.447 72.145 2.330 72.303Q2.213 72.461 2.031 72.545Q1.850 72.629 1.647 72.629Q1.416 72.629 1.264 72.457Q1.111 72.285 1.080 72.055Q0.920 72.336 0.611 72.502Q0.303 72.668-0.049 72.668Q-0.560 72.668-0.984 72.445Q-1.408 72.223-1.408 71.758M-0.721 71.758Q-0.721 72.043-0.494 72.229Q-0.268 72.414 0.025 72.414Q0.272 72.414 0.496 72.297Q0.721 72.180 0.856 71.977Q0.990 71.774 0.990 71.520L0.990 70.688Q0.725 70.688 0.440 70.742Q0.154 70.797-0.117 70.926Q-0.389 71.055-0.555 71.262Q-0.721 71.469-0.721 71.758M3.365 71.629L3.365 69.438L2.662 69.438L2.662 69.184Q3.018 69.184 3.260 68.951Q3.502 68.719 3.613 68.371Q3.725 68.024 3.725 67.668L4.006 67.668L4.006 69.141L5.182 69.141L5.182 69.438L4.006 69.438L4.006 71.613Q4.006 71.934 4.125 72.162Q4.244 72.391 4.525 72.391Q4.705 72.391 4.822 72.268Q4.940 72.145 4.992 71.965Q5.045 71.785 5.045 71.613L5.045 71.141L5.326 71.141L5.326 71.629Q5.326 71.883 5.221 72.123Q5.115 72.363 4.918 72.516Q4.721 72.668 4.463 72.668Q4.147 72.668 3.895 72.545Q3.643 72.422 3.504 72.188Q3.365 71.953 3.365 71.629M6.670 71.629L6.670 69.438L5.967 69.438L5.967 69.184Q6.322 69.184 6.565 68.951Q6.807 68.719 6.918 68.371Q7.029 68.024 7.029 67.668L7.311 67.668L7.311 69.141L8.486 69.141L8.486 69.438L7.311 69.438L7.311 71.613Q7.311 71.934 7.430 72.162Q7.549 72.391 7.830 72.391Q8.010 72.391 8.127 72.268Q8.244 72.145 8.297 71.965Q8.350 71.785 8.350 71.613L8.350 71.141L8.631 71.141L8.631 71.629Q8.631 71.883 8.525 72.123Q8.420 72.363 8.223 72.516Q8.025 72.668 7.768 72.668Q7.451 72.668 7.199 72.545Q6.947 72.422 6.809 72.188Q6.670 71.953 6.670 71.629M9.350 70.836Q9.350 70.356 9.582 69.940Q9.815 69.524 10.225 69.274Q10.635 69.024 11.111 69.024Q11.842 69.024 12.240 69.465Q12.639 69.906 12.639 70.637Q12.639 70.742 12.545 70.766L10.096 70.766L10.096 70.836Q10.096 71.246 10.217 71.602Q10.338 71.957 10.609 72.174Q10.881 72.391 11.311 72.391Q11.674 72.391 11.971 72.162Q12.268 71.934 12.369 71.582Q12.377 71.535 12.463 71.520L12.545 71.520Q12.639 71.547 12.639 71.629Q12.639 71.637 12.631 71.668Q12.568 71.895 12.430 72.078Q12.291 72.262 12.100 72.395Q11.908 72.528 11.690 72.598Q11.471 72.668 11.232 72.668Q10.861 72.668 10.523 72.531Q10.186 72.395 9.918 72.143Q9.650 71.891 9.500 71.551Q9.350 71.211 9.350 70.836M10.104 70.528L12.065 70.528Q12.065 70.223 11.963 69.932Q11.861 69.641 11.645 69.459Q11.428 69.278 11.111 69.278Q10.811 69.278 10.580 69.465Q10.350 69.653 10.227 69.944Q10.104 70.235 10.104 70.528M15.135 72.590L13.154 72.590L13.154 72.293Q13.424 72.293 13.592 72.248Q13.760 72.203 13.760 72.031L13.760 69.895Q13.760 69.680 13.697 69.584Q13.635 69.488 13.518 69.467Q13.400 69.445 13.154 69.445L13.154 69.149L14.322 69.063L14.322 69.848Q14.400 69.637 14.553 69.451Q14.705 69.266 14.904 69.164Q15.104 69.063 15.330 69.063Q15.576 69.063 15.768 69.207Q15.959 69.352 15.959 69.582Q15.959 69.738 15.854 69.848Q15.748 69.957 15.592 69.957Q15.436 69.957 15.326 69.848Q15.217 69.738 15.217 69.582Q15.217 69.422 15.322 69.317Q14.998 69.317 14.783 69.545Q14.568 69.774 14.473 70.113Q14.377 70.453 14.377 70.758L14.377 72.031Q14.377 72.199 14.604 72.246Q14.830 72.293 15.135 72.293L15.135 72.590M18.299 72.590L16.522 72.590L16.522 72.293Q16.795 72.293 16.963 72.246Q17.131 72.199 17.131 72.031L17.131 69.895Q17.131 69.680 17.074 69.584Q17.018 69.488 16.904 69.467Q16.791 69.445 16.545 69.445L16.545 69.149L17.744 69.063L17.744 72.031Q17.744 72.199 17.891 72.246Q18.037 72.293 18.299 72.293L18.299 72.590M16.857 67.668Q16.857 67.477 16.992 67.346Q17.127 67.215 17.322 67.215Q17.443 67.215 17.547 67.278Q17.650 67.340 17.713 67.444Q17.775 67.547 17.775 67.668Q17.775 67.863 17.645 67.998Q17.514 68.133 17.322 68.133Q17.123 68.133 16.990 68Q16.857 67.867 16.857 67.668M20.729 72.590L18.873 72.590L18.873 72.293Q19.147 72.293 19.315 72.246Q19.482 72.199 19.482 72.031L19.482 69.895Q19.482 69.680 19.420 69.584Q19.357 69.488 19.238 69.467Q19.119 69.445 18.873 69.445L18.873 69.149L20.065 69.063L20.065 69.797Q20.178 69.582 20.371 69.414Q20.565 69.246 20.803 69.154Q21.041 69.063 21.295 69.063Q22.463 69.063 22.463 70.141L22.463 72.031Q22.463 72.199 22.633 72.246Q22.803 72.293 23.072 72.293L23.072 72.590L21.217 72.590L21.217 72.293Q21.490 72.293 21.658 72.246Q21.826 72.199 21.826 72.031L21.826 70.156Q21.826 69.774 21.705 69.545Q21.584 69.317 21.232 69.317Q20.920 69.317 20.666 69.479Q20.412 69.641 20.266 69.910Q20.119 70.180 20.119 70.477L20.119 72.031Q20.119 72.199 20.289 72.246Q20.459 72.293 20.729 72.293L20.729 72.590M23.518 73.199Q23.518 72.918 23.729 72.707Q23.940 72.496 24.225 72.406Q24.068 72.281 23.990 72.092Q23.912 71.903 23.912 71.703Q23.912 71.348 24.143 71.055Q23.775 70.715 23.775 70.246Q23.775 69.895 23.979 69.625Q24.182 69.356 24.502 69.209Q24.822 69.063 25.166 69.063Q25.686 69.063 26.057 69.344Q26.420 68.973 26.967 68.973Q27.147 68.973 27.273 69.100Q27.400 69.227 27.400 69.406Q27.400 69.512 27.322 69.590Q27.244 69.668 27.135 69.668Q27.025 69.668 26.949 69.592Q26.873 69.516 26.873 69.406Q26.873 69.305 26.912 69.254Q26.920 69.246 26.924 69.240Q26.928 69.235 26.928 69.231Q26.553 69.231 26.232 69.485Q26.553 69.824 26.553 70.246Q26.553 70.516 26.436 70.733Q26.318 70.949 26.113 71.108Q25.908 71.266 25.666 71.348Q25.424 71.430 25.166 71.430Q24.947 71.430 24.734 71.371Q24.522 71.313 24.326 71.192Q24.232 71.332 24.232 71.512Q24.232 71.719 24.369 71.871Q24.506 72.024 24.713 72.024L25.408 72.024Q25.897 72.024 26.309 72.108Q26.721 72.192 27 72.449Q27.279 72.707 27.279 73.199Q27.279 73.563 26.959 73.795Q26.639 74.028 26.197 74.129Q25.756 74.231 25.400 74.231Q25.045 74.231 24.602 74.129Q24.158 74.028 23.838 73.795Q23.518 73.563 23.518 73.199M24.022 73.199Q24.022 73.395 24.166 73.543Q24.311 73.692 24.523 73.781Q24.736 73.871 24.977 73.918Q25.217 73.965 25.400 73.965Q25.643 73.965 25.973 73.887Q26.303 73.809 26.539 73.635Q26.775 73.461 26.775 73.199Q26.775 72.793 26.365 72.684Q25.955 72.574 25.393 72.574L24.713 72.574Q24.443 72.574 24.232 72.752Q24.022 72.930 24.022 73.199M25.166 71.164Q25.889 71.164 25.889 70.246Q25.889 69.324 25.166 69.324Q24.440 69.324 24.440 70.246Q24.440 71.164 25.166 71.164\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M21.604-46.912c39.834 25.608 68.287 65.442 91.049 83.936\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(100.272 -91.737)\">\u003Cpath d=\"M-38.273 72.590L-40.656 72.590L-40.656 72.293Q-40.336 72.293-40.092 72.246Q-39.847 72.199-39.847 72.031L-39.847 67.688Q-39.847 67.516-40.092 67.469Q-40.336 67.422-40.656 67.422L-40.656 67.125L-38.273 67.125L-38.273 67.422Q-38.594 67.422-38.838 67.471Q-39.082 67.520-39.082 67.688L-39.082 70.238L-36.465 67.903Q-36.328 67.781-36.328 67.653Q-36.328 67.543-36.416 67.483Q-36.504 67.422-36.625 67.422L-36.625 67.125L-34.871 67.125L-34.871 67.422Q-35.508 67.422-36.039 67.903L-37.558 69.262L-35.695 71.813Q-35.551 72.016-35.435 72.119Q-35.320 72.223-35.172 72.258Q-35.023 72.293-34.762 72.293L-34.762 72.590L-36.840 72.590L-36.840 72.293Q-36.426 72.293-36.426 72.086Q-36.426 71.977-36.551 71.813L-38.082 69.719L-39.082 70.613L-39.082 72.031Q-39.082 72.195-38.838 72.244Q-38.594 72.293-38.273 72.293L-38.273 72.590M-32.144 72.590L-34.125 72.590L-34.125 72.293Q-33.855 72.293-33.687 72.248Q-33.519 72.203-33.519 72.031L-33.519 69.895Q-33.519 69.680-33.582 69.584Q-33.644 69.488-33.762 69.467Q-33.879 69.445-34.125 69.445L-34.125 69.149L-32.957 69.063L-32.957 69.848Q-32.879 69.637-32.726 69.451Q-32.574 69.266-32.375 69.164Q-32.176 69.063-31.949 69.063Q-31.703 69.063-31.512 69.207Q-31.320 69.352-31.320 69.582Q-31.320 69.738-31.426 69.848Q-31.531 69.957-31.687 69.957Q-31.844 69.957-31.953 69.848Q-32.062 69.738-32.062 69.582Q-32.062 69.422-31.957 69.317Q-32.281 69.317-32.496 69.545Q-32.711 69.774-32.806 70.113Q-32.902 70.453-32.902 70.758L-32.902 72.031Q-32.902 72.199-32.676 72.246Q-32.449 72.293-32.144 72.293L-32.144 72.590M-30.742 71.758Q-30.742 71.274-30.340 70.979Q-29.937 70.684-29.387 70.565Q-28.836 70.445-28.344 70.445L-28.344 70.156Q-28.344 69.930-28.459 69.723Q-28.574 69.516-28.771 69.397Q-28.969 69.278-29.199 69.278Q-29.625 69.278-29.910 69.383Q-29.840 69.410-29.793 69.465Q-29.746 69.520-29.721 69.590Q-29.695 69.660-29.695 69.735Q-29.695 69.840-29.746 69.932Q-29.797 70.024-29.888 70.074Q-29.980 70.125-30.086 70.125Q-30.191 70.125-30.283 70.074Q-30.375 70.024-30.426 69.932Q-30.476 69.840-30.476 69.735Q-30.476 69.317-30.088 69.170Q-29.699 69.024-29.199 69.024Q-28.867 69.024-28.513 69.154Q-28.160 69.285-27.931 69.539Q-27.703 69.793-27.703 70.141L-27.703 71.942Q-27.703 72.074-27.631 72.184Q-27.558 72.293-27.429 72.293Q-27.304 72.293-27.236 72.188Q-27.168 72.082-27.168 71.942L-27.168 71.430L-26.887 71.430L-26.887 71.942Q-26.887 72.145-27.004 72.303Q-27.121 72.461-27.303 72.545Q-27.484 72.629-27.687 72.629Q-27.918 72.629-28.070 72.457Q-28.222 72.285-28.254 72.055Q-28.414 72.336-28.722 72.502Q-29.031 72.668-29.383 72.668Q-29.894 72.668-30.318 72.445Q-30.742 72.223-30.742 71.758M-30.054 71.758Q-30.054 72.043-29.828 72.229Q-29.601 72.414-29.308 72.414Q-29.062 72.414-28.838 72.297Q-28.613 72.180-28.478 71.977Q-28.344 71.774-28.344 71.520L-28.344 70.688Q-28.609 70.688-28.894 70.742Q-29.179 70.797-29.451 70.926Q-29.722 71.055-29.888 71.262Q-30.054 71.469-30.054 71.758M-24.664 72.590L-26.519 72.590L-26.519 72.293Q-26.246 72.293-26.078 72.246Q-25.910 72.199-25.910 72.031L-25.910 69.895Q-25.910 69.680-25.972 69.584Q-26.035 69.488-26.154 69.467Q-26.273 69.445-26.519 69.445L-26.519 69.149L-25.328 69.063L-25.328 69.797Q-25.215 69.582-25.021 69.414Q-24.828 69.246-24.590 69.154Q-24.351 69.063-24.097 69.063Q-23.137 69.063-22.961 69.774Q-22.777 69.445-22.449 69.254Q-22.121 69.063-21.742 69.063Q-20.566 69.063-20.566 70.141L-20.566 72.031Q-20.566 72.199-20.398 72.246Q-20.230 72.293-19.961 72.293L-19.961 72.590L-21.816 72.590L-21.816 72.293Q-21.543 72.293-21.375 72.248Q-21.207 72.203-21.207 72.031L-21.207 70.156Q-21.207 69.770-21.332 69.543Q-21.457 69.317-21.808 69.317Q-22.113 69.317-22.369 69.479Q-22.625 69.641-22.773 69.910Q-22.922 70.180-22.922 70.477L-22.922 72.031Q-22.922 72.199-22.752 72.246Q-22.582 72.293-22.312 72.293L-22.312 72.590L-24.168 72.590L-24.168 72.293Q-23.894 72.293-23.726 72.246Q-23.558 72.199-23.558 72.031L-23.558 70.156Q-23.558 69.770-23.683 69.543Q-23.808 69.317-24.160 69.317Q-24.465 69.317-24.721 69.479Q-24.976 69.641-25.125 69.910Q-25.273 70.180-25.273 70.477L-25.273 72.031Q-25.273 72.199-25.103 72.246Q-24.933 72.293-24.664 72.293L-24.664 72.590M-19.515 70.836Q-19.515 70.356-19.283 69.940Q-19.051 69.524-18.640 69.274Q-18.230 69.024-17.754 69.024Q-17.023 69.024-16.625 69.465Q-16.226 69.906-16.226 70.637Q-16.226 70.742-16.320 70.766L-18.769 70.766L-18.769 70.836Q-18.769 71.246-18.648 71.602Q-18.527 71.957-18.256 72.174Q-17.984 72.391-17.554 72.391Q-17.191 72.391-16.894 72.162Q-16.597 71.934-16.496 71.582Q-16.488 71.535-16.402 71.520L-16.320 71.520Q-16.226 71.547-16.226 71.629Q-16.226 71.637-16.234 71.668Q-16.297 71.895-16.435 72.078Q-16.574 72.262-16.765 72.395Q-16.957 72.528-17.176 72.598Q-17.394 72.668-17.633 72.668Q-18.004 72.668-18.342 72.531Q-18.679 72.395-18.947 72.143Q-19.215 71.891-19.365 71.551Q-19.515 71.211-19.515 70.836M-18.762 70.528L-16.801 70.528Q-16.801 70.223-16.902 69.932Q-17.004 69.641-17.221 69.459Q-17.437 69.278-17.754 69.278Q-18.054 69.278-18.285 69.465Q-18.515 69.653-18.638 69.944Q-18.762 70.235-18.762 70.528M-13.730 72.590L-15.711 72.590L-15.711 72.293Q-15.441 72.293-15.273 72.248Q-15.105 72.203-15.105 72.031L-15.105 69.895Q-15.105 69.680-15.168 69.584Q-15.230 69.488-15.347 69.467Q-15.465 69.445-15.711 69.445L-15.711 69.149L-14.543 69.063L-14.543 69.848Q-14.465 69.637-14.312 69.451Q-14.160 69.266-13.961 69.164Q-13.762 69.063-13.535 69.063Q-13.289 69.063-13.097 69.207Q-12.906 69.352-12.906 69.582Q-12.906 69.738-13.012 69.848Q-13.117 69.957-13.273 69.957Q-13.429 69.957-13.539 69.848Q-13.648 69.738-13.648 69.582Q-13.648 69.422-13.543 69.317Q-13.867 69.317-14.082 69.545Q-14.297 69.774-14.392 70.113Q-14.488 70.453-14.488 70.758L-14.488 72.031Q-14.488 72.199-14.262 72.246Q-14.035 72.293-13.730 72.293L-13.730 72.590M-12.383 72.582L-12.383 71.360Q-12.383 71.332-12.351 71.301Q-12.320 71.270-12.297 71.270L-12.191 71.270Q-12.121 71.270-12.105 71.332Q-12.043 71.653-11.904 71.893Q-11.765 72.133-11.533 72.274Q-11.301 72.414-10.992 72.414Q-10.754 72.414-10.545 72.354Q-10.336 72.293-10.199 72.145Q-10.062 71.996-10.062 71.750Q-10.062 71.496-10.273 71.330Q-10.484 71.164-10.754 71.110L-11.375 70.996Q-11.781 70.918-12.082 70.662Q-12.383 70.406-12.383 70.031Q-12.383 69.664-12.181 69.442Q-11.980 69.219-11.656 69.121Q-11.332 69.024-10.992 69.024Q-10.527 69.024-10.230 69.231L-10.008 69.047Q-9.984 69.024-9.953 69.024L-9.902 69.024Q-9.871 69.024-9.844 69.051Q-9.816 69.078-9.816 69.110L-9.816 70.094Q-9.816 70.125-9.842 70.154Q-9.867 70.184-9.902 70.184L-10.008 70.184Q-10.043 70.184-10.070 70.156Q-10.097 70.129-10.097 70.094Q-10.097 69.695-10.349 69.475Q-10.601 69.254-11 69.254Q-11.355 69.254-11.638 69.377Q-11.922 69.500-11.922 69.805Q-11.922 70.024-11.721 70.156Q-11.519 70.289-11.273 70.332L-10.648 70.445Q-10.219 70.535-9.910 70.832Q-9.601 71.129-9.601 71.543Q-9.601 72.113-10 72.391Q-10.398 72.668-10.992 72.668Q-11.543 72.668-11.894 72.332L-12.191 72.645Q-12.215 72.668-12.250 72.668L-12.297 72.668Q-12.320 72.668-12.351 72.637Q-12.383 72.606-12.383 72.582\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-23.92 18.53C-6.85-9.923 10.223-29.84 21.604-46.912\" style=\"stroke-dasharray:1.2,1.0;stroke-width:1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-24.612 -89.049)\">\u003Cpath d=\"M-39.840 72.590L-40.121 72.590L-40.121 67.871Q-40.121 67.656-40.183 67.561Q-40.246 67.465-40.363 67.444Q-40.480 67.422-40.726 67.422L-40.726 67.125L-39.504 67.039L-39.504 69.528Q-39.027 69.063-38.328 69.063Q-37.847 69.063-37.439 69.307Q-37.031 69.551-36.795 69.965Q-36.558 70.379-36.558 70.863Q-36.558 71.238-36.707 71.567Q-36.855 71.895-37.125 72.147Q-37.394 72.399-37.738 72.533Q-38.082 72.668-38.441 72.668Q-38.762 72.668-39.060 72.520Q-39.359 72.371-39.566 72.110L-39.840 72.590M-39.480 69.918L-39.480 71.758Q-39.328 72.055-39.068 72.235Q-38.808 72.414-38.496 72.414Q-38.070 72.414-37.803 72.195Q-37.535 71.977-37.420 71.631Q-37.304 71.285-37.304 70.863Q-37.304 70.215-37.553 69.766Q-37.801 69.317-38.398 69.317Q-38.734 69.317-39.023 69.475Q-39.312 69.633-39.480 69.918\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-24.612 -89.049)\">\u003Cpath d=\"M-35.796 70.895Q-35.796 70.391-35.540 69.959Q-35.284 69.528-34.848 69.276Q-34.413 69.024-33.913 69.024Q-33.526 69.024-33.184 69.168Q-32.843 69.313-32.581 69.574Q-32.319 69.836-32.177 70.172Q-32.034 70.508-32.034 70.895Q-32.034 71.387-32.298 71.797Q-32.561 72.207-32.991 72.438Q-33.421 72.668-33.913 72.668Q-34.405 72.668-34.839 72.436Q-35.272 72.203-35.534 71.795Q-35.796 71.387-35.796 70.895M-33.913 72.391Q-33.456 72.391-33.204 72.168Q-32.952 71.945-32.864 71.594Q-32.776 71.242-32.776 70.797Q-32.776 70.367-32.870 70.029Q-32.964 69.692-33.218 69.485Q-33.471 69.278-33.913 69.278Q-34.561 69.278-34.805 69.694Q-35.050 70.110-35.050 70.797Q-35.050 71.242-34.962 71.594Q-34.874 71.945-34.622 72.168Q-34.370 72.391-33.913 72.391M-30.866 71.637L-30.866 69.895Q-30.866 69.680-30.929 69.584Q-30.991 69.488-31.110 69.467Q-31.229 69.445-31.475 69.445L-31.475 69.149L-30.229 69.063L-30.229 71.613L-30.229 71.637Q-30.229 71.949-30.175 72.111Q-30.120 72.274-29.970 72.344Q-29.819 72.414-29.499 72.414Q-29.069 72.414-28.796 72.076Q-28.522 71.738-28.522 71.293L-28.522 69.895Q-28.522 69.680-28.585 69.584Q-28.647 69.488-28.766 69.467Q-28.886 69.445-29.132 69.445L-29.132 69.149L-27.886 69.063L-27.886 71.848Q-27.886 72.059-27.823 72.154Q-27.761 72.250-27.641 72.272Q-27.522 72.293-27.276 72.293L-27.276 72.590L-28.499 72.668L-28.499 72.047Q-28.667 72.336-28.948 72.502Q-29.229 72.668-29.550 72.668Q-30.866 72.668-30.866 71.637M-24.901 72.590L-26.757 72.590L-26.757 72.293Q-26.483 72.293-26.315 72.246Q-26.147 72.199-26.147 72.031L-26.147 69.895Q-26.147 69.680-26.210 69.584Q-26.272 69.488-26.391 69.467Q-26.511 69.445-26.757 69.445L-26.757 69.149L-25.565 69.063L-25.565 69.797Q-25.452 69.582-25.259 69.414Q-25.065 69.246-24.827 69.154Q-24.589 69.063-24.335 69.063Q-23.167 69.063-23.167 70.141L-23.167 72.031Q-23.167 72.199-22.997 72.246Q-22.827 72.293-22.557 72.293L-22.557 72.590L-24.413 72.590L-24.413 72.293Q-24.139 72.293-23.971 72.246Q-23.804 72.199-23.804 72.031L-23.804 70.156Q-23.804 69.774-23.925 69.545Q-24.046 69.317-24.397 69.317Q-24.710 69.317-24.964 69.479Q-25.218 69.641-25.364 69.910Q-25.511 70.180-25.511 70.477L-25.511 72.031Q-25.511 72.199-25.341 72.246Q-25.171 72.293-24.901 72.293L-24.901 72.590M-20.296 72.668Q-20.776 72.668-21.184 72.424Q-21.593 72.180-21.831 71.766Q-22.069 71.352-22.069 70.863Q-22.069 70.371-21.811 69.955Q-21.554 69.539-21.122 69.301Q-20.690 69.063-20.198 69.063Q-19.577 69.063-19.128 69.500L-19.128 67.871Q-19.128 67.656-19.190 67.561Q-19.253 67.465-19.370 67.444Q-19.487 67.422-19.733 67.422L-19.733 67.125L-18.511 67.039L-18.511 71.848Q-18.511 72.059-18.448 72.154Q-18.386 72.250-18.268 72.272Q-18.151 72.293-17.901 72.293L-17.901 72.590L-19.151 72.668L-19.151 72.184Q-19.616 72.668-20.296 72.668M-20.229 72.414Q-19.889 72.414-19.596 72.223Q-19.304 72.031-19.151 71.735L-19.151 69.903Q-19.300 69.629-19.561 69.473Q-19.823 69.317-20.136 69.317Q-20.761 69.317-21.044 69.764Q-21.327 70.211-21.327 70.871Q-21.327 71.516-21.075 71.965Q-20.823 72.414-20.229 72.414M-15.280 71.141L-17.534 71.141L-17.534 70.590L-15.280 70.590L-15.280 71.141M-12.495 72.590L-14.479 72.590L-14.479 72.293Q-14.206 72.293-14.038 72.246Q-13.870 72.199-13.870 72.031L-13.870 69.438L-14.511 69.438L-14.511 69.141L-13.870 69.141L-13.870 68.207Q-13.870 67.942-13.753 67.705Q-13.636 67.469-13.442 67.305Q-13.249 67.141-13.001 67.049Q-12.753 66.957-12.487 66.957Q-12.202 66.957-11.977 67.115Q-11.753 67.274-11.753 67.551Q-11.753 67.707-11.858 67.817Q-11.964 67.926-12.128 67.926Q-12.284 67.926-12.393 67.817Q-12.503 67.707-12.503 67.551Q-12.503 67.344-12.343 67.238Q-12.440 67.215-12.534 67.215Q-12.764 67.215-12.936 67.371Q-13.108 67.528-13.194 67.764Q-13.280 68-13.280 68.223L-13.280 69.141L-12.311 69.141L-12.311 69.438L-13.257 69.438L-13.257 72.031Q-13.257 72.199-13.030 72.246Q-12.804 72.293-12.495 72.293L-12.495 72.590M-9.960 72.590L-11.940 72.590L-11.940 72.293Q-11.671 72.293-11.503 72.248Q-11.335 72.203-11.335 72.031L-11.335 69.895Q-11.335 69.680-11.397 69.584Q-11.460 69.488-11.577 69.467Q-11.694 69.445-11.940 69.445L-11.940 69.149L-10.772 69.063L-10.772 69.848Q-10.694 69.637-10.542 69.451Q-10.389 69.266-10.190 69.164Q-9.991 69.063-9.764 69.063Q-9.518 69.063-9.327 69.207Q-9.136 69.352-9.136 69.582Q-9.136 69.738-9.241 69.848Q-9.346 69.957-9.503 69.957Q-9.659 69.957-9.768 69.848Q-9.878 69.738-9.878 69.582Q-9.878 69.422-9.772 69.317Q-10.096 69.317-10.311 69.545Q-10.526 69.774-10.622 70.113Q-10.718 70.453-10.718 70.758L-10.718 72.031Q-10.718 72.199-10.491 72.246Q-10.264 72.293-9.960 72.293L-9.960 72.590M-8.655 70.836Q-8.655 70.356-8.423 69.940Q-8.190 69.524-7.780 69.274Q-7.370 69.024-6.893 69.024Q-6.163 69.024-5.764 69.465Q-5.366 69.906-5.366 70.637Q-5.366 70.742-5.460 70.766L-7.909 70.766L-7.909 70.836Q-7.909 71.246-7.788 71.602Q-7.667 71.957-7.395 72.174Q-7.124 72.391-6.694 72.391Q-6.331 72.391-6.034 72.162Q-5.737 71.934-5.636 71.582Q-5.628 71.535-5.542 71.520L-5.460 71.520Q-5.366 71.547-5.366 71.629Q-5.366 71.637-5.374 71.668Q-5.436 71.895-5.575 72.078Q-5.714 72.262-5.905 72.395Q-6.096 72.528-6.315 72.598Q-6.534 72.668-6.772 72.668Q-7.143 72.668-7.481 72.531Q-7.819 72.395-8.087 72.143Q-8.354 71.891-8.505 71.551Q-8.655 71.211-8.655 70.836M-7.901 70.528L-5.940 70.528Q-5.940 70.223-6.042 69.932Q-6.143 69.641-6.360 69.459Q-6.577 69.278-6.893 69.278Q-7.194 69.278-7.425 69.465Q-7.655 69.653-7.778 69.944Q-7.901 70.235-7.901 70.528M-4.878 70.836Q-4.878 70.356-4.645 69.940Q-4.413 69.524-4.003 69.274Q-3.593 69.024-3.116 69.024Q-2.386 69.024-1.987 69.465Q-1.589 69.906-1.589 70.637Q-1.589 70.742-1.682 70.766L-4.132 70.766L-4.132 70.836Q-4.132 71.246-4.011 71.602Q-3.889 71.957-3.618 72.174Q-3.346 72.391-2.917 72.391Q-2.554 72.391-2.257 72.162Q-1.960 71.934-1.858 71.582Q-1.850 71.535-1.764 71.520L-1.682 71.520Q-1.589 71.547-1.589 71.629Q-1.589 71.637-1.596 71.668Q-1.659 71.895-1.798 72.078Q-1.936 72.262-2.128 72.395Q-2.319 72.528-2.538 72.598Q-2.757 72.668-2.995 72.668Q-3.366 72.668-3.704 72.531Q-4.042 72.395-4.309 72.143Q-4.577 71.891-4.727 71.551Q-4.878 71.211-4.878 70.836M-4.124 70.528L-2.163 70.528Q-2.163 70.223-2.264 69.932Q-2.366 69.641-2.583 69.459Q-2.800 69.278-3.116 69.278Q-3.417 69.278-3.647 69.465Q-3.878 69.653-4.001 69.944Q-4.124 70.235-4.124 70.528\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-24.612 -89.049)\">\u003Cpath d=\"M2.668 72.590L2.387 72.590L2.387 67.871Q2.387 67.656 2.325 67.561Q2.262 67.465 2.145 67.444Q2.028 67.422 1.782 67.422L1.782 67.125L3.004 67.039L3.004 69.528Q3.481 69.063 4.180 69.063Q4.661 69.063 5.069 69.307Q5.477 69.551 5.713 69.965Q5.950 70.379 5.950 70.863Q5.950 71.238 5.801 71.567Q5.653 71.895 5.383 72.147Q5.114 72.399 4.770 72.533Q4.426 72.668 4.067 72.668Q3.746 72.668 3.448 72.520Q3.149 72.371 2.942 72.110L2.668 72.590M3.028 69.918L3.028 71.758Q3.180 72.055 3.440 72.235Q3.700 72.414 4.012 72.414Q4.438 72.414 4.705 72.195Q4.973 71.977 5.088 71.631Q5.204 71.285 5.204 70.863Q5.204 70.215 4.955 69.766Q4.707 69.317 4.110 69.317Q3.774 69.317 3.485 69.475Q3.196 69.633 3.028 69.918M7.157 71.637L7.157 69.895Q7.157 69.680 7.094 69.584Q7.032 69.488 6.912 69.467Q6.793 69.445 6.547 69.445L6.547 69.149L7.793 69.063L7.793 71.613L7.793 71.637Q7.793 71.949 7.848 72.111Q7.903 72.274 8.053 72.344Q8.204 72.414 8.524 72.414Q8.954 72.414 9.227 72.076Q9.500 71.738 9.500 71.293L9.500 69.895Q9.500 69.680 9.438 69.584Q9.375 69.488 9.256 69.467Q9.137 69.445 8.891 69.445L8.891 69.149L10.137 69.063L10.137 71.848Q10.137 72.059 10.200 72.154Q10.262 72.250 10.381 72.272Q10.500 72.293 10.746 72.293L10.746 72.590L9.524 72.668L9.524 72.047Q9.356 72.336 9.075 72.502Q8.793 72.668 8.473 72.668Q7.157 72.668 7.157 71.637M13.121 72.590L11.266 72.590L11.266 72.293Q11.539 72.293 11.707 72.246Q11.875 72.199 11.875 72.031L11.875 69.895Q11.875 69.680 11.813 69.584Q11.750 69.488 11.631 69.467Q11.512 69.445 11.266 69.445L11.266 69.149L12.457 69.063L12.457 69.797Q12.571 69.582 12.764 69.414Q12.957 69.246 13.196 69.154Q13.434 69.063 13.688 69.063Q14.649 69.063 14.825 69.774Q15.008 69.445 15.336 69.254Q15.664 69.063 16.043 69.063Q17.219 69.063 17.219 70.141L17.219 72.031Q17.219 72.199 17.387 72.246Q17.555 72.293 17.825 72.293L17.825 72.590L15.969 72.590L15.969 72.293Q16.243 72.293 16.411 72.248Q16.578 72.203 16.578 72.031L16.578 70.156Q16.578 69.770 16.453 69.543Q16.328 69.317 15.977 69.317Q15.672 69.317 15.416 69.479Q15.161 69.641 15.012 69.910Q14.864 70.180 14.864 70.477L14.864 72.031Q14.864 72.199 15.034 72.246Q15.204 72.293 15.473 72.293L15.473 72.590L13.618 72.590L13.618 72.293Q13.891 72.293 14.059 72.246Q14.227 72.199 14.227 72.031L14.227 70.156Q14.227 69.770 14.102 69.543Q13.977 69.317 13.625 69.317Q13.321 69.317 13.065 69.479Q12.809 69.641 12.661 69.910Q12.512 70.180 12.512 70.477L12.512 72.031Q12.512 72.199 12.682 72.246Q12.852 72.293 13.121 72.293L13.121 72.590M20.153 74.141L18.297 74.141L18.297 73.848Q18.567 73.848 18.735 73.803Q18.903 73.758 18.903 73.582L18.903 69.758Q18.903 69.551 18.746 69.498Q18.590 69.445 18.297 69.445L18.297 69.149L19.520 69.063L19.520 69.528Q19.750 69.305 20.065 69.184Q20.379 69.063 20.719 69.063Q21.192 69.063 21.596 69.309Q22 69.555 22.233 69.971Q22.465 70.387 22.465 70.863Q22.465 71.238 22.317 71.567Q22.168 71.895 21.899 72.147Q21.629 72.399 21.286 72.533Q20.942 72.668 20.582 72.668Q20.293 72.668 20.022 72.547Q19.750 72.426 19.543 72.215L19.543 73.582Q19.543 73.758 19.711 73.803Q19.879 73.848 20.153 73.848L20.153 74.141M19.543 69.926L19.543 71.766Q19.696 72.055 19.957 72.235Q20.219 72.414 20.528 72.414Q20.813 72.414 21.036 72.276Q21.258 72.137 21.411 71.906Q21.563 71.676 21.641 71.404Q21.719 71.133 21.719 70.863Q21.719 70.531 21.594 70.174Q21.469 69.817 21.221 69.580Q20.973 69.344 20.625 69.344Q20.301 69.344 20.006 69.500Q19.711 69.656 19.543 69.926\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"m112.653 37.024 73.977.853\" style=\"stroke-width:1.2\"\u002F>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Opacity against temperature at fixed density. The Kramers term rises toward lower temperature and falls as T to the minus seven-halves toward higher temperature, meeting the flat electron-scattering floor in the hot interior.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:276.067px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 207.050 124.699\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath stroke=\"none\" d=\"M7.892-2.14a3 3 0 1 0-6 0 3 3 0 0 0 6 0m-3 0\"\u002F>\u003Cg transform=\"translate(27.552 -57.726)\">\u003Cpath d=\"M-32.820 44.935L-34.675 44.935L-34.675 44.642Q-34.406 44.642-34.238 44.597Q-34.070 44.552-34.070 44.376L-34.070 40.552Q-34.070 40.345-34.226 40.292Q-34.382 40.239-34.675 40.239L-34.675 39.943L-33.453 39.857L-33.453 40.322Q-33.222 40.099-32.908 39.978Q-32.593 39.857-32.254 39.857Q-31.781 39.857-31.377 40.103Q-30.972 40.349-30.740 40.765Q-30.507 41.181-30.507 41.657Q-30.507 42.032-30.656 42.361Q-30.804 42.689-31.074 42.941Q-31.343 43.193-31.687 43.327Q-32.031 43.462-32.390 43.462Q-32.679 43.462-32.951 43.341Q-33.222 43.220-33.429 43.009L-33.429 44.376Q-33.429 44.552-33.261 44.597Q-33.093 44.642-32.820 44.642L-32.820 44.935M-33.429 40.720L-33.429 42.560Q-33.277 42.849-33.015 43.029Q-32.754 43.208-32.445 43.208Q-32.160 43.208-31.937 43.070Q-31.714 42.931-31.562 42.700Q-31.410 42.470-31.332 42.198Q-31.254 41.927-31.254 41.657Q-31.254 41.325-31.379 40.968Q-31.504 40.611-31.752 40.374Q-32 40.138-32.347 40.138Q-32.671 40.138-32.966 40.294Q-33.261 40.450-33.429 40.720M-27.976 43.384L-29.957 43.384L-29.957 43.087Q-29.687 43.087-29.519 43.042Q-29.351 42.997-29.351 42.825L-29.351 40.689Q-29.351 40.474-29.414 40.378Q-29.476 40.282-29.593 40.261Q-29.711 40.239-29.957 40.239L-29.957 39.943L-28.789 39.857L-28.789 40.642Q-28.711 40.431-28.558 40.245Q-28.406 40.060-28.207 39.958Q-28.007 39.857-27.781 39.857Q-27.535 39.857-27.343 40.001Q-27.152 40.146-27.152 40.376Q-27.152 40.532-27.257 40.642Q-27.363 40.751-27.519 40.751Q-27.675 40.751-27.785 40.642Q-27.894 40.532-27.894 40.376Q-27.894 40.216-27.789 40.111Q-28.113 40.111-28.328 40.339Q-28.543 40.568-28.638 40.907Q-28.734 41.247-28.734 41.552L-28.734 42.825Q-28.734 42.993-28.507 43.040Q-28.281 43.087-27.976 43.087L-27.976 43.384M-26.671 41.689Q-26.671 41.185-26.416 40.753Q-26.160 40.322-25.724 40.070Q-25.289 39.818-24.789 39.818Q-24.402 39.818-24.060 39.962Q-23.718 40.107-23.457 40.368Q-23.195 40.630-23.052 40.966Q-22.910 41.302-22.910 41.689Q-22.910 42.181-23.173 42.591Q-23.437 43.001-23.867 43.232Q-24.296 43.462-24.789 43.462Q-25.281 43.462-25.714 43.230Q-26.148 42.997-26.410 42.589Q-26.671 42.181-26.671 41.689M-24.789 43.185Q-24.332 43.185-24.080 42.962Q-23.828 42.739-23.740 42.388Q-23.652 42.036-23.652 41.591Q-23.652 41.161-23.746 40.823Q-23.839 40.486-24.093 40.279Q-24.347 40.072-24.789 40.072Q-25.437 40.072-25.681 40.488Q-25.925 40.904-25.925 41.591Q-25.925 42.036-25.837 42.388Q-25.750 42.739-25.498 42.962Q-25.246 43.185-24.789 43.185M-21.800 42.423L-21.800 40.232L-22.504 40.232L-22.504 39.978Q-22.148 39.978-21.906 39.745Q-21.664 39.513-21.552 39.165Q-21.441 38.818-21.441 38.462L-21.160 38.462L-21.160 39.935L-19.984 39.935L-19.984 40.232L-21.160 40.232L-21.160 42.407Q-21.160 42.728-21.041 42.956Q-20.921 43.185-20.640 43.185Q-20.461 43.185-20.343 43.062Q-20.226 42.939-20.173 42.759Q-20.121 42.579-20.121 42.407L-20.121 41.935L-19.839 41.935L-19.839 42.423Q-19.839 42.677-19.945 42.917Q-20.050 43.157-20.248 43.310Q-20.445 43.462-20.703 43.462Q-21.019 43.462-21.271 43.339Q-21.523 43.216-21.662 42.982Q-21.800 42.747-21.800 42.423M-19.121 41.689Q-19.121 41.185-18.865 40.753Q-18.609 40.322-18.173 40.070Q-17.738 39.818-17.238 39.818Q-16.851 39.818-16.509 39.962Q-16.168 40.107-15.906 40.368Q-15.644 40.630-15.502 40.966Q-15.359 41.302-15.359 41.689Q-15.359 42.181-15.623 42.591Q-15.886 43.001-16.316 43.232Q-16.746 43.462-17.238 43.462Q-17.730 43.462-18.164 43.230Q-18.597 42.997-18.859 42.589Q-19.121 42.181-19.121 41.689M-17.238 43.185Q-16.781 43.185-16.529 42.962Q-16.277 42.739-16.189 42.388Q-16.101 42.036-16.101 41.591Q-16.101 41.161-16.195 40.823Q-16.289 40.486-16.543 40.279Q-16.796 40.072-17.238 40.072Q-17.886 40.072-18.130 40.488Q-18.375 40.904-18.375 41.591Q-18.375 42.036-18.287 42.388Q-18.199 42.739-17.947 42.962Q-17.695 43.185-17.238 43.185M-12.945 43.384L-14.800 43.384L-14.800 43.087Q-14.527 43.087-14.359 43.040Q-14.191 42.993-14.191 42.825L-14.191 40.689Q-14.191 40.474-14.254 40.378Q-14.316 40.282-14.435 40.261Q-14.554 40.239-14.800 40.239L-14.800 39.943L-13.609 39.857L-13.609 40.591Q-13.496 40.376-13.302 40.208Q-13.109 40.040-12.871 39.948Q-12.632 39.857-12.379 39.857Q-11.211 39.857-11.211 40.935L-11.211 42.825Q-11.211 42.993-11.041 43.040Q-10.871 43.087-10.601 43.087L-10.601 43.384L-12.457 43.384L-12.457 43.087Q-12.183 43.087-12.015 43.040Q-11.847 42.993-11.847 42.825L-11.847 40.950Q-11.847 40.568-11.968 40.339Q-12.089 40.111-12.441 40.111Q-12.754 40.111-13.007 40.273Q-13.261 40.435-13.408 40.704Q-13.554 40.974-13.554 41.271L-13.554 42.825Q-13.554 42.993-13.384 43.040Q-13.214 43.087-12.945 43.087\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M30.5-2.14c0-14.143-11.465-25.608-25.608-25.608-14.142 0-25.607 11.465-25.607 25.607 0 14.143 11.465 25.608 25.607 25.608 14.143 0 25.608-11.465 25.608-25.608Zm-25.608 0\"\u002F>\u003Cpath stroke=\"none\" d=\"M32.5-2.14a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(70.397 -42.747)\">\u003Cpath d=\"M-33.789 43.384L-34.070 43.384L-34.070 38.665Q-34.070 38.450-34.132 38.355Q-34.195 38.259-34.312 38.238Q-34.429 38.216-34.675 38.216L-34.675 37.919L-33.453 37.833L-33.453 40.322Q-32.976 39.857-32.277 39.857Q-31.796 39.857-31.388 40.101Q-30.980 40.345-30.744 40.759Q-30.507 41.173-30.507 41.657Q-30.507 42.032-30.656 42.361Q-30.804 42.689-31.074 42.941Q-31.343 43.193-31.687 43.327Q-32.031 43.462-32.390 43.462Q-32.711 43.462-33.009 43.314Q-33.308 43.165-33.515 42.904L-33.789 43.384M-33.429 40.712L-33.429 42.552Q-33.277 42.849-33.017 43.029Q-32.757 43.208-32.445 43.208Q-32.019 43.208-31.752 42.989Q-31.484 42.771-31.369 42.425Q-31.254 42.079-31.254 41.657Q-31.254 41.009-31.502 40.560Q-31.750 40.111-32.347 40.111Q-32.683 40.111-32.972 40.269Q-33.261 40.427-33.429 40.712\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(70.397 -42.747)\">\u003Cpath d=\"M-29.745 41.689Q-29.745 41.185-29.489 40.753Q-29.233 40.322-28.797 40.070Q-28.362 39.818-27.862 39.818Q-27.475 39.818-27.133 39.962Q-26.792 40.107-26.530 40.368Q-26.268 40.630-26.126 40.966Q-25.983 41.302-25.983 41.689Q-25.983 42.181-26.247 42.591Q-26.510 43.001-26.940 43.232Q-27.370 43.462-27.862 43.462Q-28.354 43.462-28.788 43.230Q-29.221 42.997-29.483 42.589Q-29.745 42.181-29.745 41.689M-27.862 43.185Q-27.405 43.185-27.153 42.962Q-26.901 42.739-26.813 42.388Q-26.725 42.036-26.725 41.591Q-26.725 41.161-26.819 40.823Q-26.913 40.486-27.167 40.279Q-27.421 40.072-27.862 40.072Q-28.510 40.072-28.754 40.488Q-28.999 40.904-28.999 41.591Q-28.999 42.036-28.911 42.388Q-28.823 42.739-28.571 42.962Q-28.319 43.185-27.862 43.185M-24.815 42.431L-24.815 40.689Q-24.815 40.474-24.878 40.378Q-24.940 40.282-25.059 40.261Q-25.178 40.239-25.424 40.239L-25.424 39.943L-24.178 39.857L-24.178 42.407L-24.178 42.431Q-24.178 42.743-24.124 42.905Q-24.069 43.068-23.919 43.138Q-23.768 43.208-23.448 43.208Q-23.018 43.208-22.745 42.870Q-22.471 42.532-22.471 42.087L-22.471 40.689Q-22.471 40.474-22.534 40.378Q-22.596 40.282-22.715 40.261Q-22.835 40.239-23.081 40.239L-23.081 39.943L-21.835 39.857L-21.835 42.642Q-21.835 42.853-21.772 42.948Q-21.710 43.044-21.590 43.066Q-21.471 43.087-21.225 43.087L-21.225 43.384L-22.448 43.462L-22.448 42.841Q-22.616 43.130-22.897 43.296Q-23.178 43.462-23.499 43.462Q-24.815 43.462-24.815 42.431M-18.850 43.384L-20.706 43.384L-20.706 43.087Q-20.432 43.087-20.264 43.040Q-20.096 42.993-20.096 42.825L-20.096 40.689Q-20.096 40.474-20.159 40.378Q-20.221 40.282-20.340 40.261Q-20.460 40.239-20.706 40.239L-20.706 39.943L-19.514 39.857L-19.514 40.591Q-19.401 40.376-19.208 40.208Q-19.014 40.040-18.776 39.948Q-18.538 39.857-18.284 39.857Q-17.116 39.857-17.116 40.935L-17.116 42.825Q-17.116 42.993-16.946 43.040Q-16.776 43.087-16.506 43.087L-16.506 43.384L-18.362 43.384L-18.362 43.087Q-18.088 43.087-17.921 43.040Q-17.753 42.993-17.753 42.825L-17.753 40.950Q-17.753 40.568-17.874 40.339Q-17.995 40.111-18.346 40.111Q-18.659 40.111-18.913 40.273Q-19.167 40.435-19.313 40.704Q-19.460 40.974-19.460 41.271L-19.460 42.825Q-19.460 42.993-19.290 43.040Q-19.120 43.087-18.850 43.087L-18.850 43.384M-14.245 43.462Q-14.725 43.462-15.133 43.218Q-15.542 42.974-15.780 42.560Q-16.018 42.146-16.018 41.657Q-16.018 41.165-15.760 40.749Q-15.503 40.333-15.071 40.095Q-14.639 39.857-14.147 39.857Q-13.526 39.857-13.077 40.294L-13.077 38.665Q-13.077 38.450-13.139 38.355Q-13.202 38.259-13.319 38.238Q-13.436 38.216-13.682 38.216L-13.682 37.919L-12.460 37.833L-12.460 42.642Q-12.460 42.853-12.397 42.948Q-12.335 43.044-12.217 43.066Q-12.100 43.087-11.850 43.087L-11.850 43.384L-13.100 43.462L-13.100 42.978Q-13.565 43.462-14.245 43.462M-14.178 43.208Q-13.838 43.208-13.546 43.017Q-13.253 42.825-13.100 42.529L-13.100 40.697Q-13.249 40.423-13.510 40.267Q-13.772 40.111-14.085 40.111Q-14.710 40.111-14.993 40.558Q-15.276 41.005-15.276 41.665Q-15.276 42.310-15.024 42.759Q-14.772 43.208-14.178 43.208\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(70.397 -42.747)\">\u003Cpath d=\"M-8.495 41.630Q-8.495 41.150-8.262 40.734Q-8.030 40.318-7.620 40.068Q-7.210 39.818-6.733 39.818Q-6.003 39.818-5.604 40.259Q-5.206 40.700-5.206 41.431Q-5.206 41.536-5.299 41.560L-7.749 41.560L-7.749 41.630Q-7.749 42.040-7.628 42.396Q-7.506 42.751-7.235 42.968Q-6.963 43.185-6.534 43.185Q-6.171 43.185-5.874 42.956Q-5.577 42.728-5.475 42.376Q-5.467 42.329-5.381 42.314L-5.299 42.314Q-5.206 42.341-5.206 42.423Q-5.206 42.431-5.213 42.462Q-5.276 42.689-5.415 42.872Q-5.553 43.056-5.745 43.189Q-5.936 43.322-6.155 43.392Q-6.374 43.462-6.612 43.462Q-6.983 43.462-7.321 43.325Q-7.659 43.189-7.926 42.937Q-8.194 42.685-8.344 42.345Q-8.495 42.005-8.495 41.630M-7.741 41.322L-5.780 41.322Q-5.780 41.017-5.881 40.726Q-5.983 40.435-6.200 40.253Q-6.417 40.072-6.733 40.072Q-7.034 40.072-7.264 40.259Q-7.495 40.447-7.618 40.738Q-7.741 41.029-7.741 41.322M-2.803 43.384L-4.635 43.384L-4.635 43.087Q-4.362 43.087-4.194 43.040Q-4.026 42.993-4.026 42.825L-4.026 38.665Q-4.026 38.450-4.088 38.355Q-4.151 38.259-4.270 38.238Q-4.389 38.216-4.635 38.216L-4.635 37.919L-3.413 37.833L-3.413 42.825Q-3.413 42.993-3.245 43.040Q-3.077 43.087-2.803 43.087L-2.803 43.384M-2.358 41.630Q-2.358 41.150-2.126 40.734Q-1.893 40.318-1.483 40.068Q-1.073 39.818-0.596 39.818Q0.134 39.818 0.533 40.259Q0.931 40.700 0.931 41.431Q0.931 41.536 0.837 41.560L-1.612 41.560L-1.612 41.630Q-1.612 42.040-1.491 42.396Q-1.370 42.751-1.098 42.968Q-0.827 43.185-0.397 43.185Q-0.034 43.185 0.263 42.956Q0.560 42.728 0.662 42.376Q0.669 42.329 0.755 42.314L0.837 42.314Q0.931 42.341 0.931 42.423Q0.931 42.431 0.923 42.462Q0.861 42.689 0.722 42.872Q0.583 43.056 0.392 43.189Q0.201 43.322-0.018 43.392Q-0.237 43.462-0.475 43.462Q-0.846 43.462-1.184 43.325Q-1.522 43.189-1.790 42.937Q-2.057 42.685-2.208 42.345Q-2.358 42.005-2.358 41.630M-1.604 41.322L0.357 41.322Q0.357 41.017 0.255 40.726Q0.154 40.435-0.063 40.253Q-0.280 40.072-0.596 40.072Q-0.897 40.072-1.128 40.259Q-1.358 40.447-1.481 40.738Q-1.604 41.029-1.604 41.322M1.462 41.657Q1.462 41.161 1.712 40.736Q1.962 40.310 2.382 40.064Q2.802 39.818 3.302 39.818Q3.841 39.818 4.232 39.943Q4.622 40.068 4.622 40.482Q4.622 40.587 4.572 40.679Q4.521 40.771 4.429 40.822Q4.337 40.872 4.228 40.872Q4.122 40.872 4.031 40.822Q3.939 40.771 3.888 40.679Q3.837 40.587 3.837 40.482Q3.837 40.259 4.005 40.154Q3.783 40.095 3.310 40.095Q3.013 40.095 2.798 40.234Q2.583 40.372 2.453 40.603Q2.322 40.833 2.263 41.103Q2.204 41.372 2.204 41.657Q2.204 42.052 2.337 42.402Q2.470 42.751 2.742 42.968Q3.013 43.185 3.412 43.185Q3.787 43.185 4.062 42.968Q4.337 42.751 4.439 42.392Q4.454 42.329 4.517 42.329L4.622 42.329Q4.658 42.329 4.683 42.357Q4.708 42.384 4.708 42.423L4.708 42.447Q4.576 42.927 4.191 43.195Q3.806 43.462 3.302 43.462Q2.939 43.462 2.605 43.325Q2.271 43.189 2.011 42.939Q1.751 42.689 1.607 42.353Q1.462 42.017 1.462 41.657M5.822 42.423L5.822 40.232L5.119 40.232L5.119 39.978Q5.474 39.978 5.716 39.745Q5.958 39.513 6.070 39.165Q6.181 38.818 6.181 38.462L6.462 38.462L6.462 39.935L7.638 39.935L7.638 40.232L6.462 40.232L6.462 42.407Q6.462 42.728 6.581 42.956Q6.701 43.185 6.982 43.185Q7.162 43.185 7.279 43.062Q7.396 42.939 7.449 42.759Q7.501 42.579 7.501 42.407L7.501 41.935L7.783 41.935L7.783 42.423Q7.783 42.677 7.677 42.917Q7.572 43.157 7.374 43.310Q7.177 43.462 6.919 43.462Q6.603 43.462 6.351 43.339Q6.099 43.216 5.960 42.982Q5.822 42.747 5.822 42.423M10.509 43.384L8.529 43.384L8.529 43.087Q8.798 43.087 8.966 43.042Q9.134 42.997 9.134 42.825L9.134 40.689Q9.134 40.474 9.072 40.378Q9.009 40.282 8.892 40.261Q8.775 40.239 8.529 40.239L8.529 39.943L9.697 39.857L9.697 40.642Q9.775 40.431 9.927 40.245Q10.079 40.060 10.279 39.958Q10.478 39.857 10.704 39.857Q10.951 39.857 11.142 40.001Q11.333 40.146 11.333 40.376Q11.333 40.532 11.228 40.642Q11.122 40.751 10.966 40.751Q10.810 40.751 10.701 40.642Q10.591 40.532 10.591 40.376Q10.591 40.216 10.697 40.111Q10.372 40.111 10.158 40.339Q9.943 40.568 9.847 40.907Q9.751 41.247 9.751 41.552L9.751 42.825Q9.751 42.993 9.978 43.040Q10.204 43.087 10.509 43.087L10.509 43.384M11.814 41.689Q11.814 41.185 12.070 40.753Q12.326 40.322 12.761 40.070Q13.197 39.818 13.697 39.818Q14.083 39.818 14.425 39.962Q14.767 40.107 15.029 40.368Q15.290 40.630 15.433 40.966Q15.576 41.302 15.576 41.689Q15.576 42.181 15.312 42.591Q15.048 43.001 14.619 43.232Q14.189 43.462 13.697 43.462Q13.204 43.462 12.771 43.230Q12.337 42.997 12.076 42.589Q11.814 42.181 11.814 41.689M13.697 43.185Q14.154 43.185 14.406 42.962Q14.658 42.739 14.746 42.388Q14.833 42.036 14.833 41.591Q14.833 41.161 14.740 40.823Q14.646 40.486 14.392 40.279Q14.138 40.072 13.697 40.072Q13.048 40.072 12.804 40.488Q12.560 40.904 12.560 41.591Q12.560 42.036 12.648 42.388Q12.736 42.739 12.988 42.962Q13.240 43.185 13.697 43.185M17.990 43.384L16.134 43.384L16.134 43.087Q16.408 43.087 16.576 43.040Q16.744 42.993 16.744 42.825L16.744 40.689Q16.744 40.474 16.681 40.378Q16.619 40.282 16.499 40.261Q16.380 40.239 16.134 40.239L16.134 39.943L17.326 39.857L17.326 40.591Q17.439 40.376 17.632 40.208Q17.826 40.040 18.064 39.948Q18.302 39.857 18.556 39.857Q19.724 39.857 19.724 40.935L19.724 42.825Q19.724 42.993 19.894 43.040Q20.064 43.087 20.333 43.087L20.333 43.384L18.478 43.384L18.478 43.087Q18.751 43.087 18.919 43.040Q19.087 42.993 19.087 42.825L19.087 40.950Q19.087 40.568 18.966 40.339Q18.845 40.111 18.494 40.111Q18.181 40.111 17.927 40.273Q17.673 40.435 17.527 40.704Q17.380 40.974 17.380 41.271L17.380 42.825Q17.380 42.993 17.550 43.040Q17.720 43.087 17.990 43.087\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M53.262-2.14c0-26.715-21.655-48.37-48.37-48.37s-48.37 21.655-48.37 48.37 21.656 48.369 48.37 48.369c26.715 0 48.37-21.655 48.37-48.37Zm-48.37 0\" style=\"stroke-dasharray:3.0,2.0\"\u002F>\u003Cpath stroke=\"none\" d=\"M6.892-50.51a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-1.962 -100.405)\">\u003Cpath d=\"M-33.117 43.353L-34.187 40.497Q-34.254 40.318-34.384 40.275Q-34.515 40.232-34.773 40.232L-34.773 39.935L-33.093 39.935L-33.093 40.232Q-33.543 40.232-33.543 40.431Q-33.539 40.447-33.537 40.464Q-33.535 40.482-33.535 40.497L-32.742 42.591L-32.031 40.681Q-32.066 40.587-32.066 40.542Q-32.066 40.497-32.101 40.497Q-32.168 40.318-32.298 40.275Q-32.429 40.232-32.683 40.232L-32.683 39.935L-31.093 39.935L-31.093 40.232Q-31.543 40.232-31.543 40.431Q-31.539 40.450-31.537 40.468Q-31.535 40.486-31.535 40.497L-30.703 42.712L-29.949 40.712Q-29.925 40.654-29.925 40.583Q-29.925 40.423-30.062 40.327Q-30.199 40.232-30.367 40.232L-30.367 39.935L-28.980 39.935L-28.980 40.232Q-29.214 40.232-29.392 40.359Q-29.570 40.486-29.652 40.712L-30.636 43.353Q-30.691 43.462-30.804 43.462L-30.863 43.462Q-30.976 43.462-31.019 43.353L-31.879 41.079L-32.734 43.353Q-32.773 43.462-32.894 43.462L-32.949 43.462Q-33.062 43.462-33.117 43.353\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-1.962 -100.405)\">\u003Cpath d=\"M-28.800 41.630Q-28.800 41.150-28.567 40.734Q-28.335 40.318-27.925 40.068Q-27.515 39.818-27.038 39.818Q-26.308 39.818-25.909 40.259Q-25.511 40.700-25.511 41.431Q-25.511 41.536-25.604 41.560L-28.054 41.560L-28.054 41.630Q-28.054 42.040-27.933 42.396Q-27.811 42.751-27.540 42.968Q-27.268 43.185-26.839 43.185Q-26.476 43.185-26.179 42.956Q-25.882 42.728-25.780 42.376Q-25.772 42.329-25.686 42.314L-25.604 42.314Q-25.511 42.341-25.511 42.423Q-25.511 42.431-25.518 42.462Q-25.581 42.689-25.720 42.872Q-25.858 43.056-26.050 43.189Q-26.241 43.322-26.460 43.392Q-26.679 43.462-26.917 43.462Q-27.288 43.462-27.626 43.325Q-27.964 43.189-28.231 42.937Q-28.499 42.685-28.649 42.345Q-28.800 42.005-28.800 41.630M-28.046 41.322L-26.085 41.322Q-26.085 41.017-26.186 40.726Q-26.288 40.435-26.505 40.253Q-26.722 40.072-27.038 40.072Q-27.339 40.072-27.569 40.259Q-27.800 40.447-27.923 40.738Q-28.046 41.029-28.046 41.322M-24.925 42.552Q-24.925 42.068-24.522 41.773Q-24.120 41.478-23.569 41.359Q-23.018 41.239-22.526 41.239L-22.526 40.950Q-22.526 40.724-22.642 40.517Q-22.757 40.310-22.954 40.191Q-23.151 40.072-23.382 40.072Q-23.808 40.072-24.093 40.177Q-24.022 40.204-23.976 40.259Q-23.929 40.314-23.903 40.384Q-23.878 40.454-23.878 40.529Q-23.878 40.634-23.929 40.726Q-23.979 40.818-24.071 40.868Q-24.163 40.919-24.268 40.919Q-24.374 40.919-24.466 40.868Q-24.558 40.818-24.608 40.726Q-24.659 40.634-24.659 40.529Q-24.659 40.111-24.270 39.964Q-23.882 39.818-23.382 39.818Q-23.050 39.818-22.696 39.948Q-22.343 40.079-22.114 40.333Q-21.886 40.587-21.886 40.935L-21.886 42.736Q-21.886 42.868-21.813 42.978Q-21.741 43.087-21.612 43.087Q-21.487 43.087-21.419 42.982Q-21.351 42.876-21.351 42.736L-21.351 42.224L-21.069 42.224L-21.069 42.736Q-21.069 42.939-21.186 43.097Q-21.304 43.255-21.485 43.339Q-21.667 43.423-21.870 43.423Q-22.101 43.423-22.253 43.251Q-22.405 43.079-22.436 42.849Q-22.597 43.130-22.905 43.296Q-23.214 43.462-23.565 43.462Q-24.077 43.462-24.501 43.239Q-24.925 43.017-24.925 42.552M-24.237 42.552Q-24.237 42.837-24.011 43.023Q-23.784 43.208-23.491 43.208Q-23.245 43.208-23.020 43.091Q-22.796 42.974-22.661 42.771Q-22.526 42.568-22.526 42.314L-22.526 41.482Q-22.792 41.482-23.077 41.536Q-23.362 41.591-23.634 41.720Q-23.905 41.849-24.071 42.056Q-24.237 42.263-24.237 42.552M-18.952 43.384L-20.749 43.384L-20.749 43.087Q-20.479 43.087-20.311 43.042Q-20.143 42.997-20.143 42.825L-20.143 38.665Q-20.143 38.450-20.206 38.355Q-20.268 38.259-20.386 38.238Q-20.503 38.216-20.749 38.216L-20.749 37.919L-19.526 37.833L-19.526 41.599L-18.429 40.712Q-18.222 40.532-18.222 40.384Q-18.222 40.318-18.274 40.275Q-18.327 40.232-18.397 40.232L-18.397 39.935L-16.862 39.935L-16.862 40.232Q-17.393 40.232-17.991 40.712L-18.601 41.208L-17.526 42.607Q-17.390 42.782-17.282 42.890Q-17.175 42.997-17.040 43.042Q-16.905 43.087-16.679 43.087L-16.679 43.384L-18.304 43.384L-18.304 43.087Q-18.061 43.087-18.061 42.935Q-18.061 42.857-18.104 42.786Q-18.147 42.716-18.229 42.607L-19.030 41.560L-19.558 41.986L-19.558 42.825Q-19.558 42.993-19.390 43.040Q-19.222 43.087-18.952 43.087L-18.952 43.384M-14.382 43.384L-16.214 43.384L-16.214 43.087Q-15.940 43.087-15.772 43.040Q-15.604 42.993-15.604 42.825L-15.604 38.665Q-15.604 38.450-15.667 38.355Q-15.729 38.259-15.849 38.238Q-15.968 38.216-16.214 38.216L-16.214 37.919L-14.991 37.833L-14.991 42.825Q-14.991 42.993-14.823 43.040Q-14.655 43.087-14.382 43.087L-14.382 43.384M-13.518 44.681Q-13.405 44.759-13.229 44.759Q-12.940 44.759-12.720 44.546Q-12.499 44.333-12.374 44.032L-12.085 43.384L-13.358 40.497Q-13.440 40.322-13.585 40.277Q-13.729 40.232-13.999 40.232L-13.999 39.935L-12.280 39.935L-12.280 40.232Q-12.702 40.232-12.702 40.415Q-12.702 40.427-12.686 40.497L-11.749 42.622L-10.917 40.712Q-10.878 40.622-10.878 40.544Q-10.878 40.404-10.979 40.318Q-11.081 40.232-11.222 40.232L-11.222 39.935L-9.870 39.935L-9.870 40.232Q-10.124 40.232-10.317 40.357Q-10.511 40.482-10.616 40.712L-12.061 44.032Q-12.175 44.286-12.341 44.509Q-12.507 44.732-12.735 44.874Q-12.964 45.017-13.229 45.017Q-13.526 45.017-13.767 44.825Q-14.007 44.634-14.007 44.345Q-14.007 44.189-13.901 44.087Q-13.796 43.986-13.647 43.986Q-13.542 43.986-13.462 44.032Q-13.382 44.079-13.335 44.157Q-13.288 44.236-13.288 44.345Q-13.288 44.466-13.349 44.554Q-13.409 44.642-13.518 44.681\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-1.962 -100.405)\">\u003Cpath d=\"M-5.692 43.384L-5.973 43.384L-5.973 38.665Q-5.973 38.450-6.035 38.355Q-6.098 38.259-6.215 38.238Q-6.332 38.216-6.578 38.216L-6.578 37.919L-5.356 37.833L-5.356 40.322Q-4.879 39.857-4.180 39.857Q-3.699 39.857-3.291 40.101Q-2.883 40.345-2.647 40.759Q-2.410 41.173-2.410 41.657Q-2.410 42.032-2.559 42.361Q-2.707 42.689-2.977 42.941Q-3.246 43.193-3.590 43.327Q-3.934 43.462-4.293 43.462Q-4.614 43.462-4.912 43.314Q-5.211 43.165-5.418 42.904L-5.692 43.384M-5.332 40.712L-5.332 42.552Q-5.180 42.849-4.920 43.029Q-4.660 43.208-4.348 43.208Q-3.922 43.208-3.655 42.989Q-3.387 42.771-3.272 42.425Q-3.157 42.079-3.157 41.657Q-3.157 41.009-3.405 40.560Q-3.653 40.111-4.250 40.111Q-4.586 40.111-4.875 40.269Q-5.164 40.427-5.332 40.712\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-1.962 -100.405)\">\u003Cpath d=\"M-1.647 41.689Q-1.647 41.185-1.391 40.753Q-1.135 40.322-0.699 40.070Q-0.264 39.818 0.236 39.818Q0.623 39.818 0.965 39.962Q1.306 40.107 1.568 40.368Q1.830 40.630 1.972 40.966Q2.115 41.302 2.115 41.689Q2.115 42.181 1.851 42.591Q1.588 43.001 1.158 43.232Q0.728 43.462 0.236 43.462Q-0.256 43.462-0.690 43.230Q-1.123 42.997-1.385 42.589Q-1.647 42.181-1.647 41.689M0.236 43.185Q0.693 43.185 0.945 42.962Q1.197 42.739 1.285 42.388Q1.373 42.036 1.373 41.591Q1.373 41.161 1.279 40.823Q1.185 40.486 0.931 40.279Q0.678 40.072 0.236 40.072Q-0.412 40.072-0.656 40.488Q-0.901 40.904-0.901 41.591Q-0.901 42.036-0.813 42.388Q-0.725 42.739-0.473 42.962Q-0.221 43.185 0.236 43.185M3.283 42.431L3.283 40.689Q3.283 40.474 3.220 40.378Q3.158 40.282 3.039 40.261Q2.920 40.239 2.674 40.239L2.674 39.943L3.920 39.857L3.920 42.407L3.920 42.431Q3.920 42.743 3.974 42.905Q4.029 43.068 4.179 43.138Q4.330 43.208 4.650 43.208Q5.080 43.208 5.353 42.870Q5.627 42.532 5.627 42.087L5.627 40.689Q5.627 40.474 5.564 40.378Q5.502 40.282 5.383 40.261Q5.263 40.239 5.017 40.239L5.017 39.943L6.263 39.857L6.263 42.642Q6.263 42.853 6.326 42.948Q6.388 43.044 6.508 43.066Q6.627 43.087 6.873 43.087L6.873 43.384L5.650 43.462L5.650 42.841Q5.482 43.130 5.201 43.296Q4.920 43.462 4.599 43.462Q3.283 43.462 3.283 42.431M9.248 43.384L7.392 43.384L7.392 43.087Q7.666 43.087 7.834 43.040Q8.002 42.993 8.002 42.825L8.002 40.689Q8.002 40.474 7.939 40.378Q7.877 40.282 7.758 40.261Q7.638 40.239 7.392 40.239L7.392 39.943L8.584 39.857L8.584 40.591Q8.697 40.376 8.890 40.208Q9.084 40.040 9.322 39.948Q9.560 39.857 9.814 39.857Q10.982 39.857 10.982 40.935L10.982 42.825Q10.982 42.993 11.152 43.040Q11.322 43.087 11.592 43.087L11.592 43.384L9.736 43.384L9.736 43.087Q10.010 43.087 10.178 43.040Q10.345 42.993 10.345 42.825L10.345 40.950Q10.345 40.568 10.224 40.339Q10.103 40.111 9.752 40.111Q9.439 40.111 9.185 40.273Q8.931 40.435 8.785 40.704Q8.638 40.974 8.638 41.271L8.638 42.825Q8.638 42.993 8.808 43.040Q8.978 43.087 9.248 43.087L9.248 43.384M13.853 43.462Q13.373 43.462 12.965 43.218Q12.556 42.974 12.318 42.560Q12.080 42.146 12.080 41.657Q12.080 41.165 12.338 40.749Q12.595 40.333 13.027 40.095Q13.459 39.857 13.951 39.857Q14.572 39.857 15.021 40.294L15.021 38.665Q15.021 38.450 14.959 38.355Q14.896 38.259 14.779 38.238Q14.662 38.216 14.416 38.216L14.416 37.919L15.638 37.833L15.638 42.642Q15.638 42.853 15.701 42.948Q15.763 43.044 15.881 43.066Q15.998 43.087 16.248 43.087L16.248 43.384L14.998 43.462L14.998 42.978Q14.533 43.462 13.853 43.462M13.920 43.208Q14.260 43.208 14.553 43.017Q14.845 42.825 14.998 42.529L14.998 40.697Q14.849 40.423 14.588 40.267Q14.326 40.111 14.013 40.111Q13.388 40.111 13.105 40.558Q12.822 41.005 12.822 41.665Q12.822 42.310 13.074 42.759Q13.326 43.208 13.920 43.208\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-1.962 -100.405)\">\u003Cpath d=\"M19.603 41.630Q19.603 41.150 19.836 40.734Q20.068 40.318 20.478 40.068Q20.888 39.818 21.365 39.818Q22.095 39.818 22.494 40.259Q22.892 40.700 22.892 41.431Q22.892 41.536 22.799 41.560L20.349 41.560L20.349 41.630Q20.349 42.040 20.470 42.396Q20.592 42.751 20.863 42.968Q21.135 43.185 21.564 43.185Q21.927 43.185 22.224 42.956Q22.521 42.728 22.623 42.376Q22.631 42.329 22.717 42.314L22.799 42.314Q22.892 42.341 22.892 42.423Q22.892 42.431 22.885 42.462Q22.822 42.689 22.683 42.872Q22.545 43.056 22.353 43.189Q22.162 43.322 21.943 43.392Q21.724 43.462 21.486 43.462Q21.115 43.462 20.777 43.325Q20.439 43.189 20.172 42.937Q19.904 42.685 19.754 42.345Q19.603 42.005 19.603 41.630M20.357 41.322L22.318 41.322Q22.318 41.017 22.217 40.726Q22.115 40.435 21.898 40.253Q21.681 40.072 21.365 40.072Q21.064 40.072 20.834 40.259Q20.603 40.447 20.480 40.738Q20.357 41.029 20.357 41.322M25.295 43.384L23.463 43.384L23.463 43.087Q23.736 43.087 23.904 43.040Q24.072 42.993 24.072 42.825L24.072 38.665Q24.072 38.450 24.010 38.355Q23.947 38.259 23.828 38.238Q23.709 38.216 23.463 38.216L23.463 37.919L24.685 37.833L24.685 42.825Q24.685 42.993 24.853 43.040Q25.021 43.087 25.295 43.087L25.295 43.384M25.740 41.630Q25.740 41.150 25.972 40.734Q26.205 40.318 26.615 40.068Q27.025 39.818 27.502 39.818Q28.232 39.818 28.631 40.259Q29.029 40.700 29.029 41.431Q29.029 41.536 28.935 41.560L26.486 41.560L26.486 41.630Q26.486 42.040 26.607 42.396Q26.728 42.751 27 42.968Q27.271 43.185 27.701 43.185Q28.064 43.185 28.361 42.956Q28.658 42.728 28.760 42.376Q28.767 42.329 28.853 42.314L28.935 42.314Q29.029 42.341 29.029 42.423Q29.029 42.431 29.021 42.462Q28.959 42.689 28.820 42.872Q28.681 43.056 28.490 43.189Q28.299 43.322 28.080 43.392Q27.861 43.462 27.623 43.462Q27.252 43.462 26.914 43.325Q26.576 43.189 26.308 42.937Q26.041 42.685 25.890 42.345Q25.740 42.005 25.740 41.630M26.494 41.322L28.455 41.322Q28.455 41.017 28.353 40.726Q28.252 40.435 28.035 40.253Q27.818 40.072 27.502 40.072Q27.201 40.072 26.970 40.259Q26.740 40.447 26.617 40.738Q26.494 41.029 26.494 41.322M29.560 41.657Q29.560 41.161 29.810 40.736Q30.060 40.310 30.480 40.064Q30.900 39.818 31.400 39.818Q31.939 39.818 32.330 39.943Q32.720 40.068 32.720 40.482Q32.720 40.587 32.670 40.679Q32.619 40.771 32.527 40.822Q32.435 40.872 32.326 40.872Q32.220 40.872 32.129 40.822Q32.037 40.771 31.986 40.679Q31.935 40.587 31.935 40.482Q31.935 40.259 32.103 40.154Q31.881 40.095 31.408 40.095Q31.111 40.095 30.896 40.234Q30.681 40.372 30.551 40.603Q30.420 40.833 30.361 41.103Q30.302 41.372 30.302 41.657Q30.302 42.052 30.435 42.402Q30.568 42.751 30.840 42.968Q31.111 43.185 31.510 43.185Q31.885 43.185 32.160 42.968Q32.435 42.751 32.537 42.392Q32.552 42.329 32.615 42.329L32.720 42.329Q32.756 42.329 32.781 42.357Q32.806 42.384 32.806 42.423L32.806 42.447Q32.674 42.927 32.289 43.195Q31.904 43.462 31.400 43.462Q31.037 43.462 30.703 43.325Q30.369 43.189 30.109 42.939Q29.849 42.689 29.705 42.353Q29.560 42.017 29.560 41.657M33.920 42.423L33.920 40.232L33.217 40.232L33.217 39.978Q33.572 39.978 33.814 39.745Q34.056 39.513 34.168 39.165Q34.279 38.818 34.279 38.462L34.560 38.462L34.560 39.935L35.736 39.935L35.736 40.232L34.560 40.232L34.560 42.407Q34.560 42.728 34.679 42.956Q34.799 43.185 35.080 43.185Q35.260 43.185 35.377 43.062Q35.494 42.939 35.547 42.759Q35.599 42.579 35.599 42.407L35.599 41.935L35.881 41.935L35.881 42.423Q35.881 42.677 35.775 42.917Q35.670 43.157 35.472 43.310Q35.275 43.462 35.017 43.462Q34.701 43.462 34.449 43.339Q34.197 43.216 34.058 42.982Q33.920 42.747 33.920 42.423M38.607 43.384L36.627 43.384L36.627 43.087Q36.896 43.087 37.064 43.042Q37.232 42.997 37.232 42.825L37.232 40.689Q37.232 40.474 37.170 40.378Q37.107 40.282 36.990 40.261Q36.873 40.239 36.627 40.239L36.627 39.943L37.795 39.857L37.795 40.642Q37.873 40.431 38.025 40.245Q38.177 40.060 38.377 39.958Q38.576 39.857 38.802 39.857Q39.049 39.857 39.240 40.001Q39.431 40.146 39.431 40.376Q39.431 40.532 39.326 40.642Q39.220 40.751 39.064 40.751Q38.908 40.751 38.799 40.642Q38.689 40.532 38.689 40.376Q38.689 40.216 38.795 40.111Q38.470 40.111 38.256 40.339Q38.041 40.568 37.945 40.907Q37.849 41.247 37.849 41.552L37.849 42.825Q37.849 42.993 38.076 43.040Q38.302 43.087 38.607 43.087L38.607 43.384M39.912 41.689Q39.912 41.185 40.168 40.753Q40.424 40.322 40.859 40.070Q41.295 39.818 41.795 39.818Q42.181 39.818 42.523 39.962Q42.865 40.107 43.127 40.368Q43.388 40.630 43.531 40.966Q43.674 41.302 43.674 41.689Q43.674 42.181 43.410 42.591Q43.146 43.001 42.717 43.232Q42.287 43.462 41.795 43.462Q41.302 43.462 40.869 43.230Q40.435 42.997 40.174 42.589Q39.912 42.181 39.912 41.689M41.795 43.185Q42.252 43.185 42.504 42.962Q42.756 42.739 42.844 42.388Q42.931 42.036 42.931 41.591Q42.931 41.161 42.838 40.823Q42.744 40.486 42.490 40.279Q42.236 40.072 41.795 40.072Q41.146 40.072 40.902 40.488Q40.658 40.904 40.658 41.591Q40.658 42.036 40.746 42.388Q40.834 42.739 41.086 42.962Q41.338 43.185 41.795 43.185M46.088 43.384L44.232 43.384L44.232 43.087Q44.506 43.087 44.674 43.040Q44.842 42.993 44.842 42.825L44.842 40.689Q44.842 40.474 44.779 40.378Q44.717 40.282 44.597 40.261Q44.478 40.239 44.232 40.239L44.232 39.943L45.424 39.857L45.424 40.591Q45.537 40.376 45.730 40.208Q45.924 40.040 46.162 39.948Q46.400 39.857 46.654 39.857Q47.822 39.857 47.822 40.935L47.822 42.825Q47.822 42.993 47.992 43.040Q48.162 43.087 48.431 43.087L48.431 43.384L46.576 43.384L46.576 43.087Q46.849 43.087 47.017 43.040Q47.185 42.993 47.185 42.825L47.185 40.950Q47.185 40.568 47.064 40.339Q46.943 40.111 46.592 40.111Q46.279 40.111 46.025 40.273Q45.771 40.435 45.625 40.704Q45.478 40.974 45.478 41.271L45.478 42.825Q45.478 42.993 45.648 43.040Q45.818 43.087 46.088 43.087\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M95.942-50.51 23.15-39.311\"\u002F>\u003Cpath fill=\"none\" d=\"M26.146-35.882c-.9-2.196-2.288-3.084-3.589-3.338 1.164-.633 2.222-1.898 2.42-4.262\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:1.199952\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(134.416 -91.894)\">\u003Cpath d=\"M-32.820 44.935L-34.675 44.935L-34.675 44.642Q-34.406 44.642-34.238 44.597Q-34.070 44.552-34.070 44.376L-34.070 40.552Q-34.070 40.345-34.226 40.292Q-34.382 40.239-34.675 40.239L-34.675 39.943L-33.453 39.857L-33.453 40.322Q-33.222 40.099-32.908 39.978Q-32.593 39.857-32.254 39.857Q-31.781 39.857-31.377 40.103Q-30.972 40.349-30.740 40.765Q-30.507 41.181-30.507 41.657Q-30.507 42.032-30.656 42.361Q-30.804 42.689-31.074 42.941Q-31.343 43.193-31.687 43.327Q-32.031 43.462-32.390 43.462Q-32.679 43.462-32.951 43.341Q-33.222 43.220-33.429 43.009L-33.429 44.376Q-33.429 44.552-33.261 44.597Q-33.093 44.642-32.820 44.642L-32.820 44.935M-33.429 40.720L-33.429 42.560Q-33.277 42.849-33.015 43.029Q-32.754 43.208-32.445 43.208Q-32.160 43.208-31.937 43.070Q-31.714 42.931-31.562 42.700Q-31.410 42.470-31.332 42.198Q-31.254 41.927-31.254 41.657Q-31.254 41.325-31.379 40.968Q-31.504 40.611-31.752 40.374Q-32 40.138-32.347 40.138Q-32.671 40.138-32.966 40.294Q-33.261 40.450-33.429 40.720M-28.054 43.384L-29.910 43.384L-29.910 43.087Q-29.636 43.087-29.468 43.040Q-29.300 42.993-29.300 42.825L-29.300 38.665Q-29.300 38.450-29.363 38.355Q-29.425 38.259-29.545 38.238Q-29.664 38.216-29.910 38.216L-29.910 37.919L-28.687 37.833L-28.687 40.536Q-28.562 40.325-28.375 40.175Q-28.187 40.025-27.961 39.941Q-27.734 39.857-27.488 39.857Q-26.320 39.857-26.320 40.935L-26.320 42.825Q-26.320 42.993-26.150 43.040Q-25.980 43.087-25.711 43.087L-25.711 43.384L-27.566 43.384L-27.566 43.087Q-27.293 43.087-27.125 43.040Q-26.957 42.993-26.957 42.825L-26.957 40.950Q-26.957 40.568-27.078 40.339Q-27.199 40.111-27.550 40.111Q-27.863 40.111-28.117 40.273Q-28.371 40.435-28.517 40.704Q-28.664 40.974-28.664 41.271L-28.664 42.825Q-28.664 42.993-28.494 43.040Q-28.324 43.087-28.054 43.087L-28.054 43.384M-25.265 41.689Q-25.265 41.185-25.009 40.753Q-24.754 40.322-24.318 40.070Q-23.882 39.818-23.382 39.818Q-22.996 39.818-22.654 39.962Q-22.312 40.107-22.050 40.368Q-21.789 40.630-21.646 40.966Q-21.504 41.302-21.504 41.689Q-21.504 42.181-21.767 42.591Q-22.031 43.001-22.461 43.232Q-22.890 43.462-23.382 43.462Q-23.875 43.462-24.308 43.230Q-24.742 42.997-25.004 42.589Q-25.265 42.181-25.265 41.689M-23.382 43.185Q-22.925 43.185-22.673 42.962Q-22.421 42.739-22.334 42.388Q-22.246 42.036-22.246 41.591Q-22.246 41.161-22.339 40.823Q-22.433 40.486-22.687 40.279Q-22.941 40.072-23.382 40.072Q-24.031 40.072-24.275 40.488Q-24.519 40.904-24.519 41.591Q-24.519 42.036-24.431 42.388Q-24.343 42.739-24.091 42.962Q-23.839 43.185-23.382 43.185M-20.394 42.423L-20.394 40.232L-21.097 40.232L-21.097 39.978Q-20.742 39.978-20.500 39.745Q-20.257 39.513-20.146 39.165Q-20.035 38.818-20.035 38.462L-19.754 38.462L-19.754 39.935L-18.578 39.935L-18.578 40.232L-19.754 40.232L-19.754 42.407Q-19.754 42.728-19.634 42.956Q-19.515 43.185-19.234 43.185Q-19.054 43.185-18.937 43.062Q-18.820 42.939-18.767 42.759Q-18.714 42.579-18.714 42.407L-18.714 41.935L-18.433 41.935L-18.433 42.423Q-18.433 42.677-18.539 42.917Q-18.644 43.157-18.841 43.310Q-19.039 43.462-19.296 43.462Q-19.613 43.462-19.865 43.339Q-20.117 43.216-20.255 42.982Q-20.394 42.747-20.394 42.423M-17.714 41.689Q-17.714 41.185-17.459 40.753Q-17.203 40.322-16.767 40.070Q-16.332 39.818-15.832 39.818Q-15.445 39.818-15.103 39.962Q-14.761 40.107-14.500 40.368Q-14.238 40.630-14.095 40.966Q-13.953 41.302-13.953 41.689Q-13.953 42.181-14.216 42.591Q-14.480 43.001-14.910 43.232Q-15.339 43.462-15.832 43.462Q-16.324 43.462-16.757 43.230Q-17.191 42.997-17.453 42.589Q-17.714 42.181-17.714 41.689M-15.832 43.185Q-15.375 43.185-15.123 42.962Q-14.871 42.739-14.783 42.388Q-14.695 42.036-14.695 41.591Q-14.695 41.161-14.789 40.823Q-14.882 40.486-15.136 40.279Q-15.390 40.072-15.832 40.072Q-16.480 40.072-16.724 40.488Q-16.968 40.904-16.968 41.591Q-16.968 42.036-16.880 42.388Q-16.793 42.739-16.541 42.962Q-16.289 43.185-15.832 43.185M-11.539 43.384L-13.394 43.384L-13.394 43.087Q-13.121 43.087-12.953 43.040Q-12.785 42.993-12.785 42.825L-12.785 40.689Q-12.785 40.474-12.847 40.378Q-12.910 40.282-13.029 40.261Q-13.148 40.239-13.394 40.239L-13.394 39.943L-12.203 39.857L-12.203 40.591Q-12.089 40.376-11.896 40.208Q-11.703 40.040-11.464 39.948Q-11.226 39.857-10.972 39.857Q-9.804 39.857-9.804 40.935L-9.804 42.825Q-9.804 42.993-9.634 43.040Q-9.464 43.087-9.195 43.087L-9.195 43.384L-11.050 43.384L-11.050 43.087Q-10.777 43.087-10.609 43.040Q-10.441 42.993-10.441 42.825L-10.441 40.950Q-10.441 40.568-10.562 40.339Q-10.683 40.111-11.035 40.111Q-11.347 40.111-11.601 40.273Q-11.855 40.435-12.002 40.704Q-12.148 40.974-12.148 41.271L-12.148 42.825Q-12.148 42.993-11.978 43.040Q-11.808 43.087-11.539 43.087\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M4.892-50.51-31.37-67.246\"\u002F>\u003Cpath fill=\"none\" d=\"M-30.717-63.506c.36-1.897-.215-3.137-1.016-3.908 1.106.11 2.423-.257 3.633-1.762\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799976\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-30.662 -106.765)\">\u003Cpath d=\"M-32.886 43.462Q-33.367 43.462-33.775 43.218Q-34.183 42.974-34.421 42.560Q-34.660 42.146-34.660 41.657Q-34.660 41.165-34.402 40.749Q-34.144 40.333-33.712 40.095Q-33.281 39.857-32.789 39.857Q-32.168 39.857-31.718 40.294L-31.718 38.665Q-31.718 38.450-31.781 38.355Q-31.843 38.259-31.961 38.238Q-32.078 38.216-32.324 38.216L-32.324 37.919L-31.101 37.833L-31.101 42.642Q-31.101 42.853-31.039 42.948Q-30.976 43.044-30.859 43.066Q-30.742 43.087-30.492 43.087L-30.492 43.384L-31.742 43.462L-31.742 42.978Q-32.207 43.462-32.886 43.462M-32.820 43.208Q-32.480 43.208-32.187 43.017Q-31.894 42.825-31.742 42.529L-31.742 40.697Q-31.890 40.423-32.152 40.267Q-32.414 40.111-32.726 40.111Q-33.351 40.111-33.634 40.558Q-33.918 41.005-33.918 41.665Q-33.918 42.310-33.666 42.759Q-33.414 43.208-32.820 43.208M-29.984 41.630Q-29.984 41.150-29.752 40.734Q-29.519 40.318-29.109 40.068Q-28.699 39.818-28.222 39.818Q-27.492 39.818-27.093 40.259Q-26.695 40.700-26.695 41.431Q-26.695 41.536-26.789 41.560L-29.238 41.560L-29.238 41.630Q-29.238 42.040-29.117 42.396Q-28.996 42.751-28.724 42.968Q-28.453 43.185-28.023 43.185Q-27.660 43.185-27.363 42.956Q-27.066 42.728-26.964 42.376Q-26.957 42.329-26.871 42.314L-26.789 42.314Q-26.695 42.341-26.695 42.423Q-26.695 42.431-26.703 42.462Q-26.765 42.689-26.904 42.872Q-27.043 43.056-27.234 43.189Q-27.425 43.322-27.644 43.392Q-27.863 43.462-28.101 43.462Q-28.472 43.462-28.810 43.325Q-29.148 43.189-29.416 42.937Q-29.683 42.685-29.834 42.345Q-29.984 42.005-29.984 41.630M-29.230 41.322L-27.269 41.322Q-27.269 41.017-27.371 40.726Q-27.472 40.435-27.689 40.253Q-27.906 40.072-28.222 40.072Q-28.523 40.072-28.754 40.259Q-28.984 40.447-29.107 40.738Q-29.230 41.029-29.230 41.322M-25.582 42.423L-25.582 40.232L-26.285 40.232L-26.285 39.978Q-25.929 39.978-25.687 39.745Q-25.445 39.513-25.334 39.165Q-25.222 38.818-25.222 38.462L-24.941 38.462L-24.941 39.935L-23.765 39.935L-23.765 40.232L-24.941 40.232L-24.941 42.407Q-24.941 42.728-24.822 42.956Q-24.703 43.185-24.421 43.185Q-24.242 43.185-24.125 43.062Q-24.007 42.939-23.955 42.759Q-23.902 42.579-23.902 42.407L-23.902 41.935L-23.621 41.935L-23.621 42.423Q-23.621 42.677-23.726 42.917Q-23.832 43.157-24.029 43.310Q-24.226 43.462-24.484 43.462Q-24.800 43.462-25.052 43.339Q-25.304 43.216-25.443 42.982Q-25.582 42.747-25.582 42.423M-22.804 42.552Q-22.804 42.068-22.402 41.773Q-22 41.478-21.449 41.359Q-20.898 41.239-20.406 41.239L-20.406 40.950Q-20.406 40.724-20.521 40.517Q-20.636 40.310-20.834 40.191Q-21.031 40.072-21.261 40.072Q-21.687 40.072-21.972 40.177Q-21.902 40.204-21.855 40.259Q-21.808 40.314-21.783 40.384Q-21.757 40.454-21.757 40.529Q-21.757 40.634-21.808 40.726Q-21.859 40.818-21.951 40.868Q-22.043 40.919-22.148 40.919Q-22.254 40.919-22.345 40.868Q-22.437 40.818-22.488 40.726Q-22.539 40.634-22.539 40.529Q-22.539 40.111-22.150 39.964Q-21.761 39.818-21.261 39.818Q-20.929 39.818-20.576 39.948Q-20.222 40.079-19.994 40.333Q-19.765 40.587-19.765 40.935L-19.765 42.736Q-19.765 42.868-19.693 42.978Q-19.621 43.087-19.492 43.087Q-19.367 43.087-19.298 42.982Q-19.230 42.876-19.230 42.736L-19.230 42.224L-18.949 42.224L-18.949 42.736Q-18.949 42.939-19.066 43.097Q-19.183 43.255-19.365 43.339Q-19.546 43.423-19.750 43.423Q-19.980 43.423-20.132 43.251Q-20.285 43.079-20.316 42.849Q-20.476 43.130-20.785 43.296Q-21.093 43.462-21.445 43.462Q-21.957 43.462-22.380 43.239Q-22.804 43.017-22.804 42.552M-22.117 42.552Q-22.117 42.837-21.890 43.023Q-21.664 43.208-21.371 43.208Q-21.125 43.208-20.900 43.091Q-20.675 42.974-20.541 42.771Q-20.406 42.568-20.406 42.314L-20.406 41.482Q-20.671 41.482-20.957 41.536Q-21.242 41.591-21.513 41.720Q-21.785 41.849-21.951 42.056Q-22.117 42.263-22.117 42.552M-18.613 41.657Q-18.613 41.161-18.363 40.736Q-18.113 40.310-17.693 40.064Q-17.273 39.818-16.773 39.818Q-16.234 39.818-15.843 39.943Q-15.453 40.068-15.453 40.482Q-15.453 40.587-15.504 40.679Q-15.554 40.771-15.646 40.822Q-15.738 40.872-15.847 40.872Q-15.953 40.872-16.045 40.822Q-16.136 40.771-16.187 40.679Q-16.238 40.587-16.238 40.482Q-16.238 40.259-16.070 40.154Q-16.293 40.095-16.765 40.095Q-17.062 40.095-17.277 40.234Q-17.492 40.372-17.623 40.603Q-17.754 40.833-17.812 41.103Q-17.871 41.372-17.871 41.657Q-17.871 42.052-17.738 42.402Q-17.605 42.751-17.334 42.968Q-17.062 43.185-16.664 43.185Q-16.289 43.185-16.013 42.968Q-15.738 42.751-15.636 42.392Q-15.621 42.329-15.558 42.329L-15.453 42.329Q-15.418 42.329-15.392 42.357Q-15.367 42.384-15.367 42.423L-15.367 42.447Q-15.500 42.927-15.884 43.195Q-16.269 43.462-16.773 43.462Q-17.136 43.462-17.470 43.325Q-17.804 43.189-18.064 42.939Q-18.324 42.689-18.468 42.353Q-18.613 42.017-18.613 41.657\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-30.662 -106.765)\">\u003Cpath d=\"M-13.176 43.384L-15.031 43.384L-15.031 43.087Q-14.758 43.087-14.590 43.040Q-14.422 42.993-14.422 42.825L-14.422 38.665Q-14.422 38.450-14.485 38.355Q-14.547 38.259-14.666 38.238Q-14.785 38.216-15.031 38.216L-15.031 37.919L-13.809 37.833L-13.809 40.536Q-13.684 40.325-13.496 40.175Q-13.309 40.025-13.082 39.941Q-12.856 39.857-12.610 39.857Q-11.442 39.857-11.442 40.935L-11.442 42.825Q-11.442 42.993-11.272 43.040Q-11.102 43.087-10.832 43.087L-10.832 43.384L-12.688 43.384L-12.688 43.087Q-12.414 43.087-12.246 43.040Q-12.078 42.993-12.078 42.825L-12.078 40.950Q-12.078 40.568-12.199 40.339Q-12.321 40.111-12.672 40.111Q-12.985 40.111-13.239 40.273Q-13.492 40.435-13.639 40.704Q-13.785 40.974-13.785 41.271L-13.785 42.825Q-13.785 42.993-13.615 43.040Q-13.446 43.087-13.176 43.087L-13.176 43.384M-10.387 41.630Q-10.387 41.150-10.155 40.734Q-9.922 40.318-9.512 40.068Q-9.102 39.818-8.625 39.818Q-7.895 39.818-7.496 40.259Q-7.098 40.700-7.098 41.431Q-7.098 41.536-7.192 41.560L-9.641 41.560L-9.641 41.630Q-9.641 42.040-9.520 42.396Q-9.399 42.751-9.127 42.968Q-8.856 43.185-8.426 43.185Q-8.063 43.185-7.766 42.956Q-7.469 42.728-7.367 42.376Q-7.360 42.329-7.274 42.314L-7.192 42.314Q-7.098 42.341-7.098 42.423Q-7.098 42.431-7.106 42.462Q-7.168 42.689-7.307 42.872Q-7.446 43.056-7.637 43.189Q-7.828 43.322-8.047 43.392Q-8.266 43.462-8.504 43.462Q-8.875 43.462-9.213 43.325Q-9.551 43.189-9.819 42.937Q-10.086 42.685-10.237 42.345Q-10.387 42.005-10.387 41.630M-9.633 41.322L-7.672 41.322Q-7.672 41.017-7.774 40.726Q-7.875 40.435-8.092 40.253Q-8.309 40.072-8.625 40.072Q-8.926 40.072-9.156 40.259Q-9.387 40.447-9.510 40.738Q-9.633 41.029-9.633 41.322M-4.793 43.462Q-5.274 43.462-5.682 43.218Q-6.090 42.974-6.328 42.560Q-6.567 42.146-6.567 41.657Q-6.567 41.165-6.309 40.749Q-6.051 40.333-5.619 40.095Q-5.188 39.857-4.696 39.857Q-4.074 39.857-3.625 40.294L-3.625 38.665Q-3.625 38.450-3.688 38.355Q-3.750 38.259-3.867 38.238Q-3.985 38.216-4.231 38.216L-4.231 37.919L-3.008 37.833L-3.008 42.642Q-3.008 42.853-2.946 42.948Q-2.883 43.044-2.766 43.066Q-2.649 43.087-2.399 43.087L-2.399 43.384L-3.649 43.462L-3.649 42.978Q-4.114 43.462-4.793 43.462M-4.727 43.208Q-4.387 43.208-4.094 43.017Q-3.801 42.825-3.649 42.529L-3.649 40.697Q-3.797 40.423-4.059 40.267Q-4.321 40.111-4.633 40.111Q-5.258 40.111-5.541 40.558Q-5.824 41.005-5.824 41.665Q-5.824 42.310-5.573 42.759Q-5.321 43.208-4.727 43.208\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">In a cool photosphere the negative hydrogen ion, a neutral atom holding a weakly bound extra electron, is photodetached by visible and near-infrared photons and dominates the continuous opacity below about six thousand kelvin.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:410.205px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 307.654 173.182\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-52.145 61.018h238.603\"\u002F>\u003Cpath fill=\"none\" d=\"M184.578 58.618c.38 1.44 1.227 2.12 2.08 2.4-.853.28-1.7.96-2.08 2.4\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(242.536 2)\">\u003Cpath d=\"M-49.840 61.018L-51.825 61.018L-51.825 60.721Q-51.551 60.721-51.383 60.674Q-51.215 60.627-51.215 60.459L-51.215 57.866L-51.856 57.866L-51.856 57.569L-51.215 57.569L-51.215 56.635Q-51.215 56.370-51.098 56.133Q-50.981 55.897-50.788 55.733Q-50.594 55.569-50.346 55.477Q-50.098 55.385-49.833 55.385Q-49.547 55.385-49.323 55.543Q-49.098 55.702-49.098 55.979Q-49.098 56.135-49.204 56.245Q-49.309 56.354-49.473 56.354Q-49.629 56.354-49.739 56.245Q-49.848 56.135-49.848 55.979Q-49.848 55.772-49.688 55.666Q-49.786 55.643-49.879 55.643Q-50.110 55.643-50.282 55.799Q-50.454 55.956-50.540 56.192Q-50.625 56.428-50.625 56.651L-50.625 57.569L-49.657 57.569L-49.657 57.866L-50.602 57.866L-50.602 60.459Q-50.602 60.627-50.375 60.674Q-50.149 60.721-49.840 60.721L-49.840 61.018M-47.305 61.018L-49.286 61.018L-49.286 60.721Q-49.016 60.721-48.848 60.676Q-48.680 60.631-48.680 60.459L-48.680 58.323Q-48.680 58.108-48.743 58.012Q-48.805 57.916-48.922 57.895Q-49.040 57.873-49.286 57.873L-49.286 57.577L-48.118 57.491L-48.118 58.276Q-48.040 58.065-47.887 57.879Q-47.735 57.694-47.536 57.592Q-47.336 57.491-47.110 57.491Q-46.864 57.491-46.672 57.635Q-46.481 57.780-46.481 58.010Q-46.481 58.166-46.586 58.276Q-46.692 58.385-46.848 58.385Q-47.004 58.385-47.114 58.276Q-47.223 58.166-47.223 58.010Q-47.223 57.850-47.118 57.745Q-47.442 57.745-47.657 57.973Q-47.872 58.202-47.967 58.541Q-48.063 58.881-48.063 59.186L-48.063 60.459Q-48.063 60.627-47.836 60.674Q-47.610 60.721-47.305 60.721L-47.305 61.018M-46 59.264Q-46 58.784-45.768 58.368Q-45.536 57.952-45.125 57.702Q-44.715 57.452-44.239 57.452Q-43.508 57.452-43.110 57.893Q-42.711 58.334-42.711 59.065Q-42.711 59.170-42.805 59.194L-45.254 59.194L-45.254 59.264Q-45.254 59.674-45.133 60.030Q-45.012 60.385-44.741 60.602Q-44.469 60.819-44.040 60.819Q-43.676 60.819-43.379 60.590Q-43.083 60.362-42.981 60.010Q-42.973 59.963-42.887 59.948L-42.805 59.948Q-42.711 59.975-42.711 60.057Q-42.711 60.065-42.719 60.096Q-42.782 60.323-42.920 60.506Q-43.059 60.690-43.250 60.823Q-43.442 60.956-43.661 61.026Q-43.879 61.096-44.118 61.096Q-44.489 61.096-44.827 60.959Q-45.165 60.823-45.432 60.571Q-45.700 60.319-45.850 59.979Q-46 59.639-46 59.264M-45.247 58.956L-43.286 58.956Q-43.286 58.651-43.387 58.360Q-43.489 58.069-43.706 57.887Q-43.922 57.706-44.239 57.706Q-44.540 57.706-44.770 57.893Q-45 58.081-45.124 58.372Q-45.247 58.663-45.247 58.956M-38.004 62.569L-39.860 62.569L-39.860 62.276Q-39.590 62.276-39.422 62.231Q-39.254 62.186-39.254 62.010L-39.254 60.561Q-39.458 60.807-39.758 60.952Q-40.059 61.096-40.391 61.096Q-40.875 61.096-41.288 60.854Q-41.700 60.612-41.940 60.200Q-42.180 59.788-42.180 59.291Q-42.180 58.795-41.924 58.381Q-41.668 57.967-41.239 57.729Q-40.809 57.491-40.317 57.491Q-39.961 57.491-39.655 57.670Q-39.348 57.850-39.157 58.163L-38.868 57.491L-38.614 57.491L-38.614 62.010Q-38.614 62.186-38.446 62.231Q-38.278 62.276-38.004 62.276L-38.004 62.569M-40.333 60.842Q-39.965 60.842-39.672 60.610Q-39.379 60.377-39.231 60.018L-39.231 58.682Q-39.325 58.299-39.598 58.036Q-39.872 57.772-40.247 57.772Q-40.606 57.772-40.879 58.002Q-41.153 58.233-41.295 58.590Q-41.438 58.948-41.438 59.299Q-41.438 59.635-41.313 59.997Q-41.188 60.358-40.936 60.600Q-40.684 60.842-40.333 60.842M-37.059 60.065L-37.059 58.323Q-37.059 58.108-37.122 58.012Q-37.184 57.916-37.303 57.895Q-37.422 57.873-37.668 57.873L-37.668 57.577L-36.422 57.491L-36.422 60.041L-36.422 60.065Q-36.422 60.377-36.368 60.539Q-36.313 60.702-36.163 60.772Q-36.012 60.842-35.692 60.842Q-35.262 60.842-34.989 60.504Q-34.715 60.166-34.715 59.721L-34.715 58.323Q-34.715 58.108-34.778 58.012Q-34.840 57.916-34.959 57.895Q-35.079 57.873-35.325 57.873L-35.325 57.577L-34.079 57.491L-34.079 60.276Q-34.079 60.487-34.016 60.582Q-33.954 60.678-33.834 60.700Q-33.715 60.721-33.469 60.721L-33.469 61.018L-34.692 61.096L-34.692 60.475Q-34.860 60.764-35.141 60.930Q-35.422 61.096-35.743 61.096Q-37.059 61.096-37.059 60.065M-33.024 59.264Q-33.024 58.784-32.791 58.368Q-32.559 57.952-32.149 57.702Q-31.739 57.452-31.262 57.452Q-30.532 57.452-30.133 57.893Q-29.735 58.334-29.735 59.065Q-29.735 59.170-29.829 59.194L-32.278 59.194L-32.278 59.264Q-32.278 59.674-32.157 60.030Q-32.036 60.385-31.764 60.602Q-31.493 60.819-31.063 60.819Q-30.700 60.819-30.403 60.590Q-30.106 60.362-30.004 60.010Q-29.997 59.963-29.911 59.948L-29.829 59.948Q-29.735 59.975-29.735 60.057Q-29.735 60.065-29.743 60.096Q-29.805 60.323-29.944 60.506Q-30.083 60.690-30.274 60.823Q-30.465 60.956-30.684 61.026Q-30.903 61.096-31.141 61.096Q-31.512 61.096-31.850 60.959Q-32.188 60.823-32.456 60.571Q-32.723 60.319-32.874 59.979Q-33.024 59.639-33.024 59.264M-32.270 58.956L-30.309 58.956Q-30.309 58.651-30.411 58.360Q-30.512 58.069-30.729 57.887Q-30.946 57.706-31.262 57.706Q-31.563 57.706-31.793 57.893Q-32.024 58.081-32.147 58.372Q-32.270 58.663-32.270 58.956M-27.317 61.018L-29.172 61.018L-29.172 60.721Q-28.899 60.721-28.731 60.674Q-28.563 60.627-28.563 60.459L-28.563 58.323Q-28.563 58.108-28.625 58.012Q-28.688 57.916-28.807 57.895Q-28.926 57.873-29.172 57.873L-29.172 57.577L-27.981 57.491L-27.981 58.225Q-27.868 58.010-27.674 57.842Q-27.481 57.674-27.243 57.582Q-27.004 57.491-26.750 57.491Q-25.583 57.491-25.583 58.569L-25.583 60.459Q-25.583 60.627-25.413 60.674Q-25.243 60.721-24.973 60.721L-24.973 61.018L-26.829 61.018L-26.829 60.721Q-26.555 60.721-26.387 60.674Q-26.219 60.627-26.219 60.459L-26.219 58.584Q-26.219 58.202-26.340 57.973Q-26.461 57.745-26.813 57.745Q-27.125 57.745-27.379 57.907Q-27.633 58.069-27.780 58.338Q-27.926 58.608-27.926 58.905L-27.926 60.459Q-27.926 60.627-27.756 60.674Q-27.586 60.721-27.317 60.721L-27.317 61.018M-24.485 59.291Q-24.485 58.795-24.235 58.370Q-23.985 57.944-23.565 57.698Q-23.145 57.452-22.645 57.452Q-22.106 57.452-21.715 57.577Q-21.325 57.702-21.325 58.116Q-21.325 58.221-21.375 58.313Q-21.426 58.405-21.518 58.456Q-21.610 58.506-21.719 58.506Q-21.825 58.506-21.916 58.456Q-22.008 58.405-22.059 58.313Q-22.110 58.221-22.110 58.116Q-22.110 57.893-21.942 57.788Q-22.165 57.729-22.637 57.729Q-22.934 57.729-23.149 57.868Q-23.364 58.006-23.495 58.237Q-23.625 58.467-23.684 58.737Q-23.743 59.006-23.743 59.291Q-23.743 59.686-23.610 60.036Q-23.477 60.385-23.206 60.602Q-22.934 60.819-22.536 60.819Q-22.161 60.819-21.885 60.602Q-21.610 60.385-21.508 60.026Q-21.493 59.963-21.430 59.963L-21.325 59.963Q-21.290 59.963-21.264 59.991Q-21.239 60.018-21.239 60.057L-21.239 60.081Q-21.372 60.561-21.756 60.829Q-22.141 61.096-22.645 61.096Q-23.008 61.096-23.342 60.959Q-23.676 60.823-23.936 60.573Q-24.196 60.323-24.340 59.987Q-24.485 59.651-24.485 59.291M-20.333 62.315Q-20.219 62.393-20.043 62.393Q-19.754 62.393-19.534 62.180Q-19.313 61.967-19.188 61.666L-18.899 61.018L-20.172 58.131Q-20.254 57.956-20.399 57.911Q-20.543 57.866-20.813 57.866L-20.813 57.569L-19.094 57.569L-19.094 57.866Q-19.516 57.866-19.516 58.049Q-19.516 58.061-19.500 58.131L-18.563 60.256L-17.731 58.346Q-17.692 58.256-17.692 58.178Q-17.692 58.038-17.793 57.952Q-17.895 57.866-18.036 57.866L-18.036 57.569L-16.684 57.569L-16.684 57.866Q-16.938 57.866-17.131 57.991Q-17.325 58.116-17.430 58.346L-18.875 61.666Q-18.989 61.920-19.155 62.143Q-19.321 62.366-19.549 62.508Q-19.778 62.651-20.043 62.651Q-20.340 62.651-20.581 62.459Q-20.821 62.268-20.821 61.979Q-20.821 61.823-20.715 61.721Q-20.610 61.620-20.461 61.620Q-20.356 61.620-20.276 61.666Q-20.196 61.713-20.149 61.791Q-20.102 61.870-20.102 61.979Q-20.102 62.100-20.163 62.188Q-20.223 62.276-20.333 62.315\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-52.145 61.018V-58.083\"\u002F>\u003Cpath fill=\"none\" d=\"M-54.545-56.203c1.44-.38 2.12-1.227 2.4-2.08.28.853.96 1.7 2.4 2.08\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-13.459 -124.59)\">\u003Cpath d=\"M-51.907 59.323Q-51.907 58.819-51.651 58.387Q-51.395 57.956-50.959 57.704Q-50.524 57.452-50.024 57.452Q-49.637 57.452-49.295 57.596Q-48.954 57.741-48.692 58.002Q-48.430 58.264-48.288 58.600Q-48.145 58.936-48.145 59.323Q-48.145 59.815-48.409 60.225Q-48.672 60.635-49.102 60.866Q-49.532 61.096-50.024 61.096Q-50.516 61.096-50.950 60.864Q-51.383 60.631-51.645 60.223Q-51.907 59.815-51.907 59.323M-50.024 60.819Q-49.567 60.819-49.315 60.596Q-49.063 60.373-48.975 60.022Q-48.887 59.670-48.887 59.225Q-48.887 58.795-48.981 58.457Q-49.075 58.120-49.329 57.913Q-49.583 57.706-50.024 57.706Q-50.672 57.706-50.916 58.122Q-51.161 58.538-51.161 59.225Q-51.161 59.670-51.073 60.022Q-50.985 60.373-50.733 60.596Q-50.481 60.819-50.024 60.819M-45.778 62.569L-47.633 62.569L-47.633 62.276Q-47.364 62.276-47.196 62.231Q-47.028 62.186-47.028 62.010L-47.028 58.186Q-47.028 57.979-47.184 57.926Q-47.340 57.873-47.633 57.873L-47.633 57.577L-46.411 57.491L-46.411 57.956Q-46.180 57.733-45.866 57.612Q-45.551 57.491-45.211 57.491Q-44.739 57.491-44.334 57.737Q-43.930 57.983-43.698 58.399Q-43.465 58.815-43.465 59.291Q-43.465 59.666-43.614 59.995Q-43.762 60.323-44.032 60.575Q-44.301 60.827-44.645 60.961Q-44.989 61.096-45.348 61.096Q-45.637 61.096-45.909 60.975Q-46.180 60.854-46.387 60.643L-46.387 62.010Q-46.387 62.186-46.219 62.231Q-46.051 62.276-45.778 62.276L-45.778 62.569M-46.387 58.354L-46.387 60.194Q-46.235 60.483-45.973 60.663Q-45.711 60.842-45.403 60.842Q-45.118 60.842-44.895 60.704Q-44.672 60.565-44.520 60.334Q-44.368 60.104-44.290 59.832Q-44.211 59.561-44.211 59.291Q-44.211 58.959-44.336 58.602Q-44.461 58.245-44.709 58.008Q-44.958 57.772-45.305 57.772Q-45.629 57.772-45.924 57.928Q-46.219 58.084-46.387 58.354M-42.844 60.186Q-42.844 59.702-42.442 59.407Q-42.040 59.112-41.489 58.993Q-40.938 58.873-40.446 58.873L-40.446 58.584Q-40.446 58.358-40.561 58.151Q-40.676 57.944-40.874 57.825Q-41.071 57.706-41.301 57.706Q-41.727 57.706-42.012 57.811Q-41.942 57.838-41.895 57.893Q-41.848 57.948-41.823 58.018Q-41.797 58.088-41.797 58.163Q-41.797 58.268-41.848 58.360Q-41.899 58.452-41.991 58.502Q-42.083 58.553-42.188 58.553Q-42.293 58.553-42.385 58.502Q-42.477 58.452-42.528 58.360Q-42.579 58.268-42.579 58.163Q-42.579 57.745-42.190 57.598Q-41.801 57.452-41.301 57.452Q-40.969 57.452-40.616 57.582Q-40.262 57.713-40.034 57.967Q-39.805 58.221-39.805 58.569L-39.805 60.370Q-39.805 60.502-39.733 60.612Q-39.661 60.721-39.532 60.721Q-39.407 60.721-39.338 60.616Q-39.270 60.510-39.270 60.370L-39.270 59.858L-38.989 59.858L-38.989 60.370Q-38.989 60.573-39.106 60.731Q-39.223 60.889-39.405 60.973Q-39.586 61.057-39.790 61.057Q-40.020 61.057-40.172 60.885Q-40.325 60.713-40.356 60.483Q-40.516 60.764-40.825 60.930Q-41.133 61.096-41.485 61.096Q-41.997 61.096-42.420 60.873Q-42.844 60.651-42.844 60.186M-42.157 60.186Q-42.157 60.471-41.930 60.657Q-41.704 60.842-41.411 60.842Q-41.165 60.842-40.940 60.725Q-40.715 60.608-40.581 60.405Q-40.446 60.202-40.446 59.948L-40.446 59.116Q-40.711 59.116-40.997 59.170Q-41.282 59.225-41.553 59.354Q-41.825 59.483-41.991 59.690Q-42.157 59.897-42.157 60.186M-38.653 59.291Q-38.653 58.795-38.403 58.370Q-38.153 57.944-37.733 57.698Q-37.313 57.452-36.813 57.452Q-36.274 57.452-35.883 57.577Q-35.493 57.702-35.493 58.116Q-35.493 58.221-35.543 58.313Q-35.594 58.405-35.686 58.456Q-35.778 58.506-35.887 58.506Q-35.993 58.506-36.084 58.456Q-36.176 58.405-36.227 58.313Q-36.278 58.221-36.278 58.116Q-36.278 57.893-36.110 57.788Q-36.333 57.729-36.805 57.729Q-37.102 57.729-37.317 57.868Q-37.532 58.006-37.663 58.237Q-37.793 58.467-37.852 58.737Q-37.911 59.006-37.911 59.291Q-37.911 59.686-37.778 60.036Q-37.645 60.385-37.374 60.602Q-37.102 60.819-36.704 60.819Q-36.329 60.819-36.053 60.602Q-35.778 60.385-35.676 60.026Q-35.661 59.963-35.598 59.963L-35.493 59.963Q-35.458 59.963-35.432 59.991Q-35.407 60.018-35.407 60.057L-35.407 60.081Q-35.540 60.561-35.924 60.829Q-36.309 61.096-36.813 61.096Q-37.176 61.096-37.510 60.959Q-37.844 60.823-38.104 60.573Q-38.364 60.323-38.508 59.987Q-38.653 59.651-38.653 59.291M-33.059 61.018L-34.836 61.018L-34.836 60.721Q-34.563 60.721-34.395 60.674Q-34.227 60.627-34.227 60.459L-34.227 58.323Q-34.227 58.108-34.284 58.012Q-34.340 57.916-34.454 57.895Q-34.567 57.873-34.813 57.873L-34.813 57.577L-33.614 57.491L-33.614 60.459Q-33.614 60.627-33.467 60.674Q-33.321 60.721-33.059 60.721L-33.059 61.018M-34.500 56.096Q-34.500 55.905-34.366 55.774Q-34.231 55.643-34.036 55.643Q-33.915 55.643-33.811 55.706Q-33.708 55.768-33.645 55.872Q-33.583 55.975-33.583 56.096Q-33.583 56.291-33.713 56.426Q-33.844 56.561-34.036 56.561Q-34.235 56.561-34.368 56.428Q-34.500 56.295-34.500 56.096M-31.934 60.057L-31.934 57.866L-32.637 57.866L-32.637 57.612Q-32.282 57.612-32.040 57.379Q-31.797 57.147-31.686 56.799Q-31.575 56.452-31.575 56.096L-31.293 56.096L-31.293 57.569L-30.118 57.569L-30.118 57.866L-31.293 57.866L-31.293 60.041Q-31.293 60.362-31.174 60.590Q-31.055 60.819-30.774 60.819Q-30.594 60.819-30.477 60.696Q-30.360 60.573-30.307 60.393Q-30.254 60.213-30.254 60.041L-30.254 59.569L-29.973 59.569L-29.973 60.057Q-29.973 60.311-30.079 60.551Q-30.184 60.791-30.381 60.944Q-30.579 61.096-30.836 61.096Q-31.153 61.096-31.405 60.973Q-31.657 60.850-31.795 60.616Q-31.934 60.381-31.934 60.057\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-13.459 -124.59)\">\u003Cpath d=\"M-29.058 62.315Q-28.944 62.393-28.769 62.393Q-28.480 62.393-28.259 62.180Q-28.038 61.967-27.913 61.666L-27.624 61.018L-28.898 58.131Q-28.980 57.956-29.124 57.911Q-29.269 57.866-29.538 57.866L-29.538 57.569L-27.819 57.569L-27.819 57.866Q-28.241 57.866-28.241 58.049Q-28.241 58.061-28.226 58.131L-27.288 60.256L-26.456 58.346Q-26.417 58.256-26.417 58.178Q-26.417 58.038-26.519 57.952Q-26.620 57.866-26.761 57.866L-26.761 57.569L-25.409 57.569L-25.409 57.866Q-25.663 57.866-25.857 57.991Q-26.050 58.116-26.155 58.346L-27.601 61.666Q-27.714 61.920-27.880 62.143Q-28.046 62.366-28.275 62.508Q-28.503 62.651-28.769 62.651Q-29.066 62.651-29.306 62.459Q-29.546 62.268-29.546 61.979Q-29.546 61.823-29.441 61.721Q-29.335 61.620-29.187 61.620Q-29.081 61.620-29.001 61.666Q-28.921 61.713-28.874 61.791Q-28.827 61.870-28.827 61.979Q-28.827 62.100-28.888 62.188Q-28.948 62.276-29.058 62.315\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-40.764-7.268C-6.621-4.423 10.45 43.946 27.523 43.946c17.071 0 22.762-45.524 39.833-45.524h11.382v-45.524h8.535v45.524c19.917 0 42.68-5.69 88.204-8.536\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(42.803 -6.56)\">\u003Cpath d=\"M-51.282 60.057L-51.282 57.866L-51.985 57.866L-51.985 57.612Q-51.629 57.612-51.387 57.379Q-51.145 57.147-51.034 56.799Q-50.922 56.452-50.922 56.096L-50.641 56.096L-50.641 57.569L-49.465 57.569L-49.465 57.866L-50.641 57.866L-50.641 60.041Q-50.641 60.362-50.522 60.590Q-50.403 60.819-50.122 60.819Q-49.942 60.819-49.825 60.696Q-49.708 60.573-49.655 60.393Q-49.602 60.213-49.602 60.041L-49.602 59.569L-49.321 59.569L-49.321 60.057Q-49.321 60.311-49.426 60.551Q-49.532 60.791-49.729 60.944Q-49.926 61.096-50.184 61.096Q-50.500 61.096-50.752 60.973Q-51.004 60.850-51.143 60.616Q-51.282 60.381-51.282 60.057M-46.594 61.018L-48.575 61.018L-48.575 60.721Q-48.305 60.721-48.137 60.676Q-47.969 60.631-47.969 60.459L-47.969 58.323Q-47.969 58.108-48.032 58.012Q-48.094 57.916-48.211 57.895Q-48.329 57.873-48.575 57.873L-48.575 57.577L-47.407 57.491L-47.407 58.276Q-47.329 58.065-47.176 57.879Q-47.024 57.694-46.825 57.592Q-46.625 57.491-46.399 57.491Q-46.153 57.491-45.961 57.635Q-45.770 57.780-45.770 58.010Q-45.770 58.166-45.875 58.276Q-45.981 58.385-46.137 58.385Q-46.293 58.385-46.403 58.276Q-46.512 58.166-46.512 58.010Q-46.512 57.850-46.407 57.745Q-46.731 57.745-46.946 57.973Q-47.161 58.202-47.256 58.541Q-47.352 58.881-47.352 59.186L-47.352 60.459Q-47.352 60.627-47.125 60.674Q-46.899 60.721-46.594 60.721L-46.594 61.018M-45.192 60.186Q-45.192 59.702-44.790 59.407Q-44.387 59.112-43.836 58.993Q-43.286 58.873-42.793 58.873L-42.793 58.584Q-42.793 58.358-42.909 58.151Q-43.024 57.944-43.221 57.825Q-43.418 57.706-43.649 57.706Q-44.075 57.706-44.360 57.811Q-44.290 57.838-44.243 57.893Q-44.196 57.948-44.170 58.018Q-44.145 58.088-44.145 58.163Q-44.145 58.268-44.196 58.360Q-44.247 58.452-44.338 58.502Q-44.430 58.553-44.536 58.553Q-44.641 58.553-44.733 58.502Q-44.825 58.452-44.875 58.360Q-44.926 58.268-44.926 58.163Q-44.926 57.745-44.538 57.598Q-44.149 57.452-43.649 57.452Q-43.317 57.452-42.963 57.582Q-42.610 57.713-42.381 57.967Q-42.153 58.221-42.153 58.569L-42.153 60.370Q-42.153 60.502-42.081 60.612Q-42.008 60.721-41.879 60.721Q-41.754 60.721-41.686 60.616Q-41.618 60.510-41.618 60.370L-41.618 59.858L-41.336 59.858L-41.336 60.370Q-41.336 60.573-41.454 60.731Q-41.571 60.889-41.752 60.973Q-41.934 61.057-42.137 61.057Q-42.368 61.057-42.520 60.885Q-42.672 60.713-42.704 60.483Q-42.864 60.764-43.172 60.930Q-43.481 61.096-43.833 61.096Q-44.344 61.096-44.768 60.873Q-45.192 60.651-45.192 60.186M-44.504 60.186Q-44.504 60.471-44.278 60.657Q-44.051 60.842-43.758 60.842Q-43.512 60.842-43.288 60.725Q-43.063 60.608-42.928 60.405Q-42.793 60.202-42.793 59.948L-42.793 59.116Q-43.059 59.116-43.344 59.170Q-43.629 59.225-43.901 59.354Q-44.172 59.483-44.338 59.690Q-44.504 59.897-44.504 60.186M-39.114 61.018L-40.969 61.018L-40.969 60.721Q-40.696 60.721-40.528 60.674Q-40.360 60.627-40.360 60.459L-40.360 58.323Q-40.360 58.108-40.422 58.012Q-40.485 57.916-40.604 57.895Q-40.723 57.873-40.969 57.873L-40.969 57.577L-39.778 57.491L-39.778 58.225Q-39.665 58.010-39.471 57.842Q-39.278 57.674-39.040 57.582Q-38.801 57.491-38.547 57.491Q-37.379 57.491-37.379 58.569L-37.379 60.459Q-37.379 60.627-37.209 60.674Q-37.040 60.721-36.770 60.721L-36.770 61.018L-38.625 61.018L-38.625 60.721Q-38.352 60.721-38.184 60.674Q-38.016 60.627-38.016 60.459L-38.016 58.584Q-38.016 58.202-38.137 57.973Q-38.258 57.745-38.610 57.745Q-38.922 57.745-39.176 57.907Q-39.430 58.069-39.577 58.338Q-39.723 58.608-39.723 58.905L-39.723 60.459Q-39.723 60.627-39.553 60.674Q-39.383 60.721-39.114 60.721L-39.114 61.018M-36.282 61.010L-36.282 59.788Q-36.282 59.760-36.250 59.729Q-36.219 59.698-36.196 59.698L-36.090 59.698Q-36.020 59.698-36.004 59.760Q-35.942 60.081-35.803 60.321Q-35.665 60.561-35.432 60.702Q-35.200 60.842-34.891 60.842Q-34.653 60.842-34.444 60.782Q-34.235 60.721-34.098 60.573Q-33.961 60.424-33.961 60.178Q-33.961 59.924-34.172 59.758Q-34.383 59.592-34.653 59.538L-35.274 59.424Q-35.680 59.346-35.981 59.090Q-36.282 58.834-36.282 58.459Q-36.282 58.092-36.081 57.870Q-35.879 57.647-35.555 57.549Q-35.231 57.452-34.891 57.452Q-34.426 57.452-34.129 57.659L-33.907 57.475Q-33.883 57.452-33.852 57.452L-33.801 57.452Q-33.770 57.452-33.743 57.479Q-33.715 57.506-33.715 57.538L-33.715 58.522Q-33.715 58.553-33.741 58.582Q-33.766 58.612-33.801 58.612L-33.907 58.612Q-33.942 58.612-33.969 58.584Q-33.997 58.557-33.997 58.522Q-33.997 58.123-34.249 57.903Q-34.500 57.682-34.899 57.682Q-35.254 57.682-35.538 57.805Q-35.821 57.928-35.821 58.233Q-35.821 58.452-35.620 58.584Q-35.418 58.717-35.172 58.760L-34.547 58.873Q-34.118 58.963-33.809 59.260Q-33.500 59.557-33.500 59.971Q-33.500 60.541-33.899 60.819Q-34.297 61.096-34.891 61.096Q-35.442 61.096-35.793 60.760L-36.090 61.073Q-36.114 61.096-36.149 61.096L-36.196 61.096Q-36.219 61.096-36.250 61.065Q-36.282 61.034-36.282 61.010M-31.090 62.569L-32.946 62.569L-32.946 62.276Q-32.676 62.276-32.508 62.231Q-32.340 62.186-32.340 62.010L-32.340 58.186Q-32.340 57.979-32.497 57.926Q-32.653 57.873-32.946 57.873L-32.946 57.577L-31.723 57.491L-31.723 57.956Q-31.493 57.733-31.178 57.612Q-30.864 57.491-30.524 57.491Q-30.051 57.491-29.647 57.737Q-29.243 57.983-29.010 58.399Q-28.778 58.815-28.778 59.291Q-28.778 59.666-28.926 59.995Q-29.075 60.323-29.344 60.575Q-29.614 60.827-29.958 60.961Q-30.301 61.096-30.661 61.096Q-30.950 61.096-31.221 60.975Q-31.493 60.854-31.700 60.643L-31.700 62.010Q-31.700 62.186-31.532 62.231Q-31.364 62.276-31.090 62.276L-31.090 62.569M-31.700 58.354L-31.700 60.194Q-31.547 60.483-31.286 60.663Q-31.024 60.842-30.715 60.842Q-30.430 60.842-30.208 60.704Q-29.985 60.565-29.833 60.334Q-29.680 60.104-29.602 59.832Q-29.524 59.561-29.524 59.291Q-29.524 58.959-29.649 58.602Q-29.774 58.245-30.022 58.008Q-30.270 57.772-30.618 57.772Q-30.942 57.772-31.237 57.928Q-31.532 58.084-31.700 58.354M-28.157 60.186Q-28.157 59.702-27.754 59.407Q-27.352 59.112-26.801 58.993Q-26.250 58.873-25.758 58.873L-25.758 58.584Q-25.758 58.358-25.874 58.151Q-25.989 57.944-26.186 57.825Q-26.383 57.706-26.614 57.706Q-27.040 57.706-27.325 57.811Q-27.254 57.838-27.208 57.893Q-27.161 57.948-27.135 58.018Q-27.110 58.088-27.110 58.163Q-27.110 58.268-27.161 58.360Q-27.211 58.452-27.303 58.502Q-27.395 58.553-27.500 58.553Q-27.606 58.553-27.698 58.502Q-27.790 58.452-27.840 58.360Q-27.891 58.268-27.891 58.163Q-27.891 57.745-27.502 57.598Q-27.114 57.452-26.614 57.452Q-26.282 57.452-25.928 57.582Q-25.575 57.713-25.346 57.967Q-25.118 58.221-25.118 58.569L-25.118 60.370Q-25.118 60.502-25.045 60.612Q-24.973 60.721-24.844 60.721Q-24.719 60.721-24.651 60.616Q-24.583 60.510-24.583 60.370L-24.583 59.858L-24.301 59.858L-24.301 60.370Q-24.301 60.573-24.418 60.731Q-24.536 60.889-24.717 60.973Q-24.899 61.057-25.102 61.057Q-25.333 61.057-25.485 60.885Q-25.637 60.713-25.668 60.483Q-25.829 60.764-26.137 60.930Q-26.446 61.096-26.797 61.096Q-27.309 61.096-27.733 60.873Q-28.157 60.651-28.157 60.186M-27.469 60.186Q-27.469 60.471-27.243 60.657Q-27.016 60.842-26.723 60.842Q-26.477 60.842-26.252 60.725Q-26.028 60.608-25.893 60.405Q-25.758 60.202-25.758 59.948L-25.758 59.116Q-26.024 59.116-26.309 59.170Q-26.594 59.225-26.866 59.354Q-27.137 59.483-27.303 59.690Q-27.469 59.897-27.469 60.186M-22 61.018L-23.981 61.018L-23.981 60.721Q-23.711 60.721-23.543 60.676Q-23.375 60.631-23.375 60.459L-23.375 58.323Q-23.375 58.108-23.438 58.012Q-23.500 57.916-23.618 57.895Q-23.735 57.873-23.981 57.873L-23.981 57.577L-22.813 57.491L-22.813 58.276Q-22.735 58.065-22.583 57.879Q-22.430 57.694-22.231 57.592Q-22.032 57.491-21.805 57.491Q-21.559 57.491-21.368 57.635Q-21.176 57.780-21.176 58.010Q-21.176 58.166-21.282 58.276Q-21.387 58.385-21.543 58.385Q-21.700 58.385-21.809 58.276Q-21.918 58.166-21.918 58.010Q-21.918 57.850-21.813 57.745Q-22.137 57.745-22.352 57.973Q-22.567 58.202-22.663 58.541Q-22.758 58.881-22.758 59.186L-22.758 60.459Q-22.758 60.627-22.532 60.674Q-22.305 60.721-22 60.721L-22 61.018M-20.696 59.264Q-20.696 58.784-20.463 58.368Q-20.231 57.952-19.821 57.702Q-19.411 57.452-18.934 57.452Q-18.204 57.452-17.805 57.893Q-17.407 58.334-17.407 59.065Q-17.407 59.170-17.500 59.194L-19.950 59.194L-19.950 59.264Q-19.950 59.674-19.829 60.030Q-19.708 60.385-19.436 60.602Q-19.165 60.819-18.735 60.819Q-18.372 60.819-18.075 60.590Q-17.778 60.362-17.676 60.010Q-17.668 59.963-17.583 59.948L-17.500 59.948Q-17.407 59.975-17.407 60.057Q-17.407 60.065-17.415 60.096Q-17.477 60.323-17.616 60.506Q-17.754 60.690-17.946 60.823Q-18.137 60.956-18.356 61.026Q-18.575 61.096-18.813 61.096Q-19.184 61.096-19.522 60.959Q-19.860 60.823-20.127 60.571Q-20.395 60.319-20.545 59.979Q-20.696 59.639-20.696 59.264M-19.942 58.956L-17.981 58.956Q-17.981 58.651-18.083 58.360Q-18.184 58.069-18.401 57.887Q-18.618 57.706-18.934 57.706Q-19.235 57.706-19.465 57.893Q-19.696 58.081-19.819 58.372Q-19.942 58.663-19.942 58.956M-14.989 61.018L-16.844 61.018L-16.844 60.721Q-16.571 60.721-16.403 60.674Q-16.235 60.627-16.235 60.459L-16.235 58.323Q-16.235 58.108-16.297 58.012Q-16.360 57.916-16.479 57.895Q-16.598 57.873-16.844 57.873L-16.844 57.577L-15.653 57.491L-15.653 58.225Q-15.540 58.010-15.346 57.842Q-15.153 57.674-14.915 57.582Q-14.676 57.491-14.422 57.491Q-13.254 57.491-13.254 58.569L-13.254 60.459Q-13.254 60.627-13.084 60.674Q-12.915 60.721-12.645 60.721L-12.645 61.018L-14.500 61.018L-14.500 60.721Q-14.227 60.721-14.059 60.674Q-13.891 60.627-13.891 60.459L-13.891 58.584Q-13.891 58.202-14.012 57.973Q-14.133 57.745-14.485 57.745Q-14.797 57.745-15.051 57.907Q-15.305 58.069-15.452 58.338Q-15.598 58.608-15.598 58.905L-15.598 60.459Q-15.598 60.627-15.428 60.674Q-15.258 60.721-14.989 60.721\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(42.803 -6.56)\">\u003Cpath d=\"M-11.790 60.057L-11.790 57.866L-12.493 57.866L-12.493 57.612Q-12.137 57.612-11.895 57.379Q-11.653 57.147-11.542 56.799Q-11.430 56.452-11.430 56.096L-11.149 56.096L-11.149 57.569L-9.973 57.569L-9.973 57.866L-11.149 57.866L-11.149 60.041Q-11.149 60.362-11.030 60.590Q-10.911 60.819-10.630 60.819Q-10.450 60.819-10.333 60.696Q-10.216 60.573-10.163 60.393Q-10.110 60.213-10.110 60.041L-10.110 59.569L-9.829 59.569L-9.829 60.057Q-9.829 60.311-9.934 60.551Q-10.040 60.791-10.237 60.944Q-10.434 61.096-10.692 61.096Q-11.008 61.096-11.260 60.973Q-11.512 60.850-11.651 60.616Q-11.790 60.381-11.790 60.057\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(42.803 -6.56)\">\u003Cpath d=\"M-4.690 60.987L-5.760 58.131Q-5.827 57.952-5.957 57.909Q-6.088 57.866-6.346 57.866L-6.346 57.569L-4.666 57.569L-4.666 57.866Q-5.116 57.866-5.116 58.065Q-5.112 58.081-5.110 58.098Q-5.108 58.116-5.108 58.131L-4.315 60.225L-3.604 58.315Q-3.639 58.221-3.639 58.176Q-3.639 58.131-3.674 58.131Q-3.741 57.952-3.871 57.909Q-4.002 57.866-4.256 57.866L-4.256 57.569L-2.666 57.569L-2.666 57.866Q-3.116 57.866-3.116 58.065Q-3.112 58.084-3.110 58.102Q-3.108 58.120-3.108 58.131L-2.276 60.346L-1.522 58.346Q-1.498 58.288-1.498 58.217Q-1.498 58.057-1.635 57.961Q-1.772 57.866-1.940 57.866L-1.940 57.569L-0.553 57.569L-0.553 57.866Q-0.787 57.866-0.965 57.993Q-1.143 58.120-1.225 58.346L-2.209 60.987Q-2.264 61.096-2.377 61.096L-2.436 61.096Q-2.549 61.096-2.592 60.987L-3.452 58.713L-4.307 60.987Q-4.346 61.096-4.467 61.096L-4.522 61.096Q-4.635 61.096-4.690 60.987M1.720 61.018L-0.057 61.018L-0.057 60.721Q0.216 60.721 0.384 60.674Q0.552 60.627 0.552 60.459L0.552 58.323Q0.552 58.108 0.496 58.012Q0.439 57.916 0.326 57.895Q0.213 57.873-0.034 57.873L-0.034 57.577L1.166 57.491L1.166 60.459Q1.166 60.627 1.312 60.674Q1.459 60.721 1.720 60.721L1.720 61.018M0.279 56.096Q0.279 55.905 0.414 55.774Q0.548 55.643 0.744 55.643Q0.865 55.643 0.968 55.706Q1.072 55.768 1.134 55.872Q1.197 55.975 1.197 56.096Q1.197 56.291 1.066 56.426Q0.935 56.561 0.744 56.561Q0.545 56.561 0.412 56.428Q0.279 56.295 0.279 56.096M4.150 61.018L2.295 61.018L2.295 60.721Q2.568 60.721 2.736 60.674Q2.904 60.627 2.904 60.459L2.904 58.323Q2.904 58.108 2.841 58.012Q2.779 57.916 2.660 57.895Q2.541 57.873 2.295 57.873L2.295 57.577L3.486 57.491L3.486 58.225Q3.599 58.010 3.793 57.842Q3.986 57.674 4.224 57.582Q4.463 57.491 4.716 57.491Q5.884 57.491 5.884 58.569L5.884 60.459Q5.884 60.627 6.054 60.674Q6.224 60.721 6.494 60.721L6.494 61.018L4.638 61.018L4.638 60.721Q4.912 60.721 5.080 60.674Q5.248 60.627 5.248 60.459L5.248 58.584Q5.248 58.202 5.127 57.973Q5.006 57.745 4.654 57.745Q4.341 57.745 4.088 57.907Q3.834 58.069 3.687 58.338Q3.541 58.608 3.541 58.905L3.541 60.459Q3.541 60.627 3.711 60.674Q3.881 60.721 4.150 60.721L4.150 61.018M8.756 61.096Q8.275 61.096 7.867 60.852Q7.459 60.608 7.220 60.194Q6.982 59.780 6.982 59.291Q6.982 58.799 7.240 58.383Q7.498 57.967 7.929 57.729Q8.361 57.491 8.853 57.491Q9.474 57.491 9.924 57.928L9.924 56.299Q9.924 56.084 9.861 55.989Q9.799 55.893 9.681 55.872Q9.564 55.850 9.318 55.850L9.318 55.553L10.541 55.467L10.541 60.276Q10.541 60.487 10.603 60.582Q10.666 60.678 10.783 60.700Q10.900 60.721 11.150 60.721L11.150 61.018L9.900 61.096L9.900 60.612Q9.435 61.096 8.756 61.096M8.822 60.842Q9.162 60.842 9.455 60.651Q9.748 60.459 9.900 60.163L9.900 58.331Q9.752 58.057 9.490 57.901Q9.228 57.745 8.916 57.745Q8.291 57.745 8.007 58.192Q7.724 58.639 7.724 59.299Q7.724 59.944 7.976 60.393Q8.228 60.842 8.822 60.842M11.658 59.323Q11.658 58.819 11.914 58.387Q12.170 57.956 12.605 57.704Q13.041 57.452 13.541 57.452Q13.927 57.452 14.269 57.596Q14.611 57.741 14.873 58.002Q15.134 58.264 15.277 58.600Q15.420 58.936 15.420 59.323Q15.420 59.815 15.156 60.225Q14.892 60.635 14.463 60.866Q14.033 61.096 13.541 61.096Q13.049 61.096 12.615 60.864Q12.181 60.631 11.920 60.223Q11.658 59.815 11.658 59.323M13.541 60.819Q13.998 60.819 14.250 60.596Q14.502 60.373 14.590 60.022Q14.677 59.670 14.677 59.225Q14.677 58.795 14.584 58.457Q14.490 58.120 14.236 57.913Q13.982 57.706 13.541 57.706Q12.892 57.706 12.648 58.122Q12.404 58.538 12.404 59.225Q12.404 59.670 12.492 60.022Q12.580 60.373 12.832 60.596Q13.084 60.819 13.541 60.819\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(42.803 -6.56)\">\u003Cpath d=\"M17.269 60.987L16.199 58.131Q16.133 57.952 16.002 57.909Q15.871 57.866 15.613 57.866L15.613 57.569L17.293 57.569L17.293 57.866Q16.843 57.866 16.843 58.065Q16.847 58.081 16.849 58.098Q16.851 58.116 16.851 58.131L17.644 60.225L18.355 58.315Q18.320 58.221 18.320 58.176Q18.320 58.131 18.285 58.131Q18.218 57.952 18.088 57.909Q17.957 57.866 17.703 57.866L17.703 57.569L19.293 57.569L19.293 57.866Q18.843 57.866 18.843 58.065Q18.847 58.084 18.849 58.102Q18.851 58.120 18.851 58.131L19.683 60.346L20.437 58.346Q20.461 58.288 20.461 58.217Q20.461 58.057 20.324 57.961Q20.187 57.866 20.019 57.866L20.019 57.569L21.406 57.569L21.406 57.866Q21.172 57.866 20.994 57.993Q20.816 58.120 20.734 58.346L19.750 60.987Q19.695 61.096 19.582 61.096L19.523 61.096Q19.410 61.096 19.367 60.987L18.508 58.713L17.652 60.987Q17.613 61.096 17.492 61.096L17.437 61.096Q17.324 61.096 17.269 60.987\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(144.374 -100.43)\">\u003Cpath d=\"M-51.907 59.323Q-51.907 58.819-51.651 58.387Q-51.395 57.956-50.959 57.704Q-50.524 57.452-50.024 57.452Q-49.637 57.452-49.295 57.596Q-48.954 57.741-48.692 58.002Q-48.430 58.264-48.288 58.600Q-48.145 58.936-48.145 59.323Q-48.145 59.815-48.409 60.225Q-48.672 60.635-49.102 60.866Q-49.532 61.096-50.024 61.096Q-50.516 61.096-50.950 60.864Q-51.383 60.631-51.645 60.223Q-51.907 59.815-51.907 59.323M-50.024 60.819Q-49.567 60.819-49.315 60.596Q-49.063 60.373-48.975 60.022Q-48.887 59.670-48.887 59.225Q-48.887 58.795-48.981 58.457Q-49.075 58.120-49.329 57.913Q-49.583 57.706-50.024 57.706Q-50.672 57.706-50.916 58.122Q-51.161 58.538-51.161 59.225Q-51.161 59.670-51.073 60.022Q-50.985 60.373-50.733 60.596Q-50.481 60.819-50.024 60.819M-45.778 62.569L-47.633 62.569L-47.633 62.276Q-47.364 62.276-47.196 62.231Q-47.028 62.186-47.028 62.010L-47.028 58.186Q-47.028 57.979-47.184 57.926Q-47.340 57.873-47.633 57.873L-47.633 57.577L-46.411 57.491L-46.411 57.956Q-46.180 57.733-45.866 57.612Q-45.551 57.491-45.211 57.491Q-44.739 57.491-44.334 57.737Q-43.930 57.983-43.698 58.399Q-43.465 58.815-43.465 59.291Q-43.465 59.666-43.614 59.995Q-43.762 60.323-44.032 60.575Q-44.301 60.827-44.645 60.961Q-44.989 61.096-45.348 61.096Q-45.637 61.096-45.909 60.975Q-46.180 60.854-46.387 60.643L-46.387 62.010Q-46.387 62.186-46.219 62.231Q-46.051 62.276-45.778 62.276L-45.778 62.569M-46.387 58.354L-46.387 60.194Q-46.235 60.483-45.973 60.663Q-45.711 60.842-45.403 60.842Q-45.118 60.842-44.895 60.704Q-44.672 60.565-44.520 60.334Q-44.368 60.104-44.290 59.832Q-44.211 59.561-44.211 59.291Q-44.211 58.959-44.336 58.602Q-44.461 58.245-44.709 58.008Q-44.958 57.772-45.305 57.772Q-45.629 57.772-45.924 57.928Q-46.219 58.084-46.387 58.354M-42.844 60.186Q-42.844 59.702-42.442 59.407Q-42.040 59.112-41.489 58.993Q-40.938 58.873-40.446 58.873L-40.446 58.584Q-40.446 58.358-40.561 58.151Q-40.676 57.944-40.874 57.825Q-41.071 57.706-41.301 57.706Q-41.727 57.706-42.012 57.811Q-41.942 57.838-41.895 57.893Q-41.848 57.948-41.823 58.018Q-41.797 58.088-41.797 58.163Q-41.797 58.268-41.848 58.360Q-41.899 58.452-41.991 58.502Q-42.083 58.553-42.188 58.553Q-42.293 58.553-42.385 58.502Q-42.477 58.452-42.528 58.360Q-42.579 58.268-42.579 58.163Q-42.579 57.745-42.190 57.598Q-41.801 57.452-41.301 57.452Q-40.969 57.452-40.616 57.582Q-40.262 57.713-40.034 57.967Q-39.805 58.221-39.805 58.569L-39.805 60.370Q-39.805 60.502-39.733 60.612Q-39.661 60.721-39.532 60.721Q-39.407 60.721-39.338 60.616Q-39.270 60.510-39.270 60.370L-39.270 59.858L-38.989 59.858L-38.989 60.370Q-38.989 60.573-39.106 60.731Q-39.223 60.889-39.405 60.973Q-39.586 61.057-39.790 61.057Q-40.020 61.057-40.172 60.885Q-40.325 60.713-40.356 60.483Q-40.516 60.764-40.825 60.930Q-41.133 61.096-41.485 61.096Q-41.997 61.096-42.420 60.873Q-42.844 60.651-42.844 60.186M-42.157 60.186Q-42.157 60.471-41.930 60.657Q-41.704 60.842-41.411 60.842Q-41.165 60.842-40.940 60.725Q-40.715 60.608-40.581 60.405Q-40.446 60.202-40.446 59.948L-40.446 59.116Q-40.711 59.116-40.997 59.170Q-41.282 59.225-41.553 59.354Q-41.825 59.483-41.991 59.690Q-42.157 59.897-42.157 60.186M-34.477 62.569L-36.333 62.569L-36.333 62.276Q-36.063 62.276-35.895 62.231Q-35.727 62.186-35.727 62.010L-35.727 60.561Q-35.930 60.807-36.231 60.952Q-36.532 61.096-36.864 61.096Q-37.348 61.096-37.760 60.854Q-38.172 60.612-38.413 60.200Q-38.653 59.788-38.653 59.291Q-38.653 58.795-38.397 58.381Q-38.141 57.967-37.711 57.729Q-37.282 57.491-36.790 57.491Q-36.434 57.491-36.127 57.670Q-35.821 57.850-35.629 58.163L-35.340 57.491L-35.086 57.491L-35.086 62.010Q-35.086 62.186-34.918 62.231Q-34.750 62.276-34.477 62.276L-34.477 62.569M-36.805 60.842Q-36.438 60.842-36.145 60.610Q-35.852 60.377-35.704 60.018L-35.704 58.682Q-35.797 58.299-36.071 58.036Q-36.344 57.772-36.719 57.772Q-37.079 57.772-37.352 58.002Q-37.625 58.233-37.768 58.590Q-37.911 58.948-37.911 59.299Q-37.911 59.635-37.786 59.997Q-37.661 60.358-37.409 60.600Q-37.157 60.842-36.805 60.842M-33.532 60.065L-33.532 58.323Q-33.532 58.108-33.594 58.012Q-33.657 57.916-33.776 57.895Q-33.895 57.873-34.141 57.873L-34.141 57.577L-32.895 57.491L-32.895 60.041L-32.895 60.065Q-32.895 60.377-32.840 60.539Q-32.786 60.702-32.635 60.772Q-32.485 60.842-32.165 60.842Q-31.735 60.842-31.461 60.504Q-31.188 60.166-31.188 59.721L-31.188 58.323Q-31.188 58.108-31.250 58.012Q-31.313 57.916-31.432 57.895Q-31.551 57.873-31.797 57.873L-31.797 57.577L-30.551 57.491L-30.551 60.276Q-30.551 60.487-30.489 60.582Q-30.426 60.678-30.307 60.700Q-30.188 60.721-29.942 60.721L-29.942 61.018L-31.165 61.096L-31.165 60.475Q-31.333 60.764-31.614 60.930Q-31.895 61.096-32.215 61.096Q-33.532 61.096-33.532 60.065M-29.497 59.264Q-29.497 58.784-29.264 58.368Q-29.032 57.952-28.622 57.702Q-28.211 57.452-27.735 57.452Q-27.004 57.452-26.606 57.893Q-26.208 58.334-26.208 59.065Q-26.208 59.170-26.301 59.194L-28.750 59.194L-28.750 59.264Q-28.750 59.674-28.629 60.030Q-28.508 60.385-28.237 60.602Q-27.965 60.819-27.536 60.819Q-27.172 60.819-26.875 60.590Q-26.579 60.362-26.477 60.010Q-26.469 59.963-26.383 59.948L-26.301 59.948Q-26.208 59.975-26.208 60.057Q-26.208 60.065-26.215 60.096Q-26.278 60.323-26.416 60.506Q-26.555 60.690-26.747 60.823Q-26.938 60.956-27.157 61.026Q-27.375 61.096-27.614 61.096Q-27.985 61.096-28.323 60.959Q-28.661 60.823-28.928 60.571Q-29.196 60.319-29.346 59.979Q-29.497 59.639-29.497 59.264M-28.743 58.956L-26.782 58.956Q-26.782 58.651-26.883 58.360Q-26.985 58.069-27.202 57.887Q-27.418 57.706-27.735 57.706Q-28.036 57.706-28.266 57.893Q-28.497 58.081-28.620 58.372Q-28.743 58.663-28.743 58.956\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(144.374 -100.43)\">\u003Cpath d=\"M-20.951 61.018L-22.783 61.018L-22.783 60.721Q-22.509 60.721-22.341 60.674Q-22.173 60.627-22.173 60.459L-22.173 56.299Q-22.173 56.084-22.236 55.989Q-22.298 55.893-22.417 55.872Q-22.537 55.850-22.783 55.850L-22.783 55.553L-21.560 55.467L-21.560 60.459Q-21.560 60.627-21.392 60.674Q-21.224 60.721-20.951 60.721L-20.951 61.018M-18.646 61.018L-20.423 61.018L-20.423 60.721Q-20.150 60.721-19.982 60.674Q-19.814 60.627-19.814 60.459L-19.814 58.323Q-19.814 58.108-19.871 58.012Q-19.927 57.916-20.041 57.895Q-20.154 57.873-20.400 57.873L-20.400 57.577L-19.201 57.491L-19.201 60.459Q-19.201 60.627-19.054 60.674Q-18.908 60.721-18.646 60.721L-18.646 61.018M-20.087 56.096Q-20.087 55.905-19.953 55.774Q-19.818 55.643-19.623 55.643Q-19.501 55.643-19.398 55.706Q-19.294 55.768-19.232 55.872Q-19.169 55.975-19.169 56.096Q-19.169 56.291-19.300 56.426Q-19.431 56.561-19.623 56.561Q-19.822 56.561-19.955 56.428Q-20.087 56.295-20.087 56.096M-16.216 61.018L-18.072 61.018L-18.072 60.721Q-17.798 60.721-17.630 60.674Q-17.462 60.627-17.462 60.459L-17.462 58.323Q-17.462 58.108-17.525 58.012Q-17.587 57.916-17.707 57.895Q-17.826 57.873-18.072 57.873L-18.072 57.577L-16.880 57.491L-16.880 58.225Q-16.767 58.010-16.574 57.842Q-16.380 57.674-16.142 57.582Q-15.904 57.491-15.650 57.491Q-14.482 57.491-14.482 58.569L-14.482 60.459Q-14.482 60.627-14.312 60.674Q-14.142 60.721-13.873 60.721L-13.873 61.018L-15.728 61.018L-15.728 60.721Q-15.455 60.721-15.287 60.674Q-15.119 60.627-15.119 60.459L-15.119 58.584Q-15.119 58.202-15.240 57.973Q-15.361 57.745-15.712 57.745Q-16.025 57.745-16.279 57.907Q-16.533 58.069-16.679 58.338Q-16.826 58.608-16.826 58.905L-16.826 60.459Q-16.826 60.627-16.656 60.674Q-16.486 60.721-16.216 60.721L-16.216 61.018M-13.427 59.264Q-13.427 58.784-13.195 58.368Q-12.962 57.952-12.552 57.702Q-12.142 57.452-11.666 57.452Q-10.935 57.452-10.537 57.893Q-10.138 58.334-10.138 59.065Q-10.138 59.170-10.232 59.194L-12.681 59.194L-12.681 59.264Q-12.681 59.674-12.560 60.030Q-12.439 60.385-12.167 60.602Q-11.896 60.819-11.466 60.819Q-11.103 60.819-10.806 60.590Q-10.509 60.362-10.408 60.010Q-10.400 59.963-10.314 59.948L-10.232 59.948Q-10.138 59.975-10.138 60.057Q-10.138 60.065-10.146 60.096Q-10.208 60.323-10.347 60.506Q-10.486 60.690-10.677 60.823Q-10.869 60.956-11.087 61.026Q-11.306 61.096-11.544 61.096Q-11.916 61.096-12.253 60.959Q-12.591 60.823-12.859 60.571Q-13.126 60.319-13.277 59.979Q-13.427 59.639-13.427 59.264M-12.673 58.956L-10.712 58.956Q-10.712 58.651-10.814 58.360Q-10.916 58.069-11.132 57.887Q-11.349 57.706-11.666 57.706Q-11.966 57.706-12.197 57.893Q-12.427 58.081-12.550 58.372Q-12.673 58.663-12.673 58.956\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M27.523 80.935V50.437\"\u002F>\u003Cpath fill=\"none\" d=\"M24.4 52.597c1.874-.468 2.758-1.51 3.123-2.56.364 1.05 1.249 2.092 3.122 2.56\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(48.016 29.005)\">\u003Cpath d=\"M-49.840 61.018L-51.825 61.018L-51.825 60.721Q-51.551 60.721-51.383 60.674Q-51.215 60.627-51.215 60.459L-51.215 57.866L-51.856 57.866L-51.856 57.569L-51.215 57.569L-51.215 56.635Q-51.215 56.370-51.098 56.133Q-50.981 55.897-50.788 55.733Q-50.594 55.569-50.346 55.477Q-50.098 55.385-49.833 55.385Q-49.547 55.385-49.323 55.543Q-49.098 55.702-49.098 55.979Q-49.098 56.135-49.204 56.245Q-49.309 56.354-49.473 56.354Q-49.629 56.354-49.739 56.245Q-49.848 56.135-49.848 55.979Q-49.848 55.772-49.688 55.666Q-49.786 55.643-49.879 55.643Q-50.110 55.643-50.282 55.799Q-50.454 55.956-50.540 56.192Q-50.625 56.428-50.625 56.651L-50.625 57.569L-49.657 57.569L-49.657 57.866L-50.602 57.866L-50.602 60.459Q-50.602 60.627-50.375 60.674Q-50.149 60.721-49.840 60.721\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(48.016 29.005)\">\u003Cpath d=\"M-46.764 61.018L-48.596 61.018L-48.596 60.721Q-48.322 60.721-48.154 60.674Q-47.986 60.627-47.986 60.459L-47.986 56.299Q-47.986 56.084-48.049 55.989Q-48.111 55.893-48.230 55.872Q-48.350 55.850-48.596 55.850L-48.596 55.553L-47.373 55.467L-47.373 60.459Q-47.373 60.627-47.205 60.674Q-47.037 60.721-46.764 60.721L-46.764 61.018M-45.635 60.065L-45.635 58.323Q-45.635 58.108-45.697 58.012Q-45.760 57.916-45.879 57.895Q-45.998 57.873-46.244 57.873L-46.244 57.577L-44.998 57.491L-44.998 60.041L-44.998 60.065Q-44.998 60.377-44.943 60.539Q-44.889 60.702-44.738 60.772Q-44.588 60.842-44.268 60.842Q-43.838 60.842-43.564 60.504Q-43.291 60.166-43.291 59.721L-43.291 58.323Q-43.291 58.108-43.353 58.012Q-43.416 57.916-43.535 57.895Q-43.654 57.873-43.900 57.873L-43.900 57.577L-42.654 57.491L-42.654 60.276Q-42.654 60.487-42.592 60.582Q-42.529 60.678-42.410 60.700Q-42.291 60.721-42.045 60.721L-42.045 61.018L-43.268 61.096L-43.268 60.475Q-43.436 60.764-43.717 60.930Q-43.998 61.096-44.318 61.096Q-45.635 61.096-45.635 60.065M-40.213 61.018L-41.709 61.018L-41.709 60.721Q-41.076 60.721-40.654 60.241L-39.885 59.331L-40.877 58.131Q-41.033 57.952-41.195 57.909Q-41.357 57.866-41.662 57.866L-41.662 57.569L-39.975 57.569L-39.975 57.866Q-40.068 57.866-40.145 57.909Q-40.221 57.952-40.221 58.041Q-40.221 58.084-40.189 58.131L-39.533 58.920L-39.053 58.346Q-38.936 58.209-38.936 58.073Q-38.936 57.983-38.986 57.924Q-39.037 57.866-39.119 57.866L-39.119 57.569L-37.631 57.569L-37.631 57.866Q-38.268 57.866-38.678 58.346L-39.357 59.147L-38.271 60.459Q-38.111 60.635-37.951 60.678Q-37.791 60.721-37.486 60.721L-37.486 61.018L-39.174 61.018L-39.174 60.721Q-39.084 60.721-39.006 60.678Q-38.928 60.635-38.928 60.545Q-38.928 60.522-38.959 60.459L-39.701 59.553L-40.287 60.241Q-40.404 60.377-40.404 60.514Q-40.404 60.600-40.353 60.661Q-40.303 60.721-40.213 60.721\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(48.016 29.005)\">\u003Cpath d=\"M-34.275 59.264Q-34.275 58.784-34.042 58.368Q-33.810 57.952-33.400 57.702Q-32.990 57.452-32.513 57.452Q-31.783 57.452-31.384 57.893Q-30.986 58.334-30.986 59.065Q-30.986 59.170-31.079 59.194L-33.529 59.194L-33.529 59.264Q-33.529 59.674-33.408 60.030Q-33.286 60.385-33.015 60.602Q-32.743 60.819-32.314 60.819Q-31.950 60.819-31.654 60.590Q-31.357 60.362-31.255 60.010Q-31.247 59.963-31.161 59.948L-31.079 59.948Q-30.986 59.975-30.986 60.057Q-30.986 60.065-30.993 60.096Q-31.056 60.323-31.195 60.506Q-31.333 60.690-31.525 60.823Q-31.716 60.956-31.935 61.026Q-32.154 61.096-32.392 61.096Q-32.763 61.096-33.101 60.959Q-33.439 60.823-33.706 60.571Q-33.974 60.319-34.124 59.979Q-34.275 59.639-34.275 59.264M-33.521 58.956L-31.560 58.956Q-31.560 58.651-31.661 58.360Q-31.763 58.069-31.980 57.887Q-32.197 57.706-32.513 57.706Q-32.814 57.706-33.044 57.893Q-33.275 58.081-33.398 58.372Q-33.521 58.663-33.521 58.956M-30.454 61.010L-30.454 59.788Q-30.454 59.760-30.423 59.729Q-30.392 59.698-30.368 59.698L-30.263 59.698Q-30.193 59.698-30.177 59.760Q-30.115 60.081-29.976 60.321Q-29.837 60.561-29.605 60.702Q-29.372 60.842-29.064 60.842Q-28.825 60.842-28.617 60.782Q-28.408 60.721-28.271 60.573Q-28.134 60.424-28.134 60.178Q-28.134 59.924-28.345 59.758Q-28.556 59.592-28.825 59.538L-29.447 59.424Q-29.853 59.346-30.154 59.090Q-30.454 58.834-30.454 58.459Q-30.454 58.092-30.253 57.870Q-30.052 57.647-29.728 57.549Q-29.404 57.452-29.064 57.452Q-28.599 57.452-28.302 57.659L-28.079 57.475Q-28.056 57.452-28.025 57.452L-27.974 57.452Q-27.943 57.452-27.915 57.479Q-27.888 57.506-27.888 57.538L-27.888 58.522Q-27.888 58.553-27.913 58.582Q-27.939 58.612-27.974 58.612L-28.079 58.612Q-28.115 58.612-28.142 58.584Q-28.169 58.557-28.169 58.522Q-28.169 58.123-28.421 57.903Q-28.673 57.682-29.072 57.682Q-29.427 57.682-29.710 57.805Q-29.993 57.928-29.993 58.233Q-29.993 58.452-29.792 58.584Q-29.591 58.717-29.345 58.760L-28.720 58.873Q-28.290 58.963-27.982 59.260Q-27.673 59.557-27.673 59.971Q-27.673 60.541-28.072 60.819Q-28.470 61.096-29.064 61.096Q-29.615 61.096-29.966 60.760L-30.263 61.073Q-30.286 61.096-30.322 61.096L-30.368 61.096Q-30.392 61.096-30.423 61.065Q-30.454 61.034-30.454 61.010M-27.103 59.291Q-27.103 58.795-26.853 58.370Q-26.603 57.944-26.183 57.698Q-25.763 57.452-25.263 57.452Q-24.724 57.452-24.333 57.577Q-23.943 57.702-23.943 58.116Q-23.943 58.221-23.993 58.313Q-24.044 58.405-24.136 58.456Q-24.228 58.506-24.337 58.506Q-24.443 58.506-24.534 58.456Q-24.626 58.405-24.677 58.313Q-24.728 58.221-24.728 58.116Q-24.728 57.893-24.560 57.788Q-24.783 57.729-25.255 57.729Q-25.552 57.729-25.767 57.868Q-25.982 58.006-26.113 58.237Q-26.243 58.467-26.302 58.737Q-26.361 59.006-26.361 59.291Q-26.361 59.686-26.228 60.036Q-26.095 60.385-25.824 60.602Q-25.552 60.819-25.154 60.819Q-24.779 60.819-24.503 60.602Q-24.228 60.385-24.126 60.026Q-24.111 59.963-24.048 59.963L-23.943 59.963Q-23.908 59.963-23.882 59.991Q-23.857 60.018-23.857 60.057L-23.857 60.081Q-23.990 60.561-24.374 60.829Q-24.759 61.096-25.263 61.096Q-25.626 61.096-25.960 60.959Q-26.294 60.823-26.554 60.573Q-26.814 60.323-26.958 59.987Q-27.103 59.651-27.103 59.291M-23.271 60.186Q-23.271 59.702-22.868 59.407Q-22.466 59.112-21.915 58.993Q-21.365 58.873-20.872 58.873L-20.872 58.584Q-20.872 58.358-20.988 58.151Q-21.103 57.944-21.300 57.825Q-21.497 57.706-21.728 57.706Q-22.154 57.706-22.439 57.811Q-22.368 57.838-22.322 57.893Q-22.275 57.948-22.249 58.018Q-22.224 58.088-22.224 58.163Q-22.224 58.268-22.275 58.360Q-22.325 58.452-22.417 58.502Q-22.509 58.553-22.615 58.553Q-22.720 58.553-22.812 58.502Q-22.904 58.452-22.954 58.360Q-23.005 58.268-23.005 58.163Q-23.005 57.745-22.617 57.598Q-22.228 57.452-21.728 57.452Q-21.396 57.452-21.042 57.582Q-20.689 57.713-20.460 57.967Q-20.232 58.221-20.232 58.569L-20.232 60.370Q-20.232 60.502-20.159 60.612Q-20.087 60.721-19.958 60.721Q-19.833 60.721-19.765 60.616Q-19.697 60.510-19.697 60.370L-19.697 59.858L-19.415 59.858L-19.415 60.370Q-19.415 60.573-19.533 60.731Q-19.650 60.889-19.831 60.973Q-20.013 61.057-20.216 61.057Q-20.447 61.057-20.599 60.885Q-20.751 60.713-20.783 60.483Q-20.943 60.764-21.251 60.930Q-21.560 61.096-21.911 61.096Q-22.423 61.096-22.847 60.873Q-23.271 60.651-23.271 60.186M-22.583 60.186Q-22.583 60.471-22.357 60.657Q-22.130 60.842-21.837 60.842Q-21.591 60.842-21.367 60.725Q-21.142 60.608-21.007 60.405Q-20.872 60.202-20.872 59.948L-20.872 59.116Q-21.138 59.116-21.423 59.170Q-21.708 59.225-21.980 59.354Q-22.251 59.483-22.417 59.690Q-22.583 59.897-22.583 60.186M-17.240 62.569L-19.095 62.569L-19.095 62.276Q-18.825 62.276-18.658 62.231Q-18.490 62.186-18.490 62.010L-18.490 58.186Q-18.490 57.979-18.646 57.926Q-18.802 57.873-19.095 57.873L-19.095 57.577L-17.872 57.491L-17.872 57.956Q-17.642 57.733-17.327 57.612Q-17.013 57.491-16.673 57.491Q-16.200 57.491-15.796 57.737Q-15.392 57.983-15.159 58.399Q-14.927 58.815-14.927 59.291Q-14.927 59.666-15.075 59.995Q-15.224 60.323-15.493 60.575Q-15.763 60.827-16.107 60.961Q-16.450 61.096-16.810 61.096Q-17.099 61.096-17.370 60.975Q-17.642 60.854-17.849 60.643L-17.849 62.010Q-17.849 62.186-17.681 62.231Q-17.513 62.276-17.240 62.276L-17.240 62.569M-17.849 58.354L-17.849 60.194Q-17.697 60.483-17.435 60.663Q-17.173 60.842-16.865 60.842Q-16.579 60.842-16.357 60.704Q-16.134 60.565-15.982 60.334Q-15.829 60.104-15.751 59.832Q-15.673 59.561-15.673 59.291Q-15.673 58.959-15.798 58.602Q-15.923 58.245-16.171 58.008Q-16.419 57.772-16.767 57.772Q-17.091 57.772-17.386 57.928Q-17.681 58.084-17.849 58.354\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(48.016 29.005)\">\u003Cpath d=\"M-14.158 59.264Q-14.158 58.784-13.925 58.368Q-13.693 57.952-13.283 57.702Q-12.873 57.452-12.396 57.452Q-11.666 57.452-11.267 57.893Q-10.869 58.334-10.869 59.065Q-10.869 59.170-10.962 59.194L-13.412 59.194L-13.412 59.264Q-13.412 59.674-13.291 60.030Q-13.169 60.385-12.898 60.602Q-12.626 60.819-12.197 60.819Q-11.834 60.819-11.537 60.590Q-11.240 60.362-11.138 60.010Q-11.130 59.963-11.044 59.948L-10.962 59.948Q-10.869 59.975-10.869 60.057Q-10.869 60.065-10.876 60.096Q-10.939 60.323-11.078 60.506Q-11.216 60.690-11.408 60.823Q-11.599 60.956-11.818 61.026Q-12.037 61.096-12.275 61.096Q-12.646 61.096-12.984 60.959Q-13.322 60.823-13.589 60.571Q-13.857 60.319-14.007 59.979Q-14.158 59.639-14.158 59.264M-13.404 58.956L-11.443 58.956Q-11.443 58.651-11.544 58.360Q-11.646 58.069-11.863 57.887Q-12.080 57.706-12.396 57.706Q-12.697 57.706-12.927 57.893Q-13.158 58.081-13.281 58.372Q-13.404 58.663-13.404 58.956M-10.337 61.010L-10.337 59.788Q-10.337 59.760-10.306 59.729Q-10.275 59.698-10.251 59.698L-10.146 59.698Q-10.076 59.698-10.060 59.760Q-9.998 60.081-9.859 60.321Q-9.720 60.561-9.488 60.702Q-9.255 60.842-8.947 60.842Q-8.709 60.842-8.500 60.782Q-8.291 60.721-8.154 60.573Q-8.017 60.424-8.017 60.178Q-8.017 59.924-8.228 59.758Q-8.439 59.592-8.709 59.538L-9.330 59.424Q-9.736 59.346-10.037 59.090Q-10.337 58.834-10.337 58.459Q-10.337 58.092-10.136 57.870Q-9.935 57.647-9.611 57.549Q-9.287 57.452-8.947 57.452Q-8.482 57.452-8.185 57.659L-7.962 57.475Q-7.939 57.452-7.908 57.452L-7.857 57.452Q-7.826 57.452-7.798 57.479Q-7.771 57.506-7.771 57.538L-7.771 58.522Q-7.771 58.553-7.796 58.582Q-7.822 58.612-7.857 58.612L-7.962 58.612Q-7.998 58.612-8.025 58.584Q-8.052 58.557-8.052 58.522Q-8.052 58.123-8.304 57.903Q-8.556 57.682-8.955 57.682Q-9.310 57.682-9.593 57.805Q-9.876 57.928-9.876 58.233Q-9.876 58.452-9.675 58.584Q-9.474 58.717-9.228 58.760L-8.603 58.873Q-8.173 58.963-7.865 59.260Q-7.556 59.557-7.556 59.971Q-7.556 60.541-7.955 60.819Q-8.353 61.096-8.947 61.096Q-9.498 61.096-9.849 60.760L-10.146 61.073Q-10.169 61.096-10.205 61.096L-10.251 61.096Q-10.275 61.096-10.306 61.065Q-10.337 61.034-10.337 61.010\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(48.016 29.005)\">\u003Cpath d=\"M-2.264 61.018L-4.120 61.018L-4.120 60.721Q-3.846 60.721-3.678 60.674Q-3.510 60.627-3.510 60.459L-3.510 56.299Q-3.510 56.084-3.573 55.989Q-3.635 55.893-3.754 55.872Q-3.873 55.850-4.120 55.850L-4.120 55.553L-2.897 55.467L-2.897 58.170Q-2.772 57.959-2.584 57.809Q-2.397 57.659-2.170 57.575Q-1.944 57.491-1.698 57.491Q-0.530 57.491-0.530 58.569L-0.530 60.459Q-0.530 60.627-0.360 60.674Q-0.190 60.721 0.080 60.721L0.080 61.018L-1.776 61.018L-1.776 60.721Q-1.502 60.721-1.334 60.674Q-1.166 60.627-1.166 60.459L-1.166 58.584Q-1.166 58.202-1.287 57.973Q-1.409 57.745-1.760 57.745Q-2.073 57.745-2.327 57.907Q-2.580 58.069-2.727 58.338Q-2.873 58.608-2.873 58.905L-2.873 60.459Q-2.873 60.627-2.703 60.674Q-2.534 60.721-2.264 60.721L-2.264 61.018M0.525 59.264Q0.525 58.784 0.757 58.368Q0.990 57.952 1.400 57.702Q1.810 57.452 2.287 57.452Q3.017 57.452 3.416 57.893Q3.814 58.334 3.814 59.065Q3.814 59.170 3.720 59.194L1.271 59.194L1.271 59.264Q1.271 59.674 1.392 60.030Q1.513 60.385 1.785 60.602Q2.056 60.819 2.486 60.819Q2.849 60.819 3.146 60.590Q3.443 60.362 3.545 60.010Q3.552 59.963 3.638 59.948L3.720 59.948Q3.814 59.975 3.814 60.057Q3.814 60.065 3.806 60.096Q3.744 60.323 3.605 60.506Q3.466 60.690 3.275 60.823Q3.084 60.956 2.865 61.026Q2.646 61.096 2.408 61.096Q2.037 61.096 1.699 60.959Q1.361 60.823 1.093 60.571Q0.826 60.319 0.675 59.979Q0.525 59.639 0.525 59.264M1.279 58.956L3.240 58.956Q3.240 58.651 3.138 58.360Q3.037 58.069 2.820 57.887Q2.603 57.706 2.287 57.706Q1.986 57.706 1.755 57.893Q1.525 58.081 1.402 58.372Q1.279 58.663 1.279 58.956M6.310 61.018L4.330 61.018L4.330 60.721Q4.599 60.721 4.767 60.676Q4.935 60.631 4.935 60.459L4.935 58.323Q4.935 58.108 4.873 58.012Q4.810 57.916 4.693 57.895Q4.576 57.873 4.330 57.873L4.330 57.577L5.498 57.491L5.498 58.276Q5.576 58.065 5.728 57.879Q5.880 57.694 6.080 57.592Q6.279 57.491 6.505 57.491Q6.752 57.491 6.943 57.635Q7.134 57.780 7.134 58.010Q7.134 58.166 7.029 58.276Q6.923 58.385 6.767 58.385Q6.611 58.385 6.502 58.276Q6.392 58.166 6.392 58.010Q6.392 57.850 6.498 57.745Q6.173 57.745 5.959 57.973Q5.744 58.202 5.648 58.541Q5.552 58.881 5.552 59.186L5.552 60.459Q5.552 60.627 5.779 60.674Q6.005 60.721 6.310 60.721L6.310 61.018M7.615 59.264Q7.615 58.784 7.847 58.368Q8.080 57.952 8.490 57.702Q8.900 57.452 9.377 57.452Q10.107 57.452 10.505 57.893Q10.904 58.334 10.904 59.065Q10.904 59.170 10.810 59.194L8.361 59.194L8.361 59.264Q8.361 59.674 8.482 60.030Q8.603 60.385 8.875 60.602Q9.146 60.819 9.576 60.819Q9.939 60.819 10.236 60.590Q10.533 60.362 10.634 60.010Q10.642 59.963 10.728 59.948L10.810 59.948Q10.904 59.975 10.904 60.057Q10.904 60.065 10.896 60.096Q10.834 60.323 10.695 60.506Q10.556 60.690 10.365 60.823Q10.173 60.956 9.955 61.026Q9.736 61.096 9.498 61.096Q9.127 61.096 8.789 60.959Q8.451 60.823 8.183 60.571Q7.916 60.319 7.765 59.979Q7.615 59.639 7.615 59.264M8.369 58.956L10.330 58.956Q10.330 58.651 10.228 58.360Q10.127 58.069 9.910 57.887Q9.693 57.706 9.377 57.706Q9.076 57.706 8.845 57.893Q8.615 58.081 8.492 58.372Q8.369 58.663 8.369 58.956\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The Rosseland weighting averages one over opacity, so a transparent window at moderate opacity contributes far more to the flux than an opaque line; the mean is pulled down toward the transparent frequencies.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:308.886px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 231.665 122.827\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-68.737 28.488V-56.87h91.049v85.358ZM22.312-56.87\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(24.392 -91.87)\">\u003Cpath d=\"M-66.585 28.488L-68.417 28.488L-68.417 28.191Q-68.143 28.191-67.975 28.144Q-67.807 28.097-67.807 27.929L-67.807 23.769Q-67.807 23.554-67.870 23.459Q-67.932 23.363-68.051 23.342Q-68.171 23.320-68.417 23.320L-68.417 23.023L-67.194 22.937L-67.194 27.929Q-67.194 28.097-67.026 28.144Q-66.858 28.191-66.585 28.191L-66.585 28.488M-66.139 26.793Q-66.139 26.289-65.883 25.857Q-65.628 25.425-65.192 25.174Q-64.757 24.922-64.257 24.922Q-63.870 24.922-63.528 25.066Q-63.186 25.211-62.924 25.472Q-62.663 25.734-62.520 26.070Q-62.378 26.406-62.378 26.793Q-62.378 27.285-62.641 27.695Q-62.905 28.105-63.335 28.336Q-63.764 28.566-64.257 28.566Q-64.749 28.566-65.182 28.334Q-65.616 28.101-65.878 27.693Q-66.139 27.285-66.139 26.793M-64.257 28.289Q-63.799 28.289-63.548 28.066Q-63.296 27.843-63.208 27.492Q-63.120 27.140-63.120 26.695Q-63.120 26.265-63.214 25.927Q-63.307 25.590-63.561 25.383Q-63.815 25.175-64.257 25.175Q-64.905 25.175-65.149 25.592Q-65.393 26.008-65.393 26.695Q-65.393 27.140-65.305 27.492Q-65.217 27.843-64.966 28.066Q-64.714 28.289-64.257 28.289\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.392 -91.87)\">\u003Cpath d=\"M-60.538 28.457L-61.608 25.601Q-61.675 25.422-61.805 25.379Q-61.936 25.336-62.194 25.336L-62.194 25.039L-60.514 25.039L-60.514 25.336Q-60.964 25.336-60.964 25.535Q-60.960 25.550-60.958 25.568Q-60.956 25.586-60.956 25.601L-60.163 27.695L-59.452 25.785Q-59.487 25.691-59.487 25.646Q-59.487 25.601-59.522 25.601Q-59.589 25.422-59.719 25.379Q-59.850 25.336-60.104 25.336L-60.104 25.039L-58.514 25.039L-58.514 25.336Q-58.964 25.336-58.964 25.535Q-58.960 25.554-58.958 25.572Q-58.956 25.590-58.956 25.601L-58.124 27.816L-57.370 25.816Q-57.346 25.758-57.346 25.687Q-57.346 25.527-57.483 25.431Q-57.620 25.336-57.788 25.336L-57.788 25.039L-56.401 25.039L-56.401 25.336Q-56.635 25.336-56.813 25.463Q-56.991 25.590-57.073 25.816L-58.057 28.457Q-58.112 28.566-58.225 28.566L-58.284 28.566Q-58.397 28.566-58.440 28.457L-59.300 26.183L-60.155 28.457Q-60.194 28.566-60.315 28.566L-60.370 28.566Q-60.483 28.566-60.538 28.457\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.392 -91.87)\">\u003Cpath d=\"M-53.151 26.793Q-53.151 26.289-52.895 25.857Q-52.639 25.425-52.203 25.174Q-51.768 24.922-51.268 24.922Q-50.881 24.922-50.539 25.066Q-50.198 25.211-49.936 25.472Q-49.674 25.734-49.532 26.070Q-49.389 26.406-49.389 26.793Q-49.389 27.285-49.653 27.695Q-49.916 28.105-50.346 28.336Q-50.776 28.566-51.268 28.566Q-51.760 28.566-52.194 28.334Q-52.627 28.101-52.889 27.693Q-53.151 27.285-53.151 26.793M-51.268 28.289Q-50.811 28.289-50.559 28.066Q-50.307 27.843-50.219 27.492Q-50.131 27.140-50.131 26.695Q-50.131 26.265-50.225 25.927Q-50.319 25.590-50.573 25.383Q-50.827 25.175-51.268 25.175Q-51.916 25.175-52.160 25.592Q-52.405 26.008-52.405 26.695Q-52.405 27.140-52.317 27.492Q-52.229 27.843-51.977 28.066Q-51.725 28.289-51.268 28.289M-47.022 30.039L-48.877 30.039L-48.877 29.746Q-48.608 29.746-48.440 29.701Q-48.272 29.656-48.272 29.480L-48.272 25.656Q-48.272 25.449-48.428 25.396Q-48.584 25.343-48.877 25.343L-48.877 25.047L-47.655 24.961L-47.655 25.425Q-47.424 25.203-47.110 25.082Q-46.795 24.961-46.455 24.961Q-45.983 24.961-45.578 25.207Q-45.174 25.453-44.942 25.869Q-44.709 26.285-44.709 26.761Q-44.709 27.136-44.858 27.465Q-45.006 27.793-45.276 28.045Q-45.545 28.297-45.889 28.431Q-46.233 28.566-46.592 28.566Q-46.881 28.566-47.153 28.445Q-47.424 28.324-47.631 28.113L-47.631 29.480Q-47.631 29.656-47.463 29.701Q-47.295 29.746-47.022 29.746L-47.022 30.039M-47.631 25.824L-47.631 27.664Q-47.479 27.953-47.217 28.133Q-46.955 28.312-46.647 28.312Q-46.362 28.312-46.139 28.174Q-45.916 28.035-45.764 27.804Q-45.612 27.574-45.534 27.302Q-45.455 27.031-45.455 26.761Q-45.455 26.429-45.580 26.072Q-45.705 25.715-45.953 25.478Q-46.202 25.242-46.549 25.242Q-46.873 25.242-47.168 25.398Q-47.463 25.554-47.631 25.824M-44.088 27.656Q-44.088 27.172-43.686 26.877Q-43.284 26.582-42.733 26.463Q-42.182 26.343-41.690 26.343L-41.690 26.054Q-41.690 25.828-41.805 25.621Q-41.920 25.414-42.118 25.295Q-42.315 25.175-42.545 25.175Q-42.971 25.175-43.256 25.281Q-43.186 25.308-43.139 25.363Q-43.092 25.418-43.067 25.488Q-43.041 25.558-43.041 25.633Q-43.041 25.738-43.092 25.830Q-43.143 25.922-43.235 25.972Q-43.327 26.023-43.432 26.023Q-43.537 26.023-43.629 25.972Q-43.721 25.922-43.772 25.830Q-43.823 25.738-43.823 25.633Q-43.823 25.215-43.434 25.068Q-43.045 24.922-42.545 24.922Q-42.213 24.922-41.860 25.052Q-41.506 25.183-41.278 25.437Q-41.049 25.691-41.049 26.039L-41.049 27.840Q-41.049 27.972-40.977 28.082Q-40.905 28.191-40.776 28.191Q-40.651 28.191-40.582 28.086Q-40.514 27.980-40.514 27.840L-40.514 27.328L-40.233 27.328L-40.233 27.840Q-40.233 28.043-40.350 28.201Q-40.467 28.359-40.649 28.443Q-40.830 28.527-41.034 28.527Q-41.264 28.527-41.416 28.355Q-41.569 28.183-41.600 27.953Q-41.760 28.234-42.069 28.400Q-42.377 28.566-42.729 28.566Q-43.241 28.566-43.664 28.343Q-44.088 28.121-44.088 27.656M-43.401 27.656Q-43.401 27.941-43.174 28.127Q-42.948 28.312-42.655 28.312Q-42.409 28.312-42.184 28.195Q-41.959 28.078-41.825 27.875Q-41.690 27.672-41.690 27.418L-41.690 26.586Q-41.955 26.586-42.241 26.640Q-42.526 26.695-42.797 26.824Q-43.069 26.953-43.235 27.160Q-43.401 27.367-43.401 27.656M-39.897 26.761Q-39.897 26.265-39.647 25.840Q-39.397 25.414-38.977 25.168Q-38.557 24.922-38.057 24.922Q-37.518 24.922-37.127 25.047Q-36.737 25.172-36.737 25.586Q-36.737 25.691-36.787 25.783Q-36.838 25.875-36.930 25.925Q-37.022 25.976-37.131 25.976Q-37.237 25.976-37.328 25.925Q-37.420 25.875-37.471 25.783Q-37.522 25.691-37.522 25.586Q-37.522 25.363-37.354 25.258Q-37.577 25.199-38.049 25.199Q-38.346 25.199-38.561 25.338Q-38.776 25.476-38.907 25.707Q-39.037 25.937-39.096 26.207Q-39.155 26.476-39.155 26.761Q-39.155 27.156-39.022 27.506Q-38.889 27.855-38.618 28.072Q-38.346 28.289-37.948 28.289Q-37.573 28.289-37.297 28.072Q-37.022 27.855-36.920 27.496Q-36.905 27.433-36.842 27.433L-36.737 27.433Q-36.702 27.433-36.676 27.461Q-36.651 27.488-36.651 27.527L-36.651 27.550Q-36.784 28.031-37.168 28.299Q-37.553 28.566-38.057 28.566Q-38.420 28.566-38.754 28.429Q-39.088 28.293-39.348 28.043Q-39.608 27.793-39.752 27.457Q-39.897 27.121-39.897 26.761M-34.303 28.488L-36.080 28.488L-36.080 28.191Q-35.807 28.191-35.639 28.144Q-35.471 28.097-35.471 27.929L-35.471 25.793Q-35.471 25.578-35.528 25.482Q-35.584 25.386-35.698 25.365Q-35.811 25.343-36.057 25.343L-36.057 25.047L-34.858 24.961L-34.858 27.929Q-34.858 28.097-34.711 28.144Q-34.565 28.191-34.303 28.191L-34.303 28.488M-35.744 23.566Q-35.744 23.375-35.610 23.244Q-35.475 23.113-35.280 23.113Q-35.159 23.113-35.055 23.175Q-34.952 23.238-34.889 23.342Q-34.827 23.445-34.827 23.566Q-34.827 23.761-34.957 23.896Q-35.088 24.031-35.280 24.031Q-35.479 24.031-35.612 23.898Q-35.744 23.765-35.744 23.566M-33.178 27.527L-33.178 25.336L-33.881 25.336L-33.881 25.082Q-33.526 25.082-33.284 24.849Q-33.041 24.617-32.930 24.269Q-32.819 23.922-32.819 23.566L-32.537 23.566L-32.537 25.039L-31.362 25.039L-31.362 25.336L-32.537 25.336L-32.537 27.511Q-32.537 27.832-32.418 28.060Q-32.299 28.289-32.018 28.289Q-31.838 28.289-31.721 28.166Q-31.604 28.043-31.551 27.863Q-31.498 27.683-31.498 27.511L-31.498 27.039L-31.217 27.039L-31.217 27.527Q-31.217 27.781-31.323 28.021Q-31.428 28.261-31.625 28.414Q-31.823 28.566-32.080 28.566Q-32.397 28.566-32.649 28.443Q-32.901 28.320-33.039 28.086Q-33.178 27.851-33.178 27.527\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.392 -91.87)\">\u003Cpath d=\"M-30.302 29.785Q-30.188 29.863-30.013 29.863Q-29.724 29.863-29.503 29.650Q-29.282 29.437-29.157 29.136L-28.868 28.488L-30.142 25.601Q-30.224 25.425-30.368 25.381Q-30.513 25.336-30.782 25.336L-30.782 25.039L-29.063 25.039L-29.063 25.336Q-29.485 25.336-29.485 25.519Q-29.485 25.531-29.470 25.601L-28.532 27.726L-27.700 25.816Q-27.661 25.726-27.661 25.648Q-27.661 25.508-27.763 25.422Q-27.864 25.336-28.005 25.336L-28.005 25.039L-26.653 25.039L-26.653 25.336Q-26.907 25.336-27.101 25.461Q-27.294 25.586-27.399 25.816L-28.845 29.136Q-28.958 29.390-29.124 29.613Q-29.290 29.836-29.519 29.978Q-29.747 30.121-30.013 30.121Q-30.310 30.121-30.550 29.929Q-30.790 29.738-30.790 29.449Q-30.790 29.293-30.685 29.191Q-30.579 29.090-30.431 29.090Q-30.325 29.090-30.245 29.136Q-30.165 29.183-30.118 29.261Q-30.071 29.340-30.071 29.449Q-30.071 29.570-30.132 29.658Q-30.192 29.746-30.302 29.785\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-51.665 14.262H4.441\"\u002F>\u003Cpath fill=\"none\" d=\"M2.28 11.14c.468 1.873 1.51 2.757 2.56 3.122-1.05.364-2.092 1.249-2.56 3.122\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-51.665-2.81H4.441\"\u002F>\u003Cpath fill=\"none\" d=\"M2.28-5.933c.468 1.874 1.51 2.759 2.56 3.123-1.05.364-2.092 1.249-2.56 3.122\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-51.665-19.882H4.441\"\u002F>\u003Cpath fill=\"none\" d=\"M2.28-23.004c.468 1.873 1.51 2.758 2.56 3.122-1.05.365-2.092 1.25-2.56 3.123\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-51.665-36.953H4.441\"\u002F>\u003Cpath fill=\"none\" d=\"M2.28-40.076c.468 1.874 1.51 2.758 2.56 3.123-1.05.364-2.092 1.249-2.56 3.122\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(29.23 12.736)\">\u003Cpath d=\"M-66.491 28.488L-68.471 28.488L-68.471 28.191Q-68.202 28.191-68.034 28.146Q-67.866 28.101-67.866 27.929L-67.866 25.793Q-67.866 25.578-67.928 25.482Q-67.991 25.386-68.108 25.365Q-68.225 25.343-68.471 25.343L-68.471 25.047L-67.303 24.961L-67.303 25.746Q-67.225 25.535-67.073 25.349Q-66.921 25.164-66.721 25.062Q-66.522 24.961-66.296 24.961Q-66.049 24.961-65.858 25.105Q-65.667 25.250-65.667 25.480Q-65.667 25.636-65.772 25.746Q-65.878 25.855-66.034 25.855Q-66.190 25.855-66.299 25.746Q-66.409 25.636-66.409 25.480Q-66.409 25.320-66.303 25.215Q-66.628 25.215-66.842 25.443Q-67.057 25.672-67.153 26.011Q-67.249 26.351-67.249 26.656L-67.249 27.929Q-67.249 28.097-67.022 28.144Q-66.796 28.191-66.491 28.191L-66.491 28.488M-65.089 27.656Q-65.089 27.172-64.686 26.877Q-64.284 26.582-63.733 26.463Q-63.182 26.343-62.690 26.343L-62.690 26.054Q-62.690 25.828-62.805 25.621Q-62.921 25.414-63.118 25.295Q-63.315 25.175-63.546 25.175Q-63.971 25.175-64.257 25.281Q-64.186 25.308-64.139 25.363Q-64.092 25.418-64.067 25.488Q-64.042 25.558-64.042 25.633Q-64.042 25.738-64.092 25.830Q-64.143 25.922-64.235 25.972Q-64.327 26.023-64.432 26.023Q-64.538 26.023-64.630 25.972Q-64.721 25.922-64.772 25.830Q-64.823 25.738-64.823 25.633Q-64.823 25.215-64.434 25.068Q-64.046 24.922-63.546 24.922Q-63.214 24.922-62.860 25.052Q-62.507 25.183-62.278 25.437Q-62.049 25.691-62.049 26.039L-62.049 27.840Q-62.049 27.972-61.977 28.082Q-61.905 28.191-61.776 28.191Q-61.651 28.191-61.583 28.086Q-61.514 27.980-61.514 27.840L-61.514 27.328L-61.233 27.328L-61.233 27.840Q-61.233 28.043-61.350 28.201Q-61.467 28.359-61.649 28.443Q-61.831 28.527-62.034 28.527Q-62.264 28.527-62.417 28.355Q-62.569 28.183-62.600 27.953Q-62.760 28.234-63.069 28.400Q-63.378 28.566-63.729 28.566Q-64.241 28.566-64.665 28.343Q-65.089 28.121-65.089 27.656M-64.401 27.656Q-64.401 27.941-64.174 28.127Q-63.948 28.312-63.655 28.312Q-63.409 28.312-63.184 28.195Q-62.960 28.078-62.825 27.875Q-62.690 27.672-62.690 27.418L-62.690 26.586Q-62.956 26.586-63.241 26.640Q-63.526 26.695-63.798 26.824Q-64.069 26.953-64.235 27.160Q-64.401 27.367-64.401 27.656M-59.124 28.566Q-59.604 28.566-60.012 28.322Q-60.421 28.078-60.659 27.664Q-60.897 27.250-60.897 26.761Q-60.897 26.269-60.639 25.853Q-60.382 25.437-59.950 25.199Q-59.518 24.961-59.026 24.961Q-58.405 24.961-57.956 25.398L-57.956 23.769Q-57.956 23.554-58.018 23.459Q-58.081 23.363-58.198 23.342Q-58.315 23.320-58.561 23.320L-58.561 23.023L-57.339 22.937L-57.339 27.746Q-57.339 27.957-57.276 28.052Q-57.214 28.148-57.096 28.170Q-56.979 28.191-56.729 28.191L-56.729 28.488L-57.979 28.566L-57.979 28.082Q-58.444 28.566-59.124 28.566M-59.057 28.312Q-58.717 28.312-58.424 28.121Q-58.132 27.929-57.979 27.633L-57.979 25.800Q-58.128 25.527-58.389 25.371Q-58.651 25.215-58.964 25.215Q-59.589 25.215-59.872 25.662Q-60.155 26.109-60.155 26.769Q-60.155 27.414-59.903 27.863Q-59.651 28.312-59.057 28.312M-54.362 28.488L-56.139 28.488L-56.139 28.191Q-55.866 28.191-55.698 28.144Q-55.530 28.097-55.530 27.929L-55.530 25.793Q-55.530 25.578-55.587 25.482Q-55.643 25.386-55.757 25.365Q-55.870 25.343-56.116 25.343L-56.116 25.047L-54.917 24.961L-54.917 27.929Q-54.917 28.097-54.770 28.144Q-54.624 28.191-54.362 28.191L-54.362 28.488M-55.803 23.566Q-55.803 23.375-55.669 23.244Q-55.534 23.113-55.339 23.113Q-55.217 23.113-55.114 23.175Q-55.010 23.238-54.948 23.342Q-54.885 23.445-54.885 23.566Q-54.885 23.761-55.016 23.896Q-55.147 24.031-55.339 24.031Q-55.538 24.031-55.671 23.898Q-55.803 23.765-55.803 23.566M-53.764 27.656Q-53.764 27.172-53.362 26.877Q-52.960 26.582-52.409 26.463Q-51.858 26.343-51.366 26.343L-51.366 26.054Q-51.366 25.828-51.481 25.621Q-51.596 25.414-51.794 25.295Q-51.991 25.175-52.221 25.175Q-52.647 25.175-52.932 25.281Q-52.862 25.308-52.815 25.363Q-52.768 25.418-52.743 25.488Q-52.717 25.558-52.717 25.633Q-52.717 25.738-52.768 25.830Q-52.819 25.922-52.911 25.972Q-53.003 26.023-53.108 26.023Q-53.214 26.023-53.305 25.972Q-53.397 25.922-53.448 25.830Q-53.499 25.738-53.499 25.633Q-53.499 25.215-53.110 25.068Q-52.721 24.922-52.221 24.922Q-51.889 24.922-51.536 25.052Q-51.182 25.183-50.954 25.437Q-50.725 25.691-50.725 26.039L-50.725 27.840Q-50.725 27.972-50.653 28.082Q-50.581 28.191-50.452 28.191Q-50.327 28.191-50.258 28.086Q-50.190 27.980-50.190 27.840L-50.190 27.328L-49.909 27.328L-49.909 27.840Q-49.909 28.043-50.026 28.201Q-50.143 28.359-50.325 28.443Q-50.507 28.527-50.710 28.527Q-50.940 28.527-51.092 28.355Q-51.245 28.183-51.276 27.953Q-51.436 28.234-51.745 28.400Q-52.053 28.566-52.405 28.566Q-52.917 28.566-53.341 28.343Q-53.764 28.121-53.764 27.656M-53.077 27.656Q-53.077 27.941-52.850 28.127Q-52.624 28.312-52.331 28.312Q-52.085 28.312-51.860 28.195Q-51.635 28.078-51.501 27.875Q-51.366 27.672-51.366 27.418L-51.366 26.586Q-51.632 26.586-51.917 26.640Q-52.202 26.695-52.473 26.824Q-52.745 26.953-52.911 27.160Q-53.077 27.367-53.077 27.656M-48.991 27.527L-48.991 25.336L-49.694 25.336L-49.694 25.082Q-49.339 25.082-49.096 24.849Q-48.854 24.617-48.743 24.269Q-48.632 23.922-48.632 23.566L-48.350 23.566L-48.350 25.039L-47.174 25.039L-47.174 25.336L-48.350 25.336L-48.350 27.511Q-48.350 27.832-48.231 28.060Q-48.112 28.289-47.831 28.289Q-47.651 28.289-47.534 28.166Q-47.417 28.043-47.364 27.863Q-47.311 27.683-47.311 27.511L-47.311 27.039L-47.030 27.039L-47.030 27.527Q-47.030 27.781-47.135 28.021Q-47.241 28.261-47.438 28.414Q-47.635 28.566-47.893 28.566Q-48.210 28.566-48.462 28.443Q-48.714 28.320-48.852 28.086Q-48.991 27.851-48.991 27.527M-44.452 28.488L-46.229 28.488L-46.229 28.191Q-45.956 28.191-45.788 28.144Q-45.620 28.097-45.620 27.929L-45.620 25.793Q-45.620 25.578-45.676 25.482Q-45.733 25.386-45.846 25.365Q-45.960 25.343-46.206 25.343L-46.206 25.047L-45.007 24.961L-45.007 27.929Q-45.007 28.097-44.860 28.144Q-44.714 28.191-44.452 28.191L-44.452 28.488M-45.893 23.566Q-45.893 23.375-45.758 23.244Q-45.624 23.113-45.428 23.113Q-45.307 23.113-45.204 23.175Q-45.100 23.238-45.038 23.342Q-44.975 23.445-44.975 23.566Q-44.975 23.761-45.106 23.896Q-45.237 24.031-45.428 24.031Q-45.628 24.031-45.760 23.898Q-45.893 23.765-45.893 23.566M-42.151 28.457L-43.374 25.601Q-43.456 25.425-43.600 25.381Q-43.745 25.336-44.014 25.336L-44.014 25.039L-42.303 25.039L-42.303 25.336Q-42.725 25.336-42.725 25.519Q-42.725 25.554-42.710 25.601L-41.764 27.793L-40.924 25.816Q-40.885 25.738-40.885 25.648Q-40.885 25.508-40.991 25.422Q-41.096 25.336-41.237 25.336L-41.237 25.039L-39.885 25.039L-39.885 25.336Q-40.409 25.336-40.624 25.816L-41.749 28.457Q-41.811 28.566-41.917 28.566L-41.983 28.566Q-42.096 28.566-42.151 28.457\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(29.23 12.736)\">\u003Cpath d=\"M-39.686 26.734Q-39.686 26.254-39.453 25.838Q-39.221 25.422-38.811 25.172Q-38.401 24.922-37.924 24.922Q-37.194 24.922-36.795 25.363Q-36.397 25.804-36.397 26.535Q-36.397 26.640-36.490 26.664L-38.940 26.664L-38.940 26.734Q-38.940 27.144-38.819 27.500Q-38.697 27.855-38.426 28.072Q-38.154 28.289-37.725 28.289Q-37.361 28.289-37.065 28.060Q-36.768 27.832-36.666 27.480Q-36.658 27.433-36.572 27.418L-36.490 27.418Q-36.397 27.445-36.397 27.527Q-36.397 27.535-36.404 27.566Q-36.467 27.793-36.606 27.976Q-36.744 28.160-36.936 28.293Q-37.127 28.425-37.346 28.496Q-37.565 28.566-37.803 28.566Q-38.174 28.566-38.512 28.429Q-38.850 28.293-39.117 28.041Q-39.385 27.789-39.535 27.449Q-39.686 27.109-39.686 26.734M-38.932 26.425L-36.971 26.425Q-36.971 26.121-37.072 25.830Q-37.174 25.539-37.391 25.357Q-37.608 25.175-37.924 25.175Q-38.225 25.175-38.455 25.363Q-38.686 25.550-38.809 25.842Q-38.932 26.133-38.932 26.425\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M62.146 28.488V-56.87h91.049v85.358Zm91.049-85.358\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(153.504 -91.87)\">\u003Cpath d=\"M-66.569 28.488L-68.424 28.488L-68.424 28.191Q-68.151 28.191-67.983 28.144Q-67.815 28.097-67.815 27.929L-67.815 23.769Q-67.815 23.554-67.878 23.459Q-67.940 23.363-68.059 23.342Q-68.178 23.320-68.424 23.320L-68.424 23.023L-67.202 22.937L-67.202 25.640Q-67.077 25.429-66.889 25.279Q-66.702 25.129-66.475 25.045Q-66.249 24.961-66.003 24.961Q-64.835 24.961-64.835 26.039L-64.835 27.929Q-64.835 28.097-64.665 28.144Q-64.495 28.191-64.225 28.191L-64.225 28.488L-66.081 28.488L-66.081 28.191Q-65.807 28.191-65.639 28.144Q-65.471 28.097-65.471 27.929L-65.471 26.054Q-65.471 25.672-65.592 25.443Q-65.714 25.215-66.065 25.215Q-66.378 25.215-66.632 25.377Q-66.885 25.539-67.032 25.808Q-67.178 26.078-67.178 26.375L-67.178 27.929Q-67.178 28.097-67.008 28.144Q-66.839 28.191-66.569 28.191L-66.569 28.488M-61.921 28.488L-63.698 28.488L-63.698 28.191Q-63.424 28.191-63.257 28.144Q-63.089 28.097-63.089 27.929L-63.089 25.793Q-63.089 25.578-63.145 25.482Q-63.202 25.386-63.315 25.365Q-63.428 25.343-63.674 25.343L-63.674 25.047L-62.475 24.961L-62.475 27.929Q-62.475 28.097-62.329 28.144Q-62.182 28.191-61.921 28.191L-61.921 28.488M-63.362 23.566Q-63.362 23.375-63.227 23.244Q-63.092 23.113-62.897 23.113Q-62.776 23.113-62.673 23.175Q-62.569 23.238-62.507 23.342Q-62.444 23.445-62.444 23.566Q-62.444 23.761-62.575 23.896Q-62.706 24.031-62.897 24.031Q-63.096 24.031-63.229 23.898Q-63.362 23.765-63.362 23.566M-61.421 29.097Q-61.421 28.816-61.210 28.605Q-60.999 28.394-60.714 28.304Q-60.870 28.179-60.948 27.990Q-61.026 27.800-61.026 27.601Q-61.026 27.246-60.796 26.953Q-61.163 26.613-61.163 26.144Q-61.163 25.793-60.960 25.523Q-60.757 25.254-60.436 25.107Q-60.116 24.961-59.772 24.961Q-59.253 24.961-58.882 25.242Q-58.518 24.871-57.971 24.871Q-57.792 24.871-57.665 24.998Q-57.538 25.125-57.538 25.304Q-57.538 25.410-57.616 25.488Q-57.694 25.566-57.803 25.566Q-57.913 25.566-57.989 25.490Q-58.065 25.414-58.065 25.304Q-58.065 25.203-58.026 25.152Q-58.018 25.144-58.014 25.138Q-58.010 25.133-58.010 25.129Q-58.385 25.129-58.706 25.383Q-58.385 25.722-58.385 26.144Q-58.385 26.414-58.503 26.631Q-58.620 26.847-58.825 27.006Q-59.030 27.164-59.272 27.246Q-59.514 27.328-59.772 27.328Q-59.991 27.328-60.204 27.269Q-60.417 27.211-60.612 27.090Q-60.706 27.230-60.706 27.410Q-60.706 27.617-60.569 27.769Q-60.432 27.922-60.225 27.922L-59.530 27.922Q-59.042 27.922-58.630 28.006Q-58.217 28.090-57.938 28.347Q-57.659 28.605-57.659 29.097Q-57.659 29.461-57.979 29.693Q-58.299 29.925-58.741 30.027Q-59.182 30.129-59.538 30.129Q-59.893 30.129-60.337 30.027Q-60.780 29.925-61.100 29.693Q-61.421 29.461-61.421 29.097M-60.917 29.097Q-60.917 29.293-60.772 29.441Q-60.628 29.590-60.415 29.679Q-60.202 29.769-59.962 29.816Q-59.721 29.863-59.538 29.863Q-59.296 29.863-58.966 29.785Q-58.635 29.707-58.399 29.533Q-58.163 29.359-58.163 29.097Q-58.163 28.691-58.573 28.582Q-58.983 28.472-59.546 28.472L-60.225 28.472Q-60.495 28.472-60.706 28.650Q-60.917 28.828-60.917 29.097M-59.772 27.062Q-59.049 27.062-59.049 26.144Q-59.049 25.222-59.772 25.222Q-60.499 25.222-60.499 26.144Q-60.499 27.062-59.772 27.062M-55.245 28.488L-57.100 28.488L-57.100 28.191Q-56.827 28.191-56.659 28.144Q-56.491 28.097-56.491 27.929L-56.491 23.769Q-56.491 23.554-56.553 23.459Q-56.616 23.363-56.735 23.342Q-56.854 23.320-57.100 23.320L-57.100 23.023L-55.878 22.937L-55.878 25.640Q-55.753 25.429-55.565 25.279Q-55.378 25.129-55.151 25.045Q-54.924 24.961-54.678 24.961Q-53.510 24.961-53.510 26.039L-53.510 27.929Q-53.510 28.097-53.341 28.144Q-53.171 28.191-52.901 28.191L-52.901 28.488L-54.757 28.488L-54.757 28.191Q-54.483 28.191-54.315 28.144Q-54.147 28.097-54.147 27.929L-54.147 26.054Q-54.147 25.672-54.268 25.443Q-54.389 25.215-54.741 25.215Q-55.053 25.215-55.307 25.377Q-55.561 25.539-55.708 25.808Q-55.854 26.078-55.854 26.375L-55.854 27.929Q-55.854 28.097-55.684 28.144Q-55.514 28.191-55.245 28.191\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(153.504 -91.87)\">\u003Cpath d=\"M-49.610 26.793Q-49.610 26.289-49.354 25.857Q-49.098 25.425-48.662 25.174Q-48.227 24.922-47.727 24.922Q-47.340 24.922-46.998 25.066Q-46.657 25.211-46.395 25.472Q-46.133 25.734-45.991 26.070Q-45.848 26.406-45.848 26.793Q-45.848 27.285-46.112 27.695Q-46.375 28.105-46.805 28.336Q-47.235 28.566-47.727 28.566Q-48.219 28.566-48.653 28.334Q-49.086 28.101-49.348 27.693Q-49.610 27.285-49.610 26.793M-47.727 28.289Q-47.270 28.289-47.018 28.066Q-46.766 27.843-46.678 27.492Q-46.590 27.140-46.590 26.695Q-46.590 26.265-46.684 25.927Q-46.778 25.590-47.032 25.383Q-47.285 25.175-47.727 25.175Q-48.375 25.175-48.619 25.592Q-48.864 26.008-48.864 26.695Q-48.864 27.140-48.776 27.492Q-48.688 27.843-48.436 28.066Q-48.184 28.289-47.727 28.289M-43.481 30.039L-45.336 30.039L-45.336 29.746Q-45.067 29.746-44.899 29.701Q-44.731 29.656-44.731 29.480L-44.731 25.656Q-44.731 25.449-44.887 25.396Q-45.043 25.343-45.336 25.343L-45.336 25.047L-44.114 24.961L-44.114 25.425Q-43.883 25.203-43.569 25.082Q-43.254 24.961-42.914 24.961Q-42.442 24.961-42.037 25.207Q-41.633 25.453-41.401 25.869Q-41.168 26.285-41.168 26.761Q-41.168 27.136-41.317 27.465Q-41.465 27.793-41.735 28.045Q-42.004 28.297-42.348 28.431Q-42.692 28.566-43.051 28.566Q-43.340 28.566-43.612 28.445Q-43.883 28.324-44.090 28.113L-44.090 29.480Q-44.090 29.656-43.922 29.701Q-43.754 29.746-43.481 29.746L-43.481 30.039M-44.090 25.824L-44.090 27.664Q-43.938 27.953-43.676 28.133Q-43.414 28.312-43.106 28.312Q-42.821 28.312-42.598 28.174Q-42.375 28.035-42.223 27.804Q-42.071 27.574-41.993 27.302Q-41.914 27.031-41.914 26.761Q-41.914 26.429-42.039 26.072Q-42.164 25.715-42.412 25.478Q-42.660 25.242-43.008 25.242Q-43.332 25.242-43.627 25.398Q-43.922 25.554-44.090 25.824M-40.547 27.656Q-40.547 27.172-40.145 26.877Q-39.743 26.582-39.192 26.463Q-38.641 26.343-38.149 26.343L-38.149 26.054Q-38.149 25.828-38.264 25.621Q-38.379 25.414-38.577 25.295Q-38.774 25.175-39.004 25.175Q-39.430 25.175-39.715 25.281Q-39.645 25.308-39.598 25.363Q-39.551 25.418-39.526 25.488Q-39.500 25.558-39.500 25.633Q-39.500 25.738-39.551 25.830Q-39.602 25.922-39.694 25.972Q-39.785 26.023-39.891 26.023Q-39.996 26.023-40.088 25.972Q-40.180 25.922-40.231 25.830Q-40.282 25.738-40.282 25.633Q-40.282 25.215-39.893 25.068Q-39.504 24.922-39.004 24.922Q-38.672 24.922-38.319 25.052Q-37.965 25.183-37.737 25.437Q-37.508 25.691-37.508 26.039L-37.508 27.840Q-37.508 27.972-37.436 28.082Q-37.364 28.191-37.235 28.191Q-37.110 28.191-37.041 28.086Q-36.973 27.980-36.973 27.840L-36.973 27.328L-36.692 27.328L-36.692 27.840Q-36.692 28.043-36.809 28.201Q-36.926 28.359-37.108 28.443Q-37.289 28.527-37.493 28.527Q-37.723 28.527-37.875 28.355Q-38.028 28.183-38.059 27.953Q-38.219 28.234-38.528 28.400Q-38.836 28.566-39.188 28.566Q-39.700 28.566-40.123 28.343Q-40.547 28.121-40.547 27.656M-39.860 27.656Q-39.860 27.941-39.633 28.127Q-39.407 28.312-39.114 28.312Q-38.868 28.312-38.643 28.195Q-38.418 28.078-38.284 27.875Q-38.149 27.672-38.149 27.418L-38.149 26.586Q-38.414 26.586-38.700 26.640Q-38.985 26.695-39.256 26.824Q-39.528 26.953-39.694 27.160Q-39.860 27.367-39.860 27.656M-36.356 26.761Q-36.356 26.265-36.106 25.840Q-35.856 25.414-35.436 25.168Q-35.016 24.922-34.516 24.922Q-33.977 24.922-33.586 25.047Q-33.196 25.172-33.196 25.586Q-33.196 25.691-33.246 25.783Q-33.297 25.875-33.389 25.925Q-33.481 25.976-33.590 25.976Q-33.696 25.976-33.787 25.925Q-33.879 25.875-33.930 25.783Q-33.981 25.691-33.981 25.586Q-33.981 25.363-33.813 25.258Q-34.035 25.199-34.508 25.199Q-34.805 25.199-35.020 25.338Q-35.235 25.476-35.366 25.707Q-35.496 25.937-35.555 26.207Q-35.614 26.476-35.614 26.761Q-35.614 27.156-35.481 27.506Q-35.348 27.855-35.077 28.072Q-34.805 28.289-34.407 28.289Q-34.032 28.289-33.756 28.072Q-33.481 27.855-33.379 27.496Q-33.364 27.433-33.301 27.433L-33.196 27.433Q-33.160 27.433-33.135 27.461Q-33.110 27.488-33.110 27.527L-33.110 27.550Q-33.243 28.031-33.627 28.299Q-34.012 28.566-34.516 28.566Q-34.879 28.566-35.213 28.429Q-35.547 28.293-35.807 28.043Q-36.067 27.793-36.211 27.457Q-36.356 27.121-36.356 26.761M-30.762 28.488L-32.539 28.488L-32.539 28.191Q-32.266 28.191-32.098 28.144Q-31.930 28.097-31.930 27.929L-31.930 25.793Q-31.930 25.578-31.987 25.482Q-32.043 25.386-32.157 25.365Q-32.270 25.343-32.516 25.343L-32.516 25.047L-31.317 24.961L-31.317 27.929Q-31.317 28.097-31.170 28.144Q-31.024 28.191-30.762 28.191L-30.762 28.488M-32.203 23.566Q-32.203 23.375-32.069 23.244Q-31.934 23.113-31.739 23.113Q-31.618 23.113-31.514 23.175Q-31.410 23.238-31.348 23.342Q-31.285 23.445-31.285 23.566Q-31.285 23.761-31.416 23.896Q-31.547 24.031-31.739 24.031Q-31.938 24.031-32.071 23.898Q-32.203 23.765-32.203 23.566M-29.637 27.527L-29.637 25.336L-30.340 25.336L-30.340 25.082Q-29.985 25.082-29.743 24.849Q-29.500 24.617-29.389 24.269Q-29.278 23.922-29.278 23.566L-28.996 23.566L-28.996 25.039L-27.821 25.039L-27.821 25.336L-28.996 25.336L-28.996 27.511Q-28.996 27.832-28.877 28.060Q-28.758 28.289-28.477 28.289Q-28.297 28.289-28.180 28.166Q-28.063 28.043-28.010 27.863Q-27.957 27.683-27.957 27.511L-27.957 27.039L-27.676 27.039L-27.676 27.527Q-27.676 27.781-27.782 28.021Q-27.887 28.261-28.084 28.414Q-28.282 28.566-28.539 28.566Q-28.856 28.566-29.108 28.443Q-29.360 28.320-29.498 28.086Q-29.637 27.851-29.637 27.527\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(153.504 -91.87)\">\u003Cpath d=\"M-26.761 29.785Q-26.647 29.863-26.472 29.863Q-26.183 29.863-25.962 29.650Q-25.741 29.437-25.616 29.136L-25.327 28.488L-26.601 25.601Q-26.683 25.425-26.827 25.381Q-26.972 25.336-27.241 25.336L-27.241 25.039L-25.522 25.039L-25.522 25.336Q-25.944 25.336-25.944 25.519Q-25.944 25.531-25.929 25.601L-24.991 27.726L-24.159 25.816Q-24.120 25.726-24.120 25.648Q-24.120 25.508-24.222 25.422Q-24.323 25.336-24.464 25.336L-24.464 25.039L-23.112 25.039L-23.112 25.336Q-23.366 25.336-23.560 25.461Q-23.753 25.586-23.858 25.816L-25.304 29.136Q-25.417 29.390-25.583 29.613Q-25.749 29.836-25.978 29.978Q-26.206 30.121-26.472 30.121Q-26.769 30.121-27.009 29.929Q-27.249 29.738-27.249 29.449Q-27.249 29.293-27.144 29.191Q-27.038 29.090-26.890 29.090Q-26.784 29.090-26.704 29.136Q-26.624 29.183-26.577 29.261Q-26.530 29.340-26.530 29.449Q-26.530 29.570-26.591 29.658Q-26.651 29.746-26.761 29.785\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M84.908 17.107C73.527-14.19 73.527-14.19 84.635-44.737\"\u002F>\u003Cpath fill=\"none\" d=\"M80.962-43.775c1.92.201 3.108-.476 3.81-1.338-.017 1.111.458 2.393 2.06 3.473\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M107.67-45.49c11.382 31.299 11.382 31.299.274 61.845\"\u002F>\u003Cpath fill=\"none\" d=\"M111.617 15.392c-1.92-.2-3.108.477-3.81 1.34.017-1.112-.459-2.394-2.06-3.474\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799992\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M130.433 17.107c-11.381-31.298-11.381-31.298-.274-61.844\"\u002F>\u003Cpath fill=\"none\" d=\"M126.486-43.775c1.921.201 3.109-.476 3.81-1.338-.017 1.111.459 2.393 2.06 3.473\" style=\"stroke-linecap:round;stroke-linejoin:round;stroke-width:.799992\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(157.4 12.641)\">\u003Cpath d=\"M-68.456 26.761Q-68.456 26.265-68.206 25.840Q-67.956 25.414-67.536 25.168Q-67.116 24.922-66.616 24.922Q-66.077 24.922-65.686 25.047Q-65.296 25.172-65.296 25.586Q-65.296 25.691-65.346 25.783Q-65.397 25.875-65.489 25.925Q-65.581 25.976-65.690 25.976Q-65.796 25.976-65.887 25.925Q-65.979 25.875-66.030 25.783Q-66.081 25.691-66.081 25.586Q-66.081 25.363-65.913 25.258Q-66.135 25.199-66.608 25.199Q-66.905 25.199-67.120 25.338Q-67.335 25.476-67.466 25.707Q-67.596 25.937-67.655 26.207Q-67.714 26.476-67.714 26.761Q-67.714 27.156-67.581 27.506Q-67.448 27.855-67.176 28.072Q-66.905 28.289-66.507 28.289Q-66.132 28.289-65.856 28.072Q-65.581 27.855-65.479 27.496Q-65.464 27.433-65.401 27.433L-65.296 27.433Q-65.260 27.433-65.235 27.461Q-65.210 27.488-65.210 27.527L-65.210 27.550Q-65.342 28.031-65.727 28.299Q-66.112 28.566-66.616 28.566Q-66.979 28.566-67.313 28.429Q-67.647 28.293-67.907 28.043Q-68.167 27.793-68.311 27.457Q-68.456 27.121-68.456 26.761M-64.721 26.793Q-64.721 26.289-64.466 25.857Q-64.210 25.425-63.774 25.174Q-63.339 24.922-62.839 24.922Q-62.452 24.922-62.110 25.066Q-61.768 25.211-61.507 25.472Q-61.245 25.734-61.102 26.070Q-60.960 26.406-60.960 26.793Q-60.960 27.285-61.223 27.695Q-61.487 28.105-61.917 28.336Q-62.346 28.566-62.839 28.566Q-63.331 28.566-63.764 28.334Q-64.198 28.101-64.460 27.693Q-64.721 27.285-64.721 26.793M-62.839 28.289Q-62.382 28.289-62.130 28.066Q-61.878 27.843-61.790 27.492Q-61.702 27.140-61.702 26.695Q-61.702 26.265-61.796 25.927Q-61.889 25.590-62.143 25.383Q-62.397 25.175-62.839 25.175Q-63.487 25.175-63.731 25.592Q-63.975 26.008-63.975 26.695Q-63.975 27.140-63.887 27.492Q-63.799 27.843-63.548 28.066Q-63.296 28.289-62.839 28.289M-58.546 28.488L-60.401 28.488L-60.401 28.191Q-60.128 28.191-59.960 28.144Q-59.792 28.097-59.792 27.929L-59.792 25.793Q-59.792 25.578-59.854 25.482Q-59.917 25.386-60.036 25.365Q-60.155 25.343-60.401 25.343L-60.401 25.047L-59.210 24.961L-59.210 25.695Q-59.096 25.480-58.903 25.312Q-58.710 25.144-58.471 25.052Q-58.233 24.961-57.979 24.961Q-56.811 24.961-56.811 26.039L-56.811 27.929Q-56.811 28.097-56.641 28.144Q-56.471 28.191-56.202 28.191L-56.202 28.488L-58.057 28.488L-58.057 28.191Q-57.784 28.191-57.616 28.144Q-57.448 28.097-57.448 27.929L-57.448 26.054Q-57.448 25.672-57.569 25.443Q-57.690 25.215-58.042 25.215Q-58.354 25.215-58.608 25.377Q-58.862 25.539-59.008 25.808Q-59.155 26.078-59.155 26.375L-59.155 27.929Q-59.155 28.097-58.985 28.144Q-58.815 28.191-58.546 28.191\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(157.4 12.641)\">\u003Cpath d=\"M-54.184 28.457L-55.407 25.601Q-55.489 25.425-55.633 25.381Q-55.778 25.336-56.047 25.336L-56.047 25.039L-54.336 25.039L-54.336 25.336Q-54.758 25.336-54.758 25.519Q-54.758 25.554-54.743 25.601L-53.797 27.793L-52.957 25.816Q-52.918 25.738-52.918 25.648Q-52.918 25.508-53.024 25.422Q-53.129 25.336-53.270 25.336L-53.270 25.039L-51.918 25.039L-51.918 25.336Q-52.442 25.336-52.657 25.816L-53.782 28.457Q-53.844 28.566-53.950 28.566L-54.016 28.566Q-54.129 28.566-54.184 28.457\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(157.4 12.641)\">\u003Cpath d=\"M-51.735 26.734Q-51.735 26.254-51.502 25.838Q-51.270 25.422-50.860 25.172Q-50.450 24.922-49.973 24.922Q-49.243 24.922-48.844 25.363Q-48.446 25.804-48.446 26.535Q-48.446 26.640-48.539 26.664L-50.989 26.664L-50.989 26.734Q-50.989 27.144-50.868 27.500Q-50.746 27.855-50.475 28.072Q-50.203 28.289-49.774 28.289Q-49.410 28.289-49.114 28.060Q-48.817 27.832-48.715 27.480Q-48.707 27.433-48.621 27.418L-48.539 27.418Q-48.446 27.445-48.446 27.527Q-48.446 27.535-48.453 27.566Q-48.516 27.793-48.655 27.976Q-48.793 28.160-48.985 28.293Q-49.176 28.425-49.395 28.496Q-49.614 28.566-49.852 28.566Q-50.223 28.566-50.561 28.429Q-50.899 28.293-51.166 28.041Q-51.434 27.789-51.584 27.449Q-51.735 27.109-51.735 26.734M-50.981 26.425L-49.020 26.425Q-49.020 26.121-49.121 25.830Q-49.223 25.539-49.440 25.357Q-49.657 25.175-49.973 25.175Q-50.274 25.175-50.504 25.363Q-50.735 25.550-50.858 25.842Q-50.981 26.133-50.981 26.425M-47.914 26.761Q-47.914 26.265-47.664 25.840Q-47.414 25.414-46.994 25.168Q-46.575 24.922-46.075 24.922Q-45.535 24.922-45.145 25.047Q-44.754 25.172-44.754 25.586Q-44.754 25.691-44.805 25.783Q-44.856 25.875-44.948 25.925Q-45.039 25.976-45.149 25.976Q-45.254 25.976-45.346 25.925Q-45.438 25.875-45.489 25.783Q-45.539 25.691-45.539 25.586Q-45.539 25.363-45.371 25.258Q-45.594 25.199-46.067 25.199Q-46.364 25.199-46.578 25.338Q-46.793 25.476-46.924 25.707Q-47.055 25.937-47.114 26.207Q-47.172 26.476-47.172 26.761Q-47.172 27.156-47.039 27.506Q-46.907 27.855-46.635 28.072Q-46.364 28.289-45.965 28.289Q-45.590 28.289-45.315 28.072Q-45.039 27.855-44.938 27.496Q-44.922 27.433-44.860 27.433L-44.754 27.433Q-44.719 27.433-44.694 27.461Q-44.668 27.488-44.668 27.527L-44.668 27.550Q-44.801 28.031-45.186 28.299Q-45.571 28.566-46.075 28.566Q-46.438 28.566-46.772 28.429Q-47.106 28.293-47.366 28.043Q-47.625 27.793-47.770 27.457Q-47.914 27.121-47.914 26.761M-43.555 27.527L-43.555 25.336L-44.258 25.336L-44.258 25.082Q-43.903 25.082-43.660 24.849Q-43.418 24.617-43.307 24.269Q-43.196 23.922-43.196 23.566L-42.914 23.566L-42.914 25.039L-41.739 25.039L-41.739 25.336L-42.914 25.336L-42.914 27.511Q-42.914 27.832-42.795 28.060Q-42.676 28.289-42.395 28.289Q-42.215 28.289-42.098 28.166Q-41.981 28.043-41.928 27.863Q-41.875 27.683-41.875 27.511L-41.875 27.039L-41.594 27.039L-41.594 27.527Q-41.594 27.781-41.700 28.021Q-41.805 28.261-42.002 28.414Q-42.200 28.566-42.457 28.566Q-42.774 28.566-43.026 28.443Q-43.278 28.320-43.416 28.086Q-43.555 27.851-43.555 27.527M-39.016 28.488L-40.793 28.488L-40.793 28.191Q-40.520 28.191-40.352 28.144Q-40.184 28.097-40.184 27.929L-40.184 25.793Q-40.184 25.578-40.241 25.482Q-40.297 25.386-40.410 25.365Q-40.524 25.343-40.770 25.343L-40.770 25.047L-39.571 24.961L-39.571 27.929Q-39.571 28.097-39.424 28.144Q-39.278 28.191-39.016 28.191L-39.016 28.488M-40.457 23.566Q-40.457 23.375-40.323 23.244Q-40.188 23.113-39.993 23.113Q-39.871 23.113-39.768 23.175Q-39.664 23.238-39.602 23.342Q-39.539 23.445-39.539 23.566Q-39.539 23.761-39.670 23.896Q-39.801 24.031-39.993 24.031Q-40.192 24.031-40.325 23.898Q-40.457 23.765-40.457 23.566M-36.715 28.457L-37.938 25.601Q-38.020 25.425-38.164 25.381Q-38.309 25.336-38.578 25.336L-38.578 25.039L-36.868 25.039L-36.868 25.336Q-37.289 25.336-37.289 25.519Q-37.289 25.554-37.274 25.601L-36.328 27.793L-35.489 25.816Q-35.450 25.738-35.450 25.648Q-35.450 25.508-35.555 25.422Q-35.660 25.336-35.801 25.336L-35.801 25.039L-34.450 25.039L-34.450 25.336Q-34.973 25.336-35.188 25.816L-36.313 28.457Q-36.375 28.566-36.481 28.566L-36.547 28.566Q-36.660 28.566-36.715 28.457\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(157.4 12.641)\">\u003Cpath d=\"M-34.262 26.734Q-34.262 26.254-34.029 25.838Q-33.797 25.422-33.387 25.172Q-32.977 24.922-32.500 24.922Q-31.770 24.922-31.371 25.363Q-30.973 25.804-30.973 26.535Q-30.973 26.640-31.066 26.664L-33.516 26.664L-33.516 26.734Q-33.516 27.144-33.395 27.500Q-33.273 27.855-33.002 28.072Q-32.730 28.289-32.301 28.289Q-31.937 28.289-31.641 28.060Q-31.344 27.832-31.242 27.480Q-31.234 27.433-31.148 27.418L-31.066 27.418Q-30.973 27.445-30.973 27.527Q-30.973 27.535-30.980 27.566Q-31.043 27.793-31.182 27.976Q-31.320 28.160-31.512 28.293Q-31.703 28.425-31.922 28.496Q-32.141 28.566-32.379 28.566Q-32.750 28.566-33.088 28.429Q-33.426 28.293-33.693 28.041Q-33.961 27.789-34.111 27.449Q-34.262 27.109-34.262 26.734M-33.508 26.425L-31.547 26.425Q-31.547 26.121-31.648 25.830Q-31.750 25.539-31.967 25.357Q-32.184 25.175-32.500 25.175Q-32.801 25.175-33.031 25.363Q-33.262 25.550-33.385 25.842Q-33.508 26.133-33.508 26.425\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Where high opacity forces the radiative gradient steeper than the adiabatic gradient a rising parcel follows, the layer convects; where the radiative gradient stays shallow, energy diffuses as radiation.\u003C\u002Ffigcaption>",1786059675117]