[{"data":1,"prerenderedAt":11485},["ShallowReactive",2],{"lesson:\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":3,"course-wordcounts":5751,"ref-card-index":6663,"nav:condensed-matter":11349,"tikz:2fccc5f88a1dc67d6434899ea526c7539ba89f7a770692d7ad7ce9fcefddf96e":11480,"tikz:eba0efac26edda8b2f810fba74098d0c7757457c70eda35641a178e535ecb77d":11481,"tikz:5c56366355ea55dcc6b7625a7228e963bfa5d33b907a3bdf492546541c4ddde9":11482,"tikz:352766028e123373fa893662afa93b44ab4da09ba6eb14ec14ea605175019c63":11483,"tikz:799b227ff9fbc4a9c6b22fe87bce4fe8ab8c9a824f3413b491df313d749d8ad3":11484},{"id":4,"title":5,"blurb":6,"body":7,"brief":5720,"category":5721,"description":5722,"draft":5723,"extension":5724,"meta":5725,"module":5728,"navigation":5729,"path":5730,"practice":5731,"rawbody":5732,"readingTime":5733,"seo":5738,"sources":5739,"status":5746,"stem":5747,"summary":5748,"topics":5749,"__hash__":5750},"course\u002F07.condensed-matter\u002F02.molecular-spectra\u002F03.raman-and-electronic-bands.md","Raman Scattering and Electronic Bands","",{"type":8,"value":9,"toc":5713},"minimark",[10,163,168,879,1238,1241,2131,2482,2489,2493,2577,3218,3221,3224,3228,3231,3498,3569,3875,4085,4089,4096,4125,4128,4227,4649,4809,4812,4850,4854,5022,5025,5028,5592,5704],[11,12,13,14,96,97,153,154,158,159,162],"p",{},"Infrared absorption reaches only vibrations that change the electric dipole\nmoment, so it is blind to the symmetric stretch of a homonuclear molecule such as\n",[15,16,19],"span",{"className":17},[18],"katex",[15,20,24],{"className":21,"ariaHidden":23},[22],"katex-html","true",[15,25,28,33],{"className":26},[27],"base",[15,29],{"className":30,"style":32},[31],"strut","height:0.8333em;vertical-align:-0.15em;",[15,34,37,45],{"className":35},[36],"mord",[15,38,41],{"className":39},[36,40],"text",[15,42,44],{"className":43},[36],"N",[15,46,49],{"className":47},[48],"msupsub",[15,50,54,87],{"className":51},[52,53],"vlist-t","vlist-t2",[15,55,58,82],{"className":56},[57],"vlist-r",[15,59,63],{"className":60,"style":62},[61],"vlist","height:0.3011em;",[15,64,66,71],{"style":65},"top:-2.55em;margin-right:0.05em;",[15,67],{"className":68,"style":70},[69],"pstrut","height:2.7em;",[15,72,78],{"className":73},[74,75,76,77],"sizing","reset-size6","size3","mtight",[15,79,81],{"className":80},[36,77],"2",[15,83,86],{"className":84},[85],"vlist-s","​",[15,88,90],{"className":89},[57],[15,91,94],{"className":92,"style":93},[61],"height:0.15em;",[15,95],{}," or ",[15,98,100],{"className":99},[18],[15,101,103],{"className":102,"ariaHidden":23},[22],[15,104,106,109],{"className":105},[27],[15,107],{"className":108,"style":32},[31],[15,110,112,119],{"className":111},[36],[15,113,115],{"className":114},[36,40],[15,116,118],{"className":117},[36],"O",[15,120,122],{"className":121},[48],[15,123,125,145],{"className":124},[52,53],[15,126,128,142],{"className":127},[57],[15,129,131],{"className":130,"style":62},[61],[15,132,133,136],{"style":65},[15,134],{"className":135,"style":70},[69],[15,137,139],{"className":138},[74,75,76,77],[15,140,81],{"className":141},[36,77],[15,143,86],{"className":144},[85],[15,146,148],{"className":147},[57],[15,149,151],{"className":150,"style":93},[61],[15,152],{},". Two other processes fill the gap. ",[155,156,157],"strong",{},"Raman\nscattering"," probes vibrations that change the polarizability, complementary to\nthe infrared rule, and ",[155,160,161],{},"electronic excitation"," lifts the molecule to a new\nelectronic state whose vibrational structure prints a band system on the\nspectrum. Both are governed by matrix elements between vibrational states, and\nboth carry structural and thermal information that pure absorption cannot.",[164,165,167],"h2",{"id":166},"rayleigh-and-raman-scattering","Rayleigh and Raman scattering",[11,169,170,171,229,230,465,466,582,583,599,600,652,653,656,657,672,673,733,734,878],{},"When light of frequency ",[15,172,174],{"className":173},[18],[15,175,177],{"className":176,"ariaHidden":23},[22],[15,178,180,184],{"className":179},[27],[15,181],{"className":182,"style":183},[31],"height:0.5806em;vertical-align:-0.15em;",[15,185,187,193],{"className":186},[36],[15,188,192],{"className":189,"style":191},[36,190],"mathnormal","margin-right:0.0637em;","ν",[15,194,196],{"className":195},[48],[15,197,199,221],{"className":198},[52,53],[15,200,202,218],{"className":201},[57],[15,203,205],{"className":204,"style":62},[61],[15,206,208,211],{"style":207},"top:-2.55em;margin-left:-0.0637em;margin-right:0.05em;",[15,209],{"className":210,"style":70},[69],[15,212,214],{"className":213},[74,75,76,77],[15,215,217],{"className":216},[36,77],"0",[15,219,86],{"className":220},[85],[15,222,224],{"className":223},[57],[15,225,227],{"className":226,"style":93},[61],[15,228],{}," falls on a molecule, its electric field\n",[15,231,233],{"className":232},[18],[15,234,236,310],{"className":235,"ariaHidden":23},[22],[15,237,239,243,297,302,307],{"className":238},[27],[15,240],{"className":241,"style":242},[31],"height:0.9663em;",[15,244,247],{"className":245},[36,246],"accent",[15,248,250],{"className":249},[52],[15,251,253],{"className":252},[57],[15,254,256,268],{"className":255,"style":242},[61],[15,257,259,263],{"style":258},"top:-3em;",[15,260],{"className":261,"style":262},[69],"height:3em;",[15,264,267],{"className":265,"style":266},[36,190],"margin-right:0.0576em;","E",[15,269,271,274],{"style":270},"top:-3.2523em;",[15,272],{"className":273,"style":262},[69],[15,275,279],{"className":276,"style":278},[277],"accent-body","left:-0.1522em;",[15,280,284],{"className":281,"style":283},[282],"overlay","height:0.714em;width:0.471em;",[285,286,293],"svg",{"xmlns":287,"width":288,"height":289,"style":290,"viewBox":291,"preserveAspectRatio":292},"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg","0.471em","0.714em","width:0.471em","0 0 471 714","xMinYMin",[294,295],"path",{"d":296},"M377 20c0-5.333 1.833-10 5.5-14S391 0 397 0c4.667 0 8.667 1.667 12 5\n3.333 2.667 6.667 9 10 19 6.667 24.667 20.333 43.667 41 57 7.333 4.667 11\n10.667 11 18 0 6-1 10-3 12s-6.667 5-14 9c-28.667 14.667-53.667 35.667-75 63\n-1.333 1.333-3.167 3.5-5.5 6.5s-4 4.833-5 5.5c-1 .667-2.5 1.333-4.5 2s-4.333 1\n-7 1c-4.667 0-9.167-1.833-13.5-5.5S337 184 337 178c0-12.667 15.667-32.333 47-59\nH213l-171-1c-8.667-6-13-12.333-13-19 0-4.667 4.333-11.333 13-20h359\nc-16-25.333-24-45-24-59z",[15,298],{"className":299,"style":301},[300],"mspace","margin-right:0.2778em;",[15,303,306],{"className":304},[305],"mrel","=",[15,308],{"className":309,"style":301},[300],[15,311,313,317,390,394,403,408,411,416,456,460],{"className":312},[27],[15,314],{"className":315,"style":316},[31],"height:1.2163em;vertical-align:-0.25em;",[15,318,320,355],{"className":319},[36],[15,321,323],{"className":322},[36,246],[15,324,326],{"className":325},[52],[15,327,329],{"className":328},[57],[15,330,332,340],{"className":331,"style":242},[61],[15,333,334,337],{"style":258},[15,335],{"className":336,"style":262},[69],[15,338,267],{"className":339,"style":266},[36,190],[15,341,342,345],{"style":270},[15,343],{"className":344,"style":262},[69],[15,346,348],{"className":347,"style":278},[277],[15,349,351],{"className":350,"style":283},[282],[285,352,353],{"xmlns":287,"width":288,"height":289,"style":290,"viewBox":291,"preserveAspectRatio":292},[294,354],{"d":296},[15,356,358],{"className":357},[48],[15,359,361,382],{"className":360},[52,53],[15,362,364,379],{"className":363},[57],[15,365,367],{"className":366,"style":62},[61],[15,368,370,373],{"style":369},"top:-2.55em;margin-left:-0.0576em;margin-right:0.05em;",[15,371],{"className":372,"style":70},[69],[15,374,376],{"className":375},[74,75,76,77],[15,377,217],{"className":378},[36,77],[15,380,86],{"className":381},[85],[15,383,385],{"className":384},[57],[15,386,388],{"className":387,"style":93},[61],[15,389],{},[15,391],{"className":392,"style":393},[300],"margin-right:0.1667em;",[15,395,398],{"className":396},[397],"mop",[15,399,402],{"className":400},[36,401],"mathrm","cos",[15,404,407],{"className":405},[406],"mopen","(",[15,409,81],{"className":410},[36],[15,412,415],{"className":413,"style":414},[36,190],"margin-right:0.0359em;","π",[15,417,419,422],{"className":418},[36],[15,420,192],{"className":421,"style":191},[36,190],[15,423,425],{"className":424},[48],[15,426,428,448],{"className":427},[52,53],[15,429,431,445],{"className":430},[57],[15,432,434],{"className":433,"style":62},[61],[15,435,436,439],{"style":207},[15,437],{"className":438,"style":70},[69],[15,440,442],{"className":441},[74,75,76,77],[15,443,217],{"className":444},[36,77],[15,446,86],{"className":447},[85],[15,449,451],{"className":450},[57],[15,452,454],{"className":453,"style":93},[61],[15,455],{},[15,457,459],{"className":458},[36,190],"t",[15,461,464],{"className":462},[463],"mclose",")"," induces a dipole moment ",[15,467,469],{"className":468},[18],[15,470,472,536],{"className":471,"ariaHidden":23},[22],[15,473,475,479,527,530,533],{"className":474},[27],[15,476],{"className":477,"style":478},[31],"height:0.9084em;vertical-align:-0.1944em;",[15,480,482],{"className":481},[36,246],[15,483,485,518],{"className":484},[52,53],[15,486,488,515],{"className":487},[57],[15,489,492,500],{"className":490,"style":491},[61],"height:0.714em;",[15,493,494,497],{"style":258},[15,495],{"className":496,"style":262},[69],[15,498,11],{"className":499},[36,190],[15,501,502,505],{"style":258},[15,503],{"className":504,"style":262},[69],[15,506,508],{"className":507,"style":278},[277],[15,509,511],{"className":510,"style":283},[282],[285,512,513],{"xmlns":287,"width":288,"height":289,"style":290,"viewBox":291,"preserveAspectRatio":292},[294,514],{"d":296},[15,516,86],{"className":517},[85],[15,519,521],{"className":520},[57],[15,522,525],{"className":523,"style":524},[61],"height:0.1944em;",[15,526],{},[15,528],{"className":529,"style":301},[300],[15,531,306],{"className":532},[305],[15,534],{"className":535,"style":301},[300],[15,537,539,542,547],{"className":538},[27],[15,540],{"className":541,"style":242},[31],[15,543,546],{"className":544,"style":545},[36,190],"margin-right:0.0037em;","α",[15,548,550],{"className":549},[36,246],[15,551,553],{"className":552},[52],[15,554,556],{"className":555},[57],[15,557,559,567],{"className":558,"style":242},[61],[15,560,561,564],{"style":258},[15,562],{"className":563,"style":262},[69],[15,565,267],{"className":566,"style":266},[36,190],[15,568,569,572],{"style":270},[15,570],{"className":571,"style":262},[69],[15,573,575],{"className":574,"style":278},[277],[15,576,578],{"className":577,"style":283},[282],[285,579,580],{"xmlns":287,"width":288,"height":289,"style":290,"viewBox":291,"preserveAspectRatio":292},[294,581],{"d":296},", where ",[15,584,586],{"className":585},[18],[15,587,589],{"className":588,"ariaHidden":23},[22],[15,590,592,596],{"className":591},[27],[15,593],{"className":594,"style":595},[31],"height:0.4306em;",[15,597,546],{"className":598,"style":545},[36,190]," is the polarizability. The oscillating dipole reradiates\nat ",[15,601,603],{"className":602},[18],[15,604,606],{"className":605,"ariaHidden":23},[22],[15,607,609,612],{"className":608},[27],[15,610],{"className":611,"style":183},[31],[15,613,615,618],{"className":614},[36],[15,616,192],{"className":617,"style":191},[36,190],[15,619,621],{"className":620},[48],[15,622,624,644],{"className":623},[52,53],[15,625,627,641],{"className":626},[57],[15,628,630],{"className":629,"style":62},[61],[15,631,632,635],{"style":207},[15,633],{"className":634,"style":70},[69],[15,636,638],{"className":637},[74,75,76,77],[15,639,217],{"className":640},[36,77],[15,642,86],{"className":643},[85],[15,645,647],{"className":646},[57],[15,648,650],{"className":649,"style":93},[61],[15,651],{},"; this is ",[155,654,655],{},"Rayleigh scattering",", elastic and much stronger than\nanything shifted. But ",[15,658,660],{"className":659},[18],[15,661,663],{"className":662,"ariaHidden":23},[22],[15,664,666,669],{"className":665},[27],[15,667],{"className":668,"style":595},[31],[15,670,546],{"className":671,"style":545},[36,190]," is not constant: as the molecule vibrates with\nfrequency ",[15,674,676],{"className":675},[18],[15,677,679],{"className":678,"ariaHidden":23},[22],[15,680,682,685],{"className":681},[27],[15,683],{"className":684,"style":183},[31],[15,686,688,691],{"className":687},[36],[15,689,192],{"className":690,"style":191},[36,190],[15,692,694],{"className":693},[48],[15,695,697,725],{"className":696},[52,53],[15,698,700,722],{"className":699},[57],[15,701,704],{"className":702,"style":703},[61],"height:0.3361em;",[15,705,706,709],{"style":207},[15,707],{"className":708,"style":70},[69],[15,710,712],{"className":711},[74,75,76,77],[15,713,715],{"className":714},[36,77],[15,716,718],{"className":717},[36,40,77],[15,719,721],{"className":720},[36,77],"vib",[15,723,86],{"className":724},[85],[15,726,728],{"className":727},[57],[15,729,731],{"className":730,"style":93},[61],[15,732],{}," along a normal coordinate ",[15,735,737],{"className":736},[18],[15,738,740,760],{"className":739,"ariaHidden":23},[22],[15,741,743,747,751,754,757],{"className":742},[27],[15,744],{"className":745,"style":746},[31],"height:0.8778em;vertical-align:-0.1944em;",[15,748,750],{"className":749},[36,190],"Q",[15,752],{"className":753,"style":301},[300],[15,755,306],{"className":756},[305],[15,758],{"className":759,"style":301},[300],[15,761,763,767,808,811,817,820,823,826,872,875],{"className":762},[27],[15,764],{"className":765,"style":766},[31],"height:1em;vertical-align:-0.25em;",[15,768,770,773],{"className":769},[36],[15,771,750],{"className":772},[36,190],[15,774,776],{"className":775},[48],[15,777,779,800],{"className":778},[52,53],[15,780,782,797],{"className":781},[57],[15,783,785],{"className":784,"style":62},[61],[15,786,788,791],{"style":787},"top:-2.55em;margin-left:0em;margin-right:0.05em;",[15,789],{"className":790,"style":70},[69],[15,792,794],{"className":793},[74,75,76,77],[15,795,217],{"className":796},[36,77],[15,798,86],{"className":799},[85],[15,801,803],{"className":802},[57],[15,804,806],{"className":805,"style":93},[61],[15,807],{},[15,809],{"className":810,"style":393},[300],[15,812,814],{"className":813},[397],[15,815,402],{"className":816},[36,401],[15,818,407],{"className":819},[406],[15,821,81],{"className":822},[36],[15,824,415],{"className":825,"style":414},[36,190],[15,827,829,832],{"className":828},[36],[15,830,192],{"className":831,"style":191},[36,190],[15,833,835],{"className":834},[48],[15,836,838,864],{"className":837},[52,53],[15,839,841,861],{"className":840},[57],[15,842,844],{"className":843,"style":703},[61],[15,845,846,849],{"style":207},[15,847],{"className":848,"style":70},[69],[15,850,852],{"className":851},[74,75,76,77],[15,853,855],{"className":854},[36,77],[15,856,858],{"className":857},[36,40,77],[15,859,721],{"className":860},[36,77],[15,862,86],{"className":863},[85],[15,865,867],{"className":866},[57],[15,868,870],{"className":869,"style":93},[61],[15,871],{},[15,873,459],{"className":874},[36,190],[15,876,464],{"className":877},[463],",\nthe polarizability is modulated,",[15,880,883],{"className":881},[882],"katex-display",[15,884,886],{"className":885},[18],[15,887,889,916,976],{"className":888,"ariaHidden":23},[22],[15,890,892,895,898,901,904,907,910,913],{"className":891},[27],[15,893],{"className":894,"style":766},[31],[15,896,546],{"className":897,"style":545},[36,190],[15,899,407],{"className":900},[406],[15,902,459],{"className":903},[36,190],[15,905,464],{"className":906},[463],[15,908],{"className":909,"style":301},[300],[15,911,306],{"className":912},[305],[15,914],{"className":915,"style":301},[300],[15,917,919,923,964,968,973],{"className":918},[27],[15,920],{"className":921,"style":922},[31],"height:0.7333em;vertical-align:-0.15em;",[15,924,926,929],{"className":925},[36],[15,927,546],{"className":928,"style":545},[36,190],[15,930,932],{"className":931},[48],[15,933,935,956],{"className":934},[52,53],[15,936,938,953],{"className":937},[57],[15,939,941],{"className":940,"style":62},[61],[15,942,944,947],{"style":943},"top:-2.55em;margin-left:-0.0037em;margin-right:0.05em;",[15,945],{"className":946,"style":70},[69],[15,948,950],{"className":949},[74,75,76,77],[15,951,217],{"className":952},[36,77],[15,954,86],{"className":955},[85],[15,957,959],{"className":958},[57],[15,960,962],{"className":961,"style":93},[61],[15,963],{},[15,965],{"className":966,"style":967},[300],"margin-right:0.2222em;",[15,969,972],{"className":970},[971],"mbin","+",[15,974],{"className":975,"style":967},[300],[15,977,979,983,1121,1124,1164,1167,1173,1176,1179,1182,1228,1231,1234],{"className":978},[27],[15,980],{"className":981,"style":982},[31],"height:2.4497em;vertical-align:-0.9997em;",[15,984,987,1084],{"className":985},[986],"minner",[15,988,990,999,1078],{"className":989},[986],[15,991,995],{"className":992,"style":994},[406,993],"delimcenter","top:0em;",[15,996,407],{"className":997},[998,76],"delimsizing",[15,1000,1002,1006,1075],{"className":1001},[36],[15,1003],{"className":1004},[406,1005],"nulldelimiter",[15,1007,1010],{"className":1008},[1009],"mfrac",[15,1011,1013,1066],{"className":1012},[52,53],[15,1014,1016,1063],{"className":1015},[57],[15,1017,1020,1037,1048],{"className":1018,"style":1019},[61],"height:1.3714em;",[15,1021,1023,1026],{"style":1022},"top:-2.314em;",[15,1024],{"className":1025,"style":262},[69],[15,1027,1029,1034],{"className":1028},[36],[15,1030,1033],{"className":1031,"style":1032},[36],"margin-right:0.0556em;","∂",[15,1035,750],{"className":1036},[36,190],[15,1038,1040,1043],{"style":1039},"top:-3.23em;",[15,1041],{"className":1042,"style":262},[69],[15,1044],{"className":1045,"style":1047},[1046],"frac-line","border-bottom-width:0.04em;",[15,1049,1051,1054],{"style":1050},"top:-3.677em;",[15,1052],{"className":1053,"style":262},[69],[15,1055,1057,1060],{"className":1056},[36],[15,1058,1033],{"className":1059,"style":1032},[36],[15,1061,546],{"className":1062,"style":545},[36,190],[15,1064,86],{"className":1065},[85],[15,1067,1069],{"className":1068},[57],[15,1070,1073],{"className":1071,"style":1072},[61],"height:0.8804em;",[15,1074],{},[15,1076],{"className":1077},[463,1005],[15,1079,1081],{"className":1080,"style":994},[463,993],[15,1082,464],{"className":1083},[998,76],[15,1085,1087],{"className":1086},[48],[15,1088,1090,1112],{"className":1089},[52,53],[15,1091,1093,1109],{"className":1092},[57],[15,1094,1097],{"className":1095,"style":1096},[61],"height:-0.5486em;",[15,1098,1100,1103],{"style":1099},"top:-1.7003em;margin-right:0.05em;",[15,1101],{"className":1102,"style":70},[69],[15,1104,1106],{"className":1105},[74,75,76,77],[15,1107,217],{"className":1108},[36,77],[15,1110,86],{"className":1111},[85],[15,1113,1115],{"className":1114},[57],[15,1116,1119],{"className":1117,"style":1118},[61],"height:0.9997em;",[15,1120],{},[15,1122],{"className":1123,"style":393},[300],[15,1125,1127,1130],{"className":1126},[36],[15,1128,750],{"className":1129},[36,190],[15,1131,1133],{"className":1132},[48],[15,1134,1136,1156],{"className":1135},[52,53],[15,1137,1139,1153],{"className":1138},[57],[15,1140,1142],{"className":1141,"style":62},[61],[15,1143,1144,1147],{"style":787},[15,1145],{"className":1146,"style":70},[69],[15,1148,1150],{"className":1149},[74,75,76,77],[15,1151,217],{"className":1152},[36,77],[15,1154,86],{"className":1155},[85],[15,1157,1159],{"className":1158},[57],[15,1160,1162],{"className":1161,"style":93},[61],[15,1163],{},[15,1165],{"className":1166,"style":393},[300],[15,1168,1170],{"className":1169},[397],[15,1171,402],{"className":1172},[36,401],[15,1174,407],{"className":1175},[406],[15,1177,81],{"className":1178},[36],[15,1180,415],{"className":1181,"style":414},[36,190],[15,1183,1185,1188],{"className":1184},[36],[15,1186,192],{"className":1187,"style":191},[36,190],[15,1189,1191],{"className":1190},[48],[15,1192,1194,1220],{"className":1193},[52,53],[15,1195,1197,1217],{"className":1196},[57],[15,1198,1200],{"className":1199,"style":703},[61],[15,1201,1202,1205],{"style":207},[15,1203],{"className":1204,"style":70},[69],[15,1206,1208],{"className":1207},[74,75,76,77],[15,1209,1211],{"className":1210},[36,77],[15,1212,1214],{"className":1213},[36,40,77],[15,1215,721],{"className":1216},[36,77],[15,1218,86],{"className":1219},[85],[15,1221,1223],{"className":1222},[57],[15,1224,1226],{"className":1225,"style":93},[61],[15,1227],{},[15,1229,459],{"className":1230},[36,190],[15,1232,464],{"className":1233},[463],[15,1235,1237],{"className":1236},[36],".",[11,1239,1240],{},"Multiplying by the field and applying the product-to-sum identity gives three\nfrequencies in the scattered light,",[15,1242,1244],{"className":1243},[882],[15,1245,1247],{"className":1246},[18],[15,1248,1250,1311,1502,1903,1977,2056],{"className":1249,"ariaHidden":23},[22],[15,1251,1253,1256,1302,1305,1308],{"className":1252},[27],[15,1254],{"className":1255,"style":478},[31],[15,1257,1259],{"className":1258},[36,246],[15,1260,1262,1294],{"className":1261},[52,53],[15,1263,1265,1291],{"className":1264},[57],[15,1266,1268,1276],{"className":1267,"style":491},[61],[15,1269,1270,1273],{"style":258},[15,1271],{"className":1272,"style":262},[69],[15,1274,11],{"className":1275},[36,190],[15,1277,1278,1281],{"style":258},[15,1279],{"className":1280,"style":262},[69],[15,1282,1284],{"className":1283,"style":278},[277],[15,1285,1287],{"className":1286,"style":283},[282],[285,1288,1289],{"xmlns":287,"width":288,"height":289,"style":290,"viewBox":291,"preserveAspectRatio":292},[294,1290],{"d":296},[15,1292,86],{"className":1293},[85],[15,1295,1297],{"className":1296},[57],[15,1298,1300],{"className":1299,"style":524},[61],[15,1301],{},[15,1303],{"className":1304,"style":301},[300],[15,1306,306],{"className":1307},[305],[15,1309],{"className":1310,"style":301},[300],[15,1312,1314,1317,1357,1429,1432,1438,1441,1444,1447,1487,1490,1493,1496,1499],{"className":1313},[27],[15,1315],{"className":1316,"style":316},[31],[15,1318,1320,1323],{"className":1319},[36],[15,1321,546],{"className":1322,"style":545},[36,190],[15,1324,1326],{"className":1325},[48],[15,1327,1329,1349],{"className":1328},[52,53],[15,1330,1332,1346],{"className":1331},[57],[15,1333,1335],{"className":1334,"style":62},[61],[15,1336,1337,1340],{"style":943},[15,1338],{"className":1339,"style":70},[69],[15,1341,1343],{"className":1342},[74,75,76,77],[15,1344,217],{"className":1345},[36,77],[15,1347,86],{"className":1348},[85],[15,1350,1352],{"className":1351},[57],[15,1353,1355],{"className":1354,"style":93},[61],[15,1356],{},[15,1358,1360,1395],{"className":1359},[36],[15,1361,1363],{"className":1362},[36,246],[15,1364,1366],{"className":1365},[52],[15,1367,1369],{"className":1368},[57],[15,1370,1372,1380],{"className":1371,"style":242},[61],[15,1373,1374,1377],{"style":258},[15,1375],{"className":1376,"style":262},[69],[15,1378,267],{"className":1379,"style":266},[36,190],[15,1381,1382,1385],{"style":270},[15,1383],{"className":1384,"style":262},[69],[15,1386,1388],{"className":1387,"style":278},[277],[15,1389,1391],{"className":1390,"style":283},[282],[285,1392,1393],{"xmlns":287,"width":288,"height":289,"style":290,"viewBox":291,"preserveAspectRatio":292},[294,1394],{"d":296},[15,1396,1398],{"className":1397},[48],[15,1399,1401,1421],{"className":1400},[52,53],[15,1402,1404,1418],{"className":1403},[57],[15,1405,1407],{"className":1406,"style":62},[61],[15,1408,1409,1412],{"style":369},[15,1410],{"className":1411,"style":70},[69],[15,1413,1415],{"className":1414},[74,75,76,77],[15,1416,217],{"className":1417},[36,77],[15,1419,86],{"className":1420},[85],[15,1422,1424],{"className":1423},[57],[15,1425,1427],{"className":1426,"style":93},[61],[15,1428],{},[15,1430],{"className":1431,"style":393},[300],[15,1433,1435],{"className":1434},[397],[15,1436,402],{"className":1437},[36,401],[15,1439,407],{"className":1440},[406],[15,1442,81],{"className":1443},[36],[15,1445,415],{"className":1446,"style":414},[36,190],[15,1448,1450,1453],{"className":1449},[36],[15,1451,192],{"className":1452,"style":191},[36,190],[15,1454,1456],{"className":1455},[48],[15,1457,1459,1479],{"className":1458},[52,53],[15,1460,1462,1476],{"className":1461},[57],[15,1463,1465],{"className":1464,"style":62},[61],[15,1466,1467,1470],{"style":207},[15,1468],{"className":1469,"style":70},[69],[15,1471,1473],{"className":1472},[74,75,76,77],[15,1474,217],{"className":1475},[36,77],[15,1477,86],{"className":1478},[85],[15,1480,1482],{"className":1481},[57],[15,1483,1485],{"className":1484,"style":93},[61],[15,1486],{},[15,1488,459],{"className":1489},[36,190],[15,1491,464],{"className":1492},[463],[15,1494],{"className":1495,"style":967},[300],[15,1497,972],{"className":1498},[971],[15,1500],{"className":1501,"style":967},[300],[15,1503,1505,1508,1581,1584,1704,1707,1747,1819,1827,1833,1837,1844,1847,1850,1853,1893,1896,1900],{"className":1504},[27],[15,1506],{"className":1507,"style":982},[31],[15,1509,1511,1514,1578],{"className":1510},[36],[15,1512],{"className":1513},[406,1005],[15,1515,1517],{"className":1516},[1009],[15,1518,1520,1569],{"className":1519},[52,53],[15,1521,1523,1566],{"className":1522},[57],[15,1524,1527,1542,1550],{"className":1525,"style":1526},[61],"height:0.8451em;",[15,1528,1530,1533],{"style":1529},"top:-2.655em;",[15,1531],{"className":1532,"style":262},[69],[15,1534,1536],{"className":1535},[74,75,76,77],[15,1537,1539],{"className":1538},[36,77],[15,1540,81],{"className":1541},[36,77],[15,1543,1544,1547],{"style":1039},[15,1545],{"className":1546,"style":262},[69],[15,1548],{"className":1549,"style":1047},[1046],[15,1551,1553,1556],{"style":1552},"top:-3.394em;",[15,1554],{"className":1555,"style":262},[69],[15,1557,1559],{"className":1558},[74,75,76,77],[15,1560,1562],{"className":1561},[36,77],[15,1563,1565],{"className":1564},[36,77],"1",[15,1567,86],{"className":1568},[85],[15,1570,1572],{"className":1571},[57],[15,1573,1576],{"className":1574,"style":1575},[61],"height:0.345em;",[15,1577],{},[15,1579],{"className":1580},[463,1005],[15,1582],{"className":1583,"style":393},[300],[15,1585,1587,1670],{"className":1586},[986],[15,1588,1590,1596,1664],{"className":1589},[986],[15,1591,1593],{"className":1592,"style":994},[406,993],[15,1594,407],{"className":1595},[998,76],[15,1597,1599,1602,1661],{"className":1598},[36],[15,1600],{"className":1601},[406,1005],[15,1603,1605],{"className":1604},[1009],[15,1606,1608,1653],{"className":1607},[52,53],[15,1609,1611,1650],{"className":1610},[57],[15,1612,1614,1628,1636],{"className":1613,"style":1019},[61],[15,1615,1616,1619],{"style":1022},[15,1617],{"className":1618,"style":262},[69],[15,1620,1622,1625],{"className":1621},[36],[15,1623,1033],{"className":1624,"style":1032},[36],[15,1626,750],{"className":1627},[36,190],[15,1629,1630,1633],{"style":1039},[15,1631],{"className":1632,"style":262},[69],[15,1634],{"className":1635,"style":1047},[1046],[15,1637,1638,1641],{"style":1050},[15,1639],{"className":1640,"style":262},[69],[15,1642,1644,1647],{"className":1643},[36],[15,1645,1033],{"className":1646,"style":1032},[36],[15,1648,546],{"className":1649,"style":545},[36,190],[15,1651,86],{"className":1652},[85],[15,1654,1656],{"className":1655},[57],[15,1657,1659],{"className":1658,"style":1072},[61],[15,1660],{},[15,1662],{"className":1663},[463,1005],[15,1665,1667],{"className":1666,"style":994},[463,993],[15,1668,464],{"className":1669},[998,76],[15,1671,1673],{"className":1672},[48],[15,1674,1676,1696],{"className":1675},[52,53],[15,1677,1679,1693],{"className":1678},[57],[15,1680,1682],{"className":1681,"style":1096},[61],[15,1683,1684,1687],{"style":1099},[15,1685],{"className":1686,"style":70},[69],[15,1688,1690],{"className":1689},[74,75,76,77],[15,1691,217],{"className":1692},[36,77],[15,1694,86],{"className":1695},[85],[15,1697,1699],{"className":1698},[57],[15,1700,1702],{"className":1701,"style":1118},[61],[15,1703],{},[15,1705],{"className":1706,"style":393},[300],[15,1708,1710,1713],{"className":1709},[36],[15,1711,750],{"className":1712},[36,190],[15,1714,1716],{"className":1715},[48],[15,1717,1719,1739],{"className":1718},[52,53],[15,1720,1722,1736],{"className":1721},[57],[15,1723,1725],{"className":1724,"style":62},[61],[15,1726,1727,1730],{"style":787},[15,1728],{"className":1729,"style":70},[69],[15,1731,1733],{"className":1732},[74,75,76,77],[15,1734,217],{"className":1735},[36,77],[15,1737,86],{"className":1738},[85],[15,1740,1742],{"className":1741},[57],[15,1743,1745],{"className":1744,"style":93},[61],[15,1746],{},[15,1748,1750,1785],{"className":1749},[36],[15,1751,1753],{"className":1752},[36,246],[15,1754,1756],{"className":1755},[52],[15,1757,1759],{"className":1758},[57],[15,1760,1762,1770],{"className":1761,"style":242},[61],[15,1763,1764,1767],{"style":258},[15,1765],{"className":1766,"style":262},[69],[15,1768,267],{"className":1769,"style":266},[36,190],[15,1771,1772,1775],{"style":270},[15,1773],{"className":1774,"style":262},[69],[15,1776,1778],{"className":1777,"style":278},[277],[15,1779,1781],{"className":1780,"style":283},[282],[285,1782,1783],{"xmlns":287,"width":288,"height":289,"style":290,"viewBox":291,"preserveAspectRatio":292},[294,1784],{"d":296},[15,1786,1788],{"className":1787},[48],[15,1789,1791,1811],{"className":1790},[52,53],[15,1792,1794,1808],{"className":1793},[57],[15,1795,1797],{"className":1796,"style":62},[61],[15,1798,1799,1802],{"style":369},[15,1800],{"className":1801,"style":70},[69],[15,1803,1805],{"className":1804},[74,75,76,77],[15,1806,217],{"className":1807},[36,77],[15,1809,86],{"className":1810},[85],[15,1812,1814],{"className":1813},[57],[15,1815,1817],{"className":1816,"style":93},[61],[15,1818],{},[15,1820,1822],{"className":1821},[406],[15,1823,1826],{"className":1824},[998,1825],"size2","[",[15,1828,1830],{"className":1829},[397],[15,1831,402],{"className":1832},[36,401],[15,1834],{"className":1835,"style":1836},[300],"margin-right:-0.1667em;",[15,1838,1840],{"className":1839},[406],[15,1841,407],{"className":1842},[998,1843],"size1",[15,1845,81],{"className":1846},[36],[15,1848,415],{"className":1849,"style":414},[36,190],[15,1851,407],{"className":1852},[406],[15,1854,1856,1859],{"className":1855},[36],[15,1857,192],{"className":1858,"style":191},[36,190],[15,1860,1862],{"className":1861},[48],[15,1863,1865,1885],{"className":1864},[52,53],[15,1866,1868,1882],{"className":1867},[57],[15,1869,1871],{"className":1870,"style":62},[61],[15,1872,1873,1876],{"style":207},[15,1874],{"className":1875,"style":70},[69],[15,1877,1879],{"className":1878},[74,75,76,77],[15,1880,217],{"className":1881},[36,77],[15,1883,86],{"className":1884},[85],[15,1886,1888],{"className":1887},[57],[15,1889,1891],{"className":1890,"style":93},[61],[15,1892],{},[15,1894],{"className":1895,"style":967},[300],[15,1897,1899],{"className":1898},[971],"−",[15,1901],{"className":1902,"style":967},[300],[15,1904,1906,1910,1956,1959,1962,1968,1971,1974],{"className":1905},[27],[15,1907],{"className":1908,"style":1909},[31],"height:1.2em;vertical-align:-0.35em;",[15,1911,1913,1916],{"className":1912},[36],[15,1914,192],{"className":1915,"style":191},[36,190],[15,1917,1919],{"className":1918},[48],[15,1920,1922,1948],{"className":1921},[52,53],[15,1923,1925,1945],{"className":1924},[57],[15,1926,1928],{"className":1927,"style":703},[61],[15,1929,1930,1933],{"style":207},[15,1931],{"className":1932,"style":70},[69],[15,1934,1936],{"className":1935},[74,75,76,77],[15,1937,1939],{"className":1938},[36,77],[15,1940,1942],{"className":1941},[36,40,77],[15,1943,721],{"className":1944},[36,77],[15,1946,86],{"className":1947},[85],[15,1949,1951],{"className":1950},[57],[15,1952,1954],{"className":1953,"style":93},[61],[15,1955],{},[15,1957,464],{"className":1958},[463],[15,1960,459],{"className":1961},[36,190],[15,1963,1965],{"className":1964},[463],[15,1966,464],{"className":1967},[998,1843],[15,1969],{"className":1970,"style":967},[300],[15,1972,972],{"className":1973},[971],[15,1975],{"className":1976,"style":967},[300],[15,1978,1980,1983,1989,1992,1998,2001,2004,2007,2047,2050,2053],{"className":1979},[27],[15,1981],{"className":1982,"style":1909},[31],[15,1984,1986],{"className":1985},[397],[15,1987,402],{"className":1988},[36,401],[15,1990],{"className":1991,"style":1836},[300],[15,1993,1995],{"className":1994},[406],[15,1996,407],{"className":1997},[998,1843],[15,1999,81],{"className":2000},[36],[15,2002,415],{"className":2003,"style":414},[36,190],[15,2005,407],{"className":2006},[406],[15,2008,2010,2013],{"className":2009},[36],[15,2011,192],{"className":2012,"style":191},[36,190],[15,2014,2016],{"className":2015},[48],[15,2017,2019,2039],{"className":2018},[52,53],[15,2020,2022,2036],{"className":2021},[57],[15,2023,2025],{"className":2024,"style":62},[61],[15,2026,2027,2030],{"style":207},[15,2028],{"className":2029,"style":70},[69],[15,2031,2033],{"className":2032},[74,75,76,77],[15,2034,217],{"className":2035},[36,77],[15,2037,86],{"className":2038},[85],[15,2040,2042],{"className":2041},[57],[15,2043,2045],{"className":2044,"style":93},[61],[15,2046],{},[15,2048],{"className":2049,"style":967},[300],[15,2051,972],{"className":2052},[971],[15,2054],{"className":2055,"style":967},[300],[15,2057,2059,2063,2109,2112,2115,2121,2128],{"className":2058},[27],[15,2060],{"className":2061,"style":2062},[31],"height:1.8em;vertical-align:-0.65em;",[15,2064,2066,2069],{"className":2065},[36],[15,2067,192],{"className":2068,"style":191},[36,190],[15,2070,2072],{"className":2071},[48],[15,2073,2075,2101],{"className":2074},[52,53],[15,2076,2078,2098],{"className":2077},[57],[15,2079,2081],{"className":2080,"style":703},[61],[15,2082,2083,2086],{"style":207},[15,2084],{"className":2085,"style":70},[69],[15,2087,2089],{"className":2088},[74,75,76,77],[15,2090,2092],{"className":2091},[36,77],[15,2093,2095],{"className":2094},[36,40,77],[15,2096,721],{"className":2097},[36,77],[15,2099,86],{"className":2100},[85],[15,2102,2104],{"className":2103},[57],[15,2105,2107],{"className":2106,"style":93},[61],[15,2108],{},[15,2110,464],{"className":2111},[463],[15,2113,459],{"className":2114},[36,190],[15,2116,2118],{"className":2117},[463],[15,2119,464],{"className":2120},[998,1843],[15,2122,2124],{"className":2123},[463],[15,2125,2127],{"className":2126},[998,1825],"]",[15,2129,1237],{"className":2130},[36],[11,2132,2133,2134,2247,2248,2251,2252,2365,2366,2369,2370,2428,2429,2481],{},"The unshifted line is Rayleigh; the sideband at ",[15,2135,2137],{"className":2136},[18],[15,2138,2140,2195],{"className":2139,"ariaHidden":23},[22],[15,2141,2143,2146,2186,2189,2192],{"className":2142},[27],[15,2144],{"className":2145,"style":922},[31],[15,2147,2149,2152],{"className":2148},[36],[15,2150,192],{"className":2151,"style":191},[36,190],[15,2153,2155],{"className":2154},[48],[15,2156,2158,2178],{"className":2157},[52,53],[15,2159,2161,2175],{"className":2160},[57],[15,2162,2164],{"className":2163,"style":62},[61],[15,2165,2166,2169],{"style":207},[15,2167],{"className":2168,"style":70},[69],[15,2170,2172],{"className":2171},[74,75,76,77],[15,2173,217],{"className":2174},[36,77],[15,2176,86],{"className":2177},[85],[15,2179,2181],{"className":2180},[57],[15,2182,2184],{"className":2183,"style":93},[61],[15,2185],{},[15,2187],{"className":2188,"style":967},[300],[15,2190,1899],{"className":2191},[971],[15,2193],{"className":2194,"style":967},[300],[15,2196,2198,2201],{"className":2197},[27],[15,2199],{"className":2200,"style":183},[31],[15,2202,2204,2207],{"className":2203},[36],[15,2205,192],{"className":2206,"style":191},[36,190],[15,2208,2210],{"className":2209},[48],[15,2211,2213,2239],{"className":2212},[52,53],[15,2214,2216,2236],{"className":2215},[57],[15,2217,2219],{"className":2218,"style":703},[61],[15,2220,2221,2224],{"style":207},[15,2222],{"className":2223,"style":70},[69],[15,2225,2227],{"className":2226},[74,75,76,77],[15,2228,2230],{"className":2229},[36,77],[15,2231,2233],{"className":2232},[36,40,77],[15,2234,721],{"className":2235},[36,77],[15,2237,86],{"className":2238},[85],[15,2240,2242],{"className":2241},[57],[15,2243,2245],{"className":2244,"style":93},[61],[15,2246],{}," is the\n",[155,2249,2250],{},"Stokes"," line, where the molecule gains a vibrational quantum, and the sideband\nat ",[15,2253,2255],{"className":2254},[18],[15,2256,2258,2313],{"className":2257,"ariaHidden":23},[22],[15,2259,2261,2264,2304,2307,2310],{"className":2260},[27],[15,2262],{"className":2263,"style":922},[31],[15,2265,2267,2270],{"className":2266},[36],[15,2268,192],{"className":2269,"style":191},[36,190],[15,2271,2273],{"className":2272},[48],[15,2274,2276,2296],{"className":2275},[52,53],[15,2277,2279,2293],{"className":2278},[57],[15,2280,2282],{"className":2281,"style":62},[61],[15,2283,2284,2287],{"style":207},[15,2285],{"className":2286,"style":70},[69],[15,2288,2290],{"className":2289},[74,75,76,77],[15,2291,217],{"className":2292},[36,77],[15,2294,86],{"className":2295},[85],[15,2297,2299],{"className":2298},[57],[15,2300,2302],{"className":2301,"style":93},[61],[15,2303],{},[15,2305],{"className":2306,"style":967},[300],[15,2308,972],{"className":2309},[971],[15,2311],{"className":2312,"style":967},[300],[15,2314,2316,2319],{"className":2315},[27],[15,2317],{"className":2318,"style":183},[31],[15,2320,2322,2325],{"className":2321},[36],[15,2323,192],{"className":2324,"style":191},[36,190],[15,2326,2328],{"className":2327},[48],[15,2329,2331,2357],{"className":2330},[52,53],[15,2332,2334,2354],{"className":2333},[57],[15,2335,2337],{"className":2336,"style":703},[61],[15,2338,2339,2342],{"style":207},[15,2340],{"className":2341,"style":70},[69],[15,2343,2345],{"className":2344},[74,75,76,77],[15,2346,2348],{"className":2347},[36,77],[15,2349,2351],{"className":2350},[36,40,77],[15,2352,721],{"className":2353},[36,77],[15,2355,86],{"className":2356},[85],[15,2358,2360],{"className":2359},[57],[15,2361,2363],{"className":2362,"style":93},[61],[15,2364],{}," is the ",[155,2367,2368],{},"anti-Stokes"," line, where it gives one up.\nThe shift ",[15,2371,2373],{"className":2372},[18],[15,2374,2376],{"className":2375,"ariaHidden":23},[22],[15,2377,2379,2382],{"className":2378},[27],[15,2380],{"className":2381,"style":183},[31],[15,2383,2385,2388],{"className":2384},[36],[15,2386,192],{"className":2387,"style":191},[36,190],[15,2389,2391],{"className":2390},[48],[15,2392,2394,2420],{"className":2393},[52,53],[15,2395,2397,2417],{"className":2396},[57],[15,2398,2400],{"className":2399,"style":703},[61],[15,2401,2402,2405],{"style":207},[15,2403],{"className":2404,"style":70},[69],[15,2406,2408],{"className":2407},[74,75,76,77],[15,2409,2411],{"className":2410},[36,77],[15,2412,2414],{"className":2413},[36,40,77],[15,2415,721],{"className":2416},[36,77],[15,2418,86],{"className":2419},[85],[15,2421,2423],{"className":2422},[57],[15,2424,2426],{"className":2425,"style":93},[61],[15,2427],{}," is the vibrational frequency, read as a displacement\nfrom the exciting line regardless of what ",[15,2430,2432],{"className":2431},[18],[15,2433,2435],{"className":2434,"ariaHidden":23},[22],[15,2436,2438,2441],{"className":2437},[27],[15,2439],{"className":2440,"style":183},[31],[15,2442,2444,2447],{"className":2443},[36],[15,2445,192],{"className":2446,"style":191},[36,190],[15,2448,2450],{"className":2449},[48],[15,2451,2453,2473],{"className":2452},[52,53],[15,2454,2456,2470],{"className":2455},[57],[15,2457,2459],{"className":2458,"style":62},[61],[15,2460,2461,2464],{"style":207},[15,2462],{"className":2463,"style":70},[69],[15,2465,2467],{"className":2466},[74,75,76,77],[15,2468,217],{"className":2469},[36,77],[15,2471,86],{"className":2472},[85],[15,2474,2476],{"className":2475},[57],[15,2477,2479],{"className":2478,"style":93},[61],[15,2480],{}," is.",[11,2483,2484,2485,2488],{},"The classical picture gives the frequencies; the quantum picture gives the\nmechanism. The incident photon lifts the molecule to a ",[155,2486,2487],{},"virtual level"," — not an\neigenstate, but a short-lived superposition — from which it drops back either to\nthe original level (Rayleigh) or to a different vibrational level (Raman).",[2490,2491],"tikz-figure",{"hash":2492},"2fccc5f88a1dc67d6434899ea526c7539ba89f7a770692d7ad7ce9fcefddf96e",[11,2494,2495,2496,2531,2532,2576],{},"Because anti-Stokes scattering starts from the thermally excited ",[15,2497,2499],{"className":2498},[18],[15,2500,2502,2521],{"className":2501,"ariaHidden":23},[22],[15,2503,2505,2508,2512,2515,2518],{"className":2504},[27],[15,2506],{"className":2507,"style":595},[31],[15,2509,2511],{"className":2510,"style":414},[36,190],"v",[15,2513],{"className":2514,"style":301},[300],[15,2516,306],{"className":2517},[305],[15,2519],{"className":2520,"style":301},[300],[15,2522,2524,2528],{"className":2523},[27],[15,2525],{"className":2526,"style":2527},[31],"height:0.6444em;",[15,2529,1565],{"className":2530},[36]," level, its\nintensity is weaker than Stokes by the Boltzmann population ratio. Including the\n",[15,2533,2535],{"className":2534},[18],[15,2536,2538],{"className":2537,"ariaHidden":23},[22],[15,2539,2541,2545],{"className":2540},[27],[15,2542],{"className":2543,"style":2544},[31],"height:0.8141em;",[15,2546,2548,2551],{"className":2547},[36],[15,2549,192],{"className":2550,"style":191},[36,190],[15,2552,2554],{"className":2553},[48],[15,2555,2557],{"className":2556},[52],[15,2558,2560],{"className":2559},[57],[15,2561,2563],{"className":2562,"style":2544},[61],[15,2564,2566,2569],{"style":2565},"top:-3.063em;margin-right:0.05em;",[15,2567],{"className":2568,"style":70},[69],[15,2570,2572],{"className":2571},[74,75,76,77],[15,2573,2575],{"className":2574},[36,77],"4"," scattering factor, the intensity ratio is",[15,2578,2580],{"className":2579},[882],[15,2581,2583],{"className":2582},[18],[15,2584,2586,2755],{"className":2585,"ariaHidden":23},[22],[15,2587,2589,2593,2746,2749,2752],{"className":2588},[27],[15,2590],{"className":2591,"style":2592},[31],"height:2.1963em;vertical-align:-0.836em;",[15,2594,2596,2599,2743],{"className":2595},[36],[15,2597],{"className":2598},[406,1005],[15,2600,2602],{"className":2601},[1009],[15,2603,2605,2734],{"className":2604},[52,53],[15,2606,2608,2731],{"className":2607},[57],[15,2609,2612,2669,2677],{"className":2610,"style":2611},[61],"height:1.3603em;",[15,2613,2614,2617],{"style":1022},[15,2615],{"className":2616,"style":262},[69],[15,2618,2620],{"className":2619},[36],[15,2621,2623,2628],{"className":2622},[36],[15,2624,2627],{"className":2625,"style":2626},[36,190],"margin-right:0.0785em;","I",[15,2629,2631],{"className":2630},[48],[15,2632,2634,2661],{"className":2633},[52,53],[15,2635,2637,2658],{"className":2636},[57],[15,2638,2640],{"className":2639,"style":703},[61],[15,2641,2643,2646],{"style":2642},"top:-2.55em;margin-left:-0.0785em;margin-right:0.05em;",[15,2644],{"className":2645,"style":70},[69],[15,2647,2649],{"className":2648},[74,75,76,77],[15,2650,2652],{"className":2651},[36,77],[15,2653,2655],{"className":2654},[36,40,77],[15,2656,2250],{"className":2657},[36,77],[15,2659,86],{"className":2660},[85],[15,2662,2664],{"className":2663},[57],[15,2665,2667],{"className":2666,"style":93},[61],[15,2668],{},[15,2670,2671,2674],{"style":1039},[15,2672],{"className":2673,"style":262},[69],[15,2675],{"className":2676,"style":1047},[1046],[15,2678,2679,2682],{"style":1050},[15,2680],{"className":2681,"style":262},[69],[15,2683,2685],{"className":2684},[36],[15,2686,2688,2691],{"className":2687},[36],[15,2689,2627],{"className":2690,"style":2626},[36,190],[15,2692,2694],{"className":2693},[48],[15,2695,2697,2723],{"className":2696},[52,53],[15,2698,2700,2720],{"className":2699},[57],[15,2701,2703],{"className":2702,"style":703},[61],[15,2704,2705,2708],{"style":2642},[15,2706],{"className":2707,"style":70},[69],[15,2709,2711],{"className":2710},[74,75,76,77],[15,2712,2714],{"className":2713},[36,77],[15,2715,2717],{"className":2716},[36,40,77],[15,2718,2368],{"className":2719},[36,77],[15,2721,86],{"className":2722},[85],[15,2724,2726],{"className":2725},[57],[15,2727,2729],{"className":2728,"style":93},[61],[15,2730],{},[15,2732,86],{"className":2733},[85],[15,2735,2737],{"className":2736},[57],[15,2738,2741],{"className":2739,"style":2740},[61],"height:0.836em;",[15,2742],{},[15,2744],{"className":2745},[463,1005],[15,2747],{"className":2748,"style":301},[300],[15,2750,306],{"className":2751},[305],[15,2753],{"className":2754,"style":301},[300],[15,2756,2758,2762,3059,3062,3215],{"className":2757},[27],[15,2759],{"className":2760,"style":2761},[31],"height:2.604em;vertical-align:-0.95em;",[15,2763,2765,3027],{"className":2764},[986],[15,2766,2768,2774,3021],{"className":2767},[986],[15,2769,2771],{"className":2770,"style":994},[406,993],[15,2772,407],{"className":2773},[998,76],[15,2775,2777,2780,3018],{"className":2776},[36],[15,2778],{"className":2779},[406,1005],[15,2781,2783],{"className":2782},[1009],[15,2784,2786,3010],{"className":2785},[52,53],[15,2787,2789,3007],{"className":2788},[57],[15,2790,2793,2896,2904],{"className":2791,"style":2792},[61],"height:1.2603em;",[15,2794,2795,2798],{"style":1022},[15,2796],{"className":2797,"style":262},[69],[15,2799,2801,2841,2844,2847,2850],{"className":2800},[36],[15,2802,2804,2807],{"className":2803},[36],[15,2805,192],{"className":2806,"style":191},[36,190],[15,2808,2810],{"className":2809},[48],[15,2811,2813,2833],{"className":2812},[52,53],[15,2814,2816,2830],{"className":2815},[57],[15,2817,2819],{"className":2818,"style":62},[61],[15,2820,2821,2824],{"style":207},[15,2822],{"className":2823,"style":70},[69],[15,2825,2827],{"className":2826},[74,75,76,77],[15,2828,217],{"className":2829},[36,77],[15,2831,86],{"className":2832},[85],[15,2834,2836],{"className":2835},[57],[15,2837,2839],{"className":2838,"style":93},[61],[15,2840],{},[15,2842],{"className":2843,"style":967},[300],[15,2845,1899],{"className":2846},[971],[15,2848],{"className":2849,"style":967},[300],[15,2851,2853,2856],{"className":2852},[36],[15,2854,192],{"className":2855,"style":191},[36,190],[15,2857,2859],{"className":2858},[48],[15,2860,2862,2888],{"className":2861},[52,53],[15,2863,2865,2885],{"className":2864},[57],[15,2866,2868],{"className":2867,"style":703},[61],[15,2869,2870,2873],{"style":207},[15,2871],{"className":2872,"style":70},[69],[15,2874,2876],{"className":2875},[74,75,76,77],[15,2877,2879],{"className":2878},[36,77],[15,2880,2882],{"className":2881},[36,40,77],[15,2883,721],{"className":2884},[36,77],[15,2886,86],{"className":2887},[85],[15,2889,2891],{"className":2890},[57],[15,2892,2894],{"className":2893,"style":93},[61],[15,2895],{},[15,2897,2898,2901],{"style":1039},[15,2899],{"className":2900,"style":262},[69],[15,2902],{"className":2903,"style":1047},[1046],[15,2905,2906,2909],{"style":1050},[15,2907],{"className":2908,"style":262},[69],[15,2910,2912,2952,2955,2958,2961],{"className":2911},[36],[15,2913,2915,2918],{"className":2914},[36],[15,2916,192],{"className":2917,"style":191},[36,190],[15,2919,2921],{"className":2920},[48],[15,2922,2924,2944],{"className":2923},[52,53],[15,2925,2927,2941],{"className":2926},[57],[15,2928,2930],{"className":2929,"style":62},[61],[15,2931,2932,2935],{"style":207},[15,2933],{"className":2934,"style":70},[69],[15,2936,2938],{"className":2937},[74,75,76,77],[15,2939,217],{"className":2940},[36,77],[15,2942,86],{"className":2943},[85],[15,2945,2947],{"className":2946},[57],[15,2948,2950],{"className":2949,"style":93},[61],[15,2951],{},[15,2953],{"className":2954,"style":967},[300],[15,2956,972],{"className":2957},[971],[15,2959],{"className":2960,"style":967},[300],[15,2962,2964,2967],{"className":2963},[36],[15,2965,192],{"className":2966,"style":191},[36,190],[15,2968,2970],{"className":2969},[48],[15,2971,2973,2999],{"className":2972},[52,53],[15,2974,2976,2996],{"className":2975},[57],[15,2977,2979],{"className":2978,"style":703},[61],[15,2980,2981,2984],{"style":207},[15,2982],{"className":2983,"style":70},[69],[15,2985,2987],{"className":2986},[74,75,76,77],[15,2988,2990],{"className":2989},[36,77],[15,2991,2993],{"className":2992},[36,40,77],[15,2994,721],{"className":2995},[36,77],[15,2997,86],{"className":2998},[85],[15,3000,3002],{"className":3001},[57],[15,3003,3005],{"className":3004,"style":93},[61],[15,3006],{},[15,3008,86],{"className":3009},[85],[15,3011,3013],{"className":3012},[57],[15,3014,3016],{"className":3015,"style":2740},[61],[15,3017],{},[15,3019],{"className":3020},[463,1005],[15,3022,3024],{"className":3023,"style":994},[463,993],[15,3025,464],{"className":3026},[998,76],[15,3028,3030],{"className":3029},[48],[15,3031,3033],{"className":3032},[52],[15,3034,3036],{"className":3035},[57],[15,3037,3040],{"className":3038,"style":3039},[61],"height:1.654em;",[15,3041,3043,3046],{"style":3042},"top:-3.9029em;margin-right:0.05em;",[15,3044],{"className":3045,"style":70},[69],[15,3047,3049],{"className":3048},[74,75,76,77],[15,3050,3052,3056],{"className":3051},[36,77],[15,3053],{"className":3054,"style":3055},[300,77],"margin-right:-0.1952em;",[15,3057,2575],{"className":3058},[36,77],[15,3060],{"className":3061,"style":393},[300],[15,3063,3065,3069],{"className":3064},[36],[15,3066,3068],{"className":3067},[36,190],"e",[15,3070,3072],{"className":3071},[48],[15,3073,3075],{"className":3074},[52],[15,3076,3078],{"className":3077},[57],[15,3079,3082],{"className":3080,"style":3081},[61],"height:0.938em;",[15,3083,3085,3088],{"style":3084},"top:-3.113em;margin-right:0.05em;",[15,3086],{"className":3087,"style":70},[69],[15,3089,3091],{"className":3090},[74,75,76,77],[15,3092,3094,3097,3101,3105,3109,3160,3164,3210],{"className":3093},[36,77],[15,3095,1899],{"className":3096},[36,77],[15,3098,3100],{"className":3099},[36,190,77],"h",[15,3102,3104],{"className":3103},[36,190,77],"c",[15,3106],{"className":3107,"style":3108},[300,77],"margin-right:0.1952em;",[15,3110,3112,3115],{"className":3111},[36,77],[15,3113,192],{"className":3114,"style":191},[36,190,77],[15,3116,3118],{"className":3117},[48],[15,3119,3121,3151],{"className":3120},[52,53],[15,3122,3124,3148],{"className":3123},[57],[15,3125,3128],{"className":3126,"style":3127},[61],"height:0.3448em;",[15,3129,3131,3135],{"style":3130},"top:-2.3488em;margin-left:-0.0637em;margin-right:0.0714em;",[15,3132],{"className":3133,"style":3134},[69],"height:2.5em;",[15,3136,3139],{"className":3137},[74,3138,1843,77],"reset-size3",[15,3140,3142],{"className":3141},[36,77],[15,3143,3145],{"className":3144},[36,40,77],[15,3146,721],{"className":3147},[36,77],[15,3149,86],{"className":3150},[85],[15,3152,3154],{"className":3153},[57],[15,3155,3158],{"className":3156,"style":3157},[61],"height:0.1512em;",[15,3159],{},[15,3161,3163],{"className":3162},[36,77],"\u002F",[15,3165,3167,3172],{"className":3166},[36,77],[15,3168,3171],{"className":3169,"style":3170},[36,190,77],"margin-right:0.0315em;","k",[15,3173,3175],{"className":3174},[48],[15,3176,3178,3201],{"className":3177},[52,53],[15,3179,3181,3198],{"className":3180},[57],[15,3182,3184],{"className":3183,"style":3127},[61],[15,3185,3187,3190],{"style":3186},"top:-2.3567em;margin-left:-0.0315em;margin-right:0.0714em;",[15,3188],{"className":3189,"style":3134},[69],[15,3191,3193],{"className":3192},[74,3138,1843,77],[15,3194,3197],{"className":3195,"style":3196},[36,190,77],"margin-right:0.0502em;","B",[15,3199,86],{"className":3200},[85],[15,3202,3204],{"className":3203},[57],[15,3205,3208],{"className":3206,"style":3207},[61],"height:0.1433em;",[15,3209],{},[15,3211,3214],{"className":3212,"style":3213},[36,190,77],"margin-right:0.1389em;","T",[15,3216,1237],{"className":3217},[36],[11,3219,3220],{},"The ratio depends only on the vibrational shift and the temperature, so measuring\nthe two sideband intensities returns the local temperature without any\ncalibration — the basis of Raman thermometry in flames and plasmas.",[2490,3222],{"hash":3223},"eba0efac26edda8b2f810fba74098d0c7757457c70eda35641a178e535ecb77d",[164,3225,3227],{"id":3226},"complementary-selection-rules","Complementary selection rules",[11,3229,3230],{},"Infrared and Raman activity ask different questions of a normal mode.",[3232,3233,3234,3371],"ul",{},[3235,3236,3237,3240,3241,1237],"li",{},[155,3238,3239],{},"Infrared active"," if the mode changes the dipole moment: ",[15,3242,3244],{"className":3243},[18],[15,3245,3247,3362],{"className":3246,"ariaHidden":23},[22],[15,3248,3250,3253,3256,3259,3263,3266,3269,3272,3312,3315,3359],{"className":3249},[27],[15,3251],{"className":3252,"style":766},[31],[15,3254,407],{"className":3255},[406],[15,3257,1033],{"className":3258,"style":1032},[36],[15,3260,3262],{"className":3261},[36,190],"μ",[15,3264,3163],{"className":3265},[36],[15,3267,1033],{"className":3268,"style":1032},[36],[15,3270,750],{"className":3271},[36,190],[15,3273,3275,3278],{"className":3274},[463],[15,3276,464],{"className":3277},[463],[15,3279,3281],{"className":3280},[48],[15,3282,3284,3304],{"className":3283},[52,53],[15,3285,3287,3301],{"className":3286},[57],[15,3288,3290],{"className":3289,"style":62},[61],[15,3291,3292,3295],{"style":787},[15,3293],{"className":3294,"style":70},[69],[15,3296,3298],{"className":3297},[74,75,76,77],[15,3299,217],{"className":3300},[36,77],[15,3302,86],{"className":3303},[85],[15,3305,3307],{"className":3306},[57],[15,3308,3310],{"className":3309,"style":93},[61],[15,3311],{},[15,3313],{"className":3314,"style":301},[300],[15,3316,3318,3352,3356],{"className":3317},[305],[15,3319,3321],{"className":3320},[305],[15,3322,3325],{"className":3323},[36,3324],"vbox",[15,3326,3329],{"className":3327},[3328],"thinbox",[15,3330,3333,3337,3348],{"className":3331},[3332],"rlap",[15,3334],{"className":3335,"style":3336},[31],"height:0.8889em;vertical-align:-0.1944em;",[15,3338,3341],{"className":3339},[3340],"inner",[15,3342,3344],{"className":3343},[36],[15,3345,3347],{"className":3346},[305],"",[15,3349],{"className":3350},[3351],"fix",[15,3353],{"className":3354},[300,3355],"nobreak",[15,3357,306],{"className":3358},[305],[15,3360],{"className":3361,"style":301},[300],[15,3363,3365,3368],{"className":3364},[27],[15,3366],{"className":3367,"style":2527},[31],[15,3369,217],{"className":3370},[36],[3235,3372,3373,3376,3377,1237],{},[155,3374,3375],{},"Raman active"," if the mode changes the polarizability: ",[15,3378,3380],{"className":3379},[18],[15,3381,3383,3489],{"className":3382,"ariaHidden":23},[22],[15,3384,3386,3389,3392,3395,3398,3401,3404,3407,3447,3450,3486],{"className":3385},[27],[15,3387],{"className":3388,"style":766},[31],[15,3390,407],{"className":3391},[406],[15,3393,1033],{"className":3394,"style":1032},[36],[15,3396,546],{"className":3397,"style":545},[36,190],[15,3399,3163],{"className":3400},[36],[15,3402,1033],{"className":3403,"style":1032},[36],[15,3405,750],{"className":3406},[36,190],[15,3408,3410,3413],{"className":3409},[463],[15,3411,464],{"className":3412},[463],[15,3414,3416],{"className":3415},[48],[15,3417,3419,3439],{"className":3418},[52,53],[15,3420,3422,3436],{"className":3421},[57],[15,3423,3425],{"className":3424,"style":62},[61],[15,3426,3427,3430],{"style":787},[15,3428],{"className":3429,"style":70},[69],[15,3431,3433],{"className":3432},[74,75,76,77],[15,3434,217],{"className":3435},[36,77],[15,3437,86],{"className":3438},[85],[15,3440,3442],{"className":3441},[57],[15,3443,3445],{"className":3444,"style":93},[61],[15,3446],{},[15,3448],{"className":3449,"style":301},[300],[15,3451,3453,3480,3483],{"className":3452},[305],[15,3454,3456],{"className":3455},[305],[15,3457,3459],{"className":3458},[36,3324],[15,3460,3462],{"className":3461},[3328],[15,3463,3465,3468,3477],{"className":3464},[3332],[15,3466],{"className":3467,"style":3336},[31],[15,3469,3471],{"className":3470},[3340],[15,3472,3474],{"className":3473},[36],[15,3475,3347],{"className":3476},[305],[15,3478],{"className":3479},[3351],[15,3481],{"className":3482},[300,3355],[15,3484,306],{"className":3485},[305],[15,3487],{"className":3488,"style":301},[300],[15,3490,3492,3495],{"className":3491},[27],[15,3493],{"className":3494,"style":2527},[31],[15,3496,217],{"className":3497},[36],[11,3499,3500,3501,3516,3517,3533,3534,3516,3549,3564,3565,3568],{},"For a molecule with a center of symmetry the two conditions are mutually\nexclusive: a mode symmetric under inversion changes ",[15,3502,3504],{"className":3503},[18],[15,3505,3507],{"className":3506,"ariaHidden":23},[22],[15,3508,3510,3513],{"className":3509},[27],[15,3511],{"className":3512,"style":595},[31],[15,3514,546],{"className":3515,"style":545},[36,190]," but not ",[15,3518,3520],{"className":3519},[18],[15,3521,3523],{"className":3522,"ariaHidden":23},[22],[15,3524,3526,3530],{"className":3525},[27],[15,3527],{"className":3528,"style":3529},[31],"height:0.625em;vertical-align:-0.1944em;",[15,3531,3262],{"className":3532},[36,190],", and an\nantisymmetric mode changes ",[15,3535,3537],{"className":3536},[18],[15,3538,3540],{"className":3539,"ariaHidden":23},[22],[15,3541,3543,3546],{"className":3542},[27],[15,3544],{"className":3545,"style":3529},[31],[15,3547,3262],{"className":3548},[36,190],[15,3550,3552],{"className":3551},[18],[15,3553,3555],{"className":3554,"ariaHidden":23},[22],[15,3556,3558,3561],{"className":3557},[27],[15,3559],{"className":3560,"style":595},[31],[15,3562,546],{"className":3563,"style":545},[36,190],". This ",[155,3566,3567],{},"rule of mutual\nexclusion"," means no vibration of a centrosymmetric molecule appears in both\nspectra, so the two techniques together map every mode.",[3570,3571,3572,3594],"table",{},[3573,3574,3575],"thead",{},[3576,3577,3578,3582,3585,3588,3591],"tr",{},[3579,3580,3581],"th",{},"Mode",[3579,3583,3584],{},"Dipole change",[3579,3586,3587],{},"Polarizability change",[3579,3589,3590],{},"Infrared",[3579,3592,3593],{},"Raman",[3595,3596,3597,3671,3739,3807],"tbody",{},[3576,3598,3599,3659,3662,3665,3668],{},[3600,3601,3602,3658],"td",{},[15,3603,3605],{"className":3604},[18],[15,3606,3608],{"className":3607,"ariaHidden":23},[22],[15,3609,3611,3614],{"className":3610},[27],[15,3612],{"className":3613,"style":32},[31],[15,3615,3617,3624],{"className":3616},[36],[15,3618,3620],{"className":3619},[36,40],[15,3621,3623],{"className":3622},[36],"CO",[15,3625,3627],{"className":3626},[48],[15,3628,3630,3650],{"className":3629},[52,53],[15,3631,3633,3647],{"className":3632},[57],[15,3634,3636],{"className":3635,"style":62},[61],[15,3637,3638,3641],{"style":65},[15,3639],{"className":3640,"style":70},[69],[15,3642,3644],{"className":3643},[74,75,76,77],[15,3645,81],{"className":3646},[36,77],[15,3648,86],{"className":3649},[85],[15,3651,3653],{"className":3652},[57],[15,3654,3656],{"className":3655,"style":93},[61],[15,3657],{}," symmetric stretch",[3600,3660,3661],{},"none",[3600,3663,3664],{},"yes",[3600,3666,3667],{},"inactive",[3600,3669,3670],{},"active",[3576,3672,3673,3731,3733,3735,3737],{},[3600,3674,3675,3730],{},[15,3676,3678],{"className":3677},[18],[15,3679,3681],{"className":3680,"ariaHidden":23},[22],[15,3682,3684,3687],{"className":3683},[27],[15,3685],{"className":3686,"style":32},[31],[15,3688,3690,3696],{"className":3689},[36],[15,3691,3693],{"className":3692},[36,40],[15,3694,3623],{"className":3695},[36],[15,3697,3699],{"className":3698},[48],[15,3700,3702,3722],{"className":3701},[52,53],[15,3703,3705,3719],{"className":3704},[57],[15,3706,3708],{"className":3707,"style":62},[61],[15,3709,3710,3713],{"style":65},[15,3711],{"className":3712,"style":70},[69],[15,3714,3716],{"className":3715},[74,75,76,77],[15,3717,81],{"className":3718},[36,77],[15,3720,86],{"className":3721},[85],[15,3723,3725],{"className":3724},[57],[15,3726,3728],{"className":3727,"style":93},[61],[15,3729],{}," antisymmetric stretch",[3600,3732,3664],{},[3600,3734,3661],{},[3600,3736,3670],{},[3600,3738,3667],{},[3576,3740,3741,3799,3801,3803,3805],{},[3600,3742,3743,3798],{},[15,3744,3746],{"className":3745},[18],[15,3747,3749],{"className":3748,"ariaHidden":23},[22],[15,3750,3752,3755],{"className":3751},[27],[15,3753],{"className":3754,"style":32},[31],[15,3756,3758,3764],{"className":3757},[36],[15,3759,3761],{"className":3760},[36,40],[15,3762,3623],{"className":3763},[36],[15,3765,3767],{"className":3766},[48],[15,3768,3770,3790],{"className":3769},[52,53],[15,3771,3773,3787],{"className":3772},[57],[15,3774,3776],{"className":3775,"style":62},[61],[15,3777,3778,3781],{"style":65},[15,3779],{"className":3780,"style":70},[69],[15,3782,3784],{"className":3783},[74,75,76,77],[15,3785,81],{"className":3786},[36,77],[15,3788,86],{"className":3789},[85],[15,3791,3793],{"className":3792},[57],[15,3794,3796],{"className":3795,"style":93},[61],[15,3797],{}," bend",[3600,3800,3664],{},[3600,3802,3661],{},[3600,3804,3670],{},[3600,3806,3667],{},[3576,3808,3809,3867,3869,3871,3873],{},[3600,3810,3811,3866],{},[15,3812,3814],{"className":3813},[18],[15,3815,3817],{"className":3816,"ariaHidden":23},[22],[15,3818,3820,3823],{"className":3819},[27],[15,3821],{"className":3822,"style":32},[31],[15,3824,3826,3832],{"className":3825},[36],[15,3827,3829],{"className":3828},[36,40],[15,3830,44],{"className":3831},[36],[15,3833,3835],{"className":3834},[48],[15,3836,3838,3858],{"className":3837},[52,53],[15,3839,3841,3855],{"className":3840},[57],[15,3842,3844],{"className":3843,"style":62},[61],[15,3845,3846,3849],{"style":65},[15,3847],{"className":3848,"style":70},[69],[15,3850,3852],{"className":3851},[74,75,76,77],[15,3853,81],{"className":3854},[36,77],[15,3856,86],{"className":3857},[85],[15,3859,3861],{"className":3860},[57],[15,3862,3864],{"className":3863,"style":93},[61],[15,3865],{}," stretch",[3600,3868,3661],{},[3600,3870,3664],{},[3600,3872,3667],{},[3600,3874,3670],{},[11,3876,3877,3878,3933,3934,3989,3990,4046,4047,4065,4066,4084],{},"The homonuclear molecules ",[15,3879,3881],{"className":3880},[18],[15,3882,3884],{"className":3883,"ariaHidden":23},[22],[15,3885,3887,3890],{"className":3886},[27],[15,3888],{"className":3889,"style":32},[31],[15,3891,3893,3899],{"className":3892},[36],[15,3894,3896],{"className":3895},[36,40],[15,3897,44],{"className":3898},[36],[15,3900,3902],{"className":3901},[48],[15,3903,3905,3925],{"className":3904},[52,53],[15,3906,3908,3922],{"className":3907},[57],[15,3909,3911],{"className":3910,"style":62},[61],[15,3912,3913,3916],{"style":65},[15,3914],{"className":3915,"style":70},[69],[15,3917,3919],{"className":3918},[74,75,76,77],[15,3920,81],{"className":3921},[36,77],[15,3923,86],{"className":3924},[85],[15,3926,3928],{"className":3927},[57],[15,3929,3931],{"className":3930,"style":93},[61],[15,3932],{}," and ",[15,3935,3937],{"className":3936},[18],[15,3938,3940],{"className":3939,"ariaHidden":23},[22],[15,3941,3943,3946],{"className":3942},[27],[15,3944],{"className":3945,"style":32},[31],[15,3947,3949,3955],{"className":3948},[36],[15,3950,3952],{"className":3951},[36,40],[15,3953,118],{"className":3954},[36],[15,3956,3958],{"className":3957},[48],[15,3959,3961,3981],{"className":3960},[52,53],[15,3962,3964,3978],{"className":3963},[57],[15,3965,3967],{"className":3966,"style":62},[61],[15,3968,3969,3972],{"style":65},[15,3970],{"className":3971,"style":70},[69],[15,3973,3975],{"className":3974},[74,75,76,77],[15,3976,81],{"className":3977},[36,77],[15,3979,86],{"className":3980},[85],[15,3982,3984],{"className":3983},[57],[15,3985,3987],{"className":3986,"style":93},[61],[15,3988],{},", invisible to the\ninfrared, are the textbook Raman case: their single stretch modulates the\npolarizability and scatters, so Raman reads the vibrational frequency of a\nmolecule with no dipole spectrum at all. Rotational Raman scattering follows\n",[15,3991,3993],{"className":3992},[18],[15,3994,3996,4021],{"className":3995,"ariaHidden":23},[22],[15,3997,3999,4003,4007,4012,4015,4018],{"className":3998},[27],[15,4000],{"className":4001,"style":4002},[31],"height:0.6833em;",[15,4004,4006],{"className":4005},[36],"Δ",[15,4008,4011],{"className":4009,"style":4010},[36,190],"margin-right:0.0962em;","J",[15,4013],{"className":4014,"style":301},[300],[15,4016,306],{"className":4017},[305],[15,4019],{"className":4020,"style":301},[300],[15,4022,4024,4028,4031,4036,4039,4043],{"className":4023},[27],[15,4025],{"className":4026,"style":4027},[31],"height:0.8389em;vertical-align:-0.1944em;",[15,4029,217],{"className":4030},[36],[15,4032,4035],{"className":4033},[4034],"mpunct",",",[15,4037],{"className":4038,"style":393},[300],[15,4040,4042],{"className":4041},[36],"±",[15,4044,81],{"className":4045},[36],", since the polarizability returns to itself twice per\nrotation, giving lines spaced by ",[15,4048,4050],{"className":4049},[18],[15,4051,4053],{"className":4052,"ariaHidden":23},[22],[15,4054,4056,4059,4062],{"className":4055},[27],[15,4057],{"className":4058,"style":4002},[31],[15,4060,2575],{"className":4061},[36],[15,4063,3197],{"className":4064,"style":3196},[36,190]," rather than the ",[15,4067,4069],{"className":4068},[18],[15,4070,4072],{"className":4071,"ariaHidden":23},[22],[15,4073,4075,4078,4081],{"className":4074},[27],[15,4076],{"className":4077,"style":4002},[31],[15,4079,81],{"className":4080},[36],[15,4082,3197],{"className":4083,"style":3196},[36,190]," of dipole absorption.",[164,4086,4088],{"id":4087},"electronic-transitions-and-the-franck-condon-principle","Electronic transitions and the Franck-Condon principle",[11,4090,4091,4092,4095],{},"An electronic transition moves the molecule to a different electronic state, one\nwith its own potential curve, equilibrium separation, and vibrational ladder. The\nphoton energies are of order electron-volts, so these bands lie in the visible\nand ultraviolet. Because each electronic state carries a vibrational structure, a\nsingle electronic transition splits into many closely spaced ",[155,4093,4094],{},"vibronic"," lines,\nturning a would-be line into a band.",[11,4097,4098,4099,4102,4103,4106,4107,4124],{},"Which vibronic lines are strong is fixed by the ",[155,4100,4101],{},"Franck-Condon principle",": the\nelectrons rearrange so much faster than the nuclei that the internuclear distance\nis frozen during the transition. On a potential-energy diagram the transition is\ntherefore ",[155,4104,4105],{},"vertical",", a straight up-arrow at fixed ",[15,4108,4110],{"className":4109},[18],[15,4111,4113],{"className":4112,"ariaHidden":23},[22],[15,4114,4116,4119],{"className":4115},[27],[15,4117],{"className":4118,"style":595},[31],[15,4120,4123],{"className":4121,"style":4122},[36,190],"margin-right:0.0278em;","r",". If the upper electronic\nstate has a larger equilibrium separation than the lower — as it usually does,\nsince promoting a bonding electron weakens the bond — the vertical line from the\nbottom of the lower well reaches the upper curve high on its inner wall, near a\nclassical turning point of an excited vibrational level.",[2490,4126],{"hash":4127},"5c56366355ea55dcc6b7625a7228e963bfa5d33b907a3bdf492546541c4ddde9",[11,4129,4130,4131,4177,4178,4223,4224,4035],{},"Quantitatively, the intensity of a vibronic line from lower level ",[15,4132,4134],{"className":4133},[18],[15,4135,4137],{"className":4136,"ariaHidden":23},[22],[15,4138,4140,4144],{"className":4139},[27],[15,4141],{"className":4142,"style":4143},[31],"height:0.7519em;",[15,4145,4147,4150],{"className":4146},[36],[15,4148,2511],{"className":4149,"style":414},[36,190],[15,4151,4153],{"className":4152},[48],[15,4154,4156],{"className":4155},[52],[15,4157,4159],{"className":4158},[57],[15,4160,4162],{"className":4161,"style":4143},[61],[15,4163,4164,4167],{"style":2565},[15,4165],{"className":4166,"style":70},[69],[15,4168,4170],{"className":4169},[74,75,76,77],[15,4171,4173],{"className":4172},[36,77],[15,4174,4176],{"className":4175},[36,77],"′′"," to upper\nlevel ",[15,4179,4181],{"className":4180},[18],[15,4182,4184],{"className":4183,"ariaHidden":23},[22],[15,4185,4187,4190],{"className":4186},[27],[15,4188],{"className":4189,"style":4143},[31],[15,4191,4193,4196],{"className":4192},[36],[15,4194,2511],{"className":4195,"style":414},[36,190],[15,4197,4199],{"className":4198},[48],[15,4200,4202],{"className":4201},[52],[15,4203,4205],{"className":4204},[57],[15,4206,4208],{"className":4207,"style":4143},[61],[15,4209,4210,4213],{"style":2565},[15,4211],{"className":4212,"style":70},[69],[15,4214,4216],{"className":4215},[74,75,76,77],[15,4217,4219],{"className":4218},[36,77],[15,4220,4222],{"className":4221},[36,77],"′"," is proportional to the square of the vibrational overlap, the\n",[155,4225,4226],{},"Franck-Condon factor",[15,4228,4230],{"className":4229},[882],[15,4231,4233],{"className":4232},[18],[15,4234,4236,4363],{"className":4235,"ariaHidden":23},[22],[15,4237,4239,4242,4353,4356,4360],{"className":4238},[27],[15,4240],{"className":4241,"style":32},[31],[15,4243,4245,4248],{"className":4244},[36],[15,4246,2627],{"className":4247,"style":2626},[36,190],[15,4249,4251],{"className":4250},[48],[15,4252,4254,4345],{"className":4253},[52,53],[15,4255,4257,4342],{"className":4256},[57],[15,4258,4261],{"className":4259,"style":4260},[61],"height:0.328em;",[15,4262,4263,4266],{"style":2642},[15,4264],{"className":4265,"style":70},[69],[15,4267,4269],{"className":4268},[74,75,76,77],[15,4270,4272,4306,4310],{"className":4271},[36,77],[15,4273,4275,4278],{"className":4274},[36,77],[15,4276,2511],{"className":4277,"style":414},[36,190,77],[15,4279,4281],{"className":4280},[48],[15,4282,4284],{"className":4283},[52],[15,4285,4287],{"className":4286},[57],[15,4288,4291],{"className":4289,"style":4290},[61],"height:0.6828em;",[15,4292,4294,4297],{"style":4293},"top:-2.786em;margin-right:0.0714em;",[15,4295],{"className":4296,"style":3134},[69],[15,4298,4300],{"className":4299},[74,3138,1843,77],[15,4301,4303],{"className":4302},[36,77],[15,4304,4222],{"className":4305},[36,77],[15,4307,4309],{"className":4308},[305,77],"←",[15,4311,4313,4316],{"className":4312},[36,77],[15,4314,2511],{"className":4315,"style":414},[36,190,77],[15,4317,4319],{"className":4318},[48],[15,4320,4322],{"className":4321},[52],[15,4323,4325],{"className":4324},[57],[15,4326,4328],{"className":4327,"style":4290},[61],[15,4329,4330,4333],{"style":4293},[15,4331],{"className":4332,"style":3134},[69],[15,4334,4336],{"className":4335},[74,3138,1843,77],[15,4337,4339],{"className":4338},[36,77],[15,4340,4176],{"className":4341},[36,77],[15,4343,86],{"className":4344},[85],[15,4346,4348],{"className":4347},[57],[15,4349,4351],{"className":4350,"style":93},[61],[15,4352],{},[15,4354],{"className":4355,"style":301},[300],[15,4357,4359],{"className":4358},[305],"∝",[15,4361],{"className":4362,"style":301},[300],[15,4364,4366,4370,4417,4421,4495,4498,4502,4505,4577,4581,4646],{"className":4365},[27],[15,4367],{"className":4368,"style":4369},[31],"height:1.404em;vertical-align:-0.35em;",[15,4371,4373],{"className":4372},[406],[15,4374,4377],{"className":4375},[998,4376],"mult",[15,4378,4380,4408],{"className":4379},[52,53],[15,4381,4383,4405],{"className":4382},[57],[15,4384,4387],{"className":4385,"style":4386},[61],"height:0.85em;",[15,4388,4390,4394],{"style":4389},"top:-2.85em;",[15,4391],{"className":4392,"style":4393},[69],"height:3.2em;",[15,4395,4397],{"style":4396},"width:0.333em;height:1.2em;",[285,4398,4402],{"xmlns":287,"width":4399,"height":4400,"viewBox":4401},"0.333em","1.2em","0 0 333 1200",[294,4403],{"d":4404},"M145 15 v585 v0 v585 c2.667,10,9.667,15,21,15\nc10,0,16.667,-5,20,-15 v-585 v0 v-585 c-2.667,-10,-9.667,-15,-21,-15\nc-10,0,-16.667,5,-20,15z M188 15 H145 v585 v0 v585 h43z",[15,4406,86],{"className":4407},[85],[15,4409,4411],{"className":4410},[57],[15,4412,4415],{"className":4413,"style":4414},[61],"height:0.35em;",[15,4416],{},[15,4418,4420],{"className":4419},[406],"⟨",[15,4422,4424,4428],{"className":4423},[36],[15,4425,4427],{"className":4426,"style":414},[36,190],"ψ",[15,4429,4431],{"className":4430},[48],[15,4432,4434,4487],{"className":4433},[52,53],[15,4435,4437,4484],{"className":4436},[57],[15,4438,4440],{"className":4439,"style":4260},[61],[15,4441,4443,4446],{"style":4442},"top:-2.55em;margin-left:-0.0359em;margin-right:0.05em;",[15,4444],{"className":4445,"style":70},[69],[15,4447,4449],{"className":4448},[74,75,76,77],[15,4450,4452],{"className":4451},[36,77],[15,4453,4455,4458],{"className":4454},[36,77],[15,4456,2511],{"className":4457,"style":414},[36,190,77],[15,4459,4461],{"className":4460},[48],[15,4462,4464],{"className":4463},[52],[15,4465,4467],{"className":4466},[57],[15,4468,4470],{"className":4469,"style":4290},[61],[15,4471,4472,4475],{"style":4293},[15,4473],{"className":4474,"style":3134},[69],[15,4476,4478],{"className":4477},[74,3138,1843,77],[15,4479,4481],{"className":4480},[36,77],[15,4482,4222],{"className":4483},[36,77],[15,4485,86],{"className":4486},[85],[15,4488,4490],{"className":4489},[57],[15,4491,4493],{"className":4492,"style":93},[61],[15,4494],{},[15,4496],{"className":4497,"style":393},[300],[15,4499,4501],{"className":4500},[36],"∣",[15,4503],{"className":4504,"style":393},[300],[15,4506,4508,4511],{"className":4507},[36],[15,4509,4427],{"className":4510,"style":414},[36,190],[15,4512,4514],{"className":4513},[48],[15,4515,4517,4569],{"className":4516},[52,53],[15,4518,4520,4566],{"className":4519},[57],[15,4521,4523],{"className":4522,"style":4260},[61],[15,4524,4525,4528],{"style":4442},[15,4526],{"className":4527,"style":70},[69],[15,4529,4531],{"className":4530},[74,75,76,77],[15,4532,4534],{"className":4533},[36,77],[15,4535,4537,4540],{"className":4536},[36,77],[15,4538,2511],{"className":4539,"style":414},[36,190,77],[15,4541,4543],{"className":4542},[48],[15,4544,4546],{"className":4545},[52],[15,4547,4549],{"className":4548},[57],[15,4550,4552],{"className":4551,"style":4290},[61],[15,4553,4554,4557],{"style":4293},[15,4555],{"className":4556,"style":3134},[69],[15,4558,4560],{"className":4559},[74,3138,1843,77],[15,4561,4563],{"className":4562},[36,77],[15,4564,4176],{"className":4565},[36,77],[15,4567,86],{"className":4568},[85],[15,4570,4572],{"className":4571},[57],[15,4573,4575],{"className":4574,"style":93},[61],[15,4576],{},[15,4578,4580],{"className":4579},[463],"⟩",[15,4582,4584,4621],{"className":4583},[463],[15,4585,4587],{"className":4586},[463],[15,4588,4590],{"className":4589},[998,4376],[15,4591,4593,4613],{"className":4592},[52,53],[15,4594,4596,4610],{"className":4595},[57],[15,4597,4599],{"className":4598,"style":4386},[61],[15,4600,4601,4604],{"style":4389},[15,4602],{"className":4603,"style":4393},[69],[15,4605,4606],{"style":4396},[285,4607,4608],{"xmlns":287,"width":4399,"height":4400,"viewBox":4401},[294,4609],{"d":4404},[15,4611,86],{"className":4612},[85],[15,4614,4616],{"className":4615},[57],[15,4617,4619],{"className":4618,"style":4414},[61],[15,4620],{},[15,4622,4624],{"className":4623},[48],[15,4625,4627],{"className":4626},[52],[15,4628,4630],{"className":4629},[57],[15,4631,4634],{"className":4632,"style":4633},[61],"height:1.054em;",[15,4635,4637,4640],{"style":4636},"top:-3.3029em;margin-right:0.05em;",[15,4638],{"className":4639,"style":70},[69],[15,4641,4643],{"className":4642},[74,75,76,77],[15,4644,81],{"className":4645},[36,77],[15,4647,4035],{"className":4648},[4034],[11,4650,4651,4652,4714,4715,4759,4760,4763,4764,4808],{},"the electronic transition moment being nearly constant across the band. From the\nground level ",[15,4653,4655],{"className":4654},[18],[15,4656,4658,4705],{"className":4657,"ariaHidden":23},[22],[15,4659,4661,4664,4696,4699,4702],{"className":4660},[27],[15,4662],{"className":4663,"style":4143},[31],[15,4665,4667,4670],{"className":4666},[36],[15,4668,2511],{"className":4669,"style":414},[36,190],[15,4671,4673],{"className":4672},[48],[15,4674,4676],{"className":4675},[52],[15,4677,4679],{"className":4678},[57],[15,4680,4682],{"className":4681,"style":4143},[61],[15,4683,4684,4687],{"style":2565},[15,4685],{"className":4686,"style":70},[69],[15,4688,4690],{"className":4689},[74,75,76,77],[15,4691,4693],{"className":4692},[36,77],[15,4694,4176],{"className":4695},[36,77],[15,4697],{"className":4698,"style":301},[300],[15,4700,306],{"className":4701},[305],[15,4703],{"className":4704,"style":301},[300],[15,4706,4708,4711],{"className":4707},[27],[15,4709],{"className":4710,"style":2527},[31],[15,4712,217],{"className":4713},[36],", whose wavefunction peaks at the well center, the overlap is\nlargest with the upper level whose wavefunction also has large amplitude there —\nwhich for a displaced upper curve is a level of nonzero ",[15,4716,4718],{"className":4717},[18],[15,4719,4721],{"className":4720,"ariaHidden":23},[22],[15,4722,4724,4727],{"className":4723},[27],[15,4725],{"className":4726,"style":4143},[31],[15,4728,4730,4733],{"className":4729},[36],[15,4731,2511],{"className":4732,"style":414},[36,190],[15,4734,4736],{"className":4735},[48],[15,4737,4739],{"className":4738},[52],[15,4740,4742],{"className":4741},[57],[15,4743,4745],{"className":4744,"style":4143},[61],[15,4746,4747,4750],{"style":2565},[15,4748],{"className":4749,"style":70},[69],[15,4751,4753],{"className":4752},[74,75,76,77],[15,4754,4756],{"className":4755},[36,77],[15,4757,4222],{"className":4758},[36,77],". The band intensity\ntherefore rises through the first few members of the progression, peaks, and\nfalls, tracing a ",[155,4761,4762],{},"Franck-Condon envelope"," whose maximum shifts to higher ",[15,4765,4767],{"className":4766},[18],[15,4768,4770],{"className":4769,"ariaHidden":23},[22],[15,4771,4773,4776],{"className":4772},[27],[15,4774],{"className":4775,"style":4143},[31],[15,4777,4779,4782],{"className":4778},[36],[15,4780,2511],{"className":4781,"style":414},[36,190],[15,4783,4785],{"className":4784},[48],[15,4786,4788],{"className":4787},[52],[15,4789,4791],{"className":4790},[57],[15,4792,4794],{"className":4793,"style":4143},[61],[15,4795,4796,4799],{"style":2565},[15,4797],{"className":4798,"style":70},[69],[15,4800,4802],{"className":4801},[74,75,76,77],[15,4803,4805],{"className":4804},[36,77],[15,4806,4222],{"className":4807},[36,77],"\nthe more the upper curve is displaced.",[2490,4810],{"hash":4811},"352766028e123373fa893662afa93b44ab4da09ba6eb14ec14ea605175019c63",[11,4813,4814,4815,4849],{},"The mirror image appears in emission. A molecule excited to the upper electronic\nstate relaxes to its lowest vibrational level and then emits downward to the\nspread of lower-state vibrational levels, so the emission progression is the\nreflection of the absorption progression about the shared ",[15,4816,4818],{"className":4817},[18],[15,4819,4821,4840],{"className":4820,"ariaHidden":23},[22],[15,4822,4824,4827,4830,4833,4837],{"className":4823},[27],[15,4825],{"className":4826,"style":2527},[31],[15,4828,217],{"className":4829},[36],[15,4831],{"className":4832,"style":301},[300],[15,4834,4836],{"className":4835},[305],"→",[15,4838],{"className":4839,"style":301},[300],[15,4841,4843,4846],{"className":4842},[27],[15,4844],{"className":4845,"style":2527},[31],[15,4847,217],{"className":4848},[36]," line, and the\nspacing of the emission lines gives the ground-state vibrational frequency while\nthe absorption spacing gives the excited-state one.",[164,4851,4853],{"id":4852},"fluorescence-phosphorescence-and-the-jablonski-diagram","Fluorescence, phosphorescence, and the Jablonski diagram",[11,4855,4856,4857,4860,4861,4914,4915,4967,4968,5021],{},"After absorption an excited molecule has several routes back down, radiative and\nnonradiative, organized by the ",[155,4858,4859],{},"Jablonski diagram",". The relevant distinction is\nelectron spin: the ground state is a spin singlet ",[15,4862,4864],{"className":4863},[18],[15,4865,4867],{"className":4866,"ariaHidden":23},[22],[15,4868,4870,4873],{"className":4869},[27],[15,4871],{"className":4872,"style":32},[31],[15,4874,4876,4880],{"className":4875},[36],[15,4877,4879],{"className":4878,"style":266},[36,190],"S",[15,4881,4883],{"className":4882},[48],[15,4884,4886,4906],{"className":4885},[52,53],[15,4887,4889,4903],{"className":4888},[57],[15,4890,4892],{"className":4891,"style":62},[61],[15,4893,4894,4897],{"style":369},[15,4895],{"className":4896,"style":70},[69],[15,4898,4900],{"className":4899},[74,75,76,77],[15,4901,217],{"className":4902},[36,77],[15,4904,86],{"className":4905},[85],[15,4907,4909],{"className":4908},[57],[15,4910,4912],{"className":4911,"style":93},[61],[15,4913],{},", and the accessible\nexcited states are singlets ",[15,4916,4918],{"className":4917},[18],[15,4919,4921],{"className":4920,"ariaHidden":23},[22],[15,4922,4924,4927],{"className":4923},[27],[15,4925],{"className":4926,"style":32},[31],[15,4928,4930,4933],{"className":4929},[36],[15,4931,4879],{"className":4932,"style":266},[36,190],[15,4934,4936],{"className":4935},[48],[15,4937,4939,4959],{"className":4938},[52,53],[15,4940,4942,4956],{"className":4941},[57],[15,4943,4945],{"className":4944,"style":62},[61],[15,4946,4947,4950],{"style":369},[15,4948],{"className":4949,"style":70},[69],[15,4951,4953],{"className":4952},[74,75,76,77],[15,4954,1565],{"className":4955},[36,77],[15,4957,86],{"className":4958},[85],[15,4960,4962],{"className":4961},[57],[15,4963,4965],{"className":4964,"style":93},[61],[15,4966],{}," (spin allowed) or triplets ",[15,4969,4971],{"className":4970},[18],[15,4972,4974],{"className":4973,"ariaHidden":23},[22],[15,4975,4977,4980],{"className":4976},[27],[15,4978],{"className":4979,"style":32},[31],[15,4981,4983,4986],{"className":4982},[36],[15,4984,3214],{"className":4985,"style":3213},[36,190],[15,4987,4989],{"className":4988},[48],[15,4990,4992,5013],{"className":4991},[52,53],[15,4993,4995,5010],{"className":4994},[57],[15,4996,4998],{"className":4997,"style":62},[61],[15,4999,5001,5004],{"style":5000},"top:-2.55em;margin-left:-0.1389em;margin-right:0.05em;",[15,5002],{"className":5003,"style":70},[69],[15,5005,5007],{"className":5006},[74,75,76,77],[15,5008,1565],{"className":5009},[36,77],[15,5011,86],{"className":5012},[85],[15,5014,5016],{"className":5015},[57],[15,5017,5019],{"className":5018,"style":93},[61],[15,5020],{}," (spin\nforbidden).",[2490,5023],{"hash":5024},"799b227ff9fbc4a9c6b22fe87bce4fe8ab8c9a824f3413b491df313d749d8ad3",[11,5026,5027],{},"The two emissions differ in rate and delay:",[3232,5029,5030,5315],{},[3235,5031,5032,5035,5036,5143,5144,5195,5196,5258,5259,5311,5312,1237],{},[155,5033,5034],{},"Fluorescence"," is the spin-allowed ",[15,5037,5039],{"className":5038},[18],[15,5040,5042,5097],{"className":5041,"ariaHidden":23},[22],[15,5043,5045,5048,5088,5091,5094],{"className":5044},[27],[15,5046],{"className":5047,"style":32},[31],[15,5049,5051,5054],{"className":5050},[36],[15,5052,4879],{"className":5053,"style":266},[36,190],[15,5055,5057],{"className":5056},[48],[15,5058,5060,5080],{"className":5059},[52,53],[15,5061,5063,5077],{"className":5062},[57],[15,5064,5066],{"className":5065,"style":62},[61],[15,5067,5068,5071],{"style":369},[15,5069],{"className":5070,"style":70},[69],[15,5072,5074],{"className":5073},[74,75,76,77],[15,5075,1565],{"className":5076},[36,77],[15,5078,86],{"className":5079},[85],[15,5081,5083],{"className":5082},[57],[15,5084,5086],{"className":5085,"style":93},[61],[15,5087],{},[15,5089],{"className":5090,"style":301},[300],[15,5092,4836],{"className":5093},[305],[15,5095],{"className":5096,"style":301},[300],[15,5098,5100,5103],{"className":5099},[27],[15,5101],{"className":5102,"style":32},[31],[15,5104,5106,5109],{"className":5105},[36],[15,5107,4879],{"className":5108,"style":266},[36,190],[15,5110,5112],{"className":5111},[48],[15,5113,5115,5135],{"className":5114},[52,53],[15,5116,5118,5132],{"className":5117},[57],[15,5119,5121],{"className":5120,"style":62},[61],[15,5122,5123,5126],{"style":369},[15,5124],{"className":5125,"style":70},[69],[15,5127,5129],{"className":5128},[74,75,76,77],[15,5130,217],{"className":5131},[36,77],[15,5133,86],{"className":5134},[85],[15,5136,5138],{"className":5137},[57],[15,5139,5141],{"className":5140,"style":93},[61],[15,5142],{}," emission. It is fast, with a\nlifetime of order ",[15,5145,5147],{"className":5146},[18],[15,5148,5150],{"className":5149,"ariaHidden":23},[22],[15,5151,5153,5156,5159],{"className":5152},[27],[15,5154],{"className":5155,"style":2544},[31],[15,5157,1565],{"className":5158},[36],[15,5160,5162,5165],{"className":5161},[36],[15,5163,217],{"className":5164},[36],[15,5166,5168],{"className":5167},[48],[15,5169,5171],{"className":5170},[52],[15,5172,5174],{"className":5173},[57],[15,5175,5177],{"className":5176,"style":2544},[61],[15,5178,5179,5182],{"style":2565},[15,5180],{"className":5181,"style":70},[69],[15,5183,5185],{"className":5184},[74,75,76,77],[15,5186,5188,5191],{"className":5187},[36,77],[15,5189,1899],{"className":5190},[36,77],[15,5192,5194],{"className":5193},[36,77],"9","-",[15,5197,5199],{"className":5198},[18],[15,5200,5202],{"className":5201,"ariaHidden":23},[22],[15,5203,5205,5208,5211,5247,5251],{"className":5204},[27],[15,5206],{"className":5207,"style":2544},[31],[15,5209,1565],{"className":5210},[36],[15,5212,5214,5217],{"className":5213},[36],[15,5215,217],{"className":5216},[36],[15,5218,5220],{"className":5219},[48],[15,5221,5223],{"className":5222},[52],[15,5224,5226],{"className":5225},[57],[15,5227,5229],{"className":5228,"style":2544},[61],[15,5230,5231,5234],{"style":2565},[15,5232],{"className":5233,"style":70},[69],[15,5235,5237],{"className":5236},[74,75,76,77],[15,5238,5240,5243],{"className":5239},[36,77],[15,5241,1899],{"className":5242},[36,77],[15,5244,5246],{"className":5245},[36,77],"7",[15,5248,5250],{"className":5249},[300]," ",[15,5252,5254],{"className":5253},[36,40],[15,5255,5257],{"className":5256},[36],"s",", and stops promptly when the\nexcitation is removed. Because the molecule relaxes to the bottom of ",[15,5260,5262],{"className":5261},[18],[15,5263,5265],{"className":5264,"ariaHidden":23},[22],[15,5266,5268,5271],{"className":5267},[27],[15,5269],{"className":5270,"style":32},[31],[15,5272,5274,5277],{"className":5273},[36],[15,5275,4879],{"className":5276,"style":266},[36,190],[15,5278,5280],{"className":5279},[48],[15,5281,5283,5303],{"className":5282},[52,53],[15,5284,5286,5300],{"className":5285},[57],[15,5287,5289],{"className":5288,"style":62},[61],[15,5290,5291,5294],{"style":369},[15,5292],{"className":5293,"style":70},[69],[15,5295,5297],{"className":5296},[74,75,76,77],[15,5298,1565],{"className":5299},[36,77],[15,5301,86],{"className":5302},[85],[15,5304,5306],{"className":5305},[57],[15,5307,5309],{"className":5308,"style":93},[61],[15,5310],{},"\nbefore emitting (Kasha's rule), the fluorescence is red-shifted from the\nabsorption by the vibrational relaxation energy, the ",[155,5313,5314],{},"Stokes shift",[3235,5316,5317,5320,5321,5324,5325,5377,5378,5430,5431,5538,5539,5591],{},[155,5318,5319],{},"Phosphorescence"," follows an ",[155,5322,5323],{},"intersystem crossing"," from ",[15,5326,5328],{"className":5327},[18],[15,5329,5331],{"className":5330,"ariaHidden":23},[22],[15,5332,5334,5337],{"className":5333},[27],[15,5335],{"className":5336,"style":32},[31],[15,5338,5340,5343],{"className":5339},[36],[15,5341,4879],{"className":5342,"style":266},[36,190],[15,5344,5346],{"className":5345},[48],[15,5347,5349,5369],{"className":5348},[52,53],[15,5350,5352,5366],{"className":5351},[57],[15,5353,5355],{"className":5354,"style":62},[61],[15,5356,5357,5360],{"style":369},[15,5358],{"className":5359,"style":70},[69],[15,5361,5363],{"className":5362},[74,75,76,77],[15,5364,1565],{"className":5365},[36,77],[15,5367,86],{"className":5368},[85],[15,5370,5372],{"className":5371},[57],[15,5373,5375],{"className":5374,"style":93},[61],[15,5376],{}," to the lower\ntriplet ",[15,5379,5381],{"className":5380},[18],[15,5382,5384],{"className":5383,"ariaHidden":23},[22],[15,5385,5387,5390],{"className":5386},[27],[15,5388],{"className":5389,"style":32},[31],[15,5391,5393,5396],{"className":5392},[36],[15,5394,3214],{"className":5395,"style":3213},[36,190],[15,5397,5399],{"className":5398},[48],[15,5400,5402,5422],{"className":5401},[52,53],[15,5403,5405,5419],{"className":5404},[57],[15,5406,5408],{"className":5407,"style":62},[61],[15,5409,5410,5413],{"style":5000},[15,5411],{"className":5412,"style":70},[69],[15,5414,5416],{"className":5415},[74,75,76,77],[15,5417,1565],{"className":5418},[36,77],[15,5420,86],{"className":5421},[85],[15,5423,5425],{"className":5424},[57],[15,5426,5428],{"className":5427,"style":93},[61],[15,5429],{},", a spin flip made possible by spin-orbit coupling. The\n",[15,5432,5434],{"className":5433},[18],[15,5435,5437,5492],{"className":5436,"ariaHidden":23},[22],[15,5438,5440,5443,5483,5486,5489],{"className":5439},[27],[15,5441],{"className":5442,"style":32},[31],[15,5444,5446,5449],{"className":5445},[36],[15,5447,3214],{"className":5448,"style":3213},[36,190],[15,5450,5452],{"className":5451},[48],[15,5453,5455,5475],{"className":5454},[52,53],[15,5456,5458,5472],{"className":5457},[57],[15,5459,5461],{"className":5460,"style":62},[61],[15,5462,5463,5466],{"style":5000},[15,5464],{"className":5465,"style":70},[69],[15,5467,5469],{"className":5468},[74,75,76,77],[15,5470,1565],{"className":5471},[36,77],[15,5473,86],{"className":5474},[85],[15,5476,5478],{"className":5477},[57],[15,5479,5481],{"className":5480,"style":93},[61],[15,5482],{},[15,5484],{"className":5485,"style":301},[300],[15,5487,4836],{"className":5488},[305],[15,5490],{"className":5491,"style":301},[300],[15,5493,5495,5498],{"className":5494},[27],[15,5496],{"className":5497,"style":32},[31],[15,5499,5501,5504],{"className":5500},[36],[15,5502,4879],{"className":5503,"style":266},[36,190],[15,5505,5507],{"className":5506},[48],[15,5508,5510,5530],{"className":5509},[52,53],[15,5511,5513,5527],{"className":5512},[57],[15,5514,5516],{"className":5515,"style":62},[61],[15,5517,5518,5521],{"style":369},[15,5519],{"className":5520,"style":70},[69],[15,5522,5524],{"className":5523},[74,75,76,77],[15,5525,217],{"className":5526},[36,77],[15,5528,86],{"className":5529},[85],[15,5531,5533],{"className":5532},[57],[15,5534,5536],{"className":5535,"style":93},[61],[15,5537],{}," emission is spin-forbidden and therefore slow, with lifetimes\nfrom milliseconds to seconds, so a phosphor glows after the light is switched\noff. The triplet lies below ",[15,5540,5542],{"className":5541},[18],[15,5543,5545],{"className":5544,"ariaHidden":23},[22],[15,5546,5548,5551],{"className":5547},[27],[15,5549],{"className":5550,"style":32},[31],[15,5552,5554,5557],{"className":5553},[36],[15,5555,4879],{"className":5556,"style":266},[36,190],[15,5558,5560],{"className":5559},[48],[15,5561,5563,5583],{"className":5562},[52,53],[15,5564,5566,5580],{"className":5565},[57],[15,5567,5569],{"className":5568,"style":62},[61],[15,5570,5571,5574],{"style":369},[15,5572],{"className":5573,"style":70},[69],[15,5575,5577],{"className":5576},[74,75,76,77],[15,5578,1565],{"className":5579},[36,77],[15,5581,86],{"className":5582},[85],[15,5584,5586],{"className":5585},[57],[15,5587,5589],{"className":5588,"style":93},[61],[15,5590],{},", so phosphorescence is red-shifted still\nfurther.",[11,5593,5594,5595,5647,5648,5703],{},"The same triplet bottleneck that makes phosphorescence slow makes it useful:\nbecause molecules dwell in ",[15,5596,5598],{"className":5597},[18],[15,5599,5601],{"className":5600,"ariaHidden":23},[22],[15,5602,5604,5607],{"className":5603},[27],[15,5605],{"className":5606,"style":32},[31],[15,5608,5610,5613],{"className":5609},[36],[15,5611,3214],{"className":5612,"style":3213},[36,190],[15,5614,5616],{"className":5615},[48],[15,5617,5619,5639],{"className":5618},[52,53],[15,5620,5622,5636],{"className":5621},[57],[15,5623,5625],{"className":5624,"style":62},[61],[15,5626,5627,5630],{"style":5000},[15,5628],{"className":5629,"style":70},[69],[15,5631,5633],{"className":5632},[74,75,76,77],[15,5634,1565],{"className":5635},[36,77],[15,5637,86],{"className":5638},[85],[15,5640,5642],{"className":5641},[57],[15,5643,5645],{"className":5644,"style":93},[61],[15,5646],{},", that state is where photochemistry and, in\n",[15,5649,5651],{"className":5650},[18],[15,5652,5654],{"className":5653,"ariaHidden":23},[22],[15,5655,5657,5660],{"className":5656},[27],[15,5658],{"className":5659,"style":32},[31],[15,5661,5663,5669],{"className":5662},[36],[15,5664,5666],{"className":5665},[36,40],[15,5667,118],{"className":5668},[36],[15,5670,5672],{"className":5671},[48],[15,5673,5675,5695],{"className":5674},[52,53],[15,5676,5678,5692],{"className":5677},[57],[15,5679,5681],{"className":5680,"style":62},[61],[15,5682,5683,5686],{"style":65},[15,5684],{"className":5685,"style":70},[69],[15,5687,5689],{"className":5688},[74,75,76,77],[15,5690,81],{"className":5691},[36,77],[15,5693,86],{"className":5694},[85],[15,5696,5698],{"className":5697},[57],[15,5699,5701],{"className":5700,"style":93},[61],[15,5702],{},", the reactive singlet-oxygen chemistry of photosensitizers begin.",[11,5705,5706,5707,5712],{},"Electronic band systems close the survey of molecular spectroscopy. A band\nspectrum is a progression of vibronic bands, each itself a rotational envelope,\nso a single electronic transition resolves under high dispersion into thousands\nof rotational lines — the fingerprint by which a diatomic molecule is identified\nin a stellar atmosphere or a discharge. The coherent counterpart of stimulated\nemission between such levels builds the ",[5708,5709,5711],"a",{"href":5710},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers","laser",",\nwhere a population inversion between molecular or atomic states turns spontaneous\nemission into an amplified beam.",{"title":6,"searchDepth":5714,"depth":5714,"links":5715},2,[5716,5717,5718,5719],{"id":166,"depth":5714,"text":167},{"id":3226,"depth":5714,"text":3227},{"id":4087,"depth":5714,"text":4088},{"id":4852,"depth":5714,"text":4853},[],"computer-science","Infrared absorption reaches only vibrations that change the electric dipole\nmoment, so it is blind to the symmetric stretch of a homonuclear molecule such as\nN2​ or O2​. Two other processes fill the gap. Raman\nscattering probes vibrations that change the polarizability, complementary to\nthe infrared rule, and electronic excitation lifts the molecule to a new\nelectronic state whose vibrational structure prints a band system on the\nspectrum. Both are governed by matrix elements between vibrational states, and\nboth carry structural and thermal information that pure absorption cannot.",false,"md",{"moduleNumber":5714,"lessonNumber":5726,"order":5727},3,203,"Molecular Spectra",true,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands",[],"---\ntitle: Raman Scattering and Electronic Bands\nmodule: Molecular Spectra\nmoduleNumber: 2\nlessonNumber: 3\norder: 203\nsummary: >\n  Not every vibration absorbs in the infrared. Raman scattering reaches modes\n  that modulate the polarizability, giving Stokes and anti-Stokes lines whose\n  intensity ratio measures temperature, and the mutual-exclusion rule pairs it\n  with infrared absorption. Electronic transitions add the vibronic structure of\n  band spectra, governed by the Franck-Condon principle, and the radiative fates\n  of an excited state are sorted by the Jablonski diagram into fluorescence and\n  phosphorescence.\ntopics: [Molecular Spectra]\ndraft: false\nsources:\n  - book: Tipler & Llewellyn\n    ref: \"Ch. 9 — Molecular Structure and Spectra; §9-5 Scattering, Absorption, and Stimulated Emission\"\n  - book: Kittel\n    ref: \"Ch. 15 — Optical Processes and Excitons\"\n---\n\nInfrared absorption reaches only vibrations that change the electric dipole\nmoment, so it is blind to the symmetric stretch of a homonuclear molecule such as\n$\\text{N}_2$ or $\\text{O}_2$. Two other processes fill the gap. **Raman\nscattering** probes vibrations that change the polarizability, complementary to\nthe infrared rule, and **electronic excitation** lifts the molecule to a new\nelectronic state whose vibrational structure prints a band system on the\nspectrum. Both are governed by matrix elements between vibrational states, and\nboth carry structural and thermal information that pure absorption cannot.\n\n## Rayleigh and Raman scattering\n\nWhen light of frequency $\\nu_0$ falls on a molecule, its electric field\n$\\vec E = \\vec E_0\\cos(2\\pi\\nu_0 t)$ induces a dipole moment $\\vec p = \\alpha\n\\vec E$, where $\\alpha$ is the polarizability. The oscillating dipole reradiates\nat $\\nu_0$; this is **Rayleigh scattering**, elastic and much stronger than\nanything shifted. But $\\alpha$ is not constant: as the molecule vibrates with\nfrequency $\\nu_{\\text{vib}}$ along a normal coordinate $Q = Q_0\\cos(2\\pi\\nu_{\\text{vib}}t)$,\nthe polarizability is modulated,\n\n$$\n\\alpha(t) = \\alpha_0 + \\left(\\frac{\\partial\\alpha}{\\partial Q}\\right)_0 Q_0\\cos(2\\pi\\nu_{\\text{vib}} t).\n$$\n\nMultiplying by the field and applying the product-to-sum identity gives three\nfrequencies in the scattered light,\n\n$$\n\\vec p = \\alpha_0 \\vec E_0\\cos(2\\pi\\nu_0 t)\n+ \\tfrac12\\left(\\frac{\\partial\\alpha}{\\partial Q}\\right)_0 Q_0 \\vec E_0\n\\Bigl[\\cos\\!\\bigl(2\\pi(\\nu_0 - \\nu_{\\text{vib}})t\\bigr) + \\cos\\!\\bigl(2\\pi(\\nu_0 + \\nu_{\\text{vib}})t\\bigr)\\Bigr].\n$$\n\nThe unshifted line is Rayleigh; the sideband at $\\nu_0 - \\nu_{\\text{vib}}$ is the\n**Stokes** line, where the molecule gains a vibrational quantum, and the sideband\nat $\\nu_0 + \\nu_{\\text{vib}}$ is the **anti-Stokes** line, where it gives one up.\nThe shift $\\nu_{\\text{vib}}$ is the vibrational frequency, read as a displacement\nfrom the exciting line regardless of what $\\nu_0$ is.\n\nThe classical picture gives the frequencies; the quantum picture gives the\nmechanism. The incident photon lifts the molecule to a **virtual level** — not an\neigenstate, but a short-lived superposition — from which it drops back either to\nthe original level (Rayleigh) or to a different vibrational level (Raman).\n\n$$\n% caption: Rayleigh and Raman scattering through a virtual level: Rayleigh returns\n% to the starting level, Stokes leaves the molecule one quantum higher, and\n% anti-Stokes starts one quantum up and ends in the ground vibrational level.\n\\begin{tikzpicture}[scale=1.0, >=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{4A6FA5}\n  % vibrational levels v=0, v=1\n  \\draw[black, thick] (0,0) -- (9.6,0);\n  \\node[anchor=east, font=\\scriptsize] at (-0.05,0) {$v=0$};\n  \\draw[black, thick] (0,0.9) -- (9.6,0.9);\n  \\node[anchor=east, font=\\scriptsize] at (-0.05,0.9) {$v=1$};\n  % virtual level (dashed)\n  \\draw[black, dashed] (0,3.6) -- (9.6,3.6);\n  \\node[anchor=east, font=\\scriptsize, black] at (-0.05,3.6) {virtual};\n  % Rayleigh\n  \\draw[acc, ->, thick] (1.0,0.02) -- (1.0,3.55);\n  \\draw[acc, ->, thick] (1.6,3.55) -- (1.6,0.02);\n  \\node[anchor=north, font=\\scriptsize] at (1.3,-0.15) {Rayleigh};\n  % Stokes: up from 0, down to 1\n  \\draw[acc, ->, thick] (4.0,0.02) -- (4.0,3.55);\n  \\draw[acc, ->, thick] (4.6,3.55) -- (4.6,0.92);\n  \\node[anchor=north, font=\\scriptsize] at (4.3,-0.15) {Stokes};\n  % anti-Stokes: up from 1, down to 0\n  \\draw[acc, ->, thick] (7.4,0.92) -- (7.4,3.55);\n  \\draw[acc, ->, thick] (8.0,3.55) -- (8.0,0.02);\n  \\node[anchor=north, font=\\scriptsize] at (7.7,-0.15) {anti-Stokes};\n\\end{tikzpicture}\n$$\n\nBecause anti-Stokes scattering starts from the thermally excited $v=1$ level, its\nintensity is weaker than Stokes by the Boltzmann population ratio. Including the\n$\\nu^4$ scattering factor, the intensity ratio is\n\n$$\n\\frac{I_{\\text{anti-Stokes}}}{I_{\\text{Stokes}}} =\n\\left(\\frac{\\nu_0 + \\nu_{\\text{vib}}}{\\nu_0 - \\nu_{\\text{vib}}}\\right)^{\\!4}\ne^{-hc\\,\\nu_{\\text{vib}}\u002Fk_B T}.\n$$\n\nThe ratio depends only on the vibrational shift and the temperature, so measuring\nthe two sideband intensities returns the local temperature without any\ncalibration — the basis of Raman thermometry in flames and plasmas.\n\n$$\n% caption: The scattered spectrum: an intense Rayleigh line at the laser frequency\n% flanked by weaker Raman sidebands, the Stokes line below and the fainter\n% anti-Stokes line above, displaced by the vibrational frequency.\n\\begin{tikzpicture}[scale=1.0, >=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{4A6FA5}\n  \\draw[->, black] (0,0) -- (10.4,0) node[below] {frequency};\n  \\draw[->, black] (0,0) -- (0,4.2) node[left] {intensity};\n  % Rayleigh (tall) at center 5.2\n  \\draw[acc, very thick] (5.2,0) -- (5.2,3.9);\n  \\node[acc, anchor=south, font=\\scriptsize] at (5.2,3.9) {Rayleigh};\n  % Stokes (medium) at 3.0\n  \\draw[acc, very thick] (3.0,0) -- (3.0,1.7);\n  \\node[anchor=north, font=\\scriptsize] at (3.0,-0.1) {Stokes};\n  % anti-Stokes (short) at 7.4\n  \\draw[black, very thick] (7.4,0) -- (7.4,0.7);\n  \\node[anchor=north, font=\\scriptsize] at (7.4,-0.1) {anti-Stokes};\n  % shift markers\n  \\draw[black, \u003C->] (3.0,2.1) -- (5.2,2.1) node[midway, above, font=\\scriptsize] {shift};\n  \\draw[black, \u003C->] (5.2,1.3) -- (7.4,1.3) node[midway, above, font=\\scriptsize] {shift};\n\\end{tikzpicture}\n$$\n\n## Complementary selection rules\n\nInfrared and Raman activity ask different questions of a normal mode.\n\n- **Infrared active** if the mode changes the dipole moment: $(\\partial\\mu\u002F\\partial Q)_0 \\neq 0$.\n- **Raman active** if the mode changes the polarizability: $(\\partial\\alpha\u002F\\partial Q)_0 \\neq 0$.\n\nFor a molecule with a center of symmetry the two conditions are mutually\nexclusive: a mode symmetric under inversion changes $\\alpha$ but not $\\mu$, and an\nantisymmetric mode changes $\\mu$ but not $\\alpha$. This **rule of mutual\nexclusion** means no vibration of a centrosymmetric molecule appears in both\nspectra, so the two techniques together map every mode.\n\n| Mode | Dipole change | Polarizability change | Infrared | Raman |\n| --- | --- | --- | --- | --- |\n| $\\text{CO}_2$ symmetric stretch | none | yes | inactive | active |\n| $\\text{CO}_2$ antisymmetric stretch | yes | none | active | inactive |\n| $\\text{CO}_2$ bend | yes | none | active | inactive |\n| $\\text{N}_2$ stretch | none | yes | inactive | active |\n\nThe homonuclear molecules $\\text{N}_2$ and $\\text{O}_2$, invisible to the\ninfrared, are the textbook Raman case: their single stretch modulates the\npolarizability and scatters, so Raman reads the vibrational frequency of a\nmolecule with no dipole spectrum at all. Rotational Raman scattering follows\n$\\Delta J = 0, \\pm 2$, since the polarizability returns to itself twice per\nrotation, giving lines spaced by $4B$ rather than the $2B$ of dipole absorption.\n\n## Electronic transitions and the Franck-Condon principle\n\nAn electronic transition moves the molecule to a different electronic state, one\nwith its own potential curve, equilibrium separation, and vibrational ladder. The\nphoton energies are of order electron-volts, so these bands lie in the visible\nand ultraviolet. Because each electronic state carries a vibrational structure, a\nsingle electronic transition splits into many closely spaced **vibronic** lines,\nturning a would-be line into a band.\n\nWhich vibronic lines are strong is fixed by the **Franck-Condon principle**: the\nelectrons rearrange so much faster than the nuclei that the internuclear distance\nis frozen during the transition. On a potential-energy diagram the transition is\ntherefore **vertical**, a straight up-arrow at fixed $r$. If the upper electronic\nstate has a larger equilibrium separation than the lower — as it usually does,\nsince promoting a bonding electron weakens the bond — the vertical line from the\nbottom of the lower well reaches the upper curve high on its inner wall, near a\nclassical turning point of an excited vibrational level.\n\n$$\n% caption: The Franck-Condon principle: nuclei are fixed during the fast\n% electronic jump, so the transition is vertical; with the upper curve displaced\n% outward, the strongest line lands on the upper vibrational level whose turning\n% point sits above the lower ground state.\n\\begin{tikzpicture}[scale=1.0, >=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{4A6FA5}\n  \\draw[->, black] (0,-0.2) -- (0,5.4) node[left] {$U(r)$};\n  \\draw[->, black] (0,0) -- (7.2,0) node[below] {$r$};\n  % lower electronic state well, min near x=2.0\n  \\draw[black, very thick, domain=1.1:4.3, samples=120, variable=\\x]\n    plot ({\\x},{1.7*(\\x-2.0)*(\\x-2.0)});\n  \\node[black, anchor=east, font=\\scriptsize] at (1.15,1.5) {ground};\n  % ground v=0 level\n  \\draw[black] (1.55,0.35) -- (2.45,0.35);\n  % upper electronic state well, displaced to x=3.2, raised\n  \\draw[acc, very thick, domain=2.2:5.6, samples=120, variable=\\x]\n    plot ({\\x},{1.4*(\\x-3.2)*(\\x-3.2) + 2.9});\n  \\node[acc, anchor=west, font=\\scriptsize] at (5.0,4.4) {excited};\n  % upper vibrational levels\n  \\foreach \\y in {3.25,3.75,4.25}\n    \\draw[acc] (2.55,\\y) -- (3.85,\\y);\n  % vertical transition at r=2.0\n  \\draw[acc, ->, very thick] (2.0,0.4) -- (2.0,3.85);\n  \\draw[black, dashed] (2.0,0) -- (2.0,-0.2) node[below, font=\\scriptsize] {frozen $r$};\n\\end{tikzpicture}\n$$\n\nQuantitatively, the intensity of a vibronic line from lower level $v''$ to upper\nlevel $v'$ is proportional to the square of the vibrational overlap, the\n**Franck-Condon factor**,\n\n$$\nI_{v' \\leftarrow v''} \\propto \\bigl|\\langle \\psi_{v'} \\,|\\, \\psi_{v''}\\rangle\\bigr|^2,\n$$\n\nthe electronic transition moment being nearly constant across the band. From the\nground level $v''=0$, whose wavefunction peaks at the well center, the overlap is\nlargest with the upper level whose wavefunction also has large amplitude there —\nwhich for a displaced upper curve is a level of nonzero $v'$. The band intensity\ntherefore rises through the first few members of the progression, peaks, and\nfalls, tracing a **Franck-Condon envelope** whose maximum shifts to higher $v'$\nthe more the upper curve is displaced.\n\n$$\n% caption: A vibronic absorption progression: lines at the upper vibrational\n% levels v' from the ground level, their intensities following the Franck-Condon\n% factors so the band peaks at an intermediate v' set by the curve displacement.\n\\begin{tikzpicture}[scale=1.0, >=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{4A6FA5}\n  \\draw[->, black] (0,0) -- (9.6,0) node[below] {photon energy};\n  \\draw[->, black] (0,0) -- (0,3.6) node[left] {absorption};\n  % progression lines with FC-envelope heights\n  \\foreach \\x\u002F\\h\u002F\\lab in {1.2\u002F0.6\u002F0,2.4\u002F1.6\u002F1,3.6\u002F2.8\u002F2,4.8\u002F3.1\u002F3,6.0\u002F2.4\u002F4,7.2\u002F1.4\u002F5,8.4\u002F0.6\u002F6}{\n    \\draw[acc, very thick] (\\x,0) -- (\\x,\\h);\n    \\node[anchor=north, font=\\scriptsize] at (\\x,0) {\\lab};\n  }\n  \\node[anchor=north, font=\\scriptsize] at (4.8,-0.5) {upper vibrational level};\n  % envelope\n  \\draw[black, densely dotted] (1.2,0.6) .. controls (3.0,3.4) and (5.6,3.4) .. (8.4,0.6);\n\\end{tikzpicture}\n$$\n\nThe mirror image appears in emission. A molecule excited to the upper electronic\nstate relaxes to its lowest vibrational level and then emits downward to the\nspread of lower-state vibrational levels, so the emission progression is the\nreflection of the absorption progression about the shared $0 \\to 0$ line, and the\nspacing of the emission lines gives the ground-state vibrational frequency while\nthe absorption spacing gives the excited-state one.\n\n## Fluorescence, phosphorescence, and the Jablonski diagram\n\nAfter absorption an excited molecule has several routes back down, radiative and\nnonradiative, organized by the **Jablonski diagram**. The relevant distinction is\nelectron spin: the ground state is a spin singlet $S_0$, and the accessible\nexcited states are singlets $S_1$ (spin allowed) or triplets $T_1$ (spin\nforbidden).\n\n$$\n% caption: Jablonski diagram: absorption to a singlet, fast nonradiative relaxation\n% to the lowest excited singlet, then either spin-allowed fluorescence back to the\n% ground state or intersystem crossing to a triplet followed by slow\n% phosphorescence.\n\\begin{tikzpicture}[scale=1.0, >=stealth, font=\\footnotesize]\n  \\definecolor{acc}{HTML}{4A6FA5}\n  % S0 ground\n  \\draw[black, thick] (0.5,0) -- (3.0,0);\n  \\node[anchor=east, font=\\scriptsize] at (0.45,0) {$S_0$};\n  % S1\n  \\draw[acc, thick] (0.5,3.2) -- (3.0,3.2);\n  \\node[anchor=east, font=\\scriptsize, acc] at (0.45,3.2) {$S_1$};\n  % higher singlet S2\n  \\draw[black, thick] (0.5,4.2) -- (3.0,4.2);\n  \\node[anchor=east, font=\\scriptsize, black] at (0.45,4.2) {$S_2$};\n  % triplet T1 (to the right, lower than S1)\n  \\draw[black, thick] (5.0,2.4) -- (7.2,2.4);\n  \\node[anchor=west, font=\\scriptsize, black] at (7.25,2.4) {$T_1$ triplet};\n  % absorption\n  \\draw[acc, ->, very thick] (1.1,0.05) -- (1.1,4.15);\n  \\node[anchor=east, font=\\scriptsize] at (1.05,2.0) {absorb};\n  % internal conversion S2->S1\n  \\draw[black, ->, thick] (1.6,4.15) -- (1.6,3.25);\n  \\node[anchor=west, font=\\scriptsize, black] at (1.62,3.7) {relax};\n  % fluorescence S1->S0\n  \\draw[acc, ->, very thick] (2.4,3.15) -- (2.4,0.05);\n  \\node[anchor=west, font=\\scriptsize, acc] at (2.42,1.6) {fast emit};\n  % intersystem crossing S1->T1\n  \\draw[black, ->, thick] (3.05,3.1) -- (4.95,2.5);\n  \\node[anchor=south, font=\\scriptsize, black] at (4.0,2.85) {crossing};\n  % phosphorescence T1->S0\n  \\draw[black, ->, very thick] (6.0,2.35) -- (6.0,0.05);\n  \\node[anchor=west, font=\\scriptsize, black] at (6.05,1.2) {slow emit};\n  \\draw[black, thick] (5.0,0) -- (7.2,0);\n\\end{tikzpicture}\n$$\n\nThe two emissions differ in rate and delay:\n\n- **Fluorescence** is the spin-allowed $S_1 \\to S_0$ emission. It is fast, with a\n  lifetime of order $10^{-9}$-$10^{-7}\\ \\text{s}$, and stops promptly when the\n  excitation is removed. Because the molecule relaxes to the bottom of $S_1$\n  before emitting (Kasha's rule), the fluorescence is red-shifted from the\n  absorption by the vibrational relaxation energy, the **Stokes shift**.\n- **Phosphorescence** follows an **intersystem crossing** from $S_1$ to the lower\n  triplet $T_1$, a spin flip made possible by spin-orbit coupling. The\n  $T_1 \\to S_0$ emission is spin-forbidden and therefore slow, with lifetimes\n  from milliseconds to seconds, so a phosphor glows after the light is switched\n  off. The triplet lies below $S_1$, so phosphorescence is red-shifted still\n  further.\n\nThe same triplet bottleneck that makes phosphorescence slow makes it useful:\nbecause molecules dwell in $T_1$, that state is where photochemistry and, in\n$\\text{O}_2$, the reactive singlet-oxygen chemistry of photosensitizers begin.\n\nElectronic band systems close the survey of molecular spectroscopy. A band\nspectrum is a progression of vibronic bands, each itself a rotational envelope,\nso a single electronic transition resolves under high dispersion into thousands\nof rotational lines — the fingerprint by which a diatomic molecule is identified\nin a stellar atmosphere or a discharge. The coherent counterpart of stimulated\nemission between such levels builds the [laser](\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers),\nwhere a population inversion between molecular or atomic states turns spontaneous\nemission into an amplified beam.\n",{"text":5734,"minutes":5735,"time":5736,"words":5737},"6 min read",5.36,321600,1072,{"title":5,"description":5722},[5740,5743],{"book":5741,"ref":5742},"Tipler & Llewellyn","Ch. 9 — Molecular Structure and Spectra; §9-5 Scattering, Absorption, and Stimulated Emission",{"book":5744,"ref":5745},"Kittel","Ch. 15 — Optical Processes and Excitons","available","07.condensed-matter\u002F02.molecular-spectra\u002F03.raman-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",[5728],"s0uVwmGi94OaJZpvINKpjbI5-lAWJw6HSlAvdfdR4NI",{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":5752,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":5753,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":5754,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":5755,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":5756,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":5757,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":5758,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":5759,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":5760,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":5761,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":5762,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":5763,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":5764,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":5765,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":5766,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":5767,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":5768,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":5769,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":5770,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":5771,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":5772,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":5773,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":5774,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":5775,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":5776,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":5777,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":5778,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":5779,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":5780,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":5781,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":5782,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":5783,"\u002Falgorithms\u002Fsequences\u002Ftries":5784,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":5785,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":5786,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":5787,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":5788,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":5789,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":5790,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":5791,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":5792,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":5793,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":5794,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":5795,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":5796,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":5797,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":5798,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":5799,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":5800,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":5801,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":5802,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":5803,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":5804,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":5805,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":5806,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":5807,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":5808,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":5809,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":5810,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":5811,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":5812,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":5813,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":5814,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":5815,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":5816,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":5817,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":5818,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":5819,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":5820,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":5821,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":5822,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":5823,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":5824,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":5825,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":5826,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":5827,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":5828,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":5829,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":5830,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":5831,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":5832,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":5833,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":5834,"\u002Falgorithms":5835,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":5836,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":5837,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":5838,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":5839,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":5840,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":5841,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":5842,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":5843,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":5844,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":5845,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":5846,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":5847,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":5848,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":5849,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":5850,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":5851,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":5852,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":5853,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":5854,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":5855,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":5856,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":5857,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":5858,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":5859,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":5860,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":5861,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":5862,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":5863,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":5864,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":5865,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":5866,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":5867,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":5868,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":5869,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":5850,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":5870,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":5871,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":5872,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":5840,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":5873,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":5874,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":5875,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":5876,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":5877,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":5878,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":5879,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":5880,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":5881,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":5882,"\u002Fcalculus":5883,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":5884,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":5885,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":5886,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":5887,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":5888,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":5889,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":5890,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":5891,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":5892,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":5893,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":5894,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":5895,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":5896,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":5897,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":5898,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":5899,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":5900,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":5901,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":5902,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":5903,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":5904,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":5905,"\u002Fmechanics\u002Frotation\u002Frolling-motion":5906,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":5907,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":5908,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":5909,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":5910,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":5911,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":5912,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":5913,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":5914,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":5915,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":5916,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":5917,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":5918,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":5919,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":5920,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":5921,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":5922,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":5923,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":5924,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":5925,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":5926,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":5927,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":5928,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":5929,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":5930,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":5931,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":5932,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":5933,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":5934,"\u002Fmechanics":5935,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":5936,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":5937,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":5938,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":5939,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":5940,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":5941,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":5942,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":5943,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":5944,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":5945,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":5946,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":5947,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":5924,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":5948,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":5949,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":5950,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":5920,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":5785,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":5951,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":5911,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":5952,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":5953,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":5954,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":5955,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":5956,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":5957,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":5958,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":5959,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":5960,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":5885,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":5961,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":5962,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":5963,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":5964,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":5965,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":5966,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":5967,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":5968,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":5903,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":5902,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":5969,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":5970,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":5971,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":5972,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":5973,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":5974,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":5975,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":5976,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":5977,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":5929,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":5927,"\u002Felectricity-and-magnetism":5978,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":5979,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":5980,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":5981,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":5982,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":5983,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":5984,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":5985,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":5986,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":5987,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":5837,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":5988,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":5989,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":5841,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":5990,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":5991,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":5992,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":5993,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":5994,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":5995,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":5996,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":5997,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":5998,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":5999,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":6000,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":6001,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":6002,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":6003,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":6004,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":6005,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":6006,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":6007,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":6008,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":6009,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":5876,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":6010,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":6011,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":6012,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":6013,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":6014,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":6015,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":6016,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":6017,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":6018,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":6019,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":6020,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":6021,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":6022,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":6023,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":6024,"\u002Flinear-algebra":6025,"\u002Ftheory-of-computation":6026,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":6027,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":6028,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":6029,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":6030,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":6031,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":6032,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":6033,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":6034,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":6035,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":6036,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":6037,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":6038,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":6039,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":6040,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":6041,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":6042,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":6043,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":6044,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":6045,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":6046,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":6047,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":6048,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":6049,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":6050,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":6051,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":6052,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":6053,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":6054,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":6055,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":6056,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":6057,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":6058,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":6059,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":6060,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":6061,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":6062,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":6063,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":6064,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":6065,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":6066,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":6067,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":6068,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":6069,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":6070,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":6071,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":6072,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":6073,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":6074,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":6075,"\u002Fcomputer-architecture":6026,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":6076,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":6077,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":6078,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":5841,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":6079,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":5840,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":5847,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":6080,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":6081,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":5881,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":6082,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":6083,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":6084,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":6085,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":6086,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":6087,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":6088,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":6089,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":6090,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":6091,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":6092,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":6093,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":6088,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":6094,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":6095,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":6096,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":6097,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":6098,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":6099,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":6100,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":6101,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":6102,"\u002Fdifferential-equations":6103,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":6104,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":6105,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":6106,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":6107,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":5986,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":6108,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":6109,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":6110,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":6111,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":6112,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":6113,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":5856,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":6114,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":6115,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":6116,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":6117,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":6118,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":6119,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":6120,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":6121,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":6122,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":6123,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":6078,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":6124,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":6125,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":6126,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":6127,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":6128,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":6007,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":6129,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":6130,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":6017,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":6131,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":6132,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":6133,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":6134,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":6135,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":6136,"\u002Frelativity":6137,"\u002Fphysical-computing":6026,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":6138,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":6117,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":6139,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":6140,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":6141,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":6142,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":6143,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":6144,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":6145,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":6093,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":6017,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":6146,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":6147,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":6148,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":6149,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":6145,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":6150,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":6125,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":5878,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":6151,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":6152,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":5858,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":6153,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":6154,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":6155,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":6156,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":6157,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":6158,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":6159,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":6160,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":6161,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":6117,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":6162,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":6163,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":6164,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":6151,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":5839,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":6165,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":6166,"\u002Fquantum-mechanics":6167,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":6101,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":6168,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":6169,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":5990,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":6170,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":5876,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":6171,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":6172,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":6013,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":6123,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":6173,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":6174,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":6175,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":6176,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":6177,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":6150,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":6178,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":5983,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":6179,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":6180,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":5837,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":6181,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":6182,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":6139,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":5866,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":6017,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":6183,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":6184,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":6002,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":6127,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":6185,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":6186,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":6187,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":6022,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":6188,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":6189,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":6190,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":6190,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":6191,"\u002Freal-analysis":6192,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":6193,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":6194,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":6195,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":6196,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":6197,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":6198,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":6199,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":6200,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":6201,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":6202,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":6166,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":6203,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":6195,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":6112,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":6204,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":6205,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":6206,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":6207,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":6208,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":6209,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":6210,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":6211,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":6205,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":6212,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":6181,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":6213,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":6214,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":6215,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":6216,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":6217,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":6218,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":6219,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":6220,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":6221,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":6222,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":5855,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":6223,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":6224,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":6097,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":6225,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":6226,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":6154,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":6226,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":6227,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":6228,"\u002Fabstract-algebra":6229,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":6230,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":6231,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":6232,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":6233,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":6234,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":6146,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":6235,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":6236,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":6237,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":6238,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":6239,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":6240,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":6241,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":5980,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":6109,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":5855,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":6242,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":5839,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":6243,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":6244,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":5877,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":6171,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":6245,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":6246,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":6247,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":6248,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":6249,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":6250,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":6251,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":6252,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":6253,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":6254,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":6255,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":6256,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":6257,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":6258,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":6202,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":6259,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":6260,"\u002Fatomic-physics":6261,"\u002Fdatabases":6026,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":6262,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":6263,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":6264,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":6193,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":6265,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":6266,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":6267,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":6268,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":6269,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":6270,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":6271,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":6272,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":6273,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":6274,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":6275,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":6276,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":6277,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":6278,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":6279,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":6280,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":6281,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":6282,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":6283,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":6284,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":6275,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":6285,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":6286,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":6287,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":6288,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":6289,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":6234,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":6290,"\u002Fcategory-theory":6291,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":6292,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":6293,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":6294,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":6295,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":6296,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":6297,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":6256,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":6298,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":6299,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":6300,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":6301,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":6302,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":6303,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":6304,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":6305,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":6306,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":6307,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":6308,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":6309,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":6310,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":6311,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":6312,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":6313,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":6314,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":6315,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":6316,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":6317,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":6318,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":6319,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":6320,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":6321,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":6322,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":6323,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":6324,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":6268,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":6325,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":6326,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":6327,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":6328,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":6329,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":6330,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":6331,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":5820,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":6332,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":6333,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":6056,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":6334,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":6335,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":6336,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":6337,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":6338,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":6339,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":6340,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":6341,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":6342,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":6343,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":6344,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":6345,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":6029,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":6346,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":6347,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":6348,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":6349,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":6066,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":6350,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":6351,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":6352,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":6353,"\u002Fdeep-learning":6026,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":6354,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":6151,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":6355,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":6356,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":6357,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":6358,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":6359,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":6360,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":6361,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":6362,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":6198,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":6363,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":6364,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":6365,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":6085,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":5878,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":6366,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":6367,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":6368,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":6012,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":6369,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":6370,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":6090,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":6017,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":6371,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":5986,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":5856,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":5872,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":6372,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":6373,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":6374,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":6004,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":6375,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":5866,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":6376,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":6377,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":6378,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":6379,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":6200,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":6380,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":6381,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":6382,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":6383,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":6146,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":6384,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":6124,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":6385,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":5985,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":6386,"\u002Fstatistical-mechanics":6387,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":6388,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":5851,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":6111,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":6389,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":6390,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":6391,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":5737,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":6392,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":6393,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":5984,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":6394,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":6395,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":6396,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":6397,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":6127,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":6398,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":6399,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":6400,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":6401,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":6402,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":6182,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":6126,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":6403,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":6404,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":6405,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":6406,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":6117,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":6407,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":6408,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":6354,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":6254,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":5981,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":6409,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":5847,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":6410,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":6411,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":5992,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":6412,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":6247,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":6413,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":5839,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":6414,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":5850,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":6415,"\u002Fcondensed-matter":6167,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":6416,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":6417,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":6418,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":6419,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":5864,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":6420,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":6421,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":5864,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":6422,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":6277,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":6423,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":6424,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":6425,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":6423,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":6426,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":6427,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":6428,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":6429,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":6430,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":6431,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":6432,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":6433,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":6355,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":6434,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":6427,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":6435,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":6436,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":6070,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":6437,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":6255,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":6438,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":6439,"\u002Flogic":6440,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":6441,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":6442,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":6056,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":6443,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":6444,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":6445,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":6446,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":6436,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":6447,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":6448,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":6449,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":6348,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":6450,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":6451,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":6452,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":6453,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":6454,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":6073,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":6455,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":6456,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":6457,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":6458,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":6264,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":6459,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":6435,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":6460,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":6461,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":6462,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":6084,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":6463,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":6214,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":6464,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":6465,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":6046,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":6466,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":6467,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":6468,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":6469,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":6470,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":6324,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":6471,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":6472,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":6473,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":6359,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":6474,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":6475,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":6476,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":6073,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":6140,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":6477,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":6478,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":6479,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":6480,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":6481,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":6482,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":6483,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":6484,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":6485,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":6486,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":6487,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":6488,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":6489,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":6490,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":6491,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":6492,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":6493,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":6494,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":6495,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":6496,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":6497,"\u002Freinforcement-learning":6026,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":6498,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":6499,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":6500,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":6501,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":6502,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":6503,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":6504,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":6505,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":6506,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":6507,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":6508,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":6509,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":6510,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":6353,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":6208,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":6511,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":6512,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":6513,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":6514,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":6515,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":6516,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":6335,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":6517,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":6518,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":6519,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":6520,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":6521,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":6522,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":6523,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":6524,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":6525,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":6526,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":6527,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":6528,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":6267,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":6518,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":6529,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":5807,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":6530,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":6531,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":6532,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":6533,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":6534,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":6316,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":6535,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":6536,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":6537,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":6538,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":6539,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":6540,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":6541,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":6542,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":6543,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":6544,"\u002Fartificial-intelligence":6026,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":6283,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":6545,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":5843,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":5841,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":6377,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":6546,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":5869,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":6179,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":6547,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":6548,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":6549,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":6239,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":6550,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":6551,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":6552,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":6437,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":6553,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":6554,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":5853,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":6082,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":6555,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":6183,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":6556,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":6557,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":6078,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":6166,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":6558,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":6559,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":6560,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":5848,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":6223,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":6085,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":6561,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":6133,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":6197,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":6562,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":6563,"\u002Fnuclear-physics":6564,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":6565,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":6566,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":6204,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":6567,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":6568,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":6569,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":6052,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":6570,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":6571,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":6349,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":6572,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":6517,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":6573,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":6574,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":6575,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":6576,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":6577,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":6578,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":6579,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":6030,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":6580,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":6581,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":6523,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":6582,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":6583,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":6584,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":6585,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":6586,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":6587,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":6588,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":6589,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":6447,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":6590,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":6591,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":6592,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":6593,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":6594,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":6595,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":6596,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":6597,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":6598,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":6599,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":6600,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":6601,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":6302,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":6468,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":6058,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":6602,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":6603,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":6604,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":6605,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":6316,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":6606,"\u002Fnatural-language-processing":6026,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":6607,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":6224,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":6608,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":6369,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":6609,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":6610,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":6558,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":6611,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":6612,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":6174,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":5876,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":6613,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":6128,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":6614,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":6161,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":6615,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":6414,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":6616,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":6617,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":6384,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":6618,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":5847,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":6619,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":6620,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":6621,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":6165,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":6381,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":6622,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":6623,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":6240,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":6624,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":6285,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":6625,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":6626,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":6174,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":6207,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":6627,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":6628,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":6629,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":6263,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":6630,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":6004,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":6631,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":6107,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":6632,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":6633,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":6430,"\u002Fparticle-physics":6634,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":6225,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":6379,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":6635,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":6164,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":6636,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":6224,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":6136,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":6637,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":6638,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":6639,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":6640,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":6641,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":6429,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":6361,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":6642,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":6643,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":6644,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":6645,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":6557,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":6646,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":6120,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":6183,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":6165,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":6647,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":6249,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":5865,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":6648,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":6649,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":6380,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":6650,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":6651,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":6652,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":6653,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":5846,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":6654,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":6655,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":6107,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":6656,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":6657,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":6373,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":6028,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":6658,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":6659,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":6285,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":6271,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":6283,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":6380,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":6660,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":5845,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":6037,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":6661,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":6124,"\u002Fastrophysics-cosmology":6229,"\u002Fcolophon":6662,"\u002F":6026},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,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,1064,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":6664,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":6669,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":6673,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":6677,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":6681,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":6685,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":6689,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":6694,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":6698,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":6702,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":6706,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":6711,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":6715,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":6719,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":6723,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":6728,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":6732,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":6736,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":6740,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":6744,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":6748,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":6752,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":6756,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":6760,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":6764,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":6768,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":6772,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":6777,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":6781,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":6785,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":6789,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":6793,"\u002Falgorithms\u002Fsequences\u002Ftries":6797,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":6801,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":6805,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":6810,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":6814,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":6818,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":6822,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":6826,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":6830,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":6834,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":6838,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":6842,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":6846,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":6850,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":6854,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":6858,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":6862,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":6867,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":6871,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":6875,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":6879,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":6883,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":6888,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":6892,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":6896,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":6900,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":6904,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":6908,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":6912,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":6916,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":6920,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":6924,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":6928,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":6933,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":6937,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":6941,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":6945,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":6950,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":6954,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":6958,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":6962,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":6966,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":6970,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":6974,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":6979,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":6983,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":6987,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":6991,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":6996,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":7000,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":7004,"\u002Falgorithms":7008,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":7011,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":7016,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":7020,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":7024,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":7028,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":7033,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":7037,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":7041,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":7045,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":7050,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":7054,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":7058,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":7062,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":7067,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":7071,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":7075,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":7080,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":7084,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":7088,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":7093,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":7097,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":7101,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":7106,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":7110,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":7114,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":7118,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":7123,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":7127,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":7131,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":7136,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":7140,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":7144,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":7148,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":7152,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":7157,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":7161,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":7165,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":7169,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":7173,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":7178,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":7181,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":7185,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":7189,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":7193,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":7198,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":7202,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":7206,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":7210,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":7214,"\u002Fcalculus":7218,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":7221,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":7225,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":7229,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":7234,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":7238,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":7242,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":7246,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":7250,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":7255,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":7259,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":7263,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":7267,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":7271,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":7276,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":7280,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":7284,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":7288,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":7292,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":7297,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":7301,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":7305,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":7310,"\u002Fmechanics\u002Frotation\u002Frolling-motion":7314,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":7318,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":7322,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":7326,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":7330,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":7335,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":7339,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":7343,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":7347,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":7351,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":7355,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":7359,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":7364,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":7368,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":7372,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":7376,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":7380,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":7384,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":7388,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":7392,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":7396,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":7400,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":7404,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":7408,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":7413,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":7417,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":7421,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":7425,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":7429,"\u002Fmechanics":7433,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":7436,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":7441,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":7445,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":7449,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":7453,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":7457,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":7462,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":7466,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":7471,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":7475,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":7479,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":7483,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":7487,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":7492,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":7496,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":7500,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":7504,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":7509,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":7513,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":7517,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":7522,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":7526,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":7530,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":7534,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":7538,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":7543,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":7547,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":7551,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":7555,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":7559,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":7563,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":7568,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":7572,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":7576,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":7580,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":7584,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":7588,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":7592,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":7596,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":7601,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":7605,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":7609,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":7613,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":7617,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":7622,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":7626,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":7630,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":7634,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":7638,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":7643,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":7647,"\u002Felectricity-and-magnetism":7651,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":7654,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":7659,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":7663,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":7667,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":7671,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":7675,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":7680,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":7684,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":7688,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":7692,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":7696,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":7701,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":7705,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":7709,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":7714,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":7718,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":7722,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":7726,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":7730,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":7734,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":7738,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":7743,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":7747,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":7751,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":7755,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":7759,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":7763,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":7767,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":7772,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":7776,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":7780,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":7784,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":7788,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":7792,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":7797,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":7801,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":7805,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":7809,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":7813,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":7818,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":7822,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":7826,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":7830,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":7834,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":7838,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":7843,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":7847,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":7851,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":7855,"\u002Flinear-algebra":7859,"\u002Ftheory-of-computation":7862,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":7865,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":7869,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":7873,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":7877,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":7881,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":7885,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":7890,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":7894,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":7898,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":7902,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":7906,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":7910,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":7914,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":7919,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":7923,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":7927,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":7931,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":7935,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":7940,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":7944,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":7948,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":7952,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":7956,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":7961,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":7965,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":7969,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":7973,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":7977,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":7982,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":7986,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":7990,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":7994,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":7998,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":8003,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":8007,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":8011,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":8015,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":8019,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":8024,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":8028,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":8032,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":8037,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":8041,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":8046,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":8050,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":8054,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":8058,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":8062,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":8067,"\u002Fcomputer-architecture":8071,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":8074,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":8078,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":8082,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":8087,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":8091,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":8095,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":8099,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":8103,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":8107,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":8112,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":8116,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":8120,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":8124,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":8128,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":8132,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":8137,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":8141,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":8145,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":8150,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":8154,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":8159,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":8163,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":8167,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":8172,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":8176,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":8181,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":8185,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":8189,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":8194,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":8198,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":8202,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":8207,"\u002Fdifferential-equations":8211,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":8214,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":8219,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":8223,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":8227,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":8231,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":8235,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":8240,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":8244,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":8248,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":8252,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":8257,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":8261,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":8265,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":8269,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":8274,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":8278,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":8282,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":8286,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":8291,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":8295,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":8299,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":8303,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":8307,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":8311,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":8316,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":8320,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":8324,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":8329,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":8333,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":8337,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":8341,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":8346,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":8350,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":8354,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":8359,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":8363,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":8367,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":8372,"\u002Frelativity":8376,"\u002Fphysical-computing":8379,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":8382,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":8387,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":8391,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":8395,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":8399,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":8404,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":8408,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":8412,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":8417,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":8421,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":8425,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":8429,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":8433,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":8437,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":8442,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":8446,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":8450,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":8454,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":8458,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":8462,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":8467,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":8471,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":8475,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":8479,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":8483,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":8487,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":8491,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":8496,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":8500,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":8504,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":8509,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":8513,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":8517,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":8522,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":8526,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":8531,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":8535,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":8539,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":8543,"\u002Fquantum-mechanics":8547,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":8550,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":8555,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":8559,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":8563,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":8567,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":8572,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":8576,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":8580,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":8584,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":8588,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":8592,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":8597,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":8601,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":8605,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":8609,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":8613,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":8617,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":8621,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":8625,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":8629,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":8633,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":8637,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":8642,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":8646,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":8650,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":8654,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":8659,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":8663,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":8667,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":8670,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":8674,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":8679,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":8683,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":8687,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":8691,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":8696,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":8700,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":8704,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":8708,"\u002Freal-analysis":8712,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":8715,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":8719,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":8723,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":8728,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":8732,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":8736,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":8740,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":8745,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":8749,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":8753,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":8757,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":8761,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":8765,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":8770,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":8774,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":8778,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":8782,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":8787,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":8791,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":8795,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":8799,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":8804,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":8808,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":8812,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":8817,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":8821,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":8825,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":8829,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":8834,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":8838,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":8842,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":8846,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":8851,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":8855,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":8859,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":8864,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":8868,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":8872,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":8876,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":8881,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":8885,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":8889,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":8893,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":8897,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":8902,"\u002Fabstract-algebra":8906,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":8909,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":8914,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":8918,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":8922,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":8926,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":8930,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":8935,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":8939,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":8943,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":8947,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":8951,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":8955,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":8959,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":8964,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":8968,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":8972,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":8976,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":8981,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":8985,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":8989,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":8994,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":8998,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":9002,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":9006,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":9010,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":9014,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":9019,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":9023,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":9027,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":9032,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":9036,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":9040,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":9044,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":9049,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":9053,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":9057,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":9062,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":9066,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":9070,"\u002Fatomic-physics":9074,"\u002Fdatabases":9077,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":9080,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":9084,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":9088,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":9092,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":9096,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":9100,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":9104,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":9109,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":9113,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":9117,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":9122,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":9126,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":9130,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":9135,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":9139,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":9143,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":9147,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":9151,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":9156,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":9160,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":9164,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":9168,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":9173,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":9177,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":9181,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":9185,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":9190,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":9194,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":9198,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":9202,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":9207,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":9211,"\u002Fcategory-theory":9215,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":9218,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":9222,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":9226,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":9230,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":9233,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":9237,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":9241,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":9245,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":9250,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":9254,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":9258,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":9262,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":9266,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":9271,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":9275,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":9279,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":9283,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":9287,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":9292,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":9296,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":9300,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":9304,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":9309,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":9313,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":9317,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":9321,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":9325,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":9329,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":9333,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":9337,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":9341,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":9346,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":9350,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":9354,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":9358,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":9362,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":9367,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":9371,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":9375,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":9379,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":9383,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":9387,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":9391,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":9396,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":9400,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":9404,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":9409,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":9413,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":9417,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":9421,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":9425,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":9429,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":9433,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":9438,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":9442,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":9446,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":9450,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":9454,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":9458,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":9462,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":9466,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":9470,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":9474,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":9478,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":9483,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":9487,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":9491,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":9495,"\u002Fdeep-learning":9499,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":9502,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":9506,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":9510,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":9514,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":9518,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":9522,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":9527,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":9531,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":9535,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":9539,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":9544,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":9548,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":9552,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":9556,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":9561,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":9565,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":9569,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":9573,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":9577,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":9582,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":9586,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":9590,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":9595,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":9599,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":9603,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":9608,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":9612,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":9616,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":9620,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":9625,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":9629,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":9633,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":9637,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":9641,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":9645,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":9650,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":9654,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":9658,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":9662,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":9667,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":9671,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":9675,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":9680,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":9684,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":9688,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":9692,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":9696,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":9701,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":9705,"\u002Fstatistical-mechanics":9709,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":9712,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":9717,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":9721,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":9725,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":9729,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":9733,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":9737,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":9738,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":9741,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":9746,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":9750,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":9754,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":9758,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":9763,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":9767,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":9771,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":9775,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":9780,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":9784,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":9788,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":9792,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":9797,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":9801,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":9805,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":9809,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":9814,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":9818,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":9822,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":9826,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":9830,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":9835,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":9839,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":9844,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":9848,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":9852,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":9856,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":9861,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":9865,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":9869,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":9873,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":9877,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":9882,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":9886,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":9890,"\u002Fcondensed-matter":9894,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":9897,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":9901,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":9906,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":9910,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":9914,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":9918,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":9922,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":9926,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":9930,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":9935,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":9939,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":9943,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":9947,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":9952,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":9956,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":9960,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":9964,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":9969,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":9973,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":9977,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":9981,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":9986,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":9990,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":9994,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":9998,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":10003,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":10007,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":10011,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":10016,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":10020,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":10025,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":10029,"\u002Flogic":10033,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":10036,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":10040,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":10044,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":10048,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":10052,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":10056,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":10060,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":10064,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":10068,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":10072,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":10076,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":10080,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":10084,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":10088,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":10092,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":10096,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":10100,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":10104,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":10108,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":10113,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":10117,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":10121,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":10125,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":10129,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":10133,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":10137,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":10141,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":10145,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":10149,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":10153,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":10157,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":10161,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":10165,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":10169,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":10173,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":10177,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":10181,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":10185,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":10189,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":10193,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":10197,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":10202,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":10206,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":10210,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":10214,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":10218,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":10222,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":10226,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":10230,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":10234,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":10238,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":10242,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":10246,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":10250,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":10254,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":10258,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":10262,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":10266,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":10270,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":10274,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":10278,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":10282,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":10286,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":10291,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":10295,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":10299,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":10303,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":10307,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":10311,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":10315,"\u002Freinforcement-learning":10319,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":10321,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":10325,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":10329,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":10333,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":10337,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":10342,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":10346,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":10350,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":10354,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":10358,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":10362,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":10366,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":10370,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":10374,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":10378,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":10382,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":10386,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":10391,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":10395,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":10399,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":10403,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":10407,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":10411,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":10415,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":10419,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":10423,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":10427,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":10431,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":10435,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":10440,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":10444,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":10448,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":10452,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":10456,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":10460,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":10464,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":10467,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":10471,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":10475,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":10480,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":10484,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":10488,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":10492,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":10495,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":10499,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":10503,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":10507,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":10512,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":10516,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":10520,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":10524,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":10528,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":10532,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":10536,"\u002Fartificial-intelligence":10540,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":10543,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":10548,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":10552,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":10556,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":10560,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":10564,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":10569,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":10573,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":10577,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":10581,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":10586,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":10590,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":10594,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":10598,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":10603,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":10607,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":10612,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":10616,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":10621,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":10625,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":10629,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":10633,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":10638,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":10642,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":10646,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":10651,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":10655,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":10659,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":10664,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":10668,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":10673,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":10677,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":10681,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":10686,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":10690,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":10694,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":10698,"\u002Fnuclear-physics":10702,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":10705,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":10709,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":10713,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":10717,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":10721,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":10725,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":10730,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":10734,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":10738,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":10742,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":10747,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":10751,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":10755,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":10759,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":10763,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":10767,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":10771,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":10774,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":10777,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":10781,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":10785,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":10789,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":10794,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":10798,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":10802,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":10806,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":10810,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":10814,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":10818,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":10822,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":10826,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":10830,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":10834,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":10838,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":10842,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":10846,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":10850,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":10854,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":10858,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":10862,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":10866,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":10870,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":10874,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":10878,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":10882,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":10886,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":10890,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":10894,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":10898,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":10902,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":10907,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":10911,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":10915,"\u002Fnatural-language-processing":10919,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":10922,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":10926,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":10930,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":10934,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":10939,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":10943,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":10947,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":10951,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":10956,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":10960,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":10964,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":10968,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":10973,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":10977,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":10981,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":10985,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":10990,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":10994,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":10998,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":11003,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":11007,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":11011,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":11015,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":11020,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":11024,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":11028,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":11032,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":11037,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":11041,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":11045,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":11049,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":11054,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":11058,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":11062,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":11066,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":11070,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":11075,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":11079,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":11083,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":11088,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":11092,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":11096,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":11100,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":11104,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":11108,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":11112,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":11116,"\u002Fparticle-physics":11120,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":11123,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":11128,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":11132,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":11136,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":11141,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":11145,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":11149,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":11153,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":11158,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":11162,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":11166,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":11170,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":11175,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":11179,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":11183,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":11187,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":11192,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":11196,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":11200,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":11204,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":11209,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":11213,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":11217,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":11222,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":11226,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":11230,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":11234,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":11238,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":11242,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":11246,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":11250,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":11254,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":11259,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":11263,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":11267,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":11271,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":11276,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":11280,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":11284,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":11288,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":11292,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":11297,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":11301,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":11304,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":11308,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":11312,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":11317,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":11321,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":11325,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":11329,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":11333,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":11337,"\u002Fastrophysics-cosmology":11341,"\u002Fcolophon":11344,"\u002F":11347},{"path":6665,"title":6666,"module":6667,"summary":6668},"\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":6670,"title":6671,"module":6667,"summary":6672},"\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":6674,"title":6675,"module":6667,"summary":6676},"\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":6678,"title":6679,"module":6667,"summary":6680},"\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":6682,"title":6683,"module":6667,"summary":6684},"\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":6686,"title":6687,"module":6667,"summary":6688},"\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":6690,"title":6691,"module":6692,"summary":6693},"\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":6695,"title":6696,"module":6692,"summary":6697},"\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":6699,"title":6700,"module":6692,"summary":6701},"\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":6703,"title":6704,"module":6692,"summary":6705},"\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":6707,"title":6708,"module":6709,"summary":6710},"\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":6712,"title":6713,"module":6709,"summary":6714},"\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":6716,"title":6717,"module":6709,"summary":6718},"\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":6720,"title":6721,"module":6709,"summary":6722},"\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":6724,"title":6725,"module":6726,"summary":6727},"\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":6729,"title":6730,"module":6726,"summary":6731},"\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":6733,"title":6734,"module":6726,"summary":6735},"\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":6737,"title":6738,"module":6726,"summary":6739},"\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":6741,"title":6742,"module":6726,"summary":6743},"\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":6745,"title":6746,"module":6726,"summary":6747},"\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":6749,"title":6750,"module":6726,"summary":6751},"\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":6753,"title":6754,"module":6726,"summary":6755},"\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":6757,"title":6758,"module":6726,"summary":6759},"\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":6761,"title":6762,"module":6726,"summary":6763},"\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":6765,"title":6766,"module":6726,"summary":6767},"\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":6769,"title":6770,"module":6726,"summary":6771},"\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":6773,"title":6774,"module":6775,"summary":6776},"\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":6778,"title":6779,"module":6775,"summary":6780},"\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":6782,"title":6783,"module":6775,"summary":6784},"\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":6786,"title":6787,"module":6775,"summary":6788},"\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":6790,"title":6791,"module":6775,"summary":6792},"\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":6794,"title":6795,"module":6775,"summary":6796},"\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":6798,"title":6799,"module":6775,"summary":6800},"\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":6802,"title":6803,"module":6775,"summary":6804},"\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":6806,"title":6807,"module":6808,"summary":6809},"\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":6811,"title":6812,"module":6808,"summary":6813},"\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":6815,"title":6816,"module":6808,"summary":6817},"\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":6819,"title":6820,"module":6808,"summary":6821},"\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":6823,"title":6824,"module":6808,"summary":6825},"\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":6827,"title":6828,"module":6808,"summary":6829},"\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":6831,"title":6832,"module":6808,"summary":6833},"\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":6835,"title":6836,"module":6808,"summary":6837},"\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":6839,"title":6840,"module":6808,"summary":6841},"\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":6843,"title":6844,"module":6808,"summary":6845},"\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":6847,"title":6848,"module":6808,"summary":6849},"\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":6851,"title":6852,"module":6808,"summary":6853},"\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":6855,"title":6856,"module":6808,"summary":6857},"\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":6859,"title":6860,"module":6808,"summary":6861},"\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":6863,"title":6864,"module":6865,"summary":6866},"\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":6868,"title":6869,"module":6865,"summary":6870},"\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":6872,"title":6873,"module":6865,"summary":6874},"\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":6876,"title":6877,"module":6865,"summary":6878},"\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":6880,"title":6881,"module":6865,"summary":6882},"\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":6884,"title":6885,"module":6886,"summary":6887},"\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":6889,"title":6890,"module":6886,"summary":6891},"\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":6893,"title":6894,"module":6886,"summary":6895},"\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":6897,"title":6898,"module":6886,"summary":6899},"\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":6901,"title":6902,"module":6886,"summary":6903},"\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":6905,"title":6906,"module":6886,"summary":6907},"\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":6909,"title":6910,"module":6886,"summary":6911},"\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":6913,"title":6914,"module":6886,"summary":6915},"\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":6917,"title":6918,"module":6886,"summary":6919},"\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":6921,"title":6922,"module":6886,"summary":6923},"\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":6925,"title":6926,"module":6886,"summary":6927},"\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":6929,"title":6930,"module":6931,"summary":6932},"\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":6934,"title":6935,"module":6931,"summary":6936},"\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":6938,"title":6939,"module":6931,"summary":6940},"\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":6942,"title":6943,"module":6931,"summary":6944},"\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":6946,"title":6947,"module":6948,"summary":6949},"\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":6951,"title":6952,"module":6948,"summary":6953},"\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":6955,"title":6956,"module":6948,"summary":6957},"\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":6959,"title":6960,"module":6948,"summary":6961},"\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":6963,"title":6964,"module":6948,"summary":6965},"\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":6967,"title":6968,"module":6948,"summary":6969},"\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":6971,"title":6972,"module":6948,"summary":6973},"\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":6975,"title":6976,"module":6977,"summary":6978},"\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":6980,"title":6981,"module":6977,"summary":6982},"\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":6984,"title":6985,"module":6977,"summary":6986},"\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":6988,"title":6989,"module":6977,"summary":6990},"\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":6992,"title":6993,"module":6994,"summary":6995},"\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":6997,"title":6998,"module":6994,"summary":6999},"\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":7001,"title":7002,"module":6994,"summary":7003},"\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":7005,"title":7006,"module":6994,"summary":7007},"\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":7009,"title":7010,"module":6,"summary":6},"\u002Falgorithms","Algorithms",{"path":7012,"title":7013,"module":7014,"summary":7015},"\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":7017,"title":7018,"module":7014,"summary":7019},"\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":7021,"title":7022,"module":7014,"summary":7023},"\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":7025,"title":7026,"module":7014,"summary":7027},"\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":7029,"title":7030,"module":7031,"summary":7032},"\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":7034,"title":7035,"module":7031,"summary":7036},"\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":7038,"title":7039,"module":7031,"summary":7040},"\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":7042,"title":7043,"module":7031,"summary":7044},"\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":7046,"title":7047,"module":7048,"summary":7049},"\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":7051,"title":7052,"module":7048,"summary":7053},"\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":7055,"title":7056,"module":7048,"summary":7057},"\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":7059,"title":7060,"module":7048,"summary":7061},"\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":7063,"title":7064,"module":7065,"summary":7066},"\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":7068,"title":7069,"module":7065,"summary":7070},"\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":7072,"title":7073,"module":7065,"summary":7074},"\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":7076,"title":7077,"module":7078,"summary":7079},"\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":7081,"title":7082,"module":7078,"summary":7083},"\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":7085,"title":7086,"module":7078,"summary":7087},"\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":7089,"title":7090,"module":7091,"summary":7092},"\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":7094,"title":7095,"module":7091,"summary":7096},"\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":7098,"title":7099,"module":7091,"summary":7100},"\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":7102,"title":7103,"module":7104,"summary":7105},"\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":7107,"title":7108,"module":7104,"summary":7109},"\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":7111,"title":7112,"module":7104,"summary":7113},"\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":7115,"title":7116,"module":7104,"summary":7117},"\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":7119,"title":7120,"module":7121,"summary":7122},"\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":7124,"title":7125,"module":7121,"summary":7126},"\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":7128,"title":7129,"module":7121,"summary":7130},"\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":7132,"title":7133,"module":7134,"summary":7135},"\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":7137,"title":7138,"module":7134,"summary":7139},"\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":7141,"title":7142,"module":7134,"summary":7143},"\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":7145,"title":7146,"module":7134,"summary":7147},"\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":7149,"title":7150,"module":7134,"summary":7151},"\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":7153,"title":7154,"module":7155,"summary":7156},"\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":7158,"title":7159,"module":7155,"summary":7160},"\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":7162,"title":7163,"module":7155,"summary":7164},"\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":7166,"title":7167,"module":7155,"summary":7168},"\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":7170,"title":7171,"module":7155,"summary":7172},"\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":7174,"title":7175,"module":7176,"summary":7177},"\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":7179,"title":7176,"module":7176,"summary":7180},"\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":7182,"title":7183,"module":7176,"summary":7184},"\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":7186,"title":7187,"module":7176,"summary":7188},"\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":7190,"title":7191,"module":7176,"summary":7192},"\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":7194,"title":7195,"module":7196,"summary":7197},"\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":7199,"title":7200,"module":7196,"summary":7201},"\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":7203,"title":7204,"module":7196,"summary":7205},"\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":7207,"title":7208,"module":7196,"summary":7209},"\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":7211,"title":7212,"module":7196,"summary":7213},"\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":7215,"title":7216,"module":7196,"summary":7217},"\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":7219,"title":7220,"module":6,"summary":6},"\u002Fcalculus","Calculus",{"path":7222,"title":7223,"module":6667,"summary":7224},"\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":7226,"title":7227,"module":6667,"summary":7228},"\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":7230,"title":7231,"module":7232,"summary":7233},"\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":7235,"title":7236,"module":7232,"summary":7237},"\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":7239,"title":7240,"module":7232,"summary":7241},"\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":7243,"title":7244,"module":7232,"summary":7245},"\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":7247,"title":7248,"module":7232,"summary":7249},"\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":7251,"title":7252,"module":7253,"summary":7254},"\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":7256,"title":7257,"module":7253,"summary":7258},"\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":7260,"title":7261,"module":7253,"summary":7262},"\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":7264,"title":7265,"module":7253,"summary":7266},"\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":7268,"title":7269,"module":7253,"summary":7270},"\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":7272,"title":7273,"module":7274,"summary":7275},"\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":7277,"title":7278,"module":7274,"summary":7279},"\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":7281,"title":7282,"module":7274,"summary":7283},"\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":7285,"title":7286,"module":7274,"summary":7287},"\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":7289,"title":7290,"module":7274,"summary":7291},"\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":7293,"title":7294,"module":7295,"summary":7296},"\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":7298,"title":7299,"module":7295,"summary":7300},"\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":7302,"title":7303,"module":7295,"summary":7304},"\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":7306,"title":7307,"module":7308,"summary":7309},"\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":7311,"title":7312,"module":7308,"summary":7313},"\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":7315,"title":7316,"module":7308,"summary":7317},"\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":7319,"title":7320,"module":7308,"summary":7321},"\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":7323,"title":7324,"module":7308,"summary":7325},"\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":7327,"title":7328,"module":7308,"summary":7329},"\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":7331,"title":7332,"module":7333,"summary":7334},"\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":7336,"title":7337,"module":7333,"summary":7338},"\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":7340,"title":7341,"module":7333,"summary":7342},"\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":7344,"title":7345,"module":7333,"summary":7346},"\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":7348,"title":7349,"module":7333,"summary":7350},"\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":7352,"title":7353,"module":7333,"summary":7354},"\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":7356,"title":7357,"module":7333,"summary":7358},"\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":7360,"title":7361,"module":7362,"summary":7363},"\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":7365,"title":7366,"module":7362,"summary":7367},"\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":7369,"title":7370,"module":7362,"summary":7371},"\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":7373,"title":7374,"module":7362,"summary":7375},"\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":7377,"title":7378,"module":7362,"summary":7379},"\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":7381,"title":7382,"module":7362,"summary":7383},"\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":7385,"title":7386,"module":7362,"summary":7387},"\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":7389,"title":7390,"module":7362,"summary":7391},"\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":7393,"title":7394,"module":7362,"summary":7395},"\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":7397,"title":7398,"module":7362,"summary":7399},"\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":7401,"title":7402,"module":7362,"summary":7403},"\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":7405,"title":7406,"module":7362,"summary":7407},"\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":7409,"title":7410,"module":7411,"summary":7412},"\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":7414,"title":7415,"module":7411,"summary":7416},"\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":7418,"title":7419,"module":7411,"summary":7420},"\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":7422,"title":7423,"module":7411,"summary":7424},"\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":7426,"title":7427,"module":7411,"summary":7428},"\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":7430,"title":7431,"module":7411,"summary":7432},"\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":7434,"title":7435,"module":6,"summary":6},"\u002Fmechanics","Mechanics & Dynamics",{"path":7437,"title":7438,"module":7439,"summary":7440},"\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":7442,"title":7443,"module":7439,"summary":7444},"\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":7446,"title":7447,"module":7439,"summary":7448},"\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":7450,"title":7451,"module":7439,"summary":7452},"\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":7454,"title":7455,"module":7439,"summary":7456},"\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":7458,"title":7459,"module":7460,"summary":7461},"\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":7463,"title":7464,"module":7460,"summary":7465},"\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":7467,"title":7468,"module":7469,"summary":7470},"\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":7472,"title":7473,"module":7469,"summary":7474},"\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":7476,"title":7477,"module":7469,"summary":7478},"\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":7480,"title":7481,"module":7469,"summary":7482},"\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":7484,"title":7485,"module":7469,"summary":7486},"\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":7488,"title":7489,"module":7490,"summary":7491},"\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":7493,"title":7494,"module":7490,"summary":7495},"\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":7497,"title":7498,"module":7490,"summary":7499},"\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":7501,"title":7502,"module":7490,"summary":7503},"\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":7505,"title":7506,"module":7507,"summary":7508},"\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":7510,"title":7511,"module":7507,"summary":7512},"\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":7514,"title":7515,"module":7507,"summary":7516},"\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":7518,"title":7519,"module":7520,"summary":7521},"\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":7523,"title":7524,"module":7520,"summary":7525},"\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":7527,"title":7528,"module":7520,"summary":7529},"\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":7531,"title":7532,"module":7520,"summary":7533},"\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":7535,"title":7536,"module":7520,"summary":7537},"\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":7539,"title":7540,"module":7541,"summary":7542},"\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":7544,"title":7545,"module":7541,"summary":7546},"\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":7548,"title":7549,"module":7541,"summary":7550},"\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":7552,"title":7553,"module":7541,"summary":7554},"\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":7556,"title":7557,"module":7541,"summary":7558},"\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":7560,"title":7561,"module":7541,"summary":7562},"\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":7564,"title":7565,"module":7566,"summary":7567},"\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":7569,"title":7570,"module":7566,"summary":7571},"\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":7573,"title":7574,"module":7566,"summary":7575},"\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":7577,"title":7578,"module":7566,"summary":7579},"\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":7581,"title":7582,"module":7566,"summary":7583},"\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":7585,"title":7586,"module":7566,"summary":7587},"\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":7589,"title":7590,"module":7566,"summary":7591},"\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":7593,"title":7594,"module":7566,"summary":7595},"\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":7597,"title":7598,"module":7599,"summary":7600},"\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":7602,"title":7603,"module":7599,"summary":7604},"\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":7606,"title":7607,"module":7599,"summary":7608},"\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":7610,"title":7611,"module":7599,"summary":7612},"\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":7614,"title":7615,"module":7599,"summary":7616},"\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":7618,"title":7619,"module":7620,"summary":7621},"\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":7623,"title":7624,"module":7620,"summary":7625},"\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":7627,"title":7628,"module":7620,"summary":7629},"\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":7631,"title":7632,"module":7620,"summary":7633},"\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":7635,"title":7636,"module":7620,"summary":7637},"\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":7639,"title":7640,"module":7641,"summary":7642},"\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":7644,"title":7645,"module":7641,"summary":7646},"\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":7648,"title":7649,"module":7641,"summary":7650},"\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":7652,"title":7653,"module":6,"summary":6},"\u002Felectricity-and-magnetism","Electricity & Magnetism",{"path":7655,"title":7656,"module":7657,"summary":7658},"\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":7660,"title":7661,"module":7657,"summary":7662},"\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":7664,"title":7665,"module":7657,"summary":7666},"\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":7668,"title":7669,"module":7657,"summary":7670},"\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":7672,"title":7673,"module":7657,"summary":7674},"\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":7676,"title":7677,"module":7678,"summary":7679},"\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":7681,"title":7682,"module":7678,"summary":7683},"\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":7685,"title":7686,"module":7678,"summary":7687},"\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":7689,"title":7690,"module":7678,"summary":7691},"\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":7693,"title":7694,"module":7678,"summary":7695},"\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":7697,"title":7698,"module":7699,"summary":7700},"\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":7702,"title":7703,"module":7699,"summary":7704},"\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":7706,"title":7707,"module":7699,"summary":7708},"\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":7710,"title":7711,"module":7712,"summary":7713},"\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":7715,"title":7716,"module":7712,"summary":7717},"\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":7719,"title":7720,"module":7712,"summary":7721},"\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":7723,"title":7724,"module":7712,"summary":7725},"\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":7727,"title":7728,"module":7712,"summary":7729},"\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":7731,"title":7732,"module":7712,"summary":7733},"\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":7735,"title":7736,"module":7712,"summary":7737},"\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":7739,"title":7740,"module":7741,"summary":7742},"\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":7744,"title":7745,"module":7741,"summary":7746},"\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":7748,"title":7749,"module":7741,"summary":7750},"\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":7752,"title":7753,"module":7741,"summary":7754},"\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":7756,"title":7757,"module":7741,"summary":7758},"\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":7760,"title":7761,"module":7741,"summary":7762},"\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":7764,"title":7765,"module":7741,"summary":7766},"\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":7768,"title":7769,"module":7770,"summary":7771},"\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":7773,"title":7774,"module":7770,"summary":7775},"\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":7777,"title":7778,"module":7770,"summary":7779},"\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":7781,"title":7782,"module":7770,"summary":7783},"\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":7785,"title":7786,"module":7770,"summary":7787},"\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":7789,"title":7790,"module":7770,"summary":7791},"\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":7793,"title":7794,"module":7795,"summary":7796},"\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":7798,"title":7799,"module":7795,"summary":7800},"\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":7802,"title":7803,"module":7795,"summary":7804},"\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":7806,"title":7807,"module":7795,"summary":7808},"\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":7810,"title":7811,"module":7795,"summary":7812},"\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":7814,"title":7815,"module":7816,"summary":7817},"\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":7819,"title":7820,"module":7816,"summary":7821},"\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":7823,"title":7824,"module":7816,"summary":7825},"\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":7827,"title":7828,"module":7816,"summary":7829},"\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":7831,"title":7832,"module":7816,"summary":7833},"\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":7835,"title":7836,"module":7816,"summary":7837},"\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":7839,"title":7840,"module":7841,"summary":7842},"\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":7844,"title":7845,"module":7841,"summary":7846},"\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":7848,"title":7849,"module":7841,"summary":7850},"\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":7852,"title":7853,"module":7841,"summary":7854},"\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":7856,"title":7857,"module":7841,"summary":7858},"\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":7860,"title":7861,"module":6,"summary":6},"\u002Flinear-algebra","Linear Algebra",{"path":7863,"title":7864,"module":6,"summary":6},"\u002Ftheory-of-computation","Theory of Computation",{"path":7866,"title":7867,"module":6667,"summary":7868},"\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":7870,"title":7871,"module":6667,"summary":7872},"\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":7874,"title":7875,"module":6667,"summary":7876},"\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":7878,"title":7879,"module":6667,"summary":7880},"\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":7882,"title":7883,"module":6667,"summary":7884},"\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":7886,"title":7887,"module":7888,"summary":7889},"\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":7891,"title":7892,"module":7888,"summary":7893},"\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":7895,"title":7896,"module":7888,"summary":7897},"\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":7899,"title":7900,"module":7888,"summary":7901},"\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":7903,"title":7904,"module":7888,"summary":7905},"\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":7907,"title":7908,"module":7888,"summary":7909},"\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":7911,"title":7912,"module":7888,"summary":7913},"\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":7915,"title":7916,"module":7917,"summary":7918},"\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":7920,"title":7921,"module":7917,"summary":7922},"\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":7924,"title":7925,"module":7917,"summary":7926},"\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":7928,"title":7929,"module":7917,"summary":7930},"\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":7932,"title":7933,"module":7917,"summary":7934},"\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":7936,"title":7937,"module":7938,"summary":7939},"\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":7941,"title":7942,"module":7938,"summary":7943},"\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":7945,"title":7946,"module":7938,"summary":7947},"\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":7949,"title":7950,"module":7938,"summary":7951},"\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":7953,"title":7954,"module":7938,"summary":7955},"\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":7957,"title":7958,"module":7959,"summary":7960},"\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":7962,"title":7963,"module":7959,"summary":7964},"\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":7966,"title":7967,"module":7959,"summary":7968},"\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":7970,"title":7971,"module":7959,"summary":7972},"\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":7974,"title":7975,"module":7959,"summary":7976},"\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":7978,"title":7979,"module":7980,"summary":7981},"\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":7983,"title":7984,"module":7980,"summary":7985},"\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":7987,"title":7988,"module":7980,"summary":7989},"\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":7991,"title":7992,"module":7980,"summary":7993},"\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":7995,"title":7996,"module":7980,"summary":7997},"\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":7999,"title":8000,"module":8001,"summary":8002},"\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":8004,"title":8005,"module":8001,"summary":8006},"\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":8008,"title":8009,"module":8001,"summary":8010},"\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":8012,"title":8013,"module":8001,"summary":8014},"\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":8016,"title":8017,"module":8001,"summary":8018},"\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":8020,"title":8021,"module":8022,"summary":8023},"\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":8025,"title":8026,"module":8022,"summary":8027},"\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":8029,"title":8030,"module":8022,"summary":8031},"\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":8033,"title":8034,"module":8035,"summary":8036},"\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":8038,"title":8039,"module":8035,"summary":8040},"\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":8042,"title":8043,"module":8044,"summary":8045},"\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":8047,"title":8048,"module":8044,"summary":8049},"\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":8051,"title":8052,"module":8044,"summary":8053},"\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":8055,"title":8056,"module":8044,"summary":8057},"\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":8059,"title":8060,"module":8044,"summary":8061},"\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":8063,"title":8064,"module":8065,"summary":8066},"\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":8068,"title":8069,"module":8065,"summary":8070},"\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":8072,"title":8073,"module":6,"summary":6},"\u002Fcomputer-architecture","Computer Architecture",{"path":8075,"title":8076,"module":6667,"summary":8077},"\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":8079,"title":8080,"module":6667,"summary":8081},"\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":8083,"title":8084,"module":8085,"summary":8086},"\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":8088,"title":8089,"module":8085,"summary":8090},"\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":8092,"title":8093,"module":8085,"summary":8094},"\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":8096,"title":8097,"module":8085,"summary":8098},"\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":8100,"title":8101,"module":8085,"summary":8102},"\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":8104,"title":8105,"module":8085,"summary":8106},"\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":8108,"title":8109,"module":8110,"summary":8111},"\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":8113,"title":8114,"module":8110,"summary":8115},"\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":8117,"title":8118,"module":8110,"summary":8119},"\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":8121,"title":8122,"module":8110,"summary":8123},"\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":8125,"title":8126,"module":8110,"summary":8127},"\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":8129,"title":8130,"module":8110,"summary":8131},"\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":8133,"title":8134,"module":8135,"summary":8136},"\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":8138,"title":8139,"module":8135,"summary":8140},"\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":8142,"title":8143,"module":8135,"summary":8144},"\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":8146,"title":8147,"module":8148,"summary":8149},"\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":8151,"title":8152,"module":8148,"summary":8153},"\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":8155,"title":8156,"module":8157,"summary":8158},"\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":8160,"title":8161,"module":8157,"summary":8162},"\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":8164,"title":8165,"module":8157,"summary":8166},"\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":8168,"title":8169,"module":8170,"summary":8171},"\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":8173,"title":8174,"module":8170,"summary":8175},"\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":8177,"title":8178,"module":8179,"summary":8180},"\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":8182,"title":8183,"module":8179,"summary":8184},"\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":8186,"title":8187,"module":8179,"summary":8188},"\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":8190,"title":8191,"module":8192,"summary":8193},"\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":8195,"title":8196,"module":8192,"summary":8197},"\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":8199,"title":8200,"module":8192,"summary":8201},"\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":8203,"title":8204,"module":8205,"summary":8206},"\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":8208,"title":8209,"module":8205,"summary":8210},"\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":8212,"title":8213,"module":6,"summary":6},"\u002Fdifferential-equations","Differential Equations",{"path":8215,"title":8216,"module":8217,"summary":8218},"\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":8220,"title":8221,"module":8217,"summary":8222},"\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":8224,"title":8225,"module":8217,"summary":8226},"\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":8228,"title":8229,"module":8217,"summary":8230},"\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":8232,"title":8233,"module":8217,"summary":8234},"\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":8236,"title":8237,"module":8238,"summary":8239},"\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":8241,"title":8242,"module":8238,"summary":8243},"\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":8245,"title":8246,"module":8238,"summary":8247},"\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":8249,"title":8250,"module":8238,"summary":8251},"\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":8253,"title":8254,"module":8255,"summary":8256},"\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":8258,"title":8259,"module":8255,"summary":8260},"\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":8262,"title":8263,"module":8255,"summary":8264},"\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":8266,"title":8267,"module":8255,"summary":8268},"\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":8270,"title":8271,"module":8272,"summary":8273},"\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":8275,"title":8276,"module":8272,"summary":8277},"\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":8279,"title":8280,"module":8272,"summary":8281},"\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":8283,"title":8284,"module":8272,"summary":8285},"\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":8287,"title":8288,"module":8289,"summary":8290},"\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":8292,"title":8293,"module":8289,"summary":8294},"\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":8296,"title":8297,"module":8289,"summary":8298},"\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":8300,"title":8301,"module":8289,"summary":8302},"\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":8304,"title":8305,"module":8289,"summary":8306},"\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":8308,"title":8309,"module":8289,"summary":8310},"\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":8312,"title":8313,"module":8314,"summary":8315},"\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":8317,"title":8318,"module":8314,"summary":8319},"\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":8321,"title":8322,"module":8314,"summary":8323},"\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":8325,"title":8326,"module":8327,"summary":8328},"\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":8330,"title":8331,"module":8327,"summary":8332},"\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":8334,"title":8335,"module":8327,"summary":8336},"\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":8338,"title":8339,"module":8327,"summary":8340},"\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":8342,"title":8343,"module":8344,"summary":8345},"\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":8347,"title":8348,"module":8344,"summary":8349},"\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":8351,"title":8352,"module":8344,"summary":8353},"\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":8355,"title":8356,"module":8357,"summary":8358},"\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":8360,"title":8361,"module":8357,"summary":8362},"\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":8364,"title":8365,"module":8357,"summary":8366},"\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":8368,"title":8369,"module":8370,"summary":8371},"\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":8373,"title":8374,"module":8370,"summary":8375},"\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":8377,"title":8378,"module":6,"summary":6},"\u002Frelativity","Relativity",{"path":8380,"title":8381,"module":6,"summary":6},"\u002Fphysical-computing","Physical Computing",{"path":8383,"title":8384,"module":8385,"summary":8386},"\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":8388,"title":8389,"module":8385,"summary":8390},"\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":8392,"title":8393,"module":8385,"summary":8394},"\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":8396,"title":8397,"module":8385,"summary":8398},"\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":8400,"title":8401,"module":8402,"summary":8403},"\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":8405,"title":8406,"module":8402,"summary":8407},"\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":8409,"title":8410,"module":8402,"summary":8411},"\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":8413,"title":8414,"module":8415,"summary":8416},"\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":8418,"title":8419,"module":8415,"summary":8420},"\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":8422,"title":8423,"module":8415,"summary":8424},"\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":8426,"title":8427,"module":8415,"summary":8428},"\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":8430,"title":8431,"module":8415,"summary":8432},"\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":8434,"title":8435,"module":8415,"summary":8436},"\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":8438,"title":8439,"module":8440,"summary":8441},"\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":8443,"title":8444,"module":8440,"summary":8445},"\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":8447,"title":8448,"module":8440,"summary":8449},"\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":8451,"title":8452,"module":8440,"summary":8453},"\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":8455,"title":8456,"module":8440,"summary":8457},"\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":8459,"title":8460,"module":8440,"summary":8461},"\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":8463,"title":8464,"module":8465,"summary":8466},"\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":8468,"title":8469,"module":8465,"summary":8470},"\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":8472,"title":8473,"module":8465,"summary":8474},"\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":8476,"title":8477,"module":8465,"summary":8478},"\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":8480,"title":8481,"module":7320,"summary":8482},"\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":8484,"title":8485,"module":7320,"summary":8486},"\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":8488,"title":8489,"module":7320,"summary":8490},"\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":8492,"title":8493,"module":8494,"summary":8495},"\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":8497,"title":8498,"module":8494,"summary":8499},"\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":8501,"title":8502,"module":8494,"summary":8503},"\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":8505,"title":8506,"module":8507,"summary":8508},"\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":8510,"title":8511,"module":8507,"summary":8512},"\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":8514,"title":8515,"module":8507,"summary":8516},"\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":8518,"title":8519,"module":8520,"summary":8521},"\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":8523,"title":8524,"module":8520,"summary":8525},"\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":8527,"title":8528,"module":8529,"summary":8530},"\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":8532,"title":8533,"module":8529,"summary":8534},"\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":8536,"title":8537,"module":8529,"summary":8538},"\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":8540,"title":8541,"module":8529,"summary":8542},"\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":8544,"title":8545,"module":8529,"summary":8546},"\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":8548,"title":8549,"module":6,"summary":6},"\u002Fquantum-mechanics","Quantum Mechanics",{"path":8551,"title":8552,"module":8553,"summary":8554},"\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":8556,"title":8557,"module":8553,"summary":8558},"\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":8560,"title":8561,"module":8553,"summary":8562},"\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":8564,"title":8565,"module":8553,"summary":8566},"\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":8568,"title":8569,"module":8570,"summary":8571},"\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":8573,"title":8574,"module":8570,"summary":8575},"\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":8577,"title":8578,"module":8570,"summary":8579},"\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":8581,"title":8582,"module":8570,"summary":8583},"\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":8585,"title":8586,"module":8570,"summary":8587},"\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":8589,"title":8590,"module":8570,"summary":8591},"\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":8593,"title":8594,"module":8595,"summary":8596},"\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":8598,"title":8599,"module":8595,"summary":8600},"\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":8602,"title":8603,"module":8595,"summary":8604},"\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":8606,"title":8607,"module":8595,"summary":8608},"\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":8610,"title":8611,"module":8595,"summary":8612},"\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":8614,"title":8615,"module":7014,"summary":8616},"\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":8618,"title":8619,"module":7014,"summary":8620},"\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":8622,"title":8623,"module":7014,"summary":8624},"\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":8626,"title":8627,"module":7014,"summary":8628},"\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":8630,"title":8631,"module":7014,"summary":8632},"\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":8634,"title":8635,"module":7014,"summary":8636},"\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":8638,"title":8639,"module":8640,"summary":8641},"\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":8643,"title":8644,"module":8640,"summary":8645},"\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":8647,"title":8648,"module":8640,"summary":8649},"\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":8651,"title":8652,"module":8640,"summary":8653},"\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":8655,"title":8656,"module":8657,"summary":8658},"\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":8660,"title":8661,"module":8657,"summary":8662},"\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":8664,"title":8665,"module":8657,"summary":8666},"\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":8668,"title":7069,"module":8657,"summary":8669},"\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":8671,"title":8672,"module":8657,"summary":8673},"\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":8675,"title":8676,"module":8677,"summary":8678},"\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":8680,"title":8681,"module":8677,"summary":8682},"\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":8684,"title":8685,"module":8677,"summary":8686},"\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":8688,"title":8689,"module":8677,"summary":8690},"\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":8692,"title":8693,"module":8694,"summary":8695},"\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":8697,"title":8698,"module":8694,"summary":8699},"\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":8701,"title":8702,"module":8694,"summary":8703},"\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":8705,"title":8706,"module":8694,"summary":8707},"\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":8709,"title":8710,"module":8694,"summary":8711},"\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":8713,"title":8714,"module":6,"summary":6},"\u002Freal-analysis","Real Analysis",{"path":8716,"title":8717,"module":6667,"summary":8718},"\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":8720,"title":8721,"module":6667,"summary":8722},"\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":8724,"title":8725,"module":8726,"summary":8727},"\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":8729,"title":8730,"module":8726,"summary":8731},"\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":8733,"title":8734,"module":8726,"summary":8735},"\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":8737,"title":8738,"module":8726,"summary":8739},"\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":8741,"title":8742,"module":8743,"summary":8744},"\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":8746,"title":8747,"module":8743,"summary":8748},"\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":8750,"title":8751,"module":8743,"summary":8752},"\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":8754,"title":8755,"module":8743,"summary":8756},"\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":8758,"title":8759,"module":8743,"summary":8760},"\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":8762,"title":8763,"module":8743,"summary":8764},"\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":8766,"title":8767,"module":8768,"summary":8769},"\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":8771,"title":8772,"module":8768,"summary":8773},"\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":8775,"title":8776,"module":8768,"summary":8777},"\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":8779,"title":8780,"module":8768,"summary":8781},"\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":8783,"title":8784,"module":8785,"summary":8786},"\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":8788,"title":8789,"module":8785,"summary":8790},"\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":8792,"title":8793,"module":8785,"summary":8794},"\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":8796,"title":8797,"module":8785,"summary":8798},"\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":8800,"title":8801,"module":8802,"summary":8803},"\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":8805,"title":8806,"module":8802,"summary":8807},"\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":8809,"title":8810,"module":8802,"summary":8811},"\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":8813,"title":8814,"module":8815,"summary":8816},"\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":8818,"title":8819,"module":8815,"summary":8820},"\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":8822,"title":8823,"module":8815,"summary":8824},"\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":8826,"title":8827,"module":8815,"summary":8828},"\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":8830,"title":8831,"module":8832,"summary":8833},"\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":8835,"title":8836,"module":8832,"summary":8837},"\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":8839,"title":8840,"module":8832,"summary":8841},"\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":8843,"title":8844,"module":8832,"summary":8845},"\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":8847,"title":8848,"module":8849,"summary":8850},"\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":8852,"title":8853,"module":8849,"summary":8854},"\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":8856,"title":8857,"module":8849,"summary":8858},"\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":8860,"title":8861,"module":8862,"summary":8863},"\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":8865,"title":8866,"module":8862,"summary":8867},"\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":8869,"title":8870,"module":8862,"summary":8871},"\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":8873,"title":8874,"module":8862,"summary":8875},"\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":8877,"title":8878,"module":8879,"summary":8880},"\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":8882,"title":8883,"module":8879,"summary":8884},"\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":8886,"title":8887,"module":8879,"summary":8888},"\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":8890,"title":8891,"module":8879,"summary":8892},"\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":8894,"title":8895,"module":8879,"summary":8896},"\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":8898,"title":8899,"module":8900,"summary":8901},"\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":8903,"title":8904,"module":8900,"summary":8905},"\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":8907,"title":8908,"module":6,"summary":6},"\u002Fabstract-algebra","Abstract Algebra",{"path":8910,"title":8911,"module":8912,"summary":8913},"\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":8915,"title":8916,"module":8912,"summary":8917},"\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":8919,"title":8920,"module":8912,"summary":8921},"\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":8923,"title":8924,"module":8912,"summary":8925},"\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":8927,"title":8928,"module":8912,"summary":8929},"\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":8931,"title":8932,"module":8933,"summary":8934},"\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":8936,"title":8937,"module":8933,"summary":8938},"\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":8940,"title":8941,"module":8933,"summary":8942},"\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":8944,"title":8945,"module":8933,"summary":8946},"\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":8948,"title":8949,"module":8933,"summary":8950},"\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":8952,"title":8953,"module":8933,"summary":8954},"\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":8956,"title":8957,"module":8933,"summary":8958},"\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":8960,"title":8961,"module":8962,"summary":8963},"\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":8965,"title":8966,"module":8962,"summary":8967},"\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":8969,"title":8970,"module":8962,"summary":8971},"\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":8973,"title":8974,"module":8962,"summary":8975},"\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":8977,"title":8978,"module":8979,"summary":8980},"\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":8982,"title":8983,"module":8979,"summary":8984},"\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":8986,"title":8987,"module":8979,"summary":8988},"\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":8990,"title":8991,"module":8992,"summary":8993},"\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":8995,"title":8996,"module":8992,"summary":8997},"\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":8999,"title":9000,"module":8992,"summary":9001},"\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":9003,"title":9004,"module":8992,"summary":9005},"\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":9007,"title":9008,"module":8992,"summary":9009},"\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":9011,"title":9012,"module":8992,"summary":9013},"\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":9015,"title":9016,"module":9017,"summary":9018},"\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":9020,"title":9021,"module":9017,"summary":9022},"\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":9024,"title":9025,"module":9017,"summary":9026},"\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":9028,"title":9029,"module":9030,"summary":9031},"\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":9033,"title":9034,"module":9030,"summary":9035},"\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":9037,"title":9038,"module":9030,"summary":9039},"\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":9041,"title":9042,"module":9030,"summary":9043},"\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":9045,"title":9046,"module":9047,"summary":9048},"\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":9050,"title":9051,"module":9047,"summary":9052},"\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":9054,"title":9055,"module":9047,"summary":9056},"\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":9058,"title":9059,"module":9060,"summary":9061},"\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":9063,"title":9064,"module":9060,"summary":9065},"\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":9067,"title":9068,"module":9060,"summary":9069},"\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":9071,"title":9072,"module":9060,"summary":9073},"\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":9075,"title":9076,"module":6,"summary":6},"\u002Fatomic-physics","Atomic Physics",{"path":9078,"title":9079,"module":6,"summary":6},"\u002Fdatabases","Databases",{"path":9081,"title":9082,"module":6667,"summary":9083},"\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":9085,"title":9086,"module":6667,"summary":9087},"\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":9089,"title":9090,"module":6667,"summary":9091},"\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":9093,"title":9094,"module":6667,"summary":9095},"\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":9097,"title":9098,"module":6667,"summary":9099},"\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":9101,"title":9102,"module":6667,"summary":9103},"\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":9105,"title":9106,"module":9107,"summary":9108},"\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":9110,"title":9111,"module":9107,"summary":9112},"\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":9114,"title":9115,"module":9107,"summary":9116},"\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":9118,"title":9119,"module":9120,"summary":9121},"\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":9123,"title":9124,"module":9120,"summary":9125},"\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":9127,"title":9128,"module":9120,"summary":9129},"\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":9131,"title":9132,"module":9133,"summary":9134},"\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":9136,"title":9137,"module":9133,"summary":9138},"\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":9140,"title":9141,"module":9133,"summary":9142},"\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":9144,"title":9145,"module":9133,"summary":9146},"\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":9148,"title":9149,"module":9133,"summary":9150},"\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":9152,"title":9153,"module":9154,"summary":9155},"\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":9157,"title":9158,"module":9154,"summary":9159},"\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":9161,"title":9162,"module":9154,"summary":9163},"\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":9165,"title":9166,"module":9154,"summary":9167},"\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":9169,"title":9170,"module":9171,"summary":9172},"\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":9174,"title":9175,"module":9171,"summary":9176},"\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":9178,"title":9179,"module":9171,"summary":9180},"\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":9182,"title":9183,"module":9171,"summary":9184},"\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":9186,"title":9187,"module":9188,"summary":9189},"\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":9191,"title":9192,"module":9188,"summary":9193},"\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":9195,"title":9196,"module":9188,"summary":9197},"\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":9199,"title":9200,"module":9188,"summary":9201},"\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":9203,"title":9204,"module":9205,"summary":9206},"\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":9208,"title":9209,"module":9205,"summary":9210},"\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":9212,"title":9213,"module":9205,"summary":9214},"\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":9216,"title":9217,"module":6,"summary":6},"\u002Fcategory-theory","Category Theory",{"path":9219,"title":7861,"module":9220,"summary":9221},"\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":9223,"title":9224,"module":9220,"summary":9225},"\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":9227,"title":9228,"module":9220,"summary":9229},"\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":9231,"title":7220,"module":9220,"summary":9232},"\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":9234,"title":9235,"module":6667,"summary":9236},"\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":9238,"title":9239,"module":6667,"summary":9240},"\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":9242,"title":9243,"module":6667,"summary":9244},"\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":9246,"title":9247,"module":9248,"summary":9249},"\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":9251,"title":9252,"module":9248,"summary":9253},"\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":9255,"title":9256,"module":9248,"summary":9257},"\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":9259,"title":9260,"module":9248,"summary":9261},"\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":9263,"title":9264,"module":9248,"summary":9265},"\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":9267,"title":9268,"module":9269,"summary":9270},"\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":9272,"title":9273,"module":9269,"summary":9274},"\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":9276,"title":9277,"module":9269,"summary":9278},"\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":9280,"title":9281,"module":9269,"summary":9282},"\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":9284,"title":9285,"module":9269,"summary":9286},"\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":9288,"title":9289,"module":9290,"summary":9291},"\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":9293,"title":9294,"module":9290,"summary":9295},"\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":9297,"title":9298,"module":9290,"summary":9299},"\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":9301,"title":9302,"module":9290,"summary":9303},"\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":9305,"title":9306,"module":9307,"summary":9308},"\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":9310,"title":9311,"module":9307,"summary":9312},"\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":9314,"title":9315,"module":9307,"summary":9316},"\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":9318,"title":9319,"module":9307,"summary":9320},"\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":9322,"title":9323,"module":9307,"summary":9324},"\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":9326,"title":9327,"module":9307,"summary":9328},"\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":9330,"title":9331,"module":9307,"summary":9332},"\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":9334,"title":9335,"module":9307,"summary":9336},"\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":9338,"title":9339,"module":9307,"summary":9340},"\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":9342,"title":9343,"module":9344,"summary":9345},"\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":9347,"title":9348,"module":9344,"summary":9349},"\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":9351,"title":9352,"module":9344,"summary":9353},"\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":9355,"title":9356,"module":9344,"summary":9357},"\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":9359,"title":9360,"module":9344,"summary":9361},"\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":9363,"title":9364,"module":9365,"summary":9366},"\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":9368,"title":9369,"module":9365,"summary":9370},"\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":9372,"title":9373,"module":9365,"summary":9374},"\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":9376,"title":9377,"module":9365,"summary":9378},"\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":9380,"title":9381,"module":9365,"summary":9382},"\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":9384,"title":9385,"module":9365,"summary":9386},"\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":9388,"title":9389,"module":9365,"summary":9390},"\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":9392,"title":9393,"module":9394,"summary":9395},"\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":9397,"title":9398,"module":9394,"summary":9399},"\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":9401,"title":9402,"module":9394,"summary":9403},"\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":9405,"title":9406,"module":9407,"summary":9408},"\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":9410,"title":9411,"module":9407,"summary":9412},"\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":9414,"title":9415,"module":9407,"summary":9416},"\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":9418,"title":9419,"module":9407,"summary":9420},"\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":9422,"title":9423,"module":9407,"summary":9424},"\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":9426,"title":9427,"module":9407,"summary":9428},"\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":9430,"title":9431,"module":9407,"summary":9432},"\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":9434,"title":9435,"module":9436,"summary":9437},"\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":9439,"title":9440,"module":9436,"summary":9441},"\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":9443,"title":9444,"module":9436,"summary":9445},"\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":9447,"title":9448,"module":9436,"summary":9449},"\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":9451,"title":9452,"module":9436,"summary":9453},"\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":9455,"title":9456,"module":9436,"summary":9457},"\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":9459,"title":9460,"module":9436,"summary":9461},"\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":9463,"title":9464,"module":9436,"summary":9465},"\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":9467,"title":9468,"module":9436,"summary":9469},"\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":9471,"title":9472,"module":9436,"summary":9473},"\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":9475,"title":9476,"module":9436,"summary":9477},"\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":9479,"title":9480,"module":9481,"summary":9482},"\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":9484,"title":9485,"module":9481,"summary":9486},"\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":9488,"title":9489,"module":9481,"summary":9490},"\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":9492,"title":9493,"module":9481,"summary":9494},"\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":9496,"title":9497,"module":9481,"summary":9498},"\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":9500,"title":9501,"module":6,"summary":6},"\u002Fdeep-learning","Deep Learning",{"path":9503,"title":9504,"module":7411,"summary":9505},"\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":9507,"title":9508,"module":7411,"summary":9509},"\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":9511,"title":9512,"module":7411,"summary":9513},"\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":9515,"title":9516,"module":7411,"summary":9517},"\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":9519,"title":9520,"module":7411,"summary":9521},"\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":9523,"title":9524,"module":9525,"summary":9526},"\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":9528,"title":9529,"module":9525,"summary":9530},"\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":9532,"title":9533,"module":9525,"summary":9534},"\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":9536,"title":9537,"module":9525,"summary":9538},"\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":9540,"title":9541,"module":9542,"summary":9543},"\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":9545,"title":9546,"module":9542,"summary":9547},"\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":9549,"title":9550,"module":9542,"summary":9551},"\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":9553,"title":9554,"module":9542,"summary":9555},"\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":9557,"title":9558,"module":9559,"summary":9560},"\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":9562,"title":9563,"module":9559,"summary":9564},"\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":9566,"title":9567,"module":9559,"summary":9568},"\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":9570,"title":9571,"module":9559,"summary":9572},"\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":9574,"title":9575,"module":9559,"summary":9576},"\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":9578,"title":9579,"module":9580,"summary":9581},"\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":9583,"title":9584,"module":9580,"summary":9585},"\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":9587,"title":9588,"module":9580,"summary":9589},"\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":9591,"title":9592,"module":9593,"summary":9594},"\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":9596,"title":9597,"module":9593,"summary":9598},"\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":9600,"title":9601,"module":9593,"summary":9602},"\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":9604,"title":9605,"module":9606,"summary":9607},"\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":9609,"title":9610,"module":9606,"summary":9611},"\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":9613,"title":9614,"module":9606,"summary":9615},"\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":9617,"title":9618,"module":9606,"summary":9619},"\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":9621,"title":9622,"module":9623,"summary":9624},"\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":9626,"title":9627,"module":9623,"summary":9628},"\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":9630,"title":9631,"module":9623,"summary":9632},"\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":9634,"title":9635,"module":9623,"summary":9636},"\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":9638,"title":9639,"module":9623,"summary":9640},"\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":9642,"title":9643,"module":9623,"summary":9644},"\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":9646,"title":9647,"module":9648,"summary":9649},"\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":9651,"title":9652,"module":9648,"summary":9653},"\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":9655,"title":9656,"module":9648,"summary":9657},"\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":9659,"title":9660,"module":9648,"summary":9661},"\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":9663,"title":9664,"module":9665,"summary":9666},"\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":9668,"title":9669,"module":9665,"summary":9670},"\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":9672,"title":9673,"module":9665,"summary":9674},"\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":9676,"title":9677,"module":9678,"summary":9679},"\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":9681,"title":9682,"module":9678,"summary":9683},"\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":9685,"title":9686,"module":9678,"summary":9687},"\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":9689,"title":9690,"module":9678,"summary":9691},"\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":9693,"title":9694,"module":9678,"summary":9695},"\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":9697,"title":9698,"module":9699,"summary":9700},"\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":9702,"title":9703,"module":9699,"summary":9704},"\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":9706,"title":9707,"module":9699,"summary":9708},"\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":9710,"title":9711,"module":6,"summary":6},"\u002Fstatistical-mechanics","Statistical Mechanics",{"path":9713,"title":9714,"module":9715,"summary":9716},"\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":9718,"title":9719,"module":9715,"summary":9720},"\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":9722,"title":9723,"module":9715,"summary":9724},"\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":9726,"title":9727,"module":9715,"summary":9728},"\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":9730,"title":9731,"module":5728,"summary":9732},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra","Rotational and Vibrational Spectra of Molecules","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":9734,"title":9735,"module":5728,"summary":9736},"\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":5730,"title":5,"module":5728,"summary":5748},{"path":5710,"title":9739,"module":5728,"summary":9740},"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":9742,"title":9743,"module":9744,"summary":9745},"\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":9747,"title":9748,"module":9744,"summary":9749},"\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":9751,"title":9752,"module":9744,"summary":9753},"\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":9755,"title":9756,"module":9744,"summary":9757},"\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":9759,"title":9760,"module":9761,"summary":9762},"\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":9764,"title":9765,"module":9761,"summary":9766},"\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":9768,"title":9769,"module":9761,"summary":9770},"\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":9772,"title":9773,"module":9761,"summary":9774},"\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":9776,"title":9777,"module":9778,"summary":9779},"\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":9781,"title":9782,"module":9778,"summary":9783},"\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":9785,"title":9786,"module":9778,"summary":9787},"\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":9789,"title":9790,"module":9778,"summary":9791},"\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":9793,"title":9794,"module":9795,"summary":9796},"\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":9798,"title":9799,"module":9795,"summary":9800},"\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":9802,"title":9803,"module":9795,"summary":9804},"\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":9806,"title":9807,"module":9795,"summary":9808},"\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":9810,"title":9811,"module":9812,"summary":9813},"\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":9815,"title":9816,"module":9812,"summary":9817},"\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":9819,"title":9820,"module":9812,"summary":9821},"\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":9823,"title":9824,"module":9812,"summary":9825},"\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":9827,"title":9828,"module":9812,"summary":9829},"\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":9831,"title":9832,"module":9833,"summary":9834},"\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":9836,"title":9837,"module":9833,"summary":9838},"\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":9840,"title":9841,"module":9842,"summary":9843},"\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":9845,"title":9846,"module":9842,"summary":9847},"\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":9849,"title":9850,"module":9842,"summary":9851},"\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":9853,"title":9854,"module":9842,"summary":9855},"\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":9857,"title":9858,"module":9859,"summary":9860},"\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":9862,"title":9863,"module":9859,"summary":9864},"\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":9866,"title":9867,"module":9859,"summary":9868},"\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":9870,"title":9871,"module":9859,"summary":9872},"\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":9874,"title":9875,"module":9859,"summary":9876},"\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":9878,"title":9879,"module":9880,"summary":9881},"\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":9883,"title":9884,"module":9880,"summary":9885},"\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":9887,"title":9888,"module":9880,"summary":9889},"\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":9891,"title":9892,"module":9880,"summary":9893},"\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":9895,"title":9896,"module":6,"summary":6},"\u002Fcondensed-matter","Condensed Matter Physics",{"path":9898,"title":9899,"module":6667,"summary":9900},"\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":9902,"title":9903,"module":9904,"summary":9905},"\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":9907,"title":9908,"module":9904,"summary":9909},"\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":9911,"title":9912,"module":9904,"summary":9913},"\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":9915,"title":9916,"module":9904,"summary":9917},"\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":9919,"title":9920,"module":9904,"summary":9921},"\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":9923,"title":9924,"module":9904,"summary":9925},"\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":9927,"title":9928,"module":9904,"summary":9929},"\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":9931,"title":9932,"module":9933,"summary":9934},"\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":9936,"title":9937,"module":9933,"summary":9938},"\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":9940,"title":9941,"module":9933,"summary":9942},"\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":9944,"title":9945,"module":9933,"summary":9946},"\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":9948,"title":9949,"module":9950,"summary":9951},"\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":9953,"title":9954,"module":9950,"summary":9955},"\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":9957,"title":9958,"module":9950,"summary":9959},"\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":9961,"title":9962,"module":9950,"summary":9963},"\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":9965,"title":9966,"module":9967,"summary":9968},"\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":9970,"title":9971,"module":9967,"summary":9972},"\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":9974,"title":9975,"module":9967,"summary":9976},"\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":9978,"title":9979,"module":9967,"summary":9980},"\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":9982,"title":9983,"module":9984,"summary":9985},"\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":9987,"title":9988,"module":9984,"summary":9989},"\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":9991,"title":9992,"module":9984,"summary":9993},"\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":9995,"title":9996,"module":9984,"summary":9997},"\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":9999,"title":10000,"module":10001,"summary":10002},"\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":10004,"title":10005,"module":10001,"summary":10006},"\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":10008,"title":10009,"module":10001,"summary":10010},"\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":10012,"title":10013,"module":10014,"summary":10015},"\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":10017,"title":10018,"module":10014,"summary":10019},"\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":10021,"title":10022,"module":10023,"summary":10024},"\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":10026,"title":10027,"module":10023,"summary":10028},"\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":10030,"title":10031,"module":10023,"summary":10032},"\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":10034,"title":10035,"module":6,"summary":6},"\u002Flogic","Logic",{"path":10037,"title":10038,"module":6667,"summary":10039},"\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":10041,"title":10042,"module":6667,"summary":10043},"\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":10045,"title":10046,"module":6667,"summary":10047},"\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":10049,"title":10050,"module":6667,"summary":10051},"\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":10053,"title":10054,"module":6667,"summary":10055},"\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":10057,"title":10058,"module":6667,"summary":10059},"\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":10061,"title":6886,"module":10062,"summary":10063},"\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":10065,"title":10066,"module":10062,"summary":10067},"\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":10069,"title":10070,"module":10062,"summary":10071},"\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":10073,"title":10074,"module":10062,"summary":10075},"\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":10077,"title":10078,"module":10062,"summary":10079},"\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":10081,"title":10082,"module":10062,"summary":10083},"\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":10085,"title":10086,"module":10062,"summary":10087},"\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":10089,"title":10090,"module":10062,"summary":10091},"\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":10093,"title":10094,"module":10062,"summary":10095},"\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":10097,"title":10098,"module":10062,"summary":10099},"\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":10101,"title":10102,"module":10062,"summary":10103},"\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":10105,"title":10106,"module":10062,"summary":10107},"\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":10109,"title":10110,"module":10111,"summary":10112},"\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":10114,"title":10115,"module":10111,"summary":10116},"\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":10118,"title":10119,"module":10111,"summary":10120},"\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":10122,"title":10123,"module":10111,"summary":10124},"\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":10126,"title":10127,"module":10111,"summary":10128},"\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":10130,"title":10131,"module":10111,"summary":10132},"\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":10134,"title":10135,"module":10111,"summary":10136},"\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":10138,"title":10139,"module":10111,"summary":10140},"\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":10142,"title":10143,"module":10111,"summary":10144},"\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":10146,"title":10147,"module":10111,"summary":10148},"\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":10150,"title":10151,"module":10111,"summary":10152},"\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":10154,"title":10155,"module":10111,"summary":10156},"\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":10158,"title":10159,"module":10111,"summary":10160},"\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":10162,"title":10163,"module":10111,"summary":10164},"\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":10166,"title":9489,"module":10167,"summary":10168},"\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":10170,"title":10171,"module":10167,"summary":10172},"\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":10174,"title":10175,"module":10167,"summary":10176},"\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":10178,"title":10179,"module":10167,"summary":10180},"\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":10182,"title":10183,"module":10167,"summary":10184},"\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":10186,"title":10187,"module":10167,"summary":10188},"\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":10190,"title":10191,"module":10167,"summary":10192},"\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":10194,"title":10195,"module":10167,"summary":10196},"\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":10198,"title":10199,"module":10200,"summary":10201},"\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":10203,"title":10204,"module":10200,"summary":10205},"\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":10207,"title":10208,"module":10200,"summary":10209},"\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":10211,"title":10212,"module":10200,"summary":10213},"\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":10215,"title":10216,"module":10200,"summary":10217},"\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":10219,"title":10220,"module":10200,"summary":10221},"\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":10223,"title":10224,"module":10200,"summary":10225},"\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":10227,"title":10228,"module":10200,"summary":10229},"\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":10231,"title":10232,"module":10200,"summary":10233},"\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":10235,"title":10236,"module":10200,"summary":10237},"\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":10239,"title":10240,"module":10200,"summary":10241},"\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":10243,"title":10244,"module":10200,"summary":10245},"\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":10247,"title":10248,"module":10200,"summary":10249},"\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":10251,"title":10252,"module":10200,"summary":10253},"\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":10255,"title":10256,"module":10200,"summary":10257},"\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":10259,"title":10260,"module":10200,"summary":10261},"\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":10263,"title":10264,"module":10200,"summary":10265},"\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":10267,"title":10268,"module":10200,"summary":10269},"\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":10271,"title":10272,"module":10200,"summary":10273},"\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":10275,"title":10276,"module":10200,"summary":10277},"\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":10279,"title":10280,"module":10200,"summary":10281},"\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":10283,"title":10284,"module":10200,"summary":10285},"\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":10287,"title":10288,"module":10289,"summary":10290},"\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":10292,"title":10293,"module":10289,"summary":10294},"\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":10296,"title":10297,"module":10289,"summary":10298},"\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":10300,"title":10301,"module":10289,"summary":10302},"\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":10304,"title":10305,"module":10289,"summary":10306},"\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":10308,"title":10309,"module":10289,"summary":10310},"\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":10312,"title":10313,"module":10289,"summary":10314},"\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":10316,"title":10317,"module":10289,"summary":10318},"\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":10320,"title":9481,"module":6,"summary":6},"\u002Freinforcement-learning",{"path":10322,"title":10323,"module":6667,"summary":10324},"\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":10326,"title":10327,"module":6667,"summary":10328},"\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":10330,"title":10331,"module":6667,"summary":10332},"\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":10334,"title":10335,"module":6667,"summary":10336},"\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":10338,"title":10339,"module":10340,"summary":10341},"\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":10343,"title":10344,"module":10340,"summary":10345},"\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":10347,"title":10348,"module":10340,"summary":10349},"\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":10351,"title":10352,"module":10340,"summary":10353},"\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":10355,"title":10356,"module":10340,"summary":10357},"\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":10359,"title":10360,"module":10340,"summary":10361},"\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":10363,"title":10364,"module":10340,"summary":10365},"\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":10367,"title":10368,"module":10340,"summary":10369},"\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":10371,"title":10372,"module":10340,"summary":10373},"\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":10375,"title":10376,"module":10340,"summary":10377},"\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":10379,"title":10380,"module":10340,"summary":10381},"\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":10383,"title":10384,"module":10340,"summary":10385},"\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":10387,"title":10388,"module":10389,"summary":10390},"\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":10392,"title":10393,"module":10389,"summary":10394},"\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":10396,"title":10397,"module":10389,"summary":10398},"\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":10400,"title":10401,"module":10389,"summary":10402},"\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":10404,"title":10405,"module":10389,"summary":10406},"\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":10408,"title":10409,"module":10389,"summary":10410},"\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":10412,"title":10413,"module":10389,"summary":10414},"\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":10416,"title":10417,"module":10389,"summary":10418},"\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":10420,"title":10421,"module":10389,"summary":10422},"\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":10424,"title":10425,"module":10389,"summary":10426},"\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":10428,"title":10429,"module":10389,"summary":10430},"\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":10432,"title":10433,"module":10389,"summary":10434},"\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":10436,"title":10437,"module":10438,"summary":10439},"\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":10441,"title":10442,"module":10438,"summary":10443},"\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":10445,"title":10446,"module":10438,"summary":10447},"\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":10449,"title":10450,"module":10438,"summary":10451},"\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":10453,"title":10454,"module":10438,"summary":10455},"\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":10457,"title":10458,"module":10438,"summary":10459},"\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":10461,"title":10462,"module":10438,"summary":10463},"\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":10465,"title":10054,"module":10438,"summary":10466},"\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":10468,"title":10469,"module":10438,"summary":10470},"\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":10472,"title":10473,"module":10438,"summary":10474},"\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":10476,"title":10477,"module":10478,"summary":10479},"\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":10481,"title":10482,"module":10478,"summary":10483},"\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":10485,"title":10486,"module":10478,"summary":10487},"\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":10489,"title":10490,"module":10478,"summary":10491},"\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":10493,"title":9481,"module":10478,"summary":10494},"\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":10496,"title":10497,"module":10478,"summary":10498},"\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":10500,"title":10501,"module":10478,"summary":10502},"\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":10504,"title":10505,"module":10478,"summary":10506},"\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":10508,"title":10509,"module":10510,"summary":10511},"\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":10513,"title":10514,"module":10510,"summary":10515},"\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":10517,"title":10518,"module":10510,"summary":10519},"\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":10521,"title":10522,"module":10510,"summary":10523},"\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":10525,"title":10526,"module":10510,"summary":10527},"\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":10529,"title":10530,"module":10510,"summary":10531},"\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":10533,"title":10534,"module":10510,"summary":10535},"\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":10537,"title":10538,"module":10510,"summary":10539},"\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":10541,"title":10542,"module":6,"summary":6},"\u002Fartificial-intelligence","Artificial Intelligence",{"path":10544,"title":10545,"module":10546,"summary":10547},"\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":10549,"title":10550,"module":10546,"summary":10551},"\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":10553,"title":10554,"module":10546,"summary":10555},"\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":10557,"title":10558,"module":10546,"summary":10559},"\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":10561,"title":10562,"module":10546,"summary":10563},"\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":10565,"title":10566,"module":10567,"summary":10568},"\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":10570,"title":10571,"module":10567,"summary":10572},"\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":10574,"title":10575,"module":10567,"summary":10576},"\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":10578,"title":10579,"module":10567,"summary":10580},"\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":10582,"title":10583,"module":10584,"summary":10585},"\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":10587,"title":10588,"module":10584,"summary":10589},"\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":10591,"title":10592,"module":10584,"summary":10593},"\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":10595,"title":10596,"module":10584,"summary":10597},"\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":10599,"title":10600,"module":10601,"summary":10602},"\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":10604,"title":10605,"module":10601,"summary":10606},"\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":10608,"title":10609,"module":10610,"summary":10611},"\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":10613,"title":10614,"module":10610,"summary":10615},"\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":10617,"title":10618,"module":10619,"summary":10620},"\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":10622,"title":10623,"module":10619,"summary":10624},"\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":10626,"title":10627,"module":10619,"summary":10628},"\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":10630,"title":10631,"module":10619,"summary":10632},"\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":10634,"title":10635,"module":10636,"summary":10637},"\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":10639,"title":10640,"module":10636,"summary":10641},"\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":10643,"title":10644,"module":10636,"summary":10645},"\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":10647,"title":10648,"module":10649,"summary":10650},"\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":10652,"title":10653,"module":10649,"summary":10654},"\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":10656,"title":10657,"module":10649,"summary":10658},"\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":10660,"title":10661,"module":10662,"summary":10663},"\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":10665,"title":10666,"module":10662,"summary":10667},"\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":10669,"title":10670,"module":10671,"summary":10672},"\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":10674,"title":10675,"module":10671,"summary":10676},"\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":10678,"title":10679,"module":10671,"summary":10680},"\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":10682,"title":10683,"module":10684,"summary":10685},"\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":10687,"title":10688,"module":10684,"summary":10689},"\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":10691,"title":10692,"module":10684,"summary":10693},"\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":10695,"title":10696,"module":10684,"summary":10697},"\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":10699,"title":10700,"module":10684,"summary":10701},"\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":10703,"title":10704,"module":6,"summary":6},"\u002Fnuclear-physics","Nuclear Physics",{"path":10706,"title":10707,"module":6667,"summary":10708},"\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":10710,"title":10711,"module":6667,"summary":10712},"\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":10714,"title":10715,"module":6667,"summary":10716},"\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":10718,"title":10719,"module":6667,"summary":10720},"\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":10722,"title":10723,"module":6667,"summary":10724},"\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":10726,"title":10727,"module":10728,"summary":10729},"\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":10731,"title":10732,"module":10728,"summary":10733},"\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":10735,"title":10736,"module":10728,"summary":10737},"\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":10739,"title":10740,"module":10728,"summary":10741},"\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":10743,"title":10744,"module":10745,"summary":10746},"\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":10748,"title":10749,"module":10745,"summary":10750},"\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":10752,"title":10753,"module":10745,"summary":10754},"\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":10756,"title":10757,"module":7133,"summary":10758},"\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":10760,"title":10761,"module":7133,"summary":10762},"\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":10764,"title":10765,"module":7133,"summary":10766},"\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":10768,"title":10769,"module":7615,"summary":10770},"\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":10772,"title":9327,"module":7615,"summary":10773},"\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":10775,"title":9435,"module":7615,"summary":10776},"\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":10778,"title":10779,"module":7615,"summary":10780},"\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":10782,"title":10783,"module":7615,"summary":10784},"\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":10786,"title":10787,"module":7615,"summary":10788},"\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":10790,"title":10791,"module":10792,"summary":10793},"\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":10795,"title":10796,"module":10792,"summary":10797},"\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":10799,"title":10800,"module":10792,"summary":10801},"\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":10803,"title":10804,"module":10792,"summary":10805},"\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":10807,"title":10808,"module":10792,"summary":10809},"\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":10811,"title":10812,"module":10792,"summary":10813},"\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":10815,"title":10816,"module":10792,"summary":10817},"\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":10819,"title":10820,"module":10792,"summary":10821},"\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":10823,"title":10824,"module":10792,"summary":10825},"\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":10827,"title":10828,"module":10792,"summary":10829},"\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":10831,"title":10832,"module":10792,"summary":10833},"\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":10835,"title":10836,"module":10792,"summary":10837},"\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":10839,"title":10840,"module":10792,"summary":10841},"\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":10843,"title":10844,"module":10792,"summary":10845},"\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":10847,"title":10848,"module":10792,"summary":10849},"\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":10851,"title":10852,"module":10792,"summary":10853},"\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":10855,"title":10856,"module":10792,"summary":10857},"\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":10859,"title":10860,"module":10792,"summary":10861},"\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":10863,"title":10864,"module":10792,"summary":10865},"\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":10867,"title":10868,"module":10792,"summary":10869},"\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":10871,"title":10872,"module":9423,"summary":10873},"\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":10875,"title":10876,"module":9423,"summary":10877},"\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":10879,"title":10880,"module":9423,"summary":10881},"\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":10883,"title":10884,"module":9423,"summary":10885},"\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":10887,"title":10888,"module":9423,"summary":10889},"\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":10891,"title":10892,"module":9423,"summary":10893},"\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":10895,"title":10896,"module":9423,"summary":10897},"\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":10899,"title":10900,"module":9423,"summary":10901},"\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":10903,"title":10904,"module":10905,"summary":10906},"\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":10908,"title":10909,"module":10905,"summary":10910},"\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":10912,"title":10913,"module":10905,"summary":10914},"\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":10916,"title":10917,"module":10905,"summary":10918},"\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":10920,"title":10921,"module":6,"summary":6},"\u002Fnatural-language-processing","Natural Language Processing",{"path":10923,"title":10924,"module":6667,"summary":10925},"\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":10927,"title":10928,"module":6667,"summary":10929},"\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":10931,"title":10932,"module":6667,"summary":10933},"\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":10935,"title":10936,"module":10937,"summary":10938},"\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":10940,"title":10941,"module":10937,"summary":10942},"\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":10944,"title":10945,"module":10937,"summary":10946},"\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":10948,"title":10949,"module":10937,"summary":10950},"\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":10952,"title":10953,"module":10954,"summary":10955},"\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":10957,"title":10958,"module":10954,"summary":10959},"\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":10961,"title":10962,"module":10954,"summary":10963},"\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":10965,"title":10966,"module":10954,"summary":10967},"\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":10969,"title":10970,"module":10971,"summary":10972},"\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":10974,"title":10975,"module":10971,"summary":10976},"\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":10978,"title":10979,"module":10971,"summary":10980},"\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":10982,"title":10983,"module":10971,"summary":10984},"\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":10986,"title":10987,"module":10988,"summary":10989},"\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":10991,"title":10992,"module":10988,"summary":10993},"\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":10995,"title":10996,"module":10988,"summary":10997},"\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":10999,"title":11000,"module":11001,"summary":11002},"\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":11004,"title":11005,"module":11001,"summary":11006},"\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":11008,"title":11009,"module":11001,"summary":11010},"\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":11012,"title":11013,"module":11001,"summary":11014},"\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":11016,"title":11017,"module":11018,"summary":11019},"\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":11021,"title":11022,"module":11018,"summary":11023},"\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":11025,"title":11026,"module":11018,"summary":11027},"\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":11029,"title":11030,"module":11018,"summary":11031},"\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":11033,"title":11034,"module":11035,"summary":11036},"\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":11038,"title":11039,"module":11035,"summary":11040},"\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":11042,"title":11043,"module":11035,"summary":11044},"\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":11046,"title":11047,"module":11035,"summary":11048},"\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":11050,"title":11051,"module":11052,"summary":11053},"\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":11055,"title":11056,"module":11052,"summary":11057},"\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":11059,"title":11060,"module":11052,"summary":11061},"\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":11063,"title":11064,"module":11052,"summary":11065},"\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":11067,"title":11068,"module":11052,"summary":11069},"\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":11071,"title":11072,"module":11073,"summary":11074},"\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":11076,"title":11077,"module":11073,"summary":11078},"\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":11080,"title":11081,"module":11073,"summary":11082},"\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":11084,"title":11085,"module":11086,"summary":11087},"\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":11089,"title":11090,"module":11086,"summary":11091},"\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":11093,"title":11094,"module":11086,"summary":11095},"\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":11097,"title":11098,"module":11098,"summary":11099},"\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":11101,"title":11102,"module":11098,"summary":11103},"\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":11105,"title":11106,"module":11098,"summary":11107},"\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":11109,"title":11110,"module":11098,"summary":11111},"\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":11113,"title":11114,"module":11098,"summary":11115},"\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":11117,"title":11118,"module":11098,"summary":11119},"\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":11121,"title":11122,"module":6,"summary":6},"\u002Fparticle-physics","Particle Physics",{"path":11124,"title":11125,"module":11126,"summary":11127},"\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":11129,"title":11130,"module":11126,"summary":11131},"\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":11133,"title":11134,"module":11126,"summary":11135},"\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":11137,"title":11138,"module":11139,"summary":11140},"\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":11142,"title":11143,"module":11139,"summary":11144},"\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":11146,"title":11147,"module":11139,"summary":11148},"\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":11150,"title":11151,"module":11139,"summary":11152},"\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":11154,"title":11155,"module":11156,"summary":11157},"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity","Blackbody Radiation and Specific Intensity","Radiation and Matter","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":11159,"title":11160,"module":11156,"summary":11161},"\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":11163,"title":11164,"module":11156,"summary":11165},"\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":11167,"title":11168,"module":11156,"summary":11169},"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean","Opacity Sources 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",{"path":11171,"title":11172,"module":11173,"summary":11174},"\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":11176,"title":11177,"module":11173,"summary":11178},"\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":11180,"title":11181,"module":11173,"summary":11182},"\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":11184,"title":11185,"module":11173,"summary":11186},"\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":11188,"title":11189,"module":11190,"summary":11191},"\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":11193,"title":11194,"module":11190,"summary":11195},"\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":11197,"title":11198,"module":11190,"summary":11199},"\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":11201,"title":11202,"module":11190,"summary":11203},"\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":11205,"title":11206,"module":11207,"summary":11208},"\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":11210,"title":11211,"module":11207,"summary":11212},"\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":11214,"title":11215,"module":11207,"summary":11216},"\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":11218,"title":11219,"module":11220,"summary":11221},"\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":11223,"title":11224,"module":11220,"summary":11225},"\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":11227,"title":11228,"module":11220,"summary":11229},"\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":11231,"title":11232,"module":11220,"summary":11233},"\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":11235,"title":9656,"module":11236,"summary":11237},"\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":11239,"title":11240,"module":11236,"summary":11241},"\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":11243,"title":11244,"module":11236,"summary":11245},"\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":11247,"title":11248,"module":11236,"summary":11249},"\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":11251,"title":11252,"module":11236,"summary":11253},"\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":11255,"title":11256,"module":11257,"summary":11258},"\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":11260,"title":11261,"module":11257,"summary":11262},"\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":11264,"title":11265,"module":11257,"summary":11266},"\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":11268,"title":11269,"module":11257,"summary":11270},"\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":11272,"title":11273,"module":11274,"summary":11275},"\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":11277,"title":11278,"module":11274,"summary":11279},"\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":11281,"title":11282,"module":11274,"summary":11283},"\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":11285,"title":11286,"module":11274,"summary":11287},"\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":11289,"title":11290,"module":11274,"summary":11291},"\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":11293,"title":11294,"module":11295,"summary":11296},"\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":11298,"title":11299,"module":11295,"summary":11300},"\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":11302,"title":8374,"module":11295,"summary":11303},"\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":11305,"title":11306,"module":11295,"summary":11307},"\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":11309,"title":11310,"module":11295,"summary":11311},"\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":11313,"title":11314,"module":11315,"summary":11316},"\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":11318,"title":11319,"module":11315,"summary":11320},"\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":11322,"title":11323,"module":11315,"summary":11324},"\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":11326,"title":11327,"module":11315,"summary":11328},"\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":11330,"title":11331,"module":11315,"summary":11332},"\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":11334,"title":11335,"module":11315,"summary":11336},"\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":11338,"title":11339,"module":11315,"summary":11340},"\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":11342,"title":11343,"module":6,"summary":6},"\u002Fastrophysics-cosmology","Astrophysics & Cosmology",{"path":11345,"title":11346,"module":6,"summary":6},"\u002Fcolophon","Colophon",{"path":3163,"title":11348,"module":6,"summary":6},"Study Notes",[11350,11363,11374,11385,11396,11408,11420,11434,11442,11454,11468],{"module":9715,"moduleNumber":11351,"slug":11352,"lessons":11353},1,"molecules-and-bonding",[11354,11356,11358,11360],{"title":9714,"path":9713,"lessonNumber":11351,"topics":11355,"summary":9716},[9715],{"title":9719,"path":9718,"lessonNumber":5714,"topics":11357,"summary":9720},[9715],{"title":9723,"path":9722,"lessonNumber":5726,"topics":11359,"summary":9724},[9715],{"title":9727,"path":9726,"lessonNumber":11361,"topics":11362,"summary":9728},4,[9715],{"module":5728,"moduleNumber":5714,"slug":11364,"lessons":11365},"molecular-spectra",[11366,11368,11370,11372],{"title":9731,"path":9730,"lessonNumber":11351,"topics":11367,"summary":9732},[5728],{"title":9735,"path":9734,"lessonNumber":5714,"topics":11369,"summary":9736},[5728],{"title":5,"path":5730,"lessonNumber":5726,"topics":11371,"summary":5748},[5728],{"title":9739,"path":5710,"lessonNumber":11361,"topics":11373,"summary":9740},[5728],{"module":9744,"moduleNumber":5726,"slug":11375,"lessons":11376},"crystal-structure",[11377,11379,11381,11383],{"title":9743,"path":9742,"lessonNumber":11351,"topics":11378,"summary":9745},[9744],{"title":9748,"path":9747,"lessonNumber":5714,"topics":11380,"summary":9749},[9744],{"title":9752,"path":9751,"lessonNumber":5726,"topics":11382,"summary":9753},[9744],{"title":9756,"path":9755,"lessonNumber":11361,"topics":11384,"summary":9757},[9744],{"module":9761,"moduleNumber":11361,"slug":11386,"lessons":11387},"lattice-dynamics",[11388,11390,11392,11394],{"title":9760,"path":9759,"lessonNumber":11351,"topics":11389,"summary":9762},[9761],{"title":9765,"path":9764,"lessonNumber":5714,"topics":11391,"summary":9766},[9761],{"title":9769,"path":9768,"lessonNumber":5726,"topics":11393,"summary":9770},[9761],{"title":9773,"path":9772,"lessonNumber":11361,"topics":11395,"summary":9774},[9761],{"module":9778,"moduleNumber":11397,"slug":11398,"lessons":11399},5,"free-electron-fermi-gas",[11400,11402,11404,11406],{"title":9777,"path":9776,"lessonNumber":11351,"topics":11401,"summary":9779},[9778],{"title":9782,"path":9781,"lessonNumber":5714,"topics":11403,"summary":9783},[9778],{"title":9786,"path":9785,"lessonNumber":5726,"topics":11405,"summary":9787},[9778],{"title":9790,"path":9789,"lessonNumber":11361,"topics":11407,"summary":9791},[9778],{"module":9795,"moduleNumber":11409,"slug":11410,"lessons":11411},6,"band-theory",[11412,11414,11416,11418],{"title":9794,"path":9793,"lessonNumber":11351,"topics":11413,"summary":9796},[9795],{"title":9799,"path":9798,"lessonNumber":5714,"topics":11415,"summary":9800},[9795],{"title":9803,"path":9802,"lessonNumber":5726,"topics":11417,"summary":9804},[9795],{"title":9807,"path":9806,"lessonNumber":11361,"topics":11419,"summary":9808},[9795],{"module":9812,"moduleNumber":11421,"slug":11422,"lessons":11423},7,"semiconductors",[11424,11426,11428,11430,11432],{"title":9811,"path":9810,"lessonNumber":11351,"topics":11425,"summary":9813},[9812],{"title":9816,"path":9815,"lessonNumber":5714,"topics":11427,"summary":9817},[9812],{"title":9820,"path":9819,"lessonNumber":5726,"topics":11429,"summary":9821},[9812],{"title":9824,"path":9823,"lessonNumber":11361,"topics":11431,"summary":9825},[9812],{"title":9828,"path":9827,"lessonNumber":11397,"topics":11433,"summary":9829},[9812],{"module":9833,"moduleNumber":11435,"slug":11436,"lessons":11437},8,"dielectrics-and-ferroelectrics",[11438,11440],{"title":9832,"path":9831,"lessonNumber":11351,"topics":11439,"summary":9834},[9833],{"title":9837,"path":9836,"lessonNumber":5714,"topics":11441,"summary":9838},[9833],{"module":9842,"moduleNumber":11443,"slug":11444,"lessons":11445},9,"magnetism",[11446,11448,11450,11452],{"title":9841,"path":9840,"lessonNumber":11351,"topics":11447,"summary":9843},[9842],{"title":9846,"path":9845,"lessonNumber":5714,"topics":11449,"summary":9847},[9842],{"title":9850,"path":9849,"lessonNumber":5726,"topics":11451,"summary":9851},[9842],{"title":9854,"path":9853,"lessonNumber":11361,"topics":11453,"summary":9855},[9842],{"module":9859,"moduleNumber":11455,"slug":11456,"lessons":11457},10,"superconductivity",[11458,11460,11462,11464,11466],{"title":9858,"path":9857,"lessonNumber":11351,"topics":11459,"summary":9860},[9859],{"title":9863,"path":9862,"lessonNumber":5714,"topics":11461,"summary":9864},[9859],{"title":9867,"path":9866,"lessonNumber":5726,"topics":11463,"summary":9868},[9859],{"title":9871,"path":9870,"lessonNumber":11361,"topics":11465,"summary":9872},[9859],{"title":9875,"path":9874,"lessonNumber":11397,"topics":11467,"summary":9876},[9859],{"module":9880,"moduleNumber":11469,"slug":11470,"lessons":11471},11,"nanostructures",[11472,11474,11476,11478],{"title":9879,"path":9878,"lessonNumber":11351,"topics":11473,"summary":9881},[9880],{"title":9884,"path":9883,"lessonNumber":5714,"topics":11475,"summary":9885},[9880],{"title":9888,"path":9887,"lessonNumber":5726,"topics":11477,"summary":9889},[9880],{"title":9892,"path":9891,"lessonNumber":11361,"topics":11479,"summary":9893},[9880],"\u003Csvg style=\"width:100%;max-width:419.401px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 314.551 131.549\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-37.266 35.924h273.147\" style=\"stroke-width:.8\"\u002F>\u003Cg stroke=\"none\" font-size=\"7\">\u003Cg transform=\"translate(-23.884 2.256)\">\u003Cpath d=\"M-36.278 35.076Q-36.278 34.864-36.217 34.632Q-36.155 34.400-36.044 34.119Q-35.933 33.839-35.851 33.634Q-35.776 33.432-35.776 33.292Q-35.776 33.193-35.815 33.126Q-35.854 33.060-35.943 33.060Q-36.224 33.060-36.413 33.331Q-36.603 33.603-36.692 33.935Q-36.702 34-36.764 34L-36.873 34Q-36.904 34-36.928 33.969Q-36.952 33.938-36.952 33.914L-36.952 33.887Q-36.883 33.627-36.743 33.390Q-36.603 33.152-36.393 32.995Q-36.183 32.838-35.930 32.838Q-35.748 32.838-35.593 32.909Q-35.437 32.981-35.340 33.116Q-35.243 33.251-35.243 33.432Q-35.243 33.549-35.290 33.685Q-35.519 34.249-35.622 34.557Q-35.724 34.864-35.724 35.169Q-35.724 35.445-35.578 35.608Q-35.431 35.770-35.161 35.770Q-34.774 35.770-34.453 35.336Q-34.333 35.179-34.207 34.929Q-34.080 34.680-33.997 34.420Q-33.913 34.160-33.913 33.986Q-33.913 33.781-33.974 33.687Q-34.036 33.593-34.164 33.455Q-34.292 33.316-34.292 33.220Q-34.292 33.121-34.234 33.032Q-34.176 32.944-34.086 32.887Q-33.995 32.831-33.892 32.831Q-33.701 32.831-33.614 33Q-33.527 33.169-33.527 33.384Q-33.527 33.713-33.641 34.155Q-33.756 34.598-33.974 35.022Q-34.193 35.445-34.499 35.719Q-34.805 35.992-35.167 35.992Q-35.656 35.992-35.967 35.770Q-36.278 35.548-36.278 35.076\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.884 2.256)\">\u003Cpath d=\"M-25.257 35.117L-30.090 35.117Q-30.158 35.107-30.204 35.061Q-30.250 35.015-30.250 34.943Q-30.250 34.878-30.204 34.832Q-30.158 34.786-30.090 34.776L-25.257 34.776Q-25.188 34.786-25.142 34.832Q-25.096 34.878-25.096 34.943Q-25.096 35.015-25.142 35.061Q-25.188 35.107-25.257 35.117M-25.257 33.579L-30.090 33.579Q-30.158 33.569-30.204 33.523Q-30.250 33.477-30.250 33.405Q-30.250 33.261-30.090 33.237L-25.257 33.237Q-25.096 33.261-25.096 33.405Q-25.096 33.477-25.142 33.523Q-25.188 33.569-25.257 33.579\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.884 2.256)\">\u003Cpath d=\"M-20.334 36.064Q-20.969 36.064-21.333 35.719Q-21.698 35.374-21.833 34.849Q-21.968 34.324-21.968 33.699Q-21.968 32.674-21.612 31.975Q-21.257 31.276-20.334 31.276Q-19.407 31.276-19.055 31.975Q-18.703 32.674-18.703 33.699Q-18.703 34.324-18.838 34.849Q-18.973 35.374-19.336 35.719Q-19.698 36.064-20.334 36.064M-20.334 35.839Q-19.896 35.839-19.683 35.464Q-19.469 35.090-19.419 34.623Q-19.370 34.157-19.370 33.579Q-19.370 33.026-19.419 32.598Q-19.469 32.171-19.681 31.836Q-19.893 31.501-20.334 31.501Q-20.676 31.501-20.879 31.708Q-21.082 31.915-21.169 32.227Q-21.257 32.540-21.279 32.856Q-21.301 33.173-21.301 33.579Q-21.301 33.996-21.279 34.338Q-21.257 34.680-21.168 35.028Q-21.079 35.377-20.874 35.608Q-20.669 35.839-20.334 35.839\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-37.266 10.316h273.147\" style=\"stroke-width:.8\"\u002F>\u003Cg stroke=\"none\" font-size=\"7\">\u003Cg transform=\"translate(-23.884 -23.352)\">\u003Cpath d=\"M-36.278 35.076Q-36.278 34.864-36.217 34.632Q-36.155 34.400-36.044 34.119Q-35.933 33.839-35.851 33.634Q-35.776 33.432-35.776 33.292Q-35.776 33.193-35.815 33.126Q-35.854 33.060-35.943 33.060Q-36.224 33.060-36.413 33.331Q-36.603 33.603-36.692 33.935Q-36.702 34-36.764 34L-36.873 34Q-36.904 34-36.928 33.969Q-36.952 33.938-36.952 33.914L-36.952 33.887Q-36.883 33.627-36.743 33.390Q-36.603 33.152-36.393 32.995Q-36.183 32.838-35.930 32.838Q-35.748 32.838-35.593 32.909Q-35.437 32.981-35.340 33.116Q-35.243 33.251-35.243 33.432Q-35.243 33.549-35.290 33.685Q-35.519 34.249-35.622 34.557Q-35.724 34.864-35.724 35.169Q-35.724 35.445-35.578 35.608Q-35.431 35.770-35.161 35.770Q-34.774 35.770-34.453 35.336Q-34.333 35.179-34.207 34.929Q-34.080 34.680-33.997 34.420Q-33.913 34.160-33.913 33.986Q-33.913 33.781-33.974 33.687Q-34.036 33.593-34.164 33.455Q-34.292 33.316-34.292 33.220Q-34.292 33.121-34.234 33.032Q-34.176 32.944-34.086 32.887Q-33.995 32.831-33.892 32.831Q-33.701 32.831-33.614 33Q-33.527 33.169-33.527 33.384Q-33.527 33.713-33.641 34.155Q-33.756 34.598-33.974 35.022Q-34.193 35.445-34.499 35.719Q-34.805 35.992-35.167 35.992Q-35.656 35.992-35.967 35.770Q-36.278 35.548-36.278 35.076\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.884 -23.352)\">\u003Cpath d=\"M-25.257 35.117L-30.090 35.117Q-30.158 35.107-30.204 35.061Q-30.250 35.015-30.250 34.943Q-30.250 34.878-30.204 34.832Q-30.158 34.786-30.090 34.776L-25.257 34.776Q-25.188 34.786-25.142 34.832Q-25.096 34.878-25.096 34.943Q-25.096 35.015-25.142 35.061Q-25.188 35.107-25.257 35.117M-25.257 33.579L-30.090 33.579Q-30.158 33.569-30.204 33.523Q-30.250 33.477-30.250 33.405Q-30.250 33.261-30.090 33.237L-25.257 33.237Q-25.096 33.261-25.096 33.405Q-25.096 33.477-25.142 33.523Q-25.188 33.569-25.257 33.579\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.884 -23.352)\">\u003Cpath d=\"M-18.997 35.924L-21.527 35.924L-21.527 35.644Q-20.559 35.644-20.559 35.435L-20.559 31.816Q-20.952 32.004-21.574 32.004L-21.574 31.723Q-21.157 31.723-20.793 31.622Q-20.429 31.522-20.173 31.276L-20.047 31.276Q-19.982 31.293-19.965 31.361L-19.965 35.435Q-19.965 35.644-18.997 35.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-37.266-66.506h273.147\" style=\"stroke-dasharray:3.0,3.0\"\u002F>\u003Cg transform=\"translate(-28.338 -100)\">\u003Cpath d=\"M-35.362 35.897L-36.490 33.398Q-36.562 33.251-36.692 33.219Q-36.822 33.186-37.051 33.186L-37.051 32.906L-35.537 32.906L-35.537 33.186Q-35.889 33.186-35.889 33.333Q-35.889 33.378-35.878 33.398L-35.014 35.316L-34.234 33.586Q-34.200 33.518-34.200 33.439Q-34.200 33.326-34.284 33.256Q-34.368 33.186-34.487 33.186L-34.487 32.906L-33.291 32.906L-33.291 33.186Q-33.510 33.186-33.681 33.289Q-33.851 33.391-33.940 33.586L-34.976 35.897Q-35.024 35.992-35.130 35.992L-35.208 35.992Q-35.314 35.992-35.362 35.897M-31.134 35.924L-32.686 35.924L-32.686 35.644Q-32.460 35.644-32.312 35.610Q-32.163 35.575-32.163 35.435L-32.163 33.586Q-32.163 33.398-32.211 33.314Q-32.259 33.231-32.356 33.212Q-32.453 33.193-32.665 33.193L-32.665 32.913L-31.609 32.838L-31.609 35.435Q-31.609 35.575-31.478 35.610Q-31.346 35.644-31.134 35.644L-31.134 35.924M-32.406 31.617Q-32.406 31.446-32.283 31.327Q-32.160 31.207-31.989 31.207Q-31.821 31.207-31.698 31.327Q-31.575 31.446-31.575 31.617Q-31.575 31.792-31.698 31.915Q-31.821 32.038-31.989 32.038Q-32.160 32.038-32.283 31.915Q-32.406 31.792-32.406 31.617M-28.738 35.924L-30.474 35.924L-30.474 35.644Q-30.245 35.644-30.097 35.610Q-29.948 35.575-29.948 35.435L-29.948 33.586Q-29.948 33.316-30.056 33.255Q-30.163 33.193-30.474 33.193L-30.474 32.913L-29.446 32.838L-29.446 33.545Q-29.316 33.237-29.073 33.038Q-28.830 32.838-28.513 32.838Q-28.294 32.838-28.123 32.962Q-27.952 33.087-27.952 33.299Q-27.952 33.436-28.051 33.535Q-28.150 33.634-28.284 33.634Q-28.420 33.634-28.519 33.535Q-28.619 33.436-28.619 33.299Q-28.619 33.159-28.519 33.060Q-28.810 33.060-29.010 33.256Q-29.210 33.453-29.302 33.747Q-29.394 34.041-29.394 34.321L-29.394 35.435Q-29.394 35.644-28.738 35.644L-28.738 35.924M-26.841 35.083L-26.841 33.186L-27.480 33.186L-27.480 32.964Q-27.162 32.964-26.945 32.754Q-26.728 32.544-26.628 32.234Q-26.527 31.925-26.527 31.617L-26.260 31.617L-26.260 32.906L-25.183 32.906L-25.183 33.186L-26.260 33.186L-26.260 35.070Q-26.260 35.346-26.156 35.545Q-26.052 35.743-25.792 35.743Q-25.635 35.743-25.529 35.639Q-25.423 35.534-25.373 35.381Q-25.324 35.227-25.324 35.070L-25.324 34.656L-25.057 34.656L-25.057 35.083Q-25.057 35.309-25.156 35.519Q-25.255 35.729-25.440 35.861Q-25.624 35.992-25.853 35.992Q-26.291 35.992-26.566 35.755Q-26.841 35.517-26.841 35.083M-23.673 35.090L-23.673 33.586Q-23.673 33.316-23.780 33.255Q-23.888 33.193-24.199 33.193L-24.199 32.913L-23.092 32.838L-23.092 35.070L-23.092 35.090Q-23.092 35.370-23.040 35.514Q-22.989 35.657-22.847 35.714Q-22.705 35.770-22.418 35.770Q-22.165 35.770-21.960 35.630Q-21.755 35.490-21.639 35.264Q-21.523 35.039-21.523 34.789L-21.523 33.586Q-21.523 33.316-21.631 33.255Q-21.738 33.193-22.049 33.193L-22.049 32.913L-20.942 32.838L-20.942 35.251Q-20.942 35.442-20.889 35.524Q-20.836 35.606-20.735 35.625Q-20.634 35.644-20.419 35.644L-20.419 35.924L-21.495 35.992L-21.495 35.428Q-21.605 35.610-21.750 35.733Q-21.895 35.856-22.082 35.924Q-22.268 35.992-22.470 35.992Q-23.673 35.992-23.673 35.090M-19.773 35.196Q-19.773 34.864-19.549 34.637Q-19.325 34.410-18.982 34.282Q-18.638 34.153-18.266 34.101Q-17.893 34.048-17.589 34.048L-17.589 33.795Q-17.589 33.590-17.696 33.410Q-17.804 33.231-17.985 33.128Q-18.166 33.026-18.375 33.026Q-18.782 33.026-19.017 33.118Q-18.929 33.155-18.882 33.239Q-18.836 33.323-18.836 33.425Q-18.836 33.521-18.882 33.600Q-18.929 33.678-19.009 33.723Q-19.089 33.767-19.178 33.767Q-19.328 33.767-19.429 33.670Q-19.530 33.572-19.530 33.425Q-19.530 32.803-18.375 32.803Q-18.163 32.803-17.913 32.867Q-17.664 32.930-17.462 33.049Q-17.261 33.169-17.134 33.354Q-17.008 33.538-17.008 33.781L-17.008 35.357Q-17.008 35.473-16.946 35.569Q-16.885 35.664-16.772 35.664Q-16.662 35.664-16.598 35.570Q-16.533 35.476-16.533 35.357L-16.533 34.909L-16.266 34.909L-16.266 35.357Q-16.266 35.627-16.493 35.792Q-16.721 35.958-17.001 35.958Q-17.209 35.958-17.346 35.804Q-17.483 35.651-17.507 35.435Q-17.654 35.702-17.936 35.847Q-18.218 35.992-18.542 35.992Q-18.819 35.992-19.103 35.917Q-19.387 35.842-19.580 35.663Q-19.773 35.483-19.773 35.196M-19.158 35.196Q-19.158 35.370-19.057 35.500Q-18.956 35.630-18.800 35.700Q-18.645 35.770-18.481 35.770Q-18.262 35.770-18.054 35.673Q-17.845 35.575-17.717 35.394Q-17.589 35.213-17.589 34.987L-17.589 34.259Q-17.913 34.259-18.279 34.350Q-18.645 34.441-18.901 34.653Q-19.158 34.864-19.158 35.196M-14.181 35.924L-15.784 35.924L-15.784 35.644Q-15.558 35.644-15.410 35.610Q-15.261 35.575-15.261 35.435L-15.261 31.816Q-15.261 31.546-15.369 31.484Q-15.476 31.423-15.784 31.423L-15.784 31.142L-14.707 31.067L-14.707 35.435Q-14.707 35.572-14.557 35.608Q-14.407 35.644-14.181 35.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-8.813 35.354v-97.838\"\u002F>\u003Cpath stroke=\"none\" d=\"m-8.813-65.084-2.08 4.16 2.08-1.56 2.08 1.56\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M8.259-65.084v97.838\"\u002F>\u003Cpath stroke=\"none\" d=\"m8.259 35.354 2.08-4.16-2.08 1.56-2.08-1.56\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(21.857 12.662)\">\u003Cpath d=\"M-34.767 35.924L-36.873 35.924L-36.873 35.644Q-36.152 35.644-36.152 35.435L-36.152 31.634Q-36.152 31.423-36.873 31.423L-36.873 31.142L-34.535 31.142Q-34.224 31.142-33.881 31.216Q-33.537 31.289-33.216 31.445Q-32.894 31.600-32.693 31.846Q-32.491 32.092-32.491 32.417Q-32.491 32.704-32.679 32.935Q-32.867 33.166-33.144 33.314Q-33.421 33.463-33.711 33.545Q-33.376 33.648-33.142 33.880Q-32.908 34.112-32.864 34.441L-32.778 35.049Q-32.751 35.261-32.705 35.430Q-32.659 35.599-32.554 35.719Q-32.450 35.839-32.262 35.839Q-32.047 35.839-31.931 35.654Q-31.814 35.469-31.814 35.237Q-31.797 35.172-31.722 35.155L-31.630 35.155Q-31.548 35.175-31.548 35.257Q-31.548 35.463-31.638 35.649Q-31.729 35.835-31.895 35.950Q-32.060 36.064-32.262 36.064Q-32.600 36.064-32.894 35.963Q-33.188 35.862-33.373 35.640Q-33.558 35.418-33.558 35.070L-33.558 34.461Q-33.558 34.212-33.701 34.025Q-33.845 33.839-34.068 33.740Q-34.292 33.641-34.542 33.641L-35.489 33.641L-35.489 35.435Q-35.489 35.644-34.767 35.644L-34.767 35.924M-35.489 31.634L-35.489 33.419L-34.634 33.419Q-34.347 33.419-34.108 33.376Q-33.869 33.333-33.681 33.224Q-33.493 33.114-33.381 32.916Q-33.270 32.718-33.270 32.417Q-33.270 31.840-33.638 31.631Q-34.005 31.423-34.634 31.423L-35.123 31.423Q-35.311 31.423-35.400 31.457Q-35.489 31.491-35.489 31.634M-31.090 35.196Q-31.090 34.864-30.866 34.637Q-30.642 34.410-30.298 34.282Q-29.955 34.153-29.582 34.101Q-29.210 34.048-28.906 34.048L-28.906 33.795Q-28.906 33.590-29.013 33.410Q-29.121 33.231-29.302 33.128Q-29.483 33.026-29.692 33.026Q-30.099 33.026-30.334 33.118Q-30.245 33.155-30.199 33.239Q-30.153 33.323-30.153 33.425Q-30.153 33.521-30.199 33.600Q-30.245 33.678-30.326 33.723Q-30.406 33.767-30.495 33.767Q-30.645 33.767-30.746 33.670Q-30.847 33.572-30.847 33.425Q-30.847 32.803-29.692 32.803Q-29.480 32.803-29.230 32.867Q-28.981 32.930-28.779 33.049Q-28.578 33.169-28.451 33.354Q-28.325 33.538-28.325 33.781L-28.325 35.357Q-28.325 35.473-28.263 35.569Q-28.202 35.664-28.089 35.664Q-27.979 35.664-27.914 35.570Q-27.849 35.476-27.849 35.357L-27.849 34.909L-27.583 34.909L-27.583 35.357Q-27.583 35.627-27.810 35.792Q-28.037 35.958-28.318 35.958Q-28.526 35.958-28.663 35.804Q-28.800 35.651-28.824 35.435Q-28.971 35.702-29.253 35.847Q-29.535 35.992-29.859 35.992Q-30.136 35.992-30.420 35.917Q-30.703 35.842-30.897 35.663Q-31.090 35.483-31.090 35.196M-30.474 35.196Q-30.474 35.370-30.374 35.500Q-30.273 35.630-30.117 35.700Q-29.962 35.770-29.798 35.770Q-29.579 35.770-29.370 35.673Q-29.162 35.575-29.034 35.394Q-28.906 35.213-28.906 34.987L-28.906 34.259Q-29.230 34.259-29.596 34.350Q-29.962 34.441-30.218 34.653Q-30.474 34.864-30.474 35.196\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(21.857 12.662)\">\u003Cpath d=\"M-27.041 37.059Q-26.911 37.127-26.774 37.127Q-26.603 37.127-26.453 37.038Q-26.302 36.949-26.191 36.804Q-26.080 36.659-26.002 36.491L-25.738 35.924L-26.907 33.398Q-26.982 33.251-27.112 33.219Q-27.242 33.186-27.475 33.186L-27.475 32.906L-25.954 32.906L-25.954 33.186Q-26.302 33.186-26.302 33.333Q-26.299 33.354-26.297 33.371Q-26.295 33.388-26.295 33.398L-25.438 35.257L-24.665 33.586Q-24.631 33.518-24.631 33.439Q-24.631 33.326-24.715 33.256Q-24.798 33.186-24.911 33.186L-24.911 32.906L-23.715 32.906L-23.715 33.186Q-23.934 33.186-24.106 33.290Q-24.279 33.395-24.371 33.586L-25.708 36.491Q-25.878 36.861-26.148 37.107Q-26.419 37.353-26.774 37.353Q-27.044 37.353-27.263 37.187Q-27.482 37.021-27.482 36.758Q-27.482 36.621-27.389 36.532Q-27.297 36.444-27.157 36.444Q-27.020 36.444-26.931 36.532Q-26.842 36.621-26.842 36.758Q-26.842 36.861-26.895 36.939Q-26.948 37.018-27.041 37.059M-21.507 35.924L-23.110 35.924L-23.110 35.644Q-22.884 35.644-22.736 35.610Q-22.587 35.575-22.587 35.435L-22.587 31.816Q-22.587 31.546-22.695 31.484Q-22.802 31.423-23.110 31.423L-23.110 31.142L-22.033 31.067L-22.033 35.435Q-22.033 35.572-21.883 35.608Q-21.732 35.644-21.507 35.644L-21.507 35.924M-20.953 34.389Q-20.953 34.068-20.828 33.779Q-20.704 33.490-20.478 33.267Q-20.253 33.043-19.957 32.923Q-19.661 32.803-19.343 32.803Q-19.015 32.803-18.754 32.903Q-18.492 33.002-18.316 33.184Q-18.140 33.367-18.046 33.625Q-17.952 33.883-17.952 34.215Q-17.952 34.307-18.034 34.328L-20.290 34.328L-20.290 34.389Q-20.290 34.977-20.006 35.360Q-19.723 35.743-19.155 35.743Q-18.834 35.743-18.566 35.550Q-18.297 35.357-18.209 35.042Q-18.202 35.001-18.127 34.987L-18.034 34.987Q-17.952 35.011-17.952 35.083Q-17.952 35.090-17.959 35.117Q-18.072 35.514-18.443 35.753Q-18.814 35.992-19.237 35.992Q-19.675 35.992-20.075 35.784Q-20.475 35.575-20.714 35.208Q-20.953 34.841-20.953 34.389M-20.283 34.119L-18.468 34.119Q-18.468 33.842-18.566 33.590Q-18.663 33.337-18.861 33.181Q-19.060 33.026-19.343 33.026Q-19.620 33.026-19.834 33.184Q-20.047 33.343-20.165 33.598Q-20.283 33.853-20.283 34.119M-15.748 35.924L-17.299 35.924L-17.299 35.644Q-17.074 35.644-16.925 35.610Q-16.776 35.575-16.776 35.435L-16.776 33.586Q-16.776 33.398-16.824 33.314Q-16.872 33.231-16.970 33.212Q-17.067 33.193-17.279 33.193L-17.279 32.913L-16.223 32.838L-16.223 35.435Q-16.223 35.575-16.091 35.610Q-15.960 35.644-15.748 35.644L-15.748 35.924M-17.019 31.617Q-17.019 31.446-16.896 31.327Q-16.773 31.207-16.602 31.207Q-16.435 31.207-16.312 31.327Q-16.189 31.446-16.189 31.617Q-16.189 31.792-16.312 31.915Q-16.435 32.038-16.602 32.038Q-16.773 32.038-16.896 31.915Q-17.019 31.792-17.019 31.617M-15.143 36.457Q-15.143 36.211-14.946 36.027Q-14.750 35.842-14.493 35.763Q-14.630 35.651-14.702 35.490Q-14.773 35.329-14.773 35.148Q-14.773 34.827-14.562 34.581Q-14.897 34.283-14.897 33.873Q-14.897 33.412-14.507 33.125Q-14.117 32.838-13.639 32.838Q-13.167 32.838-12.832 33.084Q-12.658 32.930-12.448 32.848Q-12.237 32.766-12.008 32.766Q-11.844 32.766-11.723 32.873Q-11.602 32.981-11.602 33.145Q-11.602 33.241-11.673 33.313Q-11.745 33.384-11.837 33.384Q-11.937 33.384-12.007 33.311Q-12.077 33.237-12.077 33.138Q-12.077 33.084-12.063 33.053L-12.056 33.039Q-12.049 33.019-12.041 33.008Q-12.032 32.998-12.029 32.991Q-12.384 32.991-12.671 33.214Q-12.384 33.507-12.384 33.873Q-12.384 34.188-12.569 34.420Q-12.753 34.653-13.042 34.781Q-13.331 34.909-13.639 34.909Q-13.840 34.909-14.032 34.859Q-14.223 34.810-14.401 34.700Q-14.493 34.827-14.493 34.970Q-14.493 35.152-14.365 35.287Q-14.237 35.422-14.052 35.422L-13.420 35.422Q-12.972 35.422-12.603 35.493Q-12.234 35.565-11.974 35.794Q-11.714 36.023-11.714 36.457Q-11.714 36.778-12.010 36.980Q-12.306 37.182-12.709 37.271Q-13.112 37.360-13.427 37.360Q-13.745 37.360-14.148 37.271Q-14.551 37.182-14.847 36.980Q-15.143 36.778-15.143 36.457M-14.688 36.457Q-14.688 36.686-14.469 36.835Q-14.251 36.984-13.958 37.052Q-13.666 37.120-13.427 37.120Q-13.263 37.120-13.054 37.084Q-12.846 37.049-12.639 36.968Q-12.432 36.888-12.301 36.760Q-12.169 36.632-12.169 36.457Q-12.169 36.105-12.550 36.011Q-12.931 35.917-13.434 35.917L-14.052 35.917Q-14.292 35.917-14.490 36.068Q-14.688 36.218-14.688 36.457M-13.639 34.670Q-12.972 34.670-12.972 33.873Q-12.972 33.073-13.639 33.073Q-14.309 33.073-14.309 33.873Q-14.309 34.670-13.639 34.670M-9.438 35.924L-11.072 35.924L-11.072 35.644Q-10.843 35.644-10.694 35.610Q-10.545 35.575-10.545 35.435L-10.545 31.816Q-10.545 31.546-10.653 31.484Q-10.761 31.423-11.072 31.423L-11.072 31.142L-9.992 31.067L-9.992 33.453Q-9.886 33.268-9.708 33.126Q-9.530 32.985-9.322 32.911Q-9.113 32.838-8.888 32.838Q-8.382 32.838-8.098 33.061Q-7.815 33.285-7.815 33.781L-7.815 35.435Q-7.815 35.572-7.666 35.608Q-7.517 35.644-7.292 35.644L-7.292 35.924L-8.922 35.924L-8.922 35.644Q-8.693 35.644-8.544 35.610Q-8.396 35.575-8.396 35.435L-8.396 33.795Q-8.396 33.460-8.515 33.260Q-8.635 33.060-8.949 33.060Q-9.219 33.060-9.453 33.196Q-9.688 33.333-9.826 33.567Q-9.964 33.801-9.964 34.075L-9.964 35.435Q-9.964 35.572-9.814 35.608Q-9.664 35.644-9.438 35.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M76.545 35.354v-97.838\"\u002F>\u003Cpath stroke=\"none\" d=\"m76.545-65.084-2.08 4.16 2.08-1.56 2.08 1.56\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M93.617-65.084V7.147\"\u002F>\u003Cpath stroke=\"none\" d=\"m93.617 9.747 2.08-4.16-2.08 1.56-2.08-1.56\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(111.228 12.662)\">\u003Cpath d=\"M-36.777 35.986L-36.777 34.413Q-36.777 34.386-36.752 34.360Q-36.726 34.335-36.699 34.335L-36.586 34.335Q-36.558 34.335-36.535 34.362Q-36.511 34.389-36.511 34.413Q-36.511 34.758-36.379 35.022Q-36.247 35.285-36.018 35.454Q-35.789 35.623-35.487 35.704Q-35.184 35.784-34.843 35.784Q-34.576 35.784-34.340 35.656Q-34.104 35.528-33.959 35.305Q-33.814 35.083-33.814 34.817Q-33.814 34.594-33.920 34.398Q-34.026 34.201-34.207 34.066Q-34.388 33.931-34.614 33.880L-35.642 33.648Q-35.953 33.576-36.213 33.390Q-36.473 33.203-36.625 32.932Q-36.777 32.660-36.777 32.345Q-36.777 31.959-36.564 31.652Q-36.350 31.344-36.003 31.173Q-35.656 31.002-35.277 31.002Q-35.048 31.002-34.819 31.055Q-34.590 31.108-34.391 31.216Q-34.193 31.323-34.039 31.487L-33.745 31.047Q-33.722 31.002-33.681 31.002L-33.633 31.002Q-33.602 31.002-33.580 31.028Q-33.558 31.053-33.558 31.081L-33.558 32.656Q-33.558 32.677-33.581 32.704Q-33.605 32.732-33.633 32.732L-33.745 32.732Q-33.807 32.732-33.821 32.656Q-33.862 32.243-34.043 31.923Q-34.224 31.604-34.535 31.429Q-34.846 31.255-35.277 31.255Q-35.526 31.255-35.766 31.366Q-36.005 31.477-36.155 31.675Q-36.306 31.874-36.306 32.137Q-36.306 32.349-36.198 32.530Q-36.090 32.711-35.914 32.831Q-35.738 32.950-35.530 32.991L-34.501 33.220Q-34.183 33.292-33.916 33.497Q-33.650 33.702-33.498 33.996Q-33.346 34.290-33.346 34.622Q-33.346 35.015-33.551 35.350Q-33.756 35.685-34.101 35.874Q-34.446 36.064-34.843 36.064Q-35.263 36.064-35.642 35.951Q-36.022 35.839-36.292 35.589L-36.586 36.023Q-36.613 36.064-36.651 36.064L-36.699 36.064Q-36.726 36.064-36.752 36.039Q-36.777 36.013-36.777 35.986M-32.009 35.083L-32.009 33.186L-32.648 33.186L-32.648 32.964Q-32.330 32.964-32.113 32.754Q-31.896 32.544-31.796 32.234Q-31.695 31.925-31.695 31.617L-31.428 31.617L-31.428 32.906L-30.351 32.906L-30.351 33.186L-31.428 33.186L-31.428 35.070Q-31.428 35.346-31.324 35.545Q-31.220 35.743-30.960 35.743Q-30.803 35.743-30.697 35.639Q-30.591 35.534-30.541 35.381Q-30.492 35.227-30.492 35.070L-30.492 34.656L-30.225 34.656L-30.225 35.083Q-30.225 35.309-30.324 35.519Q-30.423 35.729-30.608 35.861Q-30.792 35.992-31.021 35.992Q-31.459 35.992-31.734 35.755Q-32.009 35.517-32.009 35.083M-29.456 34.441Q-29.456 34.099-29.321 33.800Q-29.186 33.501-28.947 33.277Q-28.707 33.053-28.390 32.928Q-28.072 32.803-27.740 32.803Q-27.296 32.803-26.896 33.019Q-26.496 33.234-26.262 33.612Q-26.028 33.989-26.028 34.441Q-26.028 34.782-26.170 35.066Q-26.311 35.350-26.556 35.557Q-26.800 35.763-27.110 35.878Q-27.419 35.992-27.740 35.992Q-28.171 35.992-28.572 35.791Q-28.974 35.589-29.215 35.237Q-29.456 34.885-29.456 34.441M-27.740 35.743Q-27.139 35.743-26.915 35.365Q-26.691 34.987-26.691 34.355Q-26.691 33.743-26.925 33.384Q-27.159 33.026-27.740 33.026Q-28.793 33.026-28.793 34.355Q-28.793 34.987-28.567 35.365Q-28.342 35.743-27.740 35.743M-23.837 35.924L-25.419 35.924L-25.419 35.644Q-25.190 35.644-25.042 35.610Q-24.893 35.575-24.893 35.435L-24.893 31.816Q-24.893 31.546-25.001 31.484Q-25.108 31.423-25.419 31.423L-25.419 31.142L-24.339 31.067L-24.339 34.355L-23.355 33.586Q-23.150 33.449-23.150 33.299Q-23.150 33.255-23.191 33.220Q-23.232 33.186-23.276 33.186L-23.276 32.906L-21.912 32.906L-21.912 33.186Q-22.401 33.186-22.921 33.586L-23.478 34.020L-22.500 35.244Q-22.299 35.490-22.165 35.567Q-22.032 35.644-21.745 35.644L-21.745 35.924L-23.177 35.924L-23.177 35.644Q-22.989 35.644-22.989 35.531Q-22.989 35.435-23.143 35.244L-23.878 34.335L-24.360 34.714L-24.360 35.435Q-24.360 35.572-24.211 35.608Q-24.062 35.644-23.837 35.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(111.228 12.662)\">\u003Cpath d=\"M-21.479 34.389Q-21.479 34.068-21.354 33.779Q-21.229 33.490-21.003 33.267Q-20.778 33.043-20.482 32.923Q-20.187 32.803-19.869 32.803Q-19.541 32.803-19.279 32.903Q-19.018 33.002-18.842 33.184Q-18.666 33.367-18.572 33.625Q-18.478 33.883-18.478 34.215Q-18.478 34.307-18.560 34.328L-20.815 34.328L-20.815 34.389Q-20.815 34.977-20.532 35.360Q-20.248 35.743-19.681 35.743Q-19.359 35.743-19.091 35.550Q-18.823 35.357-18.734 35.042Q-18.727 35.001-18.652 34.987L-18.560 34.987Q-18.478 35.011-18.478 35.083Q-18.478 35.090-18.484 35.117Q-18.597 35.514-18.968 35.753Q-19.339 35.992-19.763 35.992Q-20.200 35.992-20.600 35.784Q-21 35.575-21.239 35.208Q-21.479 34.841-21.479 34.389M-20.809 34.119L-18.994 34.119Q-18.994 33.842-19.091 33.590Q-19.189 33.337-19.387 33.181Q-19.585 33.026-19.869 33.026Q-20.146 33.026-20.359 33.184Q-20.573 33.343-20.691 33.598Q-20.809 33.853-20.809 34.119M-17.890 35.917L-17.890 34.854Q-17.890 34.830-17.862 34.803Q-17.835 34.776-17.811 34.776L-17.702 34.776Q-17.637 34.776-17.623 34.834Q-17.527 35.268-17.281 35.519Q-17.035 35.770-16.622 35.770Q-16.280 35.770-16.027 35.637Q-15.774 35.504-15.774 35.196Q-15.774 35.039-15.868 34.924Q-15.962 34.810-16.100 34.741Q-16.239 34.673-16.406 34.635L-16.987 34.536Q-17.343 34.468-17.616 34.247Q-17.890 34.027-17.890 33.685Q-17.890 33.436-17.779 33.261Q-17.668 33.087-17.481 32.988Q-17.295 32.889-17.080 32.846Q-16.864 32.803-16.622 32.803Q-16.208 32.803-15.928 32.985L-15.712 32.810Q-15.702 32.807-15.695 32.805Q-15.689 32.803-15.678 32.803L-15.627 32.803Q-15.600 32.803-15.576 32.827Q-15.552 32.851-15.552 32.879L-15.552 33.726Q-15.552 33.747-15.576 33.774Q-15.600 33.801-15.627 33.801L-15.740 33.801Q-15.767 33.801-15.793 33.776Q-15.818 33.750-15.818 33.726Q-15.818 33.490-15.924 33.326Q-16.030 33.162-16.213 33.080Q-16.396 32.998-16.628 32.998Q-16.957 32.998-17.213 33.101Q-17.469 33.203-17.469 33.480Q-17.469 33.675-17.286 33.784Q-17.104 33.894-16.875 33.935L-16.300 34.041Q-16.054 34.089-15.841 34.217Q-15.627 34.345-15.490 34.548Q-15.354 34.752-15.354 35.001Q-15.354 35.514-15.719 35.753Q-16.085 35.992-16.622 35.992Q-17.117 35.992-17.449 35.698L-17.715 35.972Q-17.736 35.992-17.763 35.992L-17.811 35.992Q-17.835 35.992-17.862 35.965Q-17.890 35.938-17.890 35.917\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M173.284 9.747v-72.23\"\u002F>\u003Cpath stroke=\"none\" d=\"m173.284-65.084-2.08 4.16 2.08-1.56 2.08 1.56\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M190.356-65.084v97.838\"\u002F>\u003Cpath stroke=\"none\" d=\"m190.356 35.354 2.08-4.16-2.08 1.56-2.08-1.56\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(199.832 12.662)\">\u003Cpath d=\"M-36.893 35.196Q-36.893 34.864-36.670 34.637Q-36.446 34.410-36.102 34.282Q-35.759 34.153-35.386 34.101Q-35.014 34.048-34.709 34.048L-34.709 33.795Q-34.709 33.590-34.817 33.410Q-34.925 33.231-35.106 33.128Q-35.287 33.026-35.495 33.026Q-35.902 33.026-36.138 33.118Q-36.049 33.155-36.003 33.239Q-35.957 33.323-35.957 33.425Q-35.957 33.521-36.003 33.600Q-36.049 33.678-36.130 33.723Q-36.210 33.767-36.299 33.767Q-36.449 33.767-36.550 33.670Q-36.651 33.572-36.651 33.425Q-36.651 32.803-35.495 32.803Q-35.284 32.803-35.034 32.867Q-34.785 32.930-34.583 33.049Q-34.381 33.169-34.255 33.354Q-34.128 33.538-34.128 33.781L-34.128 35.357Q-34.128 35.473-34.067 35.569Q-34.005 35.664-33.892 35.664Q-33.783 35.664-33.718 35.570Q-33.653 35.476-33.653 35.357L-33.653 34.909L-33.387 34.909L-33.387 35.357Q-33.387 35.627-33.614 35.792Q-33.841 35.958-34.121 35.958Q-34.330 35.958-34.467 35.804Q-34.603 35.651-34.627 35.435Q-34.774 35.702-35.056 35.847Q-35.338 35.992-35.663 35.992Q-35.940 35.992-36.224 35.917Q-36.507 35.842-36.700 35.663Q-36.893 35.483-36.893 35.196M-36.278 35.196Q-36.278 35.370-36.177 35.500Q-36.077 35.630-35.921 35.700Q-35.766 35.770-35.601 35.770Q-35.383 35.770-35.174 35.673Q-34.966 35.575-34.838 35.394Q-34.709 35.213-34.709 34.987L-34.709 34.259Q-35.034 34.259-35.400 34.350Q-35.766 34.441-36.022 34.653Q-36.278 34.864-36.278 35.196M-31.288 35.924L-32.922 35.924L-32.922 35.644Q-32.693 35.644-32.544 35.610Q-32.395 35.575-32.395 35.435L-32.395 33.586Q-32.395 33.316-32.503 33.255Q-32.611 33.193-32.922 33.193L-32.922 32.913L-31.862 32.838L-31.862 33.487Q-31.691 33.179-31.387 33.008Q-31.083 32.838-30.738 32.838Q-30.232 32.838-29.948 33.061Q-29.664 33.285-29.664 33.781L-29.664 35.435Q-29.664 35.572-29.516 35.608Q-29.367 35.644-29.141 35.644L-29.141 35.924L-30.772 35.924L-30.772 35.644Q-30.543 35.644-30.394 35.610Q-30.245 35.575-30.245 35.435L-30.245 33.795Q-30.245 33.460-30.365 33.260Q-30.485 33.060-30.799 33.060Q-31.069 33.060-31.303 33.196Q-31.537 33.333-31.676 33.567Q-31.814 33.801-31.814 34.075L-31.814 35.435Q-31.814 35.572-31.664 35.608Q-31.514 35.644-31.288 35.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.832 12.662)\">\u003Cpath d=\"M-28.237 35.083L-28.237 33.186L-28.876 33.186L-28.876 32.964Q-28.558 32.964-28.341 32.754Q-28.124 32.544-28.024 32.234Q-27.923 31.925-27.923 31.617L-27.656 31.617L-27.656 32.906L-26.579 32.906L-26.579 33.186L-27.656 33.186L-27.656 35.070Q-27.656 35.346-27.552 35.545Q-27.448 35.743-27.188 35.743Q-27.031 35.743-26.925 35.639Q-26.819 35.534-26.769 35.381Q-26.720 35.227-26.720 35.070L-26.720 34.656L-26.453 34.656L-26.453 35.083Q-26.453 35.309-26.552 35.519Q-26.651 35.729-26.836 35.861Q-27.020 35.992-27.249 35.992Q-27.687 35.992-27.962 35.755Q-28.237 35.517-28.237 35.083M-24.026 35.924L-25.578 35.924L-25.578 35.644Q-25.352 35.644-25.204 35.610Q-25.055 35.575-25.055 35.435L-25.055 33.586Q-25.055 33.398-25.103 33.314Q-25.151 33.231-25.248 33.212Q-25.346 33.193-25.557 33.193L-25.557 32.913L-24.501 32.838L-24.501 35.435Q-24.501 35.575-24.370 35.610Q-24.238 35.644-24.026 35.644L-24.026 35.924M-25.298 31.617Q-25.298 31.446-25.175 31.327Q-25.052 31.207-24.881 31.207Q-24.713 31.207-24.590 31.327Q-24.467 31.446-24.467 31.617Q-24.467 31.792-24.590 31.915Q-24.713 32.038-24.881 32.038Q-25.052 32.038-25.175 31.915Q-25.298 31.792-25.298 31.617M-21.497 34.670L-23.555 34.670L-23.555 34.167L-21.497 34.167L-21.497 34.670M-20.519 35.986L-20.519 34.413Q-20.519 34.386-20.494 34.360Q-20.468 34.335-20.441 34.335L-20.328 34.335Q-20.301 34.335-20.277 34.362Q-20.253 34.389-20.253 34.413Q-20.253 34.758-20.121 35.022Q-19.990 35.285-19.761 35.454Q-19.532 35.623-19.229 35.704Q-18.927 35.784-18.585 35.784Q-18.318 35.784-18.082 35.656Q-17.847 35.528-17.701 35.305Q-17.556 35.083-17.556 34.817Q-17.556 34.594-17.662 34.398Q-17.768 34.201-17.949 34.066Q-18.130 33.931-18.356 33.880L-19.385 33.648Q-19.696 33.576-19.955 33.390Q-20.215 33.203-20.367 32.932Q-20.519 32.660-20.519 32.345Q-20.519 31.959-20.306 31.652Q-20.092 31.344-19.745 31.173Q-19.398 31.002-19.019 31.002Q-18.790 31.002-18.561 31.055Q-18.332 31.108-18.134 31.216Q-17.935 31.323-17.782 31.487L-17.488 31.047Q-17.464 31.002-17.423 31.002L-17.375 31.002Q-17.344 31.002-17.322 31.028Q-17.300 31.053-17.300 31.081L-17.300 32.656Q-17.300 32.677-17.324 32.704Q-17.348 32.732-17.375 32.732L-17.488 32.732Q-17.549 32.732-17.563 32.656Q-17.604 32.243-17.785 31.923Q-17.966 31.604-18.277 31.429Q-18.588 31.255-19.019 31.255Q-19.268 31.255-19.508 31.366Q-19.747 31.477-19.897 31.675Q-20.048 31.874-20.048 32.137Q-20.048 32.349-19.940 32.530Q-19.832 32.711-19.656 32.831Q-19.480 32.950-19.272 32.991L-18.243 33.220Q-17.925 33.292-17.659 33.497Q-17.392 33.702-17.240 33.996Q-17.088 34.290-17.088 34.622Q-17.088 35.015-17.293 35.350Q-17.498 35.685-17.843 35.874Q-18.188 36.064-18.585 36.064Q-19.005 36.064-19.385 35.951Q-19.764 35.839-20.034 35.589L-20.328 36.023Q-20.355 36.064-20.393 36.064L-20.441 36.064Q-20.468 36.064-20.494 36.039Q-20.519 36.013-20.519 35.986M-15.751 35.083L-15.751 33.186L-16.390 33.186L-16.390 32.964Q-16.073 32.964-15.856 32.754Q-15.639 32.544-15.538 32.234Q-15.437 31.925-15.437 31.617L-15.170 31.617L-15.170 32.906L-14.094 32.906L-14.094 33.186L-15.170 33.186L-15.170 35.070Q-15.170 35.346-15.066 35.545Q-14.962 35.743-14.702 35.743Q-14.545 35.743-14.439 35.639Q-14.333 35.534-14.283 35.381Q-14.234 35.227-14.234 35.070L-14.234 34.656L-13.967 34.656L-13.967 35.083Q-13.967 35.309-14.066 35.519Q-14.165 35.729-14.350 35.861Q-14.535 35.992-14.764 35.992Q-15.201 35.992-15.476 35.755Q-15.751 35.517-15.751 35.083M-13.198 34.441Q-13.198 34.099-13.063 33.800Q-12.928 33.501-12.689 33.277Q-12.450 33.053-12.132 32.928Q-11.814 32.803-11.482 32.803Q-11.038 32.803-10.638 33.019Q-10.238 33.234-10.004 33.612Q-9.770 33.989-9.770 34.441Q-9.770 34.782-9.912 35.066Q-10.054 35.350-10.298 35.557Q-10.542 35.763-10.852 35.878Q-11.161 35.992-11.482 35.992Q-11.913 35.992-12.315 35.791Q-12.716 35.589-12.957 35.237Q-13.198 34.885-13.198 34.441M-11.482 35.743Q-10.881 35.743-10.657 35.365Q-10.433 34.987-10.433 34.355Q-10.433 33.743-10.667 33.384Q-10.901 33.026-11.482 33.026Q-12.535 33.026-12.535 34.355Q-12.535 34.987-12.309 35.365Q-12.084 35.743-11.482 35.743M-7.579 35.924L-9.161 35.924L-9.161 35.644Q-8.932 35.644-8.784 35.610Q-8.635 35.575-8.635 35.435L-8.635 31.816Q-8.635 31.546-8.743 31.484Q-8.850 31.423-9.161 31.423L-9.161 31.142L-8.081 31.067L-8.081 34.355L-7.097 33.586Q-6.892 33.449-6.892 33.299Q-6.892 33.255-6.933 33.220Q-6.974 33.186-7.018 33.186L-7.018 32.906L-5.655 32.906L-5.655 33.186Q-6.143 33.186-6.663 33.586L-7.220 34.020L-6.243 35.244Q-6.041 35.490-5.908 35.567Q-5.774 35.644-5.487 35.644L-5.487 35.924L-6.919 35.924L-6.919 35.644Q-6.731 35.644-6.731 35.531Q-6.731 35.435-6.885 35.244L-7.620 34.335L-8.102 34.714L-8.102 35.435Q-8.102 35.572-7.953 35.608Q-7.805 35.644-7.579 35.644\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(199.832 12.662)\">\u003Cpath d=\"M-5.208 34.389Q-5.208 34.068-5.083 33.779Q-4.958 33.490-4.732 33.267Q-4.507 33.043-4.211 32.923Q-3.916 32.803-3.598 32.803Q-3.270 32.803-3.008 32.903Q-2.747 33.002-2.571 33.184Q-2.395 33.367-2.301 33.625Q-2.207 33.883-2.207 34.215Q-2.207 34.307-2.289 34.328L-4.544 34.328L-4.544 34.389Q-4.544 34.977-4.261 35.360Q-3.977 35.743-3.410 35.743Q-3.088 35.743-2.820 35.550Q-2.552 35.357-2.463 35.042Q-2.456 35.001-2.381 34.987L-2.289 34.987Q-2.207 35.011-2.207 35.083Q-2.207 35.090-2.213 35.117Q-2.326 35.514-2.697 35.753Q-3.068 35.992-3.492 35.992Q-3.929 35.992-4.329 35.784Q-4.729 35.575-4.968 35.208Q-5.208 34.841-5.208 34.389M-4.538 34.119L-2.723 34.119Q-2.723 33.842-2.820 33.590Q-2.918 33.337-3.116 33.181Q-3.314 33.026-3.598 33.026Q-3.875 33.026-4.088 33.184Q-4.302 33.343-4.420 33.598Q-4.538 33.853-4.538 34.119M-1.619 35.917L-1.619 34.854Q-1.619 34.830-1.591 34.803Q-1.564 34.776-1.540 34.776L-1.431 34.776Q-1.366 34.776-1.352 34.834Q-1.256 35.268-1.010 35.519Q-0.764 35.770-0.351 35.770Q-0.009 35.770 0.244 35.637Q0.497 35.504 0.497 35.196Q0.497 35.039 0.403 34.924Q0.309 34.810 0.171 34.741Q0.032 34.673-0.135 34.635L-0.716 34.536Q-1.072 34.468-1.345 34.247Q-1.619 34.027-1.619 33.685Q-1.619 33.436-1.508 33.261Q-1.397 33.087-1.210 32.988Q-1.024 32.889-0.809 32.846Q-0.593 32.803-0.351 32.803Q0.063 32.803 0.343 32.985L0.559 32.810Q0.569 32.807 0.576 32.805Q0.582 32.803 0.593 32.803L0.644 32.803Q0.671 32.803 0.695 32.827Q0.719 32.851 0.719 32.879L0.719 33.726Q0.719 33.747 0.695 33.774Q0.671 33.801 0.644 33.801L0.531 33.801Q0.504 33.801 0.478 33.776Q0.453 33.750 0.453 33.726Q0.453 33.490 0.347 33.326Q0.241 33.162 0.058 33.080Q-0.125 32.998-0.357 32.998Q-0.686 32.998-0.942 33.101Q-1.198 33.203-1.198 33.480Q-1.198 33.675-1.015 33.784Q-0.833 33.894-0.604 33.935L-0.029 34.041Q0.217 34.089 0.430 34.217Q0.644 34.345 0.781 34.548Q0.917 34.752 0.917 35.001Q0.917 35.514 0.552 35.753Q0.186 35.992-0.351 35.992Q-0.846 35.992-1.178 35.698L-1.444 35.972Q-1.465 35.992-1.492 35.992L-1.540 35.992Q-1.564 35.992-1.591 35.965Q-1.619 35.938-1.619 35.917\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Rayleigh and Raman scattering through a virtual level: Rayleigh returns to the starting level, Stokes leaves the molecule one quantum higher, and anti-Stokes starts one quantum up and ends in the ground vibrational level.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:486.925px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 365.193 146.867\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-30.148 54.025H263.76\"\u002F>\u003Cpath stroke=\"none\" d=\"m265.76 54.025-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg transform=\"translate(278.078 9.089)\">\u003Cpath d=\"M-27.843 54.025L-29.828 54.025L-29.828 53.728Q-29.554 53.728-29.386 53.681Q-29.218 53.634-29.218 53.466L-29.218 50.873L-29.859 50.873L-29.859 50.576L-29.218 50.576L-29.218 49.642Q-29.218 49.377-29.101 49.140Q-28.984 48.904-28.791 48.740Q-28.597 48.576-28.349 48.484Q-28.101 48.392-27.835 48.392Q-27.550 48.392-27.326 48.550Q-27.101 48.709-27.101 48.986Q-27.101 49.142-27.207 49.252Q-27.312 49.361-27.476 49.361Q-27.632 49.361-27.742 49.252Q-27.851 49.142-27.851 48.986Q-27.851 48.779-27.691 48.673Q-27.789 48.650-27.882 48.650Q-28.113 48.650-28.285 48.806Q-28.457 48.962-28.543 49.199Q-28.628 49.435-28.628 49.658L-28.628 50.576L-27.660 50.576L-27.660 50.873L-28.605 50.873L-28.605 53.466Q-28.605 53.634-28.378 53.681Q-28.152 53.728-27.843 53.728L-27.843 54.025M-25.308 54.025L-27.289 54.025L-27.289 53.728Q-27.019 53.728-26.851 53.683Q-26.683 53.638-26.683 53.466L-26.683 51.330Q-26.683 51.115-26.746 51.019Q-26.808 50.923-26.925 50.902Q-27.043 50.880-27.289 50.880L-27.289 50.584L-26.121 50.498L-26.121 51.283Q-26.043 51.072-25.890 50.886Q-25.738 50.701-25.539 50.599Q-25.339 50.498-25.113 50.498Q-24.867 50.498-24.675 50.642Q-24.484 50.787-24.484 51.017Q-24.484 51.173-24.589 51.283Q-24.695 51.392-24.851 51.392Q-25.007 51.392-25.117 51.283Q-25.226 51.173-25.226 51.017Q-25.226 50.857-25.121 50.752Q-25.445 50.752-25.660 50.980Q-25.875 51.209-25.970 51.548Q-26.066 51.888-26.066 52.193L-26.066 53.466Q-26.066 53.634-25.839 53.681Q-25.613 53.728-25.308 53.728L-25.308 54.025M-24.003 52.271Q-24.003 51.791-23.771 51.375Q-23.539 50.959-23.128 50.709Q-22.718 50.459-22.242 50.459Q-21.511 50.459-21.113 50.900Q-20.714 51.341-20.714 52.072Q-20.714 52.177-20.808 52.201L-23.257 52.201L-23.257 52.271Q-23.257 52.681-23.136 53.037Q-23.015 53.392-22.744 53.609Q-22.472 53.826-22.043 53.826Q-21.679 53.826-21.382 53.597Q-21.085 53.369-20.984 53.017Q-20.976 52.970-20.890 52.955L-20.808 52.955Q-20.714 52.982-20.714 53.064Q-20.714 53.072-20.722 53.103Q-20.785 53.330-20.923 53.513Q-21.062 53.697-21.253 53.830Q-21.445 53.962-21.664 54.033Q-21.882 54.103-22.121 54.103Q-22.492 54.103-22.830 53.966Q-23.168 53.830-23.435 53.578Q-23.703 53.326-23.853 52.986Q-24.003 52.646-24.003 52.271M-23.250 51.962L-21.289 51.962Q-21.289 51.658-21.390 51.367Q-21.492 51.076-21.709 50.894Q-21.925 50.712-22.242 50.712Q-22.543 50.712-22.773 50.900Q-23.003 51.087-23.127 51.379Q-23.250 51.670-23.250 51.962M-16.007 55.576L-17.863 55.576L-17.863 55.283Q-17.593 55.283-17.425 55.238Q-17.257 55.193-17.257 55.017L-17.257 53.568Q-17.460 53.814-17.761 53.959Q-18.062 54.103-18.394 54.103Q-18.878 54.103-19.291 53.861Q-19.703 53.619-19.943 53.207Q-20.183 52.795-20.183 52.298Q-20.183 51.802-19.927 51.388Q-19.671 50.974-19.242 50.736Q-18.812 50.498-18.320 50.498Q-17.964 50.498-17.658 50.677Q-17.351 50.857-17.160 51.170L-16.871 50.498L-16.617 50.498L-16.617 55.017Q-16.617 55.193-16.449 55.238Q-16.281 55.283-16.007 55.283L-16.007 55.576M-18.335 53.849Q-17.968 53.849-17.675 53.617Q-17.382 53.384-17.234 53.025L-17.234 51.689Q-17.328 51.306-17.601 51.043Q-17.875 50.779-18.250 50.779Q-18.609 50.779-18.882 51.009Q-19.156 51.240-19.298 51.597Q-19.441 51.955-19.441 52.306Q-19.441 52.642-19.316 53.004Q-19.191 53.365-18.939 53.607Q-18.687 53.849-18.335 53.849M-15.062 53.072L-15.062 51.330Q-15.062 51.115-15.125 51.019Q-15.187 50.923-15.306 50.902Q-15.425 50.880-15.671 50.880L-15.671 50.584L-14.425 50.498L-14.425 53.048L-14.425 53.072Q-14.425 53.384-14.371 53.546Q-14.316 53.709-14.166 53.779Q-14.015 53.849-13.695 53.849Q-13.265 53.849-12.992 53.511Q-12.718 53.173-12.718 52.728L-12.718 51.330Q-12.718 51.115-12.781 51.019Q-12.843 50.923-12.962 50.902Q-13.082 50.880-13.328 50.880L-13.328 50.584L-12.082 50.498L-12.082 53.283Q-12.082 53.494-12.019 53.589Q-11.957 53.685-11.837 53.707Q-11.718 53.728-11.472 53.728L-11.472 54.025L-12.695 54.103L-12.695 53.482Q-12.863 53.771-13.144 53.937Q-13.425 54.103-13.746 54.103Q-15.062 54.103-15.062 53.072M-11.027 52.271Q-11.027 51.791-10.794 51.375Q-10.562 50.959-10.152 50.709Q-9.742 50.459-9.265 50.459Q-8.535 50.459-8.136 50.900Q-7.738 51.341-7.738 52.072Q-7.738 52.177-7.832 52.201L-10.281 52.201L-10.281 52.271Q-10.281 52.681-10.160 53.037Q-10.039 53.392-9.767 53.609Q-9.496 53.826-9.066 53.826Q-8.703 53.826-8.406 53.597Q-8.109 53.369-8.007 53.017Q-8 52.970-7.914 52.955L-7.832 52.955Q-7.738 52.982-7.738 53.064Q-7.738 53.072-7.746 53.103Q-7.808 53.330-7.947 53.513Q-8.085 53.697-8.277 53.830Q-8.468 53.962-8.687 54.033Q-8.906 54.103-9.144 54.103Q-9.515 54.103-9.853 53.966Q-10.191 53.830-10.459 53.578Q-10.726 53.326-10.877 52.986Q-11.027 52.646-11.027 52.271M-10.273 51.962L-8.312 51.962Q-8.312 51.658-8.414 51.367Q-8.515 51.076-8.732 50.894Q-8.949 50.712-9.265 50.712Q-9.566 50.712-9.796 50.900Q-10.027 51.087-10.150 51.379Q-10.273 51.670-10.273 51.962M-5.320 54.025L-7.175 54.025L-7.175 53.728Q-6.902 53.728-6.734 53.681Q-6.566 53.634-6.566 53.466L-6.566 51.330Q-6.566 51.115-6.628 51.019Q-6.691 50.923-6.810 50.902Q-6.929 50.880-7.175 50.880L-7.175 50.584L-5.984 50.498L-5.984 51.232Q-5.871 51.017-5.677 50.849Q-5.484 50.681-5.246 50.589Q-5.007 50.498-4.753 50.498Q-3.585 50.498-3.585 51.576L-3.585 53.466Q-3.585 53.634-3.416 53.681Q-3.246 53.728-2.976 53.728L-2.976 54.025L-4.832 54.025L-4.832 53.728Q-4.558 53.728-4.390 53.681Q-4.222 53.634-4.222 53.466L-4.222 51.591Q-4.222 51.209-4.343 50.980Q-4.464 50.752-4.816 50.752Q-5.128 50.752-5.382 50.914Q-5.636 51.076-5.783 51.345Q-5.929 51.615-5.929 51.912L-5.929 53.466Q-5.929 53.634-5.759 53.681Q-5.589 53.728-5.320 53.728L-5.320 54.025M-2.488 52.298Q-2.488 51.802-2.238 51.377Q-1.988 50.951-1.568 50.705Q-1.148 50.459-0.648 50.459Q-0.109 50.459 0.282 50.584Q0.672 50.709 0.672 51.123Q0.672 51.228 0.622 51.320Q0.571 51.412 0.479 51.462Q0.387 51.513 0.278 51.513Q0.172 51.513 0.081 51.462Q-0.011 51.412-0.062 51.320Q-0.113 51.228-0.113 51.123Q-0.113 50.900 0.055 50.795Q-0.168 50.736-0.640 50.736Q-0.937 50.736-1.152 50.875Q-1.367 51.013-1.498 51.244Q-1.628 51.474-1.687 51.744Q-1.746 52.013-1.746 52.298Q-1.746 52.693-1.613 53.043Q-1.480 53.392-1.209 53.609Q-0.937 53.826-0.539 53.826Q-0.164 53.826 0.112 53.609Q0.387 53.392 0.489 53.033Q0.504 52.970 0.567 52.970L0.672 52.970Q0.707 52.970 0.733 52.998Q0.758 53.025 0.758 53.064L0.758 53.087Q0.625 53.568 0.241 53.836Q-0.144 54.103-0.648 54.103Q-1.011 54.103-1.345 53.966Q-1.679 53.830-1.939 53.580Q-2.199 53.330-2.343 52.994Q-2.488 52.658-2.488 52.298M1.665 55.322Q1.778 55.400 1.954 55.400Q2.243 55.400 2.463 55.187Q2.684 54.974 2.809 54.673L3.098 54.025L1.825 51.138Q1.743 50.962 1.598 50.918Q1.454 50.873 1.184 50.873L1.184 50.576L2.903 50.576L2.903 50.873Q2.481 50.873 2.481 51.056Q2.481 51.068 2.497 51.138L3.434 53.263L4.266 51.353Q4.305 51.263 4.305 51.185Q4.305 51.045 4.204 50.959Q4.102 50.873 3.961 50.873L3.961 50.576L5.313 50.576L5.313 50.873Q5.059 50.873 4.866 50.998Q4.672 51.123 4.567 51.353L3.122 54.673Q3.008 54.927 2.842 55.150Q2.676 55.373 2.448 55.515Q2.219 55.658 1.954 55.658Q1.657 55.658 1.416 55.466Q1.176 55.275 1.176 54.986Q1.176 54.830 1.282 54.728Q1.387 54.627 1.536 54.627Q1.641 54.627 1.721 54.673Q1.801 54.720 1.848 54.798Q1.895 54.877 1.895 54.986Q1.895 55.107 1.834 55.195Q1.774 55.283 1.665 55.322\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-30.148 54.025V-63.477\"\u002F>\u003Cpath stroke=\"none\" d=\"m-30.148-65.477-1.6 3.2 1.6-1.2 1.6 1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-35.456 -117.597)\">\u003Cpath d=\"M-28.050 54.025L-29.828 54.025L-29.828 53.728Q-29.554 53.728-29.386 53.681Q-29.218 53.634-29.218 53.466L-29.218 51.330Q-29.218 51.115-29.275 51.019Q-29.332 50.923-29.445 50.902Q-29.558 50.880-29.804 50.880L-29.804 50.584L-28.605 50.498L-28.605 53.466Q-28.605 53.634-28.459 53.681Q-28.312 53.728-28.050 53.728L-28.050 54.025M-29.492 49.103Q-29.492 48.912-29.357 48.781Q-29.222 48.650-29.027 48.650Q-28.906 48.650-28.802 48.712Q-28.699 48.775-28.636 48.879Q-28.574 48.982-28.574 49.103Q-28.574 49.298-28.705 49.433Q-28.835 49.568-29.027 49.568Q-29.226 49.568-29.359 49.435Q-29.492 49.302-29.492 49.103M-25.621 54.025L-27.476 54.025L-27.476 53.728Q-27.203 53.728-27.035 53.681Q-26.867 53.634-26.867 53.466L-26.867 51.330Q-26.867 51.115-26.929 51.019Q-26.992 50.923-27.111 50.902Q-27.230 50.880-27.476 50.880L-27.476 50.584L-26.285 50.498L-26.285 51.232Q-26.171 51.017-25.978 50.849Q-25.785 50.681-25.546 50.589Q-25.308 50.498-25.054 50.498Q-23.886 50.498-23.886 51.576L-23.886 53.466Q-23.886 53.634-23.716 53.681Q-23.546 53.728-23.277 53.728L-23.277 54.025L-25.132 54.025L-25.132 53.728Q-24.859 53.728-24.691 53.681Q-24.523 53.634-24.523 53.466L-24.523 51.591Q-24.523 51.209-24.644 50.980Q-24.765 50.752-25.117 50.752Q-25.429 50.752-25.683 50.914Q-25.937 51.076-26.084 51.345Q-26.230 51.615-26.230 51.912L-26.230 53.466Q-26.230 53.634-26.060 53.681Q-25.890 53.728-25.621 53.728\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-35.456 -117.597)\">\u003Cpath d=\"M-22.438 53.064L-22.438 50.873L-23.141 50.873L-23.141 50.619Q-22.785 50.619-22.543 50.386Q-22.301 50.154-22.190 49.806Q-22.078 49.459-22.078 49.103L-21.797 49.103L-21.797 50.576L-20.621 50.576L-20.621 50.873L-21.797 50.873L-21.797 53.048Q-21.797 53.369-21.678 53.597Q-21.559 53.826-21.278 53.826Q-21.098 53.826-20.981 53.703Q-20.863 53.580-20.811 53.400Q-20.758 53.220-20.758 53.048L-20.758 52.576L-20.477 52.576L-20.477 53.064Q-20.477 53.318-20.582 53.558Q-20.688 53.798-20.885 53.951Q-21.082 54.103-21.340 54.103Q-21.656 54.103-21.908 53.980Q-22.160 53.857-22.299 53.623Q-22.438 53.388-22.438 53.064M-19.758 52.271Q-19.758 51.791-19.526 51.375Q-19.293 50.959-18.883 50.709Q-18.473 50.459-17.996 50.459Q-17.266 50.459-16.867 50.900Q-16.469 51.341-16.469 52.072Q-16.469 52.177-16.563 52.201L-19.012 52.201L-19.012 52.271Q-19.012 52.681-18.891 53.037Q-18.770 53.392-18.498 53.609Q-18.227 53.826-17.797 53.826Q-17.434 53.826-17.137 53.597Q-16.840 53.369-16.738 53.017Q-16.731 52.970-16.645 52.955L-16.563 52.955Q-16.469 52.982-16.469 53.064Q-16.469 53.072-16.477 53.103Q-16.539 53.330-16.678 53.513Q-16.817 53.697-17.008 53.830Q-17.199 53.962-17.418 54.033Q-17.637 54.103-17.875 54.103Q-18.246 54.103-18.584 53.966Q-18.922 53.830-19.190 53.578Q-19.457 53.326-19.608 52.986Q-19.758 52.646-19.758 52.271M-19.004 51.962L-17.043 51.962Q-17.043 51.658-17.145 51.367Q-17.246 51.076-17.463 50.894Q-17.680 50.712-17.996 50.712Q-18.297 50.712-18.528 50.900Q-18.758 51.087-18.881 51.379Q-19.004 51.670-19.004 51.962M-14.051 54.025L-15.906 54.025L-15.906 53.728Q-15.633 53.728-15.465 53.681Q-15.297 53.634-15.297 53.466L-15.297 51.330Q-15.297 51.115-15.360 51.019Q-15.422 50.923-15.541 50.902Q-15.660 50.880-15.906 50.880L-15.906 50.584L-14.715 50.498L-14.715 51.232Q-14.602 51.017-14.408 50.849Q-14.215 50.681-13.977 50.589Q-13.738 50.498-13.485 50.498Q-12.317 50.498-12.317 51.576L-12.317 53.466Q-12.317 53.634-12.147 53.681Q-11.977 53.728-11.707 53.728L-11.707 54.025L-13.563 54.025L-13.563 53.728Q-13.289 53.728-13.121 53.681Q-12.953 53.634-12.953 53.466L-12.953 51.591Q-12.953 51.209-13.074 50.980Q-13.196 50.752-13.547 50.752Q-13.860 50.752-14.113 50.914Q-14.367 51.076-14.514 51.345Q-14.660 51.615-14.660 51.912L-14.660 53.466Q-14.660 53.634-14.490 53.681Q-14.321 53.728-14.051 53.728L-14.051 54.025M-11.219 54.017L-11.219 52.795Q-11.219 52.767-11.188 52.736Q-11.156 52.705-11.133 52.705L-11.028 52.705Q-10.957 52.705-10.942 52.767Q-10.879 53.087-10.740 53.328Q-10.602 53.568-10.369 53.709Q-10.137 53.849-9.828 53.849Q-9.590 53.849-9.381 53.789Q-9.172 53.728-9.035 53.580Q-8.899 53.431-8.899 53.185Q-8.899 52.931-9.110 52.765Q-9.321 52.599-9.590 52.545L-10.211 52.431Q-10.617 52.353-10.918 52.097Q-11.219 51.841-11.219 51.466Q-11.219 51.099-11.018 50.877Q-10.817 50.654-10.492 50.556Q-10.168 50.459-9.828 50.459Q-9.363 50.459-9.067 50.666L-8.844 50.482Q-8.821 50.459-8.789 50.459L-8.738 50.459Q-8.707 50.459-8.680 50.486Q-8.653 50.513-8.653 50.545L-8.653 51.529Q-8.653 51.560-8.678 51.589Q-8.703 51.619-8.738 51.619L-8.844 51.619Q-8.879 51.619-8.906 51.591Q-8.934 51.564-8.934 51.529Q-8.934 51.130-9.186 50.910Q-9.438 50.689-9.836 50.689Q-10.192 50.689-10.475 50.812Q-10.758 50.935-10.758 51.240Q-10.758 51.459-10.557 51.591Q-10.356 51.724-10.110 51.767L-9.485 51.880Q-9.055 51.970-8.746 52.267Q-8.438 52.564-8.438 52.978Q-8.438 53.548-8.836 53.826Q-9.235 54.103-9.828 54.103Q-10.379 54.103-10.731 53.767L-11.028 54.080Q-11.051 54.103-11.086 54.103L-11.133 54.103Q-11.156 54.103-11.188 54.072Q-11.219 54.041-11.219 54.017M-6.051 54.025L-7.828 54.025L-7.828 53.728Q-7.555 53.728-7.387 53.681Q-7.219 53.634-7.219 53.466L-7.219 51.330Q-7.219 51.115-7.276 51.019Q-7.332 50.923-7.446 50.902Q-7.559 50.880-7.805 50.880L-7.805 50.584L-6.606 50.498L-6.606 53.466Q-6.606 53.634-6.459 53.681Q-6.313 53.728-6.051 53.728L-6.051 54.025M-7.492 49.103Q-7.492 48.912-7.358 48.781Q-7.223 48.650-7.028 48.650Q-6.906 48.650-6.803 48.712Q-6.699 48.775-6.637 48.879Q-6.574 48.982-6.574 49.103Q-6.574 49.298-6.705 49.433Q-6.836 49.568-7.028 49.568Q-7.227 49.568-7.360 49.435Q-7.492 49.302-7.492 49.103M-4.926 53.064L-4.926 50.873L-5.629 50.873L-5.629 50.619Q-5.274 50.619-5.031 50.386Q-4.789 50.154-4.678 49.806Q-4.567 49.459-4.567 49.103L-4.285 49.103L-4.285 50.576L-3.110 50.576L-3.110 50.873L-4.285 50.873L-4.285 53.048Q-4.285 53.369-4.166 53.597Q-4.047 53.826-3.766 53.826Q-3.586 53.826-3.469 53.703Q-3.352 53.580-3.299 53.400Q-3.246 53.220-3.246 53.048L-3.246 52.576L-2.965 52.576L-2.965 53.064Q-2.965 53.318-3.071 53.558Q-3.176 53.798-3.373 53.951Q-3.571 54.103-3.828 54.103Q-4.145 54.103-4.397 53.980Q-4.649 53.857-4.787 53.623Q-4.926 53.388-4.926 53.064\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-35.456 -117.597)\">\u003Cpath d=\"M-2.056 55.322Q-1.942 55.400-1.767 55.400Q-1.478 55.400-1.257 55.187Q-1.036 54.974-0.911 54.673L-0.622 54.025L-1.896 51.138Q-1.978 50.962-2.122 50.918Q-2.267 50.873-2.536 50.873L-2.536 50.576L-0.817 50.576L-0.817 50.873Q-1.239 50.873-1.239 51.056Q-1.239 51.068-1.224 51.138L-0.286 53.263L0.546 51.353Q0.585 51.263 0.585 51.185Q0.585 51.045 0.483 50.959Q0.382 50.873 0.241 50.873L0.241 50.576L1.593 50.576L1.593 50.873Q1.339 50.873 1.145 50.998Q0.952 51.123 0.847 51.353L-0.599 54.673Q-0.712 54.927-0.878 55.150Q-1.044 55.373-1.273 55.515Q-1.501 55.658-1.767 55.658Q-2.064 55.658-2.304 55.466Q-2.544 55.275-2.544 54.986Q-2.544 54.830-2.439 54.728Q-2.333 54.627-2.185 54.627Q-2.079 54.627-1.999 54.673Q-1.919 54.720-1.872 54.798Q-1.825 54.877-1.825 54.986Q-1.825 55.107-1.886 55.195Q-1.946 55.283-2.056 55.322\" 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=\"M117.806 54.025V-56.941\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(132.822 -115.86)\">\u003Cpath d=\"M-27.649 54.025L-29.755 54.025L-29.755 53.745Q-29.034 53.745-29.034 53.536L-29.034 49.735Q-29.034 49.524-29.755 49.524L-29.755 49.243L-27.417 49.243Q-27.106 49.243-26.763 49.317Q-26.419 49.390-26.098 49.546Q-25.776 49.701-25.575 49.947Q-25.373 50.193-25.373 50.518Q-25.373 50.805-25.561 51.036Q-25.749 51.267-26.026 51.415Q-26.303 51.564-26.593 51.646Q-26.258 51.749-26.024 51.981Q-25.790 52.213-25.746 52.542L-25.660 53.150Q-25.633 53.362-25.587 53.531Q-25.541 53.700-25.436 53.820Q-25.332 53.940-25.144 53.940Q-24.929 53.940-24.813 53.755Q-24.696 53.570-24.696 53.338Q-24.679 53.273-24.604 53.256L-24.512 53.256Q-24.430 53.276-24.430 53.358Q-24.430 53.564-24.520 53.750Q-24.611 53.936-24.777 54.051Q-24.942 54.165-25.144 54.165Q-25.482 54.165-25.776 54.064Q-26.070 53.963-26.255 53.741Q-26.440 53.519-26.440 53.171L-26.440 52.562Q-26.440 52.313-26.583 52.126Q-26.727 51.940-26.950 51.841Q-27.174 51.742-27.424 51.742L-28.371 51.742L-28.371 53.536Q-28.371 53.745-27.649 53.745L-27.649 54.025M-28.371 49.735L-28.371 51.520L-27.516 51.520Q-27.229 51.520-26.990 51.477Q-26.751 51.434-26.563 51.325Q-26.375 51.215-26.263 51.017Q-26.152 50.819-26.152 50.518Q-26.152 49.941-26.520 49.732Q-26.887 49.524-27.516 49.524L-28.005 49.524Q-28.193 49.524-28.282 49.558Q-28.371 49.592-28.371 49.735M-23.972 53.297Q-23.972 52.965-23.748 52.738Q-23.524 52.511-23.180 52.383Q-22.837 52.254-22.464 52.202Q-22.092 52.149-21.788 52.149L-21.788 51.896Q-21.788 51.691-21.895 51.511Q-22.003 51.332-22.184 51.229Q-22.365 51.127-22.574 51.127Q-22.981 51.127-23.216 51.219Q-23.127 51.256-23.081 51.340Q-23.035 51.424-23.035 51.526Q-23.035 51.622-23.081 51.701Q-23.127 51.779-23.208 51.824Q-23.288 51.868-23.377 51.868Q-23.527 51.868-23.628 51.771Q-23.729 51.673-23.729 51.526Q-23.729 50.904-22.574 50.904Q-22.362 50.904-22.112 50.968Q-21.863 51.031-21.661 51.150Q-21.460 51.270-21.333 51.455Q-21.207 51.639-21.207 51.882L-21.207 53.458Q-21.207 53.574-21.145 53.670Q-21.084 53.765-20.971 53.765Q-20.861 53.765-20.796 53.671Q-20.731 53.577-20.731 53.458L-20.731 53.010L-20.465 53.010L-20.465 53.458Q-20.465 53.728-20.692 53.893Q-20.919 54.059-21.200 54.059Q-21.408 54.059-21.545 53.905Q-21.682 53.752-21.706 53.536Q-21.853 53.803-22.135 53.948Q-22.417 54.093-22.741 54.093Q-23.018 54.093-23.302 54.018Q-23.585 53.943-23.779 53.764Q-23.972 53.584-23.972 53.297M-23.356 53.297Q-23.356 53.471-23.256 53.601Q-23.155 53.731-22.999 53.801Q-22.844 53.871-22.680 53.871Q-22.461 53.871-22.252 53.774Q-22.044 53.676-21.916 53.495Q-21.788 53.314-21.788 53.088L-21.788 52.360Q-22.112 52.360-22.478 52.451Q-22.844 52.542-23.100 52.754Q-23.356 52.965-23.356 53.297\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(132.822 -115.86)\">\u003Cpath d=\"M-19.923 55.160Q-19.793 55.228-19.656 55.228Q-19.485 55.228-19.335 55.139Q-19.184 55.050-19.073 54.905Q-18.962 54.760-18.884 54.592L-18.620 54.025L-19.789 51.499Q-19.864 51.352-19.994 51.320Q-20.124 51.287-20.357 51.287L-20.357 51.007L-18.836 51.007L-18.836 51.287Q-19.184 51.287-19.184 51.434Q-19.181 51.455-19.179 51.472Q-19.177 51.489-19.177 51.499L-18.320 53.358L-17.547 51.687Q-17.513 51.619-17.513 51.540Q-17.513 51.427-17.597 51.357Q-17.680 51.287-17.793 51.287L-17.793 51.007L-16.597 51.007L-16.597 51.287Q-16.816 51.287-16.988 51.391Q-17.161 51.496-17.253 51.687L-18.590 54.592Q-18.760 54.962-19.030 55.208Q-19.301 55.454-19.656 55.454Q-19.926 55.454-20.145 55.288Q-20.364 55.122-20.364 54.859Q-20.364 54.722-20.271 54.633Q-20.179 54.545-20.039 54.545Q-19.902 54.545-19.813 54.633Q-19.724 54.722-19.724 54.859Q-19.724 54.962-19.777 55.040Q-19.830 55.119-19.923 55.160M-14.389 54.025L-15.992 54.025L-15.992 53.745Q-15.766 53.745-15.618 53.711Q-15.469 53.676-15.469 53.536L-15.469 49.917Q-15.469 49.647-15.577 49.585Q-15.684 49.524-15.992 49.524L-15.992 49.243L-14.915 49.168L-14.915 53.536Q-14.915 53.673-14.765 53.709Q-14.614 53.745-14.389 53.745L-14.389 54.025M-13.835 52.490Q-13.835 52.169-13.710 51.880Q-13.586 51.591-13.360 51.368Q-13.134 51.144-12.839 51.024Q-12.543 50.904-12.225 50.904Q-11.897 50.904-11.636 51.004Q-11.374 51.103-11.198 51.285Q-11.022 51.468-10.928 51.726Q-10.834 51.984-10.834 52.316Q-10.834 52.408-10.916 52.429L-13.172 52.429L-13.172 52.490Q-13.172 53.078-12.888 53.461Q-12.605 53.844-12.037 53.844Q-11.716 53.844-11.448 53.651Q-11.179 53.458-11.091 53.143Q-11.084 53.102-11.009 53.088L-10.916 53.088Q-10.834 53.112-10.834 53.184Q-10.834 53.191-10.841 53.218Q-10.954 53.615-11.325 53.854Q-11.696 54.093-12.119 54.093Q-12.557 54.093-12.957 53.885Q-13.357 53.676-13.596 53.309Q-13.835 52.942-13.835 52.490M-13.165 52.220L-11.350 52.220Q-11.350 51.943-11.448 51.691Q-11.545 51.438-11.743 51.282Q-11.942 51.127-12.225 51.127Q-12.502 51.127-12.716 51.285Q-12.929 51.444-13.047 51.699Q-13.165 51.954-13.165 52.220M-8.630 54.025L-10.181 54.025L-10.181 53.745Q-9.956 53.745-9.807 53.711Q-9.658 53.676-9.658 53.536L-9.658 51.687Q-9.658 51.499-9.706 51.415Q-9.754 51.332-9.852 51.313Q-9.949 51.294-10.161 51.294L-10.161 51.014L-9.105 50.939L-9.105 53.536Q-9.105 53.676-8.973 53.711Q-8.842 53.745-8.630 53.745L-8.630 54.025M-9.901 49.718Q-9.901 49.547-9.778 49.428Q-9.655 49.308-9.484 49.308Q-9.317 49.308-9.194 49.428Q-9.071 49.547-9.071 49.718Q-9.071 49.893-9.194 50.016Q-9.317 50.139-9.484 50.139Q-9.655 50.139-9.778 50.016Q-9.901 49.893-9.901 49.718M-8.025 54.558Q-8.025 54.312-7.828 54.128Q-7.632 53.943-7.375 53.864Q-7.512 53.752-7.584 53.591Q-7.655 53.430-7.655 53.249Q-7.655 52.928-7.444 52.682Q-7.779 52.384-7.779 51.974Q-7.779 51.513-7.389 51.226Q-6.999 50.939-6.521 50.939Q-6.049 50.939-5.714 51.185Q-5.540 51.031-5.330 50.949Q-5.119 50.867-4.890 50.867Q-4.726 50.867-4.605 50.974Q-4.484 51.082-4.484 51.246Q-4.484 51.342-4.555 51.414Q-4.627 51.485-4.719 51.485Q-4.819 51.485-4.889 51.412Q-4.959 51.338-4.959 51.239Q-4.959 51.185-4.945 51.154L-4.938 51.140Q-4.931 51.120-4.923 51.109Q-4.914 51.099-4.911 51.092Q-5.266 51.092-5.553 51.315Q-5.266 51.608-5.266 51.974Q-5.266 52.289-5.451 52.521Q-5.635 52.754-5.924 52.882Q-6.213 53.010-6.521 53.010Q-6.722 53.010-6.914 52.960Q-7.105 52.911-7.283 52.801Q-7.375 52.928-7.375 53.071Q-7.375 53.253-7.247 53.388Q-7.119 53.523-6.934 53.523L-6.302 53.523Q-5.854 53.523-5.485 53.594Q-5.116 53.666-4.856 53.895Q-4.596 54.124-4.596 54.558Q-4.596 54.879-4.892 55.081Q-5.188 55.283-5.591 55.372Q-5.994 55.461-6.309 55.461Q-6.627 55.461-7.030 55.372Q-7.433 55.283-7.729 55.081Q-8.025 54.879-8.025 54.558M-7.570 54.558Q-7.570 54.787-7.351 54.936Q-7.133 55.085-6.840 55.153Q-6.548 55.221-6.309 55.221Q-6.145 55.221-5.936 55.185Q-5.728 55.150-5.521 55.069Q-5.314 54.989-5.183 54.861Q-5.051 54.733-5.051 54.558Q-5.051 54.206-5.432 54.112Q-5.813 54.018-6.316 54.018L-6.934 54.018Q-7.174 54.018-7.372 54.169Q-7.570 54.319-7.570 54.558M-6.521 52.771Q-5.854 52.771-5.854 51.974Q-5.854 51.174-6.521 51.174Q-7.191 51.174-7.191 51.974Q-7.191 52.771-6.521 52.771M-2.320 54.025L-3.954 54.025L-3.954 53.745Q-3.725 53.745-3.576 53.711Q-3.427 53.676-3.427 53.536L-3.427 49.917Q-3.427 49.647-3.535 49.585Q-3.643 49.524-3.954 49.524L-3.954 49.243L-2.874 49.168L-2.874 51.554Q-2.768 51.369-2.590 51.227Q-2.412 51.086-2.204 51.012Q-1.995 50.939-1.770 50.939Q-1.264 50.939-0.980 51.162Q-0.697 51.386-0.697 51.882L-0.697 53.536Q-0.697 53.673-0.548 53.709Q-0.399 53.745-0.174 53.745L-0.174 54.025L-1.804 54.025L-1.804 53.745Q-1.575 53.745-1.426 53.711Q-1.278 53.676-1.278 53.536L-1.278 51.896Q-1.278 51.561-1.397 51.361Q-1.517 51.161-1.831 51.161Q-2.101 51.161-2.335 51.297Q-2.570 51.434-2.708 51.668Q-2.846 51.902-2.846 52.176L-2.846 53.536Q-2.846 53.673-2.696 53.709Q-2.546 53.745-2.320 53.745\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M55.21 54.025V5.655\" style=\"stroke-width:1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(74.24 11.24)\">\u003Cpath d=\"M-29.659 54.087L-29.659 52.514Q-29.659 52.487-29.634 52.461Q-29.608 52.436-29.581 52.436L-29.468 52.436Q-29.440 52.436-29.417 52.463Q-29.393 52.490-29.393 52.514Q-29.393 52.859-29.261 53.123Q-29.129 53.386-28.900 53.555Q-28.671 53.724-28.369 53.805Q-28.066 53.885-27.725 53.885Q-27.458 53.885-27.222 53.757Q-26.986 53.629-26.841 53.406Q-26.696 53.184-26.696 52.918Q-26.696 52.695-26.802 52.499Q-26.908 52.302-27.089 52.167Q-27.270 52.032-27.496 51.981L-28.524 51.749Q-28.835 51.677-29.095 51.491Q-29.355 51.304-29.507 51.033Q-29.659 50.761-29.659 50.446Q-29.659 50.060-29.446 49.753Q-29.232 49.445-28.885 49.274Q-28.538 49.103-28.159 49.103Q-27.930 49.103-27.701 49.156Q-27.472 49.209-27.273 49.317Q-27.075 49.424-26.921 49.588L-26.627 49.148Q-26.604 49.103-26.563 49.103L-26.515 49.103Q-26.484 49.103-26.462 49.129Q-26.440 49.154-26.440 49.182L-26.440 50.757Q-26.440 50.778-26.463 50.805Q-26.487 50.833-26.515 50.833L-26.627 50.833Q-26.689 50.833-26.703 50.757Q-26.744 50.344-26.925 50.024Q-27.106 49.705-27.417 49.530Q-27.728 49.356-28.159 49.356Q-28.408 49.356-28.648 49.467Q-28.887 49.578-29.037 49.776Q-29.188 49.975-29.188 50.238Q-29.188 50.450-29.080 50.631Q-28.972 50.812-28.796 50.932Q-28.620 51.051-28.412 51.092L-27.383 51.321Q-27.065 51.393-26.798 51.598Q-26.532 51.803-26.380 52.097Q-26.228 52.391-26.228 52.723Q-26.228 53.116-26.433 53.451Q-26.638 53.786-26.983 53.975Q-27.328 54.165-27.725 54.165Q-28.145 54.165-28.524 54.052Q-28.904 53.940-29.174 53.690L-29.468 54.124Q-29.495 54.165-29.533 54.165L-29.581 54.165Q-29.608 54.165-29.634 54.140Q-29.659 54.114-29.659 54.087M-24.891 53.184L-24.891 51.287L-25.530 51.287L-25.530 51.065Q-25.212 51.065-24.995 50.855Q-24.778 50.645-24.678 50.335Q-24.577 50.026-24.577 49.718L-24.310 49.718L-24.310 51.007L-23.233 51.007L-23.233 51.287L-24.310 51.287L-24.310 53.171Q-24.310 53.447-24.206 53.646Q-24.102 53.844-23.842 53.844Q-23.685 53.844-23.579 53.740Q-23.473 53.635-23.423 53.482Q-23.374 53.328-23.374 53.171L-23.374 52.757L-23.107 52.757L-23.107 53.184Q-23.107 53.410-23.206 53.620Q-23.305 53.830-23.490 53.962Q-23.674 54.093-23.903 54.093Q-24.341 54.093-24.616 53.856Q-24.891 53.618-24.891 53.184M-22.338 52.542Q-22.338 52.200-22.203 51.901Q-22.068 51.602-21.829 51.378Q-21.589 51.154-21.272 51.029Q-20.954 50.904-20.622 50.904Q-20.178 50.904-19.778 51.120Q-19.378 51.335-19.144 51.713Q-18.910 52.090-18.910 52.542Q-18.910 52.883-19.052 53.167Q-19.193 53.451-19.438 53.658Q-19.682 53.864-19.992 53.979Q-20.301 54.093-20.622 54.093Q-21.053 54.093-21.454 53.892Q-21.856 53.690-22.097 53.338Q-22.338 52.986-22.338 52.542M-20.622 53.844Q-20.021 53.844-19.797 53.466Q-19.573 53.088-19.573 52.456Q-19.573 51.844-19.807 51.485Q-20.041 51.127-20.622 51.127Q-21.675 51.127-21.675 52.456Q-21.675 53.088-21.449 53.466Q-21.224 53.844-20.622 53.844M-16.719 54.025L-18.301 54.025L-18.301 53.745Q-18.072 53.745-17.924 53.711Q-17.775 53.676-17.775 53.536L-17.775 49.917Q-17.775 49.647-17.883 49.585Q-17.990 49.524-18.301 49.524L-18.301 49.243L-17.221 49.168L-17.221 52.456L-16.237 51.687Q-16.032 51.550-16.032 51.400Q-16.032 51.356-16.073 51.321Q-16.114 51.287-16.158 51.287L-16.158 51.007L-14.794 51.007L-14.794 51.287Q-15.283 51.287-15.803 51.687L-16.360 52.121L-15.382 53.345Q-15.181 53.591-15.047 53.668Q-14.914 53.745-14.627 53.745L-14.627 54.025L-16.059 54.025L-16.059 53.745Q-15.871 53.745-15.871 53.632Q-15.871 53.536-16.025 53.345L-16.760 52.436L-17.242 52.815L-17.242 53.536Q-17.242 53.673-17.093 53.709Q-16.944 53.745-16.719 53.745\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(74.24 11.24)\">\u003Cpath d=\"M-14.361 52.490Q-14.361 52.169-14.236 51.880Q-14.111 51.591-13.885 51.368Q-13.660 51.144-13.364 51.024Q-13.069 50.904-12.751 50.904Q-12.423 50.904-12.161 51.004Q-11.900 51.103-11.724 51.285Q-11.548 51.468-11.454 51.726Q-11.360 51.984-11.360 52.316Q-11.360 52.408-11.442 52.429L-13.697 52.429L-13.697 52.490Q-13.697 53.078-13.414 53.461Q-13.130 53.844-12.563 53.844Q-12.241 53.844-11.973 53.651Q-11.705 53.458-11.616 53.143Q-11.609 53.102-11.534 53.088L-11.442 53.088Q-11.360 53.112-11.360 53.184Q-11.360 53.191-11.366 53.218Q-11.479 53.615-11.850 53.854Q-12.221 54.093-12.645 54.093Q-13.082 54.093-13.482 53.885Q-13.882 53.676-14.121 53.309Q-14.361 52.942-14.361 52.490M-13.691 52.220L-11.876 52.220Q-11.876 51.943-11.973 51.691Q-12.071 51.438-12.269 51.282Q-12.467 51.127-12.751 51.127Q-13.028 51.127-13.241 51.285Q-13.455 51.444-13.573 51.699Q-13.691 51.954-13.691 52.220M-10.772 54.018L-10.772 52.955Q-10.772 52.931-10.744 52.904Q-10.717 52.877-10.693 52.877L-10.584 52.877Q-10.519 52.877-10.505 52.935Q-10.409 53.369-10.163 53.620Q-9.917 53.871-9.504 53.871Q-9.162 53.871-8.909 53.738Q-8.656 53.605-8.656 53.297Q-8.656 53.140-8.750 53.025Q-8.844 52.911-8.982 52.842Q-9.121 52.774-9.288 52.736L-9.869 52.637Q-10.225 52.569-10.498 52.348Q-10.772 52.128-10.772 51.786Q-10.772 51.537-10.661 51.362Q-10.550 51.188-10.363 51.089Q-10.177 50.990-9.962 50.947Q-9.746 50.904-9.504 50.904Q-9.090 50.904-8.810 51.086L-8.594 50.911Q-8.584 50.908-8.577 50.906Q-8.571 50.904-8.560 50.904L-8.509 50.904Q-8.482 50.904-8.458 50.928Q-8.434 50.952-8.434 50.980L-8.434 51.827Q-8.434 51.848-8.458 51.875Q-8.482 51.902-8.509 51.902L-8.622 51.902Q-8.649 51.902-8.675 51.877Q-8.700 51.851-8.700 51.827Q-8.700 51.591-8.806 51.427Q-8.912 51.263-9.095 51.181Q-9.278 51.099-9.510 51.099Q-9.839 51.099-10.095 51.202Q-10.351 51.304-10.351 51.581Q-10.351 51.776-10.168 51.885Q-9.986 51.995-9.757 52.036L-9.182 52.142Q-8.936 52.190-8.723 52.318Q-8.509 52.446-8.372 52.649Q-8.236 52.853-8.236 53.102Q-8.236 53.615-8.601 53.854Q-8.967 54.093-9.504 54.093Q-9.999 54.093-10.331 53.799L-10.597 54.073Q-10.618 54.093-10.645 54.093L-10.693 54.093Q-10.717 54.093-10.744 54.066Q-10.772 54.039-10.772 54.018\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M180.402 54.025V34.108\" style=\"stroke-width:1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(191.296 11.24)\">\u003Cpath d=\"M-29.775 53.297Q-29.775 52.965-29.552 52.738Q-29.328 52.511-28.984 52.383Q-28.641 52.254-28.268 52.202Q-27.896 52.149-27.591 52.149L-27.591 51.896Q-27.591 51.691-27.699 51.511Q-27.807 51.332-27.988 51.229Q-28.169 51.127-28.377 51.127Q-28.784 51.127-29.020 51.219Q-28.931 51.256-28.885 51.340Q-28.839 51.424-28.839 51.526Q-28.839 51.622-28.885 51.701Q-28.931 51.779-29.012 51.824Q-29.092 51.868-29.181 51.868Q-29.331 51.868-29.432 51.771Q-29.533 51.673-29.533 51.526Q-29.533 50.904-28.377 50.904Q-28.166 50.904-27.916 50.968Q-27.667 51.031-27.465 51.150Q-27.263 51.270-27.137 51.455Q-27.010 51.639-27.010 51.882L-27.010 53.458Q-27.010 53.574-26.949 53.670Q-26.887 53.765-26.774 53.765Q-26.665 53.765-26.600 53.671Q-26.535 53.577-26.535 53.458L-26.535 53.010L-26.269 53.010L-26.269 53.458Q-26.269 53.728-26.496 53.893Q-26.723 54.059-27.003 54.059Q-27.212 54.059-27.349 53.905Q-27.485 53.752-27.509 53.536Q-27.656 53.803-27.938 53.948Q-28.220 54.093-28.545 54.093Q-28.822 54.093-29.106 54.018Q-29.389 53.943-29.582 53.764Q-29.775 53.584-29.775 53.297M-29.160 53.297Q-29.160 53.471-29.059 53.601Q-28.959 53.731-28.803 53.801Q-28.648 53.871-28.483 53.871Q-28.265 53.871-28.056 53.774Q-27.848 53.676-27.720 53.495Q-27.591 53.314-27.591 53.088L-27.591 52.360Q-27.916 52.360-28.282 52.451Q-28.648 52.542-28.904 52.754Q-29.160 52.965-29.160 53.297M-24.170 54.025L-25.804 54.025L-25.804 53.745Q-25.575 53.745-25.426 53.711Q-25.277 53.676-25.277 53.536L-25.277 51.687Q-25.277 51.417-25.385 51.356Q-25.493 51.294-25.804 51.294L-25.804 51.014L-24.744 50.939L-24.744 51.588Q-24.573 51.280-24.269 51.109Q-23.965 50.939-23.620 50.939Q-23.114 50.939-22.830 51.162Q-22.546 51.386-22.546 51.882L-22.546 53.536Q-22.546 53.673-22.398 53.709Q-22.249 53.745-22.023 53.745L-22.023 54.025L-23.654 54.025L-23.654 53.745Q-23.425 53.745-23.276 53.711Q-23.127 53.676-23.127 53.536L-23.127 51.896Q-23.127 51.561-23.247 51.361Q-23.367 51.161-23.681 51.161Q-23.951 51.161-24.185 51.297Q-24.419 51.434-24.558 51.668Q-24.696 51.902-24.696 52.176L-24.696 53.536Q-24.696 53.673-24.546 53.709Q-24.396 53.745-24.170 53.745\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.296 11.24)\">\u003Cpath d=\"M-21.120 53.184L-21.120 51.287L-21.759 51.287L-21.759 51.065Q-21.441 51.065-21.224 50.855Q-21.007 50.645-20.907 50.335Q-20.806 50.026-20.806 49.718L-20.539 49.718L-20.539 51.007L-19.462 51.007L-19.462 51.287L-20.539 51.287L-20.539 53.171Q-20.539 53.447-20.435 53.646Q-20.331 53.844-20.071 53.844Q-19.914 53.844-19.808 53.740Q-19.702 53.635-19.652 53.482Q-19.603 53.328-19.603 53.171L-19.603 52.757L-19.336 52.757L-19.336 53.184Q-19.336 53.410-19.435 53.620Q-19.534 53.830-19.719 53.962Q-19.903 54.093-20.132 54.093Q-20.570 54.093-20.845 53.856Q-21.120 53.618-21.120 53.184M-16.909 54.025L-18.461 54.025L-18.461 53.745Q-18.235 53.745-18.087 53.711Q-17.938 53.676-17.938 53.536L-17.938 51.687Q-17.938 51.499-17.986 51.415Q-18.034 51.332-18.131 51.313Q-18.229 51.294-18.440 51.294L-18.440 51.014L-17.384 50.939L-17.384 53.536Q-17.384 53.676-17.253 53.711Q-17.121 53.745-16.909 53.745L-16.909 54.025M-18.181 49.718Q-18.181 49.547-18.058 49.428Q-17.935 49.308-17.764 49.308Q-17.596 49.308-17.473 49.428Q-17.350 49.547-17.350 49.718Q-17.350 49.893-17.473 50.016Q-17.596 50.139-17.764 50.139Q-17.935 50.139-18.058 50.016Q-18.181 49.893-18.181 49.718M-14.380 52.771L-16.438 52.771L-16.438 52.268L-14.380 52.268L-14.380 52.771M-13.402 54.087L-13.402 52.514Q-13.402 52.487-13.377 52.461Q-13.351 52.436-13.324 52.436L-13.211 52.436Q-13.184 52.436-13.160 52.463Q-13.136 52.490-13.136 52.514Q-13.136 52.859-13.004 53.123Q-12.873 53.386-12.644 53.555Q-12.415 53.724-12.112 53.805Q-11.810 53.885-11.468 53.885Q-11.201 53.885-10.965 53.757Q-10.730 53.629-10.584 53.406Q-10.439 53.184-10.439 52.918Q-10.439 52.695-10.545 52.499Q-10.651 52.302-10.832 52.167Q-11.013 52.032-11.239 51.981L-12.268 51.749Q-12.579 51.677-12.838 51.491Q-13.098 51.304-13.250 51.033Q-13.402 50.761-13.402 50.446Q-13.402 50.060-13.189 49.753Q-12.975 49.445-12.628 49.274Q-12.281 49.103-11.902 49.103Q-11.673 49.103-11.444 49.156Q-11.215 49.209-11.017 49.317Q-10.818 49.424-10.665 49.588L-10.371 49.148Q-10.347 49.103-10.306 49.103L-10.258 49.103Q-10.227 49.103-10.205 49.129Q-10.183 49.154-10.183 49.182L-10.183 50.757Q-10.183 50.778-10.207 50.805Q-10.231 50.833-10.258 50.833L-10.371 50.833Q-10.432 50.833-10.446 50.757Q-10.487 50.344-10.668 50.024Q-10.849 49.705-11.160 49.530Q-11.471 49.356-11.902 49.356Q-12.151 49.356-12.391 49.467Q-12.630 49.578-12.780 49.776Q-12.931 49.975-12.931 50.238Q-12.931 50.450-12.823 50.631Q-12.715 50.812-12.539 50.932Q-12.363 51.051-12.155 51.092L-11.126 51.321Q-10.808 51.393-10.542 51.598Q-10.275 51.803-10.123 52.097Q-9.971 52.391-9.971 52.723Q-9.971 53.116-10.176 53.451Q-10.381 53.786-10.726 53.975Q-11.071 54.165-11.468 54.165Q-11.888 54.165-12.268 54.052Q-12.647 53.940-12.917 53.690L-13.211 54.124Q-13.238 54.165-13.276 54.165L-13.324 54.165Q-13.351 54.165-13.377 54.140Q-13.402 54.114-13.402 54.087M-8.634 53.184L-8.634 51.287L-9.273 51.287L-9.273 51.065Q-8.956 51.065-8.739 50.855Q-8.522 50.645-8.421 50.335Q-8.320 50.026-8.320 49.718L-8.053 49.718L-8.053 51.007L-6.977 51.007L-6.977 51.287L-8.053 51.287L-8.053 53.171Q-8.053 53.447-7.949 53.646Q-7.845 53.844-7.585 53.844Q-7.428 53.844-7.322 53.740Q-7.216 53.635-7.166 53.482Q-7.117 53.328-7.117 53.171L-7.117 52.757L-6.850 52.757L-6.850 53.184Q-6.850 53.410-6.949 53.620Q-7.048 53.830-7.233 53.962Q-7.418 54.093-7.647 54.093Q-8.084 54.093-8.359 53.856Q-8.634 53.618-8.634 53.184M-6.081 52.542Q-6.081 52.200-5.946 51.901Q-5.811 51.602-5.572 51.378Q-5.333 51.154-5.015 51.029Q-4.697 50.904-4.365 50.904Q-3.921 50.904-3.521 51.120Q-3.121 51.335-2.887 51.713Q-2.653 52.090-2.653 52.542Q-2.653 52.883-2.795 53.167Q-2.937 53.451-3.181 53.658Q-3.425 53.864-3.735 53.979Q-4.044 54.093-4.365 54.093Q-4.796 54.093-5.198 53.892Q-5.599 53.690-5.840 53.338Q-6.081 52.986-6.081 52.542M-4.365 53.844Q-3.764 53.844-3.540 53.466Q-3.316 53.088-3.316 52.456Q-3.316 51.844-3.550 51.485Q-3.784 51.127-4.365 51.127Q-5.418 51.127-5.418 52.456Q-5.418 53.088-5.192 53.466Q-4.967 53.844-4.365 53.844M-0.462 54.025L-2.044 54.025L-2.044 53.745Q-1.815 53.745-1.667 53.711Q-1.518 53.676-1.518 53.536L-1.518 49.917Q-1.518 49.647-1.626 49.585Q-1.733 49.524-2.044 49.524L-2.044 49.243L-0.964 49.168L-0.964 52.456L0.020 51.687Q0.225 51.550 0.225 51.400Q0.225 51.356 0.184 51.321Q0.143 51.287 0.099 51.287L0.099 51.007L1.462 51.007L1.462 51.287Q0.974 51.287 0.454 51.687L-0.103 52.121L0.874 53.345Q1.076 53.591 1.209 53.668Q1.343 53.745 1.630 53.745L1.630 54.025L0.198 54.025L0.198 53.745Q0.386 53.745 0.386 53.632Q0.386 53.536 0.232 53.345L-0.503 52.436L-0.985 52.815L-0.985 53.536Q-0.985 53.673-0.836 53.709Q-0.688 53.745-0.462 53.745\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(191.296 11.24)\">\u003Cpath d=\"M1.910 52.490Q1.910 52.169 2.035 51.880Q2.160 51.591 2.386 51.368Q2.611 51.144 2.907 51.024Q3.202 50.904 3.520 50.904Q3.848 50.904 4.110 51.004Q4.371 51.103 4.547 51.285Q4.723 51.468 4.817 51.726Q4.911 51.984 4.911 52.316Q4.911 52.408 4.829 52.429L2.574 52.429L2.574 52.490Q2.574 53.078 2.857 53.461Q3.141 53.844 3.708 53.844Q4.030 53.844 4.298 53.651Q4.566 53.458 4.655 53.143Q4.662 53.102 4.737 53.088L4.829 53.088Q4.911 53.112 4.911 53.184Q4.911 53.191 4.905 53.218Q4.792 53.615 4.421 53.854Q4.050 54.093 3.626 54.093Q3.189 54.093 2.789 53.885Q2.389 53.676 2.150 53.309Q1.910 52.942 1.910 52.490M2.580 52.220L4.395 52.220Q4.395 51.943 4.298 51.691Q4.200 51.438 4.002 51.282Q3.804 51.127 3.520 51.127Q3.243 51.127 3.030 51.285Q2.816 51.444 2.698 51.699Q2.580 51.954 2.580 52.220M5.499 54.018L5.499 52.955Q5.499 52.931 5.527 52.904Q5.554 52.877 5.578 52.877L5.687 52.877Q5.752 52.877 5.766 52.935Q5.862 53.369 6.108 53.620Q6.354 53.871 6.767 53.871Q7.109 53.871 7.362 53.738Q7.615 53.605 7.615 53.297Q7.615 53.140 7.521 53.025Q7.427 52.911 7.289 52.842Q7.150 52.774 6.983 52.736L6.402 52.637Q6.046 52.569 5.773 52.348Q5.499 52.128 5.499 51.786Q5.499 51.537 5.610 51.362Q5.721 51.188 5.908 51.089Q6.094 50.990 6.309 50.947Q6.525 50.904 6.767 50.904Q7.181 50.904 7.461 51.086L7.677 50.911Q7.687 50.908 7.694 50.906Q7.700 50.904 7.711 50.904L7.762 50.904Q7.789 50.904 7.813 50.928Q7.837 50.952 7.837 50.980L7.837 51.827Q7.837 51.848 7.813 51.875Q7.789 51.902 7.762 51.902L7.649 51.902Q7.622 51.902 7.596 51.877Q7.571 51.851 7.571 51.827Q7.571 51.591 7.465 51.427Q7.359 51.263 7.176 51.181Q6.993 51.099 6.761 51.099Q6.432 51.099 6.176 51.202Q5.920 51.304 5.920 51.581Q5.920 51.776 6.103 51.885Q6.285 51.995 6.514 52.036L7.089 52.142Q7.335 52.190 7.548 52.318Q7.762 52.446 7.899 52.649Q8.035 52.853 8.035 53.102Q8.035 53.615 7.670 53.854Q7.304 54.093 6.767 54.093Q6.272 54.093 5.940 53.799L5.674 54.073Q5.653 54.093 5.626 54.093L5.578 54.093Q5.554 54.093 5.527 54.066Q5.499 54.039 5.499 54.018\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M57.21-5.726h58.596\"\u002F>\u003Cpath stroke=\"none\" d=\"m55.21-5.726 3.2 1.6-1.2-1.6 1.2-1.6M117.806-5.726l-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg transform=\"translate(108.93 -63.284)\">\u003Cpath d=\"M-29.834 54.018L-29.834 52.955Q-29.834 52.931-29.806 52.904Q-29.779 52.877-29.755 52.877L-29.646 52.877Q-29.581 52.877-29.567 52.935Q-29.471 53.369-29.225 53.620Q-28.979 53.871-28.565 53.871Q-28.224 53.871-27.971 53.738Q-27.718 53.605-27.718 53.297Q-27.718 53.140-27.812 53.025Q-27.906 52.911-28.044 52.842Q-28.183 52.774-28.350 52.736L-28.931 52.637Q-29.287 52.569-29.560 52.348Q-29.834 52.128-29.834 51.786Q-29.834 51.537-29.722 51.362Q-29.611 51.188-29.425 51.089Q-29.239 50.990-29.023 50.947Q-28.808 50.904-28.565 50.904Q-28.152 50.904-27.872 51.086L-27.656 50.911Q-27.646 50.908-27.639 50.906Q-27.632 50.904-27.622 50.904L-27.571 50.904Q-27.544 50.904-27.520 50.928Q-27.496 50.952-27.496 50.980L-27.496 51.827Q-27.496 51.848-27.520 51.875Q-27.544 51.902-27.571 51.902L-27.684 51.902Q-27.711 51.902-27.737 51.877Q-27.762 51.851-27.762 51.827Q-27.762 51.591-27.868 51.427Q-27.974 51.263-28.157 51.181Q-28.340 51.099-28.572 51.099Q-28.900 51.099-29.157 51.202Q-29.413 51.304-29.413 51.581Q-29.413 51.776-29.230 51.885Q-29.047 51.995-28.818 52.036L-28.244 52.142Q-27.998 52.190-27.784 52.318Q-27.571 52.446-27.434 52.649Q-27.297 52.853-27.297 53.102Q-27.297 53.615-27.663 53.854Q-28.029 54.093-28.565 54.093Q-29.061 54.093-29.393 53.799L-29.659 54.073Q-29.680 54.093-29.707 54.093L-29.755 54.093Q-29.779 54.093-29.806 54.066Q-29.834 54.039-29.834 54.018M-24.987 54.025L-26.621 54.025L-26.621 53.745Q-26.392 53.745-26.243 53.711Q-26.094 53.676-26.094 53.536L-26.094 49.917Q-26.094 49.647-26.202 49.585Q-26.310 49.524-26.621 49.524L-26.621 49.243L-25.541 49.168L-25.541 51.554Q-25.435 51.369-25.257 51.227Q-25.079 51.086-24.871 51.012Q-24.662 50.939-24.437 50.939Q-23.931 50.939-23.647 51.162Q-23.363 51.386-23.363 51.882L-23.363 53.536Q-23.363 53.673-23.215 53.709Q-23.066 53.745-22.840 53.745L-22.840 54.025L-24.471 54.025L-24.471 53.745Q-24.242 53.745-24.093 53.711Q-23.944 53.676-23.944 53.536L-23.944 51.896Q-23.944 51.561-24.064 51.361Q-24.184 51.161-24.498 51.161Q-24.768 51.161-25.002 51.297Q-25.236 51.434-25.375 51.668Q-25.513 51.902-25.513 52.176L-25.513 53.536Q-25.513 53.673-25.363 53.709Q-25.212 53.745-24.987 53.745L-24.987 54.025M-20.636 54.025L-22.188 54.025L-22.188 53.745Q-21.962 53.745-21.813 53.711Q-21.665 53.676-21.665 53.536L-21.665 51.687Q-21.665 51.499-21.712 51.415Q-21.760 51.332-21.858 51.313Q-21.955 51.294-22.167 51.294L-22.167 51.014L-21.111 50.939L-21.111 53.536Q-21.111 53.676-20.979 53.711Q-20.848 53.745-20.636 53.745L-20.636 54.025M-21.907 49.718Q-21.907 49.547-21.784 49.428Q-21.661 49.308-21.490 49.308Q-21.323 49.308-21.200 49.428Q-21.077 49.547-21.077 49.718Q-21.077 49.893-21.200 50.016Q-21.323 50.139-21.490 50.139Q-21.661 50.139-21.784 50.016Q-21.907 49.893-21.907 49.718M-18.192 54.025L-19.925 54.025L-19.925 53.745Q-19.699 53.745-19.551 53.711Q-19.402 53.676-19.402 53.536L-19.402 51.287L-19.990 51.287L-19.990 51.007L-19.402 51.007L-19.402 50.190Q-19.402 49.872-19.224 49.624Q-19.046 49.377-18.756 49.236Q-18.465 49.096-18.154 49.096Q-17.898 49.096-17.695 49.238Q-17.491 49.380-17.491 49.623Q-17.491 49.759-17.590 49.858Q-17.690 49.958-17.826 49.958Q-17.963 49.958-18.062 49.858Q-18.161 49.759-18.161 49.623Q-18.161 49.442-18.021 49.349Q-18.100 49.322-18.199 49.322Q-18.407 49.322-18.561 49.455Q-18.715 49.588-18.795 49.792Q-18.876 49.995-18.876 50.204L-18.876 51.007L-17.987 51.007L-17.987 51.287L-18.848 51.287L-18.848 53.536Q-18.848 53.745-18.192 53.745L-18.192 54.025M-16.985 53.184L-16.985 51.287L-17.625 51.287L-17.625 51.065Q-17.307 51.065-17.090 50.855Q-16.873 50.645-16.772 50.335Q-16.671 50.026-16.671 49.718L-16.404 49.718L-16.404 51.007L-15.328 51.007L-15.328 51.287L-16.404 51.287L-16.404 53.171Q-16.404 53.447-16.300 53.646Q-16.196 53.844-15.936 53.844Q-15.779 53.844-15.673 53.740Q-15.567 53.635-15.517 53.482Q-15.468 53.328-15.468 53.171L-15.468 52.757L-15.201 52.757L-15.201 53.184Q-15.201 53.410-15.300 53.620Q-15.399 53.830-15.584 53.962Q-15.769 54.093-15.998 54.093Q-16.435 54.093-16.710 53.856Q-16.985 53.618-16.985 53.184\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M119.806 17.036h58.596\"\u002F>\u003Cpath stroke=\"none\" d=\"m117.806 17.036 3.2 1.6-1.2-1.6 1.2-1.6M180.402 17.036l-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg transform=\"translate(171.526 -40.522)\">\u003Cpath d=\"M-29.834 54.018L-29.834 52.955Q-29.834 52.931-29.806 52.904Q-29.779 52.877-29.755 52.877L-29.646 52.877Q-29.581 52.877-29.567 52.935Q-29.471 53.369-29.225 53.620Q-28.979 53.871-28.565 53.871Q-28.224 53.871-27.971 53.738Q-27.718 53.605-27.718 53.297Q-27.718 53.140-27.812 53.025Q-27.906 52.911-28.044 52.842Q-28.183 52.774-28.350 52.736L-28.931 52.637Q-29.287 52.569-29.560 52.348Q-29.834 52.128-29.834 51.786Q-29.834 51.537-29.722 51.362Q-29.611 51.188-29.425 51.089Q-29.239 50.990-29.023 50.947Q-28.808 50.904-28.565 50.904Q-28.152 50.904-27.872 51.086L-27.656 50.911Q-27.646 50.908-27.639 50.906Q-27.632 50.904-27.622 50.904L-27.571 50.904Q-27.544 50.904-27.520 50.928Q-27.496 50.952-27.496 50.980L-27.496 51.827Q-27.496 51.848-27.520 51.875Q-27.544 51.902-27.571 51.902L-27.684 51.902Q-27.711 51.902-27.737 51.877Q-27.762 51.851-27.762 51.827Q-27.762 51.591-27.868 51.427Q-27.974 51.263-28.157 51.181Q-28.340 51.099-28.572 51.099Q-28.900 51.099-29.157 51.202Q-29.413 51.304-29.413 51.581Q-29.413 51.776-29.230 51.885Q-29.047 51.995-28.818 52.036L-28.244 52.142Q-27.998 52.190-27.784 52.318Q-27.571 52.446-27.434 52.649Q-27.297 52.853-27.297 53.102Q-27.297 53.615-27.663 53.854Q-28.029 54.093-28.565 54.093Q-29.061 54.093-29.393 53.799L-29.659 54.073Q-29.680 54.093-29.707 54.093L-29.755 54.093Q-29.779 54.093-29.806 54.066Q-29.834 54.039-29.834 54.018M-24.987 54.025L-26.621 54.025L-26.621 53.745Q-26.392 53.745-26.243 53.711Q-26.094 53.676-26.094 53.536L-26.094 49.917Q-26.094 49.647-26.202 49.585Q-26.310 49.524-26.621 49.524L-26.621 49.243L-25.541 49.168L-25.541 51.554Q-25.435 51.369-25.257 51.227Q-25.079 51.086-24.871 51.012Q-24.662 50.939-24.437 50.939Q-23.931 50.939-23.647 51.162Q-23.363 51.386-23.363 51.882L-23.363 53.536Q-23.363 53.673-23.215 53.709Q-23.066 53.745-22.840 53.745L-22.840 54.025L-24.471 54.025L-24.471 53.745Q-24.242 53.745-24.093 53.711Q-23.944 53.676-23.944 53.536L-23.944 51.896Q-23.944 51.561-24.064 51.361Q-24.184 51.161-24.498 51.161Q-24.768 51.161-25.002 51.297Q-25.236 51.434-25.375 51.668Q-25.513 51.902-25.513 52.176L-25.513 53.536Q-25.513 53.673-25.363 53.709Q-25.212 53.745-24.987 53.745L-24.987 54.025M-20.636 54.025L-22.188 54.025L-22.188 53.745Q-21.962 53.745-21.813 53.711Q-21.665 53.676-21.665 53.536L-21.665 51.687Q-21.665 51.499-21.712 51.415Q-21.760 51.332-21.858 51.313Q-21.955 51.294-22.167 51.294L-22.167 51.014L-21.111 50.939L-21.111 53.536Q-21.111 53.676-20.979 53.711Q-20.848 53.745-20.636 53.745L-20.636 54.025M-21.907 49.718Q-21.907 49.547-21.784 49.428Q-21.661 49.308-21.490 49.308Q-21.323 49.308-21.200 49.428Q-21.077 49.547-21.077 49.718Q-21.077 49.893-21.200 50.016Q-21.323 50.139-21.490 50.139Q-21.661 50.139-21.784 50.016Q-21.907 49.893-21.907 49.718M-18.192 54.025L-19.925 54.025L-19.925 53.745Q-19.699 53.745-19.551 53.711Q-19.402 53.676-19.402 53.536L-19.402 51.287L-19.990 51.287L-19.990 51.007L-19.402 51.007L-19.402 50.190Q-19.402 49.872-19.224 49.624Q-19.046 49.377-18.756 49.236Q-18.465 49.096-18.154 49.096Q-17.898 49.096-17.695 49.238Q-17.491 49.380-17.491 49.623Q-17.491 49.759-17.590 49.858Q-17.690 49.958-17.826 49.958Q-17.963 49.958-18.062 49.858Q-18.161 49.759-18.161 49.623Q-18.161 49.442-18.021 49.349Q-18.100 49.322-18.199 49.322Q-18.407 49.322-18.561 49.455Q-18.715 49.588-18.795 49.792Q-18.876 49.995-18.876 50.204L-18.876 51.007L-17.987 51.007L-17.987 51.287L-18.848 51.287L-18.848 53.536Q-18.848 53.745-18.192 53.745L-18.192 54.025M-16.985 53.184L-16.985 51.287L-17.625 51.287L-17.625 51.065Q-17.307 51.065-17.090 50.855Q-16.873 50.645-16.772 50.335Q-16.671 50.026-16.671 49.718L-16.404 49.718L-16.404 51.007L-15.328 51.007L-15.328 51.287L-16.404 51.287L-16.404 53.171Q-16.404 53.447-16.300 53.646Q-16.196 53.844-15.936 53.844Q-15.779 53.844-15.673 53.740Q-15.567 53.635-15.517 53.482Q-15.468 53.328-15.468 53.171L-15.468 52.757L-15.201 52.757L-15.201 53.184Q-15.201 53.410-15.300 53.620Q-15.399 53.830-15.584 53.962Q-15.769 54.093-15.998 54.093Q-16.435 54.093-16.710 53.856Q-16.985 53.618-16.985 53.184\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The scattered spectrum: an intense Rayleigh line at the laser frequency flanked by weaker Raman sidebands, the Stokes line below and the fainter anti-Stokes line above, displaced by the vibrational frequency.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:324.951px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 243.713 335.812\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-44.785 245.815V88.48\"\u002F>\u003Cpath stroke=\"none\" d=\"m-44.785 86.48-1.6 3.2 1.6-1.2 1.6 1.2\"\u002F>\u003Cg stroke=\"none\" font-size=\"8\">\u003Cg transform=\"translate(-20.819 -151.645)\">\u003Cpath d=\"M-43.519 238.965Q-43.519 239.430-43.240 239.713Q-42.961 239.996-42.488 239.996Q-42.012 239.996-41.576 239.758Q-41.140 239.520-40.838 239.121Q-40.535 238.723-40.418 238.262L-39.715 235.430Q-39.687 235.348-39.687 235.277Q-39.687 234.957-40.265 234.957Q-40.371 234.926-40.371 234.828L-40.336 234.727Q-40.328 234.680-40.250 234.660L-38.539 234.660Q-38.496 234.660-38.469 234.697Q-38.441 234.734-38.441 234.781L-38.465 234.887Q-38.484 234.941-38.562 234.957Q-39.285 234.957-39.426 235.484L-40.137 238.348Q-40.265 238.863-40.623 239.311Q-40.980 239.758-41.478 240.025Q-41.976 240.293-42.504 240.293Q-42.961 240.293-43.359 240.102Q-43.758 239.910-43.992 239.551Q-44.226 239.191-44.226 238.727Q-44.226 238.488-44.168 238.293L-43.402 235.203Q-43.379 235.133-43.379 235.070Q-43.379 235.008-43.441 234.988Q-43.586 234.957-44.008 234.957Q-44.113 234.930-44.113 234.828L-44.082 234.727Q-44.074 234.680-43.992 234.660L-41.832 234.660Q-41.793 234.660-41.765 234.697Q-41.738 234.734-41.738 234.781L-41.762 234.887Q-41.781 234.941-41.855 234.957Q-42.297 234.957-42.457 234.996Q-42.605 235.031-42.664 235.262L-43.426 238.316Q-43.508 238.637-43.519 238.965\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-20.819 -151.645)\">\u003Cpath d=\"M-35.566 242.117Q-36.179 241.660-36.581 241.025Q-36.984 240.391-37.179 239.645Q-37.374 238.898-37.374 238.125Q-37.374 237.352-37.179 236.605Q-36.984 235.859-36.581 235.225Q-36.179 234.590-35.566 234.133Q-35.554 234.129-35.546 234.127Q-35.538 234.125-35.527 234.125L-35.449 234.125Q-35.410 234.125-35.384 234.152Q-35.359 234.180-35.359 234.223Q-35.359 234.273-35.390 234.293Q-35.898 234.746-36.220 235.369Q-36.542 235.992-36.683 236.688Q-36.824 237.383-36.824 238.125Q-36.824 238.859-36.685 239.559Q-36.546 240.258-36.222 240.883Q-35.898 241.508-35.390 241.957Q-35.359 241.977-35.359 242.027Q-35.359 242.070-35.384 242.098Q-35.410 242.125-35.449 242.125L-35.527 242.125Q-35.535 242.121-35.544 242.119Q-35.554 242.117-35.566 242.117\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-20.819 -151.645)\">\u003Cpath d=\"M-34.182 239.949Q-34.178 239.930-34.176 239.916Q-34.174 239.902-34.174 239.879L-33.580 237.508Q-33.541 237.352-33.541 237.215Q-33.541 237.066-33.594 236.959Q-33.647 236.852-33.779 236.852Q-33.959 236.852-34.078 237.021Q-34.197 237.191-34.254 237.377Q-34.311 237.563-34.381 237.852Q-34.393 237.926-34.463 237.926L-34.565 237.926Q-34.600 237.926-34.627 237.891Q-34.654 237.855-34.654 237.828L-34.654 237.797Q-34.568 237.465-34.475 237.223Q-34.381 236.980-34.205 236.789Q-34.029 236.598-33.764 236.598Q-33.479 236.598-33.246 236.746Q-33.014 236.895-32.947 237.148Q-32.740 236.895-32.471 236.746Q-32.201 236.598-31.885 236.598Q-31.705 236.598-31.549 236.670Q-31.393 236.742-31.299 236.879Q-31.205 237.016-31.205 237.195Q-31.205 237.410-31.338 237.568Q-31.471 237.727-31.678 237.727Q-31.811 237.727-31.904 237.643Q-31.998 237.559-31.998 237.422Q-31.998 237.246-31.877 237.113Q-31.756 236.980-31.588 236.957Q-31.721 236.852-31.900 236.852Q-32.248 236.852-32.518 237.088Q-32.787 237.324-32.982 237.684L-33.541 239.918Q-33.572 240.043-33.678 240.123Q-33.783 240.203-33.908 240.203Q-34.018 240.203-34.100 240.133Q-34.182 240.063-34.182 239.949\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-20.819 -151.645)\">\u003Cpath d=\"M-30.164 242.125L-30.246 242.125Q-30.282 242.125-30.307 242.096Q-30.332 242.066-30.332 242.027Q-30.332 241.977-30.301 241.957Q-29.914 241.621-29.631 241.172Q-29.348 240.723-29.182 240.223Q-29.016 239.723-28.942 239.205Q-28.867 238.688-28.867 238.125Q-28.867 237.555-28.942 237.039Q-29.016 236.523-29.182 236.027Q-29.348 235.531-29.627 235.084Q-29.907 234.637-30.301 234.293Q-30.332 234.273-30.332 234.223Q-30.332 234.184-30.307 234.154Q-30.282 234.125-30.246 234.125L-30.164 234.125Q-30.153 234.125-30.143 234.127Q-30.133 234.129-30.125 234.133Q-29.512 234.590-29.110 235.225Q-28.707 235.859-28.512 236.605Q-28.317 237.352-28.317 238.125Q-28.317 238.898-28.512 239.645Q-28.707 240.391-29.110 241.025Q-29.512 241.660-30.125 242.117Q-30.137 242.117-30.145 242.119Q-30.153 242.121-30.164 242.125\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-44.785 240.125h202.86\"\u002F>\u003Cpath stroke=\"none\" d=\"m160.075 240.125-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg transform=\"translate(202.824 6.977)\">\u003Cpath d=\"M-44.090 239.949Q-44.086 239.930-44.084 239.916Q-44.082 239.902-44.082 239.879L-43.488 237.508Q-43.449 237.352-43.449 237.215Q-43.449 237.066-43.502 236.959Q-43.555 236.852-43.687 236.852Q-43.867 236.852-43.986 237.021Q-44.105 237.191-44.162 237.377Q-44.219 237.563-44.289 237.852Q-44.301 237.926-44.371 237.926L-44.472 237.926Q-44.508 237.926-44.535 237.891Q-44.562 237.855-44.562 237.828L-44.562 237.797Q-44.476 237.465-44.383 237.223Q-44.289 236.980-44.113 236.789Q-43.937 236.598-43.672 236.598Q-43.387 236.598-43.154 236.746Q-42.922 236.895-42.855 237.148Q-42.648 236.895-42.379 236.746Q-42.109 236.598-41.793 236.598Q-41.613 236.598-41.457 236.670Q-41.301 236.742-41.207 236.879Q-41.113 237.016-41.113 237.195Q-41.113 237.410-41.246 237.568Q-41.379 237.727-41.586 237.727Q-41.719 237.727-41.812 237.643Q-41.906 237.559-41.906 237.422Q-41.906 237.246-41.785 237.113Q-41.664 236.980-41.496 236.957Q-41.629 236.852-41.808 236.852Q-42.156 236.852-42.426 237.088Q-42.695 237.324-42.890 237.684L-43.449 239.918Q-43.480 240.043-43.586 240.123Q-43.691 240.203-43.816 240.203Q-43.926 240.203-44.008 240.133Q-44.090 240.063-44.090 239.949\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"m-13.487 200.946.765 2.307.765 2.235.765 2.166.765 2.096.765 2.026.765 1.957.765 1.886.765 1.816.765 1.747.765 1.676.765 1.607.765 1.536.765 1.467.765 1.397.765 1.327.765 1.257.765 1.187.765 1.117.765 1.047.765.977.765.908.765.837.765.767.765.698.765.627.765.558.765.488.764.417.765.348.765.278.765.208.765.138.765.068.765-.002.765-.071.765-.142.765-.211.765-.282.765-.351.765-.422.765-.49.765-.562.765-.631.765-.702.765-.77.765-.841.765-.911.765-.98.765-1.052.765-1.12.765-1.19.765-1.261.765-1.33.765-1.401.765-1.47.765-1.54.765-1.61.765-1.68.765-1.751.765-1.82.765-1.89.765-1.96.765-2.029.765-2.1.765-2.17.765-2.239.765-2.31.765-2.379.765-2.45.765-2.518.765-2.589.765-2.66.765-2.728.765-2.799.765-2.87.765-2.937.764-3.01.765-3.078.765-3.148.765-3.219.765-3.288.765-3.359.765-3.428.765-3.498.765-3.569.765-3.638.765-3.708.765-3.778.765-3.847.765-3.918.765-3.988.765-4.058.765-4.127.765-4.197.765-4.268.765-4.337.765-4.408.765-4.477.765-4.547.765-4.617.765-4.687.765-4.757.765-4.827.765-4.896.765-4.967.765-5.037.765-5.107.765-5.176.765-5.246.765-5.317.765-5.386.765-5.456.765-5.526.765-5.596.765-5.666.765-5.736.765-5.806.765-5.876.765-5.945\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(4.84 -40.93)\">\u003Cpath d=\"M-44.512 240.658Q-44.512 240.412-44.315 240.228Q-44.118 240.043-43.862 239.964Q-43.999 239.852-44.071 239.691Q-44.142 239.530-44.142 239.349Q-44.142 239.028-43.931 238.782Q-44.265 238.484-44.265 238.074Q-44.265 237.613-43.876 237.326Q-43.486 237.039-43.008 237.039Q-42.536 237.039-42.201 237.285Q-42.027 237.131-41.816 237.049Q-41.606 236.967-41.377 236.967Q-41.213 236.967-41.092 237.074Q-40.971 237.182-40.971 237.346Q-40.971 237.442-41.042 237.514Q-41.114 237.585-41.206 237.585Q-41.306 237.585-41.376 237.512Q-41.446 237.438-41.446 237.339Q-41.446 237.285-41.432 237.254L-41.425 237.240Q-41.418 237.220-41.410 237.209Q-41.401 237.199-41.398 237.192Q-41.753 237.192-42.040 237.415Q-41.753 237.708-41.753 238.074Q-41.753 238.389-41.938 238.621Q-42.122 238.854-42.411 238.982Q-42.700 239.110-43.008 239.110Q-43.209 239.110-43.401 239.060Q-43.592 239.011-43.770 238.901Q-43.862 239.028-43.862 239.171Q-43.862 239.353-43.734 239.488Q-43.606 239.623-43.421 239.623L-42.789 239.623Q-42.341 239.623-41.972 239.694Q-41.603 239.766-41.343 239.995Q-41.083 240.224-41.083 240.658Q-41.083 240.979-41.379 241.181Q-41.675 241.383-42.078 241.472Q-42.481 241.561-42.796 241.561Q-43.114 241.561-43.517 241.472Q-43.920 241.383-44.216 241.181Q-44.512 240.979-44.512 240.658M-44.057 240.658Q-44.057 240.887-43.838 241.036Q-43.619 241.185-43.327 241.253Q-43.035 241.321-42.796 241.321Q-42.632 241.321-42.423 241.285Q-42.215 241.250-42.008 241.169Q-41.801 241.089-41.670 240.961Q-41.538 240.833-41.538 240.658Q-41.538 240.306-41.919 240.212Q-42.300 240.118-42.803 240.118L-43.421 240.118Q-43.660 240.118-43.859 240.269Q-44.057 240.419-44.057 240.658M-43.008 238.871Q-42.341 238.871-42.341 238.074Q-42.341 237.274-43.008 237.274Q-43.678 237.274-43.678 238.074Q-43.678 238.871-43.008 238.871M-38.739 240.125L-40.475 240.125L-40.475 239.845Q-40.246 239.845-40.097 239.811Q-39.949 239.776-39.949 239.636L-39.949 237.787Q-39.949 237.517-40.056 237.456Q-40.164 237.394-40.475 237.394L-40.475 237.114L-39.446 237.039L-39.446 237.746Q-39.316 237.438-39.074 237.239Q-38.831 237.039-38.513 237.039Q-38.294 237.039-38.123 237.163Q-37.952 237.288-37.952 237.500Q-37.952 237.637-38.052 237.736Q-38.151 237.835-38.284 237.835Q-38.421 237.835-38.520 237.736Q-38.619 237.637-38.619 237.500Q-38.619 237.360-38.520 237.261Q-38.810 237.261-39.010 237.457Q-39.210 237.654-39.303 237.948Q-39.395 238.242-39.395 238.522L-39.395 239.636Q-39.395 239.845-38.739 239.845L-38.739 240.125M-37.409 238.642Q-37.409 238.300-37.274 238.001Q-37.139 237.702-36.900 237.478Q-36.660 237.254-36.343 237.129Q-36.025 237.004-35.693 237.004Q-35.249 237.004-34.849 237.220Q-34.449 237.435-34.215 237.813Q-33.981 238.190-33.981 238.642Q-33.981 238.983-34.123 239.267Q-34.264 239.551-34.509 239.758Q-34.753 239.964-35.063 240.079Q-35.372 240.193-35.693 240.193Q-36.124 240.193-36.525 239.992Q-36.927 239.790-37.168 239.438Q-37.409 239.086-37.409 238.642M-35.693 239.944Q-35.092 239.944-34.868 239.566Q-34.644 239.188-34.644 238.556Q-34.644 237.944-34.878 237.585Q-35.112 237.227-35.693 237.227Q-36.746 237.227-36.746 238.556Q-36.746 239.188-36.520 239.566Q-36.295 239.944-35.693 239.944M-32.812 239.291L-32.812 237.787Q-32.812 237.517-32.920 237.456Q-33.027 237.394-33.338 237.394L-33.338 237.114L-32.231 237.039L-32.231 239.271L-32.231 239.291Q-32.231 239.571-32.180 239.715Q-32.128 239.858-31.986 239.915Q-31.845 239.971-31.557 239.971Q-31.305 239.971-31.099 239.831Q-30.894 239.691-30.778 239.465Q-30.662 239.240-30.662 238.990L-30.662 237.787Q-30.662 237.517-30.770 237.456Q-30.877 237.394-31.188 237.394L-31.188 237.114L-30.081 237.039L-30.081 239.452Q-30.081 239.643-30.028 239.725Q-29.975 239.807-29.874 239.826Q-29.773 239.845-29.558 239.845L-29.558 240.125L-30.635 240.193L-30.635 239.629Q-30.744 239.811-30.889 239.934Q-31.035 240.057-31.221 240.125Q-31.407 240.193-31.609 240.193Q-32.812 240.193-32.812 239.291M-27.288 240.125L-28.922 240.125L-28.922 239.845Q-28.693 239.845-28.545 239.811Q-28.396 239.776-28.396 239.636L-28.396 237.787Q-28.396 237.517-28.504 237.456Q-28.611 237.394-28.922 237.394L-28.922 237.114L-27.863 237.039L-27.863 237.688Q-27.692 237.380-27.388 237.209Q-27.083 237.039-26.738 237.039Q-26.232 237.039-25.949 237.262Q-25.665 237.486-25.665 237.982L-25.665 239.636Q-25.665 239.773-25.516 239.809Q-25.368 239.845-25.142 239.845L-25.142 240.125L-26.772 240.125L-26.772 239.845Q-26.543 239.845-26.395 239.811Q-26.246 239.776-26.246 239.636L-26.246 237.996Q-26.246 237.661-26.366 237.461Q-26.485 237.261-26.800 237.261Q-27.070 237.261-27.304 237.397Q-27.538 237.534-27.676 237.768Q-27.815 238.002-27.815 238.276L-27.815 239.636Q-27.815 239.773-27.664 239.809Q-27.514 239.845-27.288 239.845L-27.288 240.125M-24.554 238.614Q-24.554 238.276-24.414 237.985Q-24.274 237.695-24.029 237.481Q-23.785 237.268-23.481 237.153Q-23.177 237.039-22.852 237.039Q-22.582 237.039-22.319 237.138Q-22.056 237.237-21.864 237.415L-21.864 236.017Q-21.864 235.747-21.972 235.685Q-22.079 235.624-22.390 235.624L-22.390 235.343L-21.314 235.268L-21.314 239.452Q-21.314 239.640-21.259 239.723Q-21.204 239.807-21.104 239.826Q-21.003 239.845-20.787 239.845L-20.787 240.125L-21.895 240.193L-21.895 239.776Q-22.312 240.193-22.937 240.193Q-23.368 240.193-23.741 239.981Q-24.113 239.770-24.334 239.409Q-24.554 239.048-24.554 238.614M-22.879 239.971Q-22.671 239.971-22.484 239.899Q-22.298 239.828-22.144 239.691Q-21.991 239.554-21.895 239.376L-21.895 237.767Q-21.980 237.620-22.126 237.500Q-22.271 237.380-22.440 237.321Q-22.609 237.261-22.790 237.261Q-23.351 237.261-23.619 237.650Q-23.888 238.040-23.888 238.621Q-23.888 239.192-23.653 239.582Q-23.419 239.971-22.879 239.971\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-.683 230.166h25.607\"\u002F>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"m17.81 117.778.814 2.244.812 2.178.813 2.113.813 2.049.812 1.982.813 1.919.813 1.853.813 1.788.812 1.723.813 1.658.813 1.593.813 1.529.812 1.463.813 1.398.813 1.333.813 1.268.812 1.203.813 1.138.813 1.073.813 1.008.812.943.813.879.813.812.812.748.813.684.813.618.813.553.812.488.813.423.813.358.813.293.812.228.813.163.813.098.813.033.812-.032.813-.096.813-.162.813-.227.812-.293.813-.356.813-.422.812-.487.813-.552.813-.617.813-.682.812-.747.813-.812.813-.877.813-.942.812-1.007.813-1.072.813-1.137.813-1.202.812-1.267.813-1.332.813-1.397.813-1.462.812-1.527.813-1.592.813-1.657.812-1.722.813-1.787.813-1.852.813-1.917.812-1.982.813-2.047.813-2.112.813-2.177.812-2.242.813-2.307.813-2.372.813-2.437.812-2.502.813-2.567.813-2.632.813-2.697.812-2.763.813-2.827.813-2.892.812-2.956.813-3.023.813-3.087.813-3.152.812-3.217.813-3.282.813-3.347.813-3.412.812-3.478.813-3.541.813-3.607.813-3.672.812-3.738.813-3.802.813-3.867.813-3.932.812-3.997.813-4.062.813-4.128.812-4.191.813-4.258.813-4.322.813-4.387.812-4.452.813-4.517.813-4.582.813-4.648.812-4.712.813-4.776.813-4.843.813-4.907.812-4.972.813-5.038.813-5.101.813-5.167.812-5.233.813-5.297.813-5.363.813-5.426\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg transform=\"translate(145.797 -122.761)\">\u003Cpath d=\"M-44.512 238.590Q-44.512 238.269-44.387 237.980Q-44.262 237.691-44.036 237.468Q-43.811 237.244-43.515 237.124Q-43.220 237.004-42.902 237.004Q-42.574 237.004-42.312 237.104Q-42.051 237.203-41.875 237.385Q-41.699 237.568-41.605 237.826Q-41.511 238.084-41.511 238.416Q-41.511 238.508-41.593 238.529L-43.848 238.529L-43.848 238.590Q-43.848 239.178-43.565 239.561Q-43.281 239.944-42.714 239.944Q-42.392 239.944-42.124 239.751Q-41.856 239.558-41.767 239.243Q-41.760 239.202-41.685 239.188L-41.593 239.188Q-41.511 239.212-41.511 239.284Q-41.511 239.291-41.517 239.318Q-41.630 239.715-42.001 239.954Q-42.372 240.193-42.796 240.193Q-43.233 240.193-43.633 239.985Q-44.033 239.776-44.272 239.409Q-44.512 239.042-44.512 238.590M-43.842 238.320L-42.027 238.320Q-42.027 238.043-42.124 237.791Q-42.222 237.538-42.420 237.382Q-42.618 237.227-42.902 237.227Q-43.179 237.227-43.392 237.385Q-43.606 237.544-43.724 237.799Q-43.842 238.054-43.842 238.320M-39.740 240.125L-41.063 240.125L-41.063 239.845Q-40.502 239.845-40.123 239.445L-39.409 238.648L-40.321 237.599Q-40.458 237.452-40.607 237.420Q-40.755 237.387-41.022 237.387L-41.022 237.107L-39.521 237.107L-39.521 237.387Q-39.713 237.387-39.713 237.521Q-39.713 237.551-39.682 237.599L-39.087 238.283L-38.646 237.787Q-38.534 237.657-38.534 237.541Q-38.534 237.479-38.571 237.433Q-38.609 237.387-38.667 237.387L-38.667 237.107L-37.351 237.107L-37.351 237.387Q-37.911 237.387-38.291 237.787L-38.913 238.488L-37.918 239.636Q-37.819 239.735-37.718 239.780Q-37.618 239.824-37.506 239.834Q-37.395 239.845-37.218 239.845L-37.218 240.125L-38.711 240.125L-38.711 239.845Q-38.646 239.845-38.587 239.811Q-38.527 239.776-38.527 239.711Q-38.527 239.664-38.557 239.636L-39.234 238.850L-39.767 239.445Q-39.880 239.575-39.880 239.691Q-39.880 239.756-39.839 239.800Q-39.798 239.845-39.740 239.845L-39.740 240.125M-36.722 238.614Q-36.722 238.286-36.587 237.985Q-36.452 237.685-36.216 237.464Q-35.980 237.244-35.676 237.124Q-35.372 237.004-35.047 237.004Q-34.541 237.004-34.193 237.107Q-33.844 237.209-33.844 237.585Q-33.844 237.732-33.941 237.833Q-34.039 237.934-34.186 237.934Q-34.340 237.934-34.439 237.835Q-34.538 237.736-34.538 237.585Q-34.538 237.397-34.398 237.305Q-34.599 237.254-35.040 237.254Q-35.396 237.254-35.625 237.450Q-35.854 237.647-35.955 237.956Q-36.056 238.266-36.056 238.614Q-36.056 238.963-35.929 239.269Q-35.803 239.575-35.548 239.759Q-35.293 239.944-34.938 239.944Q-34.716 239.944-34.531 239.860Q-34.347 239.776-34.212 239.621Q-34.077 239.465-34.018 239.257Q-34.005 239.202-33.950 239.202L-33.837 239.202Q-33.806 239.202-33.784 239.226Q-33.762 239.250-33.762 239.284L-33.762 239.305Q-33.847 239.592-34.035 239.790Q-34.223 239.988-34.488 240.091Q-34.753 240.193-35.047 240.193Q-35.478 240.193-35.866 239.987Q-36.254 239.780-36.488 239.417Q-36.722 239.055-36.722 238.614M-31.557 240.125L-33.109 240.125L-33.109 239.845Q-32.884 239.845-32.735 239.811Q-32.586 239.776-32.586 239.636L-32.586 237.787Q-32.586 237.599-32.634 237.515Q-32.682 237.432-32.779 237.413Q-32.877 237.394-33.089 237.394L-33.089 237.114L-32.033 237.039L-32.033 239.636Q-32.033 239.776-31.901 239.811Q-31.769 239.845-31.557 239.845L-31.557 240.125M-32.829 235.818Q-32.829 235.647-32.706 235.528Q-32.583 235.408-32.412 235.408Q-32.244 235.408-32.121 235.528Q-31.998 235.647-31.998 235.818Q-31.998 235.993-32.121 236.116Q-32.244 236.239-32.412 236.239Q-32.583 236.239-32.706 236.116Q-32.829 235.993-32.829 235.818M-30.385 239.284L-30.385 237.387L-31.024 237.387L-31.024 237.165Q-30.706 237.165-30.489 236.955Q-30.272 236.745-30.171 236.435Q-30.071 236.126-30.071 235.818L-29.804 235.818L-29.804 237.107L-28.727 237.107L-28.727 237.387L-29.804 237.387L-29.804 239.271Q-29.804 239.547-29.700 239.746Q-29.596 239.944-29.336 239.944Q-29.179 239.944-29.073 239.840Q-28.967 239.735-28.917 239.582Q-28.868 239.428-28.868 239.271L-28.868 238.857L-28.601 238.857L-28.601 239.284Q-28.601 239.510-28.700 239.720Q-28.799 239.930-28.984 240.062Q-29.168 240.193-29.397 240.193Q-29.835 240.193-30.110 239.956Q-30.385 239.718-30.385 239.284M-27.832 238.590Q-27.832 238.269-27.707 237.980Q-27.582 237.691-27.357 237.468Q-27.131 237.244-26.836 237.124Q-26.540 237.004-26.222 237.004Q-25.894 237.004-25.632 237.104Q-25.371 237.203-25.195 237.385Q-25.019 237.568-24.925 237.826Q-24.831 238.084-24.831 238.416Q-24.831 238.508-24.913 238.529L-27.169 238.529L-27.169 238.590Q-27.169 239.178-26.885 239.561Q-26.601 239.944-26.034 239.944Q-25.713 239.944-25.444 239.751Q-25.176 239.558-25.087 239.243Q-25.080 239.202-25.005 239.188L-24.913 239.188Q-24.831 239.212-24.831 239.284Q-24.831 239.291-24.838 239.318Q-24.951 239.715-25.321 239.954Q-25.692 240.193-26.116 240.193Q-26.554 240.193-26.953 239.985Q-27.353 239.776-27.593 239.409Q-27.832 239.042-27.832 238.590M-27.162 238.320L-25.347 238.320Q-25.347 238.043-25.444 237.791Q-25.542 237.538-25.740 237.382Q-25.938 237.227-26.222 237.227Q-26.499 237.227-26.712 237.385Q-26.926 237.544-27.044 237.799Q-27.162 238.054-27.162 238.320M-24.243 238.614Q-24.243 238.276-24.103 237.985Q-23.963 237.695-23.718 237.481Q-23.474 237.268-23.170 237.153Q-22.866 237.039-22.541 237.039Q-22.271 237.039-22.008 237.138Q-21.744 237.237-21.553 237.415L-21.553 236.017Q-21.553 235.747-21.661 235.685Q-21.768 235.624-22.079 235.624L-22.079 235.343L-21.003 235.268L-21.003 239.452Q-21.003 239.640-20.948 239.723Q-20.893 239.807-20.793 239.826Q-20.692 239.845-20.476 239.845L-20.476 240.125L-21.584 240.193L-21.584 239.776Q-22.001 240.193-22.626 240.193Q-23.057 240.193-23.430 239.981Q-23.802 239.770-24.023 239.409Q-24.243 239.048-24.243 238.614M-22.568 239.971Q-22.360 239.971-22.173 239.899Q-21.987 239.828-21.833 239.691Q-21.680 239.554-21.584 239.376L-21.584 237.767Q-21.669 237.620-21.815 237.500Q-21.960 237.380-22.129 237.321Q-22.298 237.261-22.479 237.261Q-23.040 237.261-23.308 237.650Q-23.577 238.040-23.577 238.621Q-23.577 239.192-23.342 239.582Q-23.108 239.971-22.568 239.971\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M27.77 147.654h36.988M27.77 133.427h36.988M27.77 119.2h36.988\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M12.12 228.744v-94.962\"\u002F>\u003Cpath stroke=\"none\" d=\"m12.12 130.582-2.56 5.12 2.56-1.92 2.56 1.92\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-dasharray:3.0,3.0\">\u003Cpath fill=\"none\" d=\"M12.12 240.125v5.69\"\u002F>\u003Cg stroke=\"none\" font-size=\"7\">\u003Cg transform=\"translate(43.035 14.085)\">\u003Cpath d=\"M-42.673 240.125L-44.406 240.125L-44.406 239.845Q-44.180 239.845-44.031 239.811Q-43.883 239.776-43.883 239.636L-43.883 237.387L-44.471 237.387L-44.471 237.107L-43.883 237.107L-43.883 236.290Q-43.883 235.972-43.705 235.724Q-43.527 235.477-43.237 235.336Q-42.946 235.196-42.635 235.196Q-42.379 235.196-42.175 235.338Q-41.972 235.480-41.972 235.723Q-41.972 235.859-42.071 235.958Q-42.170 236.058-42.307 236.058Q-42.444 236.058-42.543 235.958Q-42.642 235.859-42.642 235.723Q-42.642 235.542-42.502 235.449Q-42.580 235.422-42.680 235.422Q-42.888 235.422-43.042 235.555Q-43.196 235.688-43.276 235.892Q-43.356 236.095-43.356 236.304L-43.356 237.107L-42.468 237.107L-42.468 237.387L-43.329 237.387L-43.329 239.636Q-43.329 239.845-42.673 239.845L-42.673 240.125M-40.243 240.125L-41.979 240.125L-41.979 239.845Q-41.750 239.845-41.601 239.811Q-41.452 239.776-41.452 239.636L-41.452 237.787Q-41.452 237.517-41.560 237.456Q-41.668 237.394-41.979 237.394L-41.979 237.114L-40.950 237.039L-40.950 237.746Q-40.820 237.438-40.577 237.239Q-40.335 237.039-40.017 237.039Q-39.798 237.039-39.627 237.163Q-39.456 237.288-39.456 237.500Q-39.456 237.637-39.556 237.736Q-39.655 237.835-39.788 237.835Q-39.925 237.835-40.024 237.736Q-40.123 237.637-40.123 237.500Q-40.123 237.360-40.024 237.261Q-40.314 237.261-40.514 237.457Q-40.714 237.654-40.806 237.948Q-40.899 238.242-40.899 238.522L-40.899 239.636Q-40.899 239.845-40.243 239.845L-40.243 240.125M-38.913 238.642Q-38.913 238.300-38.778 238.001Q-38.643 237.702-38.404 237.478Q-38.164 237.254-37.847 237.129Q-37.529 237.004-37.197 237.004Q-36.753 237.004-36.353 237.220Q-35.953 237.435-35.719 237.813Q-35.485 238.190-35.485 238.642Q-35.485 238.983-35.627 239.267Q-35.768 239.551-36.013 239.758Q-36.257 239.964-36.566 240.079Q-36.876 240.193-37.197 240.193Q-37.628 240.193-38.029 239.992Q-38.431 239.790-38.672 239.438Q-38.913 239.086-38.913 238.642M-37.197 239.944Q-36.596 239.944-36.372 239.566Q-36.148 239.188-36.148 238.556Q-36.148 237.944-36.382 237.585Q-36.616 237.227-37.197 237.227Q-38.250 237.227-38.250 238.556Q-38.250 239.188-38.024 239.566Q-37.799 239.944-37.197 239.944M-32.159 240.125L-34.832 240.125Q-34.876 240.125-34.904 240.098Q-34.931 240.070-34.931 240.026L-34.931 239.958Q-34.931 239.917-34.904 239.886L-32.795 237.333L-33.434 237.333Q-33.858 237.333-34.090 237.399Q-34.323 237.466-34.442 237.676Q-34.562 237.886-34.562 238.307L-34.825 238.307L-34.743 237.107L-32.152 237.107Q-32.111 237.107-32.082 237.134Q-32.053 237.162-32.053 237.206L-32.053 237.254Q-32.053 237.298-32.077 237.326L-34.182 239.872L-33.502 239.872Q-33.174 239.872-32.957 239.836Q-32.740 239.800-32.573 239.650Q-32.432 239.513-32.379 239.289Q-32.327 239.065-32.299 238.737L-32.033 238.737L-32.159 240.125M-31.383 238.590Q-31.383 238.269-31.258 237.980Q-31.134 237.691-30.908 237.468Q-30.682 237.244-30.387 237.124Q-30.091 237.004-29.773 237.004Q-29.445 237.004-29.184 237.104Q-28.922 237.203-28.746 237.385Q-28.570 237.568-28.476 237.826Q-28.382 238.084-28.382 238.416Q-28.382 238.508-28.464 238.529L-30.720 238.529L-30.720 238.590Q-30.720 239.178-30.436 239.561Q-30.153 239.944-29.585 239.944Q-29.264 239.944-28.996 239.751Q-28.727 239.558-28.639 239.243Q-28.632 239.202-28.556 239.188L-28.464 239.188Q-28.382 239.212-28.382 239.284Q-28.382 239.291-28.389 239.318Q-28.502 239.715-28.873 239.954Q-29.243 240.193-29.667 240.193Q-30.105 240.193-30.505 239.985Q-30.905 239.776-31.144 239.409Q-31.383 239.042-31.383 238.590M-30.713 238.320L-28.898 238.320Q-28.898 238.043-28.996 237.791Q-29.093 237.538-29.291 237.382Q-29.490 237.227-29.773 237.227Q-30.050 237.227-30.264 237.385Q-30.477 237.544-30.595 237.799Q-30.713 238.054-30.713 238.320M-26.113 240.125L-27.746 240.125L-27.746 239.845Q-27.517 239.845-27.369 239.811Q-27.220 239.776-27.220 239.636L-27.220 237.787Q-27.220 237.517-27.328 237.456Q-27.435 237.394-27.746 237.394L-27.746 237.114L-26.687 237.039L-26.687 237.688Q-26.516 237.380-26.212 237.209Q-25.908 237.039-25.562 237.039Q-25.056 237.039-24.773 237.262Q-24.489 237.486-24.489 237.982L-24.489 239.636Q-24.489 239.773-24.340 239.809Q-24.192 239.845-23.966 239.845L-23.966 240.125L-25.597 240.125L-25.597 239.845Q-25.368 239.845-25.219 239.811Q-25.070 239.776-25.070 239.636L-25.070 237.996Q-25.070 237.661-25.190 237.461Q-25.309 237.261-25.624 237.261Q-25.894 237.261-26.128 237.397Q-26.362 237.534-26.501 237.768Q-26.639 238.002-26.639 238.276L-26.639 239.636Q-26.639 239.773-26.489 239.809Q-26.338 239.845-26.113 239.845\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(43.035 14.085)\">\u003Cpath d=\"M-20.190 239.971Q-20.190 239.923-20.183 239.899L-19.671 237.835Q-19.637 237.708-19.637 237.592Q-19.637 237.452-19.690 237.356Q-19.743 237.261-19.866 237.261Q-20.088 237.261-20.189 237.488Q-20.289 237.715-20.399 238.136Q-20.409 238.201-20.471 238.201L-20.580 238.201Q-20.611 238.201-20.635 238.170Q-20.659 238.139-20.659 238.115L-20.659 238.088Q-20.546 237.654-20.365 237.346Q-20.183 237.039-19.852 237.039Q-19.596 237.039-19.384 237.167Q-19.172 237.295-19.110 237.521Q-18.700 237.039-18.133 237.039Q-17.846 237.039-17.620 237.175Q-17.394 237.312-17.394 237.579Q-17.394 237.767-17.514 237.900Q-17.634 238.033-17.815 238.033Q-17.931 238.033-18.013 237.960Q-18.095 237.886-18.095 237.767Q-18.095 237.626-18.004 237.512Q-17.914 237.397-17.781 237.367Q-17.931 237.261-18.146 237.261Q-18.741 237.261-19.138 238.020L-19.623 239.937Q-19.647 240.043-19.741 240.118Q-19.835 240.193-19.951 240.193Q-20.050 240.193-20.120 240.132Q-20.190 240.070-20.190 239.971\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The Franck-Condon principle: nuclei are fixed during the fast electronic jump, so the transition is vertical; with the upper curve displaced outward, the strongest line lands on the upper vibrational level whose turning point sits above the lower ground state.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:477.992px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 358.494 142.633\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-22.822 37.049h271.147\"\u002F>\u003Cpath stroke=\"none\" d=\"m250.325 37.049-3.2-1.6 1.2 1.6-1.2 1.6\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(246.58 9.089)\">\u003Cpath d=\"M-20.701 38.600L-22.556 38.600L-22.556 38.307Q-22.287 38.307-22.119 38.262Q-21.951 38.217-21.951 38.041L-21.951 34.217Q-21.951 34.010-22.107 33.957Q-22.263 33.904-22.556 33.904L-22.556 33.608L-21.334 33.522L-21.334 33.986Q-21.103 33.764-20.789 33.643Q-20.474 33.522-20.134 33.522Q-19.662 33.522-19.258 33.768Q-18.853 34.014-18.621 34.430Q-18.388 34.846-18.388 35.322Q-18.388 35.697-18.537 36.026Q-18.685 36.354-18.955 36.606Q-19.224 36.858-19.568 36.992Q-19.912 37.127-20.271 37.127Q-20.560 37.127-20.832 37.006Q-21.103 36.885-21.310 36.674L-21.310 38.041Q-21.310 38.217-21.142 38.262Q-20.974 38.307-20.701 38.307L-20.701 38.600M-21.310 34.385L-21.310 36.225Q-21.158 36.514-20.896 36.694Q-20.634 36.873-20.326 36.873Q-20.041 36.873-19.818 36.735Q-19.595 36.596-19.443 36.365Q-19.291 36.135-19.213 35.863Q-19.134 35.592-19.134 35.322Q-19.134 34.990-19.259 34.633Q-19.384 34.276-19.633 34.039Q-19.881 33.803-20.228 33.803Q-20.552 33.803-20.847 33.959Q-21.142 34.115-21.310 34.385M-15.935 37.049L-17.791 37.049L-17.791 36.752Q-17.517 36.752-17.349 36.705Q-17.181 36.658-17.181 36.490L-17.181 32.330Q-17.181 32.115-17.244 32.020Q-17.306 31.924-17.426 31.903Q-17.545 31.881-17.791 31.881L-17.791 31.584L-16.568 31.498L-16.568 34.201Q-16.443 33.990-16.256 33.840Q-16.068 33.690-15.842 33.606Q-15.615 33.522-15.369 33.522Q-14.201 33.522-14.201 34.600L-14.201 36.490Q-14.201 36.658-14.031 36.705Q-13.861 36.752-13.592 36.752L-13.592 37.049L-15.447 37.049L-15.447 36.752Q-15.174 36.752-15.006 36.705Q-14.838 36.658-14.838 36.490L-14.838 34.615Q-14.838 34.233-14.959 34.004Q-15.080 33.776-15.431 33.776Q-15.744 33.776-15.998 33.938Q-16.252 34.100-16.398 34.369Q-16.545 34.639-16.545 34.936L-16.545 36.490Q-16.545 36.658-16.375 36.705Q-16.205 36.752-15.935 36.752L-15.935 37.049M-13.146 35.354Q-13.146 34.850-12.890 34.418Q-12.634 33.986-12.199 33.735Q-11.763 33.483-11.263 33.483Q-10.877 33.483-10.535 33.627Q-10.193 33.772-9.931 34.033Q-9.670 34.295-9.527 34.631Q-9.384 34.967-9.384 35.354Q-9.384 35.846-9.648 36.256Q-9.912 36.666-10.342 36.897Q-10.771 37.127-11.263 37.127Q-11.756 37.127-12.189 36.895Q-12.623 36.662-12.884 36.254Q-13.146 35.846-13.146 35.354M-11.263 36.850Q-10.806 36.850-10.554 36.627Q-10.302 36.404-10.215 36.053Q-10.127 35.701-10.127 35.256Q-10.127 34.826-10.220 34.488Q-10.314 34.151-10.568 33.944Q-10.822 33.736-11.263 33.736Q-11.912 33.736-12.156 34.153Q-12.400 34.569-12.400 35.256Q-12.400 35.701-12.312 36.053Q-12.224 36.404-11.972 36.627Q-11.720 36.850-11.263 36.850M-8.275 36.088L-8.275 33.897L-8.978 33.897L-8.978 33.643Q-8.623 33.643-8.381 33.410Q-8.138 33.178-8.027 32.830Q-7.916 32.483-7.916 32.127L-7.634 32.127L-7.634 33.600L-6.459 33.600L-6.459 33.897L-7.634 33.897L-7.634 36.072Q-7.634 36.393-7.515 36.621Q-7.396 36.850-7.115 36.850Q-6.935 36.850-6.818 36.727Q-6.701 36.604-6.648 36.424Q-6.595 36.244-6.595 36.072L-6.595 35.600L-6.314 35.600L-6.314 36.088Q-6.314 36.342-6.420 36.582Q-6.525 36.822-6.722 36.975Q-6.920 37.127-7.177 37.127Q-7.494 37.127-7.746 37.004Q-7.998 36.881-8.136 36.647Q-8.275 36.412-8.275 36.088M-5.595 35.354Q-5.595 34.850-5.340 34.418Q-5.084 33.986-4.648 33.735Q-4.213 33.483-3.713 33.483Q-3.326 33.483-2.984 33.627Q-2.642 33.772-2.381 34.033Q-2.119 34.295-1.976 34.631Q-1.834 34.967-1.834 35.354Q-1.834 35.846-2.097 36.256Q-2.361 36.666-2.791 36.897Q-3.220 37.127-3.713 37.127Q-4.205 37.127-4.638 36.895Q-5.072 36.662-5.334 36.254Q-5.595 35.846-5.595 35.354M-3.713 36.850Q-3.256 36.850-3.004 36.627Q-2.752 36.404-2.664 36.053Q-2.576 35.701-2.576 35.256Q-2.576 34.826-2.670 34.488Q-2.763 34.151-3.017 33.944Q-3.271 33.736-3.713 33.736Q-4.361 33.736-4.605 34.153Q-4.849 34.569-4.849 35.256Q-4.849 35.701-4.761 36.053Q-4.674 36.404-4.422 36.627Q-4.170 36.850-3.713 36.850M0.580 37.049L-1.275 37.049L-1.275 36.752Q-1.002 36.752-0.834 36.705Q-0.666 36.658-0.666 36.490L-0.666 34.354Q-0.666 34.139-0.728 34.043Q-0.791 33.947-0.910 33.926Q-1.029 33.904-1.275 33.904L-1.275 33.608L-0.084 33.522L-0.084 34.256Q0.030 34.041 0.223 33.873Q0.416 33.705 0.655 33.613Q0.893 33.522 1.147 33.522Q2.315 33.522 2.315 34.600L2.315 36.490Q2.315 36.658 2.485 36.705Q2.655 36.752 2.924 36.752L2.924 37.049L1.069 37.049L1.069 36.752Q1.342 36.752 1.510 36.705Q1.678 36.658 1.678 36.490L1.678 34.615Q1.678 34.233 1.557 34.004Q1.436 33.776 1.084 33.776Q0.772 33.776 0.518 33.938Q0.264 34.100 0.117 34.369Q-0.029 34.639-0.029 34.936L-0.029 36.490Q-0.029 36.658 0.141 36.705Q0.311 36.752 0.580 36.752\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(246.58 9.089)\">\u003Cpath d=\"M6.222 35.295Q6.222 34.815 6.455 34.399Q6.687 33.983 7.097 33.733Q7.507 33.483 7.984 33.483Q8.714 33.483 9.113 33.924Q9.511 34.365 9.511 35.096Q9.511 35.201 9.418 35.225L6.968 35.225L6.968 35.295Q6.968 35.705 7.089 36.061Q7.211 36.416 7.482 36.633Q7.754 36.850 8.183 36.850Q8.547 36.850 8.843 36.621Q9.140 36.393 9.242 36.041Q9.250 35.994 9.336 35.979L9.418 35.979Q9.511 36.006 9.511 36.088Q9.511 36.096 9.504 36.127Q9.441 36.354 9.302 36.537Q9.164 36.721 8.972 36.854Q8.781 36.986 8.562 37.057Q8.343 37.127 8.105 37.127Q7.734 37.127 7.396 36.990Q7.058 36.854 6.791 36.602Q6.523 36.350 6.373 36.010Q6.222 35.670 6.222 35.295M6.976 34.986L8.937 34.986Q8.937 34.682 8.836 34.391Q8.734 34.100 8.517 33.918Q8.300 33.736 7.984 33.736Q7.683 33.736 7.453 33.924Q7.222 34.111 7.099 34.403Q6.976 34.694 6.976 34.986M11.929 37.049L10.074 37.049L10.074 36.752Q10.347 36.752 10.515 36.705Q10.683 36.658 10.683 36.490L10.683 34.354Q10.683 34.139 10.621 34.043Q10.558 33.947 10.439 33.926Q10.320 33.904 10.074 33.904L10.074 33.608L11.265 33.522L11.265 34.256Q11.379 34.041 11.572 33.873Q11.765 33.705 12.004 33.613Q12.242 33.522 12.496 33.522Q13.664 33.522 13.664 34.600L13.664 36.490Q13.664 36.658 13.834 36.705Q14.004 36.752 14.273 36.752L14.273 37.049L12.418 37.049L12.418 36.752Q12.691 36.752 12.859 36.705Q13.027 36.658 13.027 36.490L13.027 34.615Q13.027 34.233 12.906 34.004Q12.785 33.776 12.433 33.776Q12.121 33.776 11.867 33.938Q11.613 34.100 11.466 34.369Q11.320 34.639 11.320 34.936L11.320 36.490Q11.320 36.658 11.490 36.705Q11.660 36.752 11.929 36.752L11.929 37.049M14.718 35.295Q14.718 34.815 14.951 34.399Q15.183 33.983 15.593 33.733Q16.004 33.483 16.480 33.483Q17.211 33.483 17.609 33.924Q18.007 34.365 18.007 35.096Q18.007 35.201 17.914 35.225L15.464 35.225L15.464 35.295Q15.464 35.705 15.586 36.061Q15.707 36.416 15.978 36.633Q16.250 36.850 16.679 36.850Q17.043 36.850 17.339 36.621Q17.636 36.393 17.738 36.041Q17.746 35.994 17.832 35.979L17.914 35.979Q18.007 36.006 18.007 36.088Q18.007 36.096 18 36.127Q17.937 36.354 17.798 36.537Q17.660 36.721 17.468 36.854Q17.277 36.986 17.058 37.057Q16.839 37.127 16.601 37.127Q16.230 37.127 15.892 36.990Q15.554 36.854 15.287 36.602Q15.019 36.350 14.869 36.010Q14.718 35.670 14.718 35.295M15.472 34.986L17.433 34.986Q17.433 34.682 17.332 34.391Q17.230 34.100 17.013 33.918Q16.797 33.736 16.480 33.736Q16.179 33.736 15.949 33.924Q15.718 34.111 15.595 34.403Q15.472 34.694 15.472 34.986M20.504 37.049L18.523 37.049L18.523 36.752Q18.793 36.752 18.961 36.707Q19.129 36.662 19.129 36.490L19.129 34.354Q19.129 34.139 19.066 34.043Q19.004 33.947 18.886 33.926Q18.769 33.904 18.523 33.904L18.523 33.608L19.691 33.522L19.691 34.307Q19.769 34.096 19.922 33.910Q20.074 33.725 20.273 33.623Q20.472 33.522 20.699 33.522Q20.945 33.522 21.136 33.666Q21.328 33.811 21.328 34.041Q21.328 34.197 21.222 34.307Q21.117 34.416 20.961 34.416Q20.804 34.416 20.695 34.307Q20.586 34.197 20.586 34.041Q20.586 33.881 20.691 33.776Q20.367 33.776 20.152 34.004Q19.937 34.233 19.841 34.572Q19.746 34.912 19.746 35.217L19.746 36.490Q19.746 36.658 19.972 36.705Q20.199 36.752 20.504 36.752L20.504 37.049M21.808 37.658Q21.808 37.377 22.019 37.166Q22.230 36.955 22.515 36.865Q22.359 36.740 22.281 36.551Q22.203 36.361 22.203 36.162Q22.203 35.807 22.433 35.514Q22.066 35.174 22.066 34.705Q22.066 34.354 22.269 34.084Q22.472 33.815 22.793 33.668Q23.113 33.522 23.457 33.522Q23.976 33.522 24.347 33.803Q24.711 33.432 25.257 33.432Q25.437 33.432 25.564 33.559Q25.691 33.686 25.691 33.865Q25.691 33.971 25.613 34.049Q25.535 34.127 25.425 34.127Q25.316 34.127 25.240 34.051Q25.164 33.975 25.164 33.865Q25.164 33.764 25.203 33.713Q25.211 33.705 25.214 33.699Q25.218 33.694 25.218 33.690Q24.843 33.690 24.523 33.944Q24.843 34.283 24.843 34.705Q24.843 34.975 24.726 35.192Q24.609 35.408 24.404 35.567Q24.199 35.725 23.957 35.807Q23.714 35.889 23.457 35.889Q23.238 35.889 23.025 35.830Q22.812 35.772 22.617 35.651Q22.523 35.791 22.523 35.971Q22.523 36.178 22.660 36.330Q22.797 36.483 23.004 36.483L23.699 36.483Q24.187 36.483 24.599 36.567Q25.011 36.651 25.291 36.908Q25.570 37.166 25.570 37.658Q25.570 38.022 25.250 38.254Q24.929 38.486 24.488 38.588Q24.047 38.690 23.691 38.690Q23.336 38.690 22.892 38.588Q22.449 38.486 22.129 38.254Q21.808 38.022 21.808 37.658M22.312 37.658Q22.312 37.854 22.457 38.002Q22.601 38.151 22.814 38.240Q23.027 38.330 23.267 38.377Q23.507 38.424 23.691 38.424Q23.933 38.424 24.263 38.346Q24.593 38.268 24.830 38.094Q25.066 37.920 25.066 37.658Q25.066 37.252 24.656 37.143Q24.246 37.033 23.683 37.033L23.004 37.033Q22.734 37.033 22.523 37.211Q22.312 37.389 22.312 37.658M23.457 35.623Q24.179 35.623 24.179 34.705Q24.179 33.783 23.457 33.783Q22.730 33.783 22.730 34.705Q22.730 35.623 23.457 35.623M26.472 38.346Q26.586 38.424 26.761 38.424Q27.050 38.424 27.271 38.211Q27.492 37.998 27.617 37.697L27.906 37.049L26.632 34.162Q26.550 33.986 26.406 33.942Q26.261 33.897 25.992 33.897L25.992 33.600L27.711 33.600L27.711 33.897Q27.289 33.897 27.289 34.080Q27.289 34.092 27.304 34.162L28.242 36.287L29.074 34.377Q29.113 34.287 29.113 34.209Q29.113 34.069 29.011 33.983Q28.910 33.897 28.769 33.897L28.769 33.600L30.121 33.600L30.121 33.897Q29.867 33.897 29.673 34.022Q29.480 34.147 29.375 34.377L27.929 37.697Q27.816 37.951 27.650 38.174Q27.484 38.397 27.255 38.539Q27.027 38.682 26.761 38.682Q26.464 38.682 26.224 38.490Q25.984 38.299 25.984 38.010Q25.984 37.854 26.089 37.752Q26.195 37.651 26.343 37.651Q26.449 37.651 26.529 37.697Q26.609 37.744 26.656 37.822Q26.703 37.901 26.703 38.010Q26.703 38.131 26.642 38.219Q26.582 38.307 26.472 38.346\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-22.822 37.049v-100.43\"\u002F>\u003Cpath stroke=\"none\" d=\"m-22.822-65.381-1.6 3.2 1.6-1.2 1.6 1.2\"\u002F>\u003Cg transform=\"translate(-42.782 -100.43)\">\u003Cpath d=\"M-22.486 36.217Q-22.486 35.733-22.084 35.438Q-21.681 35.143-21.131 35.024Q-20.580 34.904-20.088 34.904L-20.088 34.615Q-20.088 34.389-20.203 34.182Q-20.318 33.975-20.515 33.856Q-20.713 33.736-20.943 33.736Q-21.369 33.736-21.654 33.842Q-21.584 33.869-21.537 33.924Q-21.490 33.979-21.465 34.049Q-21.439 34.119-21.439 34.194Q-21.439 34.299-21.490 34.391Q-21.541 34.483-21.633 34.533Q-21.724 34.584-21.830 34.584Q-21.935 34.584-22.027 34.533Q-22.119 34.483-22.170 34.391Q-22.220 34.299-22.220 34.194Q-22.220 33.776-21.832 33.629Q-21.443 33.483-20.943 33.483Q-20.611 33.483-20.258 33.613Q-19.904 33.744-19.676 33.998Q-19.447 34.252-19.447 34.600L-19.447 36.401Q-19.447 36.533-19.375 36.643Q-19.302 36.752-19.174 36.752Q-19.049 36.752-18.980 36.647Q-18.912 36.541-18.912 36.401L-18.912 35.889L-18.631 35.889L-18.631 36.401Q-18.631 36.604-18.748 36.762Q-18.865 36.920-19.047 37.004Q-19.228 37.088-19.431 37.088Q-19.662 37.088-19.814 36.916Q-19.967 36.744-19.998 36.514Q-20.158 36.795-20.467 36.961Q-20.775 37.127-21.127 37.127Q-21.638 37.127-22.062 36.904Q-22.486 36.682-22.486 36.217M-21.799 36.217Q-21.799 36.502-21.572 36.688Q-21.345 36.873-21.052 36.873Q-20.806 36.873-20.582 36.756Q-20.357 36.639-20.222 36.436Q-20.088 36.233-20.088 35.979L-20.088 35.147Q-20.353 35.147-20.638 35.201Q-20.924 35.256-21.195 35.385Q-21.467 35.514-21.633 35.721Q-21.799 35.928-21.799 36.217M-17.424 37.049L-17.705 37.049L-17.705 32.330Q-17.705 32.115-17.767 32.020Q-17.830 31.924-17.947 31.903Q-18.064 31.881-18.310 31.881L-18.310 31.584L-17.088 31.498L-17.088 33.986Q-16.611 33.522-15.912 33.522Q-15.431 33.522-15.023 33.766Q-14.615 34.010-14.379 34.424Q-14.142 34.838-14.142 35.322Q-14.142 35.697-14.291 36.026Q-14.439 36.354-14.709 36.606Q-14.978 36.858-15.322 36.992Q-15.666 37.127-16.025 37.127Q-16.345 37.127-16.644 36.979Q-16.943 36.830-17.150 36.569L-17.424 37.049M-17.064 34.377L-17.064 36.217Q-16.912 36.514-16.652 36.694Q-16.392 36.873-16.080 36.873Q-15.654 36.873-15.386 36.654Q-15.119 36.436-15.004 36.090Q-14.888 35.744-14.888 35.322Q-14.888 34.674-15.136 34.225Q-15.384 33.776-15.982 33.776Q-16.318 33.776-16.607 33.934Q-16.896 34.092-17.064 34.377M-13.576 37.041L-13.576 35.819Q-13.576 35.791-13.545 35.760Q-13.513 35.729-13.490 35.729L-13.384 35.729Q-13.314 35.729-13.299 35.791Q-13.236 36.111-13.097 36.352Q-12.959 36.592-12.726 36.733Q-12.494 36.873-12.185 36.873Q-11.947 36.873-11.738 36.813Q-11.529 36.752-11.392 36.604Q-11.256 36.455-11.256 36.209Q-11.256 35.955-11.467 35.789Q-11.677 35.623-11.947 35.569L-12.568 35.455Q-12.974 35.377-13.275 35.121Q-13.576 34.865-13.576 34.490Q-13.576 34.123-13.375 33.901Q-13.174 33.678-12.849 33.580Q-12.525 33.483-12.185 33.483Q-11.720 33.483-11.424 33.690L-11.201 33.506Q-11.177 33.483-11.146 33.483L-11.095 33.483Q-11.064 33.483-11.037 33.510Q-11.009 33.537-11.009 33.569L-11.009 34.553Q-11.009 34.584-11.035 34.613Q-11.060 34.643-11.095 34.643L-11.201 34.643Q-11.236 34.643-11.263 34.615Q-11.291 34.588-11.291 34.553Q-11.291 34.154-11.543 33.934Q-11.795 33.713-12.193 33.713Q-12.549 33.713-12.832 33.836Q-13.115 33.959-13.115 34.264Q-13.115 34.483-12.914 34.615Q-12.713 34.748-12.467 34.791L-11.842 34.904Q-11.412 34.994-11.103 35.291Q-10.795 35.588-10.795 36.002Q-10.795 36.572-11.193 36.850Q-11.592 37.127-12.185 37.127Q-12.736 37.127-13.088 36.791L-13.384 37.104Q-13.408 37.127-13.443 37.127L-13.490 37.127Q-13.513 37.127-13.545 37.096Q-13.576 37.065-13.576 37.041M-10.267 35.354Q-10.267 34.850-10.011 34.418Q-9.756 33.986-9.320 33.735Q-8.884 33.483-8.384 33.483Q-7.998 33.483-7.656 33.627Q-7.314 33.772-7.052 34.033Q-6.791 34.295-6.648 34.631Q-6.506 34.967-6.506 35.354Q-6.506 35.846-6.769 36.256Q-7.033 36.666-7.463 36.897Q-7.892 37.127-8.384 37.127Q-8.877 37.127-9.310 36.895Q-9.744 36.662-10.006 36.254Q-10.267 35.846-10.267 35.354M-8.384 36.850Q-7.927 36.850-7.676 36.627Q-7.424 36.404-7.336 36.053Q-7.248 35.701-7.248 35.256Q-7.248 34.826-7.342 34.488Q-7.435 34.151-7.689 33.944Q-7.943 33.736-8.384 33.736Q-9.033 33.736-9.277 34.153Q-9.521 34.569-9.521 35.256Q-9.521 35.701-9.433 36.053Q-9.345 36.404-9.093 36.627Q-8.842 36.850-8.384 36.850M-4.013 37.049L-5.994 37.049L-5.994 36.752Q-5.724 36.752-5.556 36.707Q-5.388 36.662-5.388 36.490L-5.388 34.354Q-5.388 34.139-5.451 34.043Q-5.513 33.947-5.631 33.926Q-5.748 33.904-5.994 33.904L-5.994 33.608L-4.826 33.522L-4.826 34.307Q-4.748 34.096-4.595 33.910Q-4.443 33.725-4.244 33.623Q-4.045 33.522-3.818 33.522Q-3.572 33.522-3.381 33.666Q-3.189 33.811-3.189 34.041Q-3.189 34.197-3.295 34.307Q-3.400 34.416-3.556 34.416Q-3.713 34.416-3.822 34.307Q-3.931 34.197-3.931 34.041Q-3.931 33.881-3.826 33.776Q-4.150 33.776-4.365 34.004Q-4.580 34.233-4.676 34.572Q-4.771 34.912-4.771 35.217L-4.771 36.490Q-4.771 36.658-4.545 36.705Q-4.318 36.752-4.013 36.752L-4.013 37.049M-0.826 38.600L-2.681 38.600L-2.681 38.307Q-2.412 38.307-2.244 38.262Q-2.076 38.217-2.076 38.041L-2.076 34.217Q-2.076 34.010-2.232 33.957Q-2.388 33.904-2.681 33.904L-2.681 33.608L-1.459 33.522L-1.459 33.986Q-1.228 33.764-0.914 33.643Q-0.599 33.522-0.259 33.522Q0.213 33.522 0.617 33.768Q1.022 34.014 1.254 34.430Q1.487 34.846 1.487 35.322Q1.487 35.697 1.338 36.026Q1.190 36.354 0.920 36.606Q0.651 36.858 0.307 36.992Q-0.037 37.127-0.396 37.127Q-0.685 37.127-0.957 37.006Q-1.228 36.885-1.435 36.674L-1.435 38.041Q-1.435 38.217-1.267 38.262Q-1.099 38.307-0.826 38.307L-0.826 38.600M-1.435 34.385L-1.435 36.225Q-1.283 36.514-1.021 36.694Q-0.759 36.873-0.451 36.873Q-0.166 36.873 0.057 36.735Q0.280 36.596 0.432 36.365Q0.584 36.135 0.662 35.863Q0.741 35.592 0.741 35.322Q0.741 34.990 0.616 34.633Q0.491 34.276 0.242 34.039Q-0.006 33.803-0.353 33.803Q-0.677 33.803-0.972 33.959Q-1.267 34.115-1.435 34.385M2.635 36.088L2.635 33.897L1.932 33.897L1.932 33.643Q2.287 33.643 2.530 33.410Q2.772 33.178 2.883 32.830Q2.994 32.483 2.994 32.127L3.276 32.127L3.276 33.600L4.451 33.600L4.451 33.897L3.276 33.897L3.276 36.072Q3.276 36.393 3.395 36.621Q3.514 36.850 3.795 36.850Q3.975 36.850 4.092 36.727Q4.209 36.604 4.262 36.424Q4.315 36.244 4.315 36.072L4.315 35.600L4.596 35.600L4.596 36.088Q4.596 36.342 4.491 36.582Q4.385 36.822 4.188 36.975Q3.991 37.127 3.733 37.127Q3.416 37.127 3.164 37.004Q2.912 36.881 2.774 36.647Q2.635 36.412 2.635 36.088M7.174 37.049L5.397 37.049L5.397 36.752Q5.670 36.752 5.838 36.705Q6.006 36.658 6.006 36.490L6.006 34.354Q6.006 34.139 5.949 34.043Q5.893 33.947 5.780 33.926Q5.666 33.904 5.420 33.904L5.420 33.608L6.619 33.522L6.619 36.490Q6.619 36.658 6.766 36.705Q6.912 36.752 7.174 36.752L7.174 37.049M5.733 32.127Q5.733 31.936 5.867 31.805Q6.002 31.674 6.198 31.674Q6.319 31.674 6.422 31.736Q6.526 31.799 6.588 31.903Q6.651 32.006 6.651 32.127Q6.651 32.322 6.520 32.457Q6.389 32.592 6.198 32.592Q5.998 32.592 5.866 32.459Q5.733 32.326 5.733 32.127M7.674 35.354Q7.674 34.850 7.930 34.418Q8.186 33.986 8.621 33.735Q9.057 33.483 9.557 33.483Q9.944 33.483 10.285 33.627Q10.627 33.772 10.889 34.033Q11.151 34.295 11.293 34.631Q11.436 34.967 11.436 35.354Q11.436 35.846 11.172 36.256Q10.908 36.666 10.479 36.897Q10.049 37.127 9.557 37.127Q9.065 37.127 8.631 36.895Q8.198 36.662 7.936 36.254Q7.674 35.846 7.674 35.354M9.557 36.850Q10.014 36.850 10.266 36.627Q10.518 36.404 10.606 36.053Q10.694 35.701 10.694 35.256Q10.694 34.826 10.600 34.488Q10.506 34.151 10.252 33.944Q9.998 33.736 9.557 33.736Q8.908 33.736 8.664 34.153Q8.420 34.569 8.420 35.256Q8.420 35.701 8.508 36.053Q8.596 36.404 8.848 36.627Q9.100 36.850 9.557 36.850M13.850 37.049L11.994 37.049L11.994 36.752Q12.268 36.752 12.436 36.705Q12.604 36.658 12.604 36.490L12.604 34.354Q12.604 34.139 12.541 34.043Q12.479 33.947 12.360 33.926Q12.241 33.904 11.994 33.904L11.994 33.608L13.186 33.522L13.186 34.256Q13.299 34.041 13.492 33.873Q13.686 33.705 13.924 33.613Q14.162 33.522 14.416 33.522Q15.584 33.522 15.584 34.600L15.584 36.490Q15.584 36.658 15.754 36.705Q15.924 36.752 16.194 36.752L16.194 37.049L14.338 37.049L14.338 36.752Q14.612 36.752 14.780 36.705Q14.948 36.658 14.948 36.490L14.948 34.615Q14.948 34.233 14.826 34.004Q14.705 33.776 14.354 33.776Q14.041 33.776 13.787 33.938Q13.533 34.100 13.387 34.369Q13.241 34.639 13.241 34.936L13.241 36.490Q13.241 36.658 13.410 36.705Q13.580 36.752 13.850 36.752\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M11.322 37.049V19.977\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(32.15 8.044)\">\u003Cpath d=\"M-20.833 37.189Q-21.468 37.189-21.832 36.844Q-22.197 36.499-22.332 35.974Q-22.467 35.449-22.467 34.824Q-22.467 33.799-22.111 33.100Q-21.756 32.401-20.833 32.401Q-19.906 32.401-19.554 33.100Q-19.202 33.799-19.202 34.824Q-19.202 35.449-19.337 35.974Q-19.472 36.499-19.835 36.844Q-20.197 37.189-20.833 37.189M-20.833 36.964Q-20.395 36.964-20.182 36.589Q-19.968 36.215-19.918 35.748Q-19.869 35.282-19.869 34.704Q-19.869 34.151-19.918 33.723Q-19.968 33.296-20.180 32.961Q-20.392 32.626-20.833 32.626Q-21.175 32.626-21.378 32.833Q-21.581 33.040-21.668 33.352Q-21.756 33.665-21.778 33.981Q-21.800 34.298-21.800 34.704Q-21.800 35.121-21.778 35.463Q-21.756 35.805-21.667 36.153Q-21.578 36.502-21.373 36.733Q-21.168 36.964-20.833 36.964\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M45.465 37.049V-8.476\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(66.293 8.044)\">\u003Cpath d=\"M-19.496 37.049L-22.026 37.049L-22.026 36.769Q-21.058 36.769-21.058 36.560L-21.058 32.941Q-21.451 33.129-22.073 33.129L-22.073 32.848Q-21.656 32.848-21.292 32.747Q-20.928 32.647-20.672 32.401L-20.546 32.401Q-20.481 32.418-20.464 32.486L-20.464 36.560Q-20.464 36.769-19.496 36.769\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M79.608 37.049V-42.62\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(100.437 8.044)\">\u003Cpath d=\"M-19.496 37.049L-22.381 37.049L-22.381 36.847Q-22.381 36.817-22.354 36.789L-21.106 35.572Q-21.034 35.497-20.992 35.455Q-20.949 35.412-20.870 35.333Q-20.457 34.920-20.226 34.562Q-19.995 34.205-19.995 33.781Q-19.995 33.549-20.074 33.346Q-20.153 33.142-20.294 32.992Q-20.436 32.841-20.631 32.761Q-20.826 32.681-21.058 32.681Q-21.369 32.681-21.627 32.840Q-21.885 32.999-22.015 33.276L-21.995 33.276Q-21.827 33.276-21.720 33.387Q-21.612 33.498-21.612 33.662Q-21.612 33.819-21.721 33.932Q-21.831 34.045-21.995 34.045Q-22.155 34.045-22.268 33.932Q-22.381 33.819-22.381 33.662Q-22.381 33.286-22.173 32.999Q-21.964 32.712-21.629 32.556Q-21.294 32.401-20.939 32.401Q-20.515 32.401-20.135 32.559Q-19.756 32.718-19.522 33.035Q-19.288 33.351-19.288 33.781Q-19.288 34.092-19.428 34.361Q-19.568 34.629-19.773 34.834Q-19.978 35.039-20.341 35.321Q-20.703 35.603-20.812 35.699L-21.667 36.427L-21.024 36.427Q-20.761 36.427-20.472 36.425Q-20.183 36.424-19.965 36.415Q-19.746 36.406-19.729 36.389Q-19.667 36.324-19.630 36.157Q-19.592 35.989-19.554 35.747L-19.288 35.747\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M113.752 37.049v-88.204\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(134.58 8.044)\">\u003Cpath d=\"M-22.026 36.502Q-21.906 36.659-21.715 36.758Q-21.523 36.858-21.308 36.897Q-21.093 36.936-20.870 36.936Q-20.573 36.936-20.378 36.781Q-20.183 36.625-20.093 36.371Q-20.002 36.116-20.002 35.832Q-20.002 35.538-20.094 35.287Q-20.187 35.036-20.385 34.880Q-20.583 34.725-20.877 34.725L-21.393 34.725Q-21.421 34.725-21.446 34.699Q-21.472 34.674-21.472 34.650L-21.472 34.578Q-21.472 34.547-21.446 34.525Q-21.421 34.503-21.393 34.503L-20.952 34.472Q-20.590 34.472-20.370 34.115Q-20.149 33.757-20.149 33.368Q-20.149 33.040-20.344 32.836Q-20.539 32.633-20.870 32.633Q-21.157 32.633-21.410 32.717Q-21.663 32.800-21.827 32.988Q-21.680 32.988-21.580 33.103Q-21.479 33.217-21.479 33.368Q-21.479 33.518-21.585 33.628Q-21.691 33.737-21.848 33.737Q-22.009 33.737-22.118 33.628Q-22.227 33.518-22.227 33.368Q-22.227 33.043-22.019 32.824Q-21.810 32.606-21.494 32.503Q-21.178 32.401-20.870 32.401Q-20.552 32.401-20.224 32.505Q-19.896 32.609-19.669 32.831Q-19.442 33.053-19.442 33.368Q-19.442 33.802-19.729 34.127Q-20.016 34.451-20.450 34.598Q-20.139 34.663-19.859 34.829Q-19.578 34.995-19.401 35.253Q-19.223 35.511-19.223 35.832Q-19.223 36.242-19.467 36.552Q-19.712 36.861-20.093 37.025Q-20.474 37.189-20.870 37.189Q-21.239 37.189-21.597 37.076Q-21.954 36.964-22.198 36.714Q-22.443 36.465-22.443 36.095Q-22.443 35.924-22.326 35.812Q-22.210 35.699-22.039 35.699Q-21.930 35.699-21.839 35.750Q-21.749 35.801-21.694 35.894Q-21.639 35.986-21.639 36.095Q-21.639 36.263-21.752 36.382Q-21.865 36.502-22.026 36.502\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M147.895 37.049v-68.287\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(168.723 8.044)\">\u003Cpath d=\"M-20.505 35.901L-22.549 35.901L-22.549 35.620L-20.218 32.448Q-20.183 32.401-20.118 32.401L-19.982 32.401Q-19.937 32.401-19.910 32.428Q-19.883 32.455-19.883 32.500L-19.883 35.620L-19.120 35.620L-19.120 35.901L-19.883 35.901L-19.883 36.560Q-19.883 36.769-19.127 36.769L-19.127 37.049L-21.260 37.049L-21.260 36.769Q-20.505 36.769-20.505 36.560L-20.505 35.901M-20.457 33.176L-22.248 35.620L-20.457 35.620\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M182.038 37.049V-2.785\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(202.867 8.044)\">\u003Cpath d=\"M-22.015 36.287L-22.046 36.287Q-21.909 36.584-21.612 36.760Q-21.315 36.936-20.987 36.936Q-20.624 36.936-20.397 36.758Q-20.170 36.581-20.076 36.292Q-19.982 36.003-19.982 35.641Q-19.982 35.326-20.036 35.041Q-20.091 34.756-20.264 34.550Q-20.436 34.345-20.751 34.345Q-21.024 34.345-21.207 34.412Q-21.390 34.479-21.494 34.568Q-21.598 34.656-21.694 34.766Q-21.790 34.875-21.834 34.885L-21.913 34.885Q-21.985 34.868-22.002 34.797L-22.002 32.479Q-22.002 32.445-21.978 32.423Q-21.954 32.401-21.920 32.401L-21.892 32.401Q-21.605 32.517-21.337 32.571Q-21.069 32.626-20.792 32.626Q-20.515 32.626-20.245 32.571Q-19.975 32.517-19.695 32.401L-19.671 32.401Q-19.636 32.401-19.613 32.424Q-19.589 32.448-19.589 32.479L-19.589 32.548Q-19.589 32.575-19.609 32.595Q-19.883 32.910-20.267 33.086Q-20.652 33.262-21.065 33.262Q-21.404 33.262-21.721 33.176L-21.721 34.458Q-21.325 34.123-20.751 34.123Q-20.347 34.123-20.011 34.333Q-19.674 34.544-19.481 34.896Q-19.288 35.248-19.288 35.648Q-19.288 35.979-19.428 36.265Q-19.568 36.550-19.812 36.760Q-20.057 36.970-20.359 37.080Q-20.662 37.189-20.980 37.189Q-21.339 37.189-21.665 37.025Q-21.991 36.861-22.186 36.569Q-22.381 36.277-22.381 35.914Q-22.381 35.764-22.275 35.658Q-22.169 35.552-22.015 35.552Q-21.862 35.552-21.757 35.656Q-21.653 35.760-21.653 35.914Q-21.653 36.071-21.757 36.179Q-21.862 36.287-22.015 36.287\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M216.181 37.049V19.977\" style=\"stroke-width:1.2\"\u002F>\u003Cg transform=\"translate(237.01 8.044)\">\u003Cpath d=\"M-20.833 37.189Q-21.291 37.189-21.609 36.974Q-21.926 36.758-22.108 36.406Q-22.289 36.054-22.366 35.634Q-22.443 35.214-22.443 34.786Q-22.443 34.202-22.190 33.646Q-21.937 33.091-21.467 32.746Q-20.997 32.401-20.399 32.401Q-19.989 32.401-19.705 32.599Q-19.421 32.797-19.421 33.200Q-19.421 33.296-19.467 33.375Q-19.513 33.453-19.594 33.498Q-19.674 33.542-19.763 33.542Q-19.910 33.542-20.011 33.445Q-20.112 33.347-20.112 33.200Q-20.112 33.070-20.021 32.963Q-19.930 32.855-19.797 32.855Q-19.985 32.633-20.399 32.633Q-20.713 32.633-20.987 32.797Q-21.260 32.961-21.427 33.235Q-21.615 33.525-21.680 33.891Q-21.745 34.257-21.745 34.711Q-21.595 34.417-21.330 34.239Q-21.065 34.062-20.751 34.062Q-20.320 34.062-19.971 34.268Q-19.623 34.475-19.423 34.831Q-19.223 35.186-19.223 35.613Q-19.223 36.058-19.440 36.418Q-19.657 36.779-20.030 36.984Q-20.402 37.189-20.833 37.189M-20.833 36.936Q-20.457 36.936-20.253 36.753Q-20.050 36.570-19.987 36.287Q-19.924 36.003-19.924 35.613Q-19.924 35.227-19.978 34.947Q-20.033 34.667-20.228 34.475Q-20.423 34.284-20.792 34.284Q-21.082 34.284-21.294 34.460Q-21.506 34.636-21.614 34.909Q-21.721 35.183-21.721 35.466L-21.721 35.607L-21.721 35.648Q-21.721 36.153-21.509 36.545Q-21.298 36.936-20.833 36.936\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(96.976 22.62)\">\u003Cpath d=\"M-21.933 36.215L-21.933 34.711Q-21.933 34.441-22.041 34.380Q-22.149 34.318-22.460 34.318L-22.460 34.038L-21.352 33.963L-21.352 36.195L-21.352 36.215Q-21.352 36.495-21.301 36.639Q-21.250 36.782-21.108 36.839Q-20.966 36.895-20.679 36.895Q-20.426 36.895-20.221 36.755Q-20.016 36.615-19.900 36.389Q-19.783 36.164-19.783 35.914L-19.783 34.711Q-19.783 34.441-19.891 34.380Q-19.999 34.318-20.310 34.318L-20.310 34.038L-19.202 33.963L-19.202 36.376Q-19.202 36.567-19.149 36.649Q-19.096 36.731-18.996 36.750Q-18.895 36.769-18.679 36.769L-18.679 37.049L-19.756 37.117L-19.756 36.553Q-19.865 36.735-20.011 36.858Q-20.156 36.981-20.342 37.049Q-20.529 37.117-20.730 37.117Q-21.933 37.117-21.933 36.215M-16.447 38.406L-18.078 38.406L-18.078 38.126Q-17.849 38.126-17.700 38.091Q-17.551 38.057-17.551 37.917L-17.551 34.571Q-17.551 34.400-17.688 34.359Q-17.825 34.318-18.078 34.318L-18.078 34.038L-16.998 33.963L-16.998 34.369Q-16.776 34.168-16.489 34.065Q-16.201 33.963-15.894 33.963Q-15.467 33.963-15.103 34.176Q-14.739 34.390-14.525 34.754Q-14.311 35.118-14.311 35.538Q-14.311 35.983-14.551 36.347Q-14.790 36.711-15.183 36.914Q-15.576 37.117-16.020 37.117Q-16.287 37.117-16.535 37.017Q-16.782 36.916-16.970 36.735L-16.970 37.917Q-16.970 38.054-16.822 38.090Q-16.673 38.126-16.447 38.126L-16.447 38.406M-16.970 34.718L-16.970 36.328Q-16.837 36.581-16.594 36.738Q-16.352 36.895-16.075 36.895Q-15.747 36.895-15.494 36.694Q-15.241 36.492-15.108 36.174Q-14.974 35.856-14.974 35.538Q-14.974 35.309-15.039 35.080Q-15.104 34.851-15.232 34.653Q-15.361 34.455-15.555 34.335Q-15.750 34.216-15.983 34.216Q-16.277 34.216-16.545 34.345Q-16.813 34.475-16.970 34.718M-12.031 38.406L-13.662 38.406L-13.662 38.126Q-13.433 38.126-13.284 38.091Q-13.135 38.057-13.135 37.917L-13.135 34.571Q-13.135 34.400-13.272 34.359Q-13.409 34.318-13.662 34.318L-13.662 34.038L-12.582 33.963L-12.582 34.369Q-12.360 34.168-12.072 34.065Q-11.785 33.963-11.478 33.963Q-11.051 33.963-10.687 34.176Q-10.322 34.390-10.109 34.754Q-9.895 35.118-9.895 35.538Q-9.895 35.983-10.134 36.347Q-10.374 36.711-10.767 36.914Q-11.160 37.117-11.604 37.117Q-11.871 37.117-12.119 37.017Q-12.366 36.916-12.554 36.735L-12.554 37.917Q-12.554 38.054-12.406 38.090Q-12.257 38.126-12.031 38.126L-12.031 38.406M-12.554 34.718L-12.554 36.328Q-12.421 36.581-12.178 36.738Q-11.936 36.895-11.659 36.895Q-11.331 36.895-11.078 36.694Q-10.825 36.492-10.692 36.174Q-10.558 35.856-10.558 35.538Q-10.558 35.309-10.623 35.080Q-10.688 34.851-10.816 34.653Q-10.945 34.455-11.139 34.335Q-11.334 34.216-11.567 34.216Q-11.861 34.216-12.129 34.345Q-12.397 34.475-12.554 34.718\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(96.976 22.62)\">\u003Cpath d=\"M-9.083 35.514Q-9.083 35.193-8.958 34.904Q-8.833 34.615-8.607 34.392Q-8.382 34.168-8.086 34.048Q-7.791 33.928-7.473 33.928Q-7.145 33.928-6.883 34.028Q-6.622 34.127-6.446 34.309Q-6.270 34.492-6.176 34.750Q-6.082 35.008-6.082 35.340Q-6.082 35.432-6.164 35.453L-8.419 35.453L-8.419 35.514Q-8.419 36.102-8.136 36.485Q-7.852 36.868-7.285 36.868Q-6.963 36.868-6.695 36.675Q-6.427 36.482-6.338 36.167Q-6.331 36.126-6.256 36.112L-6.164 36.112Q-6.082 36.136-6.082 36.208Q-6.082 36.215-6.088 36.242Q-6.201 36.639-6.572 36.878Q-6.943 37.117-7.367 37.117Q-7.804 37.117-8.204 36.909Q-8.604 36.700-8.843 36.333Q-9.083 35.966-9.083 35.514M-8.413 35.244L-6.598 35.244Q-6.598 34.967-6.695 34.715Q-6.793 34.462-6.991 34.306Q-7.189 34.151-7.473 34.151Q-7.750 34.151-7.963 34.309Q-8.177 34.468-8.295 34.723Q-8.413 34.978-8.413 35.244M-3.744 37.049L-5.480 37.049L-5.480 36.769Q-5.251 36.769-5.102 36.735Q-4.954 36.700-4.954 36.560L-4.954 34.711Q-4.954 34.441-5.061 34.380Q-5.169 34.318-5.480 34.318L-5.480 34.038L-4.451 33.963L-4.451 34.670Q-4.321 34.362-4.079 34.163Q-3.836 33.963-3.518 33.963Q-3.299 33.963-3.128 34.087Q-2.958 34.212-2.958 34.424Q-2.958 34.561-3.057 34.660Q-3.156 34.759-3.289 34.759Q-3.426 34.759-3.525 34.660Q-3.624 34.561-3.624 34.424Q-3.624 34.284-3.525 34.185Q-3.815 34.185-4.015 34.381Q-4.215 34.578-4.308 34.872Q-4.400 35.166-4.400 35.446L-4.400 36.560Q-4.400 36.769-3.744 36.769\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(96.976 22.62)\">\u003Cpath d=\"M1.923 37.022L0.795 34.523Q0.723 34.376 0.593 34.344Q0.463 34.311 0.234 34.311L0.234 34.031L1.748 34.031L1.748 34.311Q1.396 34.311 1.396 34.458Q1.396 34.503 1.407 34.523L2.271 36.441L3.051 34.711Q3.085 34.643 3.085 34.564Q3.085 34.451 3.001 34.381Q2.917 34.311 2.798 34.311L2.798 34.031L3.994 34.031L3.994 34.311Q3.775 34.311 3.604 34.414Q3.434 34.516 3.345 34.711L2.309 37.022Q2.261 37.117 2.155 37.117L2.077 37.117Q1.971 37.117 1.923 37.022M6.151 37.049L4.599 37.049L4.599 36.769Q4.825 36.769 4.973 36.735Q5.122 36.700 5.122 36.560L5.122 34.711Q5.122 34.523 5.074 34.439Q5.026 34.356 4.929 34.337Q4.832 34.318 4.620 34.318L4.620 34.038L5.676 33.963L5.676 36.560Q5.676 36.700 5.807 36.735Q5.939 36.769 6.151 36.769L6.151 37.049M4.879 32.742Q4.879 32.571 5.002 32.452Q5.125 32.332 5.296 32.332Q5.464 32.332 5.587 32.452Q5.710 32.571 5.710 32.742Q5.710 32.917 5.587 33.040Q5.464 33.163 5.296 33.163Q5.125 33.163 5.002 33.040Q4.879 32.917 4.879 32.742M7.603 37.049L7.337 37.049L7.337 32.941Q7.337 32.671 7.229 32.609Q7.122 32.548 6.811 32.548L6.811 32.267L7.891 32.192L7.891 34.362Q8.099 34.171 8.384 34.067Q8.670 33.963 8.967 33.963Q9.285 33.963 9.582 34.084Q9.880 34.205 10.102 34.421Q10.324 34.636 10.451 34.921Q10.577 35.207 10.577 35.538Q10.577 35.983 10.338 36.347Q10.099 36.711 9.706 36.914Q9.312 37.117 8.868 37.117Q8.673 37.117 8.484 37.061Q8.294 37.005 8.133 36.900Q7.973 36.796 7.832 36.635L7.603 37.049M7.918 34.704L7.918 36.321Q8.055 36.581 8.296 36.738Q8.537 36.895 8.813 36.895Q9.107 36.895 9.319 36.788Q9.531 36.680 9.665 36.488Q9.798 36.297 9.856 36.058Q9.914 35.819 9.914 35.538Q9.914 35.179 9.820 34.875Q9.726 34.571 9.499 34.378Q9.271 34.185 8.906 34.185Q8.605 34.185 8.338 34.321Q8.072 34.458 7.918 34.704M12.963 37.049L11.227 37.049L11.227 36.769Q11.456 36.769 11.604 36.735Q11.753 36.700 11.753 36.560L11.753 34.711Q11.753 34.441 11.645 34.380Q11.538 34.318 11.227 34.318L11.227 34.038L12.255 33.963L12.255 34.670Q12.385 34.362 12.628 34.163Q12.871 33.963 13.188 33.963Q13.407 33.963 13.578 34.087Q13.749 34.212 13.749 34.424Q13.749 34.561 13.650 34.660Q13.551 34.759 13.417 34.759Q13.281 34.759 13.182 34.660Q13.082 34.561 13.082 34.424Q13.082 34.284 13.182 34.185Q12.891 34.185 12.691 34.381Q12.491 34.578 12.399 34.872Q12.307 35.166 12.307 35.446L12.307 36.560Q12.307 36.769 12.963 36.769L12.963 37.049M14.392 36.321Q14.392 35.989 14.615 35.762Q14.839 35.535 15.183 35.407Q15.526 35.278 15.899 35.226Q16.271 35.173 16.576 35.173L16.576 34.920Q16.576 34.715 16.468 34.535Q16.360 34.356 16.179 34.253Q15.998 34.151 15.790 34.151Q15.383 34.151 15.147 34.243Q15.236 34.280 15.282 34.364Q15.328 34.448 15.328 34.550Q15.328 34.646 15.282 34.725Q15.236 34.803 15.155 34.848Q15.075 34.892 14.986 34.892Q14.836 34.892 14.735 34.795Q14.634 34.697 14.634 34.550Q14.634 33.928 15.790 33.928Q16.001 33.928 16.251 33.992Q16.500 34.055 16.702 34.174Q16.904 34.294 17.030 34.479Q17.157 34.663 17.157 34.906L17.157 36.482Q17.157 36.598 17.218 36.694Q17.280 36.789 17.393 36.789Q17.502 36.789 17.567 36.695Q17.632 36.601 17.632 36.482L17.632 36.034L17.898 36.034L17.898 36.482Q17.898 36.752 17.671 36.917Q17.444 37.083 17.164 37.083Q16.955 37.083 16.818 36.929Q16.682 36.776 16.658 36.560Q16.511 36.827 16.229 36.972Q15.947 37.117 15.622 37.117Q15.345 37.117 15.061 37.042Q14.778 36.967 14.585 36.788Q14.392 36.608 14.392 36.321M15.007 36.321Q15.007 36.495 15.108 36.625Q15.208 36.755 15.364 36.825Q15.519 36.895 15.684 36.895Q15.902 36.895 16.111 36.798Q16.319 36.700 16.447 36.519Q16.576 36.338 16.576 36.112L16.576 35.384Q16.251 35.384 15.885 35.475Q15.519 35.566 15.263 35.778Q15.007 35.989 15.007 36.321M18.842 36.208L18.842 34.311L18.203 34.311L18.203 34.089Q18.520 34.089 18.738 33.879Q18.955 33.669 19.055 33.359Q19.156 33.050 19.156 32.742L19.423 32.742L19.423 34.031L20.499 34.031L20.499 34.311L19.423 34.311L19.423 36.195Q19.423 36.471 19.527 36.670Q19.631 36.868 19.891 36.868Q20.048 36.868 20.154 36.764Q20.260 36.659 20.310 36.506Q20.359 36.352 20.359 36.195L20.359 35.781L20.626 35.781L20.626 36.208Q20.626 36.434 20.527 36.644Q20.428 36.854 20.243 36.986Q20.059 37.117 19.830 37.117Q19.392 37.117 19.117 36.880Q18.842 36.642 18.842 36.208M23.053 37.049L21.501 37.049L21.501 36.769Q21.727 36.769 21.875 36.735Q22.024 36.700 22.024 36.560L22.024 34.711Q22.024 34.523 21.976 34.439Q21.928 34.356 21.831 34.337Q21.733 34.318 21.521 34.318L21.521 34.038L22.578 33.963L22.578 36.560Q22.578 36.700 22.709 36.735Q22.841 36.769 23.053 36.769L23.053 37.049M21.781 32.742Q21.781 32.571 21.904 32.452Q22.027 32.332 22.198 32.332Q22.366 32.332 22.489 32.452Q22.612 32.571 22.612 32.742Q22.612 32.917 22.489 33.040Q22.366 33.163 22.198 33.163Q22.027 33.163 21.904 33.040Q21.781 32.917 21.781 32.742M23.658 35.566Q23.658 35.224 23.793 34.925Q23.928 34.626 24.167 34.402Q24.406 34.178 24.724 34.053Q25.042 33.928 25.373 33.928Q25.818 33.928 26.218 34.144Q26.618 34.359 26.852 34.737Q27.086 35.114 27.086 35.566Q27.086 35.907 26.944 36.191Q26.802 36.475 26.558 36.682Q26.313 36.888 26.004 37.003Q25.695 37.117 25.373 37.117Q24.943 37.117 24.541 36.916Q24.140 36.714 23.899 36.362Q23.658 36.010 23.658 35.566M25.373 36.868Q25.975 36.868 26.199 36.490Q26.423 36.112 26.423 35.480Q26.423 34.868 26.189 34.509Q25.955 34.151 25.373 34.151Q24.321 34.151 24.321 35.480Q24.321 36.112 24.546 36.490Q24.772 36.868 25.373 36.868M29.362 37.049L27.728 37.049L27.728 36.769Q27.957 36.769 28.106 36.735Q28.255 36.700 28.255 36.560L28.255 34.711Q28.255 34.441 28.147 34.380Q28.040 34.318 27.728 34.318L27.728 34.038L28.788 33.963L28.788 34.612Q28.959 34.304 29.263 34.133Q29.567 33.963 29.913 33.963Q30.418 33.963 30.702 34.186Q30.986 34.410 30.986 34.906L30.986 36.560Q30.986 36.697 31.134 36.733Q31.283 36.769 31.509 36.769L31.509 37.049L29.878 37.049L29.878 36.769Q30.107 36.769 30.256 36.735Q30.405 36.700 30.405 36.560L30.405 34.920Q30.405 34.585 30.285 34.385Q30.165 34.185 29.851 34.185Q29.581 34.185 29.347 34.321Q29.113 34.458 28.974 34.692Q28.836 34.926 28.836 35.200L28.836 36.560Q28.836 36.697 28.986 36.733Q29.137 36.769 29.362 36.769L29.362 37.049M32.155 36.321Q32.155 35.989 32.379 35.762Q32.602 35.535 32.946 35.407Q33.290 35.278 33.662 35.226Q34.035 35.173 34.339 35.173L34.339 34.920Q34.339 34.715 34.231 34.535Q34.123 34.356 33.942 34.253Q33.761 34.151 33.553 34.151Q33.146 34.151 32.910 34.243Q32.999 34.280 33.045 34.364Q33.091 34.448 33.091 34.550Q33.091 34.646 33.045 34.725Q32.999 34.803 32.919 34.848Q32.838 34.892 32.749 34.892Q32.599 34.892 32.498 34.795Q32.397 34.697 32.397 34.550Q32.397 33.928 33.553 33.928Q33.765 33.928 34.014 33.992Q34.264 34.055 34.465 34.174Q34.667 34.294 34.793 34.479Q34.920 34.663 34.920 34.906L34.920 36.482Q34.920 36.598 34.981 36.694Q35.043 36.789 35.156 36.789Q35.265 36.789 35.330 36.695Q35.395 36.601 35.395 36.482L35.395 36.034L35.662 36.034L35.662 36.482Q35.662 36.752 35.434 36.917Q35.207 37.083 34.927 37.083Q34.718 37.083 34.581 36.929Q34.445 36.776 34.421 36.560Q34.274 36.827 33.992 36.972Q33.710 37.117 33.385 37.117Q33.108 37.117 32.825 37.042Q32.541 36.967 32.348 36.788Q32.155 36.608 32.155 36.321M32.770 36.321Q32.770 36.495 32.871 36.625Q32.972 36.755 33.127 36.825Q33.283 36.895 33.447 36.895Q33.665 36.895 33.874 36.798Q34.082 36.700 34.211 36.519Q34.339 36.338 34.339 36.112L34.339 35.384Q34.014 35.384 33.648 35.475Q33.283 35.566 33.026 35.778Q32.770 35.989 32.770 36.321M37.747 37.049L36.144 37.049L36.144 36.769Q36.369 36.769 36.518 36.735Q36.666 36.700 36.666 36.560L36.666 32.941Q36.666 32.671 36.559 32.609Q36.451 32.548 36.144 32.548L36.144 32.267L37.220 32.192L37.220 36.560Q37.220 36.697 37.371 36.733Q37.521 36.769 37.747 36.769\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(96.976 22.62)\">\u003Cpath d=\"M42.730 37.049L41.127 37.049L41.127 36.769Q41.353 36.769 41.502 36.735Q41.650 36.700 41.650 36.560L41.650 32.941Q41.650 32.671 41.543 32.609Q41.435 32.548 41.127 32.548L41.127 32.267L42.204 32.192L42.204 36.560Q42.204 36.697 42.354 36.733Q42.505 36.769 42.730 36.769L42.730 37.049M43.284 35.514Q43.284 35.193 43.409 34.904Q43.534 34.615 43.759 34.392Q43.985 34.168 44.280 34.048Q44.576 33.928 44.894 33.928Q45.222 33.928 45.484 34.028Q45.745 34.127 45.921 34.309Q46.097 34.492 46.191 34.750Q46.285 35.008 46.285 35.340Q46.285 35.432 46.203 35.453L43.947 35.453L43.947 35.514Q43.947 36.102 44.231 36.485Q44.515 36.868 45.082 36.868Q45.403 36.868 45.672 36.675Q45.940 36.482 46.029 36.167Q46.036 36.126 46.111 36.112L46.203 36.112Q46.285 36.136 46.285 36.208Q46.285 36.215 46.278 36.242Q46.165 36.639 45.795 36.878Q45.424 37.117 45 37.117Q44.562 37.117 44.163 36.909Q43.763 36.700 43.523 36.333Q43.284 35.966 43.284 35.514M43.954 35.244L45.769 35.244Q45.769 34.967 45.672 34.715Q45.574 34.462 45.376 34.306Q45.178 34.151 44.894 34.151Q44.617 34.151 44.404 34.309Q44.190 34.468 44.072 34.723Q43.954 34.978 43.954 35.244M48.462 37.022L47.334 34.523Q47.263 34.376 47.133 34.344Q47.003 34.311 46.774 34.311L46.774 34.031L48.288 34.031L48.288 34.311Q47.936 34.311 47.936 34.458Q47.936 34.503 47.946 34.523L48.811 36.441L49.590 34.711Q49.624 34.643 49.624 34.564Q49.624 34.451 49.541 34.381Q49.457 34.311 49.337 34.311L49.337 34.031L50.534 34.031L50.534 34.311Q50.315 34.311 50.144 34.414Q49.973 34.516 49.884 34.711L48.849 37.022Q48.801 37.117 48.695 37.117L48.616 37.117Q48.510 37.117 48.462 37.022\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(96.976 22.62)\">\u003Cpath d=\"M50.827 35.514Q50.827 35.193 50.952 34.904Q51.077 34.615 51.303 34.392Q51.528 34.168 51.824 34.048Q52.119 33.928 52.437 33.928Q52.765 33.928 53.027 34.028Q53.288 34.127 53.464 34.309Q53.640 34.492 53.734 34.750Q53.828 35.008 53.828 35.340Q53.828 35.432 53.746 35.453L51.491 35.453L51.491 35.514Q51.491 36.102 51.774 36.485Q52.058 36.868 52.625 36.868Q52.947 36.868 53.215 36.675Q53.483 36.482 53.572 36.167Q53.579 36.126 53.654 36.112L53.746 36.112Q53.828 36.136 53.828 36.208Q53.828 36.215 53.822 36.242Q53.709 36.639 53.338 36.878Q52.967 37.117 52.543 37.117Q52.106 37.117 51.706 36.909Q51.306 36.700 51.067 36.333Q50.827 35.966 50.827 35.514M51.497 35.244L53.312 35.244Q53.312 34.967 53.215 34.715Q53.117 34.462 52.919 34.306Q52.721 34.151 52.437 34.151Q52.160 34.151 51.947 34.309Q51.733 34.468 51.615 34.723Q51.497 34.978 51.497 35.244M56.084 37.049L54.481 37.049L54.481 36.769Q54.707 36.769 54.856 36.735Q55.004 36.700 55.004 36.560L55.004 32.941Q55.004 32.671 54.897 32.609Q54.789 32.548 54.481 32.548L54.481 32.267L55.558 32.192L55.558 36.560Q55.558 36.697 55.708 36.733Q55.859 36.769 56.084 36.769\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M11.322 19.977c51.215-79.668 125.192-79.668 204.86 0\" style=\"stroke-dasharray:0.4,1.0\"\u002F>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">A vibronic absorption progression: lines at the upper vibrational levels v' from the ground level, their intensities following the Franck-Condon factors so the band peaks at an intermediate v' set by the curve displacement.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:344.737px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 258.553 137.951\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-51.835 53.456h71.132\" style=\"stroke-width:.8\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(.457 1.892)\">\u003Cpath d=\"M-65.401 53.596L-65.453 53.596Q-65.483 53.596-65.506 53.571Q-65.528 53.545-65.528 53.511Q-65.528 53.504-65.521 53.490L-65.138 51.921Q-65.124 51.867-65.060 51.867L-64.947 51.867Q-64.913 51.867-64.892 51.891Q-64.872 51.914-64.872 51.952Q-64.872 51.990-64.899 52.126Q-64.926 52.263-64.926 52.342Q-64.926 52.858-64.528 53.087Q-64.130 53.316-63.569 53.316Q-63.262 53.316-62.951 53.150Q-62.640 52.984-62.440 52.704Q-62.240 52.424-62.240 52.106Q-62.240 51.850-62.400 51.656Q-62.561 51.463-62.821 51.405L-63.791 51.173Q-64.041 51.115-64.236 50.971Q-64.431 50.828-64.542 50.614Q-64.653 50.400-64.653 50.144Q-64.653 49.812-64.490 49.517Q-64.328 49.221-64.055 48.999Q-63.781 48.777-63.450 48.655Q-63.118 48.534-62.807 48.534Q-62.452 48.534-62.159 48.650Q-61.867 48.767-61.679 49.019L-61.259 48.555Q-61.238 48.534-61.211 48.534L-61.160 48.534Q-61.125 48.534-61.105 48.560Q-61.084 48.585-61.084 48.620Q-61.084 48.626-61.091 48.640L-61.478 50.202Q-61.501 50.264-61.553 50.264L-61.665 50.264Q-61.741 50.264-61.741 50.171Q-61.727 50.069-61.713 49.857Q-61.713 49.334-62.004 49.060Q-62.294 48.787-62.828 48.787Q-63.050 48.787-63.279 48.867Q-63.508 48.948-63.704 49.096Q-63.901 49.245-64.019 49.448Q-64.137 49.652-64.137 49.877Q-64.137 50.117-63.971 50.294Q-63.805 50.472-63.562 50.530L-62.588 50.763Q-62.339 50.817-62.139 50.975Q-61.939 51.132-61.830 51.357Q-61.720 51.583-61.720 51.846Q-61.720 52.304-61.995 52.707Q-62.270 53.111-62.708 53.353Q-63.145 53.596-63.597 53.596Q-64.537 53.596-64.940 53.114L-65.353 53.576Q-65.374 53.596-65.401 53.596\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(.457 1.892)\">\u003Cpath d=\"M-59.452 54.566Q-60.170 54.566-60.467 54.092Q-60.765 53.619-60.765 52.862Q-60.765 52.098-60.469 51.612Q-60.172 51.126-59.452 51.126Q-58.729 51.126-58.432 51.612Q-58.136 52.098-58.136 52.862Q-58.136 53.216-58.198 53.516Q-58.260 53.816-58.411 54.056Q-58.561 54.295-58.818 54.430Q-59.076 54.566-59.452 54.566M-59.452 54.380Q-59.088 54.380-58.912 54.130Q-58.736 53.880-58.696 53.554Q-58.656 53.228-58.656 52.781Q-58.656 52.349-58.696 52.052Q-58.736 51.756-58.911 51.534Q-59.086 51.311-59.452 51.311Q-59.816 51.311-59.990 51.534Q-60.165 51.756-60.205 52.052Q-60.245 52.349-60.245 52.781Q-60.245 53.228-60.205 53.554Q-60.165 53.880-59.989 54.130Q-59.813 54.380-59.452 54.380\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-51.835-37.593h71.132\" style=\"stroke-width:.8\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\">\u003Cg transform=\"translate(.457 -89.157)\">\u003Cpath d=\"M-65.401 53.596L-65.453 53.596Q-65.483 53.596-65.506 53.571Q-65.528 53.545-65.528 53.511Q-65.528 53.504-65.521 53.490L-65.138 51.921Q-65.124 51.867-65.060 51.867L-64.947 51.867Q-64.913 51.867-64.892 51.891Q-64.872 51.914-64.872 51.952Q-64.872 51.990-64.899 52.126Q-64.926 52.263-64.926 52.342Q-64.926 52.858-64.528 53.087Q-64.130 53.316-63.569 53.316Q-63.262 53.316-62.951 53.150Q-62.640 52.984-62.440 52.704Q-62.240 52.424-62.240 52.106Q-62.240 51.850-62.400 51.656Q-62.561 51.463-62.821 51.405L-63.791 51.173Q-64.041 51.115-64.236 50.971Q-64.431 50.828-64.542 50.614Q-64.653 50.400-64.653 50.144Q-64.653 49.812-64.490 49.517Q-64.328 49.221-64.055 48.999Q-63.781 48.777-63.450 48.655Q-63.118 48.534-62.807 48.534Q-62.452 48.534-62.159 48.650Q-61.867 48.767-61.679 49.019L-61.259 48.555Q-61.238 48.534-61.211 48.534L-61.160 48.534Q-61.125 48.534-61.105 48.560Q-61.084 48.585-61.084 48.620Q-61.084 48.626-61.091 48.640L-61.478 50.202Q-61.501 50.264-61.553 50.264L-61.665 50.264Q-61.741 50.264-61.741 50.171Q-61.727 50.069-61.713 49.857Q-61.713 49.334-62.004 49.060Q-62.294 48.787-62.828 48.787Q-63.050 48.787-63.279 48.867Q-63.508 48.948-63.704 49.096Q-63.901 49.245-64.019 49.448Q-64.137 49.652-64.137 49.877Q-64.137 50.117-63.971 50.294Q-63.805 50.472-63.562 50.530L-62.588 50.763Q-62.339 50.817-62.139 50.975Q-61.939 51.132-61.830 51.357Q-61.720 51.583-61.720 51.846Q-61.720 52.304-61.995 52.707Q-62.270 53.111-62.708 53.353Q-63.145 53.596-63.597 53.596Q-64.537 53.596-64.940 53.114L-65.353 53.576Q-65.374 53.596-65.401 53.596\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(.457 -89.157)\">\u003Cpath d=\"M-58.370 54.456L-60.411 54.456L-60.411 54.217Q-59.630 54.217-59.630 54.097L-59.630 51.551Q-59.808 51.626-60.012 51.656Q-60.216 51.685-60.445 51.685L-60.445 51.446Q-60.109 51.446-59.825 51.377Q-59.542 51.309-59.332 51.126L-59.227 51.126Q-59.200 51.126-59.176 51.150Q-59.151 51.175-59.151 51.202L-59.151 54.097Q-59.151 54.217-58.370 54.217\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-51.835-66.045h71.132\" style=\"stroke-width:.8\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(.457 -117.61)\">\u003Cpath d=\"M-65.401 53.596L-65.453 53.596Q-65.483 53.596-65.506 53.571Q-65.528 53.545-65.528 53.511Q-65.528 53.504-65.521 53.490L-65.138 51.921Q-65.124 51.867-65.060 51.867L-64.947 51.867Q-64.913 51.867-64.892 51.891Q-64.872 51.914-64.872 51.952Q-64.872 51.990-64.899 52.126Q-64.926 52.263-64.926 52.342Q-64.926 52.858-64.528 53.087Q-64.130 53.316-63.569 53.316Q-63.262 53.316-62.951 53.150Q-62.640 52.984-62.440 52.704Q-62.240 52.424-62.240 52.106Q-62.240 51.850-62.400 51.656Q-62.561 51.463-62.821 51.405L-63.791 51.173Q-64.041 51.115-64.236 50.971Q-64.431 50.828-64.542 50.614Q-64.653 50.400-64.653 50.144Q-64.653 49.812-64.490 49.517Q-64.328 49.221-64.055 48.999Q-63.781 48.777-63.450 48.655Q-63.118 48.534-62.807 48.534Q-62.452 48.534-62.159 48.650Q-61.867 48.767-61.679 49.019L-61.259 48.555Q-61.238 48.534-61.211 48.534L-61.160 48.534Q-61.125 48.534-61.105 48.560Q-61.084 48.585-61.084 48.620Q-61.084 48.626-61.091 48.640L-61.478 50.202Q-61.501 50.264-61.553 50.264L-61.665 50.264Q-61.741 50.264-61.741 50.171Q-61.727 50.069-61.713 49.857Q-61.713 49.334-62.004 49.060Q-62.294 48.787-62.828 48.787Q-63.050 48.787-63.279 48.867Q-63.508 48.948-63.704 49.096Q-63.901 49.245-64.019 49.448Q-64.137 49.652-64.137 49.877Q-64.137 50.117-63.971 50.294Q-63.805 50.472-63.562 50.530L-62.588 50.763Q-62.339 50.817-62.139 50.975Q-61.939 51.132-61.830 51.357Q-61.720 51.583-61.720 51.846Q-61.720 52.304-61.995 52.707Q-62.270 53.111-62.708 53.353Q-63.145 53.596-63.597 53.596Q-64.537 53.596-64.940 53.114L-65.353 53.576Q-65.374 53.596-65.401 53.596\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(.457 -117.61)\">\u003Cpath d=\"M-58.370 54.456L-60.697 54.456L-60.697 54.275Q-60.694 54.263-60.675 54.236L-59.635 53.360Q-59.327 53.101-59.173 52.957Q-59.020 52.813-58.890 52.596Q-58.761 52.378-58.761 52.137Q-58.761 51.895-58.888 51.719Q-59.015 51.543-59.219 51.454Q-59.422 51.365-59.662 51.365Q-59.869 51.365-60.065 51.453Q-60.260 51.541-60.365 51.707Q-60.245 51.707-60.168 51.799Q-60.091 51.890-60.091 52.005Q-60.091 52.132-60.178 52.221Q-60.265 52.310-60.392 52.310Q-60.521 52.310-60.609 52.220Q-60.697 52.129-60.697 52.005Q-60.697 51.724-60.524 51.525Q-60.350 51.326-60.079 51.226Q-59.808 51.126-59.535 51.126Q-59.210 51.126-58.905 51.233Q-58.600 51.341-58.403 51.568Q-58.207 51.795-58.207 52.132Q-58.207 52.369-58.320 52.561Q-58.434 52.754-58.594 52.892Q-58.754 53.030-59.036 53.218Q-59.318 53.406-59.396 53.465L-60.062 53.956L-59.606 53.956Q-59.173 53.956-58.879 53.949Q-58.585 53.943-58.570 53.931Q-58.492 53.833-58.436 53.472L-58.207 53.472\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M76.203-14.83h62.596\" style=\"stroke-width:.8\"\u002F>\u003Cg stroke=\"none\">\u003Cg transform=\"translate(209.815 -66.536)\">\u003Cpath d=\"M-65.381 53.343L-65.353 53.230Q-65.326 53.183-65.278 53.176Q-64.632 53.176-64.437 53.135Q-64.301 53.094-64.263 52.930L-63.316 49.149Q-63.292 49.067-63.282 48.989Q-63.282 48.955-63.515 48.955L-63.997 48.955Q-64.386 48.955-64.624 49.030Q-64.861 49.105-65.007 49.252Q-65.152 49.399-65.251 49.618Q-65.350 49.836-65.494 50.250Q-65.521 50.301-65.579 50.311L-65.668 50.311Q-65.753 50.288-65.753 50.216Q-65.753 50.209-65.747 50.171L-65.241 48.732Q-65.213 48.685-65.159 48.674L-60.603 48.674Q-60.517 48.698-60.517 48.780L-60.726 50.223Q-60.746 50.291-60.818 50.311L-60.910 50.311Q-60.992 50.288-60.992 50.202Q-60.931 49.741-60.931 49.549Q-60.931 49.153-61.139 49.054Q-61.348 48.955-61.806 48.955L-62.288 48.955Q-62.482 48.955-62.540 48.989Q-62.599 49.023-62.646 49.201L-63.590 52.981Q-63.590 53.001-63.592 53.013Q-63.593 53.025-63.597 53.042Q-63.597 53.124-63.521 53.135Q-63.344 53.176-62.728 53.176Q-62.646 53.203-62.646 53.282L-62.674 53.394Q-62.701 53.449-62.749 53.456L-65.299 53.456Q-65.333 53.456-65.357 53.420Q-65.381 53.384-65.381 53.343\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(209.815 -66.536)\">\u003Cpath d=\"M-58.557 54.456L-60.598 54.456L-60.598 54.217Q-59.817 54.217-59.817 54.097L-59.817 51.551Q-59.995 51.626-60.199 51.656Q-60.403 51.685-60.632 51.685L-60.632 51.446Q-60.296 51.446-60.012 51.377Q-59.729 51.309-59.519 51.126L-59.414 51.126Q-59.387 51.126-59.363 51.150Q-59.338 51.175-59.338 51.202L-59.338 54.097Q-59.338 54.217-58.557 54.217\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.150\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(209.815 -66.536)\">\u003Cpath d=\"M-53.900 52.615L-53.900 50.718L-54.539 50.718L-54.539 50.496Q-54.221 50.496-54.004 50.286Q-53.787 50.076-53.687 49.766Q-53.586 49.457-53.586 49.149L-53.319 49.149L-53.319 50.438L-52.242 50.438L-52.242 50.718L-53.319 50.718L-53.319 52.602Q-53.319 52.878-53.215 53.077Q-53.111 53.275-52.851 53.275Q-52.694 53.275-52.588 53.171Q-52.482 53.066-52.432 52.913Q-52.383 52.759-52.383 52.602L-52.383 52.188L-52.116 52.188L-52.116 52.615Q-52.116 52.841-52.215 53.051Q-52.314 53.261-52.499 53.393Q-52.683 53.524-52.912 53.524Q-53.350 53.524-53.625 53.287Q-53.900 53.049-53.900 52.615M-49.556 53.456L-51.292 53.456L-51.292 53.176Q-51.063 53.176-50.915 53.142Q-50.766 53.107-50.766 52.967L-50.766 51.118Q-50.766 50.848-50.874 50.787Q-50.981 50.725-51.292 50.725L-51.292 50.445L-50.263 50.370L-50.263 51.077Q-50.134 50.769-49.891 50.570Q-49.648 50.370-49.330 50.370Q-49.112 50.370-48.941 50.494Q-48.770 50.619-48.770 50.831Q-48.770 50.968-48.869 51.067Q-48.968 51.166-49.101 51.166Q-49.238 51.166-49.337 51.067Q-49.436 50.968-49.436 50.831Q-49.436 50.691-49.337 50.592Q-49.628 50.592-49.828 50.788Q-50.028 50.985-50.120 51.279Q-50.212 51.573-50.212 51.853L-50.212 52.967Q-50.212 53.176-49.556 53.176L-49.556 53.456M-46.569 53.456L-48.120 53.456L-48.120 53.176Q-47.895 53.176-47.746 53.142Q-47.597 53.107-47.597 52.967L-47.597 51.118Q-47.597 50.930-47.645 50.846Q-47.693 50.763-47.791 50.744Q-47.888 50.725-48.100 50.725L-48.100 50.445L-47.044 50.370L-47.044 52.967Q-47.044 53.107-46.912 53.142Q-46.781 53.176-46.569 53.176L-46.569 53.456M-47.840 49.149Q-47.840 48.978-47.717 48.859Q-47.594 48.739-47.423 48.739Q-47.256 48.739-47.133 48.859Q-47.010 48.978-47.010 49.149Q-47.010 49.324-47.133 49.447Q-47.256 49.570-47.423 49.570Q-47.594 49.570-47.717 49.447Q-47.840 49.324-47.840 49.149M-44.279 54.813L-45.909 54.813L-45.909 54.533Q-45.680 54.533-45.531 54.498Q-45.383 54.464-45.383 54.324L-45.383 50.978Q-45.383 50.807-45.519 50.766Q-45.656 50.725-45.909 50.725L-45.909 50.445L-44.829 50.370L-44.829 50.776Q-44.607 50.575-44.320 50.472Q-44.033 50.370-43.725 50.370Q-43.298 50.370-42.934 50.583Q-42.570 50.797-42.356 51.161Q-42.142 51.525-42.142 51.945Q-42.142 52.390-42.382 52.754Q-42.621 53.118-43.014 53.321Q-43.407 53.524-43.851 53.524Q-44.118 53.524-44.366 53.424Q-44.614 53.323-44.802 53.142L-44.802 54.324Q-44.802 54.461-44.653 54.497Q-44.504 54.533-44.279 54.533L-44.279 54.813M-44.802 51.125L-44.802 52.735Q-44.668 52.988-44.426 53.145Q-44.183 53.302-43.906 53.302Q-43.578 53.302-43.325 53.101Q-43.072 52.899-42.939 52.581Q-42.805 52.263-42.805 51.945Q-42.805 51.716-42.870 51.487Q-42.935 51.258-43.064 51.060Q-43.192 50.862-43.387 50.742Q-43.581 50.623-43.814 50.623Q-44.108 50.623-44.376 50.752Q-44.644 50.882-44.802 51.125M-39.839 53.456L-41.442 53.456L-41.442 53.176Q-41.216 53.176-41.067 53.142Q-40.919 53.107-40.919 52.967L-40.919 49.348Q-40.919 49.078-41.026 49.016Q-41.134 48.955-41.442 48.955L-41.442 48.674L-40.365 48.599L-40.365 52.967Q-40.365 53.104-40.215 53.140Q-40.064 53.176-39.839 53.176L-39.839 53.456M-39.285 51.921Q-39.285 51.600-39.160 51.311Q-39.035 51.022-38.810 50.799Q-38.584 50.575-38.289 50.455Q-37.993 50.335-37.675 50.335Q-37.347 50.335-37.085 50.435Q-36.824 50.534-36.648 50.716Q-36.472 50.899-36.378 51.157Q-36.284 51.415-36.284 51.747Q-36.284 51.839-36.366 51.860L-38.622 51.860L-38.622 51.921Q-38.622 52.509-38.338 52.892Q-38.054 53.275-37.487 53.275Q-37.166 53.275-36.897 53.082Q-36.629 52.889-36.540 52.574Q-36.533 52.533-36.458 52.519L-36.366 52.519Q-36.284 52.543-36.284 52.615Q-36.284 52.622-36.291 52.649Q-36.404 53.046-36.774 53.285Q-37.145 53.524-37.569 53.524Q-38.007 53.524-38.407 53.316Q-38.806 53.107-39.046 52.740Q-39.285 52.373-39.285 51.921M-38.615 51.651L-36.800 51.651Q-36.800 51.374-36.897 51.122Q-36.995 50.869-37.193 50.713Q-37.391 50.558-37.675 50.558Q-37.952 50.558-38.166 50.716Q-38.379 50.875-38.497 51.130Q-38.615 51.385-38.615 51.651M-35.170 52.615L-35.170 50.718L-35.809 50.718L-35.809 50.496Q-35.491 50.496-35.274 50.286Q-35.057 50.076-34.956 49.766Q-34.855 49.457-34.855 49.149L-34.589 49.149L-34.589 50.438L-33.512 50.438L-33.512 50.718L-34.589 50.718L-34.589 52.602Q-34.589 52.878-34.484 53.077Q-34.380 53.275-34.120 53.275Q-33.963 53.275-33.857 53.171Q-33.751 53.066-33.702 52.913Q-33.652 52.759-33.652 52.602L-33.652 52.188L-33.386 52.188L-33.386 52.615Q-33.386 52.841-33.485 53.051Q-33.584 53.261-33.768 53.393Q-33.953 53.524-34.182 53.524Q-34.619 53.524-34.895 53.287Q-35.170 53.049-35.170 52.615\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M-34.763 52.033V-61.423\"\u002F>\u003Cpath stroke=\"none\" d=\"m-34.763-64.623-2.56 5.12 2.56-1.92 2.56 1.92\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(3.244 -54.475)\">\u003Cpath d=\"M-65.688 52.728Q-65.688 52.396-65.465 52.169Q-65.241 51.942-64.897 51.814Q-64.554 51.685-64.181 51.633Q-63.809 51.580-63.504 51.580L-63.504 51.327Q-63.504 51.122-63.612 50.942Q-63.720 50.763-63.901 50.660Q-64.082 50.558-64.290 50.558Q-64.697 50.558-64.933 50.650Q-64.844 50.687-64.798 50.771Q-64.752 50.855-64.752 50.957Q-64.752 51.053-64.798 51.132Q-64.844 51.210-64.925 51.255Q-65.005 51.299-65.094 51.299Q-65.244 51.299-65.345 51.202Q-65.446 51.104-65.446 50.957Q-65.446 50.335-64.290 50.335Q-64.079 50.335-63.829 50.399Q-63.580 50.462-63.378 50.581Q-63.176 50.701-63.050 50.886Q-62.923 51.070-62.923 51.313L-62.923 52.889Q-62.923 53.005-62.862 53.101Q-62.800 53.196-62.687 53.196Q-62.578 53.196-62.513 53.102Q-62.448 53.008-62.448 52.889L-62.448 52.441L-62.182 52.441L-62.182 52.889Q-62.182 53.159-62.409 53.324Q-62.636 53.490-62.916 53.490Q-63.125 53.490-63.262 53.336Q-63.398 53.183-63.422 52.967Q-63.569 53.234-63.851 53.379Q-64.133 53.524-64.458 53.524Q-64.735 53.524-65.019 53.449Q-65.302 53.374-65.495 53.195Q-65.688 53.015-65.688 52.728M-65.073 52.728Q-65.073 52.902-64.972 53.032Q-64.872 53.162-64.716 53.232Q-64.561 53.302-64.396 53.302Q-64.178 53.302-63.969 53.205Q-63.761 53.107-63.633 52.926Q-63.504 52.745-63.504 52.519L-63.504 51.791Q-63.829 51.791-64.195 51.882Q-64.561 51.973-64.817 52.185Q-65.073 52.396-65.073 52.728M-60.958 53.456L-61.225 53.456L-61.225 49.348Q-61.225 49.078-61.332 49.016Q-61.440 48.955-61.751 48.955L-61.751 48.674L-60.671 48.599L-60.671 50.769Q-60.462 50.578-60.177 50.474Q-59.892 50.370-59.594 50.370Q-59.276 50.370-58.979 50.491Q-58.682 50.612-58.459 50.828Q-58.237 51.043-58.111 51.328Q-57.984 51.614-57.984 51.945Q-57.984 52.390-58.224 52.754Q-58.463 53.118-58.856 53.321Q-59.249 53.524-59.693 53.524Q-59.888 53.524-60.078 53.468Q-60.268 53.412-60.428 53.307Q-60.589 53.203-60.729 53.042L-60.958 53.456M-60.644 51.111L-60.644 52.728Q-60.507 52.988-60.266 53.145Q-60.025 53.302-59.748 53.302Q-59.454 53.302-59.242 53.195Q-59.030 53.087-58.897 52.895Q-58.764 52.704-58.706 52.465Q-58.647 52.226-58.647 51.945Q-58.647 51.586-58.741 51.282Q-58.835 50.978-59.063 50.785Q-59.290 50.592-59.656 50.592Q-59.957 50.592-60.223 50.728Q-60.490 50.865-60.644 51.111M-57.349 53.449L-57.349 52.386Q-57.349 52.362-57.321 52.335Q-57.294 52.308-57.270 52.308L-57.161 52.308Q-57.096 52.308-57.082 52.366Q-56.986 52.800-56.740 53.051Q-56.494 53.302-56.081 53.302Q-55.739 53.302-55.486 53.169Q-55.233 53.036-55.233 52.728Q-55.233 52.571-55.327 52.456Q-55.421 52.342-55.559 52.273Q-55.698 52.205-55.865 52.167L-56.446 52.068Q-56.802 52-57.075 51.779Q-57.349 51.559-57.349 51.217Q-57.349 50.968-57.238 50.793Q-57.126 50.619-56.940 50.520Q-56.754 50.421-56.539 50.378Q-56.323 50.335-56.081 50.335Q-55.667 50.335-55.387 50.517L-55.171 50.342Q-55.161 50.339-55.154 50.337Q-55.147 50.335-55.137 50.335L-55.086 50.335Q-55.059 50.335-55.035 50.359Q-55.011 50.383-55.011 50.411L-55.011 51.258Q-55.011 51.279-55.035 51.306Q-55.059 51.333-55.086 51.333L-55.199 51.333Q-55.226 51.333-55.252 51.308Q-55.277 51.282-55.277 51.258Q-55.277 51.022-55.383 50.858Q-55.489 50.694-55.672 50.612Q-55.855 50.530-56.087 50.530Q-56.415 50.530-56.672 50.633Q-56.928 50.735-56.928 51.012Q-56.928 51.207-56.745 51.316Q-56.562 51.426-56.333 51.467L-55.759 51.573Q-55.513 51.621-55.300 51.749Q-55.086 51.877-54.949 52.080Q-54.812 52.284-54.812 52.533Q-54.812 53.046-55.178 53.285Q-55.544 53.524-56.081 53.524Q-56.576 53.524-56.908 53.230L-57.174 53.504Q-57.195 53.524-57.222 53.524L-57.270 53.524Q-57.294 53.524-57.321 53.497Q-57.349 53.470-57.349 53.449M-54.225 51.973Q-54.225 51.631-54.090 51.332Q-53.955 51.033-53.715 50.809Q-53.476 50.585-53.158 50.460Q-52.840 50.335-52.509 50.335Q-52.064 50.335-51.665 50.551Q-51.265 50.766-51.030 51.144Q-50.796 51.521-50.796 51.973Q-50.796 52.314-50.938 52.598Q-51.080 52.882-51.324 53.089Q-51.569 53.295-51.878 53.410Q-52.187 53.524-52.509 53.524Q-52.939 53.524-53.341 53.323Q-53.743 53.121-53.984 52.769Q-54.225 52.417-54.225 51.973M-52.509 53.275Q-51.907 53.275-51.683 52.897Q-51.459 52.519-51.459 51.887Q-51.459 51.275-51.694 50.916Q-51.928 50.558-52.509 50.558Q-53.561 50.558-53.561 51.887Q-53.561 52.519-53.336 52.897Q-53.110 53.275-52.509 53.275M-48.452 53.456L-50.188 53.456L-50.188 53.176Q-49.959 53.176-49.810 53.142Q-49.662 53.107-49.662 52.967L-49.662 51.118Q-49.662 50.848-49.769 50.787Q-49.877 50.725-50.188 50.725L-50.188 50.445L-49.159 50.370L-49.159 51.077Q-49.029 50.769-48.787 50.570Q-48.544 50.370-48.226 50.370Q-48.007 50.370-47.836 50.494Q-47.665 50.619-47.665 50.831Q-47.665 50.968-47.765 51.067Q-47.864 51.166-47.997 51.166Q-48.134 51.166-48.233 51.067Q-48.332 50.968-48.332 50.831Q-48.332 50.691-48.233 50.592Q-48.523 50.592-48.723 50.788Q-48.923 50.985-49.016 51.279Q-49.108 51.573-49.108 51.853L-49.108 52.967Q-49.108 53.176-48.452 53.176L-48.452 53.456M-46.274 53.456L-46.541 53.456L-46.541 49.348Q-46.541 49.078-46.649 49.016Q-46.756 48.955-47.067 48.955L-47.067 48.674L-45.987 48.599L-45.987 50.769Q-45.779 50.578-45.493 50.474Q-45.208 50.370-44.911 50.370Q-44.593 50.370-44.295 50.491Q-43.998 50.612-43.776 50.828Q-43.554 51.043-43.427 51.328Q-43.301 51.614-43.301 51.945Q-43.301 52.390-43.540 52.754Q-43.779 53.118-44.172 53.321Q-44.565 53.524-45.010 53.524Q-45.205 53.524-45.394 53.468Q-45.584 53.412-45.745 53.307Q-45.905 53.203-46.045 53.042L-46.274 53.456M-45.960 51.111L-45.960 52.728Q-45.823 52.988-45.582 53.145Q-45.341 53.302-45.064 53.302Q-44.770 53.302-44.559 53.195Q-44.347 53.087-44.213 52.895Q-44.080 52.704-44.022 52.465Q-43.964 52.226-43.964 51.945Q-43.964 51.586-44.058 51.282Q-44.152 50.978-44.379 50.785Q-44.606 50.592-44.972 50.592Q-45.273 50.592-45.540 50.728Q-45.806 50.865-45.960 51.111\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"M-20.537-64.623v23.008\"\u002F>\u003Cpath stroke=\"none\" d=\"m-20.537-39.015 2.08-4.16-2.08 1.56-2.08-1.56\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(49.626 -102.845)\">\u003Cpath d=\"M-63.997 53.456L-65.733 53.456L-65.733 53.176Q-65.504 53.176-65.355 53.142Q-65.207 53.107-65.207 52.967L-65.207 51.118Q-65.207 50.848-65.314 50.787Q-65.422 50.725-65.733 50.725L-65.733 50.445L-64.704 50.370L-64.704 51.077Q-64.574 50.769-64.332 50.570Q-64.089 50.370-63.771 50.370Q-63.552 50.370-63.381 50.494Q-63.210 50.619-63.210 50.831Q-63.210 50.968-63.310 51.067Q-63.409 51.166-63.542 51.166Q-63.679 51.166-63.778 51.067Q-63.877 50.968-63.877 50.831Q-63.877 50.691-63.778 50.592Q-64.068 50.592-64.268 50.788Q-64.468 50.985-64.561 51.279Q-64.653 51.573-64.653 51.853L-64.653 52.967Q-64.653 53.176-63.997 53.176L-63.997 53.456M-62.667 51.921Q-62.667 51.600-62.542 51.311Q-62.417 51.022-62.192 50.799Q-61.966 50.575-61.671 50.455Q-61.375 50.335-61.057 50.335Q-60.729 50.335-60.467 50.435Q-60.206 50.534-60.030 50.716Q-59.854 50.899-59.760 51.157Q-59.666 51.415-59.666 51.747Q-59.666 51.839-59.748 51.860L-62.004 51.860L-62.004 51.921Q-62.004 52.509-61.720 52.892Q-61.436 53.275-60.869 53.275Q-60.548 53.275-60.280 53.082Q-60.011 52.889-59.922 52.574Q-59.915 52.533-59.840 52.519L-59.748 52.519Q-59.666 52.543-59.666 52.615Q-59.666 52.622-59.673 52.649Q-59.786 53.046-60.156 53.285Q-60.527 53.524-60.951 53.524Q-61.389 53.524-61.789 53.316Q-62.188 53.107-62.428 52.740Q-62.667 52.373-62.667 51.921M-61.997 51.651L-60.182 51.651Q-60.182 51.374-60.280 51.122Q-60.377 50.869-60.575 50.713Q-60.773 50.558-61.057 50.558Q-61.334 50.558-61.548 50.716Q-61.761 50.875-61.879 51.130Q-61.997 51.385-61.997 51.651M-57.410 53.456L-59.013 53.456L-59.013 53.176Q-58.788 53.176-58.639 53.142Q-58.490 53.107-58.490 52.967L-58.490 49.348Q-58.490 49.078-58.598 49.016Q-58.706 48.955-59.013 48.955L-59.013 48.674L-57.936 48.599L-57.936 52.967Q-57.936 53.104-57.786 53.140Q-57.636 53.176-57.410 53.176L-57.410 53.456M-56.757 52.728Q-56.757 52.396-56.533 52.169Q-56.310 51.942-55.966 51.814Q-55.623 51.685-55.250 51.633Q-54.877 51.580-54.573 51.580L-54.573 51.327Q-54.573 51.122-54.681 50.942Q-54.789 50.763-54.970 50.660Q-55.151 50.558-55.359 50.558Q-55.766 50.558-56.002 50.650Q-55.913 50.687-55.867 50.771Q-55.821 50.855-55.821 50.957Q-55.821 51.053-55.867 51.132Q-55.913 51.210-55.993 51.255Q-56.074 51.299-56.163 51.299Q-56.313 51.299-56.414 51.202Q-56.515 51.104-56.515 50.957Q-56.515 50.335-55.359 50.335Q-55.147 50.335-54.898 50.399Q-54.648 50.462-54.447 50.581Q-54.245 50.701-54.119 50.886Q-53.992 51.070-53.992 51.313L-53.992 52.889Q-53.992 53.005-53.931 53.101Q-53.869 53.196-53.756 53.196Q-53.647 53.196-53.582 53.102Q-53.517 53.008-53.517 52.889L-53.517 52.441L-53.250 52.441L-53.250 52.889Q-53.250 53.159-53.478 53.324Q-53.705 53.490-53.985 53.490Q-54.194 53.490-54.331 53.336Q-54.467 53.183-54.491 52.967Q-54.638 53.234-54.920 53.379Q-55.202 53.524-55.527 53.524Q-55.804 53.524-56.087 53.449Q-56.371 53.374-56.564 53.195Q-56.757 53.015-56.757 52.728M-56.142 52.728Q-56.142 52.902-56.041 53.032Q-55.940 53.162-55.785 53.232Q-55.629 53.302-55.465 53.302Q-55.247 53.302-55.038 53.205Q-54.830 53.107-54.701 52.926Q-54.573 52.745-54.573 52.519L-54.573 51.791Q-54.898 51.791-55.264 51.882Q-55.629 51.973-55.886 52.185Q-56.142 52.396-56.142 52.728M-51.651 53.456L-52.974 53.456L-52.974 53.176Q-52.413 53.176-52.034 52.776L-51.319 51.979L-52.232 50.930Q-52.369 50.783-52.517 50.751Q-52.666 50.718-52.933 50.718L-52.933 50.438L-51.432 50.438L-51.432 50.718Q-51.624 50.718-51.624 50.852Q-51.624 50.882-51.593 50.930L-50.998 51.614L-50.557 51.118Q-50.444 50.988-50.444 50.872Q-50.444 50.810-50.482 50.764Q-50.519 50.718-50.578 50.718L-50.578 50.438L-49.262 50.438L-49.262 50.718Q-49.822 50.718-50.202 51.118L-50.824 51.819L-49.829 52.967Q-49.730 53.066-49.629 53.111Q-49.528 53.155-49.417 53.165Q-49.306 53.176-49.128 53.176L-49.128 53.456L-50.622 53.456L-50.622 53.176Q-50.557 53.176-50.497 53.142Q-50.437 53.107-50.437 53.042Q-50.437 52.995-50.468 52.967L-51.145 52.181L-51.678 52.776Q-51.791 52.906-51.791 53.022Q-51.791 53.087-51.750 53.131Q-51.709 53.176-51.651 53.176\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M2.225-36.17v85.003\"\u002F>\u003Cpath stroke=\"none\" d=\"m2.225 52.033 2.56-5.12-2.56 1.92-2.56-1.92\"\u002F>\u003C\u002Fg>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(72.389 -43.094)\">\u003Cpath d=\"M-63.949 53.456L-65.682 53.456L-65.682 53.176Q-65.456 53.176-65.307 53.142Q-65.159 53.107-65.159 52.967L-65.159 50.718L-65.747 50.718L-65.747 50.438L-65.159 50.438L-65.159 49.621Q-65.159 49.303-64.981 49.055Q-64.803 48.808-64.513 48.667Q-64.222 48.527-63.911 48.527Q-63.655 48.527-63.451 48.669Q-63.248 48.811-63.248 49.054Q-63.248 49.190-63.347 49.289Q-63.446 49.389-63.583 49.389Q-63.720 49.389-63.819 49.289Q-63.918 49.190-63.918 49.054Q-63.918 48.873-63.778 48.780Q-63.856 48.753-63.956 48.753Q-64.164 48.753-64.318 48.886Q-64.472 49.019-64.552 49.223Q-64.632 49.426-64.632 49.635L-64.632 50.438L-63.744 50.438L-63.744 50.718L-64.605 50.718L-64.605 52.967Q-64.605 53.176-63.949 53.176L-63.949 53.456M-63.210 52.728Q-63.210 52.396-62.987 52.169Q-62.763 51.942-62.419 51.814Q-62.076 51.685-61.703 51.633Q-61.331 51.580-61.026 51.580L-61.026 51.327Q-61.026 51.122-61.134 50.942Q-61.242 50.763-61.423 50.660Q-61.604 50.558-61.812 50.558Q-62.219 50.558-62.455 50.650Q-62.366 50.687-62.320 50.771Q-62.274 50.855-62.274 50.957Q-62.274 51.053-62.320 51.132Q-62.366 51.210-62.446 51.255Q-62.527 51.299-62.616 51.299Q-62.766 51.299-62.867 51.202Q-62.968 51.104-62.968 50.957Q-62.968 50.335-61.812 50.335Q-61.601 50.335-61.351 50.399Q-61.102 50.462-60.900 50.581Q-60.698 50.701-60.572 50.886Q-60.445 51.070-60.445 51.313L-60.445 52.889Q-60.445 53.005-60.384 53.101Q-60.322 53.196-60.209 53.196Q-60.100 53.196-60.035 53.102Q-59.970 53.008-59.970 52.889L-59.970 52.441L-59.704 52.441L-59.704 52.889Q-59.704 53.159-59.931 53.324Q-60.158 53.490-60.438 53.490Q-60.647 53.490-60.784 53.336Q-60.920 53.183-60.944 52.967Q-61.091 53.234-61.373 53.379Q-61.655 53.524-61.980 53.524Q-62.257 53.524-62.540 53.449Q-62.824 53.374-63.017 53.195Q-63.210 53.015-63.210 52.728M-62.595 52.728Q-62.595 52.902-62.494 53.032Q-62.394 53.162-62.238 53.232Q-62.082 53.302-61.918 53.302Q-61.700 53.302-61.491 53.205Q-61.283 53.107-61.155 52.926Q-61.026 52.745-61.026 52.519L-61.026 51.791Q-61.351 51.791-61.717 51.882Q-62.082 51.973-62.339 52.185Q-62.595 52.396-62.595 52.728M-59.287 53.449L-59.287 52.386Q-59.287 52.362-59.259 52.335Q-59.232 52.308-59.208 52.308L-59.099 52.308Q-59.034 52.308-59.020 52.366Q-58.924 52.800-58.678 53.051Q-58.432 53.302-58.019 53.302Q-57.677 53.302-57.424 53.169Q-57.171 53.036-57.171 52.728Q-57.171 52.571-57.265 52.456Q-57.359 52.342-57.497 52.273Q-57.636 52.205-57.803 52.167L-58.384 52.068Q-58.740 52-59.013 51.779Q-59.287 51.559-59.287 51.217Q-59.287 50.968-59.176 50.793Q-59.064 50.619-58.878 50.520Q-58.692 50.421-58.477 50.378Q-58.261 50.335-58.019 50.335Q-57.605 50.335-57.325 50.517L-57.109 50.342Q-57.099 50.339-57.092 50.337Q-57.085 50.335-57.075 50.335L-57.024 50.335Q-56.997 50.335-56.973 50.359Q-56.949 50.383-56.949 50.411L-56.949 51.258Q-56.949 51.279-56.973 51.306Q-56.997 51.333-57.024 51.333L-57.137 51.333Q-57.164 51.333-57.190 51.308Q-57.215 51.282-57.215 51.258Q-57.215 51.022-57.321 50.858Q-57.427 50.694-57.610 50.612Q-57.793 50.530-58.025 50.530Q-58.353 50.530-58.610 50.633Q-58.866 50.735-58.866 51.012Q-58.866 51.207-58.683 51.316Q-58.500 51.426-58.271 51.467L-57.697 51.573Q-57.451 51.621-57.238 51.749Q-57.024 51.877-56.887 52.080Q-56.750 52.284-56.750 52.533Q-56.750 53.046-57.116 53.285Q-57.482 53.524-58.019 53.524Q-58.514 53.524-58.846 53.230L-59.112 53.504Q-59.133 53.524-59.160 53.524L-59.208 53.524Q-59.232 53.524-59.259 53.497Q-59.287 53.470-59.287 53.449M-55.595 52.615L-55.595 50.718L-56.234 50.718L-56.234 50.496Q-55.916 50.496-55.699 50.286Q-55.482 50.076-55.382 49.766Q-55.281 49.457-55.281 49.149L-55.014 49.149L-55.014 50.438L-53.937 50.438L-53.937 50.718L-55.014 50.718L-55.014 52.602Q-55.014 52.878-54.910 53.077Q-54.806 53.275-54.546 53.275Q-54.389 53.275-54.283 53.171Q-54.177 53.066-54.127 52.913Q-54.078 52.759-54.078 52.602L-54.078 52.188L-53.811 52.188L-53.811 52.615Q-53.811 52.841-53.910 53.051Q-54.009 53.261-54.194 53.393Q-54.378 53.524-54.607 53.524Q-55.045 53.524-55.320 53.287Q-55.595 53.049-55.595 52.615\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(72.389 -43.094)\">\u003Cpath d=\"M-50.335 51.921Q-50.335 51.600-50.210 51.311Q-50.085 51.022-49.859 50.799Q-49.634 50.575-49.338 50.455Q-49.043 50.335-48.725 50.335Q-48.397 50.335-48.135 50.435Q-47.874 50.534-47.698 50.716Q-47.522 50.899-47.428 51.157Q-47.334 51.415-47.334 51.747Q-47.334 51.839-47.416 51.860L-49.671 51.860L-49.671 51.921Q-49.671 52.509-49.388 52.892Q-49.104 53.275-48.537 53.275Q-48.215 53.275-47.947 53.082Q-47.679 52.889-47.590 52.574Q-47.583 52.533-47.508 52.519L-47.416 52.519Q-47.334 52.543-47.334 52.615Q-47.334 52.622-47.340 52.649Q-47.453 53.046-47.824 53.285Q-48.195 53.524-48.619 53.524Q-49.056 53.524-49.456 53.316Q-49.856 53.107-50.095 52.740Q-50.335 52.373-50.335 51.921M-49.665 51.651L-47.850 51.651Q-47.850 51.374-47.947 51.122Q-48.045 50.869-48.243 50.713Q-48.441 50.558-48.725 50.558Q-49.002 50.558-49.215 50.716Q-49.429 50.875-49.547 51.130Q-49.665 51.385-49.665 51.651M-45.064 53.456L-46.698 53.456L-46.698 53.176Q-46.469 53.176-46.320 53.142Q-46.171 53.107-46.171 52.967L-46.171 51.118Q-46.171 50.848-46.279 50.787Q-46.387 50.725-46.698 50.725L-46.698 50.445L-45.638 50.370L-45.638 51.019Q-45.467 50.711-45.163 50.540Q-44.859 50.370-44.514 50.370Q-44.114 50.370-43.837 50.510Q-43.560 50.650-43.475 50.998Q-43.307 50.705-43.008 50.537Q-42.709 50.370-42.364 50.370Q-41.858 50.370-41.574 50.593Q-41.291 50.817-41.291 51.313L-41.291 52.967Q-41.291 53.104-41.142 53.140Q-40.993 53.176-40.768 53.176L-40.768 53.456L-42.398 53.456L-42.398 53.176Q-42.172 53.176-42.022 53.140Q-41.872 53.104-41.872 52.967L-41.872 51.327Q-41.872 50.992-41.991 50.792Q-42.111 50.592-42.425 50.592Q-42.695 50.592-42.930 50.728Q-43.164 50.865-43.302 51.099Q-43.441 51.333-43.441 51.607L-43.441 52.967Q-43.441 53.104-43.292 53.140Q-43.143 53.176-42.918 53.176L-42.918 53.456L-44.548 53.456L-44.548 53.176Q-44.319 53.176-44.170 53.142Q-44.022 53.107-44.022 52.967L-44.022 51.327Q-44.022 50.992-44.141 50.792Q-44.261 50.592-44.575 50.592Q-44.845 50.592-45.079 50.728Q-45.314 50.865-45.452 51.099Q-45.590 51.333-45.590 51.607L-45.590 52.967Q-45.590 53.104-45.440 53.140Q-45.290 53.176-45.064 53.176L-45.064 53.456M-38.563 53.456L-40.115 53.456L-40.115 53.176Q-39.889 53.176-39.741 53.142Q-39.592 53.107-39.592 52.967L-39.592 51.118Q-39.592 50.930-39.640 50.846Q-39.688 50.763-39.785 50.744Q-39.882 50.725-40.094 50.725L-40.094 50.445L-39.038 50.370L-39.038 52.967Q-39.038 53.107-38.907 53.142Q-38.775 53.176-38.563 53.176L-38.563 53.456M-39.835 49.149Q-39.835 48.978-39.712 48.859Q-39.588 48.739-39.418 48.739Q-39.250 48.739-39.127 48.859Q-39.004 48.978-39.004 49.149Q-39.004 49.324-39.127 49.447Q-39.250 49.570-39.418 49.570Q-39.588 49.570-39.712 49.447Q-39.835 49.324-39.835 49.149M-37.391 52.615L-37.391 50.718L-38.030 50.718L-38.030 50.496Q-37.712 50.496-37.495 50.286Q-37.278 50.076-37.177 49.766Q-37.076 49.457-37.076 49.149L-36.810 49.149L-36.810 50.438L-35.733 50.438L-35.733 50.718L-36.810 50.718L-36.810 52.602Q-36.810 52.878-36.705 53.077Q-36.601 53.275-36.341 53.275Q-36.184 53.275-36.078 53.171Q-35.972 53.066-35.923 52.913Q-35.873 52.759-35.873 52.602L-35.873 52.188L-35.607 52.188L-35.607 52.615Q-35.607 52.841-35.706 53.051Q-35.805 53.261-35.989 53.393Q-36.174 53.524-36.403 53.524Q-36.840 53.524-37.116 53.287Q-37.391 53.049-37.391 52.615\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:.8\">\u003Cpath fill=\"none\" d=\"m20.72-34.748 51.58 16.29\"\u002F>\u003Cpath stroke=\"none\" d=\"m74.78-17.676-3.34-3.236.86 2.453-2.113 1.514\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(99.976 -85.985)\">\u003Cpath d=\"M-65.747 51.945Q-65.747 51.617-65.612 51.316Q-65.477 51.016-65.241 50.795Q-65.005 50.575-64.701 50.455Q-64.396 50.335-64.072 50.335Q-63.566 50.335-63.217 50.438Q-62.869 50.540-62.869 50.916Q-62.869 51.063-62.966 51.164Q-63.063 51.265-63.210 51.265Q-63.364 51.265-63.463 51.166Q-63.562 51.067-63.562 50.916Q-63.562 50.728-63.422 50.636Q-63.624 50.585-64.065 50.585Q-64.420 50.585-64.649 50.781Q-64.878 50.978-64.979 51.287Q-65.080 51.597-65.080 51.945Q-65.080 52.294-64.954 52.600Q-64.827 52.906-64.572 53.090Q-64.318 53.275-63.962 53.275Q-63.740 53.275-63.556 53.191Q-63.371 53.107-63.236 52.952Q-63.101 52.796-63.043 52.588Q-63.029 52.533-62.975 52.533L-62.862 52.533Q-62.831 52.533-62.809 52.557Q-62.787 52.581-62.787 52.615L-62.787 52.636Q-62.872 52.923-63.060 53.121Q-63.248 53.319-63.513 53.422Q-63.778 53.524-64.072 53.524Q-64.502 53.524-64.890 53.318Q-65.278 53.111-65.512 52.748Q-65.747 52.386-65.747 51.945M-60.449 53.456L-62.185 53.456L-62.185 53.176Q-61.956 53.176-61.807 53.142Q-61.659 53.107-61.659 52.967L-61.659 51.118Q-61.659 50.848-61.766 50.787Q-61.874 50.725-62.185 50.725L-62.185 50.445L-61.156 50.370L-61.156 51.077Q-61.026 50.769-60.784 50.570Q-60.541 50.370-60.223 50.370Q-60.004 50.370-59.833 50.494Q-59.663 50.619-59.663 50.831Q-59.663 50.968-59.762 51.067Q-59.861 51.166-59.994 51.166Q-60.131 51.166-60.230 51.067Q-60.329 50.968-60.329 50.831Q-60.329 50.691-60.230 50.592Q-60.520 50.592-60.720 50.788Q-60.920 50.985-61.013 51.279Q-61.105 51.573-61.105 51.853L-61.105 52.967Q-61.105 53.176-60.449 53.176L-60.449 53.456M-59.119 51.973Q-59.119 51.631-58.984 51.332Q-58.849 51.033-58.610 50.809Q-58.371 50.585-58.053 50.460Q-57.735 50.335-57.403 50.335Q-56.959 50.335-56.559 50.551Q-56.159 50.766-55.925 51.144Q-55.691 51.521-55.691 51.973Q-55.691 52.314-55.833 52.598Q-55.975 52.882-56.219 53.089Q-56.463 53.295-56.773 53.410Q-57.082 53.524-57.403 53.524Q-57.834 53.524-58.236 53.323Q-58.637 53.121-58.878 52.769Q-59.119 52.417-59.119 51.973M-57.403 53.275Q-56.802 53.275-56.578 52.897Q-56.354 52.519-56.354 51.887Q-56.354 51.275-56.588 50.916Q-56.822 50.558-57.403 50.558Q-58.456 50.558-58.456 51.887Q-58.456 52.519-58.230 52.897Q-58.005 53.275-57.403 53.275M-55.096 53.449L-55.096 52.386Q-55.096 52.362-55.069 52.335Q-55.041 52.308-55.018 52.308L-54.908 52.308Q-54.843 52.308-54.830 52.366Q-54.734 52.800-54.488 53.051Q-54.242 53.302-53.828 53.302Q-53.486 53.302-53.233 53.169Q-52.980 53.036-52.980 52.728Q-52.980 52.571-53.074 52.456Q-53.168 52.342-53.307 52.273Q-53.445 52.205-53.613 52.167L-54.194 52.068Q-54.549 52-54.823 51.779Q-55.096 51.559-55.096 51.217Q-55.096 50.968-54.985 50.793Q-54.874 50.619-54.688 50.520Q-54.501 50.421-54.286 50.378Q-54.071 50.335-53.828 50.335Q-53.415 50.335-53.134 50.517L-52.919 50.342Q-52.909 50.339-52.902 50.337Q-52.895 50.335-52.885 50.335L-52.833 50.335Q-52.806 50.335-52.782 50.359Q-52.758 50.383-52.758 50.411L-52.758 51.258Q-52.758 51.279-52.782 51.306Q-52.806 51.333-52.833 51.333L-52.946 51.333Q-52.974 51.333-52.999 51.308Q-53.025 51.282-53.025 51.258Q-53.025 51.022-53.131 50.858Q-53.237 50.694-53.420 50.612Q-53.603 50.530-53.835 50.530Q-54.163 50.530-54.419 50.633Q-54.676 50.735-54.676 51.012Q-54.676 51.207-54.493 51.316Q-54.310 51.426-54.081 51.467L-53.507 51.573Q-53.261 51.621-53.047 51.749Q-52.833 51.877-52.697 52.080Q-52.560 52.284-52.560 52.533Q-52.560 53.046-52.926 53.285Q-53.291 53.524-53.828 53.524Q-54.324 53.524-54.655 53.230L-54.922 53.504Q-54.942 53.524-54.970 53.524L-55.018 53.524Q-55.041 53.524-55.069 53.497Q-55.096 53.470-55.096 53.449M-51.931 53.449L-51.931 52.386Q-51.931 52.362-51.904 52.335Q-51.876 52.308-51.853 52.308L-51.743 52.308Q-51.678 52.308-51.665 52.366Q-51.569 52.800-51.323 53.051Q-51.077 53.302-50.663 53.302Q-50.321 53.302-50.068 53.169Q-49.815 53.036-49.815 52.728Q-49.815 52.571-49.909 52.456Q-50.003 52.342-50.142 52.273Q-50.280 52.205-50.448 52.167L-51.029 52.068Q-51.384 52-51.658 51.779Q-51.931 51.559-51.931 51.217Q-51.931 50.968-51.820 50.793Q-51.709 50.619-51.523 50.520Q-51.336 50.421-51.121 50.378Q-50.906 50.335-50.663 50.335Q-50.249 50.335-49.969 50.517L-49.754 50.342Q-49.744 50.339-49.737 50.337Q-49.730 50.335-49.720 50.335L-49.668 50.335Q-49.641 50.335-49.617 50.359Q-49.593 50.383-49.593 50.411L-49.593 51.258Q-49.593 51.279-49.617 51.306Q-49.641 51.333-49.668 51.333L-49.781 51.333Q-49.809 51.333-49.834 51.308Q-49.860 51.282-49.860 51.258Q-49.860 51.022-49.966 50.858Q-50.072 50.694-50.255 50.612Q-50.437 50.530-50.670 50.530Q-50.998 50.530-51.254 50.633Q-51.511 50.735-51.511 51.012Q-51.511 51.207-51.328 51.316Q-51.145 51.426-50.916 51.467L-50.342 51.573Q-50.096 51.621-49.882 51.749Q-49.668 51.877-49.532 52.080Q-49.395 52.284-49.395 52.533Q-49.395 53.046-49.761 53.285Q-50.126 53.524-50.663 53.524Q-51.159 53.524-51.490 53.230L-51.757 53.504Q-51.777 53.524-51.805 53.524L-51.853 53.524Q-51.876 53.524-51.904 53.497Q-51.931 53.470-51.931 53.449M-47.149 53.456L-48.701 53.456L-48.701 53.176Q-48.476 53.176-48.327 53.142Q-48.178 53.107-48.178 52.967L-48.178 51.118Q-48.178 50.930-48.226 50.846Q-48.274 50.763-48.371 50.744Q-48.469 50.725-48.681 50.725L-48.681 50.445L-47.624 50.370L-47.624 52.967Q-47.624 53.107-47.493 53.142Q-47.361 53.176-47.149 53.176L-47.149 53.456M-48.421 49.149Q-48.421 48.978-48.298 48.859Q-48.175 48.739-48.004 48.739Q-47.836 48.739-47.713 48.859Q-47.590 48.978-47.590 49.149Q-47.590 49.324-47.713 49.447Q-47.836 49.570-48.004 49.570Q-48.175 49.570-48.298 49.447Q-48.421 49.324-48.421 49.149M-44.822 53.456L-46.456 53.456L-46.456 53.176Q-46.227 53.176-46.078 53.142Q-45.929 53.107-45.929 52.967L-45.929 51.118Q-45.929 50.848-46.037 50.787Q-46.144 50.725-46.456 50.725L-46.456 50.445L-45.396 50.370L-45.396 51.019Q-45.225 50.711-44.921 50.540Q-44.617 50.370-44.271 50.370Q-43.766 50.370-43.482 50.593Q-43.198 50.817-43.198 51.313L-43.198 52.967Q-43.198 53.104-43.050 53.140Q-42.901 53.176-42.675 53.176L-42.675 53.456L-44.306 53.456L-44.306 53.176Q-44.077 53.176-43.928 53.142Q-43.779 53.107-43.779 52.967L-43.779 51.327Q-43.779 50.992-43.899 50.792Q-44.019 50.592-44.333 50.592Q-44.603 50.592-44.837 50.728Q-45.071 50.865-45.210 51.099Q-45.348 51.333-45.348 51.607L-45.348 52.967Q-45.348 53.104-45.198 53.140Q-45.047 53.176-44.822 53.176L-44.822 53.456M-42.128 53.989Q-42.128 53.743-41.932 53.559Q-41.735 53.374-41.479 53.295Q-41.616 53.183-41.687 53.022Q-41.759 52.861-41.759 52.680Q-41.759 52.359-41.547 52.113Q-41.882 51.815-41.882 51.405Q-41.882 50.944-41.493 50.657Q-41.103 50.370-40.624 50.370Q-40.153 50.370-39.818 50.616Q-39.644 50.462-39.433 50.380Q-39.223 50.298-38.994 50.298Q-38.830 50.298-38.709 50.405Q-38.587 50.513-38.587 50.677Q-38.587 50.773-38.659 50.845Q-38.731 50.916-38.823 50.916Q-38.922 50.916-38.992 50.843Q-39.062 50.769-39.062 50.670Q-39.062 50.616-39.049 50.585L-39.042 50.571Q-39.035 50.551-39.027 50.540Q-39.018 50.530-39.015 50.523Q-39.370 50.523-39.657 50.746Q-39.370 51.039-39.370 51.405Q-39.370 51.720-39.555 51.952Q-39.739 52.185-40.028 52.313Q-40.317 52.441-40.624 52.441Q-40.826 52.441-41.018 52.391Q-41.209 52.342-41.387 52.232Q-41.479 52.359-41.479 52.502Q-41.479 52.684-41.351 52.819Q-41.223 52.954-41.038 52.954L-40.406 52.954Q-39.958 52.954-39.589 53.025Q-39.220 53.097-38.960 53.326Q-38.700 53.555-38.700 53.989Q-38.700 54.310-38.996 54.512Q-39.291 54.714-39.695 54.803Q-40.098 54.892-40.413 54.892Q-40.730 54.892-41.134 54.803Q-41.537 54.714-41.833 54.512Q-42.128 54.310-42.128 53.989M-41.674 53.989Q-41.674 54.218-41.455 54.367Q-41.236 54.516-40.944 54.584Q-40.652 54.652-40.413 54.652Q-40.249 54.652-40.040 54.616Q-39.832 54.581-39.625 54.500Q-39.418 54.420-39.286 54.292Q-39.155 54.164-39.155 53.989Q-39.155 53.637-39.536 53.543Q-39.917 53.449-40.419 53.449L-41.038 53.449Q-41.277 53.449-41.476 53.600Q-41.674 53.750-41.674 53.989M-40.624 52.202Q-39.958 52.202-39.958 51.405Q-39.958 50.605-40.624 50.605Q-41.294 50.605-41.294 51.405Q-41.294 52.202-40.624 52.202\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M104.655-13.408v62.241\"\u002F>\u003Cpath stroke=\"none\" d=\"m104.655 52.033 2.56-5.12-2.56 1.92-2.56-1.92\"\u002F>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr7\" font-size=\"7\">\u003Cg transform=\"translate(175.672 -31.713)\">\u003Cpath d=\"M-65.747 53.449L-65.747 52.386Q-65.747 52.362-65.719 52.335Q-65.692 52.308-65.668 52.308L-65.559 52.308Q-65.494 52.308-65.480 52.366Q-65.384 52.800-65.138 53.051Q-64.892 53.302-64.478 53.302Q-64.137 53.302-63.884 53.169Q-63.631 53.036-63.631 52.728Q-63.631 52.571-63.725 52.456Q-63.819 52.342-63.957 52.273Q-64.096 52.205-64.263 52.167L-64.844 52.068Q-65.200 52-65.473 51.779Q-65.747 51.559-65.747 51.217Q-65.747 50.968-65.635 50.793Q-65.524 50.619-65.338 50.520Q-65.152 50.421-64.936 50.378Q-64.721 50.335-64.478 50.335Q-64.065 50.335-63.785 50.517L-63.569 50.342Q-63.559 50.339-63.552 50.337Q-63.545 50.335-63.535 50.335L-63.484 50.335Q-63.457 50.335-63.433 50.359Q-63.409 50.383-63.409 50.411L-63.409 51.258Q-63.409 51.279-63.433 51.306Q-63.457 51.333-63.484 51.333L-63.597 51.333Q-63.624 51.333-63.650 51.308Q-63.675 51.282-63.675 51.258Q-63.675 51.022-63.781 50.858Q-63.887 50.694-64.070 50.612Q-64.253 50.530-64.485 50.530Q-64.813 50.530-65.070 50.633Q-65.326 50.735-65.326 51.012Q-65.326 51.207-65.143 51.316Q-64.960 51.426-64.731 51.467L-64.157 51.573Q-63.911 51.621-63.697 51.749Q-63.484 51.877-63.347 52.080Q-63.210 52.284-63.210 52.533Q-63.210 53.046-63.576 53.285Q-63.942 53.524-64.478 53.524Q-64.974 53.524-65.306 53.230L-65.572 53.504Q-65.593 53.524-65.620 53.524L-65.668 53.524Q-65.692 53.524-65.719 53.497Q-65.747 53.470-65.747 53.449M-60.914 53.456L-62.517 53.456L-62.517 53.176Q-62.291 53.176-62.142 53.142Q-61.994 53.107-61.994 52.967L-61.994 49.348Q-61.994 49.078-62.101 49.016Q-62.209 48.955-62.517 48.955L-62.517 48.674L-61.440 48.599L-61.440 52.967Q-61.440 53.104-61.290 53.140Q-61.139 53.176-60.914 53.176L-60.914 53.456M-60.360 51.973Q-60.360 51.631-60.225 51.332Q-60.090 51.033-59.851 50.809Q-59.611 50.585-59.293 50.460Q-58.976 50.335-58.644 50.335Q-58.200 50.335-57.800 50.551Q-57.400 50.766-57.166 51.144Q-56.932 51.521-56.932 51.973Q-56.932 52.314-57.073 52.598Q-57.215 52.882-57.460 53.089Q-57.704 53.295-58.013 53.410Q-58.323 53.524-58.644 53.524Q-59.075 53.524-59.476 53.323Q-59.878 53.121-60.119 52.769Q-60.360 52.417-60.360 51.973M-58.644 53.275Q-58.042 53.275-57.819 52.897Q-57.595 52.519-57.595 51.887Q-57.595 51.275-57.829 50.916Q-58.063 50.558-58.644 50.558Q-59.697 50.558-59.697 51.887Q-59.697 52.519-59.471 52.897Q-59.246 53.275-58.644 53.275\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(175.672 -31.713)\">\u003Cpath d=\"M-55.156 53.429L-56.137 50.930Q-56.198 50.787-56.316 50.752Q-56.434 50.718-56.650 50.718L-56.650 50.438L-55.170 50.438L-55.170 50.718Q-55.549 50.718-55.549 50.879Q-55.549 50.889-55.535 50.930L-54.821 52.762L-54.148 51.057Q-54.178 50.985-54.178 50.957Q-54.178 50.930-54.206 50.930Q-54.267 50.783-54.385 50.751Q-54.503 50.718-54.715 50.718L-54.715 50.438L-53.317 50.438L-53.317 50.718Q-53.693 50.718-53.693 50.879Q-53.693 50.910-53.686 50.930L-52.931 52.868L-52.244 51.118Q-52.223 51.067-52.223 51.012Q-52.223 50.872-52.336 50.795Q-52.449 50.718-52.589 50.718L-52.589 50.438L-51.369 50.438L-51.369 50.718Q-51.574 50.718-51.729 50.824Q-51.885 50.930-51.957 51.118L-52.862 53.429Q-52.897 53.524-53.009 53.524L-53.078 53.524Q-53.187 53.524-53.225 53.429L-54.007 51.426L-54.794 53.429Q-54.828 53.524-54.941 53.524L-55.009 53.524Q-55.118 53.524-55.156 53.429\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(175.672 -31.713)\">\u003Cpath d=\"M-48.182 51.921Q-48.182 51.600-48.057 51.311Q-47.932 51.022-47.706 50.799Q-47.481 50.575-47.185 50.455Q-46.890 50.335-46.572 50.335Q-46.244 50.335-45.982 50.435Q-45.721 50.534-45.545 50.716Q-45.369 50.899-45.275 51.157Q-45.181 51.415-45.181 51.747Q-45.181 51.839-45.263 51.860L-47.518 51.860L-47.518 51.921Q-47.518 52.509-47.235 52.892Q-46.951 53.275-46.384 53.275Q-46.062 53.275-45.794 53.082Q-45.526 52.889-45.437 52.574Q-45.430 52.533-45.355 52.519L-45.263 52.519Q-45.181 52.543-45.181 52.615Q-45.181 52.622-45.187 52.649Q-45.300 53.046-45.671 53.285Q-46.042 53.524-46.466 53.524Q-46.903 53.524-47.303 53.316Q-47.703 53.107-47.942 52.740Q-48.182 52.373-48.182 51.921M-47.512 51.651L-45.697 51.651Q-45.697 51.374-45.794 51.122Q-45.892 50.869-46.090 50.713Q-46.288 50.558-46.572 50.558Q-46.849 50.558-47.062 50.716Q-47.276 50.875-47.394 51.130Q-47.512 51.385-47.512 51.651M-42.911 53.456L-44.545 53.456L-44.545 53.176Q-44.316 53.176-44.167 53.142Q-44.018 53.107-44.018 52.967L-44.018 51.118Q-44.018 50.848-44.126 50.787Q-44.234 50.725-44.545 50.725L-44.545 50.445L-43.485 50.370L-43.485 51.019Q-43.314 50.711-43.010 50.540Q-42.706 50.370-42.361 50.370Q-41.961 50.370-41.684 50.510Q-41.407 50.650-41.322 50.998Q-41.154 50.705-40.855 50.537Q-40.556 50.370-40.211 50.370Q-39.705 50.370-39.421 50.593Q-39.138 50.817-39.138 51.313L-39.138 52.967Q-39.138 53.104-38.989 53.140Q-38.840 53.176-38.615 53.176L-38.615 53.456L-40.245 53.456L-40.245 53.176Q-40.019 53.176-39.869 53.140Q-39.719 53.104-39.719 52.967L-39.719 51.327Q-39.719 50.992-39.838 50.792Q-39.958 50.592-40.272 50.592Q-40.542 50.592-40.777 50.728Q-41.011 50.865-41.149 51.099Q-41.288 51.333-41.288 51.607L-41.288 52.967Q-41.288 53.104-41.139 53.140Q-40.990 53.176-40.765 53.176L-40.765 53.456L-42.395 53.456L-42.395 53.176Q-42.166 53.176-42.017 53.142Q-41.869 53.107-41.869 52.967L-41.869 51.327Q-41.869 50.992-41.988 50.792Q-42.108 50.592-42.422 50.592Q-42.692 50.592-42.926 50.728Q-43.161 50.865-43.299 51.099Q-43.437 51.333-43.437 51.607L-43.437 52.967Q-43.437 53.104-43.287 53.140Q-43.137 53.176-42.911 53.176L-42.911 53.456M-36.410 53.456L-37.962 53.456L-37.962 53.176Q-37.736 53.176-37.588 53.142Q-37.439 53.107-37.439 52.967L-37.439 51.118Q-37.439 50.930-37.487 50.846Q-37.535 50.763-37.632 50.744Q-37.729 50.725-37.941 50.725L-37.941 50.445L-36.885 50.370L-36.885 52.967Q-36.885 53.107-36.754 53.142Q-36.622 53.176-36.410 53.176L-36.410 53.456M-37.682 49.149Q-37.682 48.978-37.559 48.859Q-37.435 48.739-37.265 48.739Q-37.097 48.739-36.974 48.859Q-36.851 48.978-36.851 49.149Q-36.851 49.324-36.974 49.447Q-37.097 49.570-37.265 49.570Q-37.435 49.570-37.559 49.447Q-37.682 49.324-37.682 49.149M-35.238 52.615L-35.238 50.718L-35.877 50.718L-35.877 50.496Q-35.559 50.496-35.342 50.286Q-35.125 50.076-35.024 49.766Q-34.923 49.457-34.923 49.149L-34.657 49.149L-34.657 50.438L-33.580 50.438L-33.580 50.718L-34.657 50.718L-34.657 52.602Q-34.657 52.878-34.552 53.077Q-34.448 53.275-34.188 53.275Q-34.031 53.275-33.925 53.171Q-33.819 53.066-33.770 52.913Q-33.720 52.759-33.720 52.602L-33.720 52.188L-33.454 52.188L-33.454 52.615Q-33.454 52.841-33.553 53.051Q-33.652 53.261-33.836 53.393Q-34.021 53.524-34.250 53.524Q-34.687 53.524-34.963 53.287Q-35.238 53.049-35.238 52.615\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.210\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M76.203 53.456h62.596\" style=\"stroke-width:.8\"\u002F>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Jablonski diagram: absorption to a singlet, fast nonradiative relaxation to the lowest excited singlet, then either spin-allowed fluorescence back to the ground state or intersystem crossing to a triplet followed by slow phosphorescence.\u003C\u002Ffigcaption>",1786059623404]