[{"data":1,"prerenderedAt":8068},["ShallowReactive",2],{"lesson:\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":3,"course-wordcounts":2306,"ref-card-index":3218,"nav:astrophysics-cosmology":7902,"tikz:587893f29fce811aec16492ae6900f2d9e5e1ab4cbab1f4bf6b0874b1157676d":8063,"tikz:8bffb839a2ce27b78fa787ce3b586dfc991807fcded89acdf66289abd36f43fb":8064,"tikz:a91a40d45d06ea1c04bd4fe6bd668325013c0521f4b96b484e9080d339e05c51":8065,"tikz:f9a3aeccc68716187fe17436a4d281c48511d4603e78e6dc06c27b28fc185daf":8066,"tikz:e590e00322c0257cd64e4455545a5057713fa6b7bd46bc638fe55753fe330e53":8067},{"id":4,"title":5,"blurb":6,"body":7,"brief":2274,"category":2275,"description":2276,"draft":2277,"extension":2278,"meta":2279,"module":2283,"navigation":2284,"path":2285,"practice":2286,"rawbody":2287,"readingTime":2288,"seo":2293,"sources":2294,"status":2301,"stem":2302,"summary":2303,"topics":2304,"__hash__":2305},"course\u002F10.astrophysics-cosmology\u002F07.stellar-evolution\u002F04.stellar-pulsation-and-the-instability-strip.md","Stellar Pulsation and the Instability Strip","",{"type":8,"value":9,"toc":2265},"minimark",[10,25,30,177,555,870,1300,1430,1433,1437,1441,1525,1724,1727,1731,1738,1741,1744,1906,1910,1913,1916,1920,1927,2179,2226,2229,2241],[11,12,13,14],"p",{},"Some stars vary in brightness because they pulsate: the whole star expands and\ncontracts, brightening as it heats and dims as it cools. The oscillation is a\nstanding sound wave, its period fixed by the mean density, and it is sustained\nagainst dissipation by an opacity valve in a partial-ionization layer of the\nenvelope. Only stars occupying a narrow, nearly vertical strip of the\nHertzsprung–Russell diagram pulsate this way, and their period–luminosity relation\nmakes them the measuring rods of extragalactic distance.",[15,16,17],"sup",{},[18,19,24],"a",{"href":20,"ariaDescribedBy":21,"dataFootnoteRef":6,"id":23},"#user-content-fn-co-puls",[22],"footnote-label","user-content-fnref-co-puls","1",[26,27,29],"h2",{"id":28},"the-periodmean-density-relation","The period–mean-density relation",[11,31,32,33,112,113,176],{},"A radial pulsation is a standing acoustic wave in the star. Its period is the time a\nsound wave takes to cross the star and return, so it depends on the sound speed and\nthe radius. Model the star crudely as a sphere of uniform density ",[34,35,38],"span",{"className":36},[37],"katex",[34,39,43],{"className":40,"ariaHidden":42},[41],"katex-html","true",[34,44,47,52],{"className":45},[46],"base",[34,48],{"className":49,"style":51},[50],"strut","height:0.7622em;vertical-align:-0.1944em;",[34,53,57],{"className":54},[55,56],"mord","accent",[34,58,62,103],{"className":59},[60,61],"vlist-t","vlist-t2",[34,63,66,98],{"className":64},[65],"vlist-r",[34,67,71,84],{"className":68,"style":70},[69],"vlist","height:0.5678em;",[34,72,74,79],{"style":73},"top:-3em;",[34,75],{"className":76,"style":78},[77],"pstrut","height:3em;",[34,80,83],{"className":81},[55,82],"mathnormal","ρ",[34,85,86,89],{"style":73},[34,87],{"className":88,"style":78},[77],[34,90,94],{"className":91,"style":93},[92],"accent-body","left:-0.1667em;",[34,95,97],{"className":96},[55],"ˉ",[34,99,102],{"className":100},[101],"vlist-s","​",[34,104,106],{"className":105},[65],[34,107,110],{"className":108,"style":109},[69],"height:0.1944em;",[34,111],{},"\noscillating adiabatically. A displaced shell feels a restoring pressure whose\nadiabatic response is set by the first adiabatic exponent ",[34,114,116],{"className":115},[37],[34,117,119],{"className":118,"ariaHidden":42},[41],[34,120,122,126],{"className":121},[46],[34,123],{"className":124,"style":125},[50],"height:0.8333em;vertical-align:-0.15em;",[34,127,129,133],{"className":128},[55],[34,130,132],{"className":131},[55],"Γ",[34,134,137],{"className":135},[136],"msupsub",[34,138,140,167],{"className":139},[60,61],[34,141,143,164],{"className":142},[65],[34,144,147],{"className":145,"style":146},[69],"height:0.3011em;",[34,148,150,154],{"style":149},"top:-2.55em;margin-left:0em;margin-right:0.05em;",[34,151],{"className":152,"style":153},[77],"height:2.7em;",[34,155,161],{"className":156},[157,158,159,160],"sizing","reset-size6","size3","mtight",[34,162,24],{"className":163},[55,160],[34,165,102],{"className":166},[101],[34,168,170],{"className":169},[65],[34,171,174],{"className":172,"style":173},[69],"height:0.15em;",[34,175],{},", and the\nlinearized equation of motion has the fundamental period",[34,178,181],{"className":179},[180],"katex-display",[34,182,184],{"className":183},[37],[34,185,187,211],{"className":186,"ariaHidden":42},[41],[34,188,190,194,198,203,208],{"className":189},[46],[34,191],{"className":192,"style":193},[50],"height:0.6833em;",[34,195,197],{"className":196},[55],"Π",[34,199],{"className":200,"style":202},[201],"mspace","margin-right:0.2778em;",[34,204,207],{"className":205},[206],"mrel","=",[34,209],{"className":210,"style":202},[201],[34,212,214,218,551],{"className":213},[46],[34,215],{"className":216,"style":217},[50],"height:3.0514em;vertical-align:-1.73em;",[34,219,221,226,548],{"className":220},[55],[34,222],{"className":223},[224,225],"mopen","nulldelimiter",[34,227,230],{"className":228},[229],"mfrac",[34,231,233,539],{"className":232},[60,61],[34,234,236,536],{"className":235},[65],[34,237,240,511,520],{"className":238,"style":239},[69],"height:1.3214em;",[34,241,243,247],{"style":242},"top:-2.11em;",[34,244],{"className":245,"style":246},[77],"height:3.2351em;",[34,248,250],{"className":249},[55],[34,251,254],{"className":252},[55,253],"sqrt",[34,255,257,502],{"className":256},[60,61],[34,258,260,499],{"className":259},[65],[34,261,264,476],{"className":262,"style":263},[69],"height:1.2351em;",[34,265,269,273],{"className":266,"style":268},[267],"svg-align","top:-3.8em;",[34,270],{"className":271,"style":272},[77],"height:3.8em;",[34,274,277,355,360,364,406,410,414,417,457,461,466,469,472],{"className":275,"style":276},[55],"padding-left:1em;",[34,278,280,283,351],{"className":279},[55],[34,281],{"className":282},[224,225],[34,284,286],{"className":285},[229],[34,287,289,342],{"className":288},[60,61],[34,290,292,339],{"className":291},[65],[34,293,296,312,323],{"className":294,"style":295},[69],"height:0.8451em;",[34,297,299,302],{"style":298},"top:-2.655em;",[34,300],{"className":301,"style":78},[77],[34,303,305],{"className":304},[157,158,159,160],[34,306,308],{"className":307},[55,160],[34,309,311],{"className":310},[55,160],"3",[34,313,315,318],{"style":314},"top:-3.23em;",[34,316],{"className":317,"style":78},[77],[34,319],{"className":320,"style":322},[321],"frac-line","border-bottom-width:0.04em;",[34,324,326,329],{"style":325},"top:-3.394em;",[34,327],{"className":328,"style":78},[77],[34,330,332],{"className":331},[157,158,159,160],[34,333,335],{"className":334},[55,160],[34,336,338],{"className":337},[55,160],"4",[34,340,102],{"className":341},[101],[34,343,345],{"className":344},[65],[34,346,349],{"className":347,"style":348},[69],"height:0.345em;",[34,350],{},[34,352],{"className":353},[354,225],"mclose",[34,356,359],{"className":357,"style":358},[55,82],"margin-right:0.0359em;","π",[34,361,363],{"className":362},[55,82],"G",[34,365,367],{"className":366},[55,56],[34,368,370,398],{"className":369},[60,61],[34,371,373,395],{"className":372},[65],[34,374,376,384],{"className":375,"style":70},[69],[34,377,378,381],{"style":73},[34,379],{"className":380,"style":78},[77],[34,382,83],{"className":383},[55,82],[34,385,386,389],{"style":73},[34,387],{"className":388,"style":78},[77],[34,390,392],{"className":391,"style":93},[92],[34,393,97],{"className":394},[55],[34,396,102],{"className":397},[101],[34,399,401],{"className":400},[65],[34,402,404],{"className":403,"style":109},[69],[34,405],{},[34,407],{"className":408,"style":409},[201],"margin-right:0.1667em;",[34,411,413],{"className":412},[224],"(",[34,415,311],{"className":416},[55],[34,418,420,423],{"className":419},[55],[34,421,132],{"className":422},[55],[34,424,426],{"className":425},[136],[34,427,429,449],{"className":428},[60,61],[34,430,432,446],{"className":431},[65],[34,433,435],{"className":434,"style":146},[69],[34,436,437,440],{"style":149},[34,438],{"className":439,"style":153},[77],[34,441,443],{"className":442},[157,158,159,160],[34,444,24],{"className":445},[55,160],[34,447,102],{"className":448},[101],[34,450,452],{"className":451},[65],[34,453,455],{"className":454,"style":173},[69],[34,456],{},[34,458],{"className":459,"style":460},[201],"margin-right:0.2222em;",[34,462,465],{"className":463},[464],"mbin","−",[34,467],{"className":468,"style":460},[201],[34,470,338],{"className":471},[55],[34,473,475],{"className":474},[354],")",[34,477,479,482],{"style":478},"top:-3.1951em;",[34,480],{"className":481,"style":272},[77],[34,483,487],{"className":484,"style":486},[485],"hide-tail","min-width:1.02em;height:1.88em;",[488,489,495],"svg",{"xmlns":490,"width":491,"height":492,"viewBox":493,"preserveAspectRatio":494},"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg","400em","1.88em","0 0 400000 1944","xMinYMin slice",[496,497],"path",{"d":498},"M983 90\nl0 -0\nc4,-6.7,10,-10,18,-10 H400000v40\nH1013.1s-83.4,268,-264.1,840c-180.7,572,-277,876.3,-289,913c-4.7,4.7,-12.7,7,-24,7\ns-12,0,-12,0c-1.3,-3.3,-3.7,-11.7,-7,-25c-35.3,-125.3,-106.7,-373.3,-214,-744\nc-10,12,-21,25,-33,39s-32,39,-32,39c-6,-5.3,-15,-14,-27,-26s25,-30,25,-30\nc26.7,-32.7,52,-63,76,-91s52,-60,52,-60s208,722,208,722\nc56,-175.3,126.3,-397.3,211,-666c84.7,-268.7,153.8,-488.2,207.5,-658.5\nc53.7,-170.3,84.5,-266.8,92.5,-289.5z\nM1001 80h400000v40h-400000z",[34,500,102],{"className":501},[101],[34,503,505],{"className":504},[65],[34,506,509],{"className":507,"style":508},[69],"height:0.6049em;",[34,510],{},[34,512,514,517],{"style":513},"top:-3.4651em;",[34,515],{"className":516,"style":246},[77],[34,518],{"className":519,"style":322},[321],[34,521,523,526],{"style":522},"top:-3.9121em;",[34,524],{"className":525,"style":246},[77],[34,527,529,533],{"className":528},[55],[34,530,532],{"className":531},[55],"2",[34,534,359],{"className":535,"style":358},[55,82],[34,537,102],{"className":538},[101],[34,540,542],{"className":541},[65],[34,543,546],{"className":544,"style":545},[69],"height:1.73em;",[34,547],{},[34,549],{"className":550},[354,225],[34,552,554],{"className":553},[55],".",[11,556,557,558,630,631,723,724,869],{},"For ",[34,559,561],{"className":560},[37],[34,562,564,619],{"className":563,"ariaHidden":42},[41],[34,565,567,570,610,613,616],{"className":566},[46],[34,568],{"className":569,"style":125},[50],[34,571,573,576],{"className":572},[55],[34,574,132],{"className":575},[55],[34,577,579],{"className":578},[136],[34,580,582,602],{"className":581},[60,61],[34,583,585,599],{"className":584},[65],[34,586,588],{"className":587,"style":146},[69],[34,589,590,593],{"style":149},[34,591],{"className":592,"style":153},[77],[34,594,596],{"className":595},[157,158,159,160],[34,597,24],{"className":598},[55,160],[34,600,102],{"className":601},[101],[34,603,605],{"className":604},[65],[34,606,608],{"className":607,"style":173},[69],[34,609],{},[34,611],{"className":612,"style":202},[201],[34,614,207],{"className":615},[206],[34,617],{"className":618,"style":202},[201],[34,620,622,626],{"className":621},[46],[34,623],{"className":624,"style":625},[50],"height:1em;vertical-align:-0.25em;",[34,627,629],{"className":628},[55],"5\u002F3"," the factor ",[34,632,634],{"className":633},[37],[34,635,637,695,714],{"className":636,"ariaHidden":42},[41],[34,638,640,643,646,686,689,692],{"className":639},[46],[34,641],{"className":642,"style":125},[50],[34,644,311],{"className":645},[55],[34,647,649,652],{"className":648},[55],[34,650,132],{"className":651},[55],[34,653,655],{"className":654},[136],[34,656,658,678],{"className":657},[60,61],[34,659,661,675],{"className":660},[65],[34,662,664],{"className":663,"style":146},[69],[34,665,666,669],{"style":149},[34,667],{"className":668,"style":153},[77],[34,670,672],{"className":671},[157,158,159,160],[34,673,24],{"className":674},[55,160],[34,676,102],{"className":677},[101],[34,679,681],{"className":680},[65],[34,682,684],{"className":683,"style":173},[69],[34,685],{},[34,687],{"className":688,"style":460},[201],[34,690,465],{"className":691},[464],[34,693],{"className":694,"style":460},[201],[34,696,698,702,705,708,711],{"className":697},[46],[34,699],{"className":700,"style":701},[50],"height:0.6444em;",[34,703,338],{"className":704},[55],[34,706],{"className":707,"style":202},[201],[34,709,207],{"className":710},[206],[34,712],{"className":713,"style":202},[201],[34,715,717,720],{"className":716},[46],[34,718],{"className":719,"style":701},[50],[34,721,24],{"className":722},[55],", and this reduces to\n",[34,725,727],{"className":726},[37],[34,728,730,748],{"className":729,"ariaHidden":42},[41],[34,731,733,736,739,742,745],{"className":732},[46],[34,734],{"className":735,"style":193},[50],[34,737,197],{"className":738},[55],[34,740],{"className":741,"style":202},[201],[34,743,207],{"className":744},[206],[34,746],{"className":747,"style":202},[201],[34,749,751,755],{"className":750},[46],[34,752],{"className":753,"style":754},[50],"height:1.24em;vertical-align:-0.305em;",[34,756,758],{"className":757},[55,253],[34,759,761,860],{"className":760},[60,61],[34,762,764,857],{"className":763},[65],[34,765,768,840],{"className":766,"style":767},[69],"height:0.935em;",[34,769,772,776],{"className":770,"style":771},[267],"top:-3.2em;",[34,773],{"className":774,"style":775},[77],"height:3.2em;",[34,777,779,782,785,789,792,795,837],{"className":778,"style":276},[55],[34,780,311],{"className":781},[55],[34,783,359],{"className":784,"style":358},[55,82],[34,786,788],{"className":787},[55],"\u002F",[34,790,413],{"className":791},[224],[34,793,363],{"className":794},[55,82],[34,796,798],{"className":797},[55,56],[34,799,801,829],{"className":800},[60,61],[34,802,804,826],{"className":803},[65],[34,805,807,815],{"className":806,"style":70},[69],[34,808,809,812],{"style":73},[34,810],{"className":811,"style":78},[77],[34,813,83],{"className":814},[55,82],[34,816,817,820],{"style":73},[34,818],{"className":819,"style":78},[77],[34,821,823],{"className":822,"style":93},[92],[34,824,97],{"className":825},[55],[34,827,102],{"className":828},[101],[34,830,832],{"className":831},[65],[34,833,835],{"className":834,"style":109},[69],[34,836],{},[34,838,475],{"className":839},[354],[34,841,843,846],{"style":842},"top:-2.895em;",[34,844],{"className":845,"style":775},[77],[34,847,850],{"className":848,"style":849},[485],"min-width:1.02em;height:1.28em;",[488,851,854],{"xmlns":490,"width":491,"height":852,"viewBox":853,"preserveAspectRatio":494},"1.28em","0 0 400000 1296",[496,855],{"d":856},"M263,681c0.7,0,18,39.7,52,119\nc34,79.3,68.167,158.7,102.5,238c34.3,79.3,51.8,119.3,52.5,120\nc340,-704.7,510.7,-1060.3,512,-1067\nl0 -0\nc4.7,-7.3,11,-11,19,-11\nH40000v40H1012.3\ns-271.3,567,-271.3,567c-38.7,80.7,-84,175,-136,283c-52,108,-89.167,185.3,-111.5,232\nc-22.3,46.7,-33.8,70.3,-34.5,71c-4.7,4.7,-12.3,7,-23,7s-12,-1,-12,-1\ns-109,-253,-109,-253c-72.7,-168,-109.3,-252,-110,-252c-10.7,8,-22,16.7,-34,26\nc-22,17.3,-33.3,26,-34,26s-26,-26,-26,-26s76,-59,76,-59s76,-60,76,-60z\nM1001 80h400000v40h-400000z",[34,858,102],{"className":859},[101],[34,861,863],{"className":862},[65],[34,864,867],{"className":865,"style":866},[69],"height:0.305em;",[34,868],{},". The essential content is the scaling",[34,871,873],{"className":872},[180],[34,874,876],{"className":875},[37],[34,877,879,992,1012,1288],{"className":878,"ariaHidden":42},[41],[34,880,882,886,889,983,986,989],{"className":881},[46],[34,883],{"className":884,"style":885},[50],"height:1.04em;vertical-align:-0.2195em;",[34,887,197],{"className":888},[55],[34,890,892],{"className":891},[55,253],[34,893,895,974],{"className":894},[60,61],[34,896,898,971],{"className":897},[65],[34,899,902,954],{"className":900,"style":901},[69],"height:0.8205em;",[34,903,905,908],{"className":904,"style":73},[267],[34,906],{"className":907,"style":78},[77],[34,909,912],{"className":910,"style":911},[55],"padding-left:0.833em;",[34,913,915],{"className":914},[55,56],[34,916,918,946],{"className":917},[60,61],[34,919,921,943],{"className":920},[65],[34,922,924,932],{"className":923,"style":70},[69],[34,925,926,929],{"style":73},[34,927],{"className":928,"style":78},[77],[34,930,83],{"className":931},[55,82],[34,933,934,937],{"style":73},[34,935],{"className":936,"style":78},[77],[34,938,940],{"className":939,"style":93},[92],[34,941,97],{"className":942},[55],[34,944,102],{"className":945},[101],[34,947,949],{"className":948},[65],[34,950,952],{"className":951,"style":109},[69],[34,953],{},[34,955,957,960],{"style":956},"top:-2.7805em;",[34,958],{"className":959,"style":78},[77],[34,961,964],{"className":962,"style":963},[485],"min-width:0.853em;height:1.08em;",[488,965,968],{"xmlns":490,"width":491,"height":966,"viewBox":967,"preserveAspectRatio":494},"1.08em","0 0 400000 1080",[496,969],{"d":970},"M95,702\nc-2.7,0,-7.17,-2.7,-13.5,-8c-5.8,-5.3,-9.5,-10,-9.5,-14\nc0,-2,0.3,-3.3,1,-4c1.3,-2.7,23.83,-20.7,67.5,-54\nc44.2,-33.3,65.8,-50.3,66.5,-51c1.3,-1.3,3,-2,5,-2c4.7,0,8.7,3.3,12,10\ns173,378,173,378c0.7,0,35.3,-71,104,-213c68.7,-142,137.5,-285,206.5,-429\nc69,-144,104.5,-217.7,106.5,-221\nl0 -0\nc5.3,-9.3,12,-14,20,-14\nH400000v40H845.2724\ns-225.272,467,-225.272,467s-235,486,-235,486c-2.7,4.7,-9,7,-19,7\nc-6,0,-10,-1,-12,-3s-194,-422,-194,-422s-65,47,-65,47z\nM834 80h400000v40h-400000z",[34,972,102],{"className":973},[101],[34,975,977],{"className":976},[65],[34,978,981],{"className":979,"style":980},[69],"height:0.2195em;",[34,982],{},[34,984],{"className":985,"style":202},[201],[34,987,207],{"className":988},[206],[34,990],{"className":991,"style":202},[201],[34,993,995,999,1003,1006,1009],{"className":994},[46],[34,996],{"className":997,"style":998},[50],"height:0.8778em;vertical-align:-0.1944em;",[34,1000,1002],{"className":1001},[55,82],"Q",[34,1004],{"className":1005,"style":202},[201],[34,1007,207],{"className":1008},[206],[34,1010],{"className":1011,"style":202},[201],[34,1013,1015,1019,1027,1032,1036,1039,1042,1279,1282,1285],{"className":1014},[46],[34,1016],{"className":1017,"style":1018},[50],"height:2.44em;vertical-align:-0.9309em;",[34,1020,1023],{"className":1021},[55,1022],"text",[34,1024,1026],{"className":1025},[55],"const",[34,1028,1031],{"className":1029},[1030],"mpunct",",",[34,1033],{"className":1034,"style":1035},[201],"margin-right:2em;",[34,1037],{"className":1038,"style":409},[201],[34,1040,197],{"className":1041},[55],[34,1043,1045],{"className":1044},[55,253],[34,1046,1048,1270],{"className":1047},[60,61],[34,1049,1051,1267],{"className":1050},[65],[34,1052,1055,1250],{"className":1053,"style":1054},[69],"height:1.5091em;",[34,1056,1059,1063],{"className":1057,"style":1058},[267],"top:-4.4em;",[34,1060],{"className":1061,"style":1062},[77],"height:4.4em;",[34,1064,1066],{"className":1065,"style":276},[55],[34,1067,1069,1072,1247],{"className":1068},[55],[34,1070],{"className":1071},[224,225],[34,1073,1075],{"className":1074},[229],[34,1076,1078,1238],{"className":1077},[60,61],[34,1079,1081,1235],{"className":1080},[65],[34,1082,1085,1176,1184],{"className":1083,"style":1084},[69],"height:1.2448em;",[34,1086,1088,1091],{"style":1087},"top:-2.314em;",[34,1089],{"className":1090,"style":78},[77],[34,1092,1094],{"className":1093},[55],[34,1095,1097,1139],{"className":1096},[55],[34,1098,1100],{"className":1099},[55,56],[34,1101,1103,1131],{"className":1102},[60,61],[34,1104,1106,1128],{"className":1105},[65],[34,1107,1109,1117],{"className":1108,"style":70},[69],[34,1110,1111,1114],{"style":73},[34,1112],{"className":1113,"style":78},[77],[34,1115,83],{"className":1116},[55,82],[34,1118,1119,1122],{"style":73},[34,1120],{"className":1121,"style":78},[77],[34,1123,1125],{"className":1124,"style":93},[92],[34,1126,97],{"className":1127},[55],[34,1129,102],{"className":1130},[101],[34,1132,1134],{"className":1133},[65],[34,1135,1137],{"className":1136,"style":109},[69],[34,1138],{},[34,1140,1142],{"className":1141},[136],[34,1143,1145,1167],{"className":1144},[60,61],[34,1146,1148,1164],{"className":1147},[65],[34,1149,1152],{"className":1150,"style":1151},[69],"height:0.2583em;",[34,1153,1154,1157],{"style":149},[34,1155],{"className":1156,"style":153},[77],[34,1158,1160],{"className":1159},[157,158,159,160],[34,1161,1163],{"className":1162},[464,160],"⊙",[34,1165,102],{"className":1166},[101],[34,1168,1170],{"className":1169},[65],[34,1171,1174],{"className":1172,"style":1173},[69],"height:0.2083em;",[34,1175],{},[34,1177,1178,1181],{"style":314},[34,1179],{"className":1180,"style":78},[77],[34,1182],{"className":1183,"style":322},[321],[34,1185,1187,1190],{"style":1186},"top:-3.677em;",[34,1188],{"className":1189,"style":78},[77],[34,1191,1193],{"className":1192},[55],[34,1194,1196],{"className":1195},[55,56],[34,1197,1199,1227],{"className":1198},[60,61],[34,1200,1202,1224],{"className":1201},[65],[34,1203,1205,1213],{"className":1204,"style":70},[69],[34,1206,1207,1210],{"style":73},[34,1208],{"className":1209,"style":78},[77],[34,1211,83],{"className":1212},[55,82],[34,1214,1215,1218],{"style":73},[34,1216],{"className":1217,"style":78},[77],[34,1219,1221],{"className":1220,"style":93},[92],[34,1222,97],{"className":1223},[55],[34,1225,102],{"className":1226},[101],[34,1228,1230],{"className":1229},[65],[34,1231,1233],{"className":1232,"style":109},[69],[34,1234],{},[34,1236,102],{"className":1237},[101],[34,1239,1241],{"className":1240},[65],[34,1242,1245],{"className":1243,"style":1244},[69],"height:0.8943em;",[34,1246],{},[34,1248],{"className":1249},[354,225],[34,1251,1253,1256],{"style":1252},"top:-3.4691em;",[34,1254],{"className":1255,"style":1062},[77],[34,1257,1260],{"className":1258,"style":1259},[485],"min-width:1.02em;height:2.48em;",[488,1261,1264],{"xmlns":490,"width":491,"height":1262,"viewBox":1263,"preserveAspectRatio":494},"2.48em","0 0 400000 2592",[496,1265],{"d":1266},"M424,2478\nc-1.3,-0.7,-38.5,-172,-111.5,-514c-73,-342,-109.8,-513.3,-110.5,-514\nc0,-2,-10.7,14.3,-32,49c-4.7,7.3,-9.8,15.7,-15.5,25c-5.7,9.3,-9.8,16,-12.5,20\ns-5,7,-5,7c-4,-3.3,-8.3,-7.7,-13,-13s-13,-13,-13,-13s76,-122,76,-122s77,-121,77,-121\ns209,968,209,968c0,-2,84.7,-361.7,254,-1079c169.3,-717.3,254.7,-1077.7,256,-1081\nl0 -0c4,-6.7,10,-10,18,-10 H400000\nv40H1014.6\ns-87.3,378.7,-272.6,1166c-185.3,787.3,-279.3,1182.3,-282,1185\nc-2,6,-10,9,-24,9\nc-8,0,-12,-0.7,-12,-2z M1001 80\nh400000v40h-400000z",[34,1268,102],{"className":1269},[101],[34,1271,1273],{"className":1272},[65],[34,1274,1277],{"className":1275,"style":1276},[69],"height:0.9309em;",[34,1278],{},[34,1280],{"className":1281,"style":202},[201],[34,1283,207],{"className":1284},[206],[34,1286],{"className":1287,"style":202},[201],[34,1289,1291,1294,1297],{"className":1290},[46],[34,1292],{"className":1293,"style":998},[50],[34,1295,1002],{"className":1296},[55,82],[34,1298,1031],{"className":1299},[1030],[11,1301,1302,1303,1307,1308,1311,1312,1327,1328,1356,1357,1429],{},"the ",[1304,1305,1306],"strong",{},"period–mean-density relation",". The ",[1304,1309,1310],{},"pulsation constant"," ",[34,1313,1315],{"className":1314},[37],[34,1316,1318],{"className":1317,"ariaHidden":42},[41],[34,1319,1321,1324],{"className":1320},[46],[34,1322],{"className":1323,"style":998},[50],[34,1325,1002],{"className":1326},[55,82]," is nearly the\nsame for all stars pulsating in the fundamental mode, about ",[34,1329,1331],{"className":1330},[37],[34,1332,1334],{"className":1333,"ariaHidden":42},[41],[34,1335,1337,1341,1345,1349],{"className":1336},[46],[34,1338],{"className":1339,"style":1340},[50],"height:0.8889em;vertical-align:-0.1944em;",[34,1342,1344],{"className":1343},[55],"0.04",[34,1346,1348],{"className":1347},[201]," ",[34,1350,1352],{"className":1351},[55,1022],[34,1353,1355],{"className":1354},[55],"days"," for\nclassical Cepheids. Denser stars pulsate faster; the tenuous, luminous supergiants\nhave the longest periods. Note the requirement ",[34,1358,1360],{"className":1359},[37],[34,1361,1363,1419],{"className":1362,"ariaHidden":42},[41],[34,1364,1366,1369,1409,1412,1416],{"className":1365},[46],[34,1367],{"className":1368,"style":125},[50],[34,1370,1372,1375],{"className":1371},[55],[34,1373,132],{"className":1374},[55],[34,1376,1378],{"className":1377},[136],[34,1379,1381,1401],{"className":1380},[60,61],[34,1382,1384,1398],{"className":1383},[65],[34,1385,1387],{"className":1386,"style":146},[69],[34,1388,1389,1392],{"style":149},[34,1390],{"className":1391,"style":153},[77],[34,1393,1395],{"className":1394},[157,158,159,160],[34,1396,24],{"className":1397},[55,160],[34,1399,102],{"className":1400},[101],[34,1402,1404],{"className":1403},[65],[34,1405,1407],{"className":1406,"style":173},[69],[34,1408],{},[34,1410],{"className":1411,"style":202},[201],[34,1413,1415],{"className":1414},[206],">",[34,1417],{"className":1418,"style":202},[201],[34,1420,1422,1425],{"className":1421},[46],[34,1423],{"className":1424,"style":625},[50],[34,1426,1428],{"className":1427},[55],"4\u002F3"," for a real period:\nbelow it the restoring force vanishes and the star is dynamically unstable rather\nthan oscillatory.",[11,1431,1432],{},"The fundamental mode has the whole envelope moving in phase, with the center fixed\nand the surface at maximum displacement. Overtones have one or more internal nodes\nwhere the gas stays still while layers on either side move oppositely, and they have\nshorter periods. Most Cepheids pulsate in the fundamental; many RR Lyrae stars\npulsate in an overtone, giving the double-peaked period distribution seen in globular\nclusters.",[1434,1435],"tikz-figure",{"hash":1436},"587893f29fce811aec16492ae6900f2d9e5e1ab4cbab1f4bf6b0874b1157676d",[26,1438,1440],{"id":1439},"the-kappa-mechanism","The kappa mechanism",[11,1442,1443,1444,1524],{},"A pulsation left to itself would damp as sound waves dissipate. To persist, the star\nmust do net work on the oscillation over each cycle, acting as a heat engine that\nabsorbs heat when compressed and releases it when expanded. Ordinary stellar material\ndoes the opposite. Compression raises the temperature, and in the Kramers regime the\nopacity ",[34,1445,1447],{"className":1446},[37],[34,1448,1450,1471],{"className":1449,"ariaHidden":42},[41],[34,1451,1453,1457,1461,1464,1468],{"className":1452},[46],[34,1454],{"className":1455,"style":1456},[50],"height:0.4306em;",[34,1458,1460],{"className":1459},[55,82],"κ",[34,1462],{"className":1463,"style":202},[201],[34,1465,1467],{"className":1466},[206],"∝",[34,1469],{"className":1470,"style":202},[201],[34,1472,1474,1478,1481,1484],{"className":1473},[46],[34,1475],{"className":1476,"style":1477},[50],"height:1.0824em;vertical-align:-0.1944em;",[34,1479,83],{"className":1480},[55,82],[34,1482],{"className":1483,"style":409},[201],[34,1485,1487,1492],{"className":1486},[55],[34,1488,1491],{"className":1489,"style":1490},[55,82],"margin-right:0.1389em;","T",[34,1493,1495],{"className":1494},[136],[34,1496,1498],{"className":1497},[60],[34,1499,1501],{"className":1500},[65],[34,1502,1505],{"className":1503,"style":1504},[69],"height:0.888em;",[34,1506,1508,1511],{"style":1507},"top:-3.063em;margin-right:0.05em;",[34,1509],{"className":1510,"style":153},[77],[34,1512,1514],{"className":1513},[157,158,159,160],[34,1515,1517,1520],{"className":1516},[55,160],[34,1518,465],{"className":1519},[55,160],[34,1521,1523],{"className":1522},[55,160],"7\u002F2"," falls with temperature, so a compressed layer\nbecomes more transparent and lets heat leak out exactly when the engine would need to\nretain it. Across most of a star, pulsations are damped.",[11,1526,1527,1528,1531,1532,1535,1536,1539,1540,1543,1544,1647,1648,554],{},"The exception is a ",[1304,1529,1530],{},"partial-ionization zone",". Where a species is half-ionized,\ncompression does not raise the temperature much, because the energy goes into further\nionization rather than into heating the gas. With the temperature nearly fixed, the\ndensity increase makes the opacity ",[1304,1533,1534],{},"rise"," on compression. The layer dams the\noutward flux while compressed, storing heat, and releases it on expansion. This is the\n",[1304,1537,1538],{},"kappa mechanism"," (aided by the associated ",[1304,1541,1542],{},"gamma mechanism",", the same energy\ndiversion into ionization). The dominant valve in classical pulsators is the second\nhelium ionization zone, ",[34,1545,1547],{"className":1546},[37],[34,1548,1550,1602],{"className":1549,"ariaHidden":42},[41],[34,1551,1553,1557,1592,1595,1599],{"className":1552},[46],[34,1554],{"className":1555,"style":1556},[50],"height:0.8446em;",[34,1558,1560,1567],{"className":1559},[55],[34,1561,1563],{"className":1562},[55,1022],[34,1564,1566],{"className":1565},[55],"He",[34,1568,1570],{"className":1569},[136],[34,1571,1573],{"className":1572},[60],[34,1574,1576],{"className":1575},[65],[34,1577,1579],{"className":1578,"style":1556},[69],[34,1580,1582,1585],{"style":1581},"top:-3.1362em;margin-right:0.05em;",[34,1583],{"className":1584,"style":153},[77],[34,1586,1588],{"className":1587},[157,158,159,160],[34,1589,1591],{"className":1590},[464,160],"+",[34,1593],{"className":1594,"style":202},[201],[34,1596,1598],{"className":1597},[206],"→",[34,1600],{"className":1601,"style":202},[201],[34,1603,1605,1609],{"className":1604},[46],[34,1606],{"className":1607,"style":1608},[50],"height:0.8873em;",[34,1610,1612,1618],{"className":1611},[55],[34,1613,1615],{"className":1614},[55,1022],[34,1616,1566],{"className":1617},[55],[34,1619,1621],{"className":1620},[136],[34,1622,1624],{"className":1623},[60],[34,1625,1627],{"className":1626},[65],[34,1628,1630],{"className":1629,"style":1608},[69],[34,1631,1632,1635],{"style":1581},[34,1633],{"className":1634,"style":153},[77],[34,1636,1638],{"className":1637},[157,158,159,160],[34,1639,1641,1644],{"className":1640},[55,160],[34,1642,532],{"className":1643},[55,160],[34,1645,1591],{"className":1646},[55,160],", near ",[34,1649,1651],{"className":1650},[37],[34,1652,1654,1674],{"className":1653,"ariaHidden":42},[41],[34,1655,1657,1661,1664,1667,1671],{"className":1656},[46],[34,1658],{"className":1659,"style":1660},[50],"height:0.7278em;vertical-align:-0.0833em;",[34,1662,338],{"className":1663},[55],[34,1665],{"className":1666,"style":460},[201],[34,1668,1670],{"className":1669},[464],"×",[34,1672],{"className":1673,"style":460},[201],[34,1675,1677,1681,1684,1714,1717],{"className":1676},[46],[34,1678],{"className":1679,"style":1680},[50],"height:0.8141em;",[34,1682,24],{"className":1683},[55],[34,1685,1687,1691],{"className":1686},[55],[34,1688,1690],{"className":1689},[55],"0",[34,1692,1694],{"className":1693},[136],[34,1695,1697],{"className":1696},[60],[34,1698,1700],{"className":1699},[65],[34,1701,1703],{"className":1702,"style":1680},[69],[34,1704,1705,1708],{"style":1507},[34,1706],{"className":1707,"style":153},[77],[34,1709,1711],{"className":1710},[157,158,159,160],[34,1712,338],{"className":1713},[55,160],[34,1715,1348],{"className":1716},[201],[34,1718,1720],{"className":1719},[55,1022],[34,1721,1723],{"className":1722},[55],"K",[1434,1725],{"hash":1726},"8bffb839a2ce27b78fa787ce3b586dfc991807fcded89acdf66289abd36f43fb",[26,1728,1730],{"id":1729},"the-instability-strip","The instability strip",[11,1732,1733,1734,1737],{},"The kappa mechanism drives a star only when the helium ionization zone sits at the\nright depth. Too hot, and the zone lies too near the surface, where it contains too\nlittle mass to store significant heat, so the driving is feeble. Too cool, and the\nouter envelope becomes convective; convection carries the energy and short-circuits\nthe valve, quenching the pulsation. Between these limits the zone lies at a depth\nwhere its heat capacity is large and radiation still controls the flux, and the star\npulsates. The favorable range is nearly independent of luminosity, so it defines an\nalmost vertical band in the H-R diagram, the ",[1304,1735,1736],{},"instability strip",", tilted slightly\nbecause the cool edge depends weakly on luminosity.",[1434,1739],{"hash":1740},"a91a40d45d06ea1c04bd4fe6bd668325013c0521f4b96b484e9080d339e05c51",[11,1742,1743],{},"The strip is populated by different stars at different luminosities:",[1745,1746,1747,1834,1900],"ul",{},[1748,1749,1750,1753,1754,1769,1770,1833],"li",{},[1304,1751,1752],{},"Classical Cepheids"," at the luminous top, massive stars (",[34,1755,1757],{"className":1756},[37],[34,1758,1760],{"className":1759,"ariaHidden":42},[41],[34,1761,1763,1766],{"className":1762},[46],[34,1764],{"className":1765,"style":701},[50],[34,1767,311],{"className":1768},[55],"–",[34,1771,1773],{"className":1772},[37],[34,1774,1776],{"className":1775,"ariaHidden":42},[41],[34,1777,1779,1783,1787,1790],{"className":1778},[46],[34,1780],{"className":1781,"style":1782},[50],"height:0.8917em;vertical-align:-0.2083em;",[34,1784,1786],{"className":1785},[55],"20",[34,1788],{"className":1789,"style":409},[201],[34,1791,1793,1798],{"className":1792},[55],[34,1794,1797],{"className":1795,"style":1796},[55,82],"margin-right:0.109em;","M",[34,1799,1801],{"className":1800},[136],[34,1802,1804,1825],{"className":1803},[60,61],[34,1805,1807,1822],{"className":1806},[65],[34,1808,1810],{"className":1809,"style":1151},[69],[34,1811,1813,1816],{"style":1812},"top:-2.55em;margin-left:-0.109em;margin-right:0.05em;",[34,1814],{"className":1815,"style":153},[77],[34,1817,1819],{"className":1818},[157,158,159,160],[34,1820,1163],{"className":1821},[464,160],[34,1823,102],{"className":1824},[101],[34,1826,1828],{"className":1827},[65],[34,1829,1831],{"className":1830,"style":1173},[69],[34,1832],{},")\ncrossing the strip on blue loops during core helium burning, with periods of one to\na hundred days.",[1748,1835,1836,1839,1840,1899],{},[1304,1837,1838],{},"RR Lyrae stars"," where the strip meets the horizontal branch, old low-mass stars\nof about ",[34,1841,1843],{"className":1842},[37],[34,1844,1846],{"className":1845,"ariaHidden":42},[41],[34,1847,1849,1852,1856,1859],{"className":1848},[46],[34,1850],{"className":1851,"style":1782},[50],[34,1853,1855],{"className":1854},[55],"0.6",[34,1857],{"className":1858,"style":409},[201],[34,1860,1862,1865],{"className":1861},[55],[34,1863,1797],{"className":1864,"style":1796},[55,82],[34,1866,1868],{"className":1867},[136],[34,1869,1871,1891],{"className":1870},[60,61],[34,1872,1874,1888],{"className":1873},[65],[34,1875,1877],{"className":1876,"style":1151},[69],[34,1878,1879,1882],{"style":1812},[34,1880],{"className":1881,"style":153},[77],[34,1883,1885],{"className":1884},[157,158,159,160],[34,1886,1163],{"className":1887},[464,160],[34,1889,102],{"className":1890},[101],[34,1892,1894],{"className":1893},[65],[34,1895,1897],{"className":1896,"style":1173},[69],[34,1898],{}," burning helium in the core, with periods near half a day.",[1748,1901,1902,1905],{},[1304,1903,1904],{},"Mira variables",", cool luminous stars on the asymptotic giant branch pulsating in\nthe fundamental radial mode with periods of hundreds of days and large amplitudes.",[26,1907,1909],{"id":1908},"light-and-velocity-curves","Light and velocity curves",[11,1911,1912],{},"A pulsating star is observed through its light curve and its radial-velocity curve.\nThe luminosity varies mainly with the surface temperature, which peaks slightly after\nthe star has passed through minimum radius and is expanding. The radial velocity,\nmeasured from the Doppler shift of spectral lines, tracks the velocity of the surface\nand is nearly the time derivative of the radius. Maximum brightness therefore lags the\nepoch of maximum contraction, and the light and velocity curves are offset by roughly\na quarter of a period. For Cepheids the light curve is characteristically asymmetric,\nrising fast and declining slowly.",[1434,1914],{"hash":1915},"f9a3aeccc68716187fe17436a4d281c48511d4603e78e6dc06c27b28fc185daf",[26,1917,1919],{"id":1918},"the-periodluminosity-relation","The period–luminosity relation",[11,1921,1922,1923,1926],{},"More luminous Cepheids are larger and less dense, so by the period–mean-density\nrelation they pulsate more slowly. This links period directly to luminosity: the\n",[1304,1924,1925],{},"period–luminosity relation",", or Leavitt law,",[34,1928,1930],{"className":1929},[180],[34,1931,1933],{"className":1932},[37],[34,1934,1936,1993,2166],{"className":1935,"ariaHidden":42},[41],[34,1937,1939,1942,1984,1987,1990],{"className":1938},[46],[34,1940],{"className":1941,"style":125},[50],[34,1943,1945,1948],{"className":1944},[55],[34,1946,1797],{"className":1947,"style":1796},[55,82],[34,1949,1951],{"className":1950},[136],[34,1952,1954,1976],{"className":1953},[60,61],[34,1955,1957,1973],{"className":1956},[65],[34,1958,1961],{"className":1959,"style":1960},[69],"height:0.3283em;",[34,1962,1963,1966],{"style":1812},[34,1964],{"className":1965,"style":153},[77],[34,1967,1969],{"className":1968},[157,158,159,160],[34,1970,1972],{"className":1971,"style":460},[55,82,160],"V",[34,1974,102],{"className":1975},[101],[34,1977,1979],{"className":1978},[65],[34,1980,1982],{"className":1981,"style":173},[69],[34,1983],{},[34,1985],{"className":1986,"style":202},[201],[34,1988,207],{"className":1989},[206],[34,1991],{"className":1992,"style":202},[201],[34,1994,1996,2000,2003,2006,2009,2063,2067,2070,2157,2160,2163],{"className":1995},[46],[34,1997],{"className":1998,"style":1999},[50],"height:2.4em;vertical-align:-0.95em;",[34,2001,18],{"className":2002},[55,82],[34,2004],{"className":2005,"style":409},[201],[34,2007],{"className":2008,"style":409},[201],[34,2010,2013,2022],{"className":2011},[2012],"mop",[34,2014,2016],{"className":2015},[2012],[34,2017,2021],{"className":2018,"style":2020},[55,2019],"mathrm","margin-right:0.0139em;","log",[34,2023,2025],{"className":2024},[136],[34,2026,2028,2054],{"className":2027},[60,61],[34,2029,2031,2051],{"className":2030},[65],[34,2032,2035],{"className":2033,"style":2034},[69],"height:0.207em;",[34,2036,2038,2041],{"style":2037},"top:-2.4559em;margin-right:0.05em;",[34,2039],{"className":2040,"style":153},[77],[34,2042,2044],{"className":2043},[157,158,159,160],[34,2045,2047],{"className":2046},[55,160],[34,2048,2050],{"className":2049},[55,160],"10",[34,2052,102],{"className":2053},[101],[34,2055,2057],{"className":2056},[65],[34,2058,2061],{"className":2059,"style":2060},[69],"height:0.2441em;",[34,2062],{},[34,2064],{"className":2065,"style":2066},[201],"margin-right:-0.1667em;",[34,2068],{"className":2069,"style":409},[201],[34,2071,2074,2083,2151],{"className":2072},[2073],"minner",[34,2075,2079],{"className":2076,"style":2078},[224,2077],"delimcenter","top:0em;",[34,2080,413],{"className":2081},[2082,159],"delimsizing",[34,2084,2086,2089,2148],{"className":2085},[55],[34,2087],{"className":2088},[224,225],[34,2090,2092],{"className":2091},[229],[34,2093,2095,2139],{"className":2094},[60,61],[34,2096,2098,2136],{"className":2097},[65],[34,2099,2102,2117,2125],{"className":2100,"style":2101},[69],"height:1.3603em;",[34,2103,2104,2107],{"style":1087},[34,2105],{"className":2106,"style":78},[77],[34,2108,2110],{"className":2109},[55],[34,2111,2113],{"className":2112},[55,1022],[34,2114,2116],{"className":2115},[55],"day",[34,2118,2119,2122],{"style":314},[34,2120],{"className":2121,"style":78},[77],[34,2123],{"className":2124,"style":322},[321],[34,2126,2127,2130],{"style":1186},[34,2128],{"className":2129,"style":78},[77],[34,2131,2133],{"className":2132},[55],[34,2134,197],{"className":2135},[55],[34,2137,102],{"className":2138},[101],[34,2140,2142],{"className":2141},[65],[34,2143,2146],{"className":2144,"style":2145},[69],"height:0.8804em;",[34,2147],{},[34,2149],{"className":2150},[354,225],[34,2152,2154],{"className":2153,"style":2078},[354,2077],[34,2155,475],{"className":2156},[2082,159],[34,2158],{"className":2159,"style":460},[201],[34,2161,1591],{"className":2162},[464],[34,2164],{"className":2165,"style":460},[201],[34,2167,2169,2172,2176],{"className":2168},[46],[34,2170],{"className":2171,"style":1340},[50],[34,2173,2175],{"className":2174},[55,82],"b",[34,2177,1031],{"className":2178},[1030],[11,2180,2181,2182,2221,2222,554],{},"with ",[34,2183,2185],{"className":2184},[37],[34,2186,2188,2208],{"className":2187,"ariaHidden":42},[41],[34,2189,2191,2195,2198,2201,2205],{"className":2190},[46],[34,2192],{"className":2193,"style":2194},[50],"height:0.4831em;",[34,2196,18],{"className":2197},[55,82],[34,2199],{"className":2200,"style":202},[201],[34,2202,2204],{"className":2203},[206],"≈",[34,2206],{"className":2207,"style":202},[201],[34,2209,2211,2214,2217],{"className":2210},[46],[34,2212],{"className":2213,"style":1660},[50],[34,2215,465],{"className":2216},[55],[34,2218,2220],{"className":2219},[55],"2.8"," and a small scatter set by the finite width of the instability\nstrip. Because the period is measured from the light curve alone, independent of\ndistance, the relation delivers the absolute magnitude, and comparison with the\napparent magnitude gives the distance modulus. Cepheids are luminous enough to be\nresolved in galaxies tens of megaparsecs away, making them the rung that calibrates\nthe extragalactic scale in ",[18,2223,2225],{"href":2224},"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder","the cosmic distance\nladder",[1434,2227],{"hash":2228},"e590e00322c0257cd64e4455545a5057713fa6b7bd46bc638fe55753fe330e53",[11,2230,2231,2232,2236,2237,554],{},"Pulsation converts a star's structure into an observable clock. The period fixes the\nmean density and, through the instability-strip physics, the luminosity, and the\nbrightness variation is visible across intergalactic distances. The same instability\nstrip is crossed by massive stars on blue loops, treated in ",[18,2233,2235],{"href":2234},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars","the evolution of massive\nstars",", and\nby horizontal-branch stars after the helium flash, treated in ",[18,2238,2240],{"href":2239},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution","post-main-sequence\nevolution of low-mass\nstars",[2242,2243,2246,2251],"section",{"className":2244,"dataFootnotes":6},[2245],"footnotes",[26,2247,2250],{"className":2248,"id":22},[2249],"sr-only","Footnotes",[2252,2253,2254],"ol",{},[1748,2255,2257,2258],{"id":2256},"user-content-fn-co-puls","Carroll & Ostlie, §14.1–14.2 — Stellar Pulsation: the period–mean-density relation and pulsation constant, radial modes, the kappa and gamma mechanisms seated in the helium ionization zone, the instability strip, and the Cepheid period–luminosity relation. ",[18,2259,2264],{"href":2260,"ariaLabel":2261,"className":2262,"dataFootnoteBackref":6},"#user-content-fnref-co-puls","Back to reference 1",[2263],"data-footnote-backref","↩",{"title":6,"searchDepth":2266,"depth":2266,"links":2267},2,[2268,2269,2270,2271,2272,2273],{"id":28,"depth":2266,"text":29},{"id":1439,"depth":2266,"text":1440},{"id":1729,"depth":2266,"text":1730},{"id":1908,"depth":2266,"text":1909},{"id":1918,"depth":2266,"text":1919},{"id":22,"depth":2266,"text":2250},[],"computer-science","Some stars vary in brightness because they pulsate: the whole star expands and\ncontracts, brightening as it heats and dims as it cools. The oscillation is a\nstanding sound wave, its period fixed by the mean density, and it is sustained\nagainst dissipation by an opacity valve in a partial-ionization layer of the\nenvelope. Only stars occupying a narrow, nearly vertical strip of the\nHertzsprung–Russell diagram pulsate this way, and their period–luminosity relation\nmakes them the measuring rods of extragalactic distance.1",false,"md",{"moduleNumber":2280,"lessonNumber":2281,"order":2282},7,4,704,"Stellar Evolution",true,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip",[],"---\ntitle: Stellar Pulsation and the Instability Strip\ndraft: false\nmodule: Stellar Evolution\nmoduleNumber: 7\nlessonNumber: 4\norder: 704\nsummary: >\n  Radial pulsation is a standing sound wave whose period scales inversely with the\n  square root of the mean density. The kappa mechanism, an opacity valve seated in\n  the helium partial-ionization zone, turns a star into a heat engine that pumps the\n  oscillation. Stars in the instability strip pulsate as Cepheids, RR Lyrae, and\n  Mira variables, and the Cepheid period–luminosity relation calibrates the distance\n  ladder.\ntopics: [Stellar Evolution]\nsources:\n  - book: Carroll & Ostlie\n    ref: \"Ch. 14 — Stellar Pulsation; §14.1 Observations of Pulsating Stars, §14.2 The Physics of Stellar Pulsation\"\n  - book: Maoz\n    ref: \"Ch. 2 — Stars: Basic Observations\"\n---\n\nSome stars vary in brightness because they pulsate: the whole star expands and\ncontracts, brightening as it heats and dims as it cools. The oscillation is a\nstanding sound wave, its period fixed by the mean density, and it is sustained\nagainst dissipation by an opacity valve in a partial-ionization layer of the\nenvelope. Only stars occupying a narrow, nearly vertical strip of the\nHertzsprung–Russell diagram pulsate this way, and their period–luminosity relation\nmakes them the measuring rods of extragalactic distance.[^co-puls]\n\n## The period–mean-density relation\n\nA radial pulsation is a standing acoustic wave in the star. Its period is the time a\nsound wave takes to cross the star and return, so it depends on the sound speed and\nthe radius. Model the star crudely as a sphere of uniform density $\\bar\\rho$\noscillating adiabatically. A displaced shell feels a restoring pressure whose\nadiabatic response is set by the first adiabatic exponent $\\Gamma_1$, and the\nlinearized equation of motion has the fundamental period\n\n$$\n\\Pi = \\frac{2\\pi}{\\sqrt{\\tfrac{4}{3}\\pi G\\bar\\rho\\,(3\\Gamma_1 - 4)}}.\n$$\n\nFor $\\Gamma_1 = 5\u002F3$ the factor $3\\Gamma_1 - 4 = 1$, and this reduces to\n$\\Pi = \\sqrt{3\\pi\u002F(G\\bar\\rho)}$. The essential content is the scaling\n\n$$\n\\Pi\\sqrt{\\bar\\rho} = Q = \\text{const},\n\\qquad\n\\Pi\\sqrt{\\frac{\\bar\\rho}{\\bar\\rho_\\odot}} = Q,\n$$\n\nthe **period–mean-density relation**. The **pulsation constant** $Q$ is nearly the\nsame for all stars pulsating in the fundamental mode, about $0.04\\ \\text{days}$ for\nclassical Cepheids. Denser stars pulsate faster; the tenuous, luminous supergiants\nhave the longest periods. Note the requirement $\\Gamma_1 > 4\u002F3$ for a real period:\nbelow it the restoring force vanishes and the star is dynamically unstable rather\nthan oscillatory.\n\nThe fundamental mode has the whole envelope moving in phase, with the center fixed\nand the surface at maximum displacement. Overtones have one or more internal nodes\nwhere the gas stays still while layers on either side move oppositely, and they have\nshorter periods. Most Cepheids pulsate in the fundamental; many RR Lyrae stars\npulsate in an overtone, giving the double-peaked period distribution seen in globular\nclusters.\n\n$$\n% caption: Radial pulsation modes shown as displacement against radius; the\n% fundamental mode has all layers moving in phase with a single antinode at the\n% surface, while the overtone has an interior node separating oppositely moving\n% layers.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n\\draw[->, black] (0,2.3) -- (8.8,2.3) node[right, black!70] {radius};\n\\draw[->, black] (0,0.4) -- (0,4.4) node[above, black!70] {displacement};\n\\node[black, anchor=north east] at (0,2.3) {center};\n\\node[black, anchor=north] at (8.2,2.3) {surface};\n% fundamental: monotone rise, all in phase\n\\draw[acc, very thick] (0,2.3) .. controls (3.5,2.5) and (6.0,3.4) .. (8.2,4.0);\n\\node[acc, anchor=south east] at (7.6,3.9) {fundamental};\n% overtone: rises, node, dips below\n\\draw[black, very thick, densely dashed] (0,2.3) .. controls (2.0,3.2) and (3.0,3.0) .. (4.2,2.3)\n  .. controls (5.4,1.6) and (6.6,0.9) .. (8.2,1.0);\n\\node[black, anchor=north] at (2.5,3.25) {overtone};\n% node marker\n\\fill[black] (4.2,2.3) circle (1.6pt);\n\\node[black, anchor=south] at (4.2,2.35) {node};\n\\end{tikzpicture}\n$$\n\n## The kappa mechanism\n\nA pulsation left to itself would damp as sound waves dissipate. To persist, the star\nmust do net work on the oscillation over each cycle, acting as a heat engine that\nabsorbs heat when compressed and releases it when expanded. Ordinary stellar material\ndoes the opposite. Compression raises the temperature, and in the Kramers regime the\nopacity $\\kappa \\propto \\rho\\,T^{-7\u002F2}$ falls with temperature, so a compressed layer\nbecomes more transparent and lets heat leak out exactly when the engine would need to\nretain it. Across most of a star, pulsations are damped.\n\nThe exception is a **partial-ionization zone**. Where a species is half-ionized,\ncompression does not raise the temperature much, because the energy goes into further\nionization rather than into heating the gas. With the temperature nearly fixed, the\ndensity increase makes the opacity **rise** on compression. The layer dams the\noutward flux while compressed, storing heat, and releases it on expansion. This is the\n**kappa mechanism** (aided by the associated **gamma mechanism**, the same energy\ndiversion into ionization). The dominant valve in classical pulsators is the second\nhelium ionization zone, $\\text{He}^+ \\to \\text{He}^{2+}$, near $4\\times 10^4\\ \\text{K}$.\n\n$$\n% caption: The kappa-mechanism engine cycle; in the helium ionization zone opacity\n% rises on compression, damming the outward flux and storing heat, which pushes the\n% layer back out, whereupon opacity falls, heat escapes, and the layer falls back to\n% compress again.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n% four phases around a loop\n\\node[draw, very thick, align=center, minimum width=2.4cm, minimum height=1.0cm] (a) at (1.7,4.0) {compress};\n\\node[draw, very thick, align=center, minimum width=2.4cm, minimum height=1.0cm] (b) at (6.5,4.0) {opacity rises,\\\\heat stored};\n\\node[draw, very thick, align=center, minimum width=2.4cm, minimum height=1.0cm] (c) at (6.5,1.2) {push out,\\\\expand};\n\\node[draw, very thick, align=center, minimum width=2.4cm, minimum height=1.0cm] (d) at (1.7,1.2) {opacity falls,\\\\heat escapes};\n\\draw[black, very thick, ->] (a) -- (b);\n\\draw[black, very thick, ->] (b) -- (c);\n\\draw[black, very thick, ->] (c) -- (d);\n\\draw[black, very thick, ->] (d) -- (a);\n\\end{tikzpicture}\n$$\n\n## The instability strip\n\nThe kappa mechanism drives a star only when the helium ionization zone sits at the\nright depth. Too hot, and the zone lies too near the surface, where it contains too\nlittle mass to store significant heat, so the driving is feeble. Too cool, and the\nouter envelope becomes convective; convection carries the energy and short-circuits\nthe valve, quenching the pulsation. Between these limits the zone lies at a depth\nwhere its heat capacity is large and radiation still controls the flux, and the star\npulsates. The favorable range is nearly independent of luminosity, so it defines an\nalmost vertical band in the H-R diagram, the **instability strip**, tilted slightly\nbecause the cool edge depends weakly on luminosity.\n\n$$\n% caption: The instability strip as a narrow, nearly vertical band crossing the H-R\n% diagram; classical Cepheids occupy its luminous upper end, RR Lyrae stars its\n% intersection with the horizontal branch, and Mira variables lie beyond on the\n% asymptotic giant branch.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n\\draw[->, black] (9.0,0) -- (0,0) node[left, black!70] {hotter};\n\\draw[->, black] (9.0,0) -- (9.0,5.4) node[above, black!70] {luminosity};\n% main sequence for reference\n\\draw[black, thick] (1.4,5.0) .. controls (4.0,3.0) and (6.5,1.4) .. (8.4,0.7);\n\\node[black, anchor=west, rotate=-27] at (5.4,1.9) {main sequence};\n% instability strip band (tilted)\n\\fill[acc!10] (4.0,0.4) -- (4.9,0.4) -- (4.1,5.2) -- (3.2,5.2) -- cycle;\n\\draw[acc!60, densely dashed] (4.0,0.4) -- (3.2,5.2);\n\\draw[acc!60, densely dashed] (4.9,0.4) -- (4.1,5.2);\n\\node[acc, anchor=south, rotate=-80] at (3.55,2.6) {instability strip};\n% Cepheids at top\n\\fill[black] (3.7,4.3) circle (2pt);\n\\node[black!70, anchor=west] at (3.85,4.4) {Cepheids};\n% RR Lyrae mid\n\\fill[black] (4.3,2.2) circle (2pt);\n\\node[black!70, anchor=west] at (4.45,2.3) {RR Lyrae};\n% Mira lower right (cool, luminous AGB - place upper right of strip)\n\\fill[black] (2.6,4.9) circle (2pt);\n\\node[black!70, anchor=west] at (2.7,4.9) {Mira};\n\\end{tikzpicture}\n$$\n\nThe strip is populated by different stars at different luminosities:\n\n- **Classical Cepheids** at the luminous top, massive stars ($3$–$20\\,M_\\odot$)\n  crossing the strip on blue loops during core helium burning, with periods of one to\n  a hundred days.\n- **RR Lyrae stars** where the strip meets the horizontal branch, old low-mass stars\n  of about $0.6\\,M_\\odot$ burning helium in the core, with periods near half a day.\n- **Mira variables**, cool luminous stars on the asymptotic giant branch pulsating in\n  the fundamental radial mode with periods of hundreds of days and large amplitudes.\n\n## Light and velocity curves\n\nA pulsating star is observed through its light curve and its radial-velocity curve.\nThe luminosity varies mainly with the surface temperature, which peaks slightly after\nthe star has passed through minimum radius and is expanding. The radial velocity,\nmeasured from the Doppler shift of spectral lines, tracks the velocity of the surface\nand is nearly the time derivative of the radius. Maximum brightness therefore lags the\nepoch of maximum contraction, and the light and velocity curves are offset by roughly\na quarter of a period. For Cepheids the light curve is characteristically asymmetric,\nrising fast and declining slowly.\n\n$$\n% caption: Light and radial-velocity curves of a Cepheid over one period; the\n% brightness rises steeply and falls slowly, and the velocity curve, tracking the\n% surface motion, is offset from the light curve by about a quarter period.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n\\draw[->, black] (0,2.6) -- (9.2,2.6) node[right, black!70] {phase};\n\\draw[->, black] (0,0.3) -- (0,5.0);\n\\node[acc, anchor=east] at (-0.05,4.2) {light};\n\\node[black, anchor=east] at (-0.05,1.3) {velocity};\n% light curve: fast rise, slow decline (asymmetric), upper band\n\\draw[acc, very thick] (0.4,3.4) .. controls (0.8,4.6) and (1.1,4.6) .. (1.5,4.5)\n  .. controls (3.0,4.1) and (4.3,3.3) .. (5.0,3.35)\n  .. controls (5.6,3.4) and (6.0,4.55) .. (6.5,4.5)\n  .. controls (8.0,4.1) and (8.6,3.4) .. (9.0,3.4);\n% velocity curve: offset ~quarter period, lower band, dashed\n\\draw[black, very thick, densely dashed] (0.4,1.9) .. controls (1.4,1.0) and (2.2,1.0) .. (3.0,1.7)\n  .. controls (3.8,2.3) and (4.4,2.3) .. (5.0,1.9)\n  .. controls (5.9,1.0) and (6.7,1.0) .. (7.5,1.7)\n  .. controls (8.2,2.2) and (8.7,2.2) .. (9.0,2.0);\n\\end{tikzpicture}\n$$\n\n## The period–luminosity relation\n\nMore luminous Cepheids are larger and less dense, so by the period–mean-density\nrelation they pulsate more slowly. This links period directly to luminosity: the\n**period–luminosity relation**, or Leavitt law,\n\n$$\nM_V = a\\,\\log_{10}\\!\\left(\\frac{\\Pi}{\\text{day}}\\right) + b,\n$$\n\nwith $a \\approx -2.8$ and a small scatter set by the finite width of the instability\nstrip. Because the period is measured from the light curve alone, independent of\ndistance, the relation delivers the absolute magnitude, and comparison with the\napparent magnitude gives the distance modulus. Cepheids are luminous enough to be\nresolved in galaxies tens of megaparsecs away, making them the rung that calibrates\nthe extragalactic scale in [the cosmic distance\nladder](\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder).\n\n$$\n% caption: The Cepheid period–luminosity relation; the absolute magnitude brightens\n% linearly with the logarithm of the pulsation period, with a narrow scatter set by\n% the width of the instability strip.\n\\begin{tikzpicture}[scale=1.0, font=\\footnotesize]\n\\definecolor{acc}{HTML}{4A6FA5}\n\\draw[->, black] (0,0) -- (9.0,0) node[right, black!70] {log period};\n\\draw[->, black] (0,0) -- (0,5.0) node[above, black!70] {brighter};\n% P-L line (brighter = up)\n\\draw[acc, very thick] (0.7,0.7) -- (8.2,4.6);\n\\node[acc, anchor=south east] at (6.6,3.4) {slope near minus 2.8};\n% scatter points about it\n\\fill[black] (1.4,1.2) circle (1.4pt);\n\\fill[black] (2.3,1.5) circle (1.4pt);\n\\fill[black] (3.1,2.1) circle (1.4pt);\n\\fill[black] (4.0,2.3) circle (1.4pt);\n\\fill[black] (5.0,3.1) circle (1.4pt);\n\\fill[black] (5.9,3.2) circle (1.4pt);\n\\fill[black] (6.8,3.9) circle (1.4pt);\n\\fill[black] (7.5,4.1) circle (1.4pt);\n\\end{tikzpicture}\n$$\n\nPulsation converts a star's structure into an observable clock. The period fixes the\nmean density and, through the instability-strip physics, the luminosity, and the\nbrightness variation is visible across intergalactic distances. The same instability\nstrip is crossed by massive stars on blue loops, treated in [the evolution of massive\nstars](\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars), and\nby horizontal-branch stars after the helium flash, treated in [post-main-sequence\nevolution of low-mass\nstars](\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution).\n\n[^co-puls]: Carroll & Ostlie, §14.1–14.2 — Stellar Pulsation: the period–mean-density relation and pulsation constant, radial modes, the kappa and gamma mechanisms seated in the helium ionization zone, the instability strip, and the Cepheid period–luminosity relation.\n",{"text":2289,"minutes":2290,"time":2291,"words":2292},"5 min read",4.865,291900,973,{"title":5,"description":2276},[2295,2298],{"book":2296,"ref":2297},"Carroll & Ostlie","Ch. 14 — Stellar Pulsation; §14.1 Observations of Pulsating Stars, §14.2 The Physics of Stellar Pulsation",{"book":2299,"ref":2300},"Maoz","Ch. 2 — Stars: Basic Observations","available","10.astrophysics-cosmology\u002F07.stellar-evolution\u002F04.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",[2283],"TFXgV47Aq3IPGD40FyF6Y9RleDzJk87NMz-ecotE06M",{"\u002Falgorithms\u002Ffoundations\u002Fwhat-is-an-algorithm":2307,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":2308,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":2309,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":2310,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":2311,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":2312,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":2313,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":2314,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":2315,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":2316,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":2317,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":2318,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":2319,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":2320,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":2321,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":2322,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":2323,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":2324,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":2325,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":2326,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":2327,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":2328,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":2329,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":2330,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":2331,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":2332,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":2333,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":2334,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":2335,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":2336,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":2337,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":2338,"\u002Falgorithms\u002Fsequences\u002Ftries":2339,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":2340,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":2341,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":2342,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":2343,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":2344,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":2345,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":2346,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":2347,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":2348,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":2349,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":2350,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":2351,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":2352,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":2353,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":2354,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":2355,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":2356,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":2357,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":2358,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":2359,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":2360,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":2361,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":2362,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":2363,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":2364,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":2365,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":2366,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":2367,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":2368,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":2369,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":2370,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":2371,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":2372,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":2373,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":2374,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":2375,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":2376,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":2377,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":2378,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":2379,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":2380,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":2381,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":2382,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":2383,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":2384,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":2385,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":2386,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":2387,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":2388,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":2389,"\u002Falgorithms":2390,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":2391,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":2392,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":2393,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":2394,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":2395,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":2396,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":2397,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":2398,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":2399,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":2400,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":2401,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":2402,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":2403,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":2404,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":2405,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":2406,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":2407,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":2408,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":2409,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":2410,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":2411,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":2412,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":2413,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":2414,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":2415,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":2416,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":2417,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":2418,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":2419,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":2292,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":2420,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":2421,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":2422,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":2423,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":2405,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":2424,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":2425,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":2426,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":2395,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":2427,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":2428,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":2429,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":2430,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":2431,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":2432,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":2433,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":2434,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":2435,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":2436,"\u002Fcalculus":2437,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":2438,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":2439,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":2440,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":2441,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":2442,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":2443,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":2444,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":2445,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":2446,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":2447,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":2448,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":2449,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":2450,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":2451,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":2452,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":2453,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":2454,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":2455,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":2456,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":2457,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":2458,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":2459,"\u002Fmechanics\u002Frotation\u002Frolling-motion":2460,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":2461,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":2462,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":2463,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":2464,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":2465,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":2466,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":2467,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":2468,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":2469,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":2470,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":2471,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":2472,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":2473,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":2474,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":2475,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":2476,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":2477,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":2478,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":2479,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":2480,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":2481,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":2482,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":2483,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":2484,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":2485,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":2486,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":2487,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":2488,"\u002Fmechanics":2489,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":2490,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":2491,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":2492,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":2493,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":2494,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":2495,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":2496,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":2497,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":2498,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":2499,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":2500,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":2501,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":2478,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":2502,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":2503,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":2504,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":2474,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":2340,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":2505,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":2465,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":2506,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":2507,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":2508,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":2509,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":2510,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":2511,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":2512,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":2513,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":2514,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":2439,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":2515,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":2516,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":2517,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":2518,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":2519,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":2520,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":2521,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":2522,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":2457,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":2456,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":2523,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":2524,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":2525,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":2526,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":2527,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":2528,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":2529,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":2530,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":2531,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":2483,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":2481,"\u002Felectricity-and-magnetism":2532,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":2533,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":2534,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":2535,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":2536,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":2537,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":2538,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":2539,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":2540,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":2541,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":2392,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":2542,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":2543,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":2396,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":2544,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":2545,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":2546,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":2547,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":2548,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":2549,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":2550,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":2551,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":2552,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":2553,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":2554,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":2555,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":2556,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":2557,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":2558,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":2559,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":2560,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":2561,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":2562,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":2563,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":2430,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":2564,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":2565,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":2566,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":2567,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":2568,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":2569,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":2570,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":2571,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":2572,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":2573,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":2574,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":2575,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":2576,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":2577,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":2578,"\u002Flinear-algebra":2579,"\u002Ftheory-of-computation":2580,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":2581,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":2582,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":2583,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":2584,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":2585,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":2586,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":2587,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":2588,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":2589,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":2590,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":2591,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":2592,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":2593,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":2594,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":2595,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":2596,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":2597,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":2598,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":2599,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":2600,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":2601,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":2602,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":2603,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":2604,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":2605,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":2606,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":2607,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":2608,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":2609,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":2610,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":2611,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":2612,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":2613,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":2614,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":2615,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":2616,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":2617,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":2618,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":2619,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":2620,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":2621,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":2622,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":2623,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":2624,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":2625,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":2626,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":2627,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":2628,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":2629,"\u002Fcomputer-architecture":2580,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":2630,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":2631,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":2632,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":2396,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":2633,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":2395,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":2402,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":2634,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":2635,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":2435,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":2636,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":2637,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":2638,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":2639,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":2640,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":2641,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":2642,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":2643,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":2644,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":2645,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":2646,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":2647,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":2642,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":2648,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":2649,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":2650,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":2651,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":2652,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":2653,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":2654,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":2655,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":2656,"\u002Fdifferential-equations":2657,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":2658,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":2659,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":2660,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":2661,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":2540,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":2662,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":2663,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":2664,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":2665,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":2666,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":2667,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":2411,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":2668,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":2669,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":2670,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":2671,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":2672,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":2673,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":2674,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":2675,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":2676,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":2677,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":2632,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":2678,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":2679,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":2680,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":2681,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":2682,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":2561,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":2683,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":2684,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":2571,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":2685,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":2686,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":2687,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":2688,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":2689,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":2690,"\u002Frelativity":2691,"\u002Fphysical-computing":2580,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":2692,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":2671,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":2693,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":2694,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":2695,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":2696,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":2697,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":2698,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":2699,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":2647,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":2571,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":2700,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":2701,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":2702,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":2703,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":2699,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":2704,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":2679,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":2432,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":2705,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":2706,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":2413,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":2707,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":2708,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":2709,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":2710,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":2711,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":2712,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":2713,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":2714,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":2715,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":2671,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":2716,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":2717,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":2718,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":2705,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":2394,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":2719,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":2720,"\u002Fquantum-mechanics":2721,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":2655,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":2722,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":2723,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":2544,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":2724,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":2430,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":2725,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":2726,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":2567,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":2677,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":2727,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":2728,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":2729,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":2730,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":2731,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":2704,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":2732,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":2537,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":2733,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":2734,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":2392,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":2735,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":2736,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":2693,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":2420,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":2571,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":2737,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":2738,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":2556,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":2681,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":2739,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":2740,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":2741,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":2576,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":2742,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":2743,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":2744,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":2744,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":2745,"\u002Freal-analysis":2746,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":2747,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":2748,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":2749,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":2750,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":2751,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":2752,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":2753,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":2754,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":2755,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":2756,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":2720,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":2757,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":2749,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":2666,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":2758,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":2759,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":2760,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":2761,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":2762,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":2763,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":2764,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":2765,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":2759,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":2766,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":2735,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":2767,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":2768,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":2769,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":2770,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":2771,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":2772,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":2773,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":2774,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":2775,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":2776,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":2410,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":2777,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":2778,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":2651,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":2779,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":2780,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":2708,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":2780,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":2781,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":2782,"\u002Fabstract-algebra":2783,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":2784,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":2785,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":2786,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":2787,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":2788,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":2700,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":2789,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":2790,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":2791,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":2792,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":2793,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":2794,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":2795,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":2534,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":2663,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":2410,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":2796,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":2394,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":2797,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":2798,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":2431,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":2725,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":2799,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":2800,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":2801,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":2802,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":2803,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":2804,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":2805,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":2806,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":2807,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":2808,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":2809,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":2810,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":2811,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":2812,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":2756,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":2813,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":2814,"\u002Fatomic-physics":2815,"\u002Fdatabases":2580,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":2816,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":2817,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":2818,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":2747,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":2819,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":2820,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":2821,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":2822,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":2823,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":2824,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":2825,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":2826,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":2827,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":2828,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":2829,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":2830,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":2831,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":2832,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":2833,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":2834,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":2835,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":2836,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":2837,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":2838,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":2829,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":2839,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":2840,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":2841,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":2842,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":2843,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":2788,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":2844,"\u002Fcategory-theory":2845,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":2846,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":2847,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":2848,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":2849,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":2850,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":2851,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":2810,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":2852,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":2853,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":2854,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":2855,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":2856,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":2857,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":2858,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":2859,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":2860,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":2861,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":2862,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":2863,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":2864,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":2865,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":2866,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":2867,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":2868,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":2869,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":2870,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":2871,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":2872,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":2873,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":2874,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":2875,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":2876,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":2877,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":2878,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":2822,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":2879,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":2880,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":2881,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":2882,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":2883,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":2884,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":2885,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":2375,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":2886,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":2887,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":2610,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":2888,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":2889,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":2890,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":2891,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":2892,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":2893,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":2894,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":2895,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":2896,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":2897,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":2898,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":2899,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":2583,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":2900,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":2901,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":2902,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":2903,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":2620,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":2904,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":2905,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":2906,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":2907,"\u002Fdeep-learning":2580,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":2908,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":2705,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":2909,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":2910,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":2911,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":2912,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":2913,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":2914,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":2915,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":2916,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":2752,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":2917,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":2918,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":2919,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":2639,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":2432,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":2920,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":2921,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":2922,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":2566,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":2923,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":2924,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":2644,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":2571,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":2925,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":2540,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":2411,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":2426,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":2926,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":2927,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":2928,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":2558,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":2929,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":2420,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":2930,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":2931,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":2932,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":2933,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":2754,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":2934,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":2935,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":2936,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":2937,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":2700,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":2938,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":2678,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":2939,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":2539,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":2940,"\u002Fstatistical-mechanics":2941,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":2942,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":2406,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":2665,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":2943,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":2944,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":2945,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":2946,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":2947,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":2948,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":2538,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":2949,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":2950,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":2951,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":2952,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":2681,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":2953,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":2954,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":2955,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":2956,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":2957,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":2736,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":2680,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":2958,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":2959,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":2960,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":2961,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":2671,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":2962,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":2963,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":2908,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":2808,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":2535,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":2964,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":2402,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":2965,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":2966,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":2546,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":2967,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":2801,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":2968,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":2394,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":2969,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":2405,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":2970,"\u002Fcondensed-matter":2721,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":2971,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":2972,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":2973,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":2974,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":2419,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":2975,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":2976,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":2419,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":2977,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":2831,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":2978,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":2979,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":2980,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":2978,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":2981,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":2982,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":2983,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":2984,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":2985,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":2986,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":2987,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":2988,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":2909,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":2989,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":2982,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":2990,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":2991,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":2624,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":2992,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":2809,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":2993,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":2994,"\u002Flogic":2995,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":2996,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":2997,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":2610,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":2998,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":2999,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":3000,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":3001,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":2991,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":3002,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":3003,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":3004,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":2902,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":3005,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":3006,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":3007,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":3008,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":3009,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":2627,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":3010,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":3011,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":3012,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":3013,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":2818,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":3014,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":2990,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":3015,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":3016,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":3017,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":2638,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":3018,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":2768,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":3019,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":3020,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":2600,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":3021,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":3022,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":3023,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":3024,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":3025,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":2878,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":3026,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":3027,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":3028,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":2913,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":3029,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":3030,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":3031,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":2627,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":2694,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":3032,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":3033,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":3034,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":3035,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":3036,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":3037,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":3038,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":3039,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":3040,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":3041,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":3042,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":3043,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":3044,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":3045,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":3046,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":3047,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":3048,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":3049,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":3050,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":3051,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":3052,"\u002Freinforcement-learning":2580,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":3053,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":3054,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":3055,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":3056,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":3057,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":3058,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":3059,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":3060,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":3061,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":3062,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":3063,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":3064,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":3065,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":2907,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":2762,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":3066,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":3067,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":3068,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":3069,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":3070,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":3071,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":2889,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":3072,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":3073,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":3074,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":3075,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":3076,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":3077,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":3078,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":3079,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":3080,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":3081,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":3082,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":3083,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":2821,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":3073,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":3084,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":2362,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":3085,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":3086,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":3087,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":3088,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":3089,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":2870,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":3090,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":3091,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":3092,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":3093,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":3094,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":3095,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":3096,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":3097,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":3098,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":3099,"\u002Fartificial-intelligence":2580,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":2837,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":3100,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":2398,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":2396,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":2931,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":3101,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":2423,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":2733,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":3102,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":3103,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":3104,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":2793,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":3105,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":3106,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":3107,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":2992,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":3108,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":3109,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":2408,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":2636,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":3110,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":2737,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":3111,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":3112,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":2632,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":2720,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":3113,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":3114,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":3115,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":2403,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":2777,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":2639,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":3116,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":2687,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":2751,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":3117,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":3118,"\u002Fnuclear-physics":3119,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":3120,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":3121,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":2758,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":3122,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":3123,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":3124,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":2606,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":3125,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":3126,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":2903,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":3127,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":3072,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":3128,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":3129,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":3130,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":3131,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":3132,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":3133,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":3134,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":2584,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":3135,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":3136,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":3078,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":3137,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":3138,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":3139,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":3140,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":3141,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":3142,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":3143,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":3144,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":3002,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":3145,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":3146,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":3147,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":3148,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":3149,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":3150,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":3151,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":3152,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":3153,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":3154,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":3155,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":3156,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":2856,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":3023,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":2612,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":3157,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":3158,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":3159,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":3160,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":2870,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":3161,"\u002Fnatural-language-processing":2580,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":3162,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":2778,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":3163,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":2923,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":3164,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":3165,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":3113,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":3166,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":3167,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":2728,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":2430,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":3168,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":2682,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":3169,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":2715,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":3170,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":2969,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":3171,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":3172,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":2938,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":3173,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":2402,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":3174,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":3175,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":3176,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":2719,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":2935,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":3177,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":3178,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":2794,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":3179,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":2839,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":3180,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":3181,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":2728,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":2761,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":3182,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":3183,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":3184,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":2817,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":3185,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":2558,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":3186,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":2661,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":3187,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":3188,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":2985,"\u002Fparticle-physics":3189,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":2779,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":2933,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":3190,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":2718,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":3191,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":2778,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":2690,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":3192,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":3193,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":3194,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":3195,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":3196,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":2984,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":2915,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":3197,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":3198,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":3199,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":3200,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":3112,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":3201,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":2674,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":2737,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":2719,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":3202,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":2803,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":2292,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":3203,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":3204,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":2934,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":3205,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":3206,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":3207,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":3208,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":2401,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":3209,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":3210,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":2661,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":3211,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":3212,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":2927,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":2582,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":3213,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":3214,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":2839,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":2825,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":2837,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":2934,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":3215,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":2400,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":2591,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":3216,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":2678,"\u002Fastrophysics-cosmology":2783,"\u002Fcolophon":3217,"\u002F":2580},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,980,728,764,1225,1329,796,929,801,878,774,1044,1488,1175,1130,890,814,870,154,4073,5140,4961,5127,4870,5382,5195,4955,5369,4501,5576,3824,4132,4289,4307,4570,3403,5084,5105,5201,5116,5341,5175,5368,5188,5211,5499,5155,4981,5125,5415,5255,5304,5130,5167,5552,5164,5094,5239,5036,5190,5004,5099,5035,5159,5088,5026,4937,5023,5264,5244,133,5114,5078,5043,5312,5170,5342,5139,5151,5049,5212,5013,5068,5079,5102,5121,5081,5029,5379,5854,5110,2139,3798,5055,5364,4984,4935,4895,4972,5289,5112,5156,4987,5031,5025,5149,5302,5042,5002,4979,4922,4960,5279,126,1877,1180,1129,907,958,1112,1300,1053,1250,1181,1241,1234,966,1050,734,1190,484,1082,926,733,761,571,607,798,804,952,977,731,784,645,771,1017,742,1004,1000,1562,1254,1288,1101,1011,1486,1061,856,992,1169,988,137,0,2037,1782,2384,2254,2123,2332,1643,1714,2089,1751,1367,1660,2511,1998,1892,1854,1791,2438,2487,1917,2375,2525,2266,1845,2275,1810,1631,2310,2166,2233,2113,2505,2347,2672,2112,2473,2592,2380,3013,2513,3256,3218,2194,2173,2205,2326,2081,3342,3152,1799,1670,1027,960,1095,1291,986,897,1209,1055,1817,1801,1593,1465,1196,1464,1201,1230,1435,1684,1461,1926,1500,1409,1284,1774,1869,162,1487,1122,1188,1001,1351,982,1005,979,1325,1046,943,1279,824,1008,989,1798,1277,1025,987,1043,1211,1074,981,939,1002,739,1139,1108,1013,1070,978,1458,1317,157,1357,1077,2355,1116,1037,1178,1637,1314,1109,1056,1702,1474,1071,1158,832,993,1404,1024,1068,1339,1106,1264,1248,913,1848,1328,1633,1224,1143,135,1378,959,1028,998,911,1527,1203,1266,1483,1165,990,938,965,1257,1418,1099,942,1352,956,1035,1398,1003,1094,1292,138,1721,1827,1449,1354,1148,1184,1285,1281,1213,1290,1271,1252,1274,1778,1591,1503,1437,1571,1584,1957,1117,1781,1648,1342,1667,1510,1965,1607,1365,1849,1259,1303,1356,1238,2208,1564,173,1671,1286,1227,1638,1529,668,1078,918,709,865,880,940,1534,1015,874,922,841,794,1194,822,1105,1658,1359,1296,1438,1921,1844,1570,1429,1324,1400,140,1787,1558,1654,1492,1747,2224,2002,2009,1323,1349,1785,1573,1722,1829,1353,1548,1552,1583,1624,1585,1245,1364,1514,1343,1397,1355,2211,1481,1770,160,2388,2293,2256,2552,2569,2478,2039,2496,2578,2814,2519,2461,2587,2492,2714,3278,2654,3050,2447,2849,2238,2369,2061,2214,2602,2563,2186,2985,2749,3364,2038,2282,2409,2126,2573,2206,2176,2268,2182,2402,2705,2633,2414,2213,2801,3313,3410,3195,1952,2017,1509,2537,2645,2027,2415,2838,2356,1906,3184,2950,2807,2954,1683,1316,1034,1138,1763,1822,1705,1246,1701,1097,1104,1187,1032,1083,1228,916,1489,1033,1652,997,692,837,1023,888,864,1089,1231,1214,1675,1156,1075,1520,1309,139,1205,1051,735,1123,1072,915,567,768,825,1253,983,1007,762,1058,861,862,971,1208,1149,1145,1029,1084,927,810,838,857,807,936,949,2321,1622,1069,1113,1057,854,1958,1528,1618,2049,1432,1679,1796,1685,1346,1275,1476,1505,1610,2018,1599,1215,1838,1909,132,3902,2215,2240,3266,3208,3073,2454,2969,2451,1875,2728,1884,2371,2516,2842,1690,1904,2346,3146,1386,2607,1966,2668,1665,2885,1606,2577,3074,2869,2403,2433,2082,1939,1587,2460,2747,2032,2642,1619,3123,1993,2090,2339,3829,1737,2622,2340,2322,3828,4409,2305,3411,2510,4527,3030,3569,3043,2457,1946,2277,2044,2909,1693,1945,2093,2399,2115,2898,2742,2242,3895,3378,3376,2769,2223,3062,3262,2651,2949,2768,3128,2423,1977,2087,2866,3388,2830,2210,2489,2884,3945,2099,2713,3402,1692,2931,4195,3989,3206,4391,3004,3704,3494,2902,999,881,901,919,748,869,1018,1045,1049,1333,954,1092,1019,976,1771,1480,1396,953,1026,161,3533,2495,1818,3007,2595,3427,3537,2216,1895,2304,3396,1739,2073,1962,2203,1767,2666,2264,2276,2852,1807,3735,1560,4144,1669,1676,1972,2418,3291,1525,2040,2766,2337,2220,2800,3001,2078,1759,2836,1896,2026,1758,1543,1047,896,946,1060,1384,1482,815,1414,1322,1440,1240,1468,1098,1133,847,1009,1381,1052,1191,1258,1370,1712,1441,1199,957,1079,150,1262,1417,1368,1219,1136,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":3219,"\u002Falgorithms\u002Ffoundations\u002Fproof-techniques":3224,"\u002Falgorithms\u002Ffoundations\u002Fasymptotic-analysis":3228,"\u002Falgorithms\u002Ffoundations\u002Fgrowth-rates-and-loop-analysis":3232,"\u002Falgorithms\u002Ffoundations\u002Frecurrences":3236,"\u002Falgorithms\u002Ffoundations\u002Famortized-analysis":3240,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fmergesort":3244,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fquicksort":3249,"\u002Falgorithms\u002Fdivide-and-conquer\u002Fselection":3253,"\u002Falgorithms\u002Fdivide-and-conquer\u002Ffast-multiplication":3257,"\u002Falgorithms\u002Fsorting\u002Fheaps-and-heapsort":3261,"\u002Falgorithms\u002Fsorting\u002Fsorting-lower-bounds":3266,"\u002Falgorithms\u002Fsorting\u002Flinear-time-sorting":3270,"\u002Falgorithms\u002Fsorting\u002Fexternal-sorting":3274,"\u002Falgorithms\u002Fdata-structures\u002Felementary-structures":3278,"\u002Falgorithms\u002Fdata-structures\u002Fhash-tables":3283,"\u002Falgorithms\u002Fdata-structures\u002Fbinary-search-trees":3287,"\u002Falgorithms\u002Fdata-structures\u002Favl-trees":3291,"\u002Falgorithms\u002Fdata-structures\u002Fbalanced-trees":3295,"\u002Falgorithms\u002Fdata-structures\u002Funion-find":3299,"\u002Falgorithms\u002Fdata-structures\u002Ffenwick-and-segment-trees":3303,"\u002Falgorithms\u002Fdata-structures\u002Fspatial-data-structures":3307,"\u002Falgorithms\u002Fdata-structures\u002Fskip-lists-and-probabilistic-structures":3311,"\u002Falgorithms\u002Fdata-structures\u002Fb-trees":3315,"\u002Falgorithms\u002Fdata-structures\u002Fdata-stream-algorithms":3319,"\u002Falgorithms\u002Fdata-structures\u002Fstreaming-sketches":3323,"\u002Falgorithms\u002Fsequences\u002Ftwo-pointers-and-windows":3327,"\u002Falgorithms\u002Fsequences\u002Fprefix-sums":3332,"\u002Falgorithms\u002Fsequences\u002Fmonotonic-stacks":3336,"\u002Falgorithms\u002Fsequences\u002Fbinary-search-on-the-answer":3340,"\u002Falgorithms\u002Fsequences\u002Fstring-matching":3344,"\u002Falgorithms\u002Fsequences\u002Fkmp-and-z-function":3348,"\u002Falgorithms\u002Fsequences\u002Ftries":3352,"\u002Falgorithms\u002Fsequences\u002Fsuffix-arrays-and-aho-corasick":3356,"\u002Falgorithms\u002Fgraphs\u002Frepresentations-and-traversal":3360,"\u002Falgorithms\u002Fgraphs\u002Fdepth-first-search":3365,"\u002Falgorithms\u002Fgraphs\u002Ftopological-sort-and-scc":3369,"\u002Falgorithms\u002Fgraphs\u002Fminimum-spanning-trees":3373,"\u002Falgorithms\u002Fgraphs\u002Fkruskal-and-prim":3377,"\u002Falgorithms\u002Fgraphs\u002Fshortest-paths":3381,"\u002Falgorithms\u002Fgraphs\u002Fall-pairs-and-negative-weights":3385,"\u002Falgorithms\u002Fgraphs\u002Fnetwork-flow":3389,"\u002Falgorithms\u002Fgraphs\u002Fmax-flow-min-cut":3393,"\u002Falgorithms\u002Fgraphs\u002Fbridges-and-articulation-points":3397,"\u002Falgorithms\u002Fgraphs\u002Flowest-common-ancestor":3401,"\u002Falgorithms\u002Fgraphs\u002Ftwo-sat":3405,"\u002Falgorithms\u002Fgraphs\u002Feulerian-tours":3409,"\u002Falgorithms\u002Fgraphs\u002Fbipartite-matching":3413,"\u002Falgorithms\u002Fgreedy\u002Fthe-greedy-method":3417,"\u002Falgorithms\u002Fgreedy\u002Fscheduling-and-intervals":3422,"\u002Falgorithms\u002Fgreedy\u002Fhuffman-codes":3426,"\u002Falgorithms\u002Fgreedy\u002Fmatroids":3430,"\u002Falgorithms\u002Fgreedy\u002Fstable-matching":3434,"\u002Falgorithms\u002Fdynamic-programming\u002Fprinciples":3438,"\u002Falgorithms\u002Fdynamic-programming\u002Fsequence-dp":3443,"\u002Falgorithms\u002Fdynamic-programming\u002Flongest-increasing-subsequence":3447,"\u002Falgorithms\u002Fdynamic-programming\u002Fknapsack":3451,"\u002Falgorithms\u002Fdynamic-programming\u002Fcoin-change-and-unbounded":3455,"\u002Falgorithms\u002Fdynamic-programming\u002Finterval-dp":3459,"\u002Falgorithms\u002Fdynamic-programming\u002Ftree-dp":3463,"\u002Falgorithms\u002Fdynamic-programming\u002Fbitmask-dp":3467,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-optimizations":3471,"\u002Falgorithms\u002Fdynamic-programming\u002Fdp-on-graphs":3475,"\u002Falgorithms\u002Fdynamic-programming\u002Fdigit-and-probability-dp":3479,"\u002Falgorithms\u002Fbacktracking\u002Fbacktracking-fundamentals":3483,"\u002Falgorithms\u002Fbacktracking\u002Fconstraint-search":3488,"\u002Falgorithms\u002Fbacktracking\u002Fbranch-and-bound":3492,"\u002Falgorithms\u002Fbacktracking\u002Fgraph-backtracking":3496,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fnumber-theory-basics":3500,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmodular-exponentiation-and-primality":3505,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fsieve-and-factorization":3509,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fcombinatorics":3513,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fmatrix-exponentiation":3517,"\u002Falgorithms\u002Fmathematical-algorithms\u002Ffast-fourier-transform":3521,"\u002Falgorithms\u002Fmathematical-algorithms\u002Fgradient-descent":3525,"\u002Falgorithms\u002Fcomputational-geometry\u002Fgeometric-primitives":3529,"\u002Falgorithms\u002Fcomputational-geometry\u002Fconvex-hull":3534,"\u002Falgorithms\u002Fcomputational-geometry\u002Fsweep-line":3538,"\u002Falgorithms\u002Fcomputational-geometry\u002Fpolygons-and-proximity":3542,"\u002Falgorithms\u002Fintractability\u002Fp-np-reductions":3546,"\u002Falgorithms\u002Fintractability\u002Fnp-completeness":3551,"\u002Falgorithms\u002Fintractability\u002Fcoping-with-hardness":3555,"\u002Falgorithms\u002Fintractability\u002Fapproximation-algorithms":3559,"\u002Falgorithms":3563,"\u002Fcalculus\u002Flimits-and-continuity\u002Ffunctions-and-models":3566,"\u002Fcalculus\u002Flimits-and-continuity\u002Fthe-limit-of-a-function":3571,"\u002Fcalculus\u002Flimits-and-continuity\u002Flimit-laws-and-the-precise-definition":3575,"\u002Fcalculus\u002Flimits-and-continuity\u002Fcontinuity":3579,"\u002Fcalculus\u002Fderivatives\u002Fthe-derivative-and-rates-of-change":3583,"\u002Fcalculus\u002Fderivatives\u002Fdifferentiation-rules-and-the-chain-rule":3588,"\u002Fcalculus\u002Fderivatives\u002Fimplicit-differentiation-and-related-rates":3592,"\u002Fcalculus\u002Fderivatives\u002Flinear-approximations-and-differentials":3596,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fextrema-and-the-mean-value-theorem":3600,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fhow-derivatives-shape-a-graph":3605,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fcurve-sketching-and-optimization":3609,"\u002Fcalculus\u002Fapplications-of-derivatives\u002Fnewtons-method-and-antiderivatives":3613,"\u002Fcalculus\u002Fintegrals\u002Farea-and-the-definite-integral":3617,"\u002Fcalculus\u002Fintegrals\u002Fthe-fundamental-theorem-of-calculus":3622,"\u002Fcalculus\u002Fintegrals\u002Fthe-substitution-rule":3626,"\u002Fcalculus\u002Fapplications-of-integration\u002Fareas-and-volumes":3630,"\u002Fcalculus\u002Fapplications-of-integration\u002Fwork-average-value-and-arc-length":3635,"\u002Fcalculus\u002Fapplications-of-integration\u002Fphysics-economics-and-probability":3639,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Finverse-functions-logarithms-and-exponentials":3643,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Fgrowth-decay-inverse-trig-and-hyperbolic-functions":3648,"\u002Fcalculus\u002Fexponential-logarithmic-and-inverse-functions\u002Flhospitals-rule":3652,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fintegration-by-parts":3656,"\u002Fcalculus\u002Ftechniques-of-integration\u002Ftrigonometric-integrals-and-substitution":3661,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fpartial-fractions-and-integration-strategy":3665,"\u002Fcalculus\u002Ftechniques-of-integration\u002Fapproximate-and-improper-integrals":3669,"\u002Fcalculus\u002Fparametric-and-polar\u002Fparametric-curves-and-their-calculus":3673,"\u002Fcalculus\u002Fparametric-and-polar\u002Fpolar-coordinates":3678,"\u002Fcalculus\u002Fparametric-and-polar\u002Fconic-sections":3682,"\u002Fcalculus\u002Fsequences-and-series\u002Fsequences":3686,"\u002Fcalculus\u002Fsequences-and-series\u002Fseries-and-the-integral-test":3691,"\u002Fcalculus\u002Fsequences-and-series\u002Fthe-convergence-tests":3695,"\u002Fcalculus\u002Fsequences-and-series\u002Fpower-series":3699,"\u002Fcalculus\u002Fsequences-and-series\u002Ftaylor-and-maclaurin-series":3703,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvectors-and-the-dot-product":3707,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fthe-cross-product-lines-and-planes":3712,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fcylinders-and-quadric-surfaces":3716,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Fvector-functions-and-space-curves":3720,"\u002Fcalculus\u002Fvectors-and-space-curves\u002Farc-length-curvature-and-motion":3724,"\u002Fcalculus\u002Fpartial-derivatives\u002Ffunctions-of-several-variables":3728,"\u002Fcalculus\u002Fpartial-derivatives\u002Fpartial-derivatives":3733,"\u002Fcalculus\u002Fpartial-derivatives\u002Ftangent-planes-and-the-chain-rule":3736,"\u002Fcalculus\u002Fpartial-derivatives\u002Fdirectional-derivatives-and-the-gradient":3740,"\u002Fcalculus\u002Fpartial-derivatives\u002Foptimization-and-lagrange-multipliers":3744,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fdouble-integrals":3748,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Ftriple-integrals-and-coordinate-systems":3753,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fvector-fields-and-line-integrals":3757,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fgreens-theorem-curl-and-divergence":3761,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fsurface-integrals":3765,"\u002Fcalculus\u002Fmultiple-integrals-and-vector-calculus\u002Fstokes-and-the-divergence-theorem":3769,"\u002Fcalculus":3773,"\u002Fmechanics\u002Ffoundations\u002Fmeasurement-and-dimensions":3776,"\u002Fmechanics\u002Ffoundations\u002Fvector-algebra":3780,"\u002Fmechanics\u002Fkinematics\u002Fone-dimensional-motion":3784,"\u002Fmechanics\u002Fkinematics\u002Fmotion-graphs":3789,"\u002Fmechanics\u002Fkinematics\u002Fprojectile-motion":3793,"\u002Fmechanics\u002Fkinematics\u002Frelative-motion":3797,"\u002Fmechanics\u002Fkinematics\u002Fcircular-motion":3801,"\u002Fmechanics\u002Fdynamics\u002Fnewtons-laws":3805,"\u002Fmechanics\u002Fdynamics\u002Ffree-body-diagrams":3810,"\u002Fmechanics\u002Fdynamics\u002Ffriction-and-curved-motion":3814,"\u002Fmechanics\u002Fdynamics\u002Fnumerical-dynamics":3818,"\u002Fmechanics\u002Fdynamics\u002Fcenter-of-mass-systems":3822,"\u002Fmechanics\u002Fenergy\u002Fwork-and-kinetic-energy":3826,"\u002Fmechanics\u002Fenergy\u002Fpotential-energy":3831,"\u002Fmechanics\u002Fenergy\u002Fmultiparticle-work":3835,"\u002Fmechanics\u002Fenergy\u002Fmass-energy-and-binding":3839,"\u002Fmechanics\u002Fenergy\u002Fphotons-and-quantization":3843,"\u002Fmechanics\u002Fmomentum\u002Fmomentum-and-collisions":3847,"\u002Fmechanics\u002Fmomentum\u002Fcenter-of-mass-collisions":3852,"\u002Fmechanics\u002Fmomentum\u002Frocket-propulsion":3856,"\u002Fmechanics\u002Frotation\u002Frotational-inertia":3860,"\u002Fmechanics\u002Frotation\u002Frotational-dynamics":3865,"\u002Fmechanics\u002Frotation\u002Frolling-motion":3869,"\u002Fmechanics\u002Frotation\u002Fangular-momentum":3873,"\u002Fmechanics\u002Frotation\u002Frolling-resistance":3877,"\u002Fmechanics\u002Frotation\u002Fgyroscopic-precession":3881,"\u002Fmechanics\u002Fgravity-and-matter\u002Fkeplerian-orbits":3885,"\u002Fmechanics\u002Fgravity-and-matter\u002Fgravitational-fields":3890,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstatic-equilibrium":3894,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-statics":3898,"\u002Fmechanics\u002Fgravity-and-matter\u002Ffluid-flow":3902,"\u002Fmechanics\u002Fgravity-and-matter\u002Forbital-motion":3906,"\u002Fmechanics\u002Fgravity-and-matter\u002Fstress-and-elasticity":3910,"\u002Fmechanics\u002Foscillations-waves\u002Fdamped-oscillators":3914,"\u002Fmechanics\u002Foscillations-waves\u002Ftravelling-waves":3919,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-superposition":3923,"\u002Fmechanics\u002Foscillations-waves\u002Fstanding-waves":3927,"\u002Fmechanics\u002Foscillations-waves\u002Fsound-waves":3931,"\u002Fmechanics\u002Foscillations-waves\u002Fdoppler-effect":3935,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-packets":3939,"\u002Fmechanics\u002Foscillations-waves\u002Fbeats-and-coupling":3943,"\u002Fmechanics\u002Foscillations-waves\u002Fsimple-harmonic-motion":3947,"\u002Fmechanics\u002Foscillations-waves\u002Fpendulum-motion":3951,"\u002Fmechanics\u002Foscillations-waves\u002Fdriven-oscillators":3955,"\u002Fmechanics\u002Foscillations-waves\u002Fwave-boundaries":3959,"\u002Fmechanics\u002Fthermodynamics\u002Fkinetic-theory-of-ideal-gases":3963,"\u002Fmechanics\u002Fthermodynamics\u002Ffirst-law-of-thermodynamics":3968,"\u002Fmechanics\u002Fthermodynamics\u002Fentropy-and-the-second-law":3972,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-processes":3976,"\u002Fmechanics\u002Fthermodynamics\u002Fphase-changes":3980,"\u002Fmechanics\u002Fthermodynamics\u002Fthermal-machines":3984,"\u002Fmechanics":3988,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcharge-and-conductors":3991,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Fcoulombs-law":3996,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-and-force":4000,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-field-maps":4004,"\u002Felectricity-and-magnetism\u002Felectric-fields\u002Felectric-dipoles":4008,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fcontinuous-charge-fields":4012,"\u002Felectricity-and-magnetism\u002Fcontinuous-charge-distributions\u002Fgauss-law-and-conductors":4017,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpoint-charge-potential":4021,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fpotential-gradients-and-equipotentials":4026,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Felectrostatic-energy-and-pressure":4030,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Flaplace-boundary-problems":4034,"\u002Felectricity-and-magnetism\u002Felectric-potential\u002Fcontinuous-charge-potentials":4038,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitance-fundamentals":4042,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-networks":4047,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fcapacitor-energy-and-force":4051,"\u002Felectricity-and-magnetism\u002Fcapacitance\u002Fdielectric-polarization-and-breakdown":4055,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fcurrent-and-resistance":4059,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Fkirchhoff-network-analysis":4064,"\u002Felectricity-and-magnetism\u002Fdirect-current-circuits\u002Frc-transients":4068,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-trajectories":4072,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fhall-effect":4077,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-force-on-conductors":4081,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmagnetic-dipoles":4085,"\u002Felectricity-and-magnetism\u002Fmagnetic-field\u002Fmass-spectrometry":4089,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmoving-charge-fields":4093,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fbiot-savart-law":4098,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fcircular-current-loops":4102,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Famperes-law":4106,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fgauss-law-for-magnetism":4110,"\u002Felectricity-and-magnetism\u002Fmagnetic-sources\u002Fmagnetic-materials":4114,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-flux":4118,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Ffaradays-law":4123,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Flenzs-law":4127,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmotional-emf":4131,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Feddy-currents":4135,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fself-inductance":4139,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Fmagnetic-energy":4143,"\u002Felectricity-and-magnetism\u002Felectromagnetic-induction\u002Frl-circuits":4147,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-fundamentals":4151,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Freactance":4156,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Frlc-resonance":4160,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Fac-power":4164,"\u002Felectricity-and-magnetism\u002Falternating-current\u002Ftransformers":4168,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdisplacement-current":4172,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-waves":4177,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Felectromagnetic-momentum":4181,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fdipole-radiation":4185,"\u002Felectricity-and-magnetism\u002Fmaxwell-electromagnetic-waves\u002Fpolarization":4189,"\u002Felectricity-and-magnetism\u002Foptics\u002Freflection-and-refraction":4193,"\u002Felectricity-and-magnetism\u002Foptics\u002Fthin-lenses":4198,"\u002Felectricity-and-magnetism\u002Foptics\u002Fspherical-mirrors":4202,"\u002Felectricity-and-magnetism":4206,"\u002Flinear-algebra\u002Flinear-systems\u002Fsystems-and-echelon-forms":4209,"\u002Flinear-algebra\u002Flinear-systems\u002Fvector-and-matrix-equations":4214,"\u002Flinear-algebra\u002Flinear-systems\u002Fsolution-sets-and-applications":4218,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-independence":4222,"\u002Flinear-algebra\u002Flinear-systems\u002Flinear-transformations":4226,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-operations":4230,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fmatrix-inverse-and-invertibility":4235,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fpartitioned-matrices-and-lu":4239,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fsubspaces-dimension-rank":4243,"\u002Flinear-algebra\u002Fmatrix-algebra\u002Fapplications-leontief-and-graphics":4247,"\u002Flinear-algebra\u002Fdeterminants\u002Fdeterminants-and-cofactors":4251,"\u002Flinear-algebra\u002Fdeterminants\u002Fproperties-of-determinants":4256,"\u002Flinear-algebra\u002Fdeterminants\u002Fcramer-volume-and-area":4260,"\u002Flinear-algebra\u002Fvector-spaces\u002Fvector-spaces-and-subspaces":4264,"\u002Flinear-algebra\u002Fvector-spaces\u002Fnull-and-column-spaces":4269,"\u002Flinear-algebra\u002Fvector-spaces\u002Fbases-and-independent-sets":4273,"\u002Flinear-algebra\u002Fvector-spaces\u002Fcoordinate-systems":4277,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdimension-and-rank":4281,"\u002Flinear-algebra\u002Fvector-spaces\u002Fchange-of-basis":4285,"\u002Flinear-algebra\u002Fvector-spaces\u002Fdifference-equations-and-markov":4289,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-eigenvalues":4293,"\u002Flinear-algebra\u002Feigenvalues\u002Fthe-characteristic-equation":4298,"\u002Flinear-algebra\u002Feigenvalues\u002Fdiagonalization":4302,"\u002Flinear-algebra\u002Feigenvalues\u002Feigenvectors-and-linear-transformations":4306,"\u002Flinear-algebra\u002Feigenvalues\u002Fcomplex-eigenvalues":4310,"\u002Flinear-algebra\u002Feigenvalues\u002Fdynamical-systems":4314,"\u002Flinear-algebra\u002Feigenvalues\u002Fpower-method":4318,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-length-orthogonality":4322,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Forthogonal-sets-and-projections":4327,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fgram-schmidt-and-qr":4331,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-problems":4335,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Fleast-squares-applications":4339,"\u002Flinear-algebra\u002Forthogonality-least-squares\u002Finner-product-spaces":4343,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fdiagonalizing-symmetric-matrices":4347,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fquadratic-forms":4352,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fconstrained-optimization":4356,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsingular-value-decomposition":4360,"\u002Flinear-algebra\u002Fsymmetric-quadratic-svd\u002Fsvd-applications-pca-imaging":4364,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-thinking-and-matrix-computation":4368,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Flu-and-cholesky":4373,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fconditioning-and-floating-point":4377,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fstability-and-error-analysis":4381,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fqr-and-numerical-least-squares":4385,"\u002Flinear-algebra\u002Fnumerical-linear-algebra\u002Fnumerical-eigenvalues-and-svd":4389,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-combinations":4393,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Faffine-independence-and-barycentric-coordinates":4398,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fconvex-combinations-and-convex-sets":4402,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fhyperplanes-and-polytopes":4406,"\u002Flinear-algebra\u002Fgeometry-of-vector-spaces\u002Fcurves-and-surfaces":4410,"\u002Flinear-algebra":4414,"\u002Ftheory-of-computation":4417,"\u002Fcomputer-architecture\u002Ffoundations\u002Fbits-bytes-and-words":4420,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-representation":4424,"\u002Fcomputer-architecture\u002Ffoundations\u002Finteger-arithmetic":4428,"\u002Fcomputer-architecture\u002Ffoundations\u002Ffloating-point":4432,"\u002Fcomputer-architecture\u002Ffoundations\u002Fboolean-algebra-and-bit-manipulation":4436,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fthe-machines-view":4440,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fdata-movement":4445,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farithmetic-and-logic":4449,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fcontrol-flow":4453,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fprocedures":4457,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Farrays-structs-and-alignment":4461,"\u002Fcomputer-architecture\u002Fmachine-level-x86-64\u002Fmemory-layout-and-buffer-overflows":4465,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fwhat-an-isa-is":4469,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Finstruction-formats-and-operands":4474,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Faddressing-modes":4478,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fthe-y86-64-instruction-set":4482,"\u002Fcomputer-architecture\u002Finstruction-set-architecture\u002Fy86-64-programming":4486,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Ftransistors-gates-and-boolean-functions":4490,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fcombinational-logic-and-hcl":4495,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmultiplexers-decoders-and-the-alu":4499,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fmemory-elements-latches-flip-flops-and-clocking":4503,"\u002Fcomputer-architecture\u002Fdigital-logic\u002Fregister-files-and-random-access-memory":4507,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-fetch-decode-execute-cycle":4511,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fthe-seq-stages":4516,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fcontrol-logic-and-sequencing":4520,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Fassembling-seq":4524,"\u002Fcomputer-architecture\u002Fprocessor-design\u002Ftracing-a-program":4528,"\u002Fcomputer-architecture\u002Fpipelining\u002Fpipelining-principles":4532,"\u002Fcomputer-architecture\u002Fpipelining\u002Ffrom-seq-to-pipe":4537,"\u002Fcomputer-architecture\u002Fpipelining\u002Fdata-hazards-stalling-and-forwarding":4541,"\u002Fcomputer-architecture\u002Fpipelining\u002Fcontrol-hazards-and-branch-prediction":4545,"\u002Fcomputer-architecture\u002Fpipelining\u002Fthe-complete-pipe-processor":4549,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fstorage-technologies-and-the-latency-gap":4553,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Flocality":4558,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-memories-direct-mapped":4562,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fset-associative-and-write-policies":4566,"\u002Fcomputer-architecture\u002Fmemory-hierarchy\u002Fcache-performance-and-cache-friendly-code":4570,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Faddress-spaces-and-translation":4574,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fpage-tables-and-page-faults":4579,"\u002Fcomputer-architecture\u002Fvirtual-memory\u002Fthe-tlb-and-multi-level-page-tables":4583,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Fexceptional-control-flow":4587,"\u002Fcomputer-architecture\u002Fexceptions-and-io\u002Finterrupts-and-the-kernel":4592,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fprocesses-threads-and-parallelism":4596,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fhardware-multithreading":4601,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fcache-coherence":4605,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmemory-consistency-and-synchronization":4609,"\u002Fcomputer-architecture\u002Fmultithreading-and-multicore\u002Fmulticore-organization":4613,"\u002Fcomputer-architecture\u002Fcapstone\u002Fthe-whole-machine":4617,"\u002Fcomputer-architecture\u002Fcapstone\u002Fassembling-a-complete-cpu":4622,"\u002Fcomputer-architecture":4626,"\u002Fdifferential-equations\u002Ffoundations\u002Fmodels-and-direction-fields":4629,"\u002Fdifferential-equations\u002Ffoundations\u002Fclassification-and-terminology":4633,"\u002Fdifferential-equations\u002Ffirst-order\u002Flinear-first-order-integrating-factors":4637,"\u002Fdifferential-equations\u002Ffirst-order\u002Fseparable-and-exact":4642,"\u002Fdifferential-equations\u002Ffirst-order\u002Fmodeling-first-order":4646,"\u002Fdifferential-equations\u002Ffirst-order\u002Fautonomous-and-population-dynamics":4650,"\u002Fdifferential-equations\u002Ffirst-order\u002Fexistence-uniqueness-euler":4654,"\u002Fdifferential-equations\u002Ffirst-order\u002Ffirst-order-difference-equations":4658,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhomogeneous-constant-coefficients":4662,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fcomplex-and-repeated-roots":4667,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fnonhomogeneous-undetermined-coefficients":4671,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fvariation-of-parameters":4675,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fmechanical-electrical-vibrations":4679,"\u002Fdifferential-equations\u002Fsecond-order-linear\u002Fhigher-order-linear":4683,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fpower-series-ordinary-points":4687,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fregular-singular-frobenius":4692,"\u002Fdifferential-equations\u002Fseries-solutions\u002Fbessel-and-special-functions":4696,"\u002Fdifferential-equations\u002Flaplace\u002Flaplace-definition-ivps":4700,"\u002Fdifferential-equations\u002Flaplace\u002Fstep-impulse-convolution":4705,"\u002Fdifferential-equations\u002Fsystems\u002Fmatrices-eigenvalues-review":4709,"\u002Fdifferential-equations\u002Fsystems\u002Fconstant-coefficient-systems-phase-portraits":4714,"\u002Fdifferential-equations\u002Fsystems\u002Frepeated-eigenvalues-fundamental-matrices":4718,"\u002Fdifferential-equations\u002Fnumerical\u002Feuler-and-runge-kutta":4722,"\u002Fdifferential-equations\u002Fnumerical\u002Fmultistep-systems-stability":4727,"\u002Fdifferential-equations\u002Fnonlinear\u002Fphase-plane-autonomous-stability":4731,"\u002Fdifferential-equations\u002Fnonlinear\u002Flocally-linear-and-liapunov":4736,"\u002Fdifferential-equations\u002Fnonlinear\u002Fcompeting-species-predator-prey-limit-cycles":4740,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Ffourier-series":4744,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fheat-wave-laplace-equations":4749,"\u002Fdifferential-equations\u002Fpdes-fourier-bvp\u002Fsturm-liouville":4753,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fcalculus-of-variations":4757,"\u002Fdifferential-equations\u002Fhistory-variations\u002Fhistorical-notes":4762,"\u002Fdifferential-equations":4766,"\u002Frelativity\u002Ffoundations\u002Fspecial-relativity-postulates":4769,"\u002Frelativity\u002Ffoundations\u002Florentz-transformation-spacetime":4774,"\u002Frelativity\u002Ffoundations\u002Ftime-dilation-length-contraction":4778,"\u002Frelativity\u002Ffoundations\u002Frelativistic-momentum-energy":4782,"\u002Frelativity\u002Ffoundations\u002Fgeneral-relativity":4786,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fminkowski-spacetime-and-the-interval":4790,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Ffour-vectors-and-index-notation":4795,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fthe-lorentz-group-and-rapidity":4799,"\u002Frelativity\u002Fspacetime-and-the-lorentz-group\u002Fdoppler-aberration-and-appearance":4803,"\u002Frelativity\u002Frelativistic-dynamics\u002Ffour-momentum-force-and-accelerated-motion":4807,"\u002Frelativity\u002Frelativistic-dynamics\u002Fparticle-decays-and-two-body-kinematics":4812,"\u002Frelativity\u002Frelativistic-dynamics\u002Fcollisions-thresholds-and-the-cm-frame":4816,"\u002Frelativity\u002Frelativistic-dynamics\u002Fmandelstam-variables-and-invariants":4820,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ffour-current-and-the-four-potential":4824,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fthe-electromagnetic-field-tensor":4829,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Ftransformation-of-electric-and-magnetic-fields":4833,"\u002Frelativity\u002Fcovariant-electrodynamics\u002Fcovariant-maxwell-and-the-stress-energy-tensor":4837,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-equivalence-principle-formalized":4841,"\u002Frelativity\u002Fcurved-spacetime\u002Fmanifolds-vectors-and-the-metric":4846,"\u002Frelativity\u002Fcurved-spacetime\u002Fcovariant-derivative-and-christoffel-symbols":4850,"\u002Frelativity\u002Fcurved-spacetime\u002Fgeodesics-and-the-geodesic-equation":4854,"\u002Frelativity\u002Fcurved-spacetime\u002Fcurvature-riemann-and-geodesic-deviation":4858,"\u002Frelativity\u002Fcurved-spacetime\u002Fthe-einstein-field-equations":4862,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fthe-schwarzschild-metric":4866,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Fgeodesics-and-orbits-in-schwarzschild":4871,"\u002Frelativity\u002Fthe-schwarzschild-solution\u002Flight-bending-and-null-geodesics":4875,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fperihelion-precession-of-mercury":4879,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fdeflection-of-light-and-gravitational-lensing":4884,"\u002Frelativity\u002Ftests-of-general-relativity\u002Fgravitational-redshift-and-shapiro-delay":4888,"\u002Frelativity\u002Ftests-of-general-relativity\u002Frelativity-in-technology-gps":4892,"\u002Frelativity\u002Fblack-holes\u002Fhorizons-and-coordinate-singularities":4896,"\u002Frelativity\u002Fblack-holes\u002Frotating-and-charged-black-holes":4901,"\u002Frelativity\u002Fblack-holes\u002Fblack-hole-thermodynamics":4905,"\u002Frelativity\u002Fgravitational-waves\u002Flinearized-gravity-and-wave-solutions":4909,"\u002Frelativity\u002Fgravitational-waves\u002Fgeneration-and-the-quadrupole-formula":4914,"\u002Frelativity\u002Fgravitational-waves\u002Fdetection-ligo-and-the-first-events":4918,"\u002Frelativity\u002Fcosmological-bridge\u002Fthe-cosmological-principle-and-flrw-metric":4922,"\u002Frelativity\u002Fcosmological-bridge\u002Ffriedmann-equations-and-cosmic-dynamics":4927,"\u002Frelativity":4931,"\u002Fphysical-computing":4934,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fblackbody-radiation-and-the-planck-quantum":4937,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-photoelectric-effect-and-the-photon":4942,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fx-rays-and-the-compton-effect":4946,"\u002Fquantum-mechanics\u002Fold-quantum-theory\u002Fthe-old-quantum-theory-bohr-and-sommerfeld":4950,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fde-broglie-waves-and-electron-diffraction":4954,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fwave-packets-and-the-probability-interpretation":4959,"\u002Fquantum-mechanics\u002Fmatter-waves\u002Fthe-uncertainty-principle":4963,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-schrodinger-equation-in-one-dimension":4967,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-free-particle-and-wave-packet-dynamics":4972,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fparticle-in-infinite-and-finite-square-wells":4976,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Foperators-expectation-values-and-the-harmonic-oscillator":4980,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fthe-dirac-delta-potential":4984,"\u002Fquantum-mechanics\u002Fwave-mechanics-1d\u002Fbarrier-penetration-and-quantum-tunneling":4988,"\u002Fquantum-mechanics\u002Fformalism\u002Fhilbert-space-and-dirac-notation":4992,"\u002Fquantum-mechanics\u002Fformalism\u002Fobservables-hermitian-operators-and-eigenvalues":4997,"\u002Fquantum-mechanics\u002Fformalism\u002Fthe-postulates-and-quantum-measurement":5001,"\u002Fquantum-mechanics\u002Fformalism\u002Fposition-momentum-and-continuous-spectra":5005,"\u002Fquantum-mechanics\u002Fformalism\u002Fcommutators-and-the-generalized-uncertainty-principle":5009,"\u002Fquantum-mechanics\u002Fformalism\u002Ftime-evolution-schrodinger-and-heisenberg-pictures":5013,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fladder-operators-and-the-number-states":5017,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fcoherent-and-squeezed-states":5022,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fsymmetries-generators-and-conservation-laws":5026,"\u002Fquantum-mechanics\u002Foscillator-and-symmetry\u002Fparity-time-reversal-and-discrete-symmetries":5030,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Forbital-angular-momentum-and-spherical-harmonics":5034,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Fthe-angular-momentum-algebra":5038,"\u002Fquantum-mechanics\u002Fangular-momentum\u002Faddition-of-angular-momenta-and-clebsch-gordan":5042,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-schrodinger-equation-in-three-dimensions":5046,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-hydrogen-atom":5051,"\u002Fquantum-mechanics\u002Fcentral-potentials\u002Fthe-isotropic-oscillator-and-hidden-symmetry":5055,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-half-pauli-matrices-and-stern-gerlach":5059,"\u002Fquantum-mechanics\u002Fspin\u002Fspin-in-a-magnetic-field-precession-and-resonance":5064,"\u002Fquantum-mechanics\u002Fspin\u002Ftwo-level-systems-and-the-bloch-sphere":5068,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fidentical-particles-and-exchange-symmetry":5072,"\u002Fquantum-mechanics\u002Fidentical-particles\u002Fthe-pauli-principle-atoms-and-the-periodic-table":5077,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ftime-independent-perturbation-theory":5081,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Ffine-structure-and-the-real-hydrogen-atom":5086,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-zeeman-and-stark-effects":5090,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-variational-method":5094,"\u002Fquantum-mechanics\u002Fapproximation-methods\u002Fthe-wkb-approximation":5098,"\u002Fquantum-mechanics":5102,"\u002Freal-analysis\u002Ffoundations\u002Fsets-logic-functions":5105,"\u002Freal-analysis\u002Ffoundations\u002Fordered-fields-completeness":5110,"\u002Freal-analysis\u002Ffoundations\u002Fabsolute-value-bounds":5114,"\u002Freal-analysis\u002Ffoundations\u002Fintervals-uncountability":5118,"\u002Freal-analysis\u002Fsequences-series\u002Fsequences-limits":5122,"\u002Freal-analysis\u002Fsequences-series\u002Flimit-laws-monotone":5127,"\u002Freal-analysis\u002Fsequences-series\u002Flimsup-bolzano-weierstrass":5131,"\u002Freal-analysis\u002Fsequences-series\u002Fcauchy-completeness":5135,"\u002Freal-analysis\u002Fsequences-series\u002Fseries-convergence":5139,"\u002Freal-analysis\u002Fsequences-series\u002Fabsolute-conditional-rearrangement":5143,"\u002Freal-analysis\u002Fmetric-spaces\u002Fmetric-spaces-norms":5147,"\u002Freal-analysis\u002Fmetric-spaces\u002Fopen-closed-sets":5152,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconvergence-completeness":5156,"\u002Freal-analysis\u002Fmetric-spaces\u002Fcompactness":5160,"\u002Freal-analysis\u002Fmetric-spaces\u002Fconnectedness":5164,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-of-functions":5168,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuous-functions":5172,"\u002Freal-analysis\u002Fcontinuity\u002Fevt-ivt":5176,"\u002Freal-analysis\u002Fcontinuity\u002Funiform-continuity":5180,"\u002Freal-analysis\u002Fcontinuity\u002Fcontinuity-metric-spaces":5184,"\u002Freal-analysis\u002Fcontinuity\u002Flimits-infinity-monotone":5188,"\u002Freal-analysis\u002Fdifferentiation\u002Fthe-derivative":5192,"\u002Freal-analysis\u002Fdifferentiation\u002Fmean-value-theorem":5197,"\u002Freal-analysis\u002Fdifferentiation\u002Ftaylors-theorem":5201,"\u002Freal-analysis\u002Fdifferentiation\u002Finverse-function-1d":5205,"\u002Freal-analysis\u002Friemann-integration\u002Fdarboux-integral":5209,"\u002Freal-analysis\u002Friemann-integration\u002Fintegrability-classes":5214,"\u002Freal-analysis\u002Friemann-integration\u002Fproperties-of-the-integral":5218,"\u002Freal-analysis\u002Friemann-integration\u002Ffundamental-theorem":5222,"\u002Freal-analysis\u002Friemann-integration\u002Flog-exp-improper":5225,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpointwise-uniform-convergence":5229,"\u002Freal-analysis\u002Ffunction-sequences\u002Finterchange-of-limits":5234,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpower-series-weierstrass":5238,"\u002Freal-analysis\u002Ffunction-sequences\u002Fpicard-ode":5242,"\u002Freal-analysis\u002Fseveral-variables\u002Fdifferentiability-rn":5246,"\u002Freal-analysis\u002Fseveral-variables\u002Fgradient-chain-rule":5251,"\u002Freal-analysis\u002Fseveral-variables\u002Fhigher-derivatives-taylor-extrema":5255,"\u002Freal-analysis\u002Fseveral-variables\u002Finverse-implicit-theorems":5259,"\u002Freal-analysis\u002Fseveral-variables\u002Fmultiple-integrals":5263,"\u002Freal-analysis":5267,"\u002Fabstract-algebra\u002Ffoundations\u002Fsets-functions-relations":5270,"\u002Fabstract-algebra\u002Ffoundations\u002Fintegers-and-modular-arithmetic":5274,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fgroup-axioms-and-first-examples":5278,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fdihedral-and-symmetric-groups":5283,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fmatrix-and-quaternion-groups":5287,"\u002Fabstract-algebra\u002Fgroups-and-symmetry\u002Fhomomorphisms-and-group-actions":5291,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fsubgroups-and-substructures":5295,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcyclic-groups":5300,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fgeneration-and-subgroup-lattices":5304,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcosets-lagrange-and-normal-subgroups":5308,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fisomorphism-theorems":5312,"\u002Fabstract-algebra\u002Fsubgroups-and-quotients\u002Fcomposition-series-and-the-alternating-group":5316,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Factions-and-cayleys-theorem":5320,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fconjugation-and-the-class-equation":5325,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fsylow-theorems":5329,"\u002Fabstract-algebra\u002Fgroup-actions-and-sylow\u002Fautomorphisms-and-simple-groups":5333,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fdirect-products-and-finite-abelian-groups":5337,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fsemidirect-products":5342,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fnilpotent-and-solvable-groups":5346,"\u002Fabstract-algebra\u002Fproducts-and-group-structure\u002Fclassifying-small-groups":5350,"\u002Fabstract-algebra\u002Fring-theory\u002Frings-definitions-and-examples":5354,"\u002Fabstract-algebra\u002Fring-theory\u002Fideals-quotients-and-homomorphisms":5359,"\u002Fabstract-algebra\u002Fring-theory\u002Ffractions-and-the-chinese-remainder-theorem":5363,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Feuclidean-domains-pids-ufds":5367,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fpolynomial-rings-over-fields":5372,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Fgauss-lemma-and-unique-factorization":5376,"\u002Fabstract-algebra\u002Ffactorization-and-polynomials\u002Firreducibility-criteria-and-groebner":5380,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fintroduction-to-modules":5384,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ffree-modules-and-direct-sums":5389,"\u002Fabstract-algebra\u002Fmodule-theory\u002Ftensor-products-and-exact-sequences":5393,"\u002Fabstract-algebra\u002Fmodule-theory\u002Fvector-spaces-and-linear-maps":5397,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fstructure-theorem-over-pids":5401,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Frational-canonical-form":5406,"\u002Fabstract-algebra\u002Fmodules-over-pids\u002Fjordan-canonical-form":5410,"\u002Fabstract-algebra\u002Ffield-theory\u002Ffield-extensions-and-algebraic-elements":5414,"\u002Fabstract-algebra\u002Ffield-theory\u002Fstraightedge-and-compass-constructions":5419,"\u002Fabstract-algebra\u002Ffield-theory\u002Fsplitting-fields-and-algebraic-closure":5423,"\u002Fabstract-algebra\u002Ffield-theory\u002Fseparable-and-cyclotomic-extensions":5427,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fthe-galois-correspondence":5431,"\u002Fabstract-algebra\u002Fgalois-theory\u002Ffinite-fields":5436,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fcyclotomic-and-abelian-extensions":5440,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fgalois-groups-of-polynomials":5444,"\u002Fabstract-algebra\u002Fgalois-theory\u002Fsolvability-by-radicals-and-the-quintic":5448,"\u002Fabstract-algebra\u002Fcapstone\u002Fcommutative-algebra-and-algebraic-geometry":5452,"\u002Fabstract-algebra\u002Fcapstone\u002Frepresentation-and-character-theory":5457,"\u002Fabstract-algebra":5461,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fatomic-spectra-rutherford":5464,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-model-hydrogen":5469,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fx-ray-spectra-franck-hertz":5473,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fbohr-sommerfeld-old-quantum-theory":5477,"\u002Fatomic-physics\u002Fearly-models-and-old-quantum-theory\u002Fold-quantum-theory-limits-wkb":5481,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fschrodinger-3d-hydrogen":5485,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fhydrogen-wave-functions":5490,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fradial-equation-in-full":5494,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fsymmetry-degeneracy-runge-lenz":5498,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fexpectation-values-virial":5502,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Fquantum-defects-alkali-spectra":5506,"\u002Fatomic-physics\u002Fquantum-hydrogen-atom\u002Frydberg-atoms":5510,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Frelativistic-kinetic-correction":5514,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fspin-orbit-thomas-precession":5519,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdarwin-term-fine-structure-formula":5523,"\u002Fatomic-physics\u002Ffine-structure-and-the-dirac-atom\u002Fdirac-equation-hydrogen":5527,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Flamb-shift-qed":5531,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fhyperfine-structure-21cm":5536,"\u002Fatomic-physics\u002Fqed-corrections-and-hyperfine-structure\u002Fnuclear-effects-isotope-shift":5540,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fperiodic-table-atomic-spectra":5544,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fcentral-field-self-consistent":5549,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fidentical-particles-hartree-fock":5553,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhelium-two-electron-atom":5557,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fls-jj-coupling-term-symbols":5561,"\u002Fatomic-physics\u002Fmany-electron-atoms\u002Fhund-rules-ground-terms":5565,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fzeeman-effect":5569,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fpaschen-back-intermediate":5574,"\u002Fatomic-physics\u002Fatoms-in-external-fields\u002Fstark-effect-polarizability":5578,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Ftime-dependent-perturbation-golden-rule":5582,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fdipole-approximation-einstein-coefficients":5587,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Fselection-rules-forbidden-transitions":5591,"\u002Fatomic-physics\u002Fradiative-transitions-and-line-shapes\u002Flifetimes-and-line-shapes":5595,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Flaser-principles":5599,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fspectroscopy-techniques":5604,"\u002Fatomic-physics\u002Flasers-and-spectroscopy\u002Fline-catalog-nist-asd":5608,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Flaser-cooling-doppler":5612,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fsub-doppler-trapping":5617,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Fbose-einstein-condensation":5621,"\u002Fatomic-physics\u002Fmodern-atomic-physics\u002Foptical-clocks-precision":5625,"\u002Fatomic-physics":5629,"\u002Fdatabases":5632,"\u002Fcategory-theory\u002Ffoundations\u002Fwhat-is-a-category":5635,"\u002Fcategory-theory\u002Ffoundations\u002Fexamples-of-categories":5639,"\u002Fcategory-theory\u002Ffoundations\u002Fspecial-morphisms":5643,"\u002Fcategory-theory\u002Ffoundations\u002Ffunctors":5647,"\u002Fcategory-theory\u002Ffoundations\u002Fnatural-transformations":5651,"\u002Fcategory-theory\u002Ffoundations\u002Fsize-and-set-theory":5655,"\u002Fcategory-theory\u002Funiversal-properties\u002Funiversal-properties":5659,"\u002Fcategory-theory\u002Funiversal-properties\u002Fproducts-and-coproducts":5664,"\u002Fcategory-theory\u002Funiversal-properties\u002Fconstructions-on-categories":5668,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Frepresentable-functors":5672,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-lemma":5677,"\u002Fcategory-theory\u002Frepresentables-yoneda\u002Fyoneda-consequences":5681,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits":5685,"\u002Fcategory-theory\u002Flimits-colimits\u002Fproducts-equalizers-pullbacks":5690,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcolimits":5694,"\u002Fcategory-theory\u002Flimits-colimits\u002Fcomputing-limits":5698,"\u002Fcategory-theory\u002Flimits-colimits\u002Flimits-and-functors":5702,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions":5706,"\u002Fcategory-theory\u002Fadjunctions\u002Funits-and-counits":5711,"\u002Fcategory-theory\u002Fadjunctions\u002Fadjunctions-via-universal-arrows":5715,"\u002Fcategory-theory\u002Fadjunctions\u002Ffree-forgetful-adjunctions":5719,"\u002Fcategory-theory\u002Fadjoints-limits\u002Flimits-via-adjoints":5723,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fpresheaf-limits-colimits":5728,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoints-preserve-limits":5732,"\u002Fcategory-theory\u002Fadjoints-limits\u002Fadjoint-functor-theorem":5736,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fmonads":5740,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-eilenberg-moore":5745,"\u002Fcategory-theory\u002Fmonads-algebras\u002Fkleisli-and-programming":5749,"\u002Fcategory-theory\u002Fmonads-algebras\u002Falgebras-for-endofunctors":5753,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Fcartesian-closed-categories":5757,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Flambda-calculus-correspondence":5762,"\u002Fcategory-theory\u002Fcartesian-closed-lambda\u002Ffixed-points-and-recursion":5766,"\u002Fcategory-theory":5770,"\u002Fdeep-learning\u002Fmathematical-background\u002Flinear-algebra-for-deep-learning":5773,"\u002Fdeep-learning\u002Fmathematical-background\u002Fprobability-and-information-theory":5777,"\u002Fdeep-learning\u002Fmathematical-background\u002Fnumerical-computation":5781,"\u002Fdeep-learning\u002Fmathematical-background\u002Fcalculus":5785,"\u002Fdeep-learning\u002Ffoundations\u002Fwhat-is-deep-learning":5788,"\u002Fdeep-learning\u002Ffoundations\u002Fmachine-learning-refresher":5792,"\u002Fdeep-learning\u002Ffoundations\u002Flinear-models-and-the-perceptron":5796,"\u002Fdeep-learning\u002Fneural-networks\u002Fthe-multilayer-perceptron":5800,"\u002Fdeep-learning\u002Fneural-networks\u002Factivation-functions":5805,"\u002Fdeep-learning\u002Fneural-networks\u002Funiversal-approximation":5809,"\u002Fdeep-learning\u002Fneural-networks\u002Fbackpropagation":5813,"\u002Fdeep-learning\u002Fneural-networks\u002Floss-functions-and-output-units":5817,"\u002Fdeep-learning\u002Foptimization\u002Fgradient-descent-and-sgd":5821,"\u002Fdeep-learning\u002Foptimization\u002Fmomentum-and-adaptive-methods":5826,"\u002Fdeep-learning\u002Foptimization\u002Finitialization":5830,"\u002Fdeep-learning\u002Foptimization\u002Fthe-optimization-landscape":5834,"\u002Fdeep-learning\u002Foptimization\u002Fsecond-order-and-approximate-methods":5838,"\u002Fdeep-learning\u002Fregularization\u002Fregularization-overview":5842,"\u002Fdeep-learning\u002Fregularization\u002Fdropout-and-data-augmentation":5847,"\u002Fdeep-learning\u002Fregularization\u002Fearly-stopping-and-parameter-sharing":5851,"\u002Fdeep-learning\u002Fregularization\u002Fnormalization":5855,"\u002Fdeep-learning\u002Farchitectures\u002Fconvolutional-networks":5859,"\u002Fdeep-learning\u002Farchitectures\u002Fcnn-architectures":5864,"\u002Fdeep-learning\u002Farchitectures\u002Frecurrent-networks":5868,"\u002Fdeep-learning\u002Farchitectures\u002Flstm-and-gru":5872,"\u002Fdeep-learning\u002Farchitectures\u002Fattention-and-transformers":5876,"\u002Fdeep-learning\u002Farchitectures\u002Fthe-transformer-architecture":5880,"\u002Fdeep-learning\u002Farchitectures\u002Ftransformers-in-practice":5884,"\u002Fdeep-learning\u002Farchitectures\u002Fgraph-neural-networks":5888,"\u002Fdeep-learning\u002Farchitectures\u002Fstate-space-models":5892,"\u002Fdeep-learning\u002Ftheory\u002Fgeneralization-theory":5896,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-robustness":5901,"\u002Fdeep-learning\u002Ftheory\u002Fadversarial-defenses":5905,"\u002Fdeep-learning\u002Ftheory\u002Fbayesian-and-ensemble-methods":5909,"\u002Fdeep-learning\u002Ftheory\u002Fdeep-equilibrium-models":5913,"\u002Fdeep-learning\u002Fgenerative-models\u002Flinear-factor-models":5917,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoencoders":5922,"\u002Fdeep-learning\u002Fgenerative-models\u002Fvariational-autoencoders":5926,"\u002Fdeep-learning\u002Fgenerative-models\u002Fgenerative-adversarial-networks":5930,"\u002Fdeep-learning\u002Fgenerative-models\u002Fautoregressive-and-normalizing-flows":5934,"\u002Fdeep-learning\u002Fgenerative-models\u002Fenergy-based-and-boltzmann-machines":5938,"\u002Fdeep-learning\u002Fgenerative-models\u002Fdiffusion-and-score-based-models":5942,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fstructured-probabilistic-models":5946,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fmonte-carlo-and-mcmc":5951,"\u002Fdeep-learning\u002Fprobabilistic-methods\u002Fapproximate-inference":5955,"\u002Fdeep-learning\u002Fpractical\u002Fpractical-methodology":5959,"\u002Fdeep-learning\u002Fpractical\u002Fhyperparameters-and-debugging":5964,"\u002Fdeep-learning\u002Fpractical\u002Frepresentation-learning":5968,"\u002Fdeep-learning\u002Fpractical\u002Ftransfer-learning":5972,"\u002Fdeep-learning\u002Fpractical\u002Fapplications":5976,"\u002Fdeep-learning\u002Fpractical\u002Fmodel-compression-and-distillation":5980,"\u002Fdeep-learning\u002Fpractical\u002Fmeta-learning-and-few-shot":5984,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Flarge-language-models":5988,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fscaling-inference-and-alignment":5993,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fseq2seq-pretraining-and-bart":5997,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ftext-to-text-transfer-and-conditional-generation":6001,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fspeech-and-audio-models":6005,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fself-supervised-speech-and-synthesis":6009,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fai-agents":6013,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fagent-memory-retrieval-and-orchestration":6017,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmixture-of-experts":6021,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Fmultimodal-models":6025,"\u002Fdeep-learning\u002Flarge-models-and-agents\u002Ffusion-and-vision-language-models":6029,"\u002Fdeep-learning\u002Freinforcement-learning\u002Ffoundations-of-reinforcement-learning":6033,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fmodel-free-prediction-and-control":6038,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fdeep-q-networks":6042,"\u002Fdeep-learning\u002Freinforcement-learning\u002Fpolicy-gradients-and-actor-critic":6046,"\u002Fdeep-learning\u002Freinforcement-learning\u002Frl-from-human-feedback":6050,"\u002Fdeep-learning":6054,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fequilibrium-state-variables-zeroth-law":6057,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Ffirst-law-heat-and-work":6061,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fsecond-law-entropy-and-the-carnot-bound":6065,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fthermodynamic-potentials-and-maxwell-relations":6069,"\u002Fstatistical-mechanics\u002Fthermodynamics\u002Fstability-response-functions-and-the-third-law":6073,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fclassical-statistics-and-equipartition":6077,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fphase-space-and-liouvilles-theorem":6082,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fensembles-and-the-equal-probability-postulate":6086,"\u002Fstatistical-mechanics\u002Ffoundations\u002Fstatistical-entropy-boltzmann-and-gibbs":6090,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fmicrocanonical-ensemble-and-entropy":6094,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fequilibrium-conditions-temperature-pressure-chemical-potential":6099,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Fideal-gas-phase-space-and-the-sackur-tetrode-entropy":6103,"\u002Fstatistical-mechanics\u002Fmicrocanonical\u002Ftwo-state-systems-paramagnets-and-negative-temperature":6107,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fcanonical-ensemble-and-the-boltzmann-distribution":6111,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fpartition-function-and-the-helmholtz-free-energy":6116,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fenergy-fluctuations-and-ensemble-equivalence":6120,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fthe-einstein-solid-and-harmonic-systems":6124,"\u002Fstatistical-mechanics\u002Fcanonical\u002Fparamagnetism-and-the-schottky-anomaly":6128,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fideal-gas-partition-function-and-the-gibbs-paradox":6132,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fequipartition-and-the-virial-theorem":6137,"\u002Fstatistical-mechanics\u002Fclassical-gas\u002Fmolecular-gases-rotation-and-vibration":6141,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fgrand-canonical-ensemble-and-the-grand-partition-function":6145,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fchemical-potential-fugacity-and-number-fluctuations":6150,"\u002Fstatistical-mechanics\u002Fgrand-canonical\u002Fensemble-summary-and-the-thermodynamic-web":6154,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fquantum-statistics-bose-einstein-and-fermi-dirac":6158,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fderiving-the-quantum-distributions":6163,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fthe-classical-limit-and-quantum-concentration":6167,"\u002Fstatistical-mechanics\u002Fquantum-statistics\u002Fideal-quantum-gases-general-framework":6171,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-and-the-fermion-gas":6175,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthe-photon-gas-and-plancks-radiation-law":6180,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fblackbody-thermodynamics-and-radiation-pressure":6184,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fphonons-and-the-debye-model":6188,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fbose-einstein-condensation-derived":6192,"\u002Fstatistical-mechanics\u002Fbose-systems\u002Fthermodynamics-of-the-bose-gas-and-superfluidity":6196,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fthe-ideal-fermi-gas-at-zero-temperature":6200,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fsommerfeld-expansion-and-electrons-in-metals":6205,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":6209,"\u002Fstatistical-mechanics\u002Ffermi-gas\u002Fneutron-stars-and-nuclear-matter":6213,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-cluster-expansion-and-virial-coefficients":6217,"\u002Fstatistical-mechanics\u002Finteractions\u002Fthe-van-der-waals-gas-and-liquid-gas-coexistence":6222,"\u002Fstatistical-mechanics\u002Finteractions\u002Fquantum-gases-with-interactions-and-exchange":6226,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fphases-coexistence-and-classification":6230,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-ising-model-and-exact-solutions":6235,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fmean-field-theory-and-the-weiss-model":6239,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fcritical-exponents-and-landau-theory":6243,"\u002Fstatistical-mechanics\u002Fphase-transitions\u002Fthe-renormalization-group-idea":6247,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fthermodynamic-fluctuations-and-response":6251,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Fbrownian-motion-and-the-langevin-equation":6256,"\u002Fstatistical-mechanics\u002Ffluctuations\u002Flinear-response-and-the-fluctuation-dissipation-theorem":6260,"\u002Fstatistical-mechanics":6264,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fbonding-mechanisms":6267,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fmolecular-orbitals-and-h2-plus":6272,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fhydrogen-molecule-and-exchange":6276,"\u002Fcondensed-matter\u002Fmolecules-and-bonding\u002Fvan-der-waals-forces":6280,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra":6284,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Fanharmonicity-and-rovibrational-structure":6289,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands":6293,"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers":6297,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fstructure-of-solids":6301,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fbravais-lattices-and-crystal-systems":6306,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Freciprocal-lattice-and-brillouin-zones":6310,"\u002Fcondensed-matter\u002Fcrystal-structure\u002Fdiffraction-and-structure-factors":6314,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonon-dispersion":6318,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fphonons-quantization-and-dos":6323,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fdebye-einstein-heat-capacity":6327,"\u002Fcondensed-matter\u002Flattice-dynamics\u002Fanharmonicity-and-thermal-transport":6331,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ffree-electron-gas-and-conduction":6335,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fsommerfeld-model-and-heat-capacity":6340,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Ftransport-and-the-hall-effect":6344,"\u002Fcondensed-matter\u002Ffree-electron-fermi-gas\u002Fscreening-and-plasmons":6348,"\u002Fcondensed-matter\u002Fband-theory\u002Fblochs-theorem-and-energy-bands":6352,"\u002Fcondensed-matter\u002Fband-theory\u002Fnearly-free-electron-model":6357,"\u002Fcondensed-matter\u002Fband-theory\u002Ftight-binding-method":6361,"\u002Fcondensed-matter\u002Fband-theory\u002Ffermi-surfaces-and-semiclassical-dynamics":6365,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fsemiconductor-bands-and-junctions":6369,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fintrinsic-and-extrinsic-semiconductors":6374,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fcarrier-transport-and-recombination":6378,"\u002Fcondensed-matter\u002Fsemiconductors\u002Fthe-pn-junction":6382,"\u002Fcondensed-matter\u002Fsemiconductors\u002Ftransistors-and-optoelectronics":6386,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fdielectrics-and-polarization":6390,"\u002Fcondensed-matter\u002Fdielectrics-and-ferroelectrics\u002Fferroelectrics-and-piezoelectrics":6395,"\u002Fcondensed-matter\u002Fmagnetism\u002Fdiamagnetism-and-paramagnetism":6399,"\u002Fcondensed-matter\u002Fmagnetism\u002Fexchange-and-ferromagnetism":6404,"\u002Fcondensed-matter\u002Fmagnetism\u002Fantiferromagnetism-and-domains":6408,"\u002Fcondensed-matter\u002Fmagnetism\u002Fspin-waves-and-magnons":6412,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fsuperconductivity-phenomenology":6416,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Flondon-theory-and-the-meissner-effect":6421,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fginzburg-landau-theory":6425,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fbcs-theory":6429,"\u002Fcondensed-matter\u002Fsuperconductivity\u002Fjosephson-and-high-tc":6433,"\u002Fcondensed-matter\u002Fnanostructures\u002Fquantum-wells-wires-and-dots":6437,"\u002Fcondensed-matter\u002Fnanostructures\u002Finteger-quantum-hall-effect":6442,"\u002Fcondensed-matter\u002Fnanostructures\u002Ffractional-quantum-hall-and-topology":6446,"\u002Fcondensed-matter\u002Fnanostructures\u002Fgraphene-and-dirac-materials":6450,"\u002Fcondensed-matter":6454,"\u002Flogic\u002Ffoundations\u002Flogic-as-a-mathematical-model":6457,"\u002Flogic\u002Fsentential-logic\u002Fformal-languages-and-well-formed-formulas":6461,"\u002Flogic\u002Fsentential-logic\u002Ftruth-assignments-and-tautologies":6466,"\u002Flogic\u002Fsentential-logic\u002Funique-readability-and-parsing":6470,"\u002Flogic\u002Fsentential-logic\u002Finduction-and-recursion":6474,"\u002Flogic\u002Fsentential-logic\u002Fexpressive-completeness-and-normal-forms":6478,"\u002Flogic\u002Fsentential-logic\u002Fboolean-circuits":6482,"\u002Flogic\u002Fsentential-logic\u002Fcompactness-and-effectiveness":6486,"\u002Flogic\u002Ffirst-order-languages\u002Ffirst-order-languages":6490,"\u002Flogic\u002Ffirst-order-languages\u002Fstructures-truth-and-satisfaction":6495,"\u002Flogic\u002Ffirst-order-languages\u002Fdefinability-and-elementary-equivalence":6499,"\u002Flogic\u002Ffirst-order-languages\u002Fterms-substitution-and-parsing":6503,"\u002Flogic\u002Fdeductive-calculus\u002Fa-deductive-calculus":6507,"\u002Flogic\u002Fdeductive-calculus\u002Fdeduction-theorem-and-derived-rules":6512,"\u002Flogic\u002Fdeductive-calculus\u002Fsoundness":6516,"\u002Flogic\u002Fdeductive-calculus\u002Fcompleteness-and-consistency":6520,"\u002Flogic\u002Fmodels-and-theories\u002Fcompactness-and-lowenheim-skolem":6524,"\u002Flogic\u002Fmodels-and-theories\u002Ftheories-elementary-classes-and-categoricity":6529,"\u002Flogic\u002Fmodels-and-theories\u002Finterpretations-between-theories":6533,"\u002Flogic\u002Fmodels-and-theories\u002Fnonstandard-analysis":6537,"\u002Flogic\u002Farithmetic-and-definability\u002Fdefinability-in-arithmetic":6541,"\u002Flogic\u002Farithmetic-and-definability\u002Fnatural-numbers-with-successor":6546,"\u002Flogic\u002Farithmetic-and-definability\u002Fpresburger-and-reducts":6550,"\u002Flogic\u002Farithmetic-and-definability\u002Fa-subtheory-and-representability":6554,"\u002Flogic\u002Fincompleteness\u002Farithmetization-of-syntax":6558,"\u002Flogic\u002Fincompleteness\u002Fincompleteness-and-undecidability":6563,"\u002Flogic\u002Fincompleteness\u002Fsecond-incompleteness-theorem":6567,"\u002Flogic\u002Fcomputability-and-representability\u002Frecursive-functions":6571,"\u002Flogic\u002Fcomputability-and-representability\u002Frepresenting-exponentiation":6576,"\u002Flogic\u002Fsecond-order-logic\u002Fsecond-order-languages":6580,"\u002Flogic\u002Fsecond-order-logic\u002Fskolem-functions-and-many-sorted-logic":6585,"\u002Flogic\u002Fsecond-order-logic\u002Fgeneral-structures":6589,"\u002Flogic":6593,"\u002Freinforcement-learning\u002Ffoundations\u002Fwhat-is-reinforcement-learning":6596,"\u002Freinforcement-learning\u002Ffoundations\u002Fa-brief-history-of-rl":6600,"\u002Freinforcement-learning\u002Ffoundations\u002Fmulti-armed-bandits":6604,"\u002Freinforcement-learning\u002Ffoundations\u002Fbandit-exploration-algorithms":6608,"\u002Freinforcement-learning\u002Ffoundations\u002Fmarkov-decision-processes":6612,"\u002Freinforcement-learning\u002Ffoundations\u002Fvalue-functions-and-optimality":6616,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdynamic-programming":6620,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdp-async-and-gpi":6624,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-methods":6628,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-off-policy":6632,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftemporal-difference-learning":6636,"\u002Freinforcement-learning\u002Ftabular-methods\u002Ftd-control-sarsa-and-q-learning":6640,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-bootstrapping":6644,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fn-step-off-policy-methods":6648,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-and-learning":6652,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fplanning-focusing-and-decision-time":6656,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fdecision-time-planning":6660,"\u002Freinforcement-learning\u002Ftabular-methods\u002Fmonte-carlo-tree-search":6664,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-prediction":6668,"\u002Freinforcement-learning\u002Fapproximation\u002Ffeature-construction-and-nonlinear":6673,"\u002Freinforcement-learning\u002Fapproximation\u002Fon-policy-control":6677,"\u002Freinforcement-learning\u002Fapproximation\u002Faverage-reward-control":6681,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-and-the-deadly-triad":6685,"\u002Freinforcement-learning\u002Fapproximation\u002Fbellman-error-and-gradient-td":6689,"\u002Freinforcement-learning\u002Fapproximation\u002Feligibility-traces":6693,"\u002Freinforcement-learning\u002Fapproximation\u002Ftrue-online-and-sarsa-lambda":6697,"\u002Freinforcement-learning\u002Fapproximation\u002Fpolicy-gradient-methods":6701,"\u002Freinforcement-learning\u002Fapproximation\u002Factor-critic-and-continuous-actions":6705,"\u002Freinforcement-learning\u002Fapproximation\u002Fleast-squares-and-memory-based-methods":6709,"\u002Freinforcement-learning\u002Fapproximation\u002Fmemory-and-kernel-methods":6713,"\u002Freinforcement-learning\u002Fapproximation\u002Foff-policy-eligibility-traces":6717,"\u002Freinforcement-learning\u002Fapproximation\u002Fstable-off-policy-traces":6721,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdeep-q-networks":6725,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fdqn-improvements":6729,"\u002Freinforcement-learning\u002Fdeep-rl\u002Factor-critic-and-ppo":6733,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fppo-and-continuous-control":6737,"\u002Freinforcement-learning\u002Fdeep-rl\u002Fcase-studies":6741,"\u002Freinforcement-learning\u002Fdeep-rl\u002Frl-beyond-games":6745,"\u002Freinforcement-learning\u002Fdeep-rl\u002Ffrontiers":6749,"\u002Freinforcement-learning\u002Fdeep-rl\u002Freward-design-and-open-problems":6753,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow":6757,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fdistributional-and-rainbow-part-2":6762,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control":6766,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fcontinuous-control-part-2":6770,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl":6774,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmodel-based-rl-part-2":6778,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration":6782,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fexploration-part-2":6786,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl":6790,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Foffline-rl-part-2":6794,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl":6798,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fimitation-and-inverse-rl-part-2":6802,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl":6806,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmulti-agent-rl-part-2":6810,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl":6814,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fhierarchical-rl-part-2":6818,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Frlhf-and-language-models":6822,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps":6826,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fpartial-observability-pomdps-part-2":6830,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl":6834,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fsafe-and-constrained-rl-part-2":6838,"\u002Freinforcement-learning\u002Fmodern-deep-rl\u002Fmeta-rl-and-generalization":6842,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fpsychology-of-reinforcement":6846,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Finstrumental-conditioning-and-control":6851,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-and-td-error":6855,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fdopamine-in-the-brain":6859,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fanimal-learning-and-cognition":6863,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fcognitive-maps-and-planning":6867,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fneuroscience-of-reinforcement":6871,"\u002Freinforcement-learning\u002Fminds-and-brains\u002Fseveral-learning-systems":6875,"\u002Freinforcement-learning":6879,"\u002Fartificial-intelligence\u002Ffoundations\u002Fwhat-is-ai":6881,"\u002Fartificial-intelligence\u002Ffoundations\u002Ffoundations-of-ai":6885,"\u002Fartificial-intelligence\u002Ffoundations\u002Fintelligent-agents":6889,"\u002Fartificial-intelligence\u002Ffoundations\u002Fagent-architectures":6893,"\u002Fartificial-intelligence\u002Fsearch\u002Funinformed-search":6897,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-strategies-compared":6902,"\u002Fartificial-intelligence\u002Fsearch\u002Finformed-search":6906,"\u002Fartificial-intelligence\u002Fsearch\u002Fheuristic-functions":6910,"\u002Fartificial-intelligence\u002Fsearch\u002Flocal-search":6914,"\u002Fartificial-intelligence\u002Fsearch\u002Fpopulation-and-continuous-search":6918,"\u002Fartificial-intelligence\u002Fsearch\u002Fadversarial-search":6922,"\u002Fartificial-intelligence\u002Fsearch\u002Fgames-of-chance-and-imperfect-information":6926,"\u002Fartificial-intelligence\u002Fsearch\u002Fconstraint-satisfaction":6930,"\u002Fartificial-intelligence\u002Fsearch\u002Fcsp-search-and-structure":6934,"\u002Fartificial-intelligence\u002Fsearch\u002Fsearch-under-uncertainty":6938,"\u002Fartificial-intelligence\u002Fsearch\u002Fbelief-state-and-online-search":6942,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-logic":6946,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fpropositional-inference":6951,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic":6955,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-logic-in-use":6959,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Finference-and-resolution":6963,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Ffirst-order-resolution":6967,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fclassical-planning":6971,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-graphs-and-graphplan":6975,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-in-the-real-world":6979,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fplanning-under-uncertainty":6983,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Fknowledge-representation":6987,"\u002Fartificial-intelligence\u002Flogic-and-planning\u002Freasoning-systems-and-defaults":6991,"\u002Fartificial-intelligence\u002Funcertainty\u002Fprobability-and-bayes":6995,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayes-rule-and-naive-bayes":7000,"\u002Fartificial-intelligence\u002Funcertainty\u002Fbayesian-networks":7004,"\u002Fartificial-intelligence\u002Funcertainty\u002Finference-in-bayesian-networks":7008,"\u002Fartificial-intelligence\u002Funcertainty\u002Freasoning-over-time":7012,"\u002Fartificial-intelligence\u002Funcertainty\u002Ftracking-and-data-association":7016,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmaking-decisions":7020,"\u002Fartificial-intelligence\u002Funcertainty\u002Fmarkov-decision-processes":7024,"\u002Fartificial-intelligence\u002Funcertainty\u002Fdecision-networks-and-game-theory":7027,"\u002Fartificial-intelligence\u002Funcertainty\u002Fgame-theory-and-mechanism-design":7031,"\u002Fartificial-intelligence\u002Flearning\u002Flearning-from-examples":7035,"\u002Fartificial-intelligence\u002Flearning\u002Ftheory-and-model-families":7040,"\u002Fartificial-intelligence\u002Flearning\u002Fprobabilistic-learning":7044,"\u002Fartificial-intelligence\u002Flearning\u002Fexpectation-maximization":7048,"\u002Fartificial-intelligence\u002Flearning\u002Freinforcement-learning":7052,"\u002Fartificial-intelligence\u002Flearning\u002Fgeneralization-and-policy-search":7055,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-in-learning":7059,"\u002Fartificial-intelligence\u002Flearning\u002Fknowledge-based-learning-methods":7063,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fvision-and-perception":7067,"\u002Fartificial-intelligence\u002Ffrontiers\u002Freconstructing-the-3d-world":7072,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobotics":7076,"\u002Fartificial-intelligence\u002Ffrontiers\u002Frobot-planning-and-control":7080,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnatural-language-in-ai":7084,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fnlp-grammar-translation-and-speech":7088,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fphilosophy-and-future":7092,"\u002Fartificial-intelligence\u002Ffrontiers\u002Fai-ethics-and-future":7096,"\u002Fartificial-intelligence":7100,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-constituents-nuclide-chart":7103,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-size-charge-distributions":7108,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-masses-binding-energy":7112,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fsemi-empirical-mass-formula":7116,"\u002Fnuclear-physics\u002Fnuclear-properties\u002Fnuclear-moments-multipoles":7120,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnuclear-force-shell-overview":7124,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fthe-deuteron":7129,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fnucleon-nucleon-scattering":7133,"\u002Fnuclear-physics\u002Fnuclear-force-deuteron\u002Fmeson-theory-isospin":7137,"\u002Fnuclear-physics\u002Fnuclear-models\u002Ffermi-gas-model":7141,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fliquid-drop-collective-coordinates":7146,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fshell-model-single-particle":7150,"\u002Fnuclear-physics\u002Fnuclear-models\u002Fcollective-model-rotations-vibrations":7154,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-law-modes":7158,"\u002Fnuclear-physics\u002Fradioactive-decay\u002Fdecay-kinetics-equilibrium":7163,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-decay-gamow-theory":7167,"\u002Fnuclear-physics\u002Falpha-decay\u002Falpha-fine-structure-hindrance":7172,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fbeta-decay-energetics-neutrino":7176,"\u002Fnuclear-physics\u002Fbeta-decay\u002Ffermi-theory-beta-decay":7181,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fweak-interaction-parity-violation":7185,"\u002Fnuclear-physics\u002Fbeta-decay\u002Fdouble-beta-decay-neutrino-mass":7189,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fgamma-multipole-radiation":7193,"\u002Fnuclear-physics\u002Fgamma-decay\u002Finternal-conversion-isomers":7198,"\u002Fnuclear-physics\u002Fgamma-decay\u002Fangular-correlations-mossbauer":7202,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Freaction-kinematics-cross-sections":7206,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fcompound-nucleus-resonances":7211,"\u002Fnuclear-physics\u002Fnuclear-reactions\u002Fdirect-reactions-optical-model":7215,"\u002Fnuclear-physics\u002Ffission\u002Ffission-barrier-dynamics":7219,"\u002Fnuclear-physics\u002Ffission\u002Fchain-reactions-reactor-physics":7224,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Ffusion-reactions-confinement":7228,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fstellar-nucleosynthesis":7233,"\u002Fnuclear-physics\u002Ffusion-nucleosynthesis\u002Fbig-bang-nucleosynthesis":7237,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fcharged-particle-stopping-power":7241,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fphoton-neutron-interactions":7246,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fradiation-detectors":7250,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fdosimetry-radiation-biology":7254,"\u002Fnuclear-physics\u002Fradiation-matter-applications\u002Fnuclear-applications-dating-medicine":7258,"\u002Fnuclear-physics":7262,"\u002Fnatural-language-processing\u002Ffoundations\u002Fwhat-is-nlp":7265,"\u002Fnatural-language-processing\u002Ffoundations\u002Fregex-and-text-normalization":7269,"\u002Fnatural-language-processing\u002Ffoundations\u002Fminimum-edit-distance":7273,"\u002Fnatural-language-processing\u002Ffoundations\u002Fn-gram-language-models":7277,"\u002Fnatural-language-processing\u002Ffoundations\u002Fsmoothing-and-backoff":7281,"\u002Fnatural-language-processing\u002Fclassification\u002Fnaive-bayes-and-sentiment":7285,"\u002Fnatural-language-processing\u002Fclassification\u002Fevaluating-classifiers":7290,"\u002Fnatural-language-processing\u002Fclassification\u002Flogistic-regression":7294,"\u002Fnatural-language-processing\u002Fclassification\u002Fsentiment-and-affect-lexicons":7298,"\u002Fnatural-language-processing\u002Fsemantics\u002Fvector-semantics-and-embeddings":7302,"\u002Fnatural-language-processing\u002Fsemantics\u002Fstatic-word-embeddings":7307,"\u002Fnatural-language-processing\u002Fsemantics\u002Fneural-language-models":7311,"\u002Fnatural-language-processing\u002Fsequences\u002Fsequence-labeling":7315,"\u002Fnatural-language-processing\u002Fsequences\u002Fcrfs-and-neural-taggers":7319,"\u002Fnatural-language-processing\u002Fsequences\u002Frnns-and-lstms":7323,"\u002Fnatural-language-processing\u002Ftransformers\u002Ftransformers-and-attention":7327,"\u002Fnatural-language-processing\u002Ftransformers\u002Fthe-transformer-architecture":7331,"\u002Fnatural-language-processing\u002Ftransformers\u002Flarge-language-models":7334,"\u002Fnatural-language-processing\u002Ftransformers\u002Fllm-pretraining-and-scaling":7337,"\u002Fnatural-language-processing\u002Ftransformers\u002Ffine-tuning-and-prompting":7341,"\u002Fnatural-language-processing\u002Ftransformers\u002Fprompting-and-alignment":7345,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-parsing":7349,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcky-scoring-and-evaluation":7354,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdependency-parsing":7358,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fgraph-based-and-neural-dependency-parsing":7362,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fword-senses-and-wsd":7366,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fwsd-in-practice-and-induction":7370,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-roles-and-information-extraction":7374,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Frelations-events-and-templates":7378,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoreference-and-discourse":7382,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcoherence-and-discourse-structure":7386,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Flogical-semantics":7390,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fcompositional-semantics-and-description-logics":7394,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fsemantic-parsing":7398,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fneural-semantic-parsing":7402,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Finformation-extraction":7406,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftimes-events-and-templates":7410,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fdiscourse-coherence":7414,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fentity-based-and-global-coherence":7418,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Fconstituency-grammars":7422,"\u002Fnatural-language-processing\u002Flinguistic-structure\u002Ftreebanks-and-lexicalized-grammars":7426,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation":7430,"\u002Fnatural-language-processing\u002Fapplications\u002Fmachine-translation-decoding-and-evaluation":7434,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering":7438,"\u002Fnatural-language-processing\u002Fapplications\u002Fquestion-answering-knowledge-and-llms":7442,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-and-chatbots":7446,"\u002Fnatural-language-processing\u002Fapplications\u002Fdialogue-systems-and-assistants":7450,"\u002Fnatural-language-processing\u002Fapplications\u002Ftext-summarization":7454,"\u002Fnatural-language-processing\u002Fapplications\u002Fabstractive-summarization-and-evaluation":7458,"\u002Fnatural-language-processing\u002Fspeech\u002Fphonetics":7462,"\u002Fnatural-language-processing\u002Fspeech\u002Facoustic-phonetics":7467,"\u002Fnatural-language-processing\u002Fspeech\u002Fautomatic-speech-recognition":7471,"\u002Fnatural-language-processing\u002Fspeech\u002Fasr-evaluation-and-applications":7475,"\u002Fnatural-language-processing":7479,"\u002Fparticle-physics\u002Ffoundations\u002Fhistorical-overview-particle-zoo":7482,"\u002Fparticle-physics\u002Ffoundations\u002Fparticle-physics-basic-concepts":7486,"\u002Fparticle-physics\u002Ffoundations\u002Ffundamental-interactions-force-carriers":7490,"\u002Fparticle-physics\u002Funits-kinematics\u002Fnatural-units-and-scales":7494,"\u002Fparticle-physics\u002Funits-kinematics\u002Ffour-vectors-invariant-mass":7499,"\u002Fparticle-physics\u002Funits-kinematics\u002Fdecay-scattering-kinematics-mandelstam":7503,"\u002Fparticle-physics\u002Funits-kinematics\u002Fcross-sections-golden-rule":7507,"\u002Fparticle-physics\u002Fsymmetries\u002Fconservation-laws-symmetries":7511,"\u002Fparticle-physics\u002Fsymmetries\u002Fdiscrete-symmetries-cpt":7516,"\u002Fparticle-physics\u002Fsymmetries\u002Fparity-violation-weak":7520,"\u002Fparticle-physics\u002Fsymmetries\u002Fsu2-su3-flavor-symmetry":7524,"\u002Fparticle-physics\u002Fquark-model\u002Feightfold-way-su3":7528,"\u002Fparticle-physics\u002Fquark-model\u002Fmeson-spectroscopy":7533,"\u002Fparticle-physics\u002Fquark-model\u002Fbaryon-spectroscopy":7537,"\u002Fparticle-physics\u002Fquark-model\u002Fcolor-confinement-exotics":7541,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fklein-gordon-equation":7545,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fdirac-equation-spinors":7550,"\u002Fparticle-physics\u002Frelativistic-wave-equations\u002Fantiparticles-hole-theory":7554,"\u002Fparticle-physics\u002Fqed\u002Ffeynman-rules-qed":7558,"\u002Fparticle-physics\u002Fqed\u002Fqed-tree-processes":7563,"\u002Fparticle-physics\u002Fqed\u002Frenormalization-running-coupling":7567,"\u002Fparticle-physics\u002Fqed\u002Felectron-g-2":7571,"\u002Fparticle-physics\u002Fweak-interaction\u002Fva-structure-weak":7575,"\u002Fparticle-physics\u002Fweak-interaction\u002Fw-z-bosons-decays":7580,"\u002Fparticle-physics\u002Fweak-interaction\u002Fckm-matrix":7584,"\u002Fparticle-physics\u002Fweak-interaction\u002Fcp-violation-kaons-b-mesons":7588,"\u002Fparticle-physics\u002Fqcd\u002Fcolor-su3-gluons":7592,"\u002Fparticle-physics\u002Fqcd\u002Fasymptotic-freedom-confinement":7597,"\u002Fparticle-physics\u002Fqcd\u002Fdeep-inelastic-scattering-partons":7601,"\u002Fparticle-physics\u002Fqcd\u002Fjets-hadronization":7605,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Felectroweak-su2-u1":7609,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fspontaneous-symmetry-breaking":7614,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-mechanism":7618,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fhiggs-boson-discovery":7622,"\u002Fparticle-physics\u002Felectroweak-higgs\u002Fstandard-model":7626,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-oscillations":7630,"\u002Fparticle-physics\u002Fneutrinos\u002Fneutrino-mass-pmns":7635,"\u002Fparticle-physics\u002Fneutrinos\u002Fdirac-majorana-experiments":7639,"\u002Fparticle-physics\u002Fexperiment\u002Faccelerators-luminosity":7643,"\u002Fparticle-physics\u002Fexperiment\u002Fdetectors-subsystems":7648,"\u002Fparticle-physics\u002Fexperiment\u002Fhow-discoveries-are-made":7652,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fbeyond-standard-model":7656,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fgrand-unified-theories":7660,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fsupersymmetry":7664,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fhierarchy-problem-naturalness":7668,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fdark-matter-candidates":7672,"\u002Fparticle-physics\u002Fbeyond-standard-model\u002Fmatter-antimatter-open-questions":7676,"\u002Fparticle-physics":7680,"\u002Fastrophysics-cosmology\u002Forientation\u002Fthe-sun-and-stars":7683,"\u002Fastrophysics-cosmology\u002Forientation\u002Fstellar-death-final-states":7688,"\u002Fastrophysics-cosmology\u002Forientation\u002Fgalaxies-and-cosmology":7692,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fmagnitudes-fluxes-and-the-distance-modulus":7696,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fstellar-spectra-and-spectral-classification":7701,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Ftelescopes-and-detectors-across-the-spectrum":7705,"\u002Fastrophysics-cosmology\u002Fobservational-foundations\u002Fthe-cosmic-distance-ladder":7709,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fblackbody-radiation-and-specific-intensity":7712,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fradiative-transfer-and-the-transfer-equation":7717,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fspectral-line-formation-and-broadening":7721,"\u002Fastrophysics-cosmology\u002Fradiation-and-matter\u002Fopacity-and-the-rosseland-mean":7725,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fhydrostatic-equilibrium-and-the-virial-theorem":7729,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equations-of-stellar-structure":7734,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-equation-of-state-and-polytropes":7738,"\u002Fastrophysics-cosmology\u002Fstellar-structure\u002Fthe-standard-solar-model":7742,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fthermonuclear-reaction-rates-and-the-gamow-peak":7746,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhydrogen-burning-pp-chains-and-cno":7751,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fhelium-burning-and-the-triple-alpha-process":7755,"\u002Fastrophysics-cosmology\u002Fnuclear-astrophysics\u002Fadvanced-burning-and-neutron-capture-nucleosynthesis":7759,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fphases-of-the-interstellar-medium":7763,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fmolecular-clouds-and-gravitational-collapse":7768,"\u002Fastrophysics-cosmology\u002Fism-and-star-formation\u002Fprotostars-and-the-pre-main-sequence":7772,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure":7776,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fpost-main-sequence-low-mass-evolution":7780,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-evolution-of-massive-stars":7783,"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fstellar-pulsation-and-the-instability-strip":7786,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fwhite-dwarfs-and-the-chandrasekhar-limit":7787,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fcore-collapse-supernovae":7791,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fthermonuclear-supernovae-type-ia":7795,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fneutron-stars-and-pulsars":7799,"\u002Fastrophysics-cosmology\u002Fstellar-death-and-compact-remnants\u002Fblack-holes-schwarzschild-and-kerr":7803,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fbinary-systems-and-mass-transfer":7807,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Faccreting-compact-objects":7812,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fgravitational-waves-from-inspiraling-binaries":7816,"\u002Fastrophysics-cosmology\u002Fbinaries-and-gravitational-waves\u002Fmultimessenger-astronomy-and-gamma-ray-bursts":7820,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fthe-milky-way":7824,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-morphology-and-classification":7829,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-rotation-curves-and-dark-matter":7833,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Factive-galactic-nuclei-and-supermassive-black-holes":7837,"\u002Fastrophysics-cosmology\u002Fgalaxies\u002Fgalaxy-clusters-and-large-scale-structure":7841,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-expanding-universe-and-hubbles-law":7845,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-frw-metric-and-cosmological-redshift":7850,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fthe-friedmann-equations-and-cosmic-dynamics":7854,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fcosmological-models-and-distances":7857,"\u002Fastrophysics-cosmology\u002Fcosmology-expansion-and-dynamics\u002Fdark-energy-and-the-accelerating-universe":7861,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fthe-thermal-history-of-the-universe":7865,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fbig-bang-nucleosynthesis":7870,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Frecombination-and-the-cosmic-microwave-background":7874,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcmb-anisotropies-and-cosmological-parameters":7878,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fcosmic-inflation":7882,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fstructure-formation-and-the-growth-of-perturbations":7886,"\u002Fastrophysics-cosmology\u002Fthe-hot-big-bang\u002Fdark-matter-dark-energy-and-open-questions":7890,"\u002Fastrophysics-cosmology":7894,"\u002Fcolophon":7897,"\u002F":7900},{"path":3220,"title":3221,"module":3222,"summary":3223},"\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":3225,"title":3226,"module":3222,"summary":3227},"\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":3229,"title":3230,"module":3222,"summary":3231},"\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":3233,"title":3234,"module":3222,"summary":3235},"\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":3237,"title":3238,"module":3222,"summary":3239},"\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":3241,"title":3242,"module":3222,"summary":3243},"\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":3245,"title":3246,"module":3247,"summary":3248},"\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":3250,"title":3251,"module":3247,"summary":3252},"\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":3254,"title":3255,"module":3247,"summary":3256},"\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":3258,"title":3259,"module":3247,"summary":3260},"\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":3262,"title":3263,"module":3264,"summary":3265},"\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":3267,"title":3268,"module":3264,"summary":3269},"\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":3271,"title":3272,"module":3264,"summary":3273},"\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":3275,"title":3276,"module":3264,"summary":3277},"\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":3279,"title":3280,"module":3281,"summary":3282},"\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":3284,"title":3285,"module":3281,"summary":3286},"\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":3288,"title":3289,"module":3281,"summary":3290},"\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":3292,"title":3293,"module":3281,"summary":3294},"\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":3296,"title":3297,"module":3281,"summary":3298},"\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":3300,"title":3301,"module":3281,"summary":3302},"\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":3304,"title":3305,"module":3281,"summary":3306},"\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":3308,"title":3309,"module":3281,"summary":3310},"\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":3312,"title":3313,"module":3281,"summary":3314},"\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":3316,"title":3317,"module":3281,"summary":3318},"\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":3320,"title":3321,"module":3281,"summary":3322},"\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":3324,"title":3325,"module":3281,"summary":3326},"\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":3328,"title":3329,"module":3330,"summary":3331},"\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":3333,"title":3334,"module":3330,"summary":3335},"\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":3337,"title":3338,"module":3330,"summary":3339},"\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":3341,"title":3342,"module":3330,"summary":3343},"\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":3345,"title":3346,"module":3330,"summary":3347},"\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":3349,"title":3350,"module":3330,"summary":3351},"\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":3353,"title":3354,"module":3330,"summary":3355},"\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":3357,"title":3358,"module":3330,"summary":3359},"\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":3361,"title":3362,"module":3363,"summary":3364},"\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":3366,"title":3367,"module":3363,"summary":3368},"\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":3370,"title":3371,"module":3363,"summary":3372},"\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":3374,"title":3375,"module":3363,"summary":3376},"\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":3378,"title":3379,"module":3363,"summary":3380},"\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":3382,"title":3383,"module":3363,"summary":3384},"\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":3386,"title":3387,"module":3363,"summary":3388},"\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":3390,"title":3391,"module":3363,"summary":3392},"\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":3394,"title":3395,"module":3363,"summary":3396},"\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":3398,"title":3399,"module":3363,"summary":3400},"\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":3402,"title":3403,"module":3363,"summary":3404},"\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":3406,"title":3407,"module":3363,"summary":3408},"\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":3410,"title":3411,"module":3363,"summary":3412},"\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":3414,"title":3415,"module":3363,"summary":3416},"\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":3418,"title":3419,"module":3420,"summary":3421},"\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":3423,"title":3424,"module":3420,"summary":3425},"\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":3427,"title":3428,"module":3420,"summary":3429},"\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":3431,"title":3432,"module":3420,"summary":3433},"\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":3435,"title":3436,"module":3420,"summary":3437},"\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":3439,"title":3440,"module":3441,"summary":3442},"\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":3444,"title":3445,"module":3441,"summary":3446},"\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":3448,"title":3449,"module":3441,"summary":3450},"\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":3452,"title":3453,"module":3441,"summary":3454},"\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":3456,"title":3457,"module":3441,"summary":3458},"\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":3460,"title":3461,"module":3441,"summary":3462},"\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":3464,"title":3465,"module":3441,"summary":3466},"\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":3468,"title":3469,"module":3441,"summary":3470},"\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":3472,"title":3473,"module":3441,"summary":3474},"\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":3476,"title":3477,"module":3441,"summary":3478},"\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":3480,"title":3481,"module":3441,"summary":3482},"\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":3484,"title":3485,"module":3486,"summary":3487},"\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":3489,"title":3490,"module":3486,"summary":3491},"\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":3493,"title":3494,"module":3486,"summary":3495},"\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":3497,"title":3498,"module":3486,"summary":3499},"\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":3501,"title":3502,"module":3503,"summary":3504},"\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":3506,"title":3507,"module":3503,"summary":3508},"\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":3510,"title":3511,"module":3503,"summary":3512},"\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":3514,"title":3515,"module":3503,"summary":3516},"\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":3518,"title":3519,"module":3503,"summary":3520},"\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":3522,"title":3523,"module":3503,"summary":3524},"\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":3526,"title":3527,"module":3503,"summary":3528},"\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":3530,"title":3531,"module":3532,"summary":3533},"\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":3535,"title":3536,"module":3532,"summary":3537},"\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":3539,"title":3540,"module":3532,"summary":3541},"\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":3543,"title":3544,"module":3532,"summary":3545},"\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":3547,"title":3548,"module":3549,"summary":3550},"\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":3552,"title":3553,"module":3549,"summary":3554},"\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":3556,"title":3557,"module":3549,"summary":3558},"\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":3560,"title":3561,"module":3549,"summary":3562},"\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":3564,"title":3565,"module":6,"summary":6},"\u002Falgorithms","Algorithms",{"path":3567,"title":3568,"module":3569,"summary":3570},"\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":3572,"title":3573,"module":3569,"summary":3574},"\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":3576,"title":3577,"module":3569,"summary":3578},"\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":3580,"title":3581,"module":3569,"summary":3582},"\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":3584,"title":3585,"module":3586,"summary":3587},"\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":3589,"title":3590,"module":3586,"summary":3591},"\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":3593,"title":3594,"module":3586,"summary":3595},"\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":3597,"title":3598,"module":3586,"summary":3599},"\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":3601,"title":3602,"module":3603,"summary":3604},"\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":3606,"title":3607,"module":3603,"summary":3608},"\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":3610,"title":3611,"module":3603,"summary":3612},"\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":3614,"title":3615,"module":3603,"summary":3616},"\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":3618,"title":3619,"module":3620,"summary":3621},"\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":3623,"title":3624,"module":3620,"summary":3625},"\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":3627,"title":3628,"module":3620,"summary":3629},"\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":3631,"title":3632,"module":3633,"summary":3634},"\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":3636,"title":3637,"module":3633,"summary":3638},"\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":3640,"title":3641,"module":3633,"summary":3642},"\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":3644,"title":3645,"module":3646,"summary":3647},"\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":3649,"title":3650,"module":3646,"summary":3651},"\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":3653,"title":3654,"module":3646,"summary":3655},"\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":3657,"title":3658,"module":3659,"summary":3660},"\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":3662,"title":3663,"module":3659,"summary":3664},"\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":3666,"title":3667,"module":3659,"summary":3668},"\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":3670,"title":3671,"module":3659,"summary":3672},"\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":3674,"title":3675,"module":3676,"summary":3677},"\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":3679,"title":3680,"module":3676,"summary":3681},"\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":3683,"title":3684,"module":3676,"summary":3685},"\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":3687,"title":3688,"module":3689,"summary":3690},"\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":3692,"title":3693,"module":3689,"summary":3694},"\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":3696,"title":3697,"module":3689,"summary":3698},"\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":3700,"title":3701,"module":3689,"summary":3702},"\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":3704,"title":3705,"module":3689,"summary":3706},"\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":3708,"title":3709,"module":3710,"summary":3711},"\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":3713,"title":3714,"module":3710,"summary":3715},"\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":3717,"title":3718,"module":3710,"summary":3719},"\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":3721,"title":3722,"module":3710,"summary":3723},"\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":3725,"title":3726,"module":3710,"summary":3727},"\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":3729,"title":3730,"module":3731,"summary":3732},"\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":3734,"title":3731,"module":3731,"summary":3735},"\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":3737,"title":3738,"module":3731,"summary":3739},"\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":3741,"title":3742,"module":3731,"summary":3743},"\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":3745,"title":3746,"module":3731,"summary":3747},"\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":3749,"title":3750,"module":3751,"summary":3752},"\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":3754,"title":3755,"module":3751,"summary":3756},"\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":3758,"title":3759,"module":3751,"summary":3760},"\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":3762,"title":3763,"module":3751,"summary":3764},"\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":3766,"title":3767,"module":3751,"summary":3768},"\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":3770,"title":3771,"module":3751,"summary":3772},"\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":3774,"title":3775,"module":6,"summary":6},"\u002Fcalculus","Calculus",{"path":3777,"title":3778,"module":3222,"summary":3779},"\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":3781,"title":3782,"module":3222,"summary":3783},"\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":3785,"title":3786,"module":3787,"summary":3788},"\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":3790,"title":3791,"module":3787,"summary":3792},"\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":3794,"title":3795,"module":3787,"summary":3796},"\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":3798,"title":3799,"module":3787,"summary":3800},"\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":3802,"title":3803,"module":3787,"summary":3804},"\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":3806,"title":3807,"module":3808,"summary":3809},"\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":3811,"title":3812,"module":3808,"summary":3813},"\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":3815,"title":3816,"module":3808,"summary":3817},"\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":3819,"title":3820,"module":3808,"summary":3821},"\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":3823,"title":3824,"module":3808,"summary":3825},"\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":3827,"title":3828,"module":3829,"summary":3830},"\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":3832,"title":3833,"module":3829,"summary":3834},"\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":3836,"title":3837,"module":3829,"summary":3838},"\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":3840,"title":3841,"module":3829,"summary":3842},"\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":3844,"title":3845,"module":3829,"summary":3846},"\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":3848,"title":3849,"module":3850,"summary":3851},"\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":3853,"title":3854,"module":3850,"summary":3855},"\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":3857,"title":3858,"module":3850,"summary":3859},"\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":3861,"title":3862,"module":3863,"summary":3864},"\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":3866,"title":3867,"module":3863,"summary":3868},"\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":3870,"title":3871,"module":3863,"summary":3872},"\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":3874,"title":3875,"module":3863,"summary":3876},"\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":3878,"title":3879,"module":3863,"summary":3880},"\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":3882,"title":3883,"module":3863,"summary":3884},"\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":3886,"title":3887,"module":3888,"summary":3889},"\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":3891,"title":3892,"module":3888,"summary":3893},"\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":3895,"title":3896,"module":3888,"summary":3897},"\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":3899,"title":3900,"module":3888,"summary":3901},"\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":3903,"title":3904,"module":3888,"summary":3905},"\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":3907,"title":3908,"module":3888,"summary":3909},"\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":3911,"title":3912,"module":3888,"summary":3913},"\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":3915,"title":3916,"module":3917,"summary":3918},"\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":3920,"title":3921,"module":3917,"summary":3922},"\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":3924,"title":3925,"module":3917,"summary":3926},"\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":3928,"title":3929,"module":3917,"summary":3930},"\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":3932,"title":3933,"module":3917,"summary":3934},"\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":3936,"title":3937,"module":3917,"summary":3938},"\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":3940,"title":3941,"module":3917,"summary":3942},"\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":3944,"title":3945,"module":3917,"summary":3946},"\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":3948,"title":3949,"module":3917,"summary":3950},"\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":3952,"title":3953,"module":3917,"summary":3954},"\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":3956,"title":3957,"module":3917,"summary":3958},"\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":3960,"title":3961,"module":3917,"summary":3962},"\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":3964,"title":3965,"module":3966,"summary":3967},"\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":3969,"title":3970,"module":3966,"summary":3971},"\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":3973,"title":3974,"module":3966,"summary":3975},"\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":3977,"title":3978,"module":3966,"summary":3979},"\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":3981,"title":3982,"module":3966,"summary":3983},"\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":3985,"title":3986,"module":3966,"summary":3987},"\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":3989,"title":3990,"module":6,"summary":6},"\u002Fmechanics","Mechanics & Dynamics",{"path":3992,"title":3993,"module":3994,"summary":3995},"\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":3997,"title":3998,"module":3994,"summary":3999},"\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":4001,"title":4002,"module":3994,"summary":4003},"\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":4005,"title":4006,"module":3994,"summary":4007},"\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":4009,"title":4010,"module":3994,"summary":4011},"\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":4013,"title":4014,"module":4015,"summary":4016},"\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":4018,"title":4019,"module":4015,"summary":4020},"\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":4022,"title":4023,"module":4024,"summary":4025},"\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":4027,"title":4028,"module":4024,"summary":4029},"\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":4031,"title":4032,"module":4024,"summary":4033},"\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":4035,"title":4036,"module":4024,"summary":4037},"\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":4039,"title":4040,"module":4024,"summary":4041},"\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":4043,"title":4044,"module":4045,"summary":4046},"\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":4048,"title":4049,"module":4045,"summary":4050},"\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":4052,"title":4053,"module":4045,"summary":4054},"\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":4056,"title":4057,"module":4045,"summary":4058},"\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":4060,"title":4061,"module":4062,"summary":4063},"\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":4065,"title":4066,"module":4062,"summary":4067},"\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":4069,"title":4070,"module":4062,"summary":4071},"\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":4073,"title":4074,"module":4075,"summary":4076},"\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":4078,"title":4079,"module":4075,"summary":4080},"\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":4082,"title":4083,"module":4075,"summary":4084},"\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":4086,"title":4087,"module":4075,"summary":4088},"\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":4090,"title":4091,"module":4075,"summary":4092},"\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":4094,"title":4095,"module":4096,"summary":4097},"\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":4099,"title":4100,"module":4096,"summary":4101},"\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":4103,"title":4104,"module":4096,"summary":4105},"\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":4107,"title":4108,"module":4096,"summary":4109},"\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":4111,"title":4112,"module":4096,"summary":4113},"\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":4115,"title":4116,"module":4096,"summary":4117},"\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":4119,"title":4120,"module":4121,"summary":4122},"\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":4124,"title":4125,"module":4121,"summary":4126},"\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":4128,"title":4129,"module":4121,"summary":4130},"\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":4132,"title":4133,"module":4121,"summary":4134},"\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":4136,"title":4137,"module":4121,"summary":4138},"\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":4140,"title":4141,"module":4121,"summary":4142},"\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":4144,"title":4145,"module":4121,"summary":4146},"\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":4148,"title":4149,"module":4121,"summary":4150},"\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":4152,"title":4153,"module":4154,"summary":4155},"\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":4157,"title":4158,"module":4154,"summary":4159},"\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":4161,"title":4162,"module":4154,"summary":4163},"\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":4165,"title":4166,"module":4154,"summary":4167},"\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":4169,"title":4170,"module":4154,"summary":4171},"\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":4173,"title":4174,"module":4175,"summary":4176},"\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":4178,"title":4179,"module":4175,"summary":4180},"\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":4182,"title":4183,"module":4175,"summary":4184},"\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":4186,"title":4187,"module":4175,"summary":4188},"\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":4190,"title":4191,"module":4175,"summary":4192},"\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":4194,"title":4195,"module":4196,"summary":4197},"\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":4199,"title":4200,"module":4196,"summary":4201},"\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":4203,"title":4204,"module":4196,"summary":4205},"\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":4207,"title":4208,"module":6,"summary":6},"\u002Felectricity-and-magnetism","Electricity & Magnetism",{"path":4210,"title":4211,"module":4212,"summary":4213},"\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":4215,"title":4216,"module":4212,"summary":4217},"\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":4219,"title":4220,"module":4212,"summary":4221},"\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":4223,"title":4224,"module":4212,"summary":4225},"\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":4227,"title":4228,"module":4212,"summary":4229},"\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":4231,"title":4232,"module":4233,"summary":4234},"\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":4236,"title":4237,"module":4233,"summary":4238},"\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":4240,"title":4241,"module":4233,"summary":4242},"\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":4244,"title":4245,"module":4233,"summary":4246},"\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":4248,"title":4249,"module":4233,"summary":4250},"\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":4252,"title":4253,"module":4254,"summary":4255},"\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":4257,"title":4258,"module":4254,"summary":4259},"\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":4261,"title":4262,"module":4254,"summary":4263},"\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":4265,"title":4266,"module":4267,"summary":4268},"\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":4270,"title":4271,"module":4267,"summary":4272},"\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":4274,"title":4275,"module":4267,"summary":4276},"\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":4278,"title":4279,"module":4267,"summary":4280},"\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":4282,"title":4283,"module":4267,"summary":4284},"\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":4286,"title":4287,"module":4267,"summary":4288},"\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":4290,"title":4291,"module":4267,"summary":4292},"\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":4294,"title":4295,"module":4296,"summary":4297},"\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":4299,"title":4300,"module":4296,"summary":4301},"\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":4303,"title":4304,"module":4296,"summary":4305},"\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":4307,"title":4308,"module":4296,"summary":4309},"\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":4311,"title":4312,"module":4296,"summary":4313},"\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":4315,"title":4316,"module":4296,"summary":4317},"\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":4319,"title":4320,"module":4296,"summary":4321},"\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":4323,"title":4324,"module":4325,"summary":4326},"\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":4328,"title":4329,"module":4325,"summary":4330},"\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":4332,"title":4333,"module":4325,"summary":4334},"\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":4336,"title":4337,"module":4325,"summary":4338},"\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":4340,"title":4341,"module":4325,"summary":4342},"\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":4344,"title":4345,"module":4325,"summary":4346},"\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":4348,"title":4349,"module":4350,"summary":4351},"\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":4353,"title":4354,"module":4350,"summary":4355},"\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":4357,"title":4358,"module":4350,"summary":4359},"\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":4361,"title":4362,"module":4350,"summary":4363},"\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":4365,"title":4366,"module":4350,"summary":4367},"\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":4369,"title":4370,"module":4371,"summary":4372},"\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":4374,"title":4375,"module":4371,"summary":4376},"\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":4378,"title":4379,"module":4371,"summary":4380},"\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":4382,"title":4383,"module":4371,"summary":4384},"\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":4386,"title":4387,"module":4371,"summary":4388},"\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":4390,"title":4391,"module":4371,"summary":4392},"\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":4394,"title":4395,"module":4396,"summary":4397},"\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":4399,"title":4400,"module":4396,"summary":4401},"\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":4403,"title":4404,"module":4396,"summary":4405},"\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":4407,"title":4408,"module":4396,"summary":4409},"\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":4411,"title":4412,"module":4396,"summary":4413},"\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":4415,"title":4416,"module":6,"summary":6},"\u002Flinear-algebra","Linear Algebra",{"path":4418,"title":4419,"module":6,"summary":6},"\u002Ftheory-of-computation","Theory of Computation",{"path":4421,"title":4422,"module":3222,"summary":4423},"\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":4425,"title":4426,"module":3222,"summary":4427},"\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":4429,"title":4430,"module":3222,"summary":4431},"\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":4433,"title":4434,"module":3222,"summary":4435},"\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":4437,"title":4438,"module":3222,"summary":4439},"\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":4441,"title":4442,"module":4443,"summary":4444},"\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":4446,"title":4447,"module":4443,"summary":4448},"\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":4450,"title":4451,"module":4443,"summary":4452},"\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":4454,"title":4455,"module":4443,"summary":4456},"\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":4458,"title":4459,"module":4443,"summary":4460},"\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":4462,"title":4463,"module":4443,"summary":4464},"\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":4466,"title":4467,"module":4443,"summary":4468},"\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":4470,"title":4471,"module":4472,"summary":4473},"\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":4475,"title":4476,"module":4472,"summary":4477},"\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":4479,"title":4480,"module":4472,"summary":4481},"\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":4483,"title":4484,"module":4472,"summary":4485},"\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":4487,"title":4488,"module":4472,"summary":4489},"\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":4491,"title":4492,"module":4493,"summary":4494},"\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":4496,"title":4497,"module":4493,"summary":4498},"\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":4500,"title":4501,"module":4493,"summary":4502},"\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":4504,"title":4505,"module":4493,"summary":4506},"\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":4508,"title":4509,"module":4493,"summary":4510},"\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":4512,"title":4513,"module":4514,"summary":4515},"\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":4517,"title":4518,"module":4514,"summary":4519},"\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":4521,"title":4522,"module":4514,"summary":4523},"\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":4525,"title":4526,"module":4514,"summary":4527},"\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":4529,"title":4530,"module":4514,"summary":4531},"\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":4533,"title":4534,"module":4535,"summary":4536},"\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":4538,"title":4539,"module":4535,"summary":4540},"\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":4542,"title":4543,"module":4535,"summary":4544},"\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":4546,"title":4547,"module":4535,"summary":4548},"\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":4550,"title":4551,"module":4535,"summary":4552},"\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":4554,"title":4555,"module":4556,"summary":4557},"\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":4559,"title":4560,"module":4556,"summary":4561},"\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":4563,"title":4564,"module":4556,"summary":4565},"\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":4567,"title":4568,"module":4556,"summary":4569},"\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":4571,"title":4572,"module":4556,"summary":4573},"\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":4575,"title":4576,"module":4577,"summary":4578},"\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":4580,"title":4581,"module":4577,"summary":4582},"\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":4584,"title":4585,"module":4577,"summary":4586},"\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":4588,"title":4589,"module":4590,"summary":4591},"\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":4593,"title":4594,"module":4590,"summary":4595},"\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":4597,"title":4598,"module":4599,"summary":4600},"\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":4602,"title":4603,"module":4599,"summary":4604},"\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":4606,"title":4607,"module":4599,"summary":4608},"\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":4610,"title":4611,"module":4599,"summary":4612},"\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":4614,"title":4615,"module":4599,"summary":4616},"\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":4618,"title":4619,"module":4620,"summary":4621},"\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":4623,"title":4624,"module":4620,"summary":4625},"\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":4627,"title":4628,"module":6,"summary":6},"\u002Fcomputer-architecture","Computer Architecture",{"path":4630,"title":4631,"module":3222,"summary":4632},"\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":4634,"title":4635,"module":3222,"summary":4636},"\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":4638,"title":4639,"module":4640,"summary":4641},"\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":4643,"title":4644,"module":4640,"summary":4645},"\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":4647,"title":4648,"module":4640,"summary":4649},"\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":4651,"title":4652,"module":4640,"summary":4653},"\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":4655,"title":4656,"module":4640,"summary":4657},"\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":4659,"title":4660,"module":4640,"summary":4661},"\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":4663,"title":4664,"module":4665,"summary":4666},"\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":4668,"title":4669,"module":4665,"summary":4670},"\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":4672,"title":4673,"module":4665,"summary":4674},"\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":4676,"title":4677,"module":4665,"summary":4678},"\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":4680,"title":4681,"module":4665,"summary":4682},"\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":4684,"title":4685,"module":4665,"summary":4686},"\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":4688,"title":4689,"module":4690,"summary":4691},"\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":4693,"title":4694,"module":4690,"summary":4695},"\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":4697,"title":4698,"module":4690,"summary":4699},"\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":4701,"title":4702,"module":4703,"summary":4704},"\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":4706,"title":4707,"module":4703,"summary":4708},"\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":4710,"title":4711,"module":4712,"summary":4713},"\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":4715,"title":4716,"module":4712,"summary":4717},"\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":4719,"title":4720,"module":4712,"summary":4721},"\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":4723,"title":4724,"module":4725,"summary":4726},"\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":4728,"title":4729,"module":4725,"summary":4730},"\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":4732,"title":4733,"module":4734,"summary":4735},"\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":4737,"title":4738,"module":4734,"summary":4739},"\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":4741,"title":4742,"module":4734,"summary":4743},"\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":4745,"title":4746,"module":4747,"summary":4748},"\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":4750,"title":4751,"module":4747,"summary":4752},"\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":4754,"title":4755,"module":4747,"summary":4756},"\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":4758,"title":4759,"module":4760,"summary":4761},"\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":4763,"title":4764,"module":4760,"summary":4765},"\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":4767,"title":4768,"module":6,"summary":6},"\u002Fdifferential-equations","Differential Equations",{"path":4770,"title":4771,"module":4772,"summary":4773},"\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":4775,"title":4776,"module":4772,"summary":4777},"\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":4779,"title":4780,"module":4772,"summary":4781},"\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":4783,"title":4784,"module":4772,"summary":4785},"\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":4787,"title":4788,"module":4772,"summary":4789},"\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":4791,"title":4792,"module":4793,"summary":4794},"\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":4796,"title":4797,"module":4793,"summary":4798},"\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":4800,"title":4801,"module":4793,"summary":4802},"\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":4804,"title":4805,"module":4793,"summary":4806},"\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":4808,"title":4809,"module":4810,"summary":4811},"\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":4813,"title":4814,"module":4810,"summary":4815},"\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":4817,"title":4818,"module":4810,"summary":4819},"\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":4821,"title":4822,"module":4810,"summary":4823},"\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":4825,"title":4826,"module":4827,"summary":4828},"\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":4830,"title":4831,"module":4827,"summary":4832},"\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":4834,"title":4835,"module":4827,"summary":4836},"\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":4838,"title":4839,"module":4827,"summary":4840},"\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":4842,"title":4843,"module":4844,"summary":4845},"\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":4847,"title":4848,"module":4844,"summary":4849},"\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":4851,"title":4852,"module":4844,"summary":4853},"\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":4855,"title":4856,"module":4844,"summary":4857},"\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":4859,"title":4860,"module":4844,"summary":4861},"\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":4863,"title":4864,"module":4844,"summary":4865},"\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":4867,"title":4868,"module":4869,"summary":4870},"\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":4872,"title":4873,"module":4869,"summary":4874},"\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":4876,"title":4877,"module":4869,"summary":4878},"\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":4880,"title":4881,"module":4882,"summary":4883},"\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":4885,"title":4886,"module":4882,"summary":4887},"\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":4889,"title":4890,"module":4882,"summary":4891},"\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":4893,"title":4894,"module":4882,"summary":4895},"\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":4897,"title":4898,"module":4899,"summary":4900},"\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":4902,"title":4903,"module":4899,"summary":4904},"\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":4906,"title":4907,"module":4899,"summary":4908},"\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":4910,"title":4911,"module":4912,"summary":4913},"\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":4915,"title":4916,"module":4912,"summary":4917},"\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":4919,"title":4920,"module":4912,"summary":4921},"\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":4923,"title":4924,"module":4925,"summary":4926},"\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":4928,"title":4929,"module":4925,"summary":4930},"\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":4932,"title":4933,"module":6,"summary":6},"\u002Frelativity","Relativity",{"path":4935,"title":4936,"module":6,"summary":6},"\u002Fphysical-computing","Physical Computing",{"path":4938,"title":4939,"module":4940,"summary":4941},"\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":4943,"title":4944,"module":4940,"summary":4945},"\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":4947,"title":4948,"module":4940,"summary":4949},"\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":4951,"title":4952,"module":4940,"summary":4953},"\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":4955,"title":4956,"module":4957,"summary":4958},"\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":4960,"title":4961,"module":4957,"summary":4962},"\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":4964,"title":4965,"module":4957,"summary":4966},"\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":4968,"title":4969,"module":4970,"summary":4971},"\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":4973,"title":4974,"module":4970,"summary":4975},"\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":4977,"title":4978,"module":4970,"summary":4979},"\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":4981,"title":4982,"module":4970,"summary":4983},"\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":4985,"title":4986,"module":4970,"summary":4987},"\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":4989,"title":4990,"module":4970,"summary":4991},"\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":4993,"title":4994,"module":4995,"summary":4996},"\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":4998,"title":4999,"module":4995,"summary":5000},"\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":5002,"title":5003,"module":4995,"summary":5004},"\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":5006,"title":5007,"module":4995,"summary":5008},"\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":5010,"title":5011,"module":4995,"summary":5012},"\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":5014,"title":5015,"module":4995,"summary":5016},"\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":5018,"title":5019,"module":5020,"summary":5021},"\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":5023,"title":5024,"module":5020,"summary":5025},"\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":5027,"title":5028,"module":5020,"summary":5029},"\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":5031,"title":5032,"module":5020,"summary":5033},"\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":5035,"title":5036,"module":3875,"summary":5037},"\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":5039,"title":5040,"module":3875,"summary":5041},"\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":5043,"title":5044,"module":3875,"summary":5045},"\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":5047,"title":5048,"module":5049,"summary":5050},"\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":5052,"title":5053,"module":5049,"summary":5054},"\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":5056,"title":5057,"module":5049,"summary":5058},"\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":5060,"title":5061,"module":5062,"summary":5063},"\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":5065,"title":5066,"module":5062,"summary":5067},"\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":5069,"title":5070,"module":5062,"summary":5071},"\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":5073,"title":5074,"module":5075,"summary":5076},"\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":5078,"title":5079,"module":5075,"summary":5080},"\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":5082,"title":5083,"module":5084,"summary":5085},"\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":5087,"title":5088,"module":5084,"summary":5089},"\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":5091,"title":5092,"module":5084,"summary":5093},"\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":5095,"title":5096,"module":5084,"summary":5097},"\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":5099,"title":5100,"module":5084,"summary":5101},"\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":5103,"title":5104,"module":6,"summary":6},"\u002Fquantum-mechanics","Quantum Mechanics",{"path":5106,"title":5107,"module":5108,"summary":5109},"\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":5111,"title":5112,"module":5108,"summary":5113},"\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":5115,"title":5116,"module":5108,"summary":5117},"\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":5119,"title":5120,"module":5108,"summary":5121},"\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":5123,"title":5124,"module":5125,"summary":5126},"\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":5128,"title":5129,"module":5125,"summary":5130},"\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":5132,"title":5133,"module":5125,"summary":5134},"\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":5136,"title":5137,"module":5125,"summary":5138},"\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":5140,"title":5141,"module":5125,"summary":5142},"\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":5144,"title":5145,"module":5125,"summary":5146},"\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":5148,"title":5149,"module":5150,"summary":5151},"\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":5153,"title":5154,"module":5150,"summary":5155},"\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":5157,"title":5158,"module":5150,"summary":5159},"\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":5161,"title":5162,"module":5150,"summary":5163},"\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":5165,"title":5166,"module":5150,"summary":5167},"\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":5169,"title":5170,"module":3569,"summary":5171},"\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":5173,"title":5174,"module":3569,"summary":5175},"\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":5177,"title":5178,"module":3569,"summary":5179},"\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":5181,"title":5182,"module":3569,"summary":5183},"\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":5185,"title":5186,"module":3569,"summary":5187},"\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":5189,"title":5190,"module":3569,"summary":5191},"\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":5193,"title":5194,"module":5195,"summary":5196},"\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":5198,"title":5199,"module":5195,"summary":5200},"\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":5202,"title":5203,"module":5195,"summary":5204},"\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":5206,"title":5207,"module":5195,"summary":5208},"\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":5210,"title":5211,"module":5212,"summary":5213},"\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":5215,"title":5216,"module":5212,"summary":5217},"\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":5219,"title":5220,"module":5212,"summary":5221},"\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":5223,"title":3624,"module":5212,"summary":5224},"\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":5226,"title":5227,"module":5212,"summary":5228},"\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":5230,"title":5231,"module":5232,"summary":5233},"\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":5235,"title":5236,"module":5232,"summary":5237},"\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":5239,"title":5240,"module":5232,"summary":5241},"\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":5243,"title":5244,"module":5232,"summary":5245},"\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":5247,"title":5248,"module":5249,"summary":5250},"\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":5252,"title":5253,"module":5249,"summary":5254},"\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":5256,"title":5257,"module":5249,"summary":5258},"\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":5260,"title":5261,"module":5249,"summary":5262},"\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":5264,"title":5265,"module":5249,"summary":5266},"\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":5268,"title":5269,"module":6,"summary":6},"\u002Freal-analysis","Real Analysis",{"path":5271,"title":5272,"module":3222,"summary":5273},"\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":5275,"title":5276,"module":3222,"summary":5277},"\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":5279,"title":5280,"module":5281,"summary":5282},"\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":5284,"title":5285,"module":5281,"summary":5286},"\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":5288,"title":5289,"module":5281,"summary":5290},"\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":5292,"title":5293,"module":5281,"summary":5294},"\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":5296,"title":5297,"module":5298,"summary":5299},"\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":5301,"title":5302,"module":5298,"summary":5303},"\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":5305,"title":5306,"module":5298,"summary":5307},"\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":5309,"title":5310,"module":5298,"summary":5311},"\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":5313,"title":5314,"module":5298,"summary":5315},"\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":5317,"title":5318,"module":5298,"summary":5319},"\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":5321,"title":5322,"module":5323,"summary":5324},"\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":5326,"title":5327,"module":5323,"summary":5328},"\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":5330,"title":5331,"module":5323,"summary":5332},"\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":5334,"title":5335,"module":5323,"summary":5336},"\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":5338,"title":5339,"module":5340,"summary":5341},"\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":5343,"title":5344,"module":5340,"summary":5345},"\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":5347,"title":5348,"module":5340,"summary":5349},"\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":5351,"title":5352,"module":5340,"summary":5353},"\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":5355,"title":5356,"module":5357,"summary":5358},"\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":5360,"title":5361,"module":5357,"summary":5362},"\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":5364,"title":5365,"module":5357,"summary":5366},"\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":5368,"title":5369,"module":5370,"summary":5371},"\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":5373,"title":5374,"module":5370,"summary":5375},"\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":5377,"title":5378,"module":5370,"summary":5379},"\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":5381,"title":5382,"module":5370,"summary":5383},"\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":5385,"title":5386,"module":5387,"summary":5388},"\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":5390,"title":5391,"module":5387,"summary":5392},"\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":5394,"title":5395,"module":5387,"summary":5396},"\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":5398,"title":5399,"module":5387,"summary":5400},"\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":5402,"title":5403,"module":5404,"summary":5405},"\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":5407,"title":5408,"module":5404,"summary":5409},"\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":5411,"title":5412,"module":5404,"summary":5413},"\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":5415,"title":5416,"module":5417,"summary":5418},"\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":5420,"title":5421,"module":5417,"summary":5422},"\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":5424,"title":5425,"module":5417,"summary":5426},"\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":5428,"title":5429,"module":5417,"summary":5430},"\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":5432,"title":5433,"module":5434,"summary":5435},"\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":5437,"title":5438,"module":5434,"summary":5439},"\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":5441,"title":5442,"module":5434,"summary":5443},"\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":5445,"title":5446,"module":5434,"summary":5447},"\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":5449,"title":5450,"module":5434,"summary":5451},"\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":5453,"title":5454,"module":5455,"summary":5456},"\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":5458,"title":5459,"module":5455,"summary":5460},"\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":5462,"title":5463,"module":6,"summary":6},"\u002Fabstract-algebra","Abstract Algebra",{"path":5465,"title":5466,"module":5467,"summary":5468},"\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":5470,"title":5471,"module":5467,"summary":5472},"\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":5474,"title":5475,"module":5467,"summary":5476},"\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":5478,"title":5479,"module":5467,"summary":5480},"\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":5482,"title":5483,"module":5467,"summary":5484},"\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":5486,"title":5487,"module":5488,"summary":5489},"\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":5491,"title":5492,"module":5488,"summary":5493},"\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":5495,"title":5496,"module":5488,"summary":5497},"\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":5499,"title":5500,"module":5488,"summary":5501},"\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":5503,"title":5504,"module":5488,"summary":5505},"\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":5507,"title":5508,"module":5488,"summary":5509},"\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":5511,"title":5512,"module":5488,"summary":5513},"\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":5515,"title":5516,"module":5517,"summary":5518},"\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":5520,"title":5521,"module":5517,"summary":5522},"\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":5524,"title":5525,"module":5517,"summary":5526},"\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":5528,"title":5529,"module":5517,"summary":5530},"\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":5532,"title":5533,"module":5534,"summary":5535},"\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":5537,"title":5538,"module":5534,"summary":5539},"\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":5541,"title":5542,"module":5534,"summary":5543},"\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":5545,"title":5546,"module":5547,"summary":5548},"\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":5550,"title":5551,"module":5547,"summary":5552},"\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":5554,"title":5555,"module":5547,"summary":5556},"\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":5558,"title":5559,"module":5547,"summary":5560},"\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":5562,"title":5563,"module":5547,"summary":5564},"\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":5566,"title":5567,"module":5547,"summary":5568},"\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":5570,"title":5571,"module":5572,"summary":5573},"\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":5575,"title":5576,"module":5572,"summary":5577},"\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":5579,"title":5580,"module":5572,"summary":5581},"\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":5583,"title":5584,"module":5585,"summary":5586},"\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":5588,"title":5589,"module":5585,"summary":5590},"\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":5592,"title":5593,"module":5585,"summary":5594},"\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":5596,"title":5597,"module":5585,"summary":5598},"\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":5600,"title":5601,"module":5602,"summary":5603},"\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":5605,"title":5606,"module":5602,"summary":5607},"\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":5609,"title":5610,"module":5602,"summary":5611},"\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":5613,"title":5614,"module":5615,"summary":5616},"\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":5618,"title":5619,"module":5615,"summary":5620},"\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":5622,"title":5623,"module":5615,"summary":5624},"\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":5626,"title":5627,"module":5615,"summary":5628},"\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":5630,"title":5631,"module":6,"summary":6},"\u002Fatomic-physics","Atomic Physics",{"path":5633,"title":5634,"module":6,"summary":6},"\u002Fdatabases","Databases",{"path":5636,"title":5637,"module":3222,"summary":5638},"\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":5640,"title":5641,"module":3222,"summary":5642},"\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":5644,"title":5645,"module":3222,"summary":5646},"\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":5648,"title":5649,"module":3222,"summary":5650},"\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":5652,"title":5653,"module":3222,"summary":5654},"\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":5656,"title":5657,"module":3222,"summary":5658},"\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":5660,"title":5661,"module":5662,"summary":5663},"\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":5665,"title":5666,"module":5662,"summary":5667},"\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":5669,"title":5670,"module":5662,"summary":5671},"\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":5673,"title":5674,"module":5675,"summary":5676},"\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":5678,"title":5679,"module":5675,"summary":5680},"\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":5682,"title":5683,"module":5675,"summary":5684},"\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":5686,"title":5687,"module":5688,"summary":5689},"\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":5691,"title":5692,"module":5688,"summary":5693},"\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":5695,"title":5696,"module":5688,"summary":5697},"\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":5699,"title":5700,"module":5688,"summary":5701},"\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":5703,"title":5704,"module":5688,"summary":5705},"\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":5707,"title":5708,"module":5709,"summary":5710},"\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":5712,"title":5713,"module":5709,"summary":5714},"\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":5716,"title":5717,"module":5709,"summary":5718},"\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":5720,"title":5721,"module":5709,"summary":5722},"\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":5724,"title":5725,"module":5726,"summary":5727},"\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":5729,"title":5730,"module":5726,"summary":5731},"\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":5733,"title":5734,"module":5726,"summary":5735},"\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":5737,"title":5738,"module":5726,"summary":5739},"\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":5741,"title":5742,"module":5743,"summary":5744},"\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":5746,"title":5747,"module":5743,"summary":5748},"\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":5750,"title":5751,"module":5743,"summary":5752},"\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":5754,"title":5755,"module":5743,"summary":5756},"\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":5758,"title":5759,"module":5760,"summary":5761},"\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":5763,"title":5764,"module":5760,"summary":5765},"\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":5767,"title":5768,"module":5760,"summary":5769},"\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":5771,"title":5772,"module":6,"summary":6},"\u002Fcategory-theory","Category Theory",{"path":5774,"title":4416,"module":5775,"summary":5776},"\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":5778,"title":5779,"module":5775,"summary":5780},"\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":5782,"title":5783,"module":5775,"summary":5784},"\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":5786,"title":3775,"module":5775,"summary":5787},"\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":5789,"title":5790,"module":3222,"summary":5791},"\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":5793,"title":5794,"module":3222,"summary":5795},"\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":5797,"title":5798,"module":3222,"summary":5799},"\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":5801,"title":5802,"module":5803,"summary":5804},"\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":5806,"title":5807,"module":5803,"summary":5808},"\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":5810,"title":5811,"module":5803,"summary":5812},"\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":5814,"title":5815,"module":5803,"summary":5816},"\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":5818,"title":5819,"module":5803,"summary":5820},"\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":5822,"title":5823,"module":5824,"summary":5825},"\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":5827,"title":5828,"module":5824,"summary":5829},"\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":5831,"title":5832,"module":5824,"summary":5833},"\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":5835,"title":5836,"module":5824,"summary":5837},"\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":5839,"title":5840,"module":5824,"summary":5841},"\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":5843,"title":5844,"module":5845,"summary":5846},"\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":5848,"title":5849,"module":5845,"summary":5850},"\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":5852,"title":5853,"module":5845,"summary":5854},"\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":5856,"title":5857,"module":5845,"summary":5858},"\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":5860,"title":5861,"module":5862,"summary":5863},"\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":5865,"title":5866,"module":5862,"summary":5867},"\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":5869,"title":5870,"module":5862,"summary":5871},"\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":5873,"title":5874,"module":5862,"summary":5875},"\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":5877,"title":5878,"module":5862,"summary":5879},"\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":5881,"title":5882,"module":5862,"summary":5883},"\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":5885,"title":5886,"module":5862,"summary":5887},"\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":5889,"title":5890,"module":5862,"summary":5891},"\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":5893,"title":5894,"module":5862,"summary":5895},"\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":5897,"title":5898,"module":5899,"summary":5900},"\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":5902,"title":5903,"module":5899,"summary":5904},"\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":5906,"title":5907,"module":5899,"summary":5908},"\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":5910,"title":5911,"module":5899,"summary":5912},"\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":5914,"title":5915,"module":5899,"summary":5916},"\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":5918,"title":5919,"module":5920,"summary":5921},"\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":5923,"title":5924,"module":5920,"summary":5925},"\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":5927,"title":5928,"module":5920,"summary":5929},"\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":5931,"title":5932,"module":5920,"summary":5933},"\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":5935,"title":5936,"module":5920,"summary":5937},"\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":5939,"title":5940,"module":5920,"summary":5941},"\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":5943,"title":5944,"module":5920,"summary":5945},"\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":5947,"title":5948,"module":5949,"summary":5950},"\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":5952,"title":5953,"module":5949,"summary":5954},"\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":5956,"title":5957,"module":5949,"summary":5958},"\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":5960,"title":5961,"module":5962,"summary":5963},"\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":5965,"title":5966,"module":5962,"summary":5967},"\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":5969,"title":5970,"module":5962,"summary":5971},"\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":5973,"title":5974,"module":5962,"summary":5975},"\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":5977,"title":5978,"module":5962,"summary":5979},"\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":5981,"title":5982,"module":5962,"summary":5983},"\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":5985,"title":5986,"module":5962,"summary":5987},"\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":5989,"title":5990,"module":5991,"summary":5992},"\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":5994,"title":5995,"module":5991,"summary":5996},"\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":5998,"title":5999,"module":5991,"summary":6000},"\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":6002,"title":6003,"module":5991,"summary":6004},"\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":6006,"title":6007,"module":5991,"summary":6008},"\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":6010,"title":6011,"module":5991,"summary":6012},"\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":6014,"title":6015,"module":5991,"summary":6016},"\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":6018,"title":6019,"module":5991,"summary":6020},"\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":6022,"title":6023,"module":5991,"summary":6024},"\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":6026,"title":6027,"module":5991,"summary":6028},"\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":6030,"title":6031,"module":5991,"summary":6032},"\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":6034,"title":6035,"module":6036,"summary":6037},"\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":6039,"title":6040,"module":6036,"summary":6041},"\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":6043,"title":6044,"module":6036,"summary":6045},"\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":6047,"title":6048,"module":6036,"summary":6049},"\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":6051,"title":6052,"module":6036,"summary":6053},"\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":6055,"title":6056,"module":6,"summary":6},"\u002Fdeep-learning","Deep Learning",{"path":6058,"title":6059,"module":3966,"summary":6060},"\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":6062,"title":6063,"module":3966,"summary":6064},"\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":6066,"title":6067,"module":3966,"summary":6068},"\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":6070,"title":6071,"module":3966,"summary":6072},"\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":6074,"title":6075,"module":3966,"summary":6076},"\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":6078,"title":6079,"module":6080,"summary":6081},"\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":6083,"title":6084,"module":6080,"summary":6085},"\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":6087,"title":6088,"module":6080,"summary":6089},"\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":6091,"title":6092,"module":6080,"summary":6093},"\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":6095,"title":6096,"module":6097,"summary":6098},"\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":6100,"title":6101,"module":6097,"summary":6102},"\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":6104,"title":6105,"module":6097,"summary":6106},"\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":6108,"title":6109,"module":6097,"summary":6110},"\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":6112,"title":6113,"module":6114,"summary":6115},"\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":6117,"title":6118,"module":6114,"summary":6119},"\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":6121,"title":6122,"module":6114,"summary":6123},"\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":6125,"title":6126,"module":6114,"summary":6127},"\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":6129,"title":6130,"module":6114,"summary":6131},"\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":6133,"title":6134,"module":6135,"summary":6136},"\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":6138,"title":6139,"module":6135,"summary":6140},"\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":6142,"title":6143,"module":6135,"summary":6144},"\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":6146,"title":6147,"module":6148,"summary":6149},"\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":6151,"title":6152,"module":6148,"summary":6153},"\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":6155,"title":6156,"module":6148,"summary":6157},"\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":6159,"title":6160,"module":6161,"summary":6162},"\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":6164,"title":6165,"module":6161,"summary":6166},"\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":6168,"title":6169,"module":6161,"summary":6170},"\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":6172,"title":6173,"module":6161,"summary":6174},"\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":6176,"title":6177,"module":6178,"summary":6179},"\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":6181,"title":6182,"module":6178,"summary":6183},"\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":6185,"title":6186,"module":6178,"summary":6187},"\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":6189,"title":6190,"module":6178,"summary":6191},"\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":6193,"title":6194,"module":6178,"summary":6195},"\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":6197,"title":6198,"module":6178,"summary":6199},"\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":6201,"title":6202,"module":6203,"summary":6204},"\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":6206,"title":6207,"module":6203,"summary":6208},"\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":6210,"title":6211,"module":6203,"summary":6212},"\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":6214,"title":6215,"module":6203,"summary":6216},"\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":6218,"title":6219,"module":6220,"summary":6221},"\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":6223,"title":6224,"module":6220,"summary":6225},"\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":6227,"title":6228,"module":6220,"summary":6229},"\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":6231,"title":6232,"module":6233,"summary":6234},"\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":6236,"title":6237,"module":6233,"summary":6238},"\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":6240,"title":6241,"module":6233,"summary":6242},"\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":6244,"title":6245,"module":6233,"summary":6246},"\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":6248,"title":6249,"module":6233,"summary":6250},"\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":6252,"title":6253,"module":6254,"summary":6255},"\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":6257,"title":6258,"module":6254,"summary":6259},"\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":6261,"title":6262,"module":6254,"summary":6263},"\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":6265,"title":6266,"module":6,"summary":6},"\u002Fstatistical-mechanics","Statistical Mechanics",{"path":6268,"title":6269,"module":6270,"summary":6271},"\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":6273,"title":6274,"module":6270,"summary":6275},"\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":6277,"title":6278,"module":6270,"summary":6279},"\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":6281,"title":6282,"module":6270,"summary":6283},"\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":6285,"title":6286,"module":6287,"summary":6288},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Frotational-vibrational-spectra","Rotational and Vibrational Spectra of Molecules","Molecular Spectra","A diatomic molecule stores energy in three well-separated ledgers: electronic, vibrational, and rotational. Quantizing the rigid rotor gives levels spaced as ℓ(ℓ+1); quantizing the bond as a harmonic oscillator gives equally spaced vibrational levels. Their combination produces the P and R branches of an infrared absorption band, from which the bond length and force constant are read directly.\n",{"path":6290,"title":6291,"module":6287,"summary":6292},"\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":6294,"title":6295,"module":6287,"summary":6296},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Framan-and-electronic-bands","Raman Scattering and Electronic Bands","Not every vibration absorbs in the infrared. Raman scattering reaches modes that modulate the polarizability, giving Stokes and anti-Stokes lines whose intensity ratio measures temperature, and the mutual-exclusion rule pairs it with infrared absorption. Electronic transitions add the vibronic structure of band spectra, governed by the Franck-Condon principle, and the radiative fates of an excited state are sorted by the Jablonski diagram into fluorescence and phosphorescence.\n",{"path":6298,"title":6299,"module":6287,"summary":6300},"\u002Fcondensed-matter\u002Fmolecular-spectra\u002Flasers-and-masers","Lasers, Masers, and Stimulated Emission","Einstein's three radiative processes — absorption, spontaneous emission, and stimulated emission — and the coefficients that relate them. Stimulated emission produces coherent photons, and inverting the level populations turns it into net amplification. We build the ruby three-level laser and the helium-neon four-level laser, and show why the fourth level makes inversion easy.\n",{"path":6302,"title":6303,"module":6304,"summary":6305},"\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":6307,"title":6308,"module":6304,"summary":6309},"\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":6311,"title":6312,"module":6304,"summary":6313},"\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":6315,"title":6316,"module":6304,"summary":6317},"\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":6319,"title":6320,"module":6321,"summary":6322},"\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":6324,"title":6325,"module":6321,"summary":6326},"\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":6328,"title":6329,"module":6321,"summary":6330},"\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":6332,"title":6333,"module":6321,"summary":6334},"\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":6336,"title":6337,"module":6338,"summary":6339},"\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":6341,"title":6342,"module":6338,"summary":6343},"\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":6345,"title":6346,"module":6338,"summary":6347},"\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":6349,"title":6350,"module":6338,"summary":6351},"\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":6353,"title":6354,"module":6355,"summary":6356},"\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":6358,"title":6359,"module":6355,"summary":6360},"\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":6362,"title":6363,"module":6355,"summary":6364},"\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":6366,"title":6367,"module":6355,"summary":6368},"\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":6370,"title":6371,"module":6372,"summary":6373},"\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":6375,"title":6376,"module":6372,"summary":6377},"\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":6379,"title":6380,"module":6372,"summary":6381},"\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":6383,"title":6384,"module":6372,"summary":6385},"\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":6387,"title":6388,"module":6372,"summary":6389},"\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":6391,"title":6392,"module":6393,"summary":6394},"\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":6396,"title":6397,"module":6393,"summary":6398},"\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":6400,"title":6401,"module":6402,"summary":6403},"\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":6405,"title":6406,"module":6402,"summary":6407},"\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":6409,"title":6410,"module":6402,"summary":6411},"\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":6413,"title":6414,"module":6402,"summary":6415},"\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":6417,"title":6418,"module":6419,"summary":6420},"\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":6422,"title":6423,"module":6419,"summary":6424},"\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":6426,"title":6427,"module":6419,"summary":6428},"\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":6430,"title":6431,"module":6419,"summary":6432},"\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":6434,"title":6435,"module":6419,"summary":6436},"\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":6438,"title":6439,"module":6440,"summary":6441},"\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":6443,"title":6444,"module":6440,"summary":6445},"\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":6447,"title":6448,"module":6440,"summary":6449},"\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":6451,"title":6452,"module":6440,"summary":6453},"\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":6455,"title":6456,"module":6,"summary":6},"\u002Fcondensed-matter","Condensed Matter Physics",{"path":6458,"title":6459,"module":3222,"summary":6460},"\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":6462,"title":6463,"module":6464,"summary":6465},"\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":6467,"title":6468,"module":6464,"summary":6469},"\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":6471,"title":6472,"module":6464,"summary":6473},"\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":6475,"title":6476,"module":6464,"summary":6477},"\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":6479,"title":6480,"module":6464,"summary":6481},"\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":6483,"title":6484,"module":6464,"summary":6485},"\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":6487,"title":6488,"module":6464,"summary":6489},"\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":6491,"title":6492,"module":6493,"summary":6494},"\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":6496,"title":6497,"module":6493,"summary":6498},"\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":6500,"title":6501,"module":6493,"summary":6502},"\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":6504,"title":6505,"module":6493,"summary":6506},"\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":6508,"title":6509,"module":6510,"summary":6511},"\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":6513,"title":6514,"module":6510,"summary":6515},"\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":6517,"title":6518,"module":6510,"summary":6519},"\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":6521,"title":6522,"module":6510,"summary":6523},"\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":6525,"title":6526,"module":6527,"summary":6528},"\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":6530,"title":6531,"module":6527,"summary":6532},"\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":6534,"title":6535,"module":6527,"summary":6536},"\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":6538,"title":6539,"module":6527,"summary":6540},"\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":6542,"title":6543,"module":6544,"summary":6545},"\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":6547,"title":6548,"module":6544,"summary":6549},"\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":6551,"title":6552,"module":6544,"summary":6553},"\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":6555,"title":6556,"module":6544,"summary":6557},"\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":6559,"title":6560,"module":6561,"summary":6562},"\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":6564,"title":6565,"module":6561,"summary":6566},"\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":6568,"title":6569,"module":6561,"summary":6570},"\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":6572,"title":6573,"module":6574,"summary":6575},"\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":6577,"title":6578,"module":6574,"summary":6579},"\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":6581,"title":6582,"module":6583,"summary":6584},"\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":6586,"title":6587,"module":6583,"summary":6588},"\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":6590,"title":6591,"module":6583,"summary":6592},"\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":6594,"title":6595,"module":6,"summary":6},"\u002Flogic","Logic",{"path":6597,"title":6598,"module":3222,"summary":6599},"\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":6601,"title":6602,"module":3222,"summary":6603},"\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":6605,"title":6606,"module":3222,"summary":6607},"\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":6609,"title":6610,"module":3222,"summary":6611},"\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":6613,"title":6614,"module":3222,"summary":6615},"\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":6617,"title":6618,"module":3222,"summary":6619},"\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":6621,"title":3441,"module":6622,"summary":6623},"\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":6625,"title":6626,"module":6622,"summary":6627},"\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":6629,"title":6630,"module":6622,"summary":6631},"\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":6633,"title":6634,"module":6622,"summary":6635},"\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":6637,"title":6638,"module":6622,"summary":6639},"\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":6641,"title":6642,"module":6622,"summary":6643},"\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":6645,"title":6646,"module":6622,"summary":6647},"\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":6649,"title":6650,"module":6622,"summary":6651},"\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":6653,"title":6654,"module":6622,"summary":6655},"\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":6657,"title":6658,"module":6622,"summary":6659},"\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":6661,"title":6662,"module":6622,"summary":6663},"\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":6665,"title":6666,"module":6622,"summary":6667},"\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":6669,"title":6670,"module":6671,"summary":6672},"\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":6674,"title":6675,"module":6671,"summary":6676},"\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":6678,"title":6679,"module":6671,"summary":6680},"\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":6682,"title":6683,"module":6671,"summary":6684},"\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":6686,"title":6687,"module":6671,"summary":6688},"\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":6690,"title":6691,"module":6671,"summary":6692},"\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":6694,"title":6695,"module":6671,"summary":6696},"\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":6698,"title":6699,"module":6671,"summary":6700},"\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":6702,"title":6703,"module":6671,"summary":6704},"\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":6706,"title":6707,"module":6671,"summary":6708},"\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":6710,"title":6711,"module":6671,"summary":6712},"\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":6714,"title":6715,"module":6671,"summary":6716},"\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":6718,"title":6719,"module":6671,"summary":6720},"\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":6722,"title":6723,"module":6671,"summary":6724},"\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":6726,"title":6044,"module":6727,"summary":6728},"\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":6730,"title":6731,"module":6727,"summary":6732},"\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":6734,"title":6735,"module":6727,"summary":6736},"\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":6738,"title":6739,"module":6727,"summary":6740},"\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":6742,"title":6743,"module":6727,"summary":6744},"\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":6746,"title":6747,"module":6727,"summary":6748},"\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":6750,"title":6751,"module":6727,"summary":6752},"\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":6754,"title":6755,"module":6727,"summary":6756},"\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":6758,"title":6759,"module":6760,"summary":6761},"\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":6763,"title":6764,"module":6760,"summary":6765},"\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":6767,"title":6768,"module":6760,"summary":6769},"\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":6771,"title":6772,"module":6760,"summary":6773},"\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":6775,"title":6776,"module":6760,"summary":6777},"\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":6779,"title":6780,"module":6760,"summary":6781},"\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":6783,"title":6784,"module":6760,"summary":6785},"\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":6787,"title":6788,"module":6760,"summary":6789},"\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":6791,"title":6792,"module":6760,"summary":6793},"\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":6795,"title":6796,"module":6760,"summary":6797},"\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":6799,"title":6800,"module":6760,"summary":6801},"\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":6803,"title":6804,"module":6760,"summary":6805},"\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":6807,"title":6808,"module":6760,"summary":6809},"\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":6811,"title":6812,"module":6760,"summary":6813},"\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":6815,"title":6816,"module":6760,"summary":6817},"\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":6819,"title":6820,"module":6760,"summary":6821},"\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":6823,"title":6824,"module":6760,"summary":6825},"\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":6827,"title":6828,"module":6760,"summary":6829},"\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":6831,"title":6832,"module":6760,"summary":6833},"\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":6835,"title":6836,"module":6760,"summary":6837},"\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":6839,"title":6840,"module":6760,"summary":6841},"\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":6843,"title":6844,"module":6760,"summary":6845},"\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":6847,"title":6848,"module":6849,"summary":6850},"\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":6852,"title":6853,"module":6849,"summary":6854},"\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":6856,"title":6857,"module":6849,"summary":6858},"\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":6860,"title":6861,"module":6849,"summary":6862},"\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":6864,"title":6865,"module":6849,"summary":6866},"\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":6868,"title":6869,"module":6849,"summary":6870},"\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":6872,"title":6873,"module":6849,"summary":6874},"\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":6876,"title":6877,"module":6849,"summary":6878},"\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":6880,"title":6036,"module":6,"summary":6},"\u002Freinforcement-learning",{"path":6882,"title":6883,"module":3222,"summary":6884},"\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":6886,"title":6887,"module":3222,"summary":6888},"\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":6890,"title":6891,"module":3222,"summary":6892},"\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":6894,"title":6895,"module":3222,"summary":6896},"\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":6898,"title":6899,"module":6900,"summary":6901},"\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":6903,"title":6904,"module":6900,"summary":6905},"\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":6907,"title":6908,"module":6900,"summary":6909},"\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":6911,"title":6912,"module":6900,"summary":6913},"\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":6915,"title":6916,"module":6900,"summary":6917},"\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":6919,"title":6920,"module":6900,"summary":6921},"\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":6923,"title":6924,"module":6900,"summary":6925},"\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":6927,"title":6928,"module":6900,"summary":6929},"\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":6931,"title":6932,"module":6900,"summary":6933},"\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":6935,"title":6936,"module":6900,"summary":6937},"\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":6939,"title":6940,"module":6900,"summary":6941},"\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":6943,"title":6944,"module":6900,"summary":6945},"\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":6947,"title":6948,"module":6949,"summary":6950},"\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":6952,"title":6953,"module":6949,"summary":6954},"\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":6956,"title":6957,"module":6949,"summary":6958},"\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":6960,"title":6961,"module":6949,"summary":6962},"\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":6964,"title":6965,"module":6949,"summary":6966},"\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":6968,"title":6969,"module":6949,"summary":6970},"\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":6972,"title":6973,"module":6949,"summary":6974},"\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":6976,"title":6977,"module":6949,"summary":6978},"\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":6980,"title":6981,"module":6949,"summary":6982},"\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":6984,"title":6985,"module":6949,"summary":6986},"\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":6988,"title":6989,"module":6949,"summary":6990},"\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":6992,"title":6993,"module":6949,"summary":6994},"\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":6996,"title":6997,"module":6998,"summary":6999},"\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":7001,"title":7002,"module":6998,"summary":7003},"\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":7005,"title":7006,"module":6998,"summary":7007},"\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":7009,"title":7010,"module":6998,"summary":7011},"\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":7013,"title":7014,"module":6998,"summary":7015},"\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":7017,"title":7018,"module":6998,"summary":7019},"\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":7021,"title":7022,"module":6998,"summary":7023},"\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":7025,"title":6614,"module":6998,"summary":7026},"\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":7028,"title":7029,"module":6998,"summary":7030},"\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":7032,"title":7033,"module":6998,"summary":7034},"\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":7036,"title":7037,"module":7038,"summary":7039},"\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":7041,"title":7042,"module":7038,"summary":7043},"\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":7045,"title":7046,"module":7038,"summary":7047},"\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":7049,"title":7050,"module":7038,"summary":7051},"\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":7053,"title":6036,"module":7038,"summary":7054},"\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":7056,"title":7057,"module":7038,"summary":7058},"\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":7060,"title":7061,"module":7038,"summary":7062},"\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":7064,"title":7065,"module":7038,"summary":7066},"\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":7068,"title":7069,"module":7070,"summary":7071},"\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":7073,"title":7074,"module":7070,"summary":7075},"\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":7077,"title":7078,"module":7070,"summary":7079},"\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":7081,"title":7082,"module":7070,"summary":7083},"\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":7085,"title":7086,"module":7070,"summary":7087},"\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":7089,"title":7090,"module":7070,"summary":7091},"\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":7093,"title":7094,"module":7070,"summary":7095},"\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":7097,"title":7098,"module":7070,"summary":7099},"\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":7101,"title":7102,"module":6,"summary":6},"\u002Fartificial-intelligence","Artificial Intelligence",{"path":7104,"title":7105,"module":7106,"summary":7107},"\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":7109,"title":7110,"module":7106,"summary":7111},"\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":7113,"title":7114,"module":7106,"summary":7115},"\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":7117,"title":7118,"module":7106,"summary":7119},"\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":7121,"title":7122,"module":7106,"summary":7123},"\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":7125,"title":7126,"module":7127,"summary":7128},"\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":7130,"title":7131,"module":7127,"summary":7132},"\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":7134,"title":7135,"module":7127,"summary":7136},"\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":7138,"title":7139,"module":7127,"summary":7140},"\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":7142,"title":7143,"module":7144,"summary":7145},"\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":7147,"title":7148,"module":7144,"summary":7149},"\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":7151,"title":7152,"module":7144,"summary":7153},"\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":7155,"title":7156,"module":7144,"summary":7157},"\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":7159,"title":7160,"module":7161,"summary":7162},"\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":7164,"title":7165,"module":7161,"summary":7166},"\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":7168,"title":7169,"module":7170,"summary":7171},"\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":7173,"title":7174,"module":7170,"summary":7175},"\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":7177,"title":7178,"module":7179,"summary":7180},"\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":7182,"title":7183,"module":7179,"summary":7184},"\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":7186,"title":7187,"module":7179,"summary":7188},"\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":7190,"title":7191,"module":7179,"summary":7192},"\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":7194,"title":7195,"module":7196,"summary":7197},"\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":7199,"title":7200,"module":7196,"summary":7201},"\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":7203,"title":7204,"module":7196,"summary":7205},"\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":7207,"title":7208,"module":7209,"summary":7210},"\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":7212,"title":7213,"module":7209,"summary":7214},"\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":7216,"title":7217,"module":7209,"summary":7218},"\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":7220,"title":7221,"module":7222,"summary":7223},"\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":7225,"title":7226,"module":7222,"summary":7227},"\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":7229,"title":7230,"module":7231,"summary":7232},"\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":7234,"title":7235,"module":7231,"summary":7236},"\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":7238,"title":7239,"module":7231,"summary":7240},"\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":7242,"title":7243,"module":7244,"summary":7245},"\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":7247,"title":7248,"module":7244,"summary":7249},"\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":7251,"title":7252,"module":7244,"summary":7253},"\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":7255,"title":7256,"module":7244,"summary":7257},"\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":7259,"title":7260,"module":7244,"summary":7261},"\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":7263,"title":7264,"module":6,"summary":6},"\u002Fnuclear-physics","Nuclear Physics",{"path":7266,"title":7267,"module":3222,"summary":7268},"\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":7270,"title":7271,"module":3222,"summary":7272},"\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":7274,"title":7275,"module":3222,"summary":7276},"\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":7278,"title":7279,"module":3222,"summary":7280},"\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":7282,"title":7283,"module":3222,"summary":7284},"\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":7286,"title":7287,"module":7288,"summary":7289},"\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":7291,"title":7292,"module":7288,"summary":7293},"\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":7295,"title":7296,"module":7288,"summary":7297},"\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":7299,"title":7300,"module":7288,"summary":7301},"\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":7303,"title":7304,"module":7305,"summary":7306},"\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":7308,"title":7309,"module":7305,"summary":7310},"\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":7312,"title":7313,"module":7305,"summary":7314},"\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":7316,"title":7317,"module":3688,"summary":7318},"\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":7320,"title":7321,"module":3688,"summary":7322},"\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":7324,"title":7325,"module":3688,"summary":7326},"\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":7328,"title":7329,"module":4170,"summary":7330},"\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":7332,"title":5882,"module":4170,"summary":7333},"\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":7335,"title":5990,"module":4170,"summary":7336},"\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":7338,"title":7339,"module":4170,"summary":7340},"\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":7342,"title":7343,"module":4170,"summary":7344},"\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":7346,"title":7347,"module":4170,"summary":7348},"\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":7350,"title":7351,"module":7352,"summary":7353},"\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":7355,"title":7356,"module":7352,"summary":7357},"\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":7359,"title":7360,"module":7352,"summary":7361},"\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":7363,"title":7364,"module":7352,"summary":7365},"\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":7367,"title":7368,"module":7352,"summary":7369},"\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":7371,"title":7372,"module":7352,"summary":7373},"\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":7375,"title":7376,"module":7352,"summary":7377},"\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":7379,"title":7380,"module":7352,"summary":7381},"\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":7383,"title":7384,"module":7352,"summary":7385},"\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":7387,"title":7388,"module":7352,"summary":7389},"\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":7391,"title":7392,"module":7352,"summary":7393},"\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":7395,"title":7396,"module":7352,"summary":7397},"\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":7399,"title":7400,"module":7352,"summary":7401},"\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":7403,"title":7404,"module":7352,"summary":7405},"\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":7407,"title":7408,"module":7352,"summary":7409},"\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":7411,"title":7412,"module":7352,"summary":7413},"\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":7415,"title":7416,"module":7352,"summary":7417},"\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":7419,"title":7420,"module":7352,"summary":7421},"\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":7423,"title":7424,"module":7352,"summary":7425},"\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":7427,"title":7428,"module":7352,"summary":7429},"\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":7431,"title":7432,"module":5978,"summary":7433},"\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":7435,"title":7436,"module":5978,"summary":7437},"\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":7439,"title":7440,"module":5978,"summary":7441},"\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":7443,"title":7444,"module":5978,"summary":7445},"\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":7447,"title":7448,"module":5978,"summary":7449},"\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":7451,"title":7452,"module":5978,"summary":7453},"\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":7455,"title":7456,"module":5978,"summary":7457},"\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":7459,"title":7460,"module":5978,"summary":7461},"\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":7463,"title":7464,"module":7465,"summary":7466},"\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":7468,"title":7469,"module":7465,"summary":7470},"\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":7472,"title":7473,"module":7465,"summary":7474},"\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":7476,"title":7477,"module":7465,"summary":7478},"\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":7480,"title":7481,"module":6,"summary":6},"\u002Fnatural-language-processing","Natural Language Processing",{"path":7483,"title":7484,"module":3222,"summary":7485},"\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":7487,"title":7488,"module":3222,"summary":7489},"\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":7491,"title":7492,"module":3222,"summary":7493},"\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":7495,"title":7496,"module":7497,"summary":7498},"\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":7500,"title":7501,"module":7497,"summary":7502},"\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":7504,"title":7505,"module":7497,"summary":7506},"\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":7508,"title":7509,"module":7497,"summary":7510},"\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":7512,"title":7513,"module":7514,"summary":7515},"\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":7517,"title":7518,"module":7514,"summary":7519},"\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":7521,"title":7522,"module":7514,"summary":7523},"\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":7525,"title":7526,"module":7514,"summary":7527},"\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":7529,"title":7530,"module":7531,"summary":7532},"\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":7534,"title":7535,"module":7531,"summary":7536},"\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":7538,"title":7539,"module":7531,"summary":7540},"\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":7542,"title":7543,"module":7531,"summary":7544},"\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":7546,"title":7547,"module":7548,"summary":7549},"\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":7551,"title":7552,"module":7548,"summary":7553},"\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":7555,"title":7556,"module":7548,"summary":7557},"\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":7559,"title":7560,"module":7561,"summary":7562},"\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":7564,"title":7565,"module":7561,"summary":7566},"\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":7568,"title":7569,"module":7561,"summary":7570},"\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":7572,"title":7573,"module":7561,"summary":7574},"\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":7576,"title":7577,"module":7578,"summary":7579},"\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":7581,"title":7582,"module":7578,"summary":7583},"\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":7585,"title":7586,"module":7578,"summary":7587},"\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":7589,"title":7590,"module":7578,"summary":7591},"\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":7593,"title":7594,"module":7595,"summary":7596},"\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":7598,"title":7599,"module":7595,"summary":7600},"\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":7602,"title":7603,"module":7595,"summary":7604},"\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":7606,"title":7607,"module":7595,"summary":7608},"\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":7610,"title":7611,"module":7612,"summary":7613},"\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":7615,"title":7616,"module":7612,"summary":7617},"\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":7619,"title":7620,"module":7612,"summary":7621},"\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":7623,"title":7624,"module":7612,"summary":7625},"\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":7627,"title":7628,"module":7612,"summary":7629},"\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":7631,"title":7632,"module":7633,"summary":7634},"\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":7636,"title":7637,"module":7633,"summary":7638},"\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":7640,"title":7641,"module":7633,"summary":7642},"\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":7644,"title":7645,"module":7646,"summary":7647},"\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":7649,"title":7650,"module":7646,"summary":7651},"\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":7653,"title":7654,"module":7646,"summary":7655},"\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":7657,"title":7658,"module":7658,"summary":7659},"\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":7661,"title":7662,"module":7658,"summary":7663},"\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":7665,"title":7666,"module":7658,"summary":7667},"\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":7669,"title":7670,"module":7658,"summary":7671},"\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":7673,"title":7674,"module":7658,"summary":7675},"\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":7677,"title":7678,"module":7658,"summary":7679},"\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":7681,"title":7682,"module":6,"summary":6},"\u002Fparticle-physics","Particle Physics",{"path":7684,"title":7685,"module":7686,"summary":7687},"\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":7689,"title":7690,"module":7686,"summary":7691},"\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":7693,"title":7694,"module":7686,"summary":7695},"\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":7697,"title":7698,"module":7699,"summary":7700},"\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":7702,"title":7703,"module":7699,"summary":7704},"\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":7706,"title":7707,"module":7699,"summary":7708},"\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":2224,"title":7710,"module":7699,"summary":7711},"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":7713,"title":7714,"module":7715,"summary":7716},"\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":7718,"title":7719,"module":7715,"summary":7720},"\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":7722,"title":7723,"module":7715,"summary":7724},"\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":7726,"title":7727,"module":7715,"summary":7728},"\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":7730,"title":7731,"module":7732,"summary":7733},"\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":7735,"title":7736,"module":7732,"summary":7737},"\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":7739,"title":7740,"module":7732,"summary":7741},"\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":7743,"title":7744,"module":7732,"summary":7745},"\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":7747,"title":7748,"module":7749,"summary":7750},"\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":7752,"title":7753,"module":7749,"summary":7754},"\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":7756,"title":7757,"module":7749,"summary":7758},"\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":7760,"title":7761,"module":7749,"summary":7762},"\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":7764,"title":7765,"module":7766,"summary":7767},"\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":7769,"title":7770,"module":7766,"summary":7771},"\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":7773,"title":7774,"module":7766,"summary":7775},"\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":7777,"title":7778,"module":2283,"summary":7779},"\u002Fastrophysics-cosmology\u002Fstellar-evolution\u002Fthe-main-sequence-and-its-structure","The Main Sequence and Its Structure","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":2239,"title":7781,"module":2283,"summary":7782},"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":2234,"title":7784,"module":2283,"summary":7785},"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":2285,"title":5,"module":2283,"summary":2303},{"path":7788,"title":6211,"module":7789,"summary":7790},"\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":7792,"title":7793,"module":7789,"summary":7794},"\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":7796,"title":7797,"module":7789,"summary":7798},"\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":7800,"title":7801,"module":7789,"summary":7802},"\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":7804,"title":7805,"module":7789,"summary":7806},"\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":7808,"title":7809,"module":7810,"summary":7811},"\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":7813,"title":7814,"module":7810,"summary":7815},"\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":7817,"title":7818,"module":7810,"summary":7819},"\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":7821,"title":7822,"module":7810,"summary":7823},"\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":7825,"title":7826,"module":7827,"summary":7828},"\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":7830,"title":7831,"module":7827,"summary":7832},"\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":7834,"title":7835,"module":7827,"summary":7836},"\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":7838,"title":7839,"module":7827,"summary":7840},"\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":7842,"title":7843,"module":7827,"summary":7844},"\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":7846,"title":7847,"module":7848,"summary":7849},"\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":7851,"title":7852,"module":7848,"summary":7853},"\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":7855,"title":4929,"module":7848,"summary":7856},"\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":7858,"title":7859,"module":7848,"summary":7860},"\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":7862,"title":7863,"module":7848,"summary":7864},"\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":7866,"title":7867,"module":7868,"summary":7869},"\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":7871,"title":7872,"module":7868,"summary":7873},"\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":7875,"title":7876,"module":7868,"summary":7877},"\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":7879,"title":7880,"module":7868,"summary":7881},"\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":7883,"title":7884,"module":7868,"summary":7885},"\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":7887,"title":7888,"module":7868,"summary":7889},"\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":7891,"title":7892,"module":7868,"summary":7893},"\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":7895,"title":7896,"module":6,"summary":6},"\u002Fastrophysics-cosmology","Astrophysics & Cosmology",{"path":7898,"title":7899,"module":6,"summary":6},"\u002Fcolophon","Colophon",{"path":788,"title":7901,"module":6,"summary":6},"Study Notes",[7903,7923,7934,7945,7956,7968,7978,7989,8003,8015,8029,8045],{"module":7686,"moduleNumber":7904,"slug":7905,"lessons":7906},1,"orientation",[7907,7912,7917],{"title":7685,"path":7684,"lessonNumber":7904,"topics":7908,"summary":7687},[7909,7910,7911],"The Sun","Stellar magnitudes","The H-R diagram",{"title":7690,"path":7689,"lessonNumber":2266,"topics":7913,"summary":7691},[7914,7915,7916],"Supernovae","Degenerate remnants","Black holes",{"title":7694,"path":7693,"lessonNumber":7918,"topics":7919,"summary":7695},3,[7920,7921,7922],"Galaxies","Hubble's law","The Big Bang",{"module":7699,"moduleNumber":2266,"slug":7924,"lessons":7925},"observational-foundations",[7926,7928,7930,7932],{"title":7698,"path":7697,"lessonNumber":7904,"topics":7927,"summary":7700},[7699],{"title":7703,"path":7702,"lessonNumber":2266,"topics":7929,"summary":7704},[7699],{"title":7707,"path":7706,"lessonNumber":7918,"topics":7931,"summary":7708},[7699],{"title":7710,"path":2224,"lessonNumber":2281,"topics":7933,"summary":7711},[7699],{"module":7715,"moduleNumber":7918,"slug":7935,"lessons":7936},"radiation-and-matter",[7937,7939,7941,7943],{"title":7714,"path":7713,"lessonNumber":7904,"topics":7938,"summary":7716},[7715],{"title":7719,"path":7718,"lessonNumber":2266,"topics":7940,"summary":7720},[7715],{"title":7723,"path":7722,"lessonNumber":7918,"topics":7942,"summary":7724},[7715],{"title":7727,"path":7726,"lessonNumber":2281,"topics":7944,"summary":7728},[7715],{"module":7732,"moduleNumber":2281,"slug":7946,"lessons":7947},"stellar-structure",[7948,7950,7952,7954],{"title":7731,"path":7730,"lessonNumber":7904,"topics":7949,"summary":7733},[7732],{"title":7736,"path":7735,"lessonNumber":2266,"topics":7951,"summary":7737},[7732],{"title":7740,"path":7739,"lessonNumber":7918,"topics":7953,"summary":7741},[7732],{"title":7744,"path":7743,"lessonNumber":2281,"topics":7955,"summary":7745},[7732],{"module":7749,"moduleNumber":7957,"slug":7958,"lessons":7959},5,"nuclear-astrophysics",[7960,7962,7964,7966],{"title":7748,"path":7747,"lessonNumber":7904,"topics":7961,"summary":7750},[7749],{"title":7753,"path":7752,"lessonNumber":2266,"topics":7963,"summary":7754},[7749],{"title":7757,"path":7756,"lessonNumber":7918,"topics":7965,"summary":7758},[7749],{"title":7761,"path":7760,"lessonNumber":2281,"topics":7967,"summary":7762},[7749],{"module":7766,"moduleNumber":7969,"slug":7970,"lessons":7971},6,"ism-and-star-formation",[7972,7974,7976],{"title":7765,"path":7764,"lessonNumber":7904,"topics":7973,"summary":7767},[7766],{"title":7770,"path":7769,"lessonNumber":2266,"topics":7975,"summary":7771},[7766],{"title":7774,"path":7773,"lessonNumber":7918,"topics":7977,"summary":7775},[7766],{"module":2283,"moduleNumber":2280,"slug":7979,"lessons":7980},"stellar-evolution",[7981,7983,7985,7987],{"title":7778,"path":7777,"lessonNumber":7904,"topics":7982,"summary":7779},[2283],{"title":7781,"path":2239,"lessonNumber":2266,"topics":7984,"summary":7782},[2283],{"title":7784,"path":2234,"lessonNumber":7918,"topics":7986,"summary":7785},[2283],{"title":5,"path":2285,"lessonNumber":2281,"topics":7988,"summary":2303},[2283],{"module":7789,"moduleNumber":7990,"slug":7991,"lessons":7992},8,"stellar-death-and-compact-remnants",[7993,7995,7997,7999,8001],{"title":6211,"path":7788,"lessonNumber":7904,"topics":7994,"summary":7790},[7789],{"title":7793,"path":7792,"lessonNumber":2266,"topics":7996,"summary":7794},[7789],{"title":7797,"path":7796,"lessonNumber":7918,"topics":7998,"summary":7798},[7789],{"title":7801,"path":7800,"lessonNumber":2281,"topics":8000,"summary":7802},[7789],{"title":7805,"path":7804,"lessonNumber":7957,"topics":8002,"summary":7806},[7789],{"module":7810,"moduleNumber":8004,"slug":8005,"lessons":8006},9,"binaries-and-gravitational-waves",[8007,8009,8011,8013],{"title":7809,"path":7808,"lessonNumber":7904,"topics":8008,"summary":7811},[7810],{"title":7814,"path":7813,"lessonNumber":2266,"topics":8010,"summary":7815},[7810],{"title":7818,"path":7817,"lessonNumber":7918,"topics":8012,"summary":7819},[7810],{"title":7822,"path":7821,"lessonNumber":2281,"topics":8014,"summary":7823},[7810],{"module":7827,"moduleNumber":8016,"slug":8017,"lessons":8018},10,"galaxies",[8019,8021,8023,8025,8027],{"title":7826,"path":7825,"lessonNumber":7904,"topics":8020,"summary":7828},[7827],{"title":7831,"path":7830,"lessonNumber":2266,"topics":8022,"summary":7832},[7827],{"title":7835,"path":7834,"lessonNumber":7918,"topics":8024,"summary":7836},[7827],{"title":7839,"path":7838,"lessonNumber":2281,"topics":8026,"summary":7840},[7827],{"title":7843,"path":7842,"lessonNumber":7957,"topics":8028,"summary":7844},[7827],{"module":7848,"moduleNumber":8030,"slug":8031,"lessons":8032},11,"cosmology-expansion-and-dynamics",[8033,8036,8038,8040,8042],{"title":7847,"path":7846,"lessonNumber":7904,"topics":8034,"summary":7849},[8035],"Cosmology",{"title":7852,"path":7851,"lessonNumber":2266,"topics":8037,"summary":7853},[8035],{"title":4929,"path":7855,"lessonNumber":7918,"topics":8039,"summary":7856},[8035],{"title":7859,"path":7858,"lessonNumber":2281,"topics":8041,"summary":7860},[8035],{"title":7863,"path":7862,"lessonNumber":7957,"topics":8043,"summary":7864},[8035,8044],"Dark Energy",{"module":7868,"moduleNumber":8046,"slug":8047,"lessons":8048},12,"the-hot-big-bang",[8049,8051,8053,8055,8057,8059,8061],{"title":7867,"path":7866,"lessonNumber":7904,"topics":8050,"summary":7869},[7868],{"title":7872,"path":7871,"lessonNumber":2266,"topics":8052,"summary":7873},[7868],{"title":7876,"path":7875,"lessonNumber":7918,"topics":8054,"summary":7877},[7868],{"title":7880,"path":7879,"lessonNumber":2281,"topics":8056,"summary":7881},[7868],{"title":7884,"path":7883,"lessonNumber":7957,"topics":8058,"summary":7885},[7868],{"title":7888,"path":7887,"lessonNumber":7969,"topics":8060,"summary":7889},[7868],{"title":7892,"path":7891,"lessonNumber":2280,"topics":8062,"summary":7893},[7868],"\u003Csvg style=\"width:100%;max-width:424.811px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 318.608 133.988\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-39.633 1.458h249.984\"\u002F>\u003Cpath fill=\"none\" d=\"M208.471-.942c.38 1.44 1.227 2.12 2.08 2.4-.853.28-1.7.96-2.08 2.4\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(253.917 -62.664)\">\u003Cpath d=\"M-37.387 66.899L-39.367 66.899L-39.367 66.602Q-39.098 66.602-38.930 66.557Q-38.762 66.512-38.762 66.340L-38.762 64.204Q-38.762 63.989-38.824 63.893Q-38.887 63.797-39.004 63.776Q-39.121 63.754-39.367 63.754L-39.367 63.458L-38.199 63.372L-38.199 64.157Q-38.121 63.946-37.969 63.760Q-37.817 63.575-37.617 63.473Q-37.418 63.372-37.192 63.372Q-36.946 63.372-36.754 63.516Q-36.563 63.661-36.563 63.891Q-36.563 64.047-36.668 64.157Q-36.774 64.266-36.930 64.266Q-37.086 64.266-37.196 64.157Q-37.305 64.047-37.305 63.891Q-37.305 63.731-37.199 63.626Q-37.524 63.626-37.738 63.854Q-37.953 64.083-38.049 64.422Q-38.145 64.762-38.145 65.067L-38.145 66.340Q-38.145 66.508-37.918 66.555Q-37.692 66.602-37.387 66.602L-37.387 66.899M-35.985 66.067Q-35.985 65.583-35.582 65.288Q-35.180 64.993-34.629 64.874Q-34.078 64.754-33.586 64.754L-33.586 64.465Q-33.586 64.239-33.701 64.032Q-33.817 63.825-34.014 63.706Q-34.211 63.587-34.442 63.587Q-34.867 63.587-35.153 63.692Q-35.082 63.719-35.035 63.774Q-34.988 63.829-34.963 63.899Q-34.938 63.969-34.938 64.044Q-34.938 64.149-34.988 64.241Q-35.039 64.333-35.131 64.383Q-35.223 64.434-35.328 64.434Q-35.434 64.434-35.526 64.383Q-35.617 64.333-35.668 64.241Q-35.719 64.149-35.719 64.044Q-35.719 63.626-35.330 63.479Q-34.942 63.333-34.442 63.333Q-34.110 63.333-33.756 63.463Q-33.403 63.594-33.174 63.848Q-32.946 64.102-32.946 64.450L-32.946 66.251Q-32.946 66.383-32.873 66.493Q-32.801 66.602-32.672 66.602Q-32.547 66.602-32.479 66.497Q-32.410 66.391-32.410 66.251L-32.410 65.739L-32.129 65.739L-32.129 66.251Q-32.129 66.454-32.246 66.612Q-32.363 66.770-32.545 66.854Q-32.727 66.938-32.930 66.938Q-33.160 66.938-33.313 66.766Q-33.465 66.594-33.496 66.364Q-33.656 66.645-33.965 66.811Q-34.274 66.977-34.625 66.977Q-35.137 66.977-35.561 66.754Q-35.985 66.532-35.985 66.067M-35.297 66.067Q-35.297 66.352-35.071 66.538Q-34.844 66.723-34.551 66.723Q-34.305 66.723-34.080 66.606Q-33.856 66.489-33.721 66.286Q-33.586 66.083-33.586 65.829L-33.586 64.997Q-33.852 64.997-34.137 65.051Q-34.422 65.106-34.694 65.235Q-34.965 65.364-35.131 65.571Q-35.297 65.778-35.297 66.067M-30.020 66.977Q-30.500 66.977-30.908 66.733Q-31.317 66.489-31.555 66.075Q-31.793 65.661-31.793 65.172Q-31.793 64.680-31.535 64.264Q-31.278 63.848-30.846 63.610Q-30.414 63.372-29.922 63.372Q-29.301 63.372-28.852 63.809L-28.852 62.180Q-28.852 61.965-28.914 61.870Q-28.977 61.774-29.094 61.753Q-29.211 61.731-29.457 61.731L-29.457 61.434L-28.235 61.348L-28.235 66.157Q-28.235 66.368-28.172 66.463Q-28.110 66.559-27.992 66.581Q-27.875 66.602-27.625 66.602L-27.625 66.899L-28.875 66.977L-28.875 66.493Q-29.340 66.977-30.020 66.977M-29.953 66.723Q-29.613 66.723-29.321 66.532Q-29.028 66.340-28.875 66.044L-28.875 64.212Q-29.024 63.938-29.285 63.782Q-29.547 63.626-29.860 63.626Q-30.485 63.626-30.768 64.073Q-31.051 64.520-31.051 65.180Q-31.051 65.825-30.799 66.274Q-30.547 66.723-29.953 66.723M-25.258 66.899L-27.035 66.899L-27.035 66.602Q-26.762 66.602-26.594 66.555Q-26.426 66.508-26.426 66.340L-26.426 64.204Q-26.426 63.989-26.483 63.893Q-26.539 63.797-26.653 63.776Q-26.766 63.754-27.012 63.754L-27.012 63.458L-25.813 63.372L-25.813 66.340Q-25.813 66.508-25.666 66.555Q-25.520 66.602-25.258 66.602L-25.258 66.899M-26.699 61.977Q-26.699 61.786-26.565 61.655Q-26.430 61.524-26.235 61.524Q-26.113 61.524-26.010 61.587Q-25.906 61.649-25.844 61.753Q-25.781 61.856-25.781 61.977Q-25.781 62.172-25.912 62.307Q-26.043 62.442-26.235 62.442Q-26.434 62.442-26.567 62.309Q-26.699 62.176-26.699 61.977M-24.074 65.946L-24.074 64.204Q-24.074 63.989-24.137 63.893Q-24.199 63.797-24.319 63.776Q-24.438 63.754-24.684 63.754L-24.684 63.458L-23.438 63.372L-23.438 65.922L-23.438 65.946Q-23.438 66.258-23.383 66.420Q-23.328 66.583-23.178 66.653Q-23.028 66.723-22.707 66.723Q-22.278 66.723-22.004 66.385Q-21.731 66.047-21.731 65.602L-21.731 64.204Q-21.731 63.989-21.793 63.893Q-21.856 63.797-21.975 63.776Q-22.094 63.754-22.340 63.754L-22.340 63.458L-21.094 63.372L-21.094 66.157Q-21.094 66.368-21.031 66.463Q-20.969 66.559-20.850 66.581Q-20.731 66.602-20.485 66.602L-20.485 66.899L-21.707 66.977L-21.707 66.356Q-21.875 66.645-22.156 66.811Q-22.438 66.977-22.758 66.977Q-24.074 66.977-24.074 65.946M-19.996 66.891L-19.996 65.669Q-19.996 65.641-19.965 65.610Q-19.934 65.579-19.910 65.579L-19.805 65.579Q-19.735 65.579-19.719 65.641Q-19.656 65.962-19.518 66.202Q-19.379 66.442-19.147 66.583Q-18.914 66.723-18.606 66.723Q-18.367 66.723-18.158 66.663Q-17.949 66.602-17.813 66.454Q-17.676 66.305-17.676 66.059Q-17.676 65.805-17.887 65.639Q-18.098 65.473-18.367 65.419L-18.988 65.305Q-19.395 65.227-19.696 64.971Q-19.996 64.715-19.996 64.340Q-19.996 63.973-19.795 63.751Q-19.594 63.528-19.270 63.430Q-18.946 63.333-18.606 63.333Q-18.141 63.333-17.844 63.540L-17.621 63.356Q-17.598 63.333-17.567 63.333L-17.516 63.333Q-17.485 63.333-17.457 63.360Q-17.430 63.387-17.430 63.419L-17.430 64.403Q-17.430 64.434-17.455 64.463Q-17.481 64.493-17.516 64.493L-17.621 64.493Q-17.656 64.493-17.684 64.465Q-17.711 64.438-17.711 64.403Q-17.711 64.004-17.963 63.784Q-18.215 63.563-18.613 63.563Q-18.969 63.563-19.252 63.686Q-19.535 63.809-19.535 64.114Q-19.535 64.333-19.334 64.465Q-19.133 64.598-18.887 64.641L-18.262 64.754Q-17.832 64.844-17.524 65.141Q-17.215 65.438-17.215 65.852Q-17.215 66.422-17.613 66.700Q-18.012 66.977-18.606 66.977Q-19.156 66.977-19.508 66.641L-19.805 66.954Q-19.828 66.977-19.863 66.977L-19.910 66.977Q-19.934 66.977-19.965 66.946Q-19.996 66.915-19.996 66.891\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-39.633 55.518v-113.41\"\u002F>\u003Cpath fill=\"none\" d=\"M-42.033-56.013c1.44-.38 2.12-1.227 2.4-2.08.28.853.96 1.7 2.4 2.08\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-23.99 -130.28)\">\u003Cpath d=\"M-37.578 66.977Q-38.059 66.977-38.467 66.733Q-38.875 66.489-39.113 66.075Q-39.352 65.661-39.352 65.172Q-39.352 64.680-39.094 64.264Q-38.836 63.848-38.404 63.610Q-37.973 63.372-37.481 63.372Q-36.860 63.372-36.410 63.809L-36.410 62.180Q-36.410 61.965-36.473 61.870Q-36.535 61.774-36.653 61.753Q-36.770 61.731-37.016 61.731L-37.016 61.434L-35.793 61.348L-35.793 66.157Q-35.793 66.368-35.731 66.463Q-35.668 66.559-35.551 66.581Q-35.434 66.602-35.184 66.602L-35.184 66.899L-36.434 66.977L-36.434 66.493Q-36.899 66.977-37.578 66.977M-37.512 66.723Q-37.172 66.723-36.879 66.532Q-36.586 66.340-36.434 66.044L-36.434 64.212Q-36.582 63.938-36.844 63.782Q-37.106 63.626-37.418 63.626Q-38.043 63.626-38.326 64.073Q-38.610 64.520-38.610 65.180Q-38.610 65.825-38.358 66.274Q-38.106 66.723-37.512 66.723M-32.817 66.899L-34.594 66.899L-34.594 66.602Q-34.321 66.602-34.153 66.555Q-33.985 66.508-33.985 66.340L-33.985 64.204Q-33.985 63.989-34.041 63.893Q-34.098 63.797-34.211 63.776Q-34.324 63.754-34.571 63.754L-34.571 63.458L-33.371 63.372L-33.371 66.340Q-33.371 66.508-33.225 66.555Q-33.078 66.602-32.817 66.602L-32.817 66.899M-34.258 61.977Q-34.258 61.786-34.123 61.655Q-33.988 61.524-33.793 61.524Q-33.672 61.524-33.569 61.587Q-33.465 61.649-33.403 61.753Q-33.340 61.856-33.340 61.977Q-33.340 62.172-33.471 62.307Q-33.602 62.442-33.793 62.442Q-33.992 62.442-34.125 62.309Q-34.258 62.176-34.258 61.977M-32.274 66.891L-32.274 65.669Q-32.274 65.641-32.242 65.610Q-32.211 65.579-32.188 65.579L-32.082 65.579Q-32.012 65.579-31.996 65.641Q-31.934 65.962-31.795 66.202Q-31.656 66.442-31.424 66.583Q-31.192 66.723-30.883 66.723Q-30.645 66.723-30.436 66.663Q-30.227 66.602-30.090 66.454Q-29.953 66.305-29.953 66.059Q-29.953 65.805-30.164 65.639Q-30.375 65.473-30.645 65.419L-31.266 65.305Q-31.672 65.227-31.973 64.971Q-32.274 64.715-32.274 64.340Q-32.274 63.973-32.072 63.751Q-31.871 63.528-31.547 63.430Q-31.223 63.333-30.883 63.333Q-30.418 63.333-30.121 63.540L-29.899 63.356Q-29.875 63.333-29.844 63.333L-29.793 63.333Q-29.762 63.333-29.735 63.360Q-29.707 63.387-29.707 63.419L-29.707 64.403Q-29.707 64.434-29.733 64.463Q-29.758 64.493-29.793 64.493L-29.899 64.493Q-29.934 64.493-29.961 64.465Q-29.988 64.438-29.988 64.403Q-29.988 64.004-30.240 63.784Q-30.492 63.563-30.891 63.563Q-31.246 63.563-31.529 63.686Q-31.813 63.809-31.813 64.114Q-31.813 64.333-31.612 64.465Q-31.410 64.598-31.164 64.641L-30.539 64.754Q-30.110 64.844-29.801 65.141Q-29.492 65.438-29.492 65.852Q-29.492 66.422-29.891 66.700Q-30.289 66.977-30.883 66.977Q-31.434 66.977-31.785 66.641L-32.082 66.954Q-32.106 66.977-32.141 66.977L-32.188 66.977Q-32.211 66.977-32.242 66.946Q-32.274 66.915-32.274 66.891M-27.082 68.450L-28.938 68.450L-28.938 68.157Q-28.668 68.157-28.500 68.112Q-28.332 68.067-28.332 67.891L-28.332 64.067Q-28.332 63.860-28.488 63.807Q-28.645 63.754-28.938 63.754L-28.938 63.458L-27.715 63.372L-27.715 63.837Q-27.485 63.614-27.170 63.493Q-26.856 63.372-26.516 63.372Q-26.043 63.372-25.639 63.618Q-25.235 63.864-25.002 64.280Q-24.770 64.696-24.770 65.172Q-24.770 65.547-24.918 65.876Q-25.067 66.204-25.336 66.456Q-25.606 66.708-25.949 66.842Q-26.293 66.977-26.653 66.977Q-26.942 66.977-27.213 66.856Q-27.485 66.735-27.692 66.524L-27.692 67.891Q-27.692 68.067-27.524 68.112Q-27.356 68.157-27.082 68.157L-27.082 68.450M-27.692 64.235L-27.692 66.075Q-27.539 66.364-27.278 66.544Q-27.016 66.723-26.707 66.723Q-26.422 66.723-26.199 66.585Q-25.977 66.446-25.824 66.215Q-25.672 65.985-25.594 65.713Q-25.516 65.442-25.516 65.172Q-25.516 64.840-25.641 64.483Q-25.766 64.126-26.014 63.889Q-26.262 63.653-26.610 63.653Q-26.934 63.653-27.229 63.809Q-27.524 63.965-27.692 64.235M-22.332 66.899L-24.164 66.899L-24.164 66.602Q-23.891 66.602-23.723 66.555Q-23.555 66.508-23.555 66.340L-23.555 62.180Q-23.555 61.965-23.617 61.870Q-23.680 61.774-23.799 61.753Q-23.918 61.731-24.164 61.731L-24.164 61.434L-22.942 61.348L-22.942 66.340Q-22.942 66.508-22.774 66.555Q-22.606 66.602-22.332 66.602L-22.332 66.899M-21.789 66.067Q-21.789 65.583-21.387 65.288Q-20.985 64.993-20.434 64.874Q-19.883 64.754-19.391 64.754L-19.391 64.465Q-19.391 64.239-19.506 64.032Q-19.621 63.825-19.819 63.706Q-20.016 63.587-20.246 63.587Q-20.672 63.587-20.957 63.692Q-20.887 63.719-20.840 63.774Q-20.793 63.829-20.768 63.899Q-20.742 63.969-20.742 64.044Q-20.742 64.149-20.793 64.241Q-20.844 64.333-20.936 64.383Q-21.028 64.434-21.133 64.434Q-21.238 64.434-21.330 64.383Q-21.422 64.333-21.473 64.241Q-21.524 64.149-21.524 64.044Q-21.524 63.626-21.135 63.479Q-20.746 63.333-20.246 63.333Q-19.914 63.333-19.561 63.463Q-19.207 63.594-18.979 63.848Q-18.750 64.102-18.750 64.450L-18.750 66.251Q-18.750 66.383-18.678 66.493Q-18.606 66.602-18.477 66.602Q-18.352 66.602-18.283 66.497Q-18.215 66.391-18.215 66.251L-18.215 65.739L-17.934 65.739L-17.934 66.251Q-17.934 66.454-18.051 66.612Q-18.168 66.770-18.350 66.854Q-18.531 66.938-18.735 66.938Q-18.965 66.938-19.117 66.766Q-19.270 66.594-19.301 66.364Q-19.461 66.645-19.770 66.811Q-20.078 66.977-20.430 66.977Q-20.942 66.977-21.365 66.754Q-21.789 66.532-21.789 66.067M-21.102 66.067Q-21.102 66.352-20.875 66.538Q-20.649 66.723-20.356 66.723Q-20.110 66.723-19.885 66.606Q-19.660 66.489-19.526 66.286Q-19.391 66.083-19.391 65.829L-19.391 64.997Q-19.656 64.997-19.942 65.051Q-20.227 65.106-20.498 65.235Q-20.770 65.364-20.936 65.571Q-21.102 65.778-21.102 66.067M-17.598 65.172Q-17.598 64.676-17.348 64.251Q-17.098 63.825-16.678 63.579Q-16.258 63.333-15.758 63.333Q-15.219 63.333-14.828 63.458Q-14.438 63.583-14.438 63.997Q-14.438 64.102-14.488 64.194Q-14.539 64.286-14.631 64.337Q-14.723 64.387-14.832 64.387Q-14.938 64.387-15.029 64.337Q-15.121 64.286-15.172 64.194Q-15.223 64.102-15.223 63.997Q-15.223 63.774-15.055 63.669Q-15.278 63.610-15.750 63.610Q-16.047 63.610-16.262 63.749Q-16.477 63.887-16.608 64.118Q-16.738 64.348-16.797 64.618Q-16.856 64.887-16.856 65.172Q-16.856 65.567-16.723 65.917Q-16.590 66.266-16.319 66.483Q-16.047 66.700-15.649 66.700Q-15.274 66.700-14.998 66.483Q-14.723 66.266-14.621 65.907Q-14.606 65.844-14.543 65.844L-14.438 65.844Q-14.403 65.844-14.377 65.872Q-14.352 65.899-14.352 65.938L-14.352 65.962Q-14.485 66.442-14.869 66.710Q-15.254 66.977-15.758 66.977Q-16.121 66.977-16.455 66.840Q-16.789 66.704-17.049 66.454Q-17.309 66.204-17.453 65.868Q-17.598 65.532-17.598 65.172M-13.863 65.145Q-13.863 64.665-13.631 64.249Q-13.399 63.833-12.988 63.583Q-12.578 63.333-12.102 63.333Q-11.371 63.333-10.973 63.774Q-10.574 64.215-10.574 64.946Q-10.574 65.051-10.668 65.075L-13.117 65.075L-13.117 65.145Q-13.117 65.555-12.996 65.911Q-12.875 66.266-12.604 66.483Q-12.332 66.700-11.903 66.700Q-11.539 66.700-11.242 66.471Q-10.946 66.243-10.844 65.891Q-10.836 65.844-10.750 65.829L-10.668 65.829Q-10.574 65.856-10.574 65.938Q-10.574 65.946-10.582 65.977Q-10.645 66.204-10.783 66.387Q-10.922 66.571-11.113 66.704Q-11.305 66.837-11.524 66.907Q-11.742 66.977-11.981 66.977Q-12.352 66.977-12.690 66.840Q-13.028 66.704-13.295 66.452Q-13.563 66.200-13.713 65.860Q-13.863 65.520-13.863 65.145M-13.110 64.837L-11.149 64.837Q-11.149 64.532-11.250 64.241Q-11.352 63.950-11.569 63.768Q-11.785 63.587-12.102 63.587Q-12.403 63.587-12.633 63.774Q-12.863 63.962-12.987 64.253Q-13.110 64.544-13.110 64.837M-8.156 66.899L-10.012 66.899L-10.012 66.602Q-9.738 66.602-9.571 66.555Q-9.403 66.508-9.403 66.340L-9.403 64.204Q-9.403 63.989-9.465 63.893Q-9.528 63.797-9.647 63.776Q-9.766 63.754-10.012 63.754L-10.012 63.458L-8.821 63.372L-8.821 64.106Q-8.707 63.891-8.514 63.723Q-8.321 63.555-8.082 63.463Q-7.844 63.372-7.590 63.372Q-6.629 63.372-6.453 64.083Q-6.270 63.754-5.942 63.563Q-5.613 63.372-5.235 63.372Q-4.059 63.372-4.059 64.450L-4.059 66.340Q-4.059 66.508-3.891 66.555Q-3.723 66.602-3.453 66.602L-3.453 66.899L-5.309 66.899L-5.309 66.602Q-5.035 66.602-4.867 66.557Q-4.699 66.512-4.699 66.340L-4.699 64.465Q-4.699 64.079-4.824 63.852Q-4.949 63.626-5.301 63.626Q-5.606 63.626-5.862 63.788Q-6.117 63.950-6.266 64.219Q-6.414 64.489-6.414 64.786L-6.414 66.340Q-6.414 66.508-6.244 66.555Q-6.074 66.602-5.805 66.602L-5.805 66.899L-7.660 66.899L-7.660 66.602Q-7.387 66.602-7.219 66.555Q-7.051 66.508-7.051 66.340L-7.051 64.465Q-7.051 64.079-7.176 63.852Q-7.301 63.626-7.653 63.626Q-7.957 63.626-8.213 63.788Q-8.469 63.950-8.617 64.219Q-8.766 64.489-8.766 64.786L-8.766 66.340Q-8.766 66.508-8.596 66.555Q-8.426 66.602-8.156 66.602L-8.156 66.899M-3.008 65.145Q-3.008 64.665-2.776 64.249Q-2.543 63.833-2.133 63.583Q-1.723 63.333-1.246 63.333Q-0.516 63.333-0.117 63.774Q0.281 64.215 0.281 64.946Q0.281 65.051 0.187 65.075L-2.262 65.075L-2.262 65.145Q-2.262 65.555-2.141 65.911Q-2.020 66.266-1.748 66.483Q-1.477 66.700-1.047 66.700Q-0.684 66.700-0.387 66.471Q-0.090 66.243 0.012 65.891Q0.019 65.844 0.105 65.829L0.187 65.829Q0.281 65.856 0.281 65.938Q0.281 65.946 0.273 65.977Q0.211 66.204 0.072 66.387Q-0.067 66.571-0.258 66.704Q-0.449 66.837-0.668 66.907Q-0.887 66.977-1.125 66.977Q-1.496 66.977-1.834 66.840Q-2.172 66.704-2.440 66.452Q-2.707 66.200-2.858 65.860Q-3.008 65.520-3.008 65.145M-2.254 64.837L-0.293 64.837Q-0.293 64.532-0.395 64.241Q-0.496 63.950-0.713 63.768Q-0.930 63.587-1.246 63.587Q-1.547 63.587-1.778 63.774Q-2.008 63.962-2.131 64.253Q-2.254 64.544-2.254 64.837M2.699 66.899L0.844 66.899L0.844 66.602Q1.117 66.602 1.285 66.555Q1.453 66.508 1.453 66.340L1.453 64.204Q1.453 63.989 1.390 63.893Q1.328 63.797 1.209 63.776Q1.090 63.754 0.844 63.754L0.844 63.458L2.035 63.372L2.035 64.106Q2.148 63.891 2.342 63.723Q2.535 63.555 2.773 63.463Q3.012 63.372 3.265 63.372Q4.433 63.372 4.433 64.450L4.433 66.340Q4.433 66.508 4.603 66.555Q4.773 66.602 5.043 66.602L5.043 66.899L3.187 66.899L3.187 66.602Q3.461 66.602 3.629 66.555Q3.797 66.508 3.797 66.340L3.797 64.465Q3.797 64.083 3.676 63.854Q3.554 63.626 3.203 63.626Q2.890 63.626 2.637 63.788Q2.383 63.950 2.236 64.219Q2.090 64.489 2.090 64.786L2.090 66.340Q2.090 66.508 2.260 66.555Q2.429 66.602 2.699 66.602\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-23.99 -130.28)\">\u003Cpath d=\"M5.903 65.938L5.903 63.747L5.200 63.747L5.200 63.493Q5.556 63.493 5.798 63.260Q6.040 63.028 6.151 62.680Q6.263 62.333 6.263 61.977L6.544 61.977L6.544 63.450L7.720 63.450L7.720 63.747L6.544 63.747L6.544 65.922Q6.544 66.243 6.663 66.471Q6.782 66.700 7.063 66.700Q7.243 66.700 7.360 66.577Q7.478 66.454 7.530 66.274Q7.583 66.094 7.583 65.922L7.583 65.450L7.864 65.450L7.864 65.938Q7.864 66.192 7.759 66.432Q7.653 66.672 7.456 66.825Q7.259 66.977 7.001 66.977Q6.685 66.977 6.433 66.854Q6.181 66.731 6.042 66.497Q5.903 66.262 5.903 65.938\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-25.97 -56.988)\">\u003Cpath d=\"M-39.352 65.172Q-39.352 64.676-39.102 64.251Q-38.852 63.825-38.432 63.579Q-38.012 63.333-37.512 63.333Q-36.973 63.333-36.582 63.458Q-36.192 63.583-36.192 63.997Q-36.192 64.102-36.242 64.194Q-36.293 64.286-36.385 64.337Q-36.477 64.387-36.586 64.387Q-36.692 64.387-36.783 64.337Q-36.875 64.286-36.926 64.194Q-36.977 64.102-36.977 63.997Q-36.977 63.774-36.809 63.669Q-37.031 63.610-37.504 63.610Q-37.801 63.610-38.016 63.749Q-38.231 63.887-38.362 64.118Q-38.492 64.348-38.551 64.618Q-38.610 64.887-38.610 65.172Q-38.610 65.567-38.477 65.917Q-38.344 66.266-38.072 66.483Q-37.801 66.700-37.403 66.700Q-37.028 66.700-36.752 66.483Q-36.477 66.266-36.375 65.907Q-36.360 65.844-36.297 65.844L-36.192 65.844Q-36.156 65.844-36.131 65.872Q-36.106 65.899-36.106 65.938L-36.106 65.962Q-36.238 66.442-36.623 66.710Q-37.008 66.977-37.512 66.977Q-37.875 66.977-38.209 66.840Q-38.543 66.704-38.803 66.454Q-39.063 66.204-39.207 65.868Q-39.352 65.532-39.352 65.172M-35.617 65.145Q-35.617 64.665-35.385 64.249Q-35.153 63.833-34.742 63.583Q-34.332 63.333-33.856 63.333Q-33.125 63.333-32.727 63.774Q-32.328 64.215-32.328 64.946Q-32.328 65.051-32.422 65.075L-34.871 65.075L-34.871 65.145Q-34.871 65.555-34.750 65.911Q-34.629 66.266-34.358 66.483Q-34.086 66.700-33.656 66.700Q-33.293 66.700-32.996 66.471Q-32.699 66.243-32.598 65.891Q-32.590 65.844-32.504 65.829L-32.422 65.829Q-32.328 65.856-32.328 65.938Q-32.328 65.946-32.336 65.977Q-32.399 66.204-32.537 66.387Q-32.676 66.571-32.867 66.704Q-33.059 66.837-33.278 66.907Q-33.496 66.977-33.735 66.977Q-34.106 66.977-34.444 66.840Q-34.781 66.704-35.049 66.452Q-35.317 66.200-35.467 65.860Q-35.617 65.520-35.617 65.145M-34.863 64.837L-32.903 64.837Q-32.903 64.532-33.004 64.241Q-33.106 63.950-33.322 63.768Q-33.539 63.587-33.856 63.587Q-34.156 63.587-34.387 63.774Q-34.617 63.962-34.740 64.253Q-34.863 64.544-34.863 64.837M-29.910 66.899L-31.766 66.899L-31.766 66.602Q-31.492 66.602-31.324 66.555Q-31.156 66.508-31.156 66.340L-31.156 64.204Q-31.156 63.989-31.219 63.893Q-31.281 63.797-31.401 63.776Q-31.520 63.754-31.766 63.754L-31.766 63.458L-30.574 63.372L-30.574 64.106Q-30.461 63.891-30.268 63.723Q-30.074 63.555-29.836 63.463Q-29.598 63.372-29.344 63.372Q-28.176 63.372-28.176 64.450L-28.176 66.340Q-28.176 66.508-28.006 66.555Q-27.836 66.602-27.567 66.602L-27.567 66.899L-29.422 66.899L-29.422 66.602Q-29.149 66.602-28.981 66.555Q-28.813 66.508-28.813 66.340L-28.813 64.465Q-28.813 64.083-28.934 63.854Q-29.055 63.626-29.406 63.626Q-29.719 63.626-29.973 63.788Q-30.227 63.950-30.373 64.219Q-30.520 64.489-30.520 64.786L-30.520 66.340Q-30.520 66.508-30.350 66.555Q-30.180 66.602-29.910 66.602\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-25.97 -56.988)\">\u003Cpath d=\"M-26.728 65.938L-26.728 63.747L-27.431 63.747L-27.431 63.493Q-27.075 63.493-26.833 63.260Q-26.591 63.028-26.480 62.680Q-26.368 62.333-26.368 61.977L-26.087 61.977L-26.087 63.450L-24.911 63.450L-24.911 63.747L-26.087 63.747L-26.087 65.922Q-26.087 66.243-25.968 66.471Q-25.849 66.700-25.568 66.700Q-25.388 66.700-25.271 66.577Q-25.154 66.454-25.101 66.274Q-25.048 66.094-25.048 65.922L-25.048 65.450L-24.767 65.450L-24.767 65.938Q-24.767 66.192-24.872 66.432Q-24.978 66.672-25.175 66.825Q-25.372 66.977-25.630 66.977Q-25.946 66.977-26.198 66.854Q-26.450 66.731-26.589 66.497Q-26.728 66.262-26.728 65.938M-24.048 65.145Q-24.048 64.665-23.816 64.249Q-23.583 63.833-23.173 63.583Q-22.763 63.333-22.286 63.333Q-21.556 63.333-21.157 63.774Q-20.759 64.215-20.759 64.946Q-20.759 65.051-20.853 65.075L-23.302 65.075L-23.302 65.145Q-23.302 65.555-23.181 65.911Q-23.060 66.266-22.788 66.483Q-22.517 66.700-22.087 66.700Q-21.724 66.700-21.427 66.471Q-21.130 66.243-21.029 65.891Q-21.021 65.844-20.935 65.829L-20.853 65.829Q-20.759 65.856-20.759 65.938Q-20.759 65.946-20.767 65.977Q-20.829 66.204-20.968 66.387Q-21.107 66.571-21.298 66.704Q-21.489 66.837-21.708 66.907Q-21.927 66.977-22.165 66.977Q-22.536 66.977-22.874 66.840Q-23.212 66.704-23.480 66.452Q-23.747 66.200-23.898 65.860Q-24.048 65.520-24.048 65.145M-23.294 64.837L-21.333 64.837Q-21.333 64.532-21.435 64.241Q-21.536 63.950-21.753 63.768Q-21.970 63.587-22.286 63.587Q-22.587 63.587-22.818 63.774Q-23.048 63.962-23.171 64.253Q-23.294 64.544-23.294 64.837M-18.263 66.899L-20.243 66.899L-20.243 66.602Q-19.974 66.602-19.806 66.557Q-19.638 66.512-19.638 66.340L-19.638 64.204Q-19.638 63.989-19.700 63.893Q-19.763 63.797-19.880 63.776Q-19.997 63.754-20.243 63.754L-20.243 63.458L-19.075 63.372L-19.075 64.157Q-18.997 63.946-18.845 63.760Q-18.693 63.575-18.493 63.473Q-18.294 63.372-18.068 63.372Q-17.821 63.372-17.630 63.516Q-17.439 63.661-17.439 63.891Q-17.439 64.047-17.544 64.157Q-17.650 64.266-17.806 64.266Q-17.962 64.266-18.071 64.157Q-18.181 64.047-18.181 63.891Q-18.181 63.731-18.075 63.626Q-18.400 63.626-18.614 63.854Q-18.829 64.083-18.925 64.422Q-19.021 64.762-19.021 65.067L-19.021 66.340Q-19.021 66.508-18.794 66.555Q-18.568 66.602-18.263 66.602\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg transform=\"translate(220.417 -56.353)\">\u003Cpath d=\"M-39.352 66.891L-39.352 65.669Q-39.352 65.641-39.321 65.610Q-39.289 65.579-39.266 65.579L-39.160 65.579Q-39.090 65.579-39.074 65.641Q-39.012 65.962-38.873 66.202Q-38.735 66.442-38.502 66.583Q-38.270 66.723-37.961 66.723Q-37.723 66.723-37.514 66.663Q-37.305 66.602-37.168 66.454Q-37.031 66.305-37.031 66.059Q-37.031 65.805-37.242 65.639Q-37.453 65.473-37.723 65.419L-38.344 65.305Q-38.750 65.227-39.051 64.971Q-39.352 64.715-39.352 64.340Q-39.352 63.973-39.151 63.751Q-38.949 63.528-38.625 63.430Q-38.301 63.333-37.961 63.333Q-37.496 63.333-37.199 63.540L-36.977 63.356Q-36.953 63.333-36.922 63.333L-36.871 63.333Q-36.840 63.333-36.813 63.360Q-36.785 63.387-36.785 63.419L-36.785 64.403Q-36.785 64.434-36.811 64.463Q-36.836 64.493-36.871 64.493L-36.977 64.493Q-37.012 64.493-37.039 64.465Q-37.067 64.438-37.067 64.403Q-37.067 64.004-37.319 63.784Q-37.571 63.563-37.969 63.563Q-38.324 63.563-38.608 63.686Q-38.891 63.809-38.891 64.114Q-38.891 64.333-38.690 64.465Q-38.488 64.598-38.242 64.641L-37.617 64.754Q-37.188 64.844-36.879 65.141Q-36.571 65.438-36.571 65.852Q-36.571 66.422-36.969 66.700Q-37.367 66.977-37.961 66.977Q-38.512 66.977-38.863 66.641L-39.160 66.954Q-39.184 66.977-39.219 66.977L-39.266 66.977Q-39.289 66.977-39.321 66.946Q-39.352 66.915-39.352 66.891M-35.360 65.946L-35.360 64.204Q-35.360 63.989-35.422 63.893Q-35.485 63.797-35.604 63.776Q-35.723 63.754-35.969 63.754L-35.969 63.458L-34.723 63.372L-34.723 65.922L-34.723 65.946Q-34.723 66.258-34.668 66.420Q-34.613 66.583-34.463 66.653Q-34.313 66.723-33.992 66.723Q-33.563 66.723-33.289 66.385Q-33.016 66.047-33.016 65.602L-33.016 64.204Q-33.016 63.989-33.078 63.893Q-33.141 63.797-33.260 63.776Q-33.379 63.754-33.625 63.754L-33.625 63.458L-32.379 63.372L-32.379 66.157Q-32.379 66.368-32.317 66.463Q-32.254 66.559-32.135 66.581Q-32.016 66.602-31.770 66.602L-31.770 66.899L-32.992 66.977L-32.992 66.356Q-33.160 66.645-33.442 66.811Q-33.723 66.977-34.043 66.977Q-35.360 66.977-35.360 65.946M-29.317 66.899L-31.297 66.899L-31.297 66.602Q-31.028 66.602-30.860 66.557Q-30.692 66.512-30.692 66.340L-30.692 64.204Q-30.692 63.989-30.754 63.893Q-30.817 63.797-30.934 63.776Q-31.051 63.754-31.297 63.754L-31.297 63.458L-30.129 63.372L-30.129 64.157Q-30.051 63.946-29.899 63.760Q-29.746 63.575-29.547 63.473Q-29.348 63.372-29.121 63.372Q-28.875 63.372-28.684 63.516Q-28.492 63.661-28.492 63.891Q-28.492 64.047-28.598 64.157Q-28.703 64.266-28.860 64.266Q-29.016 64.266-29.125 64.157Q-29.235 64.047-29.235 63.891Q-29.235 63.731-29.129 63.626Q-29.453 63.626-29.668 63.854Q-29.883 64.083-29.979 64.422Q-30.074 64.762-30.074 65.067L-30.074 66.340Q-30.074 66.508-29.848 66.555Q-29.621 66.602-29.317 66.602L-29.317 66.899M-25.946 66.899L-27.930 66.899L-27.930 66.602Q-27.656 66.602-27.488 66.555Q-27.321 66.508-27.321 66.340L-27.321 63.747L-27.961 63.747L-27.961 63.450L-27.321 63.450L-27.321 62.516Q-27.321 62.251-27.203 62.014Q-27.086 61.778-26.893 61.614Q-26.699 61.450-26.451 61.358Q-26.203 61.266-25.938 61.266Q-25.653 61.266-25.428 61.424Q-25.203 61.583-25.203 61.860Q-25.203 62.016-25.309 62.126Q-25.414 62.235-25.578 62.235Q-25.735 62.235-25.844 62.126Q-25.953 62.016-25.953 61.860Q-25.953 61.653-25.793 61.547Q-25.891 61.524-25.985 61.524Q-26.215 61.524-26.387 61.680Q-26.559 61.837-26.645 62.073Q-26.731 62.309-26.731 62.532L-26.731 63.450L-25.762 63.450L-25.762 63.747L-26.707 63.747L-26.707 66.340Q-26.707 66.508-26.481 66.555Q-26.254 66.602-25.946 66.602L-25.946 66.899M-25.321 66.067Q-25.321 65.583-24.918 65.288Q-24.516 64.993-23.965 64.874Q-23.414 64.754-22.922 64.754L-22.922 64.465Q-22.922 64.239-23.037 64.032Q-23.153 63.825-23.350 63.706Q-23.547 63.587-23.778 63.587Q-24.203 63.587-24.488 63.692Q-24.418 63.719-24.371 63.774Q-24.324 63.829-24.299 63.899Q-24.274 63.969-24.274 64.044Q-24.274 64.149-24.324 64.241Q-24.375 64.333-24.467 64.383Q-24.559 64.434-24.664 64.434Q-24.770 64.434-24.862 64.383Q-24.953 64.333-25.004 64.241Q-25.055 64.149-25.055 64.044Q-25.055 63.626-24.666 63.479Q-24.278 63.333-23.778 63.333Q-23.446 63.333-23.092 63.463Q-22.738 63.594-22.510 63.848Q-22.281 64.102-22.281 64.450L-22.281 66.251Q-22.281 66.383-22.209 66.493Q-22.137 66.602-22.008 66.602Q-21.883 66.602-21.815 66.497Q-21.746 66.391-21.746 66.251L-21.746 65.739L-21.465 65.739L-21.465 66.251Q-21.465 66.454-21.582 66.612Q-21.699 66.770-21.881 66.854Q-22.063 66.938-22.266 66.938Q-22.496 66.938-22.649 66.766Q-22.801 66.594-22.832 66.364Q-22.992 66.645-23.301 66.811Q-23.610 66.977-23.961 66.977Q-24.473 66.977-24.897 66.754Q-25.321 66.532-25.321 66.067M-24.633 66.067Q-24.633 66.352-24.406 66.538Q-24.180 66.723-23.887 66.723Q-23.641 66.723-23.416 66.606Q-23.192 66.489-23.057 66.286Q-22.922 66.083-22.922 65.829L-22.922 64.997Q-23.188 64.997-23.473 65.051Q-23.758 65.106-24.029 65.235Q-24.301 65.364-24.467 65.571Q-24.633 65.778-24.633 66.067M-21.129 65.172Q-21.129 64.676-20.879 64.251Q-20.629 63.825-20.209 63.579Q-19.789 63.333-19.289 63.333Q-18.750 63.333-18.360 63.458Q-17.969 63.583-17.969 63.997Q-17.969 64.102-18.020 64.194Q-18.071 64.286-18.162 64.337Q-18.254 64.387-18.363 64.387Q-18.469 64.387-18.561 64.337Q-18.653 64.286-18.703 64.194Q-18.754 64.102-18.754 63.997Q-18.754 63.774-18.586 63.669Q-18.809 63.610-19.281 63.610Q-19.578 63.610-19.793 63.749Q-20.008 63.887-20.139 64.118Q-20.270 64.348-20.328 64.618Q-20.387 64.887-20.387 65.172Q-20.387 65.567-20.254 65.917Q-20.121 66.266-19.850 66.483Q-19.578 66.700-19.180 66.700Q-18.805 66.700-18.529 66.483Q-18.254 66.266-18.153 65.907Q-18.137 65.844-18.074 65.844L-17.969 65.844Q-17.934 65.844-17.908 65.872Q-17.883 65.899-17.883 65.938L-17.883 65.962Q-18.016 66.442-18.401 66.710Q-18.785 66.977-19.289 66.977Q-19.653 66.977-19.987 66.840Q-20.321 66.704-20.580 66.454Q-20.840 66.204-20.985 65.868Q-21.129 65.532-21.129 65.172M-17.395 65.145Q-17.395 64.665-17.162 64.249Q-16.930 63.833-16.520 63.583Q-16.110 63.333-15.633 63.333Q-14.903 63.333-14.504 63.774Q-14.106 64.215-14.106 64.946Q-14.106 65.051-14.199 65.075L-16.649 65.075L-16.649 65.145Q-16.649 65.555-16.528 65.911Q-16.406 66.266-16.135 66.483Q-15.863 66.700-15.434 66.700Q-15.071 66.700-14.774 66.471Q-14.477 66.243-14.375 65.891Q-14.367 65.844-14.281 65.829L-14.199 65.829Q-14.106 65.856-14.106 65.938Q-14.106 65.946-14.113 65.977Q-14.176 66.204-14.315 66.387Q-14.453 66.571-14.645 66.704Q-14.836 66.837-15.055 66.907Q-15.274 66.977-15.512 66.977Q-15.883 66.977-16.221 66.840Q-16.559 66.704-16.826 66.452Q-17.094 66.200-17.244 65.860Q-17.395 65.520-17.395 65.145M-16.641 64.837L-14.680 64.837Q-14.680 64.532-14.781 64.241Q-14.883 63.950-15.100 63.768Q-15.317 63.587-15.633 63.587Q-15.934 63.587-16.164 63.774Q-16.395 63.962-16.518 64.253Q-16.641 64.544-16.641 64.837\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-39.633 1.458c99.585-5.69 170.717-31.298 233.312-48.37\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(166.43 -114.498)\">\u003Cpath d=\"M-37.328 66.899L-39.313 66.899L-39.313 66.602Q-39.039 66.602-38.871 66.555Q-38.703 66.508-38.703 66.340L-38.703 63.747L-39.344 63.747L-39.344 63.450L-38.703 63.450L-38.703 62.516Q-38.703 62.251-38.586 62.014Q-38.469 61.778-38.276 61.614Q-38.082 61.450-37.834 61.358Q-37.586 61.266-37.321 61.266Q-37.035 61.266-36.811 61.424Q-36.586 61.583-36.586 61.860Q-36.586 62.016-36.692 62.126Q-36.797 62.235-36.961 62.235Q-37.117 62.235-37.227 62.126Q-37.336 62.016-37.336 61.860Q-37.336 61.653-37.176 61.547Q-37.274 61.524-37.367 61.524Q-37.598 61.524-37.770 61.680Q-37.942 61.837-38.028 62.073Q-38.113 62.309-38.113 62.532L-38.113 63.450L-37.145 63.450L-37.145 63.747L-38.090 63.747L-38.090 66.340Q-38.090 66.508-37.863 66.555Q-37.637 66.602-37.328 66.602L-37.328 66.899M-36.117 65.946L-36.117 64.204Q-36.117 63.989-36.180 63.893Q-36.242 63.797-36.362 63.776Q-36.481 63.754-36.727 63.754L-36.727 63.458L-35.481 63.372L-35.481 65.922L-35.481 65.946Q-35.481 66.258-35.426 66.420Q-35.371 66.583-35.221 66.653Q-35.071 66.723-34.750 66.723Q-34.321 66.723-34.047 66.385Q-33.774 66.047-33.774 65.602L-33.774 64.204Q-33.774 63.989-33.836 63.893Q-33.899 63.797-34.018 63.776Q-34.137 63.754-34.383 63.754L-34.383 63.458L-33.137 63.372L-33.137 66.157Q-33.137 66.368-33.074 66.463Q-33.012 66.559-32.893 66.581Q-32.774 66.602-32.528 66.602L-32.528 66.899L-33.750 66.977L-33.750 66.356Q-33.918 66.645-34.199 66.811Q-34.481 66.977-34.801 66.977Q-36.117 66.977-36.117 65.946M-30.153 66.899L-32.008 66.899L-32.008 66.602Q-31.735 66.602-31.567 66.555Q-31.399 66.508-31.399 66.340L-31.399 64.204Q-31.399 63.989-31.461 63.893Q-31.524 63.797-31.643 63.776Q-31.762 63.754-32.008 63.754L-32.008 63.458L-30.817 63.372L-30.817 64.106Q-30.703 63.891-30.510 63.723Q-30.317 63.555-30.078 63.463Q-29.840 63.372-29.586 63.372Q-28.418 63.372-28.418 64.450L-28.418 66.340Q-28.418 66.508-28.248 66.555Q-28.078 66.602-27.809 66.602L-27.809 66.899L-29.664 66.899L-29.664 66.602Q-29.391 66.602-29.223 66.555Q-29.055 66.508-29.055 66.340L-29.055 64.465Q-29.055 64.083-29.176 63.854Q-29.297 63.626-29.649 63.626Q-29.961 63.626-30.215 63.788Q-30.469 63.950-30.615 64.219Q-30.762 64.489-30.762 64.786L-30.762 66.340Q-30.762 66.508-30.592 66.555Q-30.422 66.602-30.153 66.602L-30.153 66.899M-25.547 66.977Q-26.028 66.977-26.436 66.733Q-26.844 66.489-27.082 66.075Q-27.321 65.661-27.321 65.172Q-27.321 64.680-27.063 64.264Q-26.805 63.848-26.373 63.610Q-25.942 63.372-25.449 63.372Q-24.828 63.372-24.379 63.809L-24.379 62.180Q-24.379 61.965-24.442 61.870Q-24.504 61.774-24.621 61.753Q-24.738 61.731-24.985 61.731L-24.985 61.434L-23.762 61.348L-23.762 66.157Q-23.762 66.368-23.699 66.463Q-23.637 66.559-23.520 66.581Q-23.403 66.602-23.153 66.602L-23.153 66.899L-24.403 66.977L-24.403 66.493Q-24.867 66.977-25.547 66.977M-25.481 66.723Q-25.141 66.723-24.848 66.532Q-24.555 66.340-24.403 66.044L-24.403 64.212Q-24.551 63.938-24.813 63.782Q-25.074 63.626-25.387 63.626Q-26.012 63.626-26.295 64.073Q-26.578 64.520-26.578 65.180Q-26.578 65.825-26.326 66.274Q-26.074 66.723-25.481 66.723M-22.547 66.067Q-22.547 65.583-22.145 65.288Q-21.742 64.993-21.192 64.874Q-20.641 64.754-20.149 64.754L-20.149 64.465Q-20.149 64.239-20.264 64.032Q-20.379 63.825-20.576 63.706Q-20.774 63.587-21.004 63.587Q-21.430 63.587-21.715 63.692Q-21.645 63.719-21.598 63.774Q-21.551 63.829-21.526 63.899Q-21.500 63.969-21.500 64.044Q-21.500 64.149-21.551 64.241Q-21.602 64.333-21.694 64.383Q-21.785 64.434-21.891 64.434Q-21.996 64.434-22.088 64.383Q-22.180 64.333-22.231 64.241Q-22.281 64.149-22.281 64.044Q-22.281 63.626-21.893 63.479Q-21.504 63.333-21.004 63.333Q-20.672 63.333-20.319 63.463Q-19.965 63.594-19.737 63.848Q-19.508 64.102-19.508 64.450L-19.508 66.251Q-19.508 66.383-19.436 66.493Q-19.363 66.602-19.235 66.602Q-19.110 66.602-19.041 66.497Q-18.973 66.391-18.973 66.251L-18.973 65.739L-18.692 65.739L-18.692 66.251Q-18.692 66.454-18.809 66.612Q-18.926 66.770-19.108 66.854Q-19.289 66.938-19.492 66.938Q-19.723 66.938-19.875 66.766Q-20.028 66.594-20.059 66.364Q-20.219 66.645-20.528 66.811Q-20.836 66.977-21.188 66.977Q-21.699 66.977-22.123 66.754Q-22.547 66.532-22.547 66.067M-21.860 66.067Q-21.860 66.352-21.633 66.538Q-21.406 66.723-21.113 66.723Q-20.867 66.723-20.643 66.606Q-20.418 66.489-20.283 66.286Q-20.149 66.083-20.149 65.829L-20.149 64.997Q-20.414 64.997-20.699 65.051Q-20.985 65.106-21.256 65.235Q-21.528 65.364-21.694 65.571Q-21.860 65.778-21.860 66.067M-16.469 66.899L-18.324 66.899L-18.324 66.602Q-18.051 66.602-17.883 66.555Q-17.715 66.508-17.715 66.340L-17.715 64.204Q-17.715 63.989-17.778 63.893Q-17.840 63.797-17.959 63.776Q-18.078 63.754-18.324 63.754L-18.324 63.458L-17.133 63.372L-17.133 64.106Q-17.020 63.891-16.826 63.723Q-16.633 63.555-16.395 63.463Q-16.156 63.372-15.903 63.372Q-14.942 63.372-14.766 64.083Q-14.582 63.754-14.254 63.563Q-13.926 63.372-13.547 63.372Q-12.371 63.372-12.371 64.450L-12.371 66.340Q-12.371 66.508-12.203 66.555Q-12.035 66.602-11.766 66.602L-11.766 66.899L-13.621 66.899L-13.621 66.602Q-13.348 66.602-13.180 66.557Q-13.012 66.512-13.012 66.340L-13.012 64.465Q-13.012 64.079-13.137 63.852Q-13.262 63.626-13.613 63.626Q-13.918 63.626-14.174 63.788Q-14.430 63.950-14.578 64.219Q-14.727 64.489-14.727 64.786L-14.727 66.340Q-14.727 66.508-14.557 66.555Q-14.387 66.602-14.117 66.602L-14.117 66.899L-15.973 66.899L-15.973 66.602Q-15.699 66.602-15.531 66.555Q-15.363 66.508-15.363 66.340L-15.363 64.465Q-15.363 64.079-15.488 63.852Q-15.613 63.626-15.965 63.626Q-16.270 63.626-16.526 63.788Q-16.781 63.950-16.930 64.219Q-17.078 64.489-17.078 64.786L-17.078 66.340Q-17.078 66.508-16.908 66.555Q-16.738 66.602-16.469 66.602L-16.469 66.899M-11.321 65.145Q-11.321 64.665-11.088 64.249Q-10.856 63.833-10.446 63.583Q-10.035 63.333-9.559 63.333Q-8.828 63.333-8.430 63.774Q-8.031 64.215-8.031 64.946Q-8.031 65.051-8.125 65.075L-10.574 65.075L-10.574 65.145Q-10.574 65.555-10.453 65.911Q-10.332 66.266-10.061 66.483Q-9.789 66.700-9.360 66.700Q-8.996 66.700-8.699 66.471Q-8.403 66.243-8.301 65.891Q-8.293 65.844-8.207 65.829L-8.125 65.829Q-8.031 65.856-8.031 65.938Q-8.031 65.946-8.039 65.977Q-8.102 66.204-8.240 66.387Q-8.379 66.571-8.571 66.704Q-8.762 66.837-8.981 66.907Q-9.199 66.977-9.438 66.977Q-9.809 66.977-10.147 66.840Q-10.485 66.704-10.752 66.452Q-11.020 66.200-11.170 65.860Q-11.321 65.520-11.321 65.145M-10.567 64.837L-8.606 64.837Q-8.606 64.532-8.707 64.241Q-8.809 63.950-9.026 63.768Q-9.242 63.587-9.559 63.587Q-9.860 63.587-10.090 63.774Q-10.321 63.962-10.444 64.253Q-10.567 64.544-10.567 64.837M-5.613 66.899L-7.469 66.899L-7.469 66.602Q-7.196 66.602-7.028 66.555Q-6.860 66.508-6.860 66.340L-6.860 64.204Q-6.860 63.989-6.922 63.893Q-6.985 63.797-7.104 63.776Q-7.223 63.754-7.469 63.754L-7.469 63.458L-6.278 63.372L-6.278 64.106Q-6.164 63.891-5.971 63.723Q-5.778 63.555-5.539 63.463Q-5.301 63.372-5.047 63.372Q-3.879 63.372-3.879 64.450L-3.879 66.340Q-3.879 66.508-3.709 66.555Q-3.539 66.602-3.270 66.602L-3.270 66.899L-5.125 66.899L-5.125 66.602Q-4.852 66.602-4.684 66.555Q-4.516 66.508-4.516 66.340L-4.516 64.465Q-4.516 64.083-4.637 63.854Q-4.758 63.626-5.110 63.626Q-5.422 63.626-5.676 63.788Q-5.930 63.950-6.076 64.219Q-6.223 64.489-6.223 64.786L-6.223 66.340Q-6.223 66.508-6.053 66.555Q-5.883 66.602-5.613 66.602\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(166.43 -114.498)\">\u003Cpath d=\"M-2.408 65.938L-2.408 63.747L-3.111 63.747L-3.111 63.493Q-2.755 63.493-2.513 63.260Q-2.271 63.028-2.160 62.680Q-2.048 62.333-2.048 61.977L-1.767 61.977L-1.767 63.450L-0.591 63.450L-0.591 63.747L-1.767 63.747L-1.767 65.922Q-1.767 66.243-1.648 66.471Q-1.529 66.700-1.248 66.700Q-1.068 66.700-0.951 66.577Q-0.833 66.454-0.781 66.274Q-0.728 66.094-0.728 65.922L-0.728 65.450L-0.447 65.450L-0.447 65.938Q-0.447 66.192-0.552 66.432Q-0.658 66.672-0.855 66.825Q-1.052 66.977-1.310 66.977Q-1.626 66.977-1.878 66.854Q-2.130 66.731-2.269 66.497Q-2.408 66.262-2.408 65.938M0.370 66.067Q0.370 65.583 0.772 65.288Q1.174 64.993 1.725 64.874Q2.276 64.754 2.768 64.754L2.768 64.465Q2.768 64.239 2.653 64.032Q2.538 63.825 2.340 63.706Q2.143 63.587 1.913 63.587Q1.487 63.587 1.202 63.692Q1.272 63.719 1.319 63.774Q1.366 63.829 1.391 63.899Q1.417 63.969 1.417 64.044Q1.417 64.149 1.366 64.241Q1.315 64.333 1.223 64.383Q1.131 64.434 1.026 64.434Q0.920 64.434 0.829 64.383Q0.737 64.333 0.686 64.241Q0.635 64.149 0.635 64.044Q0.635 63.626 1.024 63.479Q1.413 63.333 1.913 63.333Q2.245 63.333 2.598 63.463Q2.952 63.594 3.180 63.848Q3.409 64.102 3.409 64.450L3.409 66.251Q3.409 66.383 3.481 66.493Q3.553 66.602 3.682 66.602Q3.807 66.602 3.875 66.497Q3.944 66.391 3.944 66.251L3.944 65.739L4.225 65.739L4.225 66.251Q4.225 66.454 4.108 66.612Q3.991 66.770 3.809 66.854Q3.627 66.938 3.424 66.938Q3.194 66.938 3.042 66.766Q2.889 66.594 2.858 66.364Q2.698 66.645 2.389 66.811Q2.081 66.977 1.729 66.977Q1.217 66.977 0.793 66.754Q0.370 66.532 0.370 66.067M1.057 66.067Q1.057 66.352 1.284 66.538Q1.510 66.723 1.803 66.723Q2.049 66.723 2.274 66.606Q2.499 66.489 2.633 66.286Q2.768 66.083 2.768 65.829L2.768 64.997Q2.502 64.997 2.217 65.051Q1.932 65.106 1.661 65.235Q1.389 65.364 1.223 65.571Q1.057 65.778 1.057 66.067M6.432 66.899L4.600 66.899L4.600 66.602Q4.874 66.602 5.042 66.555Q5.209 66.508 5.209 66.340L5.209 62.180Q5.209 61.965 5.147 61.870Q5.084 61.774 4.965 61.753Q4.846 61.731 4.600 61.731L4.600 61.434L5.823 61.348L5.823 66.340Q5.823 66.508 5.991 66.555Q6.159 66.602 6.432 66.602\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-39.633 1.458c56.906-25.608 85.358-19.917 119.502 0 34.143 19.916 68.286 39.834 113.81 36.988\" style=\"stroke-dasharray:3.0,2.0;stroke-width:1.2\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(55.427 -84.018)\">\u003Cpath d=\"M-39.395 65.204Q-39.395 64.700-39.139 64.268Q-38.883 63.837-38.447 63.585Q-38.012 63.333-37.512 63.333Q-37.125 63.333-36.783 63.477Q-36.442 63.622-36.180 63.883Q-35.918 64.145-35.776 64.481Q-35.633 64.817-35.633 65.204Q-35.633 65.696-35.897 66.106Q-36.160 66.516-36.590 66.747Q-37.020 66.977-37.512 66.977Q-38.004 66.977-38.438 66.745Q-38.871 66.512-39.133 66.104Q-39.395 65.696-39.395 65.204M-37.512 66.700Q-37.055 66.700-36.803 66.477Q-36.551 66.254-36.463 65.903Q-36.375 65.551-36.375 65.106Q-36.375 64.676-36.469 64.338Q-36.563 64.001-36.817 63.794Q-37.071 63.587-37.512 63.587Q-38.160 63.587-38.404 64.003Q-38.649 64.419-38.649 65.106Q-38.649 65.551-38.561 65.903Q-38.473 66.254-38.221 66.477Q-37.969 66.700-37.512 66.700\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(55.427 -84.018)\">\u003Cpath d=\"M-33.580 66.868L-34.803 64.012Q-34.885 63.837-35.029 63.792Q-35.174 63.747-35.443 63.747L-35.443 63.450L-33.732 63.450L-33.732 63.747Q-34.154 63.747-34.154 63.930Q-34.154 63.965-34.139 64.012L-33.193 66.204L-32.353 64.227Q-32.314 64.149-32.314 64.059Q-32.314 63.919-32.420 63.833Q-32.525 63.747-32.666 63.747L-32.666 63.450L-31.314 63.450L-31.314 63.747Q-31.838 63.747-32.053 64.227L-33.178 66.868Q-33.240 66.977-33.346 66.977L-33.412 66.977Q-33.525 66.977-33.580 66.868\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(55.427 -84.018)\">\u003Cpath d=\"M-31.131 65.145Q-31.131 64.665-30.898 64.249Q-30.666 63.833-30.256 63.583Q-29.846 63.333-29.369 63.333Q-28.639 63.333-28.240 63.774Q-27.842 64.215-27.842 64.946Q-27.842 65.051-27.935 65.075L-30.385 65.075L-30.385 65.145Q-30.385 65.555-30.264 65.911Q-30.142 66.266-29.871 66.483Q-29.599 66.700-29.170 66.700Q-28.806 66.700-28.510 66.471Q-28.213 66.243-28.111 65.891Q-28.103 65.844-28.017 65.829L-27.935 65.829Q-27.842 65.856-27.842 65.938Q-27.842 65.946-27.849 65.977Q-27.912 66.204-28.051 66.387Q-28.189 66.571-28.381 66.704Q-28.572 66.837-28.791 66.907Q-29.010 66.977-29.248 66.977Q-29.619 66.977-29.957 66.840Q-30.295 66.704-30.562 66.452Q-30.830 66.200-30.980 65.860Q-31.131 65.520-31.131 65.145M-30.377 64.837L-28.416 64.837Q-28.416 64.532-28.517 64.241Q-28.619 63.950-28.836 63.768Q-29.053 63.587-29.369 63.587Q-29.670 63.587-29.900 63.774Q-30.131 63.962-30.254 64.253Q-30.377 64.544-30.377 64.837M-25.346 66.899L-27.326 66.899L-27.326 66.602Q-27.056 66.602-26.889 66.557Q-26.721 66.512-26.721 66.340L-26.721 64.204Q-26.721 63.989-26.783 63.893Q-26.846 63.797-26.963 63.776Q-27.080 63.754-27.326 63.754L-27.326 63.458L-26.158 63.372L-26.158 64.157Q-26.080 63.946-25.928 63.760Q-25.775 63.575-25.576 63.473Q-25.377 63.372-25.150 63.372Q-24.904 63.372-24.713 63.516Q-24.521 63.661-24.521 63.891Q-24.521 64.047-24.627 64.157Q-24.732 64.266-24.889 64.266Q-25.045 64.266-25.154 64.157Q-25.264 64.047-25.264 63.891Q-25.264 63.731-25.158 63.626Q-25.482 63.626-25.697 63.854Q-25.912 64.083-26.008 64.422Q-26.103 64.762-26.103 65.067L-26.103 66.340Q-26.103 66.508-25.877 66.555Q-25.650 66.602-25.346 66.602L-25.346 66.899M-23.416 65.938L-23.416 63.747L-24.119 63.747L-24.119 63.493Q-23.764 63.493-23.521 63.260Q-23.279 63.028-23.168 62.680Q-23.056 62.333-23.056 61.977L-22.775 61.977L-22.775 63.450L-21.599 63.450L-21.599 63.747L-22.775 63.747L-22.775 65.922Q-22.775 66.243-22.656 66.471Q-22.537 66.700-22.256 66.700Q-22.076 66.700-21.959 66.577Q-21.842 66.454-21.789 66.274Q-21.736 66.094-21.736 65.922L-21.736 65.450L-21.455 65.450L-21.455 65.938Q-21.455 66.192-21.560 66.432Q-21.666 66.672-21.863 66.825Q-22.060 66.977-22.318 66.977Q-22.635 66.977-22.887 66.854Q-23.139 66.731-23.277 66.497Q-23.416 66.262-23.416 65.938M-20.736 65.204Q-20.736 64.700-20.480 64.268Q-20.224 63.837-19.789 63.585Q-19.353 63.333-18.853 63.333Q-18.467 63.333-18.125 63.477Q-17.783 63.622-17.521 63.883Q-17.260 64.145-17.117 64.481Q-16.974 64.817-16.974 65.204Q-16.974 65.696-17.238 66.106Q-17.502 66.516-17.931 66.747Q-18.361 66.977-18.853 66.977Q-19.346 66.977-19.779 66.745Q-20.213 66.512-20.474 66.104Q-20.736 65.696-20.736 65.204M-18.853 66.700Q-18.396 66.700-18.144 66.477Q-17.892 66.254-17.805 65.903Q-17.717 65.551-17.717 65.106Q-17.717 64.676-17.810 64.338Q-17.904 64.001-18.158 63.794Q-18.412 63.587-18.853 63.587Q-19.502 63.587-19.746 64.003Q-19.990 64.419-19.990 65.106Q-19.990 65.551-19.902 65.903Q-19.814 66.254-19.562 66.477Q-19.310 66.700-18.853 66.700M-14.560 66.899L-16.416 66.899L-16.416 66.602Q-16.142 66.602-15.974 66.555Q-15.806 66.508-15.806 66.340L-15.806 64.204Q-15.806 63.989-15.869 63.893Q-15.931 63.797-16.051 63.776Q-16.170 63.754-16.416 63.754L-16.416 63.458L-15.224 63.372L-15.224 64.106Q-15.111 63.891-14.918 63.723Q-14.724 63.555-14.486 63.463Q-14.248 63.372-13.994 63.372Q-12.826 63.372-12.826 64.450L-12.826 66.340Q-12.826 66.508-12.656 66.555Q-12.486 66.602-12.217 66.602L-12.217 66.899L-14.072 66.899L-14.072 66.602Q-13.799 66.602-13.631 66.555Q-13.463 66.508-13.463 66.340L-13.463 64.465Q-13.463 64.083-13.584 63.854Q-13.705 63.626-14.056 63.626Q-14.369 63.626-14.623 63.788Q-14.877 63.950-15.023 64.219Q-15.170 64.489-15.170 64.786L-15.170 66.340Q-15.170 66.508-15 66.555Q-14.830 66.602-14.560 66.602L-14.560 66.899M-11.771 65.145Q-11.771 64.665-11.539 64.249Q-11.306 63.833-10.896 63.583Q-10.486 63.333-10.010 63.333Q-9.279 63.333-8.881 63.774Q-8.482 64.215-8.482 64.946Q-8.482 65.051-8.576 65.075L-11.025 65.075L-11.025 65.145Q-11.025 65.555-10.904 65.911Q-10.783 66.266-10.512 66.483Q-10.240 66.700-9.810 66.700Q-9.447 66.700-9.150 66.471Q-8.853 66.243-8.752 65.891Q-8.744 65.844-8.658 65.829L-8.576 65.829Q-8.482 65.856-8.482 65.938Q-8.482 65.946-8.490 65.977Q-8.553 66.204-8.691 66.387Q-8.830 66.571-9.021 66.704Q-9.213 66.837-9.431 66.907Q-9.650 66.977-9.889 66.977Q-10.260 66.977-10.598 66.840Q-10.935 66.704-11.203 66.452Q-11.471 66.200-11.621 65.860Q-11.771 65.520-11.771 65.145M-11.017 64.837L-9.056 64.837Q-9.056 64.532-9.158 64.241Q-9.260 63.950-9.476 63.768Q-9.693 63.587-10.010 63.587Q-10.310 63.587-10.541 63.774Q-10.771 63.962-10.894 64.253Q-11.017 64.544-11.017 64.837\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M81.469 1.458a1.6 1.6 0 1 0-3.2 0 1.6 1.6 0 0 0 3.2 0m-1.6 0\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(110.647 -70.397)\">\u003Cpath d=\"M-37.465 66.899L-39.321 66.899L-39.321 66.602Q-39.047 66.602-38.879 66.555Q-38.711 66.508-38.711 66.340L-38.711 64.204Q-38.711 63.989-38.774 63.893Q-38.836 63.797-38.955 63.776Q-39.074 63.754-39.321 63.754L-39.321 63.458L-38.129 63.372L-38.129 64.106Q-38.016 63.891-37.822 63.723Q-37.629 63.555-37.391 63.463Q-37.153 63.372-36.899 63.372Q-35.731 63.372-35.731 64.450L-35.731 66.340Q-35.731 66.508-35.561 66.555Q-35.391 66.602-35.121 66.602L-35.121 66.899L-36.977 66.899L-36.977 66.602Q-36.703 66.602-36.535 66.555Q-36.367 66.508-36.367 66.340L-36.367 64.465Q-36.367 64.083-36.488 63.854Q-36.610 63.626-36.961 63.626Q-37.274 63.626-37.528 63.788Q-37.781 63.950-37.928 64.219Q-38.074 64.489-38.074 64.786L-38.074 66.340Q-38.074 66.508-37.904 66.555Q-37.735 66.602-37.465 66.602L-37.465 66.899M-34.676 65.204Q-34.676 64.700-34.420 64.268Q-34.164 63.837-33.729 63.585Q-33.293 63.333-32.793 63.333Q-32.406 63.333-32.065 63.477Q-31.723 63.622-31.461 63.883Q-31.199 64.145-31.057 64.481Q-30.914 64.817-30.914 65.204Q-30.914 65.696-31.178 66.106Q-31.442 66.516-31.871 66.747Q-32.301 66.977-32.793 66.977Q-33.285 66.977-33.719 66.745Q-34.153 66.512-34.414 66.104Q-34.676 65.696-34.676 65.204M-32.793 66.700Q-32.336 66.700-32.084 66.477Q-31.832 66.254-31.744 65.903Q-31.656 65.551-31.656 65.106Q-31.656 64.676-31.750 64.338Q-31.844 64.001-32.098 63.794Q-32.352 63.587-32.793 63.587Q-33.442 63.587-33.686 64.003Q-33.930 64.419-33.930 65.106Q-33.930 65.551-33.842 65.903Q-33.754 66.254-33.502 66.477Q-33.250 66.700-32.793 66.700\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(110.647 -70.397)\">\u003Cpath d=\"M-28.369 66.977Q-28.850 66.977-29.258 66.733Q-29.666 66.489-29.904 66.075Q-30.143 65.661-30.143 65.172Q-30.143 64.680-29.885 64.264Q-29.627 63.848-29.195 63.610Q-28.764 63.372-28.272 63.372Q-27.651 63.372-27.201 63.809L-27.201 62.180Q-27.201 61.965-27.264 61.870Q-27.326 61.774-27.444 61.753Q-27.561 61.731-27.807 61.731L-27.807 61.434L-26.584 61.348L-26.584 66.157Q-26.584 66.368-26.522 66.463Q-26.459 66.559-26.342 66.581Q-26.225 66.602-25.975 66.602L-25.975 66.899L-27.225 66.977L-27.225 66.493Q-27.690 66.977-28.369 66.977M-28.303 66.723Q-27.963 66.723-27.670 66.532Q-27.377 66.340-27.225 66.044L-27.225 64.212Q-27.373 63.938-27.635 63.782Q-27.897 63.626-28.209 63.626Q-28.834 63.626-29.117 64.073Q-29.401 64.520-29.401 65.180Q-29.401 65.825-29.149 66.274Q-28.897 66.723-28.303 66.723M-25.467 65.145Q-25.467 64.665-25.235 64.249Q-25.002 63.833-24.592 63.583Q-24.182 63.333-23.705 63.333Q-22.975 63.333-22.576 63.774Q-22.178 64.215-22.178 64.946Q-22.178 65.051-22.272 65.075L-24.721 65.075L-24.721 65.145Q-24.721 65.555-24.600 65.911Q-24.479 66.266-24.207 66.483Q-23.936 66.700-23.506 66.700Q-23.143 66.700-22.846 66.471Q-22.549 66.243-22.447 65.891Q-22.440 65.844-22.354 65.829L-22.272 65.829Q-22.178 65.856-22.178 65.938Q-22.178 65.946-22.186 65.977Q-22.248 66.204-22.387 66.387Q-22.526 66.571-22.717 66.704Q-22.908 66.837-23.127 66.907Q-23.346 66.977-23.584 66.977Q-23.955 66.977-24.293 66.840Q-24.631 66.704-24.899 66.452Q-25.166 66.200-25.317 65.860Q-25.467 65.520-25.467 65.145M-24.713 64.837L-22.752 64.837Q-22.752 64.532-22.854 64.241Q-22.955 63.950-23.172 63.768Q-23.389 63.587-23.705 63.587Q-24.006 63.587-24.236 63.774Q-24.467 63.962-24.590 64.253Q-24.713 64.544-24.713 64.837\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Radial pulsation modes shown as displacement against radius; the fundamental mode has all layers moving in phase with a single antinode at the surface, while the overtone has an interior node separating oppositely moving layers.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:287.191px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 215.393 115.320\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M-68.337-43.217H-.05V-71.67h-68.287Z\"\u002F>\u003Cg transform=\"translate(31.555 -112.867)\">\u003Cpath d=\"M-82.282 54.640Q-82.282 54.144-82.032 53.719Q-81.782 53.293-81.362 53.047Q-80.942 52.801-80.442 52.801Q-79.903 52.801-79.512 52.926Q-79.122 53.051-79.122 53.465Q-79.122 53.570-79.172 53.662Q-79.223 53.754-79.315 53.804Q-79.407 53.855-79.516 53.855Q-79.622 53.855-79.713 53.804Q-79.805 53.754-79.856 53.662Q-79.907 53.570-79.907 53.465Q-79.907 53.242-79.739 53.137Q-79.961 53.078-80.434 53.078Q-80.731 53.078-80.946 53.217Q-81.161 53.355-81.292 53.586Q-81.422 53.816-81.481 54.086Q-81.540 54.355-81.540 54.640Q-81.540 55.035-81.407 55.385Q-81.274 55.734-81.002 55.951Q-80.731 56.168-80.333 56.168Q-79.958 56.168-79.682 55.951Q-79.407 55.734-79.305 55.375Q-79.290 55.312-79.227 55.312L-79.122 55.312Q-79.086 55.312-79.061 55.340Q-79.036 55.367-79.036 55.406L-79.036 55.429Q-79.168 55.910-79.553 56.178Q-79.938 56.445-80.442 56.445Q-80.805 56.445-81.139 56.308Q-81.473 56.172-81.733 55.922Q-81.993 55.672-82.137 55.336Q-82.282 55-82.282 54.640M-78.547 54.672Q-78.547 54.168-78.292 53.736Q-78.036 53.304-77.600 53.053Q-77.165 52.801-76.665 52.801Q-76.278 52.801-75.936 52.945Q-75.594 53.090-75.333 53.351Q-75.071 53.613-74.928 53.949Q-74.786 54.285-74.786 54.672Q-74.786 55.164-75.049 55.574Q-75.313 55.984-75.743 56.215Q-76.172 56.445-76.665 56.445Q-77.157 56.445-77.590 56.213Q-78.024 55.980-78.286 55.572Q-78.547 55.164-78.547 54.672M-76.665 56.168Q-76.208 56.168-75.956 55.945Q-75.704 55.722-75.616 55.371Q-75.528 55.019-75.528 54.574Q-75.528 54.144-75.622 53.806Q-75.715 53.469-75.969 53.262Q-76.223 53.054-76.665 53.054Q-77.313 53.054-77.557 53.471Q-77.801 53.887-77.801 54.574Q-77.801 55.019-77.713 55.371Q-77.626 55.722-77.374 55.945Q-77.122 56.168-76.665 56.168M-72.372 56.367L-74.227 56.367L-74.227 56.070Q-73.954 56.070-73.786 56.023Q-73.618 55.976-73.618 55.808L-73.618 53.672Q-73.618 53.457-73.680 53.361Q-73.743 53.265-73.862 53.244Q-73.981 53.222-74.227 53.222L-74.227 52.926L-73.036 52.840L-73.036 53.574Q-72.922 53.359-72.729 53.191Q-72.536 53.023-72.297 52.931Q-72.059 52.840-71.805 52.840Q-70.844 52.840-70.668 53.551Q-70.485 53.222-70.157 53.031Q-69.829 52.840-69.450 52.840Q-68.274 52.840-68.274 53.918L-68.274 55.808Q-68.274 55.976-68.106 56.023Q-67.938 56.070-67.668 56.070L-67.668 56.367L-69.524 56.367L-69.524 56.070Q-69.251 56.070-69.083 56.025Q-68.915 55.980-68.915 55.808L-68.915 53.933Q-68.915 53.547-69.040 53.320Q-69.165 53.094-69.516 53.094Q-69.821 53.094-70.077 53.256Q-70.333 53.418-70.481 53.687Q-70.629 53.957-70.629 54.254L-70.629 55.808Q-70.629 55.976-70.459 56.023Q-70.290 56.070-70.020 56.070L-70.020 56.367L-71.876 56.367L-71.876 56.070Q-71.602 56.070-71.434 56.023Q-71.266 55.976-71.266 55.808L-71.266 53.933Q-71.266 53.547-71.391 53.320Q-71.516 53.094-71.868 53.094Q-72.172 53.094-72.428 53.256Q-72.684 53.418-72.833 53.687Q-72.981 53.957-72.981 54.254L-72.981 55.808Q-72.981 55.976-72.811 56.023Q-72.641 56.070-72.372 56.070L-72.372 56.367M-65.340 57.918L-67.196 57.918L-67.196 57.625Q-66.926 57.625-66.758 57.580Q-66.590 57.535-66.590 57.359L-66.590 53.535Q-66.590 53.328-66.747 53.275Q-66.903 53.222-67.196 53.222L-67.196 52.926L-65.973 52.840L-65.973 53.304Q-65.743 53.082-65.428 52.961Q-65.114 52.840-64.774 52.840Q-64.301 52.840-63.897 53.086Q-63.493 53.332-63.260 53.748Q-63.028 54.164-63.028 54.640Q-63.028 55.015-63.176 55.344Q-63.325 55.672-63.594 55.924Q-63.864 56.176-64.208 56.310Q-64.551 56.445-64.911 56.445Q-65.200 56.445-65.471 56.324Q-65.743 56.203-65.950 55.992L-65.950 57.359Q-65.950 57.535-65.782 57.580Q-65.614 57.625-65.340 57.625L-65.340 57.918M-65.950 53.703L-65.950 55.543Q-65.797 55.832-65.536 56.012Q-65.274 56.191-64.965 56.191Q-64.680 56.191-64.458 56.053Q-64.235 55.914-64.083 55.683Q-63.930 55.453-63.852 55.181Q-63.774 54.910-63.774 54.640Q-63.774 54.308-63.899 53.951Q-64.024 53.594-64.272 53.357Q-64.520 53.121-64.868 53.121Q-65.192 53.121-65.487 53.277Q-65.782 53.433-65.950 53.703M-60.497 56.367L-62.477 56.367L-62.477 56.070Q-62.208 56.070-62.040 56.025Q-61.872 55.980-61.872 55.808L-61.872 53.672Q-61.872 53.457-61.934 53.361Q-61.997 53.265-62.114 53.244Q-62.231 53.222-62.477 53.222L-62.477 52.926L-61.309 52.840L-61.309 53.625Q-61.231 53.414-61.079 53.228Q-60.926 53.043-60.727 52.941Q-60.528 52.840-60.301 52.840Q-60.055 52.840-59.864 52.984Q-59.672 53.129-59.672 53.359Q-59.672 53.515-59.778 53.625Q-59.883 53.734-60.040 53.734Q-60.196 53.734-60.305 53.625Q-60.415 53.515-60.415 53.359Q-60.415 53.199-60.309 53.094Q-60.633 53.094-60.848 53.322Q-61.063 53.551-61.159 53.890Q-61.254 54.230-61.254 54.535L-61.254 55.808Q-61.254 55.976-61.028 56.023Q-60.801 56.070-60.497 56.070L-60.497 56.367M-59.192 54.613Q-59.192 54.133-58.959 53.717Q-58.727 53.301-58.317 53.051Q-57.907 52.801-57.430 52.801Q-56.700 52.801-56.301 53.242Q-55.903 53.683-55.903 54.414Q-55.903 54.519-55.997 54.543L-58.446 54.543L-58.446 54.613Q-58.446 55.023-58.325 55.379Q-58.204 55.734-57.932 55.951Q-57.661 56.168-57.231 56.168Q-56.868 56.168-56.571 55.939Q-56.274 55.711-56.172 55.359Q-56.165 55.312-56.079 55.297L-55.997 55.297Q-55.903 55.324-55.903 55.406Q-55.903 55.414-55.911 55.445Q-55.973 55.672-56.112 55.855Q-56.251 56.039-56.442 56.172Q-56.633 56.304-56.852 56.375Q-57.071 56.445-57.309 56.445Q-57.680 56.445-58.018 56.308Q-58.356 56.172-58.624 55.920Q-58.891 55.668-59.042 55.328Q-59.192 54.988-59.192 54.613M-58.438 54.304L-56.477 54.304Q-56.477 54-56.579 53.709Q-56.680 53.418-56.897 53.236Q-57.114 53.054-57.430 53.054Q-57.731 53.054-57.961 53.242Q-58.192 53.429-58.315 53.721Q-58.438 54.012-58.438 54.304M-55.372 56.359L-55.372 55.137Q-55.372 55.109-55.340 55.078Q-55.309 55.047-55.286 55.047L-55.180 55.047Q-55.110 55.047-55.094 55.109Q-55.032 55.429-54.893 55.670Q-54.754 55.910-54.522 56.051Q-54.290 56.191-53.981 56.191Q-53.743 56.191-53.534 56.131Q-53.325 56.070-53.188 55.922Q-53.051 55.773-53.051 55.527Q-53.051 55.273-53.262 55.107Q-53.473 54.941-53.743 54.887L-54.364 54.773Q-54.770 54.695-55.071 54.439Q-55.372 54.183-55.372 53.808Q-55.372 53.441-55.170 53.219Q-54.969 52.996-54.645 52.898Q-54.321 52.801-53.981 52.801Q-53.516 52.801-53.219 53.008L-52.997 52.824Q-52.973 52.801-52.942 52.801L-52.891 52.801Q-52.860 52.801-52.833 52.828Q-52.805 52.855-52.805 52.887L-52.805 53.871Q-52.805 53.902-52.831 53.931Q-52.856 53.961-52.891 53.961L-52.997 53.961Q-53.032 53.961-53.059 53.933Q-53.086 53.906-53.086 53.871Q-53.086 53.472-53.338 53.252Q-53.590 53.031-53.989 53.031Q-54.344 53.031-54.627 53.154Q-54.911 53.277-54.911 53.582Q-54.911 53.801-54.709 53.933Q-54.508 54.066-54.262 54.109L-53.637 54.222Q-53.208 54.312-52.899 54.609Q-52.590 54.906-52.590 55.320Q-52.590 55.890-52.989 56.168Q-53.387 56.445-53.981 56.445Q-54.532 56.445-54.883 56.109L-55.180 56.422Q-55.204 56.445-55.239 56.445L-55.286 56.445Q-55.309 56.445-55.340 56.414Q-55.372 56.383-55.372 56.359M-52.020 56.359L-52.020 55.137Q-52.020 55.109-51.989 55.078Q-51.958 55.047-51.934 55.047L-51.829 55.047Q-51.758 55.047-51.743 55.109Q-51.680 55.429-51.542 55.670Q-51.403 55.910-51.170 56.051Q-50.938 56.191-50.629 56.191Q-50.391 56.191-50.182 56.131Q-49.973 56.070-49.836 55.922Q-49.700 55.773-49.700 55.527Q-49.700 55.273-49.911 55.107Q-50.122 54.941-50.391 54.887L-51.012 54.773Q-51.418 54.695-51.719 54.439Q-52.020 54.183-52.020 53.808Q-52.020 53.441-51.819 53.219Q-51.618 52.996-51.293 52.898Q-50.969 52.801-50.629 52.801Q-50.165 52.801-49.868 53.008L-49.645 52.824Q-49.622 52.801-49.590 52.801L-49.540 52.801Q-49.508 52.801-49.481 52.828Q-49.454 52.855-49.454 52.887L-49.454 53.871Q-49.454 53.902-49.479 53.931Q-49.504 53.961-49.540 53.961L-49.645 53.961Q-49.680 53.961-49.708 53.933Q-49.735 53.906-49.735 53.871Q-49.735 53.472-49.987 53.252Q-50.239 53.031-50.637 53.031Q-50.993 53.031-51.276 53.154Q-51.559 53.277-51.559 53.582Q-51.559 53.801-51.358 53.933Q-51.157 54.066-50.911 54.109L-50.286 54.222Q-49.856 54.312-49.547 54.609Q-49.239 54.906-49.239 55.320Q-49.239 55.890-49.637 56.168Q-50.036 56.445-50.629 56.445Q-51.180 56.445-51.532 56.109L-51.829 56.422Q-51.852 56.445-51.887 56.445L-51.934 56.445Q-51.958 56.445-51.989 56.414Q-52.020 56.383-52.020 56.359\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M68.237-43.217h68.286V-71.67H68.237Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(160.808 -106.378)\">\u003Cpath d=\"M-82.325 45.172Q-82.325 44.668-82.069 44.236Q-81.813 43.804-81.377 43.553Q-80.942 43.301-80.442 43.301Q-80.055 43.301-79.713 43.445Q-79.372 43.590-79.110 43.851Q-78.848 44.113-78.706 44.449Q-78.563 44.785-78.563 45.172Q-78.563 45.664-78.827 46.074Q-79.090 46.484-79.520 46.715Q-79.950 46.945-80.442 46.945Q-80.934 46.945-81.368 46.713Q-81.801 46.480-82.063 46.072Q-82.325 45.664-82.325 45.172M-80.442 46.668Q-79.985 46.668-79.733 46.445Q-79.481 46.222-79.393 45.871Q-79.305 45.519-79.305 45.074Q-79.305 44.644-79.399 44.306Q-79.493 43.969-79.747 43.762Q-80.001 43.554-80.442 43.554Q-81.090 43.554-81.334 43.971Q-81.579 44.387-81.579 45.074Q-81.579 45.519-81.491 45.871Q-81.403 46.222-81.151 46.445Q-80.899 46.668-80.442 46.668M-76.196 48.418L-78.051 48.418L-78.051 48.125Q-77.782 48.125-77.614 48.080Q-77.446 48.035-77.446 47.859L-77.446 44.035Q-77.446 43.828-77.602 43.775Q-77.758 43.722-78.051 43.722L-78.051 43.426L-76.829 43.340L-76.829 43.804Q-76.598 43.582-76.284 43.461Q-75.969 43.340-75.629 43.340Q-75.157 43.340-74.752 43.586Q-74.348 43.832-74.116 44.248Q-73.883 44.664-73.883 45.140Q-73.883 45.515-74.032 45.844Q-74.180 46.172-74.450 46.424Q-74.719 46.676-75.063 46.810Q-75.407 46.945-75.766 46.945Q-76.055 46.945-76.327 46.824Q-76.598 46.703-76.805 46.492L-76.805 47.859Q-76.805 48.035-76.637 48.080Q-76.469 48.125-76.196 48.125L-76.196 48.418M-76.805 44.203L-76.805 46.043Q-76.653 46.332-76.391 46.512Q-76.129 46.691-75.821 46.691Q-75.536 46.691-75.313 46.553Q-75.090 46.414-74.938 46.183Q-74.786 45.953-74.708 45.681Q-74.629 45.410-74.629 45.140Q-74.629 44.808-74.754 44.451Q-74.879 44.094-75.127 43.857Q-75.376 43.621-75.723 43.621Q-76.047 43.621-76.342 43.777Q-76.637 43.933-76.805 44.203M-73.262 46.035Q-73.262 45.551-72.860 45.256Q-72.458 44.961-71.907 44.842Q-71.356 44.722-70.864 44.722L-70.864 44.433Q-70.864 44.207-70.979 44Q-71.094 43.793-71.292 43.674Q-71.489 43.554-71.719 43.554Q-72.145 43.554-72.430 43.660Q-72.360 43.687-72.313 43.742Q-72.266 43.797-72.241 43.867Q-72.215 43.937-72.215 44.012Q-72.215 44.117-72.266 44.209Q-72.317 44.301-72.409 44.351Q-72.501 44.402-72.606 44.402Q-72.711 44.402-72.803 44.351Q-72.895 44.301-72.946 44.209Q-72.997 44.117-72.997 44.012Q-72.997 43.594-72.608 43.447Q-72.219 43.301-71.719 43.301Q-71.387 43.301-71.034 43.431Q-70.680 43.562-70.452 43.816Q-70.223 44.070-70.223 44.418L-70.223 46.219Q-70.223 46.351-70.151 46.461Q-70.079 46.570-69.950 46.570Q-69.825 46.570-69.756 46.465Q-69.688 46.359-69.688 46.219L-69.688 45.707L-69.407 45.707L-69.407 46.219Q-69.407 46.422-69.524 46.580Q-69.641 46.738-69.823 46.822Q-70.004 46.906-70.208 46.906Q-70.438 46.906-70.590 46.734Q-70.743 46.562-70.774 46.332Q-70.934 46.613-71.243 46.779Q-71.551 46.945-71.903 46.945Q-72.415 46.945-72.838 46.722Q-73.262 46.500-73.262 46.035M-72.575 46.035Q-72.575 46.320-72.348 46.506Q-72.122 46.691-71.829 46.691Q-71.583 46.691-71.358 46.574Q-71.133 46.457-70.999 46.254Q-70.864 46.051-70.864 45.797L-70.864 44.965Q-71.129 44.965-71.415 45.019Q-71.700 45.074-71.971 45.203Q-72.243 45.332-72.409 45.539Q-72.575 45.746-72.575 46.035M-69.071 45.140Q-69.071 44.644-68.821 44.219Q-68.571 43.793-68.151 43.547Q-67.731 43.301-67.231 43.301Q-66.692 43.301-66.301 43.426Q-65.911 43.551-65.911 43.965Q-65.911 44.070-65.961 44.162Q-66.012 44.254-66.104 44.304Q-66.196 44.355-66.305 44.355Q-66.411 44.355-66.502 44.304Q-66.594 44.254-66.645 44.162Q-66.696 44.070-66.696 43.965Q-66.696 43.742-66.528 43.637Q-66.751 43.578-67.223 43.578Q-67.520 43.578-67.735 43.717Q-67.950 43.855-68.081 44.086Q-68.211 44.316-68.270 44.586Q-68.329 44.855-68.329 45.140Q-68.329 45.535-68.196 45.885Q-68.063 46.234-67.792 46.451Q-67.520 46.668-67.122 46.668Q-66.747 46.668-66.471 46.451Q-66.196 46.234-66.094 45.875Q-66.079 45.812-66.016 45.812L-65.911 45.812Q-65.876 45.812-65.850 45.840Q-65.825 45.867-65.825 45.906L-65.825 45.929Q-65.958 46.410-66.342 46.678Q-66.727 46.945-67.231 46.945Q-67.594 46.945-67.928 46.808Q-68.262 46.672-68.522 46.422Q-68.782 46.172-68.926 45.836Q-69.071 45.500-69.071 45.140M-63.477 46.867L-65.254 46.867L-65.254 46.570Q-64.981 46.570-64.813 46.523Q-64.645 46.476-64.645 46.308L-64.645 44.172Q-64.645 43.957-64.702 43.861Q-64.758 43.765-64.872 43.744Q-64.985 43.722-65.231 43.722L-65.231 43.426L-64.032 43.340L-64.032 46.308Q-64.032 46.476-63.885 46.523Q-63.739 46.570-63.477 46.570L-63.477 46.867M-64.918 41.945Q-64.918 41.754-64.784 41.623Q-64.649 41.492-64.454 41.492Q-64.333 41.492-64.229 41.554Q-64.126 41.617-64.063 41.721Q-64.001 41.824-64.001 41.945Q-64.001 42.140-64.131 42.275Q-64.262 42.410-64.454 42.410Q-64.653 42.410-64.786 42.277Q-64.918 42.144-64.918 41.945M-62.352 45.906L-62.352 43.715L-63.055 43.715L-63.055 43.461Q-62.700 43.461-62.458 43.228Q-62.215 42.996-62.104 42.648Q-61.993 42.301-61.993 41.945L-61.711 41.945L-61.711 43.418L-60.536 43.418L-60.536 43.715L-61.711 43.715L-61.711 45.890Q-61.711 46.211-61.592 46.439Q-61.473 46.668-61.192 46.668Q-61.012 46.668-60.895 46.545Q-60.778 46.422-60.725 46.242Q-60.672 46.062-60.672 45.890L-60.672 45.418L-60.391 45.418L-60.391 45.906Q-60.391 46.160-60.497 46.400Q-60.602 46.640-60.799 46.793Q-60.997 46.945-61.254 46.945Q-61.571 46.945-61.823 46.822Q-62.075 46.699-62.213 46.465Q-62.352 46.230-62.352 45.906\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(160.808 -106.378)\">\u003Cpath d=\"M-59.476 48.164Q-59.362 48.242-59.187 48.242Q-58.898 48.242-58.677 48.029Q-58.456 47.816-58.331 47.515L-58.042 46.867L-59.316 43.980Q-59.398 43.804-59.542 43.760Q-59.687 43.715-59.956 43.715L-59.956 43.418L-58.237 43.418L-58.237 43.715Q-58.659 43.715-58.659 43.898Q-58.659 43.910-58.644 43.980L-57.706 46.105L-56.874 44.195Q-56.835 44.105-56.835 44.027Q-56.835 43.887-56.937 43.801Q-57.038 43.715-57.179 43.715L-57.179 43.418L-55.827 43.418L-55.827 43.715Q-56.081 43.715-56.275 43.840Q-56.468 43.965-56.573 44.195L-58.019 47.515Q-58.132 47.769-58.298 47.992Q-58.464 48.215-58.693 48.357Q-58.921 48.500-59.187 48.500Q-59.484 48.500-59.724 48.308Q-59.964 48.117-59.964 47.828Q-59.964 47.672-59.859 47.570Q-59.753 47.469-59.605 47.469Q-59.499 47.469-59.419 47.515Q-59.339 47.562-59.292 47.640Q-59.245 47.719-59.245 47.828Q-59.245 47.949-59.306 48.037Q-59.366 48.125-59.476 48.164\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(160.808 -106.378)\">\u003Cpath d=\"M-50.567 46.867L-52.547 46.867L-52.547 46.570Q-52.278 46.570-52.110 46.525Q-51.942 46.480-51.942 46.308L-51.942 44.172Q-51.942 43.957-52.004 43.861Q-52.067 43.765-52.184 43.744Q-52.301 43.722-52.547 43.722L-52.547 43.426L-51.379 43.340L-51.379 44.125Q-51.301 43.914-51.149 43.728Q-50.997 43.543-50.797 43.441Q-50.598 43.340-50.372 43.340Q-50.126 43.340-49.934 43.484Q-49.743 43.629-49.743 43.859Q-49.743 44.015-49.848 44.125Q-49.954 44.234-50.110 44.234Q-50.266 44.234-50.376 44.125Q-50.485 44.015-50.485 43.859Q-50.485 43.699-50.379 43.594Q-50.704 43.594-50.918 43.822Q-51.133 44.051-51.229 44.390Q-51.325 44.730-51.325 45.035L-51.325 46.308Q-51.325 46.476-51.098 46.523Q-50.872 46.570-50.567 46.570L-50.567 46.867M-47.403 46.867L-49.180 46.867L-49.180 46.570Q-48.907 46.570-48.739 46.523Q-48.571 46.476-48.571 46.308L-48.571 44.172Q-48.571 43.957-48.627 43.861Q-48.684 43.765-48.797 43.744Q-48.911 43.722-49.157 43.722L-49.157 43.426L-47.958 43.340L-47.958 46.308Q-47.958 46.476-47.811 46.523Q-47.665 46.570-47.403 46.570L-47.403 46.867M-48.844 41.945Q-48.844 41.754-48.709 41.623Q-48.575 41.492-48.379 41.492Q-48.258 41.492-48.155 41.554Q-48.051 41.617-47.989 41.721Q-47.926 41.824-47.926 41.945Q-47.926 42.140-48.057 42.275Q-48.188 42.410-48.379 42.410Q-48.579 42.410-48.711 42.277Q-48.844 42.144-48.844 41.945M-46.860 46.859L-46.860 45.637Q-46.860 45.609-46.829 45.578Q-46.797 45.547-46.774 45.547L-46.668 45.547Q-46.598 45.547-46.583 45.609Q-46.520 45.929-46.381 46.170Q-46.243 46.410-46.010 46.551Q-45.778 46.691-45.469 46.691Q-45.231 46.691-45.022 46.631Q-44.813 46.570-44.676 46.422Q-44.540 46.273-44.540 46.027Q-44.540 45.773-44.751 45.607Q-44.961 45.441-45.231 45.387L-45.852 45.273Q-46.258 45.195-46.559 44.939Q-46.860 44.683-46.860 44.308Q-46.860 43.941-46.659 43.719Q-46.458 43.496-46.133 43.398Q-45.809 43.301-45.469 43.301Q-45.004 43.301-44.708 43.508L-44.485 43.324Q-44.461 43.301-44.430 43.301L-44.379 43.301Q-44.348 43.301-44.321 43.328Q-44.293 43.355-44.293 43.387L-44.293 44.371Q-44.293 44.402-44.319 44.431Q-44.344 44.461-44.379 44.461L-44.485 44.461Q-44.520 44.461-44.547 44.433Q-44.575 44.406-44.575 44.371Q-44.575 43.972-44.827 43.752Q-45.079 43.531-45.477 43.531Q-45.833 43.531-46.116 43.654Q-46.399 43.777-46.399 44.082Q-46.399 44.301-46.198 44.433Q-45.997 44.566-45.751 44.609L-45.126 44.722Q-44.696 44.812-44.387 45.109Q-44.079 45.406-44.079 45.820Q-44.079 46.390-44.477 46.668Q-44.876 46.945-45.469 46.945Q-46.020 46.945-46.372 46.609L-46.668 46.922Q-46.692 46.945-46.727 46.945L-46.774 46.945Q-46.797 46.945-46.829 46.914Q-46.860 46.883-46.860 46.859M-43.551 45.113Q-43.551 44.633-43.319 44.217Q-43.086 43.801-42.676 43.551Q-42.266 43.301-41.790 43.301Q-41.059 43.301-40.661 43.742Q-40.262 44.183-40.262 44.914Q-40.262 45.019-40.356 45.043L-42.805 45.043L-42.805 45.113Q-42.805 45.523-42.684 45.879Q-42.563 46.234-42.292 46.451Q-42.020 46.668-41.590 46.668Q-41.227 46.668-40.930 46.439Q-40.633 46.211-40.532 45.859Q-40.524 45.812-40.438 45.797L-40.356 45.797Q-40.262 45.824-40.262 45.906Q-40.262 45.914-40.270 45.945Q-40.333 46.172-40.471 46.355Q-40.610 46.539-40.801 46.672Q-40.993 46.804-41.211 46.875Q-41.430 46.945-41.668 46.945Q-42.040 46.945-42.377 46.808Q-42.715 46.672-42.983 46.420Q-43.251 46.168-43.401 45.828Q-43.551 45.488-43.551 45.113M-42.797 44.804L-40.836 44.804Q-40.836 44.500-40.938 44.209Q-41.040 43.918-41.256 43.736Q-41.473 43.554-41.790 43.554Q-42.090 43.554-42.321 43.742Q-42.551 43.929-42.674 44.221Q-42.797 44.512-42.797 44.804M-39.731 46.859L-39.731 45.637Q-39.731 45.609-39.700 45.578Q-39.668 45.547-39.645 45.547L-39.540 45.547Q-39.469 45.547-39.454 45.609Q-39.391 45.929-39.252 46.170Q-39.114 46.410-38.881 46.551Q-38.649 46.691-38.340 46.691Q-38.102 46.691-37.893 46.631Q-37.684 46.570-37.547 46.422Q-37.411 46.273-37.411 46.027Q-37.411 45.773-37.622 45.607Q-37.833 45.441-38.102 45.387L-38.723 45.273Q-39.129 45.195-39.430 44.939Q-39.731 44.683-39.731 44.308Q-39.731 43.941-39.530 43.719Q-39.329 43.496-39.004 43.398Q-38.680 43.301-38.340 43.301Q-37.876 43.301-37.579 43.508L-37.356 43.324Q-37.333 43.301-37.301 43.301L-37.251 43.301Q-37.219 43.301-37.192 43.328Q-37.165 43.355-37.165 43.387L-37.165 44.371Q-37.165 44.402-37.190 44.431Q-37.215 44.461-37.251 44.461L-37.356 44.461Q-37.391 44.461-37.418 44.433Q-37.446 44.406-37.446 44.371Q-37.446 43.972-37.698 43.752Q-37.950 43.531-38.348 43.531Q-38.704 43.531-38.987 43.654Q-39.270 43.777-39.270 44.082Q-39.270 44.301-39.069 44.433Q-38.868 44.566-38.622 44.609L-37.997 44.722Q-37.567 44.812-37.258 45.109Q-36.950 45.406-36.950 45.820Q-36.950 46.390-37.348 46.668Q-37.747 46.945-38.340 46.945Q-38.891 46.945-39.243 46.609L-39.540 46.922Q-39.563 46.945-39.598 46.945L-39.645 46.945Q-39.668 46.945-39.700 46.914Q-39.731 46.883-39.731 46.859M-35.836 48.273Q-35.836 48.250-35.805 48.203Q-35.512 47.941-35.346 47.574Q-35.180 47.207-35.180 46.820L-35.180 46.762Q-35.309 46.867-35.477 46.867Q-35.668 46.867-35.805 46.734Q-35.942 46.601-35.942 46.402Q-35.942 46.211-35.805 46.078Q-35.668 45.945-35.477 45.945Q-35.176 45.945-35.051 46.215Q-34.926 46.484-34.926 46.820Q-34.926 47.269-35.108 47.683Q-35.290 48.097-35.629 48.394Q-35.653 48.418-35.692 48.418Q-35.739 48.418-35.788 48.373Q-35.836 48.328-35.836 48.273\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(160.808 -106.378)\">\u003Cpath d=\"M-77.066 56.367L-78.921 56.367L-78.921 56.070Q-78.648 56.070-78.480 56.023Q-78.312 55.976-78.312 55.808L-78.312 51.648Q-78.312 51.433-78.375 51.338Q-78.437 51.242-78.556 51.221Q-78.675 51.199-78.921 51.199L-78.921 50.902L-77.699 50.816L-77.699 53.519Q-77.574 53.308-77.386 53.158Q-77.199 53.008-76.972 52.924Q-76.746 52.840-76.500 52.840Q-75.332 52.840-75.332 53.918L-75.332 55.808Q-75.332 55.976-75.162 56.023Q-74.992 56.070-74.722 56.070L-74.722 56.367L-76.578 56.367L-76.578 56.070Q-76.304 56.070-76.136 56.023Q-75.968 55.976-75.968 55.808L-75.968 53.933Q-75.968 53.551-76.089 53.322Q-76.211 53.094-76.562 53.094Q-76.875 53.094-77.129 53.256Q-77.382 53.418-77.529 53.687Q-77.675 53.957-77.675 54.254L-77.675 55.808Q-77.675 55.976-77.505 56.023Q-77.336 56.070-77.066 56.070L-77.066 56.367M-74.277 54.613Q-74.277 54.133-74.045 53.717Q-73.812 53.301-73.402 53.051Q-72.992 52.801-72.515 52.801Q-71.785 52.801-71.386 53.242Q-70.988 53.683-70.988 54.414Q-70.988 54.519-71.082 54.543L-73.531 54.543L-73.531 54.613Q-73.531 55.023-73.410 55.379Q-73.289 55.734-73.017 55.951Q-72.746 56.168-72.316 56.168Q-71.953 56.168-71.656 55.939Q-71.359 55.711-71.257 55.359Q-71.250 55.312-71.164 55.297L-71.082 55.297Q-70.988 55.324-70.988 55.406Q-70.988 55.414-70.996 55.445Q-71.058 55.672-71.197 55.855Q-71.336 56.039-71.527 56.172Q-71.718 56.304-71.937 56.375Q-72.156 56.445-72.394 56.445Q-72.765 56.445-73.103 56.308Q-73.441 56.172-73.709 55.920Q-73.976 55.668-74.127 55.328Q-74.277 54.988-74.277 54.613M-73.523 54.304L-71.562 54.304Q-71.562 54-71.664 53.709Q-71.765 53.418-71.982 53.236Q-72.199 53.054-72.515 53.054Q-72.816 53.054-73.046 53.242Q-73.277 53.429-73.400 53.721Q-73.523 54.012-73.523 54.304M-70.402 55.535Q-70.402 55.051-70 54.756Q-69.597 54.461-69.046 54.342Q-68.496 54.222-68.004 54.222L-68.004 53.933Q-68.004 53.707-68.119 53.500Q-68.234 53.293-68.431 53.174Q-68.629 53.054-68.859 53.054Q-69.285 53.054-69.570 53.160Q-69.500 53.187-69.453 53.242Q-69.406 53.297-69.380 53.367Q-69.355 53.437-69.355 53.512Q-69.355 53.617-69.406 53.709Q-69.457 53.801-69.548 53.851Q-69.640 53.902-69.746 53.902Q-69.851 53.902-69.943 53.851Q-70.035 53.801-70.086 53.709Q-70.136 53.617-70.136 53.512Q-70.136 53.094-69.748 52.947Q-69.359 52.801-68.859 52.801Q-68.527 52.801-68.173 52.931Q-67.820 53.062-67.591 53.316Q-67.363 53.570-67.363 53.918L-67.363 55.719Q-67.363 55.851-67.291 55.961Q-67.218 56.070-67.089 56.070Q-66.964 56.070-66.896 55.965Q-66.828 55.859-66.828 55.719L-66.828 55.207L-66.546 55.207L-66.546 55.719Q-66.546 55.922-66.664 56.080Q-66.781 56.238-66.963 56.322Q-67.144 56.406-67.347 56.406Q-67.578 56.406-67.730 56.234Q-67.882 56.062-67.914 55.832Q-68.074 56.113-68.382 56.279Q-68.691 56.445-69.043 56.445Q-69.554 56.445-69.978 56.222Q-70.402 56-70.402 55.535M-69.714 55.535Q-69.714 55.820-69.488 56.006Q-69.261 56.191-68.968 56.191Q-68.722 56.191-68.498 56.074Q-68.273 55.957-68.138 55.754Q-68.004 55.551-68.004 55.297L-68.004 54.465Q-68.269 54.465-68.554 54.519Q-68.839 54.574-69.111 54.703Q-69.382 54.832-69.548 55.039Q-69.714 55.246-69.714 55.535M-65.629 55.406L-65.629 53.215L-66.332 53.215L-66.332 52.961Q-65.976 52.961-65.734 52.728Q-65.492 52.496-65.380 52.148Q-65.269 51.801-65.269 51.445L-64.988 51.445L-64.988 52.918L-63.812 52.918L-63.812 53.215L-64.988 53.215L-64.988 55.390Q-64.988 55.711-64.869 55.939Q-64.750 56.168-64.468 56.168Q-64.289 56.168-64.171 56.045Q-64.054 55.922-64.002 55.742Q-63.949 55.562-63.949 55.390L-63.949 54.918L-63.668 54.918L-63.668 55.406Q-63.668 55.660-63.773 55.900Q-63.879 56.140-64.076 56.293Q-64.273 56.445-64.531 56.445Q-64.847 56.445-65.099 56.322Q-65.351 56.199-65.490 55.965Q-65.629 55.730-65.629 55.406\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(160.808 -106.378)\">\u003Cpath d=\"M-60.064 56.359L-60.064 55.137Q-60.064 55.109-60.032 55.078Q-60.001 55.047-59.978 55.047L-59.872 55.047Q-59.802 55.047-59.786 55.109Q-59.724 55.429-59.585 55.670Q-59.447 55.910-59.214 56.051Q-58.982 56.191-58.673 56.191Q-58.435 56.191-58.226 56.131Q-58.017 56.070-57.880 55.922Q-57.743 55.773-57.743 55.527Q-57.743 55.273-57.954 55.107Q-58.165 54.941-58.435 54.887L-59.056 54.773Q-59.462 54.695-59.763 54.439Q-60.064 54.183-60.064 53.808Q-60.064 53.441-59.863 53.219Q-59.661 52.996-59.337 52.898Q-59.013 52.801-58.673 52.801Q-58.208 52.801-57.911 53.008L-57.689 52.824Q-57.665 52.801-57.634 52.801L-57.583 52.801Q-57.552 52.801-57.525 52.828Q-57.497 52.855-57.497 52.887L-57.497 53.871Q-57.497 53.902-57.523 53.931Q-57.548 53.961-57.583 53.961L-57.689 53.961Q-57.724 53.961-57.751 53.933Q-57.779 53.906-57.779 53.871Q-57.779 53.472-58.031 53.252Q-58.282 53.031-58.681 53.031Q-59.036 53.031-59.320 53.154Q-59.603 53.277-59.603 53.582Q-59.603 53.801-59.402 53.933Q-59.200 54.066-58.954 54.109L-58.329 54.222Q-57.900 54.312-57.591 54.609Q-57.282 54.906-57.282 55.320Q-57.282 55.890-57.681 56.168Q-58.079 56.445-58.673 56.445Q-59.224 56.445-59.575 56.109L-59.872 56.422Q-59.896 56.445-59.931 56.445L-59.978 56.445Q-60.001 56.445-60.032 56.414Q-60.064 56.383-60.064 56.359M-56.130 55.406L-56.130 53.215L-56.833 53.215L-56.833 52.961Q-56.478 52.961-56.236 52.728Q-55.993 52.496-55.882 52.148Q-55.771 51.801-55.771 51.445L-55.490 51.445L-55.490 52.918L-54.314 52.918L-54.314 53.215L-55.490 53.215L-55.490 55.390Q-55.490 55.711-55.370 55.939Q-55.251 56.168-54.970 56.168Q-54.790 56.168-54.673 56.045Q-54.556 55.922-54.503 55.742Q-54.450 55.562-54.450 55.390L-54.450 54.918L-54.169 54.918L-54.169 55.406Q-54.169 55.660-54.275 55.900Q-54.380 56.140-54.577 56.293Q-54.775 56.445-55.032 56.445Q-55.349 56.445-55.601 56.322Q-55.853 56.199-55.991 55.965Q-56.130 55.730-56.130 55.406M-53.450 54.672Q-53.450 54.168-53.195 53.736Q-52.939 53.304-52.503 53.053Q-52.068 52.801-51.568 52.801Q-51.181 52.801-50.839 52.945Q-50.497 53.090-50.236 53.351Q-49.974 53.613-49.831 53.949Q-49.689 54.285-49.689 54.672Q-49.689 55.164-49.952 55.574Q-50.216 55.984-50.646 56.215Q-51.075 56.445-51.568 56.445Q-52.060 56.445-52.493 56.213Q-52.927 55.980-53.189 55.572Q-53.450 55.164-53.450 54.672M-51.568 56.168Q-51.111 56.168-50.859 55.945Q-50.607 55.722-50.519 55.371Q-50.431 55.019-50.431 54.574Q-50.431 54.144-50.525 53.806Q-50.618 53.469-50.872 53.262Q-51.126 53.054-51.568 53.054Q-52.216 53.054-52.460 53.471Q-52.704 53.887-52.704 54.574Q-52.704 55.019-52.616 55.371Q-52.529 55.722-52.277 55.945Q-52.025 56.168-51.568 56.168M-47.197 56.367L-49.177 56.367L-49.177 56.070Q-48.907 56.070-48.740 56.025Q-48.572 55.980-48.572 55.808L-48.572 53.672Q-48.572 53.457-48.634 53.361Q-48.697 53.265-48.814 53.244Q-48.931 53.222-49.177 53.222L-49.177 52.926L-48.009 52.840L-48.009 53.625Q-47.931 53.414-47.779 53.228Q-47.626 53.043-47.427 52.941Q-47.228 52.840-47.001 52.840Q-46.755 52.840-46.564 52.984Q-46.372 53.129-46.372 53.359Q-46.372 53.515-46.478 53.625Q-46.583 53.734-46.740 53.734Q-46.896 53.734-47.005 53.625Q-47.115 53.515-47.115 53.359Q-47.115 53.199-47.009 53.094Q-47.333 53.094-47.548 53.322Q-47.763 53.551-47.859 53.890Q-47.954 54.230-47.954 54.535L-47.954 55.808Q-47.954 55.976-47.728 56.023Q-47.501 56.070-47.197 56.070L-47.197 56.367M-45.892 54.613Q-45.892 54.133-45.659 53.717Q-45.427 53.301-45.017 53.051Q-44.607 52.801-44.130 52.801Q-43.400 52.801-43.001 53.242Q-42.603 53.683-42.603 54.414Q-42.603 54.519-42.697 54.543L-45.146 54.543L-45.146 54.613Q-45.146 55.023-45.025 55.379Q-44.904 55.734-44.632 55.951Q-44.361 56.168-43.931 56.168Q-43.568 56.168-43.271 55.939Q-42.974 55.711-42.872 55.359Q-42.865 55.312-42.779 55.297L-42.697 55.297Q-42.603 55.324-42.603 55.406Q-42.603 55.414-42.611 55.445Q-42.673 55.672-42.812 55.855Q-42.950 56.039-43.142 56.172Q-43.333 56.304-43.552 56.375Q-43.771 56.445-44.009 56.445Q-44.380 56.445-44.718 56.308Q-45.056 56.172-45.324 55.920Q-45.591 55.668-45.741 55.328Q-45.892 54.988-45.892 54.613M-45.138 54.304L-43.177 54.304Q-43.177 54-43.279 53.709Q-43.380 53.418-43.597 53.236Q-43.814 53.054-44.130 53.054Q-44.431 53.054-44.661 53.242Q-44.892 53.429-45.015 53.721Q-45.138 54.012-45.138 54.304M-40.298 56.445Q-40.779 56.445-41.187 56.201Q-41.595 55.957-41.833 55.543Q-42.072 55.129-42.072 54.640Q-42.072 54.148-41.814 53.732Q-41.556 53.316-41.124 53.078Q-40.693 52.840-40.200 52.840Q-39.579 52.840-39.130 53.277L-39.130 51.648Q-39.130 51.433-39.193 51.338Q-39.255 51.242-39.372 51.221Q-39.490 51.199-39.736 51.199L-39.736 50.902L-38.513 50.816L-38.513 55.625Q-38.513 55.836-38.450 55.931Q-38.388 56.027-38.271 56.049Q-38.154 56.070-37.904 56.070L-37.904 56.367L-39.154 56.445L-39.154 55.961Q-39.618 56.445-40.298 56.445M-40.232 56.191Q-39.892 56.191-39.599 56Q-39.306 55.808-39.154 55.512L-39.154 53.679Q-39.302 53.406-39.564 53.250Q-39.825 53.094-40.138 53.094Q-40.763 53.094-41.046 53.541Q-41.329 53.988-41.329 54.648Q-41.329 55.293-41.077 55.742Q-40.825 56.191-40.232 56.191\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M68.237 36.45h68.286V7.998H68.237Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(167.447 -27.393)\">\u003Cpath d=\"M-80.442 48.418L-82.297 48.418L-82.297 48.125Q-82.028 48.125-81.860 48.080Q-81.692 48.035-81.692 47.859L-81.692 44.035Q-81.692 43.828-81.848 43.775Q-82.004 43.722-82.297 43.722L-82.297 43.426L-81.075 43.340L-81.075 43.804Q-80.844 43.582-80.530 43.461Q-80.215 43.340-79.876 43.340Q-79.403 43.340-78.999 43.586Q-78.594 43.832-78.362 44.248Q-78.129 44.664-78.129 45.140Q-78.129 45.515-78.278 45.844Q-78.426 46.172-78.696 46.424Q-78.965 46.676-79.309 46.810Q-79.653 46.945-80.012 46.945Q-80.301 46.945-80.573 46.824Q-80.844 46.703-81.051 46.492L-81.051 47.859Q-81.051 48.035-80.883 48.080Q-80.715 48.125-80.442 48.125L-80.442 48.418M-81.051 44.203L-81.051 46.043Q-80.899 46.332-80.637 46.512Q-80.376 46.691-80.067 46.691Q-79.782 46.691-79.559 46.553Q-79.336 46.414-79.184 46.183Q-79.032 45.953-78.954 45.681Q-78.876 45.410-78.876 45.140Q-78.876 44.808-79.001 44.451Q-79.126 44.094-79.374 43.857Q-79.622 43.621-79.969 43.621Q-80.293 43.621-80.588 43.777Q-80.883 43.933-81.051 44.203M-76.922 45.914L-76.922 44.172Q-76.922 43.957-76.985 43.861Q-77.047 43.765-77.167 43.744Q-77.286 43.722-77.532 43.722L-77.532 43.426L-76.286 43.340L-76.286 45.890L-76.286 45.914Q-76.286 46.226-76.231 46.388Q-76.176 46.551-76.026 46.621Q-75.876 46.691-75.555 46.691Q-75.126 46.691-74.852 46.353Q-74.579 46.015-74.579 45.570L-74.579 44.172Q-74.579 43.957-74.641 43.861Q-74.704 43.765-74.823 43.744Q-74.942 43.722-75.188 43.722L-75.188 43.426L-73.942 43.340L-73.942 46.125Q-73.942 46.336-73.879 46.431Q-73.817 46.527-73.698 46.549Q-73.579 46.570-73.333 46.570L-73.333 46.867L-74.555 46.945L-74.555 46.324Q-74.723 46.613-75.004 46.779Q-75.286 46.945-75.606 46.945Q-76.922 46.945-76.922 45.914M-72.844 46.859L-72.844 45.637Q-72.844 45.609-72.813 45.578Q-72.782 45.547-72.758 45.547L-72.653 45.547Q-72.583 45.547-72.567 45.609Q-72.504 45.929-72.366 46.170Q-72.227 46.410-71.995 46.551Q-71.762 46.691-71.454 46.691Q-71.215 46.691-71.006 46.631Q-70.797 46.570-70.661 46.422Q-70.524 46.273-70.524 46.027Q-70.524 45.773-70.735 45.607Q-70.946 45.441-71.215 45.387L-71.836 45.273Q-72.243 45.195-72.543 44.939Q-72.844 44.683-72.844 44.308Q-72.844 43.941-72.643 43.719Q-72.442 43.496-72.118 43.398Q-71.793 43.301-71.454 43.301Q-70.989 43.301-70.692 43.508L-70.469 43.324Q-70.446 43.301-70.415 43.301L-70.364 43.301Q-70.333 43.301-70.305 43.328Q-70.278 43.355-70.278 43.387L-70.278 44.371Q-70.278 44.402-70.303 44.431Q-70.329 44.461-70.364 44.461L-70.469 44.461Q-70.504 44.461-70.532 44.433Q-70.559 44.406-70.559 44.371Q-70.559 43.972-70.811 43.752Q-71.063 43.531-71.461 43.531Q-71.817 43.531-72.100 43.654Q-72.383 43.777-72.383 44.082Q-72.383 44.301-72.182 44.433Q-71.981 44.566-71.735 44.609L-71.110 44.722Q-70.680 44.812-70.372 45.109Q-70.063 45.406-70.063 45.820Q-70.063 46.390-70.461 46.668Q-70.860 46.945-71.454 46.945Q-72.004 46.945-72.356 46.609L-72.653 46.922Q-72.676 46.945-72.711 46.945L-72.758 46.945Q-72.782 46.945-72.813 46.914Q-72.844 46.883-72.844 46.859M-67.606 46.867L-69.461 46.867L-69.461 46.570Q-69.188 46.570-69.020 46.523Q-68.852 46.476-68.852 46.308L-68.852 42.148Q-68.852 41.933-68.915 41.838Q-68.977 41.742-69.096 41.721Q-69.215 41.699-69.461 41.699L-69.461 41.402L-68.239 41.316L-68.239 44.019Q-68.114 43.808-67.926 43.658Q-67.739 43.508-67.512 43.424Q-67.286 43.340-67.040 43.340Q-65.872 43.340-65.872 44.418L-65.872 46.308Q-65.872 46.476-65.702 46.523Q-65.532 46.570-65.262 46.570L-65.262 46.867L-67.118 46.867L-67.118 46.570Q-66.844 46.570-66.676 46.523Q-66.508 46.476-66.508 46.308L-66.508 44.433Q-66.508 44.051-66.629 43.822Q-66.751 43.594-67.102 43.594Q-67.415 43.594-67.668 43.756Q-67.922 43.918-68.069 44.187Q-68.215 44.457-68.215 44.754L-68.215 46.308Q-68.215 46.476-68.045 46.523Q-67.876 46.570-67.606 46.570\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(167.447 -27.393)\">\u003Cpath d=\"M-61.972 45.172Q-61.972 44.668-61.716 44.236Q-61.460 43.804-61.024 43.553Q-60.589 43.301-60.089 43.301Q-59.702 43.301-59.360 43.445Q-59.019 43.590-58.757 43.851Q-58.495 44.113-58.353 44.449Q-58.210 44.785-58.210 45.172Q-58.210 45.664-58.474 46.074Q-58.737 46.484-59.167 46.715Q-59.597 46.945-60.089 46.945Q-60.581 46.945-61.015 46.713Q-61.448 46.480-61.710 46.072Q-61.972 45.664-61.972 45.172M-60.089 46.668Q-59.632 46.668-59.380 46.445Q-59.128 46.222-59.040 45.871Q-58.952 45.519-58.952 45.074Q-58.952 44.644-59.046 44.306Q-59.140 43.969-59.394 43.762Q-59.648 43.554-60.089 43.554Q-60.737 43.554-60.981 43.971Q-61.226 44.387-61.226 45.074Q-61.226 45.519-61.138 45.871Q-61.050 46.222-60.798 46.445Q-60.546 46.668-60.089 46.668M-57.042 45.914L-57.042 44.172Q-57.042 43.957-57.105 43.861Q-57.167 43.765-57.286 43.744Q-57.405 43.722-57.651 43.722L-57.651 43.426L-56.405 43.340L-56.405 45.890L-56.405 45.914Q-56.405 46.226-56.351 46.388Q-56.296 46.551-56.146 46.621Q-55.995 46.691-55.675 46.691Q-55.245 46.691-54.972 46.353Q-54.698 46.015-54.698 45.570L-54.698 44.172Q-54.698 43.957-54.761 43.861Q-54.823 43.765-54.942 43.744Q-55.062 43.722-55.308 43.722L-55.308 43.426L-54.062 43.340L-54.062 46.125Q-54.062 46.336-53.999 46.431Q-53.937 46.527-53.817 46.549Q-53.698 46.570-53.452 46.570L-53.452 46.867L-54.675 46.945L-54.675 46.324Q-54.843 46.613-55.124 46.779Q-55.405 46.945-55.726 46.945Q-57.042 46.945-57.042 45.914M-52.382 45.906L-52.382 43.715L-53.085 43.715L-53.085 43.461Q-52.730 43.461-52.487 43.228Q-52.245 42.996-52.134 42.648Q-52.023 42.301-52.023 41.945L-51.741 41.945L-51.741 43.418L-50.565 43.418L-50.565 43.715L-51.741 43.715L-51.741 45.890Q-51.741 46.211-51.622 46.439Q-51.503 46.668-51.222 46.668Q-51.042 46.668-50.925 46.545Q-50.808 46.422-50.755 46.242Q-50.702 46.062-50.702 45.890L-50.702 45.418L-50.421 45.418L-50.421 45.906Q-50.421 46.160-50.526 46.400Q-50.632 46.640-50.829 46.793Q-51.026 46.945-51.284 46.945Q-51.601 46.945-51.853 46.822Q-52.105 46.699-52.243 46.465Q-52.382 46.230-52.382 45.906M-49.116 48.273Q-49.116 48.250-49.085 48.203Q-48.792 47.941-48.626 47.574Q-48.460 47.207-48.460 46.820L-48.460 46.762Q-48.589 46.867-48.757 46.867Q-48.948 46.867-49.085 46.734Q-49.222 46.601-49.222 46.402Q-49.222 46.211-49.085 46.078Q-48.948 45.945-48.757 45.945Q-48.456 45.945-48.331 46.215Q-48.206 46.484-48.206 46.820Q-48.206 47.269-48.388 47.683Q-48.569 48.097-48.909 48.394Q-48.933 48.418-48.972 48.418Q-49.019 48.418-49.067 48.373Q-49.116 48.328-49.116 48.273\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(167.447 -27.393)\">\u003Cpath d=\"M-78.169 54.613Q-78.169 54.133-77.936 53.717Q-77.704 53.301-77.294 53.051Q-76.884 52.801-76.407 52.801Q-75.677 52.801-75.278 53.242Q-74.880 53.683-74.880 54.414Q-74.880 54.519-74.973 54.543L-77.423 54.543L-77.423 54.613Q-77.423 55.023-77.302 55.379Q-77.180 55.734-76.909 55.951Q-76.637 56.168-76.208 56.168Q-75.844 56.168-75.548 55.939Q-75.251 55.711-75.149 55.359Q-75.141 55.312-75.055 55.297L-74.973 55.297Q-74.880 55.324-74.880 55.406Q-74.880 55.414-74.887 55.445Q-74.950 55.672-75.089 55.855Q-75.227 56.039-75.419 56.172Q-75.610 56.304-75.829 56.375Q-76.048 56.445-76.286 56.445Q-76.657 56.445-76.995 56.308Q-77.333 56.172-77.600 55.920Q-77.868 55.668-78.018 55.328Q-78.169 54.988-78.169 54.613M-77.415 54.304L-75.454 54.304Q-75.454 54-75.555 53.709Q-75.657 53.418-75.874 53.236Q-76.091 53.054-76.407 53.054Q-76.708 53.054-76.938 53.242Q-77.169 53.429-77.292 53.721Q-77.415 54.012-77.415 54.304M-73.005 56.367L-74.501 56.367L-74.501 56.070Q-73.868 56.070-73.446 55.590L-72.677 54.679L-73.669 53.480Q-73.825 53.301-73.987 53.258Q-74.149 53.215-74.454 53.215L-74.454 52.918L-72.766 52.918L-72.766 53.215Q-72.860 53.215-72.936 53.258Q-73.012 53.301-73.012 53.390Q-73.012 53.433-72.981 53.480L-72.325 54.269L-71.844 53.695Q-71.727 53.558-71.727 53.422Q-71.727 53.332-71.778 53.273Q-71.829 53.215-71.911 53.215L-71.911 52.918L-70.423 52.918L-70.423 53.215Q-71.059 53.215-71.469 53.695L-72.149 54.496L-71.063 55.808Q-70.903 55.984-70.743 56.027Q-70.583 56.070-70.278 56.070L-70.278 56.367L-71.966 56.367L-71.966 56.070Q-71.876 56.070-71.798 56.027Q-71.719 55.984-71.719 55.894Q-71.719 55.871-71.751 55.808L-72.493 54.902L-73.079 55.590Q-73.196 55.726-73.196 55.863Q-73.196 55.949-73.145 56.010Q-73.094 56.070-73.005 56.070L-73.005 56.367M-68.028 57.918L-69.884 57.918L-69.884 57.625Q-69.614 57.625-69.446 57.580Q-69.278 57.535-69.278 57.359L-69.278 53.535Q-69.278 53.328-69.434 53.275Q-69.591 53.222-69.884 53.222L-69.884 52.926L-68.661 52.840L-68.661 53.304Q-68.430 53.082-68.116 52.961Q-67.802 52.840-67.462 52.840Q-66.989 52.840-66.585 53.086Q-66.180 53.332-65.948 53.748Q-65.716 54.164-65.716 54.640Q-65.716 55.015-65.864 55.344Q-66.012 55.672-66.282 55.924Q-66.552 56.176-66.895 56.310Q-67.239 56.445-67.598 56.445Q-67.887 56.445-68.159 56.324Q-68.430 56.203-68.637 55.992L-68.637 57.359Q-68.637 57.535-68.469 57.580Q-68.302 57.625-68.028 57.625L-68.028 57.918M-68.637 53.703L-68.637 55.543Q-68.485 55.832-68.223 56.012Q-67.962 56.191-67.653 56.191Q-67.368 56.191-67.145 56.053Q-66.923 55.914-66.770 55.683Q-66.618 55.453-66.540 55.181Q-66.462 54.910-66.462 54.640Q-66.462 54.308-66.587 53.951Q-66.712 53.594-66.960 53.357Q-67.208 53.121-67.555 53.121Q-67.880 53.121-68.175 53.277Q-68.469 53.433-68.637 53.703M-65.094 55.535Q-65.094 55.051-64.692 54.756Q-64.290 54.461-63.739 54.342Q-63.188 54.222-62.696 54.222L-62.696 53.933Q-62.696 53.707-62.811 53.500Q-62.927 53.293-63.124 53.174Q-63.321 53.054-63.552 53.054Q-63.977 53.054-64.262 53.160Q-64.192 53.187-64.145 53.242Q-64.098 53.297-64.073 53.367Q-64.048 53.437-64.048 53.512Q-64.048 53.617-64.098 53.709Q-64.149 53.801-64.241 53.851Q-64.333 53.902-64.438 53.902Q-64.544 53.902-64.636 53.851Q-64.727 53.801-64.778 53.709Q-64.829 53.617-64.829 53.512Q-64.829 53.094-64.440 52.947Q-64.052 52.801-63.552 52.801Q-63.219 52.801-62.866 52.931Q-62.512 53.062-62.284 53.316Q-62.055 53.570-62.055 53.918L-62.055 55.719Q-62.055 55.851-61.983 55.961Q-61.911 56.070-61.782 56.070Q-61.657 56.070-61.589 55.965Q-61.520 55.859-61.520 55.719L-61.520 55.207L-61.239 55.207L-61.239 55.719Q-61.239 55.922-61.356 56.080Q-61.473 56.238-61.655 56.322Q-61.837 56.406-62.040 56.406Q-62.270 56.406-62.423 56.234Q-62.575 56.062-62.606 55.832Q-62.766 56.113-63.075 56.279Q-63.384 56.445-63.735 56.445Q-64.247 56.445-64.671 56.222Q-65.094 56-65.094 55.535M-64.407 55.535Q-64.407 55.820-64.180 56.006Q-63.954 56.191-63.661 56.191Q-63.415 56.191-63.190 56.074Q-62.966 55.957-62.831 55.754Q-62.696 55.551-62.696 55.297L-62.696 54.465Q-62.962 54.465-63.247 54.519Q-63.532 54.574-63.803 54.703Q-64.075 54.832-64.241 55.039Q-64.407 55.246-64.407 55.535M-59.016 56.367L-60.872 56.367L-60.872 56.070Q-60.598 56.070-60.430 56.023Q-60.262 55.976-60.262 55.808L-60.262 53.672Q-60.262 53.457-60.325 53.361Q-60.387 53.265-60.507 53.244Q-60.626 53.222-60.872 53.222L-60.872 52.926L-59.680 52.840L-59.680 53.574Q-59.567 53.359-59.374 53.191Q-59.180 53.023-58.942 52.931Q-58.704 52.840-58.450 52.840Q-57.282 52.840-57.282 53.918L-57.282 55.808Q-57.282 55.976-57.112 56.023Q-56.942 56.070-56.673 56.070L-56.673 56.367L-58.528 56.367L-58.528 56.070Q-58.255 56.070-58.087 56.023Q-57.919 55.976-57.919 55.808L-57.919 53.933Q-57.919 53.551-58.040 53.322Q-58.161 53.094-58.512 53.094Q-58.825 53.094-59.079 53.256Q-59.333 53.418-59.479 53.687Q-59.626 53.957-59.626 54.254L-59.626 55.808Q-59.626 55.976-59.456 56.023Q-59.286 56.070-59.016 56.070L-59.016 56.367M-54.411 56.445Q-54.891 56.445-55.300 56.201Q-55.708 55.957-55.946 55.543Q-56.184 55.129-56.184 54.640Q-56.184 54.148-55.927 53.732Q-55.669 53.316-55.237 53.078Q-54.805 52.840-54.313 52.840Q-53.692 52.840-53.243 53.277L-53.243 51.648Q-53.243 51.433-53.305 51.338Q-53.368 51.242-53.485 51.221Q-53.602 51.199-53.848 51.199L-53.848 50.902L-52.626 50.816L-52.626 55.625Q-52.626 55.836-52.563 55.931Q-52.501 56.027-52.384 56.049Q-52.266 56.070-52.016 56.070L-52.016 56.367L-53.266 56.445L-53.266 55.961Q-53.731 56.445-54.411 56.445M-54.344 56.191Q-54.005 56.191-53.712 56Q-53.419 55.808-53.266 55.512L-53.266 53.679Q-53.415 53.406-53.677 53.250Q-53.938 53.094-54.251 53.094Q-54.876 53.094-55.159 53.541Q-55.442 53.988-55.442 54.648Q-55.442 55.293-55.190 55.742Q-54.938 56.191-54.344 56.191\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M-68.337 36.45H-.05V7.998h-68.287Z\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(24.853 -27.393)\">\u003Cpath d=\"M-82.325 45.172Q-82.325 44.668-82.069 44.236Q-81.813 43.804-81.377 43.553Q-80.942 43.301-80.442 43.301Q-80.055 43.301-79.713 43.445Q-79.372 43.590-79.110 43.851Q-78.848 44.113-78.706 44.449Q-78.563 44.785-78.563 45.172Q-78.563 45.664-78.827 46.074Q-79.090 46.484-79.520 46.715Q-79.950 46.945-80.442 46.945Q-80.934 46.945-81.368 46.713Q-81.801 46.480-82.063 46.072Q-82.325 45.664-82.325 45.172M-80.442 46.668Q-79.985 46.668-79.733 46.445Q-79.481 46.222-79.393 45.871Q-79.305 45.519-79.305 45.074Q-79.305 44.644-79.399 44.306Q-79.493 43.969-79.747 43.762Q-80.001 43.554-80.442 43.554Q-81.090 43.554-81.334 43.971Q-81.579 44.387-81.579 45.074Q-81.579 45.519-81.491 45.871Q-81.403 46.222-81.151 46.445Q-80.899 46.668-80.442 46.668M-76.196 48.418L-78.051 48.418L-78.051 48.125Q-77.782 48.125-77.614 48.080Q-77.446 48.035-77.446 47.859L-77.446 44.035Q-77.446 43.828-77.602 43.775Q-77.758 43.722-78.051 43.722L-78.051 43.426L-76.829 43.340L-76.829 43.804Q-76.598 43.582-76.284 43.461Q-75.969 43.340-75.629 43.340Q-75.157 43.340-74.752 43.586Q-74.348 43.832-74.116 44.248Q-73.883 44.664-73.883 45.140Q-73.883 45.515-74.032 45.844Q-74.180 46.172-74.450 46.424Q-74.719 46.676-75.063 46.810Q-75.407 46.945-75.766 46.945Q-76.055 46.945-76.327 46.824Q-76.598 46.703-76.805 46.492L-76.805 47.859Q-76.805 48.035-76.637 48.080Q-76.469 48.125-76.196 48.125L-76.196 48.418M-76.805 44.203L-76.805 46.043Q-76.653 46.332-76.391 46.512Q-76.129 46.691-75.821 46.691Q-75.536 46.691-75.313 46.553Q-75.090 46.414-74.938 46.183Q-74.786 45.953-74.708 45.681Q-74.629 45.410-74.629 45.140Q-74.629 44.808-74.754 44.451Q-74.879 44.094-75.127 43.857Q-75.376 43.621-75.723 43.621Q-76.047 43.621-76.342 43.777Q-76.637 43.933-76.805 44.203M-73.262 46.035Q-73.262 45.551-72.860 45.256Q-72.458 44.961-71.907 44.842Q-71.356 44.722-70.864 44.722L-70.864 44.433Q-70.864 44.207-70.979 44Q-71.094 43.793-71.292 43.674Q-71.489 43.554-71.719 43.554Q-72.145 43.554-72.430 43.660Q-72.360 43.687-72.313 43.742Q-72.266 43.797-72.241 43.867Q-72.215 43.937-72.215 44.012Q-72.215 44.117-72.266 44.209Q-72.317 44.301-72.409 44.351Q-72.501 44.402-72.606 44.402Q-72.711 44.402-72.803 44.351Q-72.895 44.301-72.946 44.209Q-72.997 44.117-72.997 44.012Q-72.997 43.594-72.608 43.447Q-72.219 43.301-71.719 43.301Q-71.387 43.301-71.034 43.431Q-70.680 43.562-70.452 43.816Q-70.223 44.070-70.223 44.418L-70.223 46.219Q-70.223 46.351-70.151 46.461Q-70.079 46.570-69.950 46.570Q-69.825 46.570-69.756 46.465Q-69.688 46.359-69.688 46.219L-69.688 45.707L-69.407 45.707L-69.407 46.219Q-69.407 46.422-69.524 46.580Q-69.641 46.738-69.823 46.822Q-70.004 46.906-70.208 46.906Q-70.438 46.906-70.590 46.734Q-70.743 46.562-70.774 46.332Q-70.934 46.613-71.243 46.779Q-71.551 46.945-71.903 46.945Q-72.415 46.945-72.838 46.722Q-73.262 46.500-73.262 46.035M-72.575 46.035Q-72.575 46.320-72.348 46.506Q-72.122 46.691-71.829 46.691Q-71.583 46.691-71.358 46.574Q-71.133 46.457-70.999 46.254Q-70.864 46.051-70.864 45.797L-70.864 44.965Q-71.129 44.965-71.415 45.019Q-71.700 45.074-71.971 45.203Q-72.243 45.332-72.409 45.539Q-72.575 45.746-72.575 46.035M-69.071 45.140Q-69.071 44.644-68.821 44.219Q-68.571 43.793-68.151 43.547Q-67.731 43.301-67.231 43.301Q-66.692 43.301-66.301 43.426Q-65.911 43.551-65.911 43.965Q-65.911 44.070-65.961 44.162Q-66.012 44.254-66.104 44.304Q-66.196 44.355-66.305 44.355Q-66.411 44.355-66.502 44.304Q-66.594 44.254-66.645 44.162Q-66.696 44.070-66.696 43.965Q-66.696 43.742-66.528 43.637Q-66.751 43.578-67.223 43.578Q-67.520 43.578-67.735 43.717Q-67.950 43.855-68.081 44.086Q-68.211 44.316-68.270 44.586Q-68.329 44.855-68.329 45.140Q-68.329 45.535-68.196 45.885Q-68.063 46.234-67.792 46.451Q-67.520 46.668-67.122 46.668Q-66.747 46.668-66.471 46.451Q-66.196 46.234-66.094 45.875Q-66.079 45.812-66.016 45.812L-65.911 45.812Q-65.876 45.812-65.850 45.840Q-65.825 45.867-65.825 45.906L-65.825 45.929Q-65.958 46.410-66.342 46.678Q-66.727 46.945-67.231 46.945Q-67.594 46.945-67.928 46.808Q-68.262 46.672-68.522 46.422Q-68.782 46.172-68.926 45.836Q-69.071 45.500-69.071 45.140M-63.477 46.867L-65.254 46.867L-65.254 46.570Q-64.981 46.570-64.813 46.523Q-64.645 46.476-64.645 46.308L-64.645 44.172Q-64.645 43.957-64.702 43.861Q-64.758 43.765-64.872 43.744Q-64.985 43.722-65.231 43.722L-65.231 43.426L-64.032 43.340L-64.032 46.308Q-64.032 46.476-63.885 46.523Q-63.739 46.570-63.477 46.570L-63.477 46.867M-64.918 41.945Q-64.918 41.754-64.784 41.623Q-64.649 41.492-64.454 41.492Q-64.333 41.492-64.229 41.554Q-64.126 41.617-64.063 41.721Q-64.001 41.824-64.001 41.945Q-64.001 42.140-64.131 42.275Q-64.262 42.410-64.454 42.410Q-64.653 42.410-64.786 42.277Q-64.918 42.144-64.918 41.945M-62.352 45.906L-62.352 43.715L-63.055 43.715L-63.055 43.461Q-62.700 43.461-62.458 43.228Q-62.215 42.996-62.104 42.648Q-61.993 42.301-61.993 41.945L-61.711 41.945L-61.711 43.418L-60.536 43.418L-60.536 43.715L-61.711 43.715L-61.711 45.890Q-61.711 46.211-61.592 46.439Q-61.473 46.668-61.192 46.668Q-61.012 46.668-60.895 46.545Q-60.778 46.422-60.725 46.242Q-60.672 46.062-60.672 45.890L-60.672 45.418L-60.391 45.418L-60.391 45.906Q-60.391 46.160-60.497 46.400Q-60.602 46.640-60.799 46.793Q-60.997 46.945-61.254 46.945Q-61.571 46.945-61.823 46.822Q-62.075 46.699-62.213 46.465Q-62.352 46.230-62.352 45.906\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.853 -27.393)\">\u003Cpath d=\"M-59.476 48.164Q-59.362 48.242-59.187 48.242Q-58.898 48.242-58.677 48.029Q-58.456 47.816-58.331 47.515L-58.042 46.867L-59.316 43.980Q-59.398 43.804-59.542 43.760Q-59.687 43.715-59.956 43.715L-59.956 43.418L-58.237 43.418L-58.237 43.715Q-58.659 43.715-58.659 43.898Q-58.659 43.910-58.644 43.980L-57.706 46.105L-56.874 44.195Q-56.835 44.105-56.835 44.027Q-56.835 43.887-56.937 43.801Q-57.038 43.715-57.179 43.715L-57.179 43.418L-55.827 43.418L-55.827 43.715Q-56.081 43.715-56.275 43.840Q-56.468 43.965-56.573 44.195L-58.019 47.515Q-58.132 47.769-58.298 47.992Q-58.464 48.215-58.693 48.357Q-58.921 48.500-59.187 48.500Q-59.484 48.500-59.724 48.308Q-59.964 48.117-59.964 47.828Q-59.964 47.672-59.859 47.570Q-59.753 47.469-59.605 47.469Q-59.499 47.469-59.419 47.515Q-59.339 47.562-59.292 47.640Q-59.245 47.719-59.245 47.828Q-59.245 47.949-59.306 48.037Q-59.366 48.125-59.476 48.164\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.853 -27.393)\">\u003Cpath d=\"M-50.508 46.867L-52.493 46.867L-52.493 46.570Q-52.219 46.570-52.051 46.523Q-51.883 46.476-51.883 46.308L-51.883 43.715L-52.524 43.715L-52.524 43.418L-51.883 43.418L-51.883 42.484Q-51.883 42.219-51.766 41.982Q-51.649 41.746-51.456 41.582Q-51.262 41.418-51.014 41.326Q-50.766 41.234-50.501 41.234Q-50.215 41.234-49.991 41.392Q-49.766 41.551-49.766 41.828Q-49.766 41.984-49.872 42.094Q-49.977 42.203-50.141 42.203Q-50.297 42.203-50.407 42.094Q-50.516 41.984-50.516 41.828Q-50.516 41.621-50.356 41.515Q-50.454 41.492-50.547 41.492Q-50.778 41.492-50.950 41.648Q-51.122 41.804-51.208 42.041Q-51.293 42.277-51.293 42.500L-51.293 43.418L-50.325 43.418L-50.325 43.715L-51.270 43.715L-51.270 46.308Q-51.270 46.476-51.043 46.523Q-50.817 46.570-50.508 46.570L-50.508 46.867M-49.883 46.035Q-49.883 45.551-49.481 45.256Q-49.079 44.961-48.528 44.842Q-47.977 44.722-47.485 44.722L-47.485 44.433Q-47.485 44.207-47.600 44Q-47.715 43.793-47.913 43.674Q-48.110 43.554-48.340 43.554Q-48.766 43.554-49.051 43.660Q-48.981 43.687-48.934 43.742Q-48.887 43.797-48.862 43.867Q-48.836 43.937-48.836 44.012Q-48.836 44.117-48.887 44.209Q-48.938 44.301-49.030 44.351Q-49.122 44.402-49.227 44.402Q-49.333 44.402-49.424 44.351Q-49.516 44.301-49.567 44.209Q-49.618 44.117-49.618 44.012Q-49.618 43.594-49.229 43.447Q-48.840 43.301-48.340 43.301Q-48.008 43.301-47.655 43.431Q-47.301 43.562-47.073 43.816Q-46.844 44.070-46.844 44.418L-46.844 46.219Q-46.844 46.351-46.772 46.461Q-46.700 46.570-46.571 46.570Q-46.446 46.570-46.377 46.465Q-46.309 46.359-46.309 46.219L-46.309 45.707L-46.028 45.707L-46.028 46.219Q-46.028 46.422-46.145 46.580Q-46.262 46.738-46.444 46.822Q-46.626 46.906-46.829 46.906Q-47.059 46.906-47.211 46.734Q-47.364 46.562-47.395 46.332Q-47.555 46.613-47.864 46.779Q-48.172 46.945-48.524 46.945Q-49.036 46.945-49.459 46.722Q-49.883 46.500-49.883 46.035M-49.196 46.035Q-49.196 46.320-48.969 46.506Q-48.743 46.691-48.450 46.691Q-48.204 46.691-47.979 46.574Q-47.754 46.457-47.620 46.254Q-47.485 46.051-47.485 45.797L-47.485 44.965Q-47.751 44.965-48.036 45.019Q-48.321 45.074-48.592 45.203Q-48.864 45.332-49.030 45.539Q-49.196 45.746-49.196 46.035M-43.821 46.867L-45.653 46.867L-45.653 46.570Q-45.379 46.570-45.211 46.523Q-45.043 46.476-45.043 46.308L-45.043 42.148Q-45.043 41.933-45.106 41.838Q-45.168 41.742-45.288 41.721Q-45.407 41.699-45.653 41.699L-45.653 41.402L-44.430 41.316L-44.430 46.308Q-44.430 46.476-44.262 46.523Q-44.094 46.570-43.821 46.570L-43.821 46.867M-41.461 46.867L-43.293 46.867L-43.293 46.570Q-43.020 46.570-42.852 46.523Q-42.684 46.476-42.684 46.308L-42.684 42.148Q-42.684 41.933-42.747 41.838Q-42.809 41.742-42.928 41.721Q-43.047 41.699-43.293 41.699L-43.293 41.402L-42.071 41.316L-42.071 46.308Q-42.071 46.476-41.903 46.523Q-41.735 46.570-41.461 46.570L-41.461 46.867M-40.973 46.859L-40.973 45.637Q-40.973 45.609-40.942 45.578Q-40.911 45.547-40.887 45.547L-40.782 45.547Q-40.711 45.547-40.696 45.609Q-40.633 45.929-40.495 46.170Q-40.356 46.410-40.124 46.551Q-39.891 46.691-39.583 46.691Q-39.344 46.691-39.135 46.631Q-38.926 46.570-38.790 46.422Q-38.653 46.273-38.653 46.027Q-38.653 45.773-38.864 45.607Q-39.075 45.441-39.344 45.387L-39.965 45.273Q-40.372 45.195-40.672 44.939Q-40.973 44.683-40.973 44.308Q-40.973 43.941-40.772 43.719Q-40.571 43.496-40.247 43.398Q-39.922 43.301-39.583 43.301Q-39.118 43.301-38.821 43.508L-38.598 43.324Q-38.575 43.301-38.543 43.301L-38.493 43.301Q-38.461 43.301-38.434 43.328Q-38.407 43.355-38.407 43.387L-38.407 44.371Q-38.407 44.402-38.432 44.431Q-38.458 44.461-38.493 44.461L-38.598 44.461Q-38.633 44.461-38.661 44.433Q-38.688 44.406-38.688 44.371Q-38.688 43.972-38.940 43.752Q-39.192 43.531-39.590 43.531Q-39.946 43.531-40.229 43.654Q-40.512 43.777-40.512 44.082Q-40.512 44.301-40.311 44.433Q-40.110 44.566-39.864 44.609L-39.239 44.722Q-38.809 44.812-38.501 45.109Q-38.192 45.406-38.192 45.820Q-38.192 46.390-38.590 46.668Q-38.989 46.945-39.583 46.945Q-40.133 46.945-40.485 46.609L-40.782 46.922Q-40.805 46.945-40.840 46.945L-40.887 46.945Q-40.911 46.945-40.942 46.914Q-40.973 46.883-40.973 46.859M-37.079 48.273Q-37.079 48.250-37.047 48.203Q-36.754 47.941-36.588 47.574Q-36.422 47.207-36.422 46.820L-36.422 46.762Q-36.551 46.867-36.719 46.867Q-36.911 46.867-37.047 46.734Q-37.184 46.601-37.184 46.402Q-37.184 46.211-37.047 46.078Q-36.911 45.945-36.719 45.945Q-36.418 45.945-36.293 46.215Q-36.168 46.484-36.168 46.820Q-36.168 47.269-36.350 47.683Q-36.532 48.097-36.872 48.394Q-36.895 48.418-36.934 48.418Q-36.981 48.418-37.030 48.373Q-37.079 48.328-37.079 48.273\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.853 -27.393)\">\u003Cpath d=\"M-79.946 56.367L-81.802 56.367L-81.802 56.070Q-81.528 56.070-81.360 56.023Q-81.192 55.976-81.192 55.808L-81.192 51.648Q-81.192 51.433-81.255 51.338Q-81.317 51.242-81.436 51.221Q-81.555 51.199-81.802 51.199L-81.802 50.902L-80.579 50.816L-80.579 53.519Q-80.454 53.308-80.266 53.158Q-80.079 53.008-79.852 52.924Q-79.626 52.840-79.380 52.840Q-78.212 52.840-78.212 53.918L-78.212 55.808Q-78.212 55.976-78.042 56.023Q-77.872 56.070-77.602 56.070L-77.602 56.367L-79.458 56.367L-79.458 56.070Q-79.184 56.070-79.016 56.023Q-78.848 55.976-78.848 55.808L-78.848 53.933Q-78.848 53.551-78.969 53.322Q-79.091 53.094-79.442 53.094Q-79.755 53.094-80.009 53.256Q-80.262 53.418-80.409 53.687Q-80.555 53.957-80.555 54.254L-80.555 55.808Q-80.555 55.976-80.385 56.023Q-80.216 56.070-79.946 56.070L-79.946 56.367M-77.157 54.613Q-77.157 54.133-76.925 53.717Q-76.692 53.301-76.282 53.051Q-75.872 52.801-75.395 52.801Q-74.665 52.801-74.266 53.242Q-73.868 53.683-73.868 54.414Q-73.868 54.519-73.962 54.543L-76.411 54.543L-76.411 54.613Q-76.411 55.023-76.290 55.379Q-76.169 55.734-75.897 55.951Q-75.626 56.168-75.196 56.168Q-74.833 56.168-74.536 55.939Q-74.239 55.711-74.137 55.359Q-74.130 55.312-74.044 55.297L-73.962 55.297Q-73.868 55.324-73.868 55.406Q-73.868 55.414-73.876 55.445Q-73.938 55.672-74.077 55.855Q-74.216 56.039-74.407 56.172Q-74.598 56.304-74.817 56.375Q-75.036 56.445-75.274 56.445Q-75.645 56.445-75.983 56.308Q-76.321 56.172-76.589 55.920Q-76.856 55.668-77.007 55.328Q-77.157 54.988-77.157 54.613M-76.403 54.304L-74.442 54.304Q-74.442 54-74.544 53.709Q-74.645 53.418-74.862 53.236Q-75.079 53.054-75.395 53.054Q-75.696 53.054-75.927 53.242Q-76.157 53.429-76.280 53.721Q-76.403 54.012-76.403 54.304M-73.282 55.535Q-73.282 55.051-72.880 54.756Q-72.477 54.461-71.927 54.342Q-71.376 54.222-70.884 54.222L-70.884 53.933Q-70.884 53.707-70.999 53.500Q-71.114 53.293-71.311 53.174Q-71.509 53.054-71.739 53.054Q-72.165 53.054-72.450 53.160Q-72.380 53.187-72.333 53.242Q-72.286 53.297-72.260 53.367Q-72.235 53.437-72.235 53.512Q-72.235 53.617-72.286 53.709Q-72.337 53.801-72.428 53.851Q-72.520 53.902-72.626 53.902Q-72.731 53.902-72.823 53.851Q-72.915 53.801-72.966 53.709Q-73.016 53.617-73.016 53.512Q-73.016 53.094-72.628 52.947Q-72.239 52.801-71.739 52.801Q-71.407 52.801-71.053 52.931Q-70.700 53.062-70.471 53.316Q-70.243 53.570-70.243 53.918L-70.243 55.719Q-70.243 55.851-70.171 55.961Q-70.098 56.070-69.969 56.070Q-69.844 56.070-69.776 55.965Q-69.708 55.859-69.708 55.719L-69.708 55.207L-69.427 55.207L-69.427 55.719Q-69.427 55.922-69.544 56.080Q-69.661 56.238-69.843 56.322Q-70.024 56.406-70.227 56.406Q-70.458 56.406-70.610 56.234Q-70.762 56.062-70.794 55.832Q-70.954 56.113-71.262 56.279Q-71.571 56.445-71.923 56.445Q-72.434 56.445-72.858 56.222Q-73.282 56-73.282 55.535M-72.594 55.535Q-72.594 55.820-72.368 56.006Q-72.141 56.191-71.848 56.191Q-71.602 56.191-71.378 56.074Q-71.153 55.957-71.018 55.754Q-70.884 55.551-70.884 55.297L-70.884 54.465Q-71.149 54.465-71.434 54.519Q-71.719 54.574-71.991 54.703Q-72.262 54.832-72.428 55.039Q-72.594 55.246-72.594 55.535M-68.509 55.406L-68.509 53.215L-69.212 53.215L-69.212 52.961Q-68.856 52.961-68.614 52.728Q-68.372 52.496-68.260 52.148Q-68.149 51.801-68.149 51.445L-67.868 51.445L-67.868 52.918L-66.692 52.918L-66.692 53.215L-67.868 53.215L-67.868 55.390Q-67.868 55.711-67.749 55.939Q-67.630 56.168-67.348 56.168Q-67.169 56.168-67.052 56.045Q-66.934 55.922-66.882 55.742Q-66.829 55.562-66.829 55.390L-66.829 54.918L-66.548 54.918L-66.548 55.406Q-66.548 55.660-66.653 55.900Q-66.759 56.140-66.956 56.293Q-67.153 56.445-67.411 56.445Q-67.727 56.445-67.979 56.322Q-68.231 56.199-68.370 55.965Q-68.509 55.730-68.509 55.406\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.853 -27.393)\">\u003Cpath d=\"M-62.987 54.613Q-62.987 54.133-62.754 53.717Q-62.522 53.301-62.112 53.051Q-61.702 52.801-61.225 52.801Q-60.495 52.801-60.096 53.242Q-59.698 53.683-59.698 54.414Q-59.698 54.519-59.791 54.543L-62.241 54.543L-62.241 54.613Q-62.241 55.023-62.120 55.379Q-61.998 55.734-61.727 55.951Q-61.455 56.168-61.026 56.168Q-60.663 56.168-60.366 55.939Q-60.069 55.711-59.967 55.359Q-59.959 55.312-59.873 55.297L-59.791 55.297Q-59.698 55.324-59.698 55.406Q-59.698 55.414-59.705 55.445Q-59.768 55.672-59.907 55.855Q-60.045 56.039-60.237 56.172Q-60.428 56.304-60.647 56.375Q-60.866 56.445-61.104 56.445Q-61.475 56.445-61.813 56.308Q-62.151 56.172-62.418 55.920Q-62.686 55.668-62.836 55.328Q-62.987 54.988-62.987 54.613M-62.233 54.304L-60.272 54.304Q-60.272 54-60.373 53.709Q-60.475 53.418-60.692 53.236Q-60.909 53.054-61.225 53.054Q-61.526 53.054-61.756 53.242Q-61.987 53.429-62.110 53.721Q-62.233 54.012-62.233 54.304M-59.166 56.359L-59.166 55.137Q-59.166 55.109-59.135 55.078Q-59.104 55.047-59.080 55.047L-58.975 55.047Q-58.905 55.047-58.889 55.109Q-58.827 55.429-58.688 55.670Q-58.549 55.910-58.317 56.051Q-58.084 56.191-57.776 56.191Q-57.538 56.191-57.329 56.131Q-57.120 56.070-56.983 55.922Q-56.846 55.773-56.846 55.527Q-56.846 55.273-57.057 55.107Q-57.268 54.941-57.538 54.887L-58.159 54.773Q-58.565 54.695-58.866 54.439Q-59.166 54.183-59.166 53.808Q-59.166 53.441-58.965 53.219Q-58.764 52.996-58.440 52.898Q-58.116 52.801-57.776 52.801Q-57.311 52.801-57.014 53.008L-56.791 52.824Q-56.768 52.801-56.737 52.801L-56.686 52.801Q-56.655 52.801-56.627 52.828Q-56.600 52.855-56.600 52.887L-56.600 53.871Q-56.600 53.902-56.625 53.931Q-56.651 53.961-56.686 53.961L-56.791 53.961Q-56.827 53.961-56.854 53.933Q-56.881 53.906-56.881 53.871Q-56.881 53.472-57.133 53.252Q-57.385 53.031-57.784 53.031Q-58.139 53.031-58.422 53.154Q-58.705 53.277-58.705 53.582Q-58.705 53.801-58.504 53.933Q-58.303 54.066-58.057 54.109L-57.432 54.222Q-57.002 54.312-56.694 54.609Q-56.385 54.906-56.385 55.320Q-56.385 55.890-56.784 56.168Q-57.182 56.445-57.776 56.445Q-58.327 56.445-58.678 56.109L-58.975 56.422Q-58.998 56.445-59.034 56.445L-59.080 56.445Q-59.104 56.445-59.135 56.414Q-59.166 56.383-59.166 56.359M-55.815 54.640Q-55.815 54.144-55.565 53.719Q-55.315 53.293-54.895 53.047Q-54.475 52.801-53.975 52.801Q-53.436 52.801-53.045 52.926Q-52.655 53.051-52.655 53.465Q-52.655 53.570-52.705 53.662Q-52.756 53.754-52.848 53.804Q-52.940 53.855-53.049 53.855Q-53.155 53.855-53.246 53.804Q-53.338 53.754-53.389 53.662Q-53.440 53.570-53.440 53.465Q-53.440 53.242-53.272 53.137Q-53.495 53.078-53.967 53.078Q-54.264 53.078-54.479 53.217Q-54.694 53.355-54.825 53.586Q-54.955 53.816-55.014 54.086Q-55.073 54.355-55.073 54.640Q-55.073 55.035-54.940 55.385Q-54.807 55.734-54.536 55.951Q-54.264 56.168-53.866 56.168Q-53.491 56.168-53.215 55.951Q-52.940 55.734-52.838 55.375Q-52.823 55.312-52.760 55.312L-52.655 55.312Q-52.620 55.312-52.594 55.340Q-52.569 55.367-52.569 55.406L-52.569 55.429Q-52.702 55.910-53.086 56.178Q-53.471 56.445-53.975 56.445Q-54.338 56.445-54.672 56.308Q-55.006 56.172-55.266 55.922Q-55.526 55.672-55.670 55.336Q-55.815 55-55.815 54.640M-51.983 55.535Q-51.983 55.051-51.580 54.756Q-51.178 54.461-50.627 54.342Q-50.077 54.222-49.584 54.222L-49.584 53.933Q-49.584 53.707-49.700 53.500Q-49.815 53.293-50.012 53.174Q-50.209 53.054-50.440 53.054Q-50.866 53.054-51.151 53.160Q-51.080 53.187-51.034 53.242Q-50.987 53.297-50.961 53.367Q-50.936 53.437-50.936 53.512Q-50.936 53.617-50.987 53.709Q-51.038 53.801-51.129 53.851Q-51.221 53.902-51.327 53.902Q-51.432 53.902-51.524 53.851Q-51.616 53.801-51.666 53.709Q-51.717 53.617-51.717 53.512Q-51.717 53.094-51.329 52.947Q-50.940 52.801-50.440 52.801Q-50.108 52.801-49.754 52.931Q-49.401 53.062-49.172 53.316Q-48.944 53.570-48.944 53.918L-48.944 55.719Q-48.944 55.851-48.871 55.961Q-48.799 56.070-48.670 56.070Q-48.545 56.070-48.477 55.965Q-48.409 55.859-48.409 55.719L-48.409 55.207L-48.127 55.207L-48.127 55.719Q-48.127 55.922-48.245 56.080Q-48.362 56.238-48.543 56.322Q-48.725 56.406-48.928 56.406Q-49.159 56.406-49.311 56.234Q-49.463 56.062-49.495 55.832Q-49.655 56.113-49.963 56.279Q-50.272 56.445-50.623 56.445Q-51.135 56.445-51.559 56.222Q-51.983 56-51.983 55.535M-51.295 55.535Q-51.295 55.820-51.069 56.006Q-50.842 56.191-50.549 56.191Q-50.303 56.191-50.079 56.074Q-49.854 55.957-49.719 55.754Q-49.584 55.551-49.584 55.297L-49.584 54.465Q-49.850 54.465-50.135 54.519Q-50.420 54.574-50.692 54.703Q-50.963 54.832-51.129 55.039Q-51.295 55.246-51.295 55.535M-45.952 57.918L-47.807 57.918L-47.807 57.625Q-47.538 57.625-47.370 57.580Q-47.202 57.535-47.202 57.359L-47.202 53.535Q-47.202 53.328-47.358 53.275Q-47.514 53.222-47.807 53.222L-47.807 52.926L-46.584 52.840L-46.584 53.304Q-46.354 53.082-46.039 52.961Q-45.725 52.840-45.385 52.840Q-44.913 52.840-44.508 53.086Q-44.104 53.332-43.871 53.748Q-43.639 54.164-43.639 54.640Q-43.639 55.015-43.788 55.344Q-43.936 55.672-44.205 55.924Q-44.475 56.176-44.819 56.310Q-45.163 56.445-45.522 56.445Q-45.811 56.445-46.082 56.324Q-46.354 56.203-46.561 55.992L-46.561 57.359Q-46.561 57.535-46.393 57.580Q-46.225 57.625-45.952 57.625L-45.952 57.918M-46.561 53.703L-46.561 55.543Q-46.409 55.832-46.147 56.012Q-45.885 56.191-45.577 56.191Q-45.291 56.191-45.069 56.053Q-44.846 55.914-44.694 55.683Q-44.541 55.453-44.463 55.181Q-44.385 54.910-44.385 54.640Q-44.385 54.308-44.510 53.951Q-44.635 53.594-44.883 53.357Q-45.131 53.121-45.479 53.121Q-45.803 53.121-46.098 53.277Q-46.393 53.433-46.561 53.703\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(24.853 -27.393)\">\u003Cpath d=\"M-42.870 54.613Q-42.870 54.133-42.637 53.717Q-42.405 53.301-41.995 53.051Q-41.585 52.801-41.108 52.801Q-40.378 52.801-39.979 53.242Q-39.581 53.683-39.581 54.414Q-39.581 54.519-39.674 54.543L-42.124 54.543L-42.124 54.613Q-42.124 55.023-42.003 55.379Q-41.881 55.734-41.610 55.951Q-41.338 56.168-40.909 56.168Q-40.545 56.168-40.249 55.939Q-39.952 55.711-39.850 55.359Q-39.842 55.312-39.756 55.297L-39.674 55.297Q-39.581 55.324-39.581 55.406Q-39.581 55.414-39.588 55.445Q-39.651 55.672-39.790 55.855Q-39.928 56.039-40.120 56.172Q-40.311 56.304-40.530 56.375Q-40.749 56.445-40.987 56.445Q-41.358 56.445-41.696 56.308Q-42.034 56.172-42.301 55.920Q-42.569 55.668-42.719 55.328Q-42.870 54.988-42.870 54.613M-42.116 54.304L-40.155 54.304Q-40.155 54-40.256 53.709Q-40.358 53.418-40.575 53.236Q-40.792 53.054-41.108 53.054Q-41.409 53.054-41.639 53.242Q-41.870 53.429-41.993 53.721Q-42.116 54.012-42.116 54.304M-39.049 56.359L-39.049 55.137Q-39.049 55.109-39.018 55.078Q-38.987 55.047-38.963 55.047L-38.858 55.047Q-38.788 55.047-38.772 55.109Q-38.710 55.429-38.571 55.670Q-38.432 55.910-38.200 56.051Q-37.967 56.191-37.659 56.191Q-37.420 56.191-37.212 56.131Q-37.003 56.070-36.866 55.922Q-36.729 55.773-36.729 55.527Q-36.729 55.273-36.940 55.107Q-37.151 54.941-37.420 54.887L-38.042 54.773Q-38.448 54.695-38.749 54.439Q-39.049 54.183-39.049 53.808Q-39.049 53.441-38.848 53.219Q-38.647 52.996-38.323 52.898Q-37.999 52.801-37.659 52.801Q-37.194 52.801-36.897 53.008L-36.674 52.824Q-36.651 52.801-36.620 52.801L-36.569 52.801Q-36.538 52.801-36.510 52.828Q-36.483 52.855-36.483 52.887L-36.483 53.871Q-36.483 53.902-36.508 53.931Q-36.534 53.961-36.569 53.961L-36.674 53.961Q-36.710 53.961-36.737 53.933Q-36.764 53.906-36.764 53.871Q-36.764 53.472-37.016 53.252Q-37.268 53.031-37.667 53.031Q-38.022 53.031-38.305 53.154Q-38.588 53.277-38.588 53.582Q-38.588 53.801-38.387 53.933Q-38.186 54.066-37.940 54.109L-37.315 54.222Q-36.885 54.312-36.577 54.609Q-36.268 54.906-36.268 55.320Q-36.268 55.890-36.667 56.168Q-37.065 56.445-37.659 56.445Q-38.210 56.445-38.561 56.109L-38.858 56.422Q-38.881 56.445-38.917 56.445L-38.963 56.445Q-38.987 56.445-39.018 56.414Q-39.049 56.383-39.049 56.359\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M.55-57.444h65.887\"\u002F>\u003Cpath fill=\"none\" d=\"M63.997-61.289c.555 2.307 1.793 3.397 3.04 3.845-1.247.449-2.485 1.538-3.04 3.845\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M102.38-42.617V6.198\"\u002F>\u003Cpath fill=\"none\" d=\"M106.225 3.758c-2.307.555-3.397 1.793-3.845 3.04-.449-1.247-1.538-2.485-3.845-3.04\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M67.637 22.224H1.75\"\u002F>\u003Cpath fill=\"none\" d=\"M4.19 26.07c-.556-2.308-1.793-3.397-3.04-3.846 1.247-.448 2.484-1.538 3.04-3.845\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003Cg style=\"stroke-width:1.2\">\u003Cpath fill=\"none\" d=\"M-34.193 7.398v-48.815\"\u002F>\u003Cpath fill=\"none\" d=\"M-38.039-38.977c2.308-.556 3.397-1.793 3.846-3.04.448 1.247 1.538 2.484 3.845 3.04\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The kappa-mechanism engine cycle; in the helium ionization zone opacity rises on compression, damming the outward flux and storing heat, which pushes the layer back out, whereupon opacity falls, heat escapes, and the layer falls back to compress again.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:423.554px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 317.666 179.732\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M216.678 95.352H-38.997\"\u002F>\u003Cpath fill=\"none\" d=\"M-37.117 97.752c-.38-1.44-1.227-2.12-2.08-2.4.853-.28 1.7-.96 2.08-2.4\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(-26.207 2.778)\">\u003Cpath d=\"M-37.229 95.352L-39.084 95.352L-39.084 95.055Q-38.811 95.055-38.643 95.008Q-38.475 94.961-38.475 94.793L-38.475 90.633Q-38.475 90.418-38.538 90.323Q-38.600 90.227-38.719 90.206Q-38.838 90.184-39.084 90.184L-39.084 89.887L-37.862 89.801L-37.862 92.504Q-37.737 92.293-37.549 92.143Q-37.362 91.993-37.135 91.909Q-36.909 91.825-36.663 91.825Q-35.495 91.825-35.495 92.903L-35.495 94.793Q-35.495 94.961-35.325 95.008Q-35.155 95.055-34.885 95.055L-34.885 95.352L-36.741 95.352L-36.741 95.055Q-36.467 95.055-36.299 95.008Q-36.131 94.961-36.131 94.793L-36.131 92.918Q-36.131 92.536-36.252 92.307Q-36.374 92.079-36.725 92.079Q-37.038 92.079-37.292 92.241Q-37.545 92.403-37.692 92.672Q-37.838 92.942-37.838 93.239L-37.838 94.793Q-37.838 94.961-37.668 95.008Q-37.499 95.055-37.229 95.055L-37.229 95.352M-34.440 93.657Q-34.440 93.153-34.184 92.721Q-33.928 92.290-33.493 92.038Q-33.057 91.786-32.557 91.786Q-32.170 91.786-31.829 91.930Q-31.487 92.075-31.225 92.336Q-30.963 92.598-30.821 92.934Q-30.678 93.270-30.678 93.657Q-30.678 94.149-30.942 94.559Q-31.206 94.969-31.635 95.200Q-32.065 95.430-32.557 95.430Q-33.049 95.430-33.483 95.198Q-33.917 94.965-34.178 94.557Q-34.440 94.149-34.440 93.657M-32.557 95.153Q-32.100 95.153-31.848 94.930Q-31.596 94.707-31.508 94.356Q-31.420 94.004-31.420 93.559Q-31.420 93.129-31.514 92.791Q-31.608 92.454-31.862 92.247Q-32.116 92.040-32.557 92.040Q-33.206 92.040-33.450 92.456Q-33.694 92.872-33.694 93.559Q-33.694 94.004-33.606 94.356Q-33.518 94.707-33.266 94.930Q-33.014 95.153-32.557 95.153M-29.569 94.391L-29.569 92.200L-30.272 92.200L-30.272 91.946Q-29.917 91.946-29.674 91.713Q-29.432 91.481-29.321 91.133Q-29.209 90.786-29.209 90.430L-28.928 90.430L-28.928 91.903L-27.752 91.903L-27.752 92.200L-28.928 92.200L-28.928 94.375Q-28.928 94.696-28.809 94.924Q-28.690 95.153-28.409 95.153Q-28.229 95.153-28.112 95.030Q-27.995 94.907-27.942 94.727Q-27.889 94.547-27.889 94.375L-27.889 93.903L-27.608 93.903L-27.608 94.391Q-27.608 94.645-27.713 94.885Q-27.819 95.125-28.016 95.278Q-28.213 95.430-28.471 95.430Q-28.788 95.430-29.040 95.307Q-29.292 95.184-29.430 94.950Q-29.569 94.715-29.569 94.391M-26.264 94.391L-26.264 92.200L-26.967 92.200L-26.967 91.946Q-26.612 91.946-26.370 91.713Q-26.127 91.481-26.016 91.133Q-25.905 90.786-25.905 90.430L-25.624 90.430L-25.624 91.903L-24.448 91.903L-24.448 92.200L-25.624 92.200L-25.624 94.375Q-25.624 94.696-25.504 94.924Q-25.385 95.153-25.104 95.153Q-24.924 95.153-24.807 95.030Q-24.690 94.907-24.637 94.727Q-24.584 94.547-24.584 94.375L-24.584 93.903L-24.303 93.903L-24.303 94.391Q-24.303 94.645-24.409 94.885Q-24.514 95.125-24.711 95.278Q-24.909 95.430-25.167 95.430Q-25.483 95.430-25.735 95.307Q-25.987 95.184-26.126 94.950Q-26.264 94.715-26.264 94.391M-23.584 93.598Q-23.584 93.118-23.352 92.702Q-23.120 92.286-22.709 92.036Q-22.299 91.786-21.823 91.786Q-21.092 91.786-20.694 92.227Q-20.295 92.668-20.295 93.399Q-20.295 93.504-20.389 93.528L-22.838 93.528L-22.838 93.598Q-22.838 94.008-22.717 94.364Q-22.596 94.719-22.325 94.936Q-22.053 95.153-21.624 95.153Q-21.260 95.153-20.963 94.924Q-20.667 94.696-20.565 94.344Q-20.557 94.297-20.471 94.282L-20.389 94.282Q-20.295 94.309-20.295 94.391Q-20.295 94.399-20.303 94.430Q-20.366 94.657-20.504 94.840Q-20.643 95.024-20.834 95.157Q-21.026 95.290-21.245 95.360Q-21.463 95.430-21.702 95.430Q-22.073 95.430-22.411 95.293Q-22.749 95.157-23.016 94.905Q-23.284 94.653-23.434 94.313Q-23.584 93.973-23.584 93.598M-22.831 93.290L-20.870 93.290Q-20.870 92.985-20.971 92.694Q-21.073 92.403-21.290 92.221Q-21.506 92.040-21.823 92.040Q-22.124 92.040-22.354 92.227Q-22.584 92.415-22.708 92.706Q-22.831 92.997-22.831 93.290M-17.799 95.352L-19.780 95.352L-19.780 95.055Q-19.510 95.055-19.342 95.010Q-19.174 94.965-19.174 94.793L-19.174 92.657Q-19.174 92.442-19.237 92.346Q-19.299 92.250-19.417 92.229Q-19.534 92.207-19.780 92.207L-19.780 91.911L-18.612 91.825L-18.612 92.610Q-18.534 92.399-18.381 92.213Q-18.229 92.028-18.030 91.926Q-17.831 91.825-17.604 91.825Q-17.358 91.825-17.167 91.969Q-16.975 92.114-16.975 92.344Q-16.975 92.500-17.081 92.610Q-17.186 92.719-17.342 92.719Q-17.499 92.719-17.608 92.610Q-17.717 92.500-17.717 92.344Q-17.717 92.184-17.612 92.079Q-17.936 92.079-18.151 92.307Q-18.366 92.536-18.461 92.875Q-18.557 93.215-18.557 93.520L-18.557 94.793Q-18.557 94.961-18.331 95.008Q-18.104 95.055-17.799 95.055\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M216.678 95.352V-57.893\"\u002F>\u003Cpath fill=\"none\" d=\"M214.278-56.013c1.44-.38 2.12-1.227 2.4-2.08.28.853.96 1.7 2.4 2.08\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(236.69 -158.733)\">\u003Cpath d=\"M-37.245 95.352L-39.077 95.352L-39.077 95.055Q-38.803 95.055-38.635 95.008Q-38.467 94.961-38.467 94.793L-38.467 90.633Q-38.467 90.418-38.530 90.323Q-38.592 90.227-38.711 90.206Q-38.831 90.184-39.077 90.184L-39.077 89.887L-37.854 89.801L-37.854 94.793Q-37.854 94.961-37.686 95.008Q-37.518 95.055-37.245 95.055L-37.245 95.352M-36.116 94.399L-36.116 92.657Q-36.116 92.442-36.178 92.346Q-36.241 92.250-36.360 92.229Q-36.479 92.207-36.725 92.207L-36.725 91.911L-35.479 91.825L-35.479 94.375L-35.479 94.399Q-35.479 94.711-35.424 94.873Q-35.370 95.036-35.219 95.106Q-35.069 95.176-34.749 95.176Q-34.319 95.176-34.045 94.838Q-33.772 94.500-33.772 94.055L-33.772 92.657Q-33.772 92.442-33.834 92.346Q-33.897 92.250-34.016 92.229Q-34.135 92.207-34.381 92.207L-34.381 91.911L-33.135 91.825L-33.135 94.610Q-33.135 94.821-33.073 94.916Q-33.010 95.012-32.891 95.034Q-32.772 95.055-32.526 95.055L-32.526 95.352L-33.749 95.430L-33.749 94.809Q-33.917 95.098-34.198 95.264Q-34.479 95.430-34.799 95.430Q-36.116 95.430-36.116 94.399M-30.151 95.352L-32.006 95.352L-32.006 95.055Q-31.733 95.055-31.565 95.008Q-31.397 94.961-31.397 94.793L-31.397 92.657Q-31.397 92.442-31.459 92.346Q-31.522 92.250-31.641 92.229Q-31.760 92.207-32.006 92.207L-32.006 91.911L-30.815 91.825L-30.815 92.559Q-30.702 92.344-30.508 92.176Q-30.315 92.008-30.077 91.916Q-29.838 91.825-29.584 91.825Q-28.624 91.825-28.448 92.536Q-28.264 92.207-27.936 92.016Q-27.608 91.825-27.229 91.825Q-26.053 91.825-26.053 92.903L-26.053 94.793Q-26.053 94.961-25.885 95.008Q-25.717 95.055-25.448 95.055L-25.448 95.352L-27.303 95.352L-27.303 95.055Q-27.030 95.055-26.862 95.010Q-26.694 94.965-26.694 94.793L-26.694 92.918Q-26.694 92.532-26.819 92.305Q-26.944 92.079-27.295 92.079Q-27.600 92.079-27.856 92.241Q-28.112 92.403-28.260 92.672Q-28.409 92.942-28.409 93.239L-28.409 94.793Q-28.409 94.961-28.239 95.008Q-28.069 95.055-27.799 95.055L-27.799 95.352L-29.655 95.352L-29.655 95.055Q-29.381 95.055-29.213 95.008Q-29.045 94.961-29.045 94.793L-29.045 92.918Q-29.045 92.532-29.170 92.305Q-29.295 92.079-29.647 92.079Q-29.952 92.079-30.208 92.241Q-30.463 92.403-30.612 92.672Q-30.760 92.942-30.760 93.239L-30.760 94.793Q-30.760 94.961-30.590 95.008Q-30.420 95.055-30.151 95.055L-30.151 95.352M-23.143 95.352L-24.920 95.352L-24.920 95.055Q-24.647 95.055-24.479 95.008Q-24.311 94.961-24.311 94.793L-24.311 92.657Q-24.311 92.442-24.368 92.346Q-24.424 92.250-24.538 92.229Q-24.651 92.207-24.897 92.207L-24.897 91.911L-23.698 91.825L-23.698 94.793Q-23.698 94.961-23.551 95.008Q-23.405 95.055-23.143 95.055L-23.143 95.352M-24.584 90.430Q-24.584 90.239-24.450 90.108Q-24.315 89.977-24.120 89.977Q-23.999 89.977-23.895 90.040Q-23.792 90.102-23.729 90.206Q-23.667 90.309-23.667 90.430Q-23.667 90.625-23.797 90.760Q-23.928 90.895-24.120 90.895Q-24.319 90.895-24.452 90.762Q-24.584 90.629-24.584 90.430M-20.713 95.352L-22.569 95.352L-22.569 95.055Q-22.295 95.055-22.127 95.008Q-21.959 94.961-21.959 94.793L-21.959 92.657Q-21.959 92.442-22.022 92.346Q-22.084 92.250-22.204 92.229Q-22.323 92.207-22.569 92.207L-22.569 91.911L-21.377 91.825L-21.377 92.559Q-21.264 92.344-21.071 92.176Q-20.877 92.008-20.639 91.916Q-20.401 91.825-20.147 91.825Q-18.979 91.825-18.979 92.903L-18.979 94.793Q-18.979 94.961-18.809 95.008Q-18.639 95.055-18.370 95.055L-18.370 95.352L-20.225 95.352L-20.225 95.055Q-19.952 95.055-19.784 95.008Q-19.616 94.961-19.616 94.793L-19.616 92.918Q-19.616 92.536-19.737 92.307Q-19.858 92.079-20.209 92.079Q-20.522 92.079-20.776 92.241Q-21.030 92.403-21.176 92.672Q-21.323 92.942-21.323 93.239L-21.323 94.793Q-21.323 94.961-21.153 95.008Q-20.983 95.055-20.713 95.055L-20.713 95.352M-17.924 93.657Q-17.924 93.153-17.668 92.721Q-17.413 92.290-16.977 92.038Q-16.542 91.786-16.042 91.786Q-15.655 91.786-15.313 91.930Q-14.971 92.075-14.709 92.336Q-14.448 92.598-14.305 92.934Q-14.163 93.270-14.163 93.657Q-14.163 94.149-14.426 94.559Q-14.690 94.969-15.120 95.200Q-15.549 95.430-16.042 95.430Q-16.534 95.430-16.967 95.198Q-17.401 94.965-17.663 94.557Q-17.924 94.149-17.924 93.657M-16.042 95.153Q-15.584 95.153-15.333 94.930Q-15.081 94.707-14.993 94.356Q-14.905 94.004-14.905 93.559Q-14.905 93.129-14.999 92.791Q-15.092 92.454-15.346 92.247Q-15.600 92.040-16.042 92.040Q-16.690 92.040-16.934 92.456Q-17.178 92.872-17.178 93.559Q-17.178 94.004-17.090 94.356Q-17.002 94.707-16.751 94.930Q-16.499 95.153-16.042 95.153M-13.635 95.344L-13.635 94.122Q-13.635 94.094-13.604 94.063Q-13.573 94.032-13.549 94.032L-13.444 94.032Q-13.374 94.032-13.358 94.094Q-13.295 94.415-13.157 94.655Q-13.018 94.895-12.786 95.036Q-12.553 95.176-12.245 95.176Q-12.006 95.176-11.797 95.116Q-11.588 95.055-11.452 94.907Q-11.315 94.758-11.315 94.512Q-11.315 94.258-11.526 94.092Q-11.737 93.926-12.006 93.872L-12.627 93.758Q-13.034 93.680-13.334 93.424Q-13.635 93.168-13.635 92.793Q-13.635 92.426-13.434 92.204Q-13.233 91.981-12.909 91.883Q-12.584 91.786-12.245 91.786Q-11.780 91.786-11.483 91.993L-11.260 91.809Q-11.237 91.786-11.206 91.786L-11.155 91.786Q-11.124 91.786-11.096 91.813Q-11.069 91.840-11.069 91.872L-11.069 92.856Q-11.069 92.887-11.094 92.916Q-11.120 92.946-11.155 92.946L-11.260 92.946Q-11.295 92.946-11.323 92.918Q-11.350 92.891-11.350 92.856Q-11.350 92.457-11.602 92.237Q-11.854 92.016-12.252 92.016Q-12.608 92.016-12.891 92.139Q-13.174 92.262-13.174 92.567Q-13.174 92.786-12.973 92.918Q-12.772 93.051-12.526 93.094L-11.901 93.207Q-11.471 93.297-11.163 93.594Q-10.854 93.891-10.854 94.305Q-10.854 94.875-11.252 95.153Q-11.651 95.430-12.245 95.430Q-12.795 95.430-13.147 95.094L-13.444 95.407Q-13.467 95.430-13.502 95.430L-13.549 95.430Q-13.573 95.430-13.604 95.399Q-13.635 95.368-13.635 95.344M-8.467 95.352L-10.245 95.352L-10.245 95.055Q-9.971 95.055-9.803 95.008Q-9.635 94.961-9.635 94.793L-9.635 92.657Q-9.635 92.442-9.692 92.346Q-9.749 92.250-9.862 92.229Q-9.975 92.207-10.221 92.207L-10.221 91.911L-9.022 91.825L-9.022 94.793Q-9.022 94.961-8.876 95.008Q-8.729 95.055-8.467 95.055L-8.467 95.352M-9.909 90.430Q-9.909 90.239-9.774 90.108Q-9.639 89.977-9.444 89.977Q-9.323 89.977-9.219 90.040Q-9.116 90.102-9.053 90.206Q-8.991 90.309-8.991 90.430Q-8.991 90.625-9.122 90.760Q-9.252 90.895-9.444 90.895Q-9.643 90.895-9.776 90.762Q-9.909 90.629-9.909 90.430M-7.342 94.391L-7.342 92.200L-8.045 92.200L-8.045 91.946Q-7.690 91.946-7.448 91.713Q-7.206 91.481-7.094 91.133Q-6.983 90.786-6.983 90.430L-6.702 90.430L-6.702 91.903L-5.526 91.903L-5.526 92.200L-6.702 92.200L-6.702 94.375Q-6.702 94.696-6.583 94.924Q-6.463 95.153-6.182 95.153Q-6.002 95.153-5.885 95.030Q-5.768 94.907-5.715 94.727Q-5.663 94.547-5.663 94.375L-5.663 93.903L-5.381 93.903L-5.381 94.391Q-5.381 94.645-5.487 94.885Q-5.592 95.125-5.790 95.278Q-5.987 95.430-6.245 95.430Q-6.561 95.430-6.813 95.307Q-7.065 95.184-7.204 94.950Q-7.342 94.715-7.342 94.391\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(236.69 -158.733)\">\u003Cpath d=\"M-4.457 96.649Q-4.343 96.727-4.168 96.727Q-3.879 96.727-3.658 96.514Q-3.437 96.301-3.312 96L-3.023 95.352L-4.297 92.465Q-4.379 92.290-4.523 92.245Q-4.668 92.200-4.937 92.200L-4.937 91.903L-3.218 91.903L-3.218 92.200Q-3.640 92.200-3.640 92.383Q-3.640 92.395-3.625 92.465L-2.687 94.590L-1.855 92.680Q-1.816 92.590-1.816 92.512Q-1.816 92.372-1.918 92.286Q-2.019 92.200-2.160 92.200L-2.160 91.903L-0.808 91.903L-0.808 92.200Q-1.062 92.200-1.256 92.325Q-1.449 92.450-1.554 92.680L-3 96Q-3.113 96.254-3.279 96.477Q-3.445 96.700-3.674 96.842Q-3.902 96.985-4.168 96.985Q-4.465 96.985-4.705 96.793Q-4.945 96.602-4.945 96.313Q-4.945 96.157-4.840 96.055Q-4.734 95.954-4.586 95.954Q-4.480 95.954-4.400 96Q-4.320 96.047-4.273 96.125Q-4.226 96.204-4.226 96.313Q-4.226 96.434-4.287 96.522Q-4.347 96.610-4.457 96.649\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M.437-46.912C74.414 9.993 145.546 55.518 199.607 75.435\" style=\"stroke-width:.8\"\u002F>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"rotate(27 144.279 394.707)\">\u003Cpath d=\"M-37.229 95.352L-39.084 95.352L-39.084 95.055Q-38.811 95.055-38.643 95.008Q-38.475 94.961-38.475 94.793L-38.475 92.657Q-38.475 92.442-38.538 92.346Q-38.600 92.250-38.719 92.229Q-38.838 92.207-39.084 92.207L-39.084 91.911L-37.893 91.825L-37.893 92.559Q-37.780 92.344-37.586 92.176Q-37.393 92.008-37.155 91.916Q-36.917 91.825-36.663 91.825Q-35.702 91.825-35.526 92.536Q-35.342 92.207-35.014 92.016Q-34.686 91.825-34.307 91.825Q-33.131 91.825-33.131 92.903L-33.131 94.793Q-33.131 94.961-32.963 95.008Q-32.795 95.055-32.526 95.055L-32.526 95.352L-34.381 95.352L-34.381 95.055Q-34.108 95.055-33.940 95.010Q-33.772 94.965-33.772 94.793L-33.772 92.918Q-33.772 92.532-33.897 92.305Q-34.022 92.079-34.374 92.079Q-34.678 92.079-34.934 92.241Q-35.190 92.403-35.338 92.672Q-35.487 92.942-35.487 93.239L-35.487 94.793Q-35.487 94.961-35.317 95.008Q-35.147 95.055-34.877 95.055L-34.877 95.352L-36.733 95.352L-36.733 95.055Q-36.459 95.055-36.292 95.008Q-36.124 94.961-36.124 94.793L-36.124 92.918Q-36.124 92.532-36.249 92.305Q-36.374 92.079-36.725 92.079Q-37.030 92.079-37.286 92.241Q-37.542 92.403-37.690 92.672Q-37.838 92.942-37.838 93.239L-37.838 94.793Q-37.838 94.961-37.668 95.008Q-37.499 95.055-37.229 95.055L-37.229 95.352M-31.983 94.520Q-31.983 94.036-31.581 93.741Q-31.178 93.446-30.627 93.327Q-30.077 93.207-29.584 93.207L-29.584 92.918Q-29.584 92.692-29.700 92.485Q-29.815 92.278-30.012 92.159Q-30.209 92.040-30.440 92.040Q-30.866 92.040-31.151 92.145Q-31.081 92.172-31.034 92.227Q-30.987 92.282-30.961 92.352Q-30.936 92.422-30.936 92.497Q-30.936 92.602-30.987 92.694Q-31.038 92.786-31.129 92.836Q-31.221 92.887-31.327 92.887Q-31.432 92.887-31.524 92.836Q-31.616 92.786-31.667 92.694Q-31.717 92.602-31.717 92.497Q-31.717 92.079-31.329 91.932Q-30.940 91.786-30.440 91.786Q-30.108 91.786-29.754 91.916Q-29.401 92.047-29.172 92.301Q-28.944 92.555-28.944 92.903L-28.944 94.704Q-28.944 94.836-28.872 94.946Q-28.799 95.055-28.670 95.055Q-28.545 95.055-28.477 94.950Q-28.409 94.844-28.409 94.704L-28.409 94.192L-28.127 94.192L-28.127 94.704Q-28.127 94.907-28.245 95.065Q-28.362 95.223-28.543 95.307Q-28.725 95.391-28.928 95.391Q-29.159 95.391-29.311 95.219Q-29.463 95.047-29.495 94.817Q-29.655 95.098-29.963 95.264Q-30.272 95.430-30.624 95.430Q-31.135 95.430-31.559 95.207Q-31.983 94.985-31.983 94.520M-31.295 94.520Q-31.295 94.805-31.069 94.991Q-30.842 95.176-30.549 95.176Q-30.303 95.176-30.079 95.059Q-29.854 94.942-29.719 94.739Q-29.584 94.536-29.584 94.282L-29.584 93.450Q-29.850 93.450-30.135 93.504Q-30.420 93.559-30.692 93.688Q-30.963 93.817-31.129 94.024Q-31.295 94.231-31.295 94.520M-25.975 95.352L-27.752 95.352L-27.752 95.055Q-27.479 95.055-27.311 95.008Q-27.143 94.961-27.143 94.793L-27.143 92.657Q-27.143 92.442-27.200 92.346Q-27.256 92.250-27.370 92.229Q-27.483 92.207-27.729 92.207L-27.729 91.911L-26.530 91.825L-26.530 94.793Q-26.530 94.961-26.383 95.008Q-26.237 95.055-25.975 95.055L-25.975 95.352M-27.417 90.430Q-27.417 90.239-27.282 90.108Q-27.147 89.977-26.952 89.977Q-26.831 89.977-26.727 90.040Q-26.624 90.102-26.561 90.206Q-26.499 90.309-26.499 90.430Q-26.499 90.625-26.629 90.760Q-26.760 90.895-26.952 90.895Q-27.151 90.895-27.284 90.762Q-27.417 90.629-27.417 90.430M-23.545 95.352L-25.401 95.352L-25.401 95.055Q-25.127 95.055-24.959 95.008Q-24.792 94.961-24.792 94.793L-24.792 92.657Q-24.792 92.442-24.854 92.346Q-24.917 92.250-25.036 92.229Q-25.155 92.207-25.401 92.207L-25.401 91.911L-24.209 91.825L-24.209 92.559Q-24.096 92.344-23.903 92.176Q-23.709 92.008-23.471 91.916Q-23.233 91.825-22.979 91.825Q-21.811 91.825-21.811 92.903L-21.811 94.793Q-21.811 94.961-21.641 95.008Q-21.471 95.055-21.202 95.055L-21.202 95.352L-23.057 95.352L-23.057 95.055Q-22.784 95.055-22.616 95.008Q-22.448 94.961-22.448 94.793L-22.448 92.918Q-22.448 92.536-22.569 92.307Q-22.690 92.079-23.042 92.079Q-23.354 92.079-23.608 92.241Q-23.862 92.403-24.008 92.672Q-24.155 92.942-24.155 93.239L-24.155 94.793Q-24.155 94.961-23.985 95.008Q-23.815 95.055-23.545 95.055\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"rotate(27 144.279 394.707)\">\u003Cpath d=\"M-17.865 95.344L-17.865 94.122Q-17.865 94.094-17.834 94.063Q-17.802 94.032-17.779 94.032L-17.673 94.032Q-17.603 94.032-17.587 94.094Q-17.525 94.415-17.386 94.655Q-17.248 94.895-17.015 95.036Q-16.783 95.176-16.474 95.176Q-16.236 95.176-16.027 95.116Q-15.818 95.055-15.681 94.907Q-15.544 94.758-15.544 94.512Q-15.544 94.258-15.755 94.092Q-15.966 93.926-16.236 93.872L-16.857 93.758Q-17.263 93.680-17.564 93.424Q-17.865 93.168-17.865 92.793Q-17.865 92.426-17.664 92.204Q-17.462 91.981-17.138 91.883Q-16.814 91.786-16.474 91.786Q-16.009 91.786-15.712 91.993L-15.490 91.809Q-15.466 91.786-15.435 91.786L-15.384 91.786Q-15.353 91.786-15.326 91.813Q-15.298 91.840-15.298 91.872L-15.298 92.856Q-15.298 92.887-15.324 92.916Q-15.349 92.946-15.384 92.946L-15.490 92.946Q-15.525 92.946-15.552 92.918Q-15.580 92.891-15.580 92.856Q-15.580 92.457-15.832 92.237Q-16.084 92.016-16.482 92.016Q-16.837 92.016-17.121 92.139Q-17.404 92.262-17.404 92.567Q-17.404 92.786-17.203 92.918Q-17.001 93.051-16.755 93.094L-16.130 93.207Q-15.701 93.297-15.392 93.594Q-15.084 93.891-15.084 94.305Q-15.084 94.875-15.482 95.153Q-15.880 95.430-16.474 95.430Q-17.025 95.430-17.376 95.094L-17.673 95.407Q-17.697 95.430-17.732 95.430L-17.779 95.430Q-17.802 95.430-17.834 95.399Q-17.865 95.368-17.865 95.344M-14.556 93.598Q-14.556 93.118-14.324 92.702Q-14.091 92.286-13.681 92.036Q-13.271 91.786-12.794 91.786Q-12.064 91.786-11.666 92.227Q-11.267 92.668-11.267 93.399Q-11.267 93.504-11.361 93.528L-13.810 93.528L-13.810 93.598Q-13.810 94.008-13.689 94.364Q-13.568 94.719-13.296 94.936Q-13.025 95.153-12.595 95.153Q-12.232 95.153-11.935 94.924Q-11.638 94.696-11.537 94.344Q-11.529 94.297-11.443 94.282L-11.361 94.282Q-11.267 94.309-11.267 94.391Q-11.267 94.399-11.275 94.430Q-11.337 94.657-11.476 94.840Q-11.615 95.024-11.806 95.157Q-11.998 95.290-12.216 95.360Q-12.435 95.430-12.673 95.430Q-13.044 95.430-13.382 95.293Q-13.720 95.157-13.988 94.905Q-14.255 94.653-14.406 94.313Q-14.556 93.973-14.556 93.598M-13.802 93.290L-11.841 93.290Q-11.841 92.985-11.943 92.694Q-12.044 92.403-12.261 92.221Q-12.478 92.040-12.794 92.040Q-13.095 92.040-13.326 92.227Q-13.556 92.415-13.679 92.706Q-13.802 92.997-13.802 93.290M-6.560 96.903L-8.416 96.903L-8.416 96.610Q-8.146 96.610-7.978 96.565Q-7.810 96.520-7.810 96.344L-7.810 94.895Q-8.013 95.141-8.314 95.286Q-8.615 95.430-8.947 95.430Q-9.431 95.430-9.843 95.188Q-10.255 94.946-10.496 94.534Q-10.736 94.122-10.736 93.625Q-10.736 93.129-10.480 92.715Q-10.224 92.301-9.794 92.063Q-9.365 91.825-8.873 91.825Q-8.517 91.825-8.210 92.004Q-7.904 92.184-7.712 92.497L-7.423 91.825L-7.169 91.825L-7.169 96.344Q-7.169 96.520-7.001 96.565Q-6.834 96.610-6.560 96.610L-6.560 96.903M-8.888 95.176Q-8.521 95.176-8.228 94.944Q-7.935 94.711-7.787 94.352L-7.787 93.016Q-7.880 92.633-8.154 92.370Q-8.427 92.106-8.802 92.106Q-9.162 92.106-9.435 92.336Q-9.709 92.567-9.851 92.924Q-9.994 93.282-9.994 93.633Q-9.994 93.969-9.869 94.331Q-9.744 94.692-9.492 94.934Q-9.240 95.176-8.888 95.176M-5.615 94.399L-5.615 92.657Q-5.615 92.442-5.677 92.346Q-5.740 92.250-5.859 92.229Q-5.978 92.207-6.224 92.207L-6.224 91.911L-4.978 91.825L-4.978 94.375L-4.978 94.399Q-4.978 94.711-4.923 94.873Q-4.869 95.036-4.718 95.106Q-4.568 95.176-4.248 95.176Q-3.818 95.176-3.544 94.838Q-3.271 94.500-3.271 94.055L-3.271 92.657Q-3.271 92.442-3.334 92.346Q-3.396 92.250-3.515 92.229Q-3.634 92.207-3.880 92.207L-3.880 91.911L-2.634 91.825L-2.634 94.610Q-2.634 94.821-2.572 94.916Q-2.509 95.012-2.390 95.034Q-2.271 95.055-2.025 95.055L-2.025 95.352L-3.248 95.430L-3.248 94.809Q-3.416 95.098-3.697 95.264Q-3.978 95.430-4.298 95.430Q-5.615 95.430-5.615 94.399M-1.580 93.598Q-1.580 93.118-1.347 92.702Q-1.115 92.286-0.705 92.036Q-0.294 91.786 0.182 91.786Q0.913 91.786 1.311 92.227Q1.709 92.668 1.709 93.399Q1.709 93.504 1.616 93.528L-0.834 93.528L-0.834 93.598Q-0.834 94.008-0.712 94.364Q-0.591 94.719-0.320 94.936Q-0.048 95.153 0.381 95.153Q0.745 95.153 1.041 94.924Q1.338 94.696 1.440 94.344Q1.448 94.297 1.534 94.282L1.616 94.282Q1.709 94.309 1.709 94.391Q1.709 94.399 1.702 94.430Q1.639 94.657 1.500 94.840Q1.362 95.024 1.170 95.157Q0.979 95.290 0.760 95.360Q0.541 95.430 0.303 95.430Q-0.068 95.430-0.406 95.293Q-0.744 95.157-1.011 94.905Q-1.279 94.653-1.429 94.313Q-1.580 93.973-1.580 93.598M-0.826 93.290L1.135 93.290Q1.135 92.985 1.034 92.694Q0.932 92.403 0.715 92.221Q0.499 92.040 0.182 92.040Q-0.119 92.040-0.349 92.227Q-0.580 92.415-0.703 92.706Q-0.826 92.997-0.826 93.290M4.127 95.352L2.272 95.352L2.272 95.055Q2.545 95.055 2.713 95.008Q2.881 94.961 2.881 94.793L2.881 92.657Q2.881 92.442 2.819 92.346Q2.756 92.250 2.637 92.229Q2.518 92.207 2.272 92.207L2.272 91.911L3.463 91.825L3.463 92.559Q3.577 92.344 3.770 92.176Q3.963 92.008 4.202 91.916Q4.440 91.825 4.694 91.825Q5.862 91.825 5.862 92.903L5.862 94.793Q5.862 94.961 6.032 95.008Q6.202 95.055 6.471 95.055L6.471 95.352L4.616 95.352L4.616 95.055Q4.889 95.055 5.057 95.008Q5.225 94.961 5.225 94.793L5.225 92.918Q5.225 92.536 5.104 92.307Q4.983 92.079 4.631 92.079Q4.319 92.079 4.065 92.241Q3.811 92.403 3.665 92.672Q3.518 92.942 3.518 93.239L3.518 94.793Q3.518 94.961 3.688 95.008Q3.858 95.055 4.127 95.055L4.127 95.352M6.959 93.625Q6.959 93.129 7.209 92.704Q7.459 92.278 7.879 92.032Q8.299 91.786 8.799 91.786Q9.338 91.786 9.729 91.911Q10.120 92.036 10.120 92.450Q10.120 92.555 10.069 92.647Q10.018 92.739 9.926 92.790Q9.834 92.840 9.725 92.840Q9.620 92.840 9.528 92.790Q9.436 92.739 9.385 92.647Q9.334 92.555 9.334 92.450Q9.334 92.227 9.502 92.122Q9.280 92.063 8.807 92.063Q8.510 92.063 8.295 92.202Q8.081 92.340 7.950 92.571Q7.819 92.801 7.760 93.071Q7.702 93.340 7.702 93.625Q7.702 94.020 7.834 94.370Q7.967 94.719 8.239 94.936Q8.510 95.153 8.909 95.153Q9.284 95.153 9.559 94.936Q9.834 94.719 9.936 94.360Q9.952 94.297 10.014 94.297L10.120 94.297Q10.155 94.297 10.180 94.325Q10.206 94.352 10.206 94.391L10.206 94.415Q10.073 94.895 9.688 95.163Q9.303 95.430 8.799 95.430Q8.436 95.430 8.102 95.293Q7.768 95.157 7.508 94.907Q7.249 94.657 7.104 94.321Q6.959 93.985 6.959 93.625M10.694 93.598Q10.694 93.118 10.926 92.702Q11.159 92.286 11.569 92.036Q11.979 91.786 12.456 91.786Q13.186 91.786 13.584 92.227Q13.983 92.668 13.983 93.399Q13.983 93.504 13.889 93.528L11.440 93.528L11.440 93.598Q11.440 94.008 11.561 94.364Q11.682 94.719 11.954 94.936Q12.225 95.153 12.655 95.153Q13.018 95.153 13.315 94.924Q13.612 94.696 13.713 94.344Q13.721 94.297 13.807 94.282L13.889 94.282Q13.983 94.309 13.983 94.391Q13.983 94.399 13.975 94.430Q13.913 94.657 13.774 94.840Q13.635 95.024 13.444 95.157Q13.252 95.290 13.034 95.360Q12.815 95.430 12.577 95.430Q12.206 95.430 11.868 95.293Q11.530 95.157 11.262 94.905Q10.995 94.653 10.844 94.313Q10.694 93.973 10.694 93.598M11.448 93.290L13.409 93.290Q13.409 92.985 13.307 92.694Q13.206 92.403 12.989 92.221Q12.772 92.040 12.456 92.040Q12.155 92.040 11.924 92.227Q11.694 92.415 11.571 92.706Q11.448 92.997 11.448 93.290\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"var(--tk-soft-accent)\" stroke=\"none\" d=\"M74.414 83.97h25.607L77.26-52.601H51.652Z\"\u002F>\u003Cpath fill=\"none\" stroke=\"var(--tk-soft-accent)\" d=\"M74.414 83.97 51.652-52.601M100.021 83.97 77.26-52.601\" style=\"stroke-dasharray:3.0,2.0\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"rotate(80 72.531 104.042)scale(1.00001)\">\u003Cpath d=\"M-37.299 95.352L-39.077 95.352L-39.077 95.055Q-38.803 95.055-38.635 95.008Q-38.467 94.961-38.467 94.793L-38.467 92.657Q-38.467 92.442-38.524 92.346Q-38.581 92.250-38.694 92.229Q-38.807 92.207-39.053 92.207L-39.053 91.911L-37.854 91.825L-37.854 94.793Q-37.854 94.961-37.708 95.008Q-37.561 95.055-37.299 95.055L-37.299 95.352M-38.741 90.430Q-38.741 90.239-38.606 90.108Q-38.471 89.977-38.276 89.977Q-38.155 89.977-38.051 90.040Q-37.948 90.102-37.885 90.206Q-37.823 90.309-37.823 90.430Q-37.823 90.625-37.954 90.760Q-38.084 90.895-38.276 90.895Q-38.475 90.895-38.608 90.762Q-38.741 90.629-38.741 90.430M-34.870 95.352L-36.725 95.352L-36.725 95.055Q-36.452 95.055-36.284 95.008Q-36.116 94.961-36.116 94.793L-36.116 92.657Q-36.116 92.442-36.178 92.346Q-36.241 92.250-36.360 92.229Q-36.479 92.207-36.725 92.207L-36.725 91.911L-35.534 91.825L-35.534 92.559Q-35.420 92.344-35.227 92.176Q-35.034 92.008-34.795 91.916Q-34.557 91.825-34.303 91.825Q-33.135 91.825-33.135 92.903L-33.135 94.793Q-33.135 94.961-32.965 95.008Q-32.795 95.055-32.526 95.055L-32.526 95.352L-34.381 95.352L-34.381 95.055Q-34.108 95.055-33.940 95.008Q-33.772 94.961-33.772 94.793L-33.772 92.918Q-33.772 92.536-33.893 92.307Q-34.014 92.079-34.366 92.079Q-34.678 92.079-34.932 92.241Q-35.186 92.403-35.333 92.672Q-35.479 92.942-35.479 93.239L-35.479 94.793Q-35.479 94.961-35.309 95.008Q-35.139 95.055-34.870 95.055L-34.870 95.352M-32.038 95.344L-32.038 94.122Q-32.038 94.094-32.006 94.063Q-31.975 94.032-31.952 94.032L-31.846 94.032Q-31.776 94.032-31.760 94.094Q-31.698 94.415-31.559 94.655Q-31.420 94.895-31.188 95.036Q-30.956 95.176-30.647 95.176Q-30.409 95.176-30.200 95.116Q-29.991 95.055-29.854 94.907Q-29.717 94.758-29.717 94.512Q-29.717 94.258-29.928 94.092Q-30.139 93.926-30.409 93.872L-31.030 93.758Q-31.436 93.680-31.737 93.424Q-32.038 93.168-32.038 92.793Q-32.038 92.426-31.836 92.204Q-31.635 91.981-31.311 91.883Q-30.987 91.786-30.647 91.786Q-30.182 91.786-29.885 91.993L-29.663 91.809Q-29.639 91.786-29.608 91.786L-29.557 91.786Q-29.526 91.786-29.499 91.813Q-29.471 91.840-29.471 91.872L-29.471 92.856Q-29.471 92.887-29.497 92.916Q-29.522 92.946-29.557 92.946L-29.663 92.946Q-29.698 92.946-29.725 92.918Q-29.752 92.891-29.752 92.856Q-29.752 92.457-30.004 92.237Q-30.256 92.016-30.655 92.016Q-31.010 92.016-31.293 92.139Q-31.577 92.262-31.577 92.567Q-31.577 92.786-31.376 92.918Q-31.174 93.051-30.928 93.094L-30.303 93.207Q-29.874 93.297-29.565 93.594Q-29.256 93.891-29.256 94.305Q-29.256 94.875-29.655 95.153Q-30.053 95.430-30.647 95.430Q-31.198 95.430-31.549 95.094L-31.846 95.407Q-31.870 95.430-31.905 95.430L-31.952 95.430Q-31.975 95.430-32.006 95.399Q-32.038 95.368-32.038 95.344M-28.104 94.391L-28.104 92.200L-28.807 92.200L-28.807 91.946Q-28.452 91.946-28.209 91.713Q-27.967 91.481-27.856 91.133Q-27.745 90.786-27.745 90.430L-27.463 90.430L-27.463 91.903L-26.288 91.903L-26.288 92.200L-27.463 92.200L-27.463 94.375Q-27.463 94.696-27.344 94.924Q-27.225 95.153-26.944 95.153Q-26.764 95.153-26.647 95.030Q-26.530 94.907-26.477 94.727Q-26.424 94.547-26.424 94.375L-26.424 93.903L-26.143 93.903L-26.143 94.391Q-26.143 94.645-26.249 94.885Q-26.354 95.125-26.551 95.278Q-26.749 95.430-27.006 95.430Q-27.323 95.430-27.575 95.307Q-27.827 95.184-27.965 94.950Q-28.104 94.715-28.104 94.391M-25.327 94.520Q-25.327 94.036-24.924 93.741Q-24.522 93.446-23.971 93.327Q-23.420 93.207-22.928 93.207L-22.928 92.918Q-22.928 92.692-23.043 92.485Q-23.159 92.278-23.356 92.159Q-23.553 92.040-23.784 92.040Q-24.209 92.040-24.495 92.145Q-24.424 92.172-24.377 92.227Q-24.331 92.282-24.305 92.352Q-24.280 92.422-24.280 92.497Q-24.280 92.602-24.331 92.694Q-24.381 92.786-24.473 92.836Q-24.565 92.887-24.670 92.887Q-24.776 92.887-24.868 92.836Q-24.959 92.786-25.010 92.694Q-25.061 92.602-25.061 92.497Q-25.061 92.079-24.672 91.932Q-24.284 91.786-23.784 91.786Q-23.452 91.786-23.098 91.916Q-22.745 92.047-22.516 92.301Q-22.288 92.555-22.288 92.903L-22.288 94.704Q-22.288 94.836-22.215 94.946Q-22.143 95.055-22.014 95.055Q-21.889 95.055-21.821 94.950Q-21.752 94.844-21.752 94.704L-21.752 94.192L-21.471 94.192L-21.471 94.704Q-21.471 94.907-21.588 95.065Q-21.706 95.223-21.887 95.307Q-22.069 95.391-22.272 95.391Q-22.502 95.391-22.655 95.219Q-22.807 95.047-22.838 94.817Q-22.999 95.098-23.307 95.264Q-23.616 95.430-23.967 95.430Q-24.479 95.430-24.903 95.207Q-25.327 94.985-25.327 94.520M-24.639 94.520Q-24.639 94.805-24.413 94.991Q-24.186 95.176-23.893 95.176Q-23.647 95.176-23.422 95.059Q-23.198 94.942-23.063 94.739Q-22.928 94.536-22.928 94.282L-22.928 93.450Q-23.194 93.450-23.479 93.504Q-23.764 93.559-24.036 93.688Q-24.307 93.817-24.473 94.024Q-24.639 94.231-24.639 94.520M-20.264 95.352L-20.545 95.352L-20.545 90.633Q-20.545 90.418-20.608 90.323Q-20.670 90.227-20.788 90.206Q-20.905 90.184-21.151 90.184L-21.151 89.887L-19.928 89.801L-19.928 92.290Q-19.452 91.825-18.752 91.825Q-18.272 91.825-17.864 92.069Q-17.456 92.313-17.219 92.727Q-16.983 93.141-16.983 93.625Q-16.983 94-17.131 94.329Q-17.280 94.657-17.549 94.909Q-17.819 95.161-18.163 95.295Q-18.506 95.430-18.866 95.430Q-19.186 95.430-19.485 95.282Q-19.784 95.133-19.991 94.872L-20.264 95.352M-19.905 92.680L-19.905 94.520Q-19.752 94.817-19.493 94.997Q-19.233 95.176-18.920 95.176Q-18.495 95.176-18.227 94.957Q-17.959 94.739-17.844 94.393Q-17.729 94.047-17.729 93.625Q-17.729 92.977-17.977 92.528Q-18.225 92.079-18.823 92.079Q-19.159 92.079-19.448 92.237Q-19.737 92.395-19.905 92.680M-14.600 95.352L-16.377 95.352L-16.377 95.055Q-16.104 95.055-15.936 95.008Q-15.768 94.961-15.768 94.793L-15.768 92.657Q-15.768 92.442-15.825 92.346Q-15.881 92.250-15.995 92.229Q-16.108 92.207-16.354 92.207L-16.354 91.911L-15.155 91.825L-15.155 94.793Q-15.155 94.961-15.008 95.008Q-14.862 95.055-14.600 95.055L-14.600 95.352M-16.042 90.430Q-16.042 90.239-15.907 90.108Q-15.772 89.977-15.577 89.977Q-15.456 89.977-15.352 90.040Q-15.249 90.102-15.186 90.206Q-15.124 90.309-15.124 90.430Q-15.124 90.625-15.254 90.760Q-15.385 90.895-15.577 90.895Q-15.776 90.895-15.909 90.762Q-16.042 90.629-16.042 90.430M-12.186 95.352L-14.018 95.352L-14.018 95.055Q-13.745 95.055-13.577 95.008Q-13.409 94.961-13.409 94.793L-13.409 90.633Q-13.409 90.418-13.471 90.323Q-13.534 90.227-13.653 90.206Q-13.772 90.184-14.018 90.184L-14.018 89.887L-12.795 89.801L-12.795 94.793Q-12.795 94.961-12.627 95.008Q-12.459 95.055-12.186 95.055L-12.186 95.352M-9.881 95.352L-11.659 95.352L-11.659 95.055Q-11.385 95.055-11.217 95.008Q-11.049 94.961-11.049 94.793L-11.049 92.657Q-11.049 92.442-11.106 92.346Q-11.163 92.250-11.276 92.229Q-11.389 92.207-11.635 92.207L-11.635 91.911L-10.436 91.825L-10.436 94.793Q-10.436 94.961-10.290 95.008Q-10.143 95.055-9.881 95.055L-9.881 95.352M-11.323 90.430Q-11.323 90.239-11.188 90.108Q-11.053 89.977-10.858 89.977Q-10.737 89.977-10.633 90.040Q-10.530 90.102-10.467 90.206Q-10.405 90.309-10.405 90.430Q-10.405 90.625-10.536 90.760Q-10.667 90.895-10.858 90.895Q-11.057 90.895-11.190 90.762Q-11.323 90.629-11.323 90.430M-8.756 94.391L-8.756 92.200L-9.459 92.200L-9.459 91.946Q-9.104 91.946-8.862 91.713Q-8.620 91.481-8.508 91.133Q-8.397 90.786-8.397 90.430L-8.116 90.430L-8.116 91.903L-6.940 91.903L-6.940 92.200L-8.116 92.200L-8.116 94.375Q-8.116 94.696-7.997 94.924Q-7.877 95.153-7.596 95.153Q-7.417 95.153-7.299 95.030Q-7.182 94.907-7.129 94.727Q-7.077 94.547-7.077 94.375L-7.077 93.903L-6.795 93.903L-6.795 94.391Q-6.795 94.645-6.901 94.885Q-7.006 95.125-7.204 95.278Q-7.401 95.430-7.659 95.430Q-7.975 95.430-8.227 95.307Q-8.479 95.184-8.618 94.950Q-8.756 94.715-8.756 94.391\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"rotate(80 72.531 104.042)scale(1.00001)\">\u003Cpath d=\"M-5.874 96.649Q-5.760 96.727-5.585 96.727Q-5.296 96.727-5.075 96.514Q-4.854 96.301-4.729 96L-4.440 95.352L-5.714 92.465Q-5.796 92.290-5.940 92.245Q-6.085 92.200-6.354 92.200L-6.354 91.903L-4.635 91.903L-4.635 92.200Q-5.057 92.200-5.057 92.383Q-5.057 92.395-5.042 92.465L-4.104 94.590L-3.272 92.680Q-3.233 92.590-3.233 92.512Q-3.233 92.372-3.335 92.286Q-3.436 92.200-3.577 92.200L-3.577 91.903L-2.225 91.903L-2.225 92.200Q-2.479 92.200-2.673 92.325Q-2.866 92.450-2.971 92.680L-4.417 96Q-4.530 96.254-4.696 96.477Q-4.862 96.700-5.091 96.842Q-5.319 96.985-5.585 96.985Q-5.882 96.985-6.122 96.793Q-6.362 96.602-6.362 96.313Q-6.362 96.157-6.257 96.055Q-6.151 95.954-6.003 95.954Q-5.897 95.954-5.817 96Q-5.737 96.047-5.690 96.125Q-5.643 96.204-5.643 96.313Q-5.643 96.434-5.704 96.522Q-5.764 96.610-5.874 96.649\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"rotate(80 72.531 104.042)scale(1.00001)\">\u003Cpath d=\"M1.071 95.344L1.071 94.122Q1.071 94.094 1.103 94.063Q1.134 94.032 1.157 94.032L1.263 94.032Q1.333 94.032 1.349 94.094Q1.411 94.415 1.550 94.655Q1.688 94.895 1.921 95.036Q2.153 95.176 2.462 95.176Q2.700 95.176 2.909 95.116Q3.118 95.055 3.255 94.907Q3.392 94.758 3.392 94.512Q3.392 94.258 3.181 94.092Q2.970 93.926 2.700 93.872L2.079 93.758Q1.673 93.680 1.372 93.424Q1.071 93.168 1.071 92.793Q1.071 92.426 1.272 92.204Q1.474 91.981 1.798 91.883Q2.122 91.786 2.462 91.786Q2.927 91.786 3.224 91.993L3.446 91.809Q3.470 91.786 3.501 91.786L3.552 91.786Q3.583 91.786 3.610 91.813Q3.638 91.840 3.638 91.872L3.638 92.856Q3.638 92.887 3.612 92.916Q3.587 92.946 3.552 92.946L3.446 92.946Q3.411 92.946 3.384 92.918Q3.356 92.891 3.356 92.856Q3.356 92.457 3.104 92.237Q2.853 92.016 2.454 92.016Q2.099 92.016 1.815 92.139Q1.532 92.262 1.532 92.567Q1.532 92.786 1.733 92.918Q1.935 93.051 2.181 93.094L2.806 93.207Q3.235 93.297 3.544 93.594Q3.853 93.891 3.853 94.305Q3.853 94.875 3.454 95.153Q3.056 95.430 2.462 95.430Q1.911 95.430 1.560 95.094L1.263 95.407Q1.239 95.430 1.204 95.430L1.157 95.430Q1.134 95.430 1.103 95.399Q1.071 95.368 1.071 95.344M5.005 94.391L5.005 92.200L4.302 92.200L4.302 91.946Q4.657 91.946 4.899 91.713Q5.142 91.481 5.253 91.133Q5.364 90.786 5.364 90.430L5.645 90.430L5.645 91.903L6.821 91.903L6.821 92.200L5.645 92.200L5.645 94.375Q5.645 94.696 5.765 94.924Q5.884 95.153 6.165 95.153Q6.345 95.153 6.462 95.030Q6.579 94.907 6.632 94.727Q6.685 94.547 6.685 94.375L6.685 93.903L6.966 93.903L6.966 94.391Q6.966 94.645 6.860 94.885Q6.755 95.125 6.558 95.278Q6.360 95.430 6.103 95.430Q5.786 95.430 5.534 95.307Q5.282 95.184 5.144 94.950Q5.005 94.715 5.005 94.391M9.692 95.352L7.712 95.352L7.712 95.055Q7.981 95.055 8.149 95.010Q8.317 94.965 8.317 94.793L8.317 92.657Q8.317 92.442 8.255 92.346Q8.192 92.250 8.075 92.229Q7.958 92.207 7.712 92.207L7.712 91.911L8.880 91.825L8.880 92.610Q8.958 92.399 9.110 92.213Q9.263 92.028 9.462 91.926Q9.661 91.825 9.888 91.825Q10.134 91.825 10.325 91.969Q10.517 92.114 10.517 92.344Q10.517 92.500 10.411 92.610Q10.306 92.719 10.149 92.719Q9.993 92.719 9.884 92.610Q9.774 92.500 9.774 92.344Q9.774 92.184 9.880 92.079Q9.556 92.079 9.341 92.307Q9.126 92.536 9.030 92.875Q8.935 93.215 8.935 93.520L8.935 94.793Q8.935 94.961 9.161 95.008Q9.388 95.055 9.692 95.055L9.692 95.352M12.856 95.352L11.079 95.352L11.079 95.055Q11.352 95.055 11.520 95.008Q11.688 94.961 11.688 94.793L11.688 92.657Q11.688 92.442 11.632 92.346Q11.575 92.250 11.462 92.229Q11.349 92.207 11.102 92.207L11.102 91.911L12.302 91.825L12.302 94.793Q12.302 94.961 12.448 95.008Q12.595 95.055 12.856 95.055L12.856 95.352M11.415 90.430Q11.415 90.239 11.550 90.108Q11.685 89.977 11.880 89.977Q12.001 89.977 12.104 90.040Q12.208 90.102 12.270 90.206Q12.333 90.309 12.333 90.430Q12.333 90.625 12.202 90.760Q12.071 90.895 11.880 90.895Q11.681 90.895 11.548 90.762Q11.415 90.629 11.415 90.430M15.239 96.903L13.384 96.903L13.384 96.610Q13.653 96.610 13.821 96.565Q13.989 96.520 13.989 96.344L13.989 92.520Q13.989 92.313 13.833 92.260Q13.677 92.207 13.384 92.207L13.384 91.911L14.606 91.825L14.606 92.290Q14.837 92.067 15.151 91.946Q15.466 91.825 15.806 91.825Q16.278 91.825 16.683 92.071Q17.087 92.317 17.319 92.733Q17.552 93.149 17.552 93.625Q17.552 94 17.403 94.329Q17.255 94.657 16.985 94.909Q16.716 95.161 16.372 95.295Q16.028 95.430 15.669 95.430Q15.380 95.430 15.108 95.309Q14.837 95.188 14.630 94.977L14.630 96.344Q14.630 96.520 14.798 96.565Q14.966 96.610 15.239 96.610L15.239 96.903M14.630 92.688L14.630 94.528Q14.782 94.817 15.044 94.997Q15.306 95.176 15.614 95.176Q15.899 95.176 16.122 95.038Q16.345 94.899 16.497 94.668Q16.649 94.438 16.727 94.166Q16.806 93.895 16.806 93.625Q16.806 93.293 16.681 92.936Q16.556 92.579 16.308 92.342Q16.060 92.106 15.712 92.106Q15.388 92.106 15.093 92.262Q14.798 92.418 14.630 92.688\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M67.878-26.995a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(113.076 -123.192)\">\u003Cpath d=\"M-38.924 92.618Q-38.924 92.024-38.692 91.493Q-38.459 90.961-38.043 90.561Q-37.627 90.161-37.094 89.940Q-36.561 89.719-35.956 89.719Q-35.518 89.719-35.120 89.901Q-34.721 90.082-34.413 90.415L-33.940 89.750Q-33.909 89.719-33.877 89.719L-33.831 89.719Q-33.803 89.719-33.772 89.750Q-33.741 89.782-33.741 89.809L-33.741 91.946Q-33.741 91.969-33.772 92Q-33.803 92.032-33.831 92.032L-33.948 92.032Q-33.975 92.032-34.006 92Q-34.038 91.969-34.038 91.946Q-34.038 91.680-34.180 91.327Q-34.323 90.973-34.502 90.735Q-34.756 90.403-35.106 90.209Q-35.456 90.016-35.862 90.016Q-36.366 90.016-36.819 90.235Q-37.272 90.454-37.565 90.848Q-38.061 91.516-38.061 92.618Q-38.061 93.149-37.924 93.616Q-37.788 94.082-37.512 94.448Q-37.237 94.813-36.817 95.018Q-36.397 95.223-35.854 95.223Q-35.366 95.223-34.942 94.979Q-34.518 94.735-34.270 94.315Q-34.022 93.895-34.022 93.399Q-34.022 93.364-33.993 93.338Q-33.963 93.313-33.932 93.313L-33.831 93.313Q-33.788 93.313-33.764 93.342Q-33.741 93.372-33.741 93.415Q-33.741 93.852-33.917 94.241Q-34.092 94.629-34.403 94.913Q-34.713 95.196-35.124 95.358Q-35.534 95.520-35.956 95.520Q-36.545 95.520-37.086 95.299Q-37.627 95.079-38.043 94.674Q-38.459 94.270-38.692 93.741Q-38.924 93.211-38.924 92.618M-33.022 93.598Q-33.022 93.118-32.790 92.702Q-32.557 92.286-32.147 92.036Q-31.737 91.786-31.260 91.786Q-30.530 91.786-30.131 92.227Q-29.733 92.668-29.733 93.399Q-29.733 93.504-29.827 93.528L-32.276 93.528L-32.276 93.598Q-32.276 94.008-32.155 94.364Q-32.034 94.719-31.762 94.936Q-31.491 95.153-31.061 95.153Q-30.698 95.153-30.401 94.924Q-30.104 94.696-30.002 94.344Q-29.995 94.297-29.909 94.282L-29.827 94.282Q-29.733 94.309-29.733 94.391Q-29.733 94.399-29.741 94.430Q-29.803 94.657-29.942 94.840Q-30.081 95.024-30.272 95.157Q-30.463 95.290-30.682 95.360Q-30.901 95.430-31.139 95.430Q-31.510 95.430-31.848 95.293Q-32.186 95.157-32.454 94.905Q-32.721 94.653-32.872 94.313Q-33.022 93.973-33.022 93.598M-32.268 93.290L-30.307 93.290Q-30.307 92.985-30.409 92.694Q-30.510 92.403-30.727 92.221Q-30.944 92.040-31.260 92.040Q-31.561 92.040-31.792 92.227Q-32.022 92.415-32.145 92.706Q-32.268 92.997-32.268 93.290M-27.362 96.903L-29.217 96.903L-29.217 96.610Q-28.948 96.610-28.780 96.565Q-28.612 96.520-28.612 96.344L-28.612 92.520Q-28.612 92.313-28.768 92.260Q-28.924 92.207-29.217 92.207L-29.217 91.911L-27.995 91.825L-27.995 92.290Q-27.764 92.067-27.450 91.946Q-27.135 91.825-26.795 91.825Q-26.323 91.825-25.918 92.071Q-25.514 92.317-25.282 92.733Q-25.049 93.149-25.049 93.625Q-25.049 94-25.198 94.329Q-25.346 94.657-25.616 94.909Q-25.885 95.161-26.229 95.295Q-26.573 95.430-26.932 95.430Q-27.221 95.430-27.493 95.309Q-27.764 95.188-27.971 94.977L-27.971 96.344Q-27.971 96.520-27.803 96.565Q-27.635 96.610-27.362 96.610L-27.362 96.903M-27.971 92.688L-27.971 94.528Q-27.819 94.817-27.557 94.997Q-27.295 95.176-26.987 95.176Q-26.702 95.176-26.479 95.038Q-26.256 94.899-26.104 94.668Q-25.952 94.438-25.874 94.166Q-25.795 93.895-25.795 93.625Q-25.795 93.293-25.920 92.936Q-26.045 92.579-26.293 92.342Q-26.542 92.106-26.889 92.106Q-27.213 92.106-27.508 92.262Q-27.803 92.418-27.971 92.688M-22.596 95.352L-24.452 95.352L-24.452 95.055Q-24.178 95.055-24.010 95.008Q-23.842 94.961-23.842 94.793L-23.842 90.633Q-23.842 90.418-23.905 90.323Q-23.967 90.227-24.086 90.206Q-24.206 90.184-24.452 90.184L-24.452 89.887L-23.229 89.801L-23.229 92.504Q-23.104 92.293-22.917 92.143Q-22.729 91.993-22.502 91.909Q-22.276 91.825-22.030 91.825Q-20.862 91.825-20.862 92.903L-20.862 94.793Q-20.862 94.961-20.692 95.008Q-20.522 95.055-20.252 95.055L-20.252 95.352L-22.108 95.352L-22.108 95.055Q-21.834 95.055-21.667 95.008Q-21.499 94.961-21.499 94.793L-21.499 92.918Q-21.499 92.536-21.620 92.307Q-21.741 92.079-22.092 92.079Q-22.405 92.079-22.659 92.241Q-22.913 92.403-23.059 92.672Q-23.206 92.942-23.206 93.239L-23.206 94.793Q-23.206 94.961-23.036 95.008Q-22.866 95.055-22.596 95.055L-22.596 95.352M-19.807 93.598Q-19.807 93.118-19.575 92.702Q-19.342 92.286-18.932 92.036Q-18.522 91.786-18.045 91.786Q-17.315 91.786-16.917 92.227Q-16.518 92.668-16.518 93.399Q-16.518 93.504-16.612 93.528L-19.061 93.528L-19.061 93.598Q-19.061 94.008-18.940 94.364Q-18.819 94.719-18.547 94.936Q-18.276 95.153-17.846 95.153Q-17.483 95.153-17.186 94.924Q-16.889 94.696-16.788 94.344Q-16.780 94.297-16.694 94.282L-16.612 94.282Q-16.518 94.309-16.518 94.391Q-16.518 94.399-16.526 94.430Q-16.588 94.657-16.727 94.840Q-16.866 95.024-17.057 95.157Q-17.249 95.290-17.467 95.360Q-17.686 95.430-17.924 95.430Q-18.295 95.430-18.633 95.293Q-18.971 95.157-19.239 94.905Q-19.506 94.653-19.657 94.313Q-19.807 93.973-19.807 93.598M-19.053 93.290L-17.092 93.290Q-17.092 92.985-17.194 92.694Q-17.295 92.403-17.512 92.221Q-17.729 92.040-18.045 92.040Q-18.346 92.040-18.577 92.227Q-18.807 92.415-18.930 92.706Q-19.053 92.997-19.053 93.290M-14.170 95.352L-15.948 95.352L-15.948 95.055Q-15.674 95.055-15.506 95.008Q-15.338 94.961-15.338 94.793L-15.338 92.657Q-15.338 92.442-15.395 92.346Q-15.452 92.250-15.565 92.229Q-15.678 92.207-15.924 92.207L-15.924 91.911L-14.725 91.825L-14.725 94.793Q-14.725 94.961-14.579 95.008Q-14.432 95.055-14.170 95.055L-14.170 95.352M-15.612 90.430Q-15.612 90.239-15.477 90.108Q-15.342 89.977-15.147 89.977Q-15.026 89.977-14.922 90.040Q-14.819 90.102-14.756 90.206Q-14.694 90.309-14.694 90.430Q-14.694 90.625-14.825 90.760Q-14.956 90.895-15.147 90.895Q-15.346 90.895-15.479 90.762Q-15.612 90.629-15.612 90.430M-11.854 95.430Q-12.334 95.430-12.743 95.186Q-13.151 94.942-13.389 94.528Q-13.627 94.114-13.627 93.625Q-13.627 93.133-13.370 92.717Q-13.112 92.301-12.680 92.063Q-12.249 91.825-11.756 91.825Q-11.135 91.825-10.686 92.262L-10.686 90.633Q-10.686 90.418-10.749 90.323Q-10.811 90.227-10.928 90.206Q-11.045 90.184-11.292 90.184L-11.292 89.887L-10.069 89.801L-10.069 94.610Q-10.069 94.821-10.006 94.916Q-9.944 95.012-9.827 95.034Q-9.709 95.055-9.459 95.055L-9.459 95.352L-10.709 95.430L-10.709 94.946Q-11.174 95.430-11.854 95.430M-11.788 95.176Q-11.448 95.176-11.155 94.985Q-10.862 94.793-10.709 94.497L-10.709 92.665Q-10.858 92.391-11.120 92.235Q-11.381 92.079-11.694 92.079Q-12.319 92.079-12.602 92.526Q-12.885 92.973-12.885 93.633Q-12.885 94.278-12.633 94.727Q-12.381 95.176-11.788 95.176M-8.909 95.344L-8.909 94.122Q-8.909 94.094-8.877 94.063Q-8.846 94.032-8.823 94.032L-8.717 94.032Q-8.647 94.032-8.631 94.094Q-8.569 94.415-8.430 94.655Q-8.292 94.895-8.059 95.036Q-7.827 95.176-7.518 95.176Q-7.280 95.176-7.071 95.116Q-6.862 95.055-6.725 94.907Q-6.588 94.758-6.588 94.512Q-6.588 94.258-6.799 94.092Q-7.010 93.926-7.280 93.872L-7.901 93.758Q-8.307 93.680-8.608 93.424Q-8.909 93.168-8.909 92.793Q-8.909 92.426-8.708 92.204Q-8.506 91.981-8.182 91.883Q-7.858 91.786-7.518 91.786Q-7.053 91.786-6.756 91.993L-6.534 91.809Q-6.510 91.786-6.479 91.786L-6.428 91.786Q-6.397 91.786-6.370 91.813Q-6.342 91.840-6.342 91.872L-6.342 92.856Q-6.342 92.887-6.368 92.916Q-6.393 92.946-6.428 92.946L-6.534 92.946Q-6.569 92.946-6.596 92.918Q-6.624 92.891-6.624 92.856Q-6.624 92.457-6.876 92.237Q-7.127 92.016-7.526 92.016Q-7.881 92.016-8.165 92.139Q-8.448 92.262-8.448 92.567Q-8.448 92.786-8.247 92.918Q-8.045 93.051-7.799 93.094L-7.174 93.207Q-6.745 93.297-6.436 93.594Q-6.127 93.891-6.127 94.305Q-6.127 94.875-6.526 95.153Q-6.924 95.430-7.518 95.430Q-8.069 95.430-8.420 95.094L-8.717 95.407Q-8.741 95.430-8.776 95.430L-8.823 95.430Q-8.846 95.430-8.877 95.399Q-8.909 95.368-8.909 95.344\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M84.95 32.756a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(130.148 -63.486)\">\u003Cpath d=\"M-36.686 95.352L-39.045 95.352L-39.045 95.055Q-38.721 95.055-38.479 95.008Q-38.237 94.961-38.237 94.793L-38.237 90.450Q-38.237 90.278-38.479 90.231Q-38.721 90.184-39.045 90.184L-39.045 89.887L-36.452 89.887Q-36.120 89.887-35.733 89.973Q-35.346 90.059-34.999 90.233Q-34.651 90.407-34.432 90.688Q-34.213 90.969-34.213 91.336Q-34.213 91.661-34.415 91.926Q-34.616 92.192-34.922 92.368Q-35.229 92.543-35.557 92.633Q-35.190 92.754-34.930 93.024Q-34.670 93.293-34.620 93.657L-34.526 94.352Q-34.456 94.801-34.358 95.032Q-34.260 95.262-33.963 95.262Q-33.717 95.262-33.584 95.045Q-33.452 94.829-33.452 94.567Q-33.432 94.493-33.350 94.473L-33.268 94.473Q-33.174 94.497-33.174 94.590Q-33.174 94.821-33.272 95.036Q-33.370 95.250-33.547 95.385Q-33.725 95.520-33.956 95.520Q-34.553 95.520-34.971 95.233Q-35.389 94.946-35.389 94.375L-35.389 93.680Q-35.389 93.399-35.542 93.184Q-35.694 92.969-35.944 92.856Q-36.194 92.743-36.467 92.743L-37.495 92.743L-37.495 94.793Q-37.495 94.957-37.251 95.006Q-37.006 95.055-36.686 95.055L-36.686 95.352M-37.495 90.450L-37.495 92.489L-36.565 92.489Q-36.245 92.489-35.977 92.436Q-35.709 92.383-35.510 92.256Q-35.311 92.129-35.194 91.897Q-35.077 91.665-35.077 91.336Q-35.077 90.684-35.473 90.434Q-35.870 90.184-36.565 90.184L-37.092 90.184Q-37.311 90.184-37.403 90.227Q-37.495 90.270-37.495 90.450M-30.440 95.352L-32.799 95.352L-32.799 95.055Q-32.475 95.055-32.233 95.008Q-31.991 94.961-31.991 94.793L-31.991 90.450Q-31.991 90.278-32.233 90.231Q-32.475 90.184-32.799 90.184L-32.799 89.887L-30.206 89.887Q-29.874 89.887-29.487 89.973Q-29.100 90.059-28.752 90.233Q-28.405 90.407-28.186 90.688Q-27.967 90.969-27.967 91.336Q-27.967 91.661-28.168 91.926Q-28.370 92.192-28.676 92.368Q-28.983 92.543-29.311 92.633Q-28.944 92.754-28.684 93.024Q-28.424 93.293-28.374 93.657L-28.280 94.352Q-28.209 94.801-28.112 95.032Q-28.014 95.262-27.717 95.262Q-27.471 95.262-27.338 95.045Q-27.206 94.829-27.206 94.567Q-27.186 94.493-27.104 94.473L-27.022 94.473Q-26.928 94.497-26.928 94.590Q-26.928 94.821-27.026 95.036Q-27.124 95.250-27.301 95.385Q-27.479 95.520-27.709 95.520Q-28.307 95.520-28.725 95.233Q-29.143 94.946-29.143 94.375L-29.143 93.680Q-29.143 93.399-29.295 93.184Q-29.448 92.969-29.698 92.856Q-29.948 92.743-30.221 92.743L-31.249 92.743L-31.249 94.793Q-31.249 94.957-31.004 95.006Q-30.760 95.055-30.440 95.055L-30.440 95.352M-31.249 90.450L-31.249 92.489L-30.319 92.489Q-29.999 92.489-29.731 92.436Q-29.463 92.383-29.264 92.256Q-29.065 92.129-28.948 91.897Q-28.831 91.665-28.831 91.336Q-28.831 90.684-29.227 90.434Q-29.624 90.184-30.319 90.184L-30.846 90.184Q-31.065 90.184-31.157 90.227Q-31.249 90.270-31.249 90.450\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(130.148 -63.486)\">\u003Cpath d=\"M-19.339 95.352L-23.722 95.352L-23.722 95.055Q-23.402 95.055-23.158 95.008Q-22.913 94.961-22.913 94.793L-22.913 90.450Q-22.913 90.278-23.158 90.231Q-23.402 90.184-23.722 90.184L-23.722 89.887L-21.136 89.887L-21.136 90.184Q-22.148 90.184-22.148 90.450L-22.148 94.793Q-22.148 94.965-22.056 95.010Q-21.964 95.055-21.745 95.055L-21.058 95.055Q-20.585 95.055-20.277 94.930Q-19.968 94.805-19.790 94.575Q-19.613 94.344-19.521 94.018Q-19.429 93.692-19.386 93.239L-19.105 93.239L-19.339 95.352M-18.097 96.649Q-17.984 96.727-17.808 96.727Q-17.519 96.727-17.298 96.514Q-17.078 96.301-16.953 96L-16.663 95.352L-17.937 92.465Q-18.019 92.290-18.163 92.245Q-18.308 92.200-18.578 92.200L-18.578 91.903L-16.859 91.903L-16.859 92.200Q-17.281 92.200-17.281 92.383Q-17.281 92.395-17.265 92.465L-16.328 94.590L-15.495 92.680Q-15.456 92.590-15.456 92.512Q-15.456 92.372-15.558 92.286Q-15.660 92.200-15.800 92.200L-15.800 91.903L-14.449 91.903L-14.449 92.200Q-14.703 92.200-14.896 92.325Q-15.089 92.450-15.195 92.680L-16.640 96Q-16.753 96.254-16.919 96.477Q-17.085 96.700-17.314 96.842Q-17.542 96.985-17.808 96.985Q-18.105 96.985-18.345 96.793Q-18.585 96.602-18.585 96.313Q-18.585 96.157-18.480 96.055Q-18.374 95.954-18.226 95.954Q-18.120 95.954-18.040 96Q-17.960 96.047-17.913 96.125Q-17.867 96.204-17.867 96.313Q-17.867 96.434-17.927 96.522Q-17.988 96.610-18.097 96.649M-12.027 95.352L-14.007 95.352L-14.007 95.055Q-13.738 95.055-13.570 95.010Q-13.402 94.965-13.402 94.793L-13.402 92.657Q-13.402 92.442-13.464 92.346Q-13.527 92.250-13.644 92.229Q-13.761 92.207-14.007 92.207L-14.007 91.911L-12.839 91.825L-12.839 92.610Q-12.761 92.399-12.609 92.213Q-12.456 92.028-12.257 91.926Q-12.058 91.825-11.831 91.825Q-11.585 91.825-11.394 91.969Q-11.203 92.114-11.203 92.344Q-11.203 92.500-11.308 92.610Q-11.413 92.719-11.570 92.719Q-11.726 92.719-11.835 92.610Q-11.945 92.500-11.945 92.344Q-11.945 92.184-11.839 92.079Q-12.163 92.079-12.378 92.307Q-12.593 92.536-12.689 92.875Q-12.785 93.215-12.785 93.520L-12.785 94.793Q-12.785 94.961-12.558 95.008Q-12.331 95.055-12.027 95.055L-12.027 95.352M-10.624 94.520Q-10.624 94.036-10.222 93.741Q-9.820 93.446-9.269 93.327Q-8.718 93.207-8.226 93.207L-8.226 92.918Q-8.226 92.692-8.341 92.485Q-8.456 92.278-8.654 92.159Q-8.851 92.040-9.081 92.040Q-9.507 92.040-9.792 92.145Q-9.722 92.172-9.675 92.227Q-9.628 92.282-9.603 92.352Q-9.578 92.422-9.578 92.497Q-9.578 92.602-9.628 92.694Q-9.679 92.786-9.771 92.836Q-9.863 92.887-9.968 92.887Q-10.074 92.887-10.165 92.836Q-10.257 92.786-10.308 92.694Q-10.359 92.602-10.359 92.497Q-10.359 92.079-9.970 91.932Q-9.581 91.786-9.081 91.786Q-8.749 91.786-8.396 91.916Q-8.042 92.047-7.814 92.301Q-7.585 92.555-7.585 92.903L-7.585 94.704Q-7.585 94.836-7.513 94.946Q-7.441 95.055-7.312 95.055Q-7.187 95.055-7.119 94.950Q-7.050 94.844-7.050 94.704L-7.050 94.192L-6.769 94.192L-6.769 94.704Q-6.769 94.907-6.886 95.065Q-7.003 95.223-7.185 95.307Q-7.367 95.391-7.570 95.391Q-7.800 95.391-7.953 95.219Q-8.105 95.047-8.136 94.817Q-8.296 95.098-8.605 95.264Q-8.913 95.430-9.265 95.430Q-9.777 95.430-10.201 95.207Q-10.624 94.985-10.624 94.520M-9.937 94.520Q-9.937 94.805-9.710 94.991Q-9.484 95.176-9.191 95.176Q-8.945 95.176-8.720 95.059Q-8.495 94.942-8.361 94.739Q-8.226 94.536-8.226 94.282L-8.226 93.450Q-8.492 93.450-8.777 93.504Q-9.062 93.559-9.333 93.688Q-9.605 93.817-9.771 94.024Q-9.937 94.231-9.937 94.520M-6.476 93.598Q-6.476 93.118-6.244 92.702Q-6.011 92.286-5.601 92.036Q-5.191 91.786-4.714 91.786Q-3.984 91.786-3.585 92.227Q-3.187 92.668-3.187 93.399Q-3.187 93.504-3.281 93.528L-5.730 93.528L-5.730 93.598Q-5.730 94.008-5.609 94.364Q-5.488 94.719-5.216 94.936Q-4.945 95.153-4.515 95.153Q-4.152 95.153-3.855 94.924Q-3.558 94.696-3.456 94.344Q-3.449 94.297-3.363 94.282L-3.281 94.282Q-3.187 94.309-3.187 94.391Q-3.187 94.399-3.195 94.430Q-3.257 94.657-3.396 94.840Q-3.535 95.024-3.726 95.157Q-3.917 95.290-4.136 95.360Q-4.355 95.430-4.593 95.430Q-4.964 95.430-5.302 95.293Q-5.640 95.157-5.908 94.905Q-6.175 94.653-6.326 94.313Q-6.476 93.973-6.476 93.598M-5.722 93.290L-3.761 93.290Q-3.761 92.985-3.863 92.694Q-3.964 92.403-4.181 92.221Q-4.398 92.040-4.714 92.040Q-5.015 92.040-5.245 92.227Q-5.476 92.415-5.599 92.706Q-5.722 92.997-5.722 93.290\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M36.58-44.067a2 2 0 1 0-4 0 2 2 0 0 0 4 0m-2 0\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(80.355 -136.685)\">\u003Cpath d=\"M-37.100 95.352L-39.022 95.352L-39.022 95.055Q-38.213 95.055-38.213 94.575L-38.213 90.450Q-38.213 90.278-38.456 90.231Q-38.698 90.184-39.022 90.184L-39.022 89.887L-37.526 89.887Q-37.417 89.887-37.358 90L-35.510 94.543L-33.670 90Q-33.608 89.887-33.502 89.887L-31.999 89.887L-31.999 90.184Q-32.319 90.184-32.561 90.231Q-32.803 90.278-32.803 90.450L-32.803 94.793Q-32.803 94.961-32.561 95.008Q-32.319 95.055-31.999 95.055L-31.999 95.352L-34.299 95.352L-34.299 95.055Q-33.495 95.055-33.495 94.793L-33.495 90.200L-35.542 95.239Q-35.577 95.352-35.709 95.352Q-35.850 95.352-35.885 95.239L-37.909 90.262L-37.909 94.575Q-37.909 95.055-37.100 95.055L-37.100 95.352M-29.522 95.352L-31.299 95.352L-31.299 95.055Q-31.026 95.055-30.858 95.008Q-30.690 94.961-30.690 94.793L-30.690 92.657Q-30.690 92.442-30.747 92.346Q-30.803 92.250-30.917 92.229Q-31.030 92.207-31.276 92.207L-31.276 91.911L-30.077 91.825L-30.077 94.793Q-30.077 94.961-29.930 95.008Q-29.784 95.055-29.522 95.055L-29.522 95.352M-30.963 90.430Q-30.963 90.239-30.829 90.108Q-30.694 89.977-30.499 89.977Q-30.377 89.977-30.274 90.040Q-30.170 90.102-30.108 90.206Q-30.045 90.309-30.045 90.430Q-30.045 90.625-30.176 90.760Q-30.307 90.895-30.499 90.895Q-30.698 90.895-30.831 90.762Q-30.963 90.629-30.963 90.430M-27.014 95.352L-28.995 95.352L-28.995 95.055Q-28.725 95.055-28.557 95.010Q-28.389 94.965-28.389 94.793L-28.389 92.657Q-28.389 92.442-28.452 92.346Q-28.514 92.250-28.631 92.229Q-28.749 92.207-28.995 92.207L-28.995 91.911L-27.827 91.825L-27.827 92.610Q-27.749 92.399-27.596 92.213Q-27.444 92.028-27.245 91.926Q-27.045 91.825-26.819 91.825Q-26.573 91.825-26.381 91.969Q-26.190 92.114-26.190 92.344Q-26.190 92.500-26.295 92.610Q-26.401 92.719-26.557 92.719Q-26.713 92.719-26.823 92.610Q-26.932 92.500-26.932 92.344Q-26.932 92.184-26.827 92.079Q-27.151 92.079-27.366 92.307Q-27.581 92.536-27.676 92.875Q-27.772 93.215-27.772 93.520L-27.772 94.793Q-27.772 94.961-27.545 95.008Q-27.319 95.055-27.014 95.055L-27.014 95.352M-25.612 94.520Q-25.612 94.036-25.209 93.741Q-24.807 93.446-24.256 93.327Q-23.706 93.207-23.213 93.207L-23.213 92.918Q-23.213 92.692-23.329 92.485Q-23.444 92.278-23.641 92.159Q-23.838 92.040-24.069 92.040Q-24.495 92.040-24.780 92.145Q-24.709 92.172-24.663 92.227Q-24.616 92.282-24.590 92.352Q-24.565 92.422-24.565 92.497Q-24.565 92.602-24.616 92.694Q-24.667 92.786-24.758 92.836Q-24.850 92.887-24.956 92.887Q-25.061 92.887-25.153 92.836Q-25.245 92.786-25.295 92.694Q-25.346 92.602-25.346 92.497Q-25.346 92.079-24.958 91.932Q-24.569 91.786-24.069 91.786Q-23.737 91.786-23.383 91.916Q-23.030 92.047-22.801 92.301Q-22.573 92.555-22.573 92.903L-22.573 94.704Q-22.573 94.836-22.501 94.946Q-22.428 95.055-22.299 95.055Q-22.174 95.055-22.106 94.950Q-22.038 94.844-22.038 94.704L-22.038 94.192L-21.756 94.192L-21.756 94.704Q-21.756 94.907-21.874 95.065Q-21.991 95.223-22.172 95.307Q-22.354 95.391-22.557 95.391Q-22.788 95.391-22.940 95.219Q-23.092 95.047-23.124 94.817Q-23.284 95.098-23.592 95.264Q-23.901 95.430-24.252 95.430Q-24.764 95.430-25.188 95.207Q-25.612 94.985-25.612 94.520M-24.924 94.520Q-24.924 94.805-24.698 94.991Q-24.471 95.176-24.178 95.176Q-23.932 95.176-23.708 95.059Q-23.483 94.942-23.348 94.739Q-23.213 94.536-23.213 94.282L-23.213 93.450Q-23.479 93.450-23.764 93.504Q-24.049 93.559-24.321 93.688Q-24.592 93.817-24.758 94.024Q-24.924 94.231-24.924 94.520\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The instability strip as a narrow, nearly vertical band crossing the H-R diagram; classical Cepheids occupy its luminous upper end, RR Lyrae stars its intersection with the horizontal branch, and Mira variables lie beyond on the asymptotic giant branch.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:447.531px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 335.648 140.128\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-32.078-3.784h261.365\"\u002F>\u003Cpath fill=\"none\" d=\"M227.407-6.184c.38 1.44 1.227 2.12 2.08 2.4-.853.28-1.7.96-2.08 2.4\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg transform=\"translate(265.298 -71.977)\">\u003Cpath d=\"M-29.957 71.745L-31.812 71.745L-31.812 71.452Q-31.543 71.452-31.375 71.407Q-31.207 71.362-31.207 71.186L-31.207 67.362Q-31.207 67.155-31.363 67.102Q-31.519 67.049-31.812 67.049L-31.812 66.753L-30.590 66.667L-30.590 67.132Q-30.359 66.909-30.045 66.788Q-29.730 66.667-29.391 66.667Q-28.918 66.667-28.514 66.913Q-28.109 67.159-27.877 67.575Q-27.644 67.991-27.644 68.467Q-27.644 68.842-27.793 69.171Q-27.941 69.499-28.211 69.751Q-28.480 70.003-28.824 70.137Q-29.168 70.272-29.527 70.272Q-29.816 70.272-30.088 70.151Q-30.359 70.030-30.566 69.819L-30.566 71.186Q-30.566 71.362-30.398 71.407Q-30.230 71.452-29.957 71.452L-29.957 71.745M-30.566 67.530L-30.566 69.370Q-30.414 69.659-30.152 69.839Q-29.891 70.018-29.582 70.018Q-29.297 70.018-29.074 69.880Q-28.851 69.741-28.699 69.510Q-28.547 69.280-28.469 69.008Q-28.391 68.737-28.391 68.467Q-28.391 68.135-28.516 67.778Q-28.641 67.421-28.889 67.184Q-29.137 66.948-29.484 66.948Q-29.808 66.948-30.103 67.104Q-30.398 67.260-30.566 67.530M-25.191 70.194L-27.047 70.194L-27.047 69.897Q-26.773 69.897-26.605 69.850Q-26.437 69.803-26.437 69.635L-26.437 65.475Q-26.437 65.260-26.500 65.165Q-26.562 65.069-26.682 65.048Q-26.801 65.026-27.047 65.026L-27.047 64.729L-25.824 64.643L-25.824 67.346Q-25.699 67.135-25.512 66.985Q-25.324 66.835-25.098 66.751Q-24.871 66.667-24.625 66.667Q-23.457 66.667-23.457 67.745L-23.457 69.635Q-23.457 69.803-23.287 69.850Q-23.117 69.897-22.848 69.897L-22.848 70.194L-24.703 70.194L-24.703 69.897Q-24.430 69.897-24.262 69.850Q-24.094 69.803-24.094 69.635L-24.094 67.760Q-24.094 67.378-24.215 67.149Q-24.336 66.921-24.687 66.921Q-25 66.921-25.254 67.083Q-25.508 67.245-25.654 67.514Q-25.801 67.784-25.801 68.081L-25.801 69.635Q-25.801 69.803-25.631 69.850Q-25.461 69.897-25.191 69.897L-25.191 70.194M-22.305 69.362Q-22.305 68.878-21.902 68.583Q-21.500 68.288-20.949 68.169Q-20.398 68.049-19.906 68.049L-19.906 67.760Q-19.906 67.534-20.021 67.327Q-20.137 67.120-20.334 67.001Q-20.531 66.882-20.762 66.882Q-21.187 66.882-21.473 66.987Q-21.402 67.014-21.355 67.069Q-21.308 67.124-21.283 67.194Q-21.258 67.264-21.258 67.339Q-21.258 67.444-21.308 67.536Q-21.359 67.628-21.451 67.678Q-21.543 67.729-21.648 67.729Q-21.754 67.729-21.846 67.678Q-21.937 67.628-21.988 67.536Q-22.039 67.444-22.039 67.339Q-22.039 66.921-21.650 66.774Q-21.262 66.628-20.762 66.628Q-20.430 66.628-20.076 66.758Q-19.723 66.889-19.494 67.143Q-19.266 67.397-19.266 67.745L-19.266 69.546Q-19.266 69.678-19.193 69.788Q-19.121 69.897-18.992 69.897Q-18.867 69.897-18.799 69.792Q-18.730 69.686-18.730 69.546L-18.730 69.034L-18.449 69.034L-18.449 69.546Q-18.449 69.749-18.566 69.907Q-18.683 70.065-18.865 70.149Q-19.047 70.233-19.250 70.233Q-19.480 70.233-19.633 70.061Q-19.785 69.889-19.816 69.659Q-19.976 69.940-20.285 70.106Q-20.594 70.272-20.945 70.272Q-21.457 70.272-21.881 70.049Q-22.305 69.827-22.305 69.362M-21.617 69.362Q-21.617 69.647-21.391 69.833Q-21.164 70.018-20.871 70.018Q-20.625 70.018-20.400 69.901Q-20.176 69.784-20.041 69.581Q-19.906 69.378-19.906 69.124L-19.906 68.292Q-20.172 68.292-20.457 68.346Q-20.742 68.401-21.014 68.530Q-21.285 68.659-21.451 68.866Q-21.617 69.073-21.617 69.362M-18.113 70.186L-18.113 68.964Q-18.113 68.936-18.082 68.905Q-18.051 68.874-18.027 68.874L-17.922 68.874Q-17.851 68.874-17.836 68.936Q-17.773 69.257-17.635 69.497Q-17.496 69.737-17.264 69.878Q-17.031 70.018-16.723 70.018Q-16.484 70.018-16.275 69.958Q-16.066 69.897-15.930 69.749Q-15.793 69.600-15.793 69.354Q-15.793 69.100-16.004 68.934Q-16.215 68.768-16.484 68.714L-17.105 68.600Q-17.512 68.522-17.812 68.266Q-18.113 68.010-18.113 67.635Q-18.113 67.268-17.912 67.046Q-17.711 66.823-17.387 66.725Q-17.062 66.628-16.723 66.628Q-16.258 66.628-15.961 66.835L-15.738 66.651Q-15.715 66.628-15.683 66.628L-15.633 66.628Q-15.601 66.628-15.574 66.655Q-15.547 66.682-15.547 66.714L-15.547 67.698Q-15.547 67.729-15.572 67.758Q-15.598 67.788-15.633 67.788L-15.738 67.788Q-15.773 67.788-15.801 67.760Q-15.828 67.733-15.828 67.698Q-15.828 67.299-16.080 67.079Q-16.332 66.858-16.730 66.858Q-17.086 66.858-17.369 66.981Q-17.652 67.104-17.652 67.409Q-17.652 67.628-17.451 67.760Q-17.250 67.893-17.004 67.936L-16.379 68.049Q-15.949 68.139-15.641 68.436Q-15.332 68.733-15.332 69.147Q-15.332 69.717-15.730 69.995Q-16.129 70.272-16.723 70.272Q-17.273 70.272-17.625 69.936L-17.922 70.249Q-17.945 70.272-17.980 70.272L-18.027 70.272Q-18.051 70.272-18.082 70.241Q-18.113 70.210-18.113 70.186M-14.805 68.440Q-14.805 67.960-14.572 67.544Q-14.340 67.128-13.930 66.878Q-13.519 66.628-13.043 66.628Q-12.312 66.628-11.914 67.069Q-11.516 67.510-11.516 68.241Q-11.516 68.346-11.609 68.370L-14.058 68.370L-14.058 68.440Q-14.058 68.850-13.937 69.206Q-13.816 69.561-13.545 69.778Q-13.273 69.995-12.844 69.995Q-12.480 69.995-12.183 69.766Q-11.887 69.538-11.785 69.186Q-11.777 69.139-11.691 69.124L-11.609 69.124Q-11.516 69.151-11.516 69.233Q-11.516 69.241-11.523 69.272Q-11.586 69.499-11.724 69.682Q-11.863 69.866-12.055 69.999Q-12.246 70.132-12.465 70.202Q-12.683 70.272-12.922 70.272Q-13.293 70.272-13.631 70.135Q-13.969 69.999-14.236 69.747Q-14.504 69.495-14.654 69.155Q-14.805 68.815-14.805 68.440M-14.051 68.132L-12.090 68.132Q-12.090 67.827-12.191 67.536Q-12.293 67.245-12.510 67.063Q-12.726 66.882-13.043 66.882Q-13.344 66.882-13.574 67.069Q-13.805 67.257-13.928 67.548Q-14.051 67.839-14.051 68.132\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-32.078 61.658V-71.67\"\u002F>\u003Cpath fill=\"none\" d=\"M-34.478-69.79c1.44-.38 2.12-1.227 2.4-2.08.28.853.96 1.7 2.4 2.08\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-21.72 -117.501)\">\u003Cpath d=\"M-29.926 70.194L-31.758 70.194L-31.758 69.897Q-31.484 69.897-31.316 69.850Q-31.148 69.803-31.148 69.635L-31.148 65.475Q-31.148 65.260-31.211 65.165Q-31.273 65.069-31.392 65.048Q-31.512 65.026-31.758 65.026L-31.758 64.729L-30.535 64.643L-30.535 69.635Q-30.535 69.803-30.367 69.850Q-30.199 69.897-29.926 69.897L-29.926 70.194M-27.621 70.194L-29.398 70.194L-29.398 69.897Q-29.125 69.897-28.957 69.850Q-28.789 69.803-28.789 69.635L-28.789 67.499Q-28.789 67.284-28.846 67.188Q-28.902 67.092-29.016 67.071Q-29.129 67.049-29.375 67.049L-29.375 66.753L-28.176 66.667L-28.176 69.635Q-28.176 69.803-28.029 69.850Q-27.883 69.897-27.621 69.897L-27.621 70.194M-29.062 65.272Q-29.062 65.081-28.928 64.950Q-28.793 64.819-28.598 64.819Q-28.476 64.819-28.373 64.882Q-28.269 64.944-28.207 65.048Q-28.144 65.151-28.144 65.272Q-28.144 65.467-28.275 65.602Q-28.406 65.737-28.598 65.737Q-28.797 65.737-28.930 65.604Q-29.062 65.471-29.062 65.272M-27.121 70.803Q-27.121 70.522-26.910 70.311Q-26.699 70.100-26.414 70.010Q-26.570 69.885-26.648 69.696Q-26.726 69.507-26.726 69.307Q-26.726 68.952-26.496 68.659Q-26.863 68.319-26.863 67.850Q-26.863 67.499-26.660 67.229Q-26.457 66.960-26.137 66.813Q-25.816 66.667-25.473 66.667Q-24.953 66.667-24.582 66.948Q-24.219 66.577-23.672 66.577Q-23.492 66.577-23.365 66.704Q-23.238 66.831-23.238 67.010Q-23.238 67.116-23.316 67.194Q-23.394 67.272-23.504 67.272Q-23.613 67.272-23.689 67.196Q-23.766 67.120-23.766 67.010Q-23.766 66.909-23.726 66.858Q-23.719 66.850-23.715 66.844Q-23.711 66.839-23.711 66.835Q-24.086 66.835-24.406 67.089Q-24.086 67.428-24.086 67.850Q-24.086 68.120-24.203 68.337Q-24.320 68.553-24.525 68.712Q-24.730 68.870-24.973 68.952Q-25.215 69.034-25.473 69.034Q-25.691 69.034-25.904 68.975Q-26.117 68.917-26.312 68.796Q-26.406 68.936-26.406 69.116Q-26.406 69.323-26.269 69.475Q-26.133 69.628-25.926 69.628L-25.230 69.628Q-24.742 69.628-24.330 69.712Q-23.918 69.796-23.639 70.053Q-23.359 70.311-23.359 70.803Q-23.359 71.167-23.680 71.399Q-24 71.632-24.441 71.733Q-24.883 71.835-25.238 71.835Q-25.594 71.835-26.037 71.733Q-26.480 71.632-26.801 71.399Q-27.121 71.167-27.121 70.803M-26.617 70.803Q-26.617 70.999-26.473 71.147Q-26.328 71.296-26.115 71.385Q-25.902 71.475-25.662 71.522Q-25.422 71.569-25.238 71.569Q-24.996 71.569-24.666 71.491Q-24.336 71.413-24.099 71.239Q-23.863 71.065-23.863 70.803Q-23.863 70.397-24.273 70.288Q-24.683 70.178-25.246 70.178L-25.926 70.178Q-26.195 70.178-26.406 70.356Q-26.617 70.534-26.617 70.803M-25.473 68.768Q-24.750 68.768-24.750 67.850Q-24.750 66.928-25.473 66.928Q-26.199 66.928-26.199 67.850Q-26.199 68.768-25.473 68.768M-20.945 70.194L-22.801 70.194L-22.801 69.897Q-22.527 69.897-22.359 69.850Q-22.191 69.803-22.191 69.635L-22.191 65.475Q-22.191 65.260-22.254 65.165Q-22.316 65.069-22.435 65.048Q-22.555 65.026-22.801 65.026L-22.801 64.729L-21.578 64.643L-21.578 67.346Q-21.453 67.135-21.266 66.985Q-21.078 66.835-20.851 66.751Q-20.625 66.667-20.379 66.667Q-19.211 66.667-19.211 67.745L-19.211 69.635Q-19.211 69.803-19.041 69.850Q-18.871 69.897-18.601 69.897L-18.601 70.194L-20.457 70.194L-20.457 69.897Q-20.183 69.897-20.016 69.850Q-19.848 69.803-19.848 69.635L-19.848 67.760Q-19.848 67.378-19.969 67.149Q-20.090 66.921-20.441 66.921Q-20.754 66.921-21.008 67.083Q-21.262 67.245-21.408 67.514Q-21.555 67.784-21.555 68.081L-21.555 69.635Q-21.555 69.803-21.385 69.850Q-21.215 69.897-20.945 69.897\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-21.72 -117.501)\">\u003Cpath d=\"M-17.757 69.233L-17.757 67.042L-18.460 67.042L-18.460 66.788Q-18.104 66.788-17.862 66.555Q-17.620 66.323-17.509 65.975Q-17.397 65.628-17.397 65.272L-17.116 65.272L-17.116 66.745L-15.940 66.745L-15.940 67.042L-17.116 67.042L-17.116 69.217Q-17.116 69.538-16.997 69.766Q-16.878 69.995-16.597 69.995Q-16.417 69.995-16.300 69.872Q-16.183 69.749-16.130 69.569Q-16.077 69.389-16.077 69.217L-16.077 68.745L-15.796 68.745L-15.796 69.233Q-15.796 69.487-15.901 69.727Q-16.007 69.967-16.204 70.120Q-16.401 70.272-16.659 70.272Q-16.975 70.272-17.227 70.149Q-17.479 70.026-17.618 69.792Q-17.757 69.557-17.757 69.233\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-33.526 -34.989)\">\u003Cpath d=\"M-30.039 70.163L-31.262 67.307Q-31.344 67.132-31.488 67.087Q-31.633 67.042-31.902 67.042L-31.902 66.745L-30.191 66.745L-30.191 67.042Q-30.613 67.042-30.613 67.225Q-30.613 67.260-30.598 67.307L-29.652 69.499L-28.812 67.522Q-28.773 67.444-28.773 67.354Q-28.773 67.214-28.879 67.128Q-28.984 67.042-29.125 67.042L-29.125 66.745L-27.773 66.745L-27.773 67.042Q-28.297 67.042-28.512 67.522L-29.637 70.163Q-29.699 70.272-29.805 70.272L-29.871 70.272Q-29.984 70.272-30.039 70.163\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.526 -34.989)\">\u003Cpath d=\"M-27.590 68.440Q-27.590 67.960-27.357 67.544Q-27.125 67.128-26.715 66.878Q-26.305 66.628-25.828 66.628Q-25.098 66.628-24.699 67.069Q-24.301 67.510-24.301 68.241Q-24.301 68.346-24.394 68.370L-26.844 68.370L-26.844 68.440Q-26.844 68.850-26.723 69.206Q-26.601 69.561-26.330 69.778Q-26.058 69.995-25.629 69.995Q-25.265 69.995-24.969 69.766Q-24.672 69.538-24.570 69.186Q-24.562 69.139-24.476 69.124L-24.394 69.124Q-24.301 69.151-24.301 69.233Q-24.301 69.241-24.308 69.272Q-24.371 69.499-24.510 69.682Q-24.648 69.866-24.840 69.999Q-25.031 70.132-25.250 70.202Q-25.469 70.272-25.707 70.272Q-26.078 70.272-26.416 70.135Q-26.754 69.999-27.021 69.747Q-27.289 69.495-27.439 69.155Q-27.590 68.815-27.590 68.440M-26.836 68.132L-24.875 68.132Q-24.875 67.827-24.976 67.536Q-25.078 67.245-25.295 67.063Q-25.512 66.882-25.828 66.882Q-26.129 66.882-26.359 67.069Q-26.590 67.257-26.713 67.548Q-26.836 67.839-26.836 68.132M-21.898 70.194L-23.730 70.194L-23.730 69.897Q-23.457 69.897-23.289 69.850Q-23.121 69.803-23.121 69.635L-23.121 65.475Q-23.121 65.260-23.183 65.165Q-23.246 65.069-23.365 65.048Q-23.484 65.026-23.730 65.026L-23.730 64.729L-22.508 64.643L-22.508 69.635Q-22.508 69.803-22.340 69.850Q-22.172 69.897-21.898 69.897L-21.898 70.194M-21.453 68.499Q-21.453 67.995-21.197 67.563Q-20.941 67.132-20.506 66.880Q-20.070 66.628-19.570 66.628Q-19.183 66.628-18.842 66.772Q-18.500 66.917-18.238 67.178Q-17.976 67.440-17.834 67.776Q-17.691 68.112-17.691 68.499Q-17.691 68.991-17.955 69.401Q-18.219 69.811-18.648 70.042Q-19.078 70.272-19.570 70.272Q-20.062 70.272-20.496 70.040Q-20.930 69.807-21.191 69.399Q-21.453 68.991-21.453 68.499M-19.570 69.995Q-19.113 69.995-18.861 69.772Q-18.609 69.549-18.521 69.198Q-18.433 68.846-18.433 68.401Q-18.433 67.971-18.527 67.633Q-18.621 67.296-18.875 67.089Q-19.129 66.882-19.570 66.882Q-20.219 66.882-20.463 67.298Q-20.707 67.714-20.707 68.401Q-20.707 68.846-20.619 69.198Q-20.531 69.549-20.279 69.772Q-20.027 69.995-19.570 69.995\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.526 -34.989)\">\u003Cpath d=\"M-16.922 68.467Q-16.922 67.971-16.672 67.546Q-16.422 67.120-16.002 66.874Q-15.582 66.628-15.082 66.628Q-14.543 66.628-14.152 66.753Q-13.762 66.878-13.762 67.292Q-13.762 67.397-13.812 67.489Q-13.863 67.581-13.955 67.632Q-14.047 67.682-14.156 67.682Q-14.262 67.682-14.353 67.632Q-14.445 67.581-14.496 67.489Q-14.547 67.397-14.547 67.292Q-14.547 67.069-14.379 66.964Q-14.601 66.905-15.074 66.905Q-15.371 66.905-15.586 67.044Q-15.801 67.182-15.932 67.413Q-16.062 67.643-16.121 67.913Q-16.180 68.182-16.180 68.467Q-16.180 68.862-16.047 69.212Q-15.914 69.561-15.642 69.778Q-15.371 69.995-14.973 69.995Q-14.598 69.995-14.322 69.778Q-14.047 69.561-13.945 69.202Q-13.930 69.139-13.867 69.139L-13.762 69.139Q-13.726 69.139-13.701 69.167Q-13.676 69.194-13.676 69.233L-13.676 69.257Q-13.808 69.737-14.193 70.005Q-14.578 70.272-15.082 70.272Q-15.445 70.272-15.779 70.135Q-16.113 69.999-16.373 69.749Q-16.633 69.499-16.777 69.163Q-16.922 68.827-16.922 68.467M-11.328 70.194L-13.105 70.194L-13.105 69.897Q-12.832 69.897-12.664 69.850Q-12.496 69.803-12.496 69.635L-12.496 67.499Q-12.496 67.284-12.553 67.188Q-12.609 67.092-12.723 67.071Q-12.836 67.049-13.082 67.049L-13.082 66.753L-11.883 66.667L-11.883 69.635Q-11.883 69.803-11.736 69.850Q-11.590 69.897-11.328 69.897L-11.328 70.194M-12.769 65.272Q-12.769 65.081-12.635 64.950Q-12.500 64.819-12.305 64.819Q-12.183 64.819-12.080 64.882Q-11.976 64.944-11.914 65.048Q-11.851 65.151-11.851 65.272Q-11.851 65.467-11.982 65.602Q-12.113 65.737-12.305 65.737Q-12.504 65.737-12.637 65.604Q-12.769 65.471-12.769 65.272M-10.203 69.233L-10.203 67.042L-10.906 67.042L-10.906 66.788Q-10.551 66.788-10.308 66.555Q-10.066 66.323-9.955 65.975Q-9.844 65.628-9.844 65.272L-9.562 65.272L-9.562 66.745L-8.387 66.745L-8.387 67.042L-9.562 67.042L-9.562 69.217Q-9.562 69.538-9.443 69.766Q-9.324 69.995-9.043 69.995Q-8.863 69.995-8.746 69.872Q-8.629 69.749-8.576 69.569Q-8.523 69.389-8.523 69.217L-8.523 68.745L-8.242 68.745L-8.242 69.233Q-8.242 69.487-8.348 69.727Q-8.453 69.967-8.650 70.120Q-8.848 70.272-9.105 70.272Q-9.422 70.272-9.674 70.149Q-9.926 70.026-10.064 69.792Q-10.203 69.557-10.203 69.233\" fill=\"currentColor\" stroke=\"currentColor\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-33.526 -34.989)\">\u003Cpath d=\"M-7.338 71.491Q-7.224 71.569-7.049 71.569Q-6.760 71.569-6.539 71.356Q-6.318 71.143-6.193 70.842L-5.904 70.194L-7.178 67.307Q-7.260 67.132-7.404 67.087Q-7.549 67.042-7.818 67.042L-7.818 66.745L-6.099 66.745L-6.099 67.042Q-6.521 67.042-6.521 67.225Q-6.521 67.237-6.506 67.307L-5.568 69.432L-4.736 67.522Q-4.697 67.432-4.697 67.354Q-4.697 67.214-4.799 67.128Q-4.900 67.042-5.041 67.042L-5.041 66.745L-3.689 66.745L-3.689 67.042Q-3.943 67.042-4.137 67.167Q-4.330 67.292-4.435 67.522L-5.881 70.842Q-5.994 71.096-6.160 71.319Q-6.326 71.542-6.555 71.684Q-6.783 71.827-7.049 71.827Q-7.346 71.827-7.586 71.635Q-7.826 71.444-7.826 71.155Q-7.826 70.999-7.721 70.897Q-7.615 70.796-7.467 70.796Q-7.361 70.796-7.281 70.842Q-7.201 70.889-7.154 70.967Q-7.107 71.046-7.107 71.155Q-7.107 71.276-7.168 71.364Q-7.228 71.452-7.338 71.491\" 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=\"M-20.697-26.545C-9.316-60.69-.78-60.69 10.6-57.844c42.68 11.381 79.668 34.144 99.585 32.72 17.071-1.421 28.452-34.142 42.679-32.72 42.679 11.381 59.75 31.299 71.132 31.299\" style=\"stroke-width:1.2\"\u002F>\u003Cpath fill=\"none\" d=\"M-20.697 16.134C7.756 41.74 30.518 41.74 53.28 21.824c22.762-17.072 39.834-17.072 56.906-5.69 25.607 25.607 48.37 25.607 71.131 5.69 19.917-14.226 34.144-14.226 42.68-8.536\" style=\"stroke-dasharray:3.0,2.0;stroke-width:1.2\"\u002F>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">Light and radial-velocity curves of a Cepheid over one period; the brightness rises steeply and falls slowly, and the velocity curve, tracking the surface motion, is offset from the light curve by about a quarter period.\u003C\u002Ffigcaption>","\u003Csvg style=\"width:100%;max-width:436.912px;height:auto\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" viewBox=\"-75 -75 327.684 169.129\">\u003Cg stroke=\"currentColor\" style=\"stroke-miterlimit:10;stroke-width:.4\">\u003Cpath fill=\"none\" d=\"M-50.84 83.97h255.675\"\u002F>\u003Cpath fill=\"none\" d=\"M202.955 81.57c.38 1.44 1.227 2.12 2.08 2.4-.853.28-1.7.96-2.08 2.4\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(259.608 2)\">\u003Cpath d=\"M-48.688 83.971L-50.520 83.971L-50.520 83.674Q-50.246 83.674-50.078 83.627Q-49.910 83.580-49.910 83.412L-49.910 79.252Q-49.910 79.037-49.973 78.942Q-50.035 78.846-50.154 78.825Q-50.274 78.803-50.520 78.803L-50.520 78.506L-49.297 78.420L-49.297 83.412Q-49.297 83.580-49.129 83.627Q-48.961 83.674-48.688 83.674L-48.688 83.971M-48.242 82.276Q-48.242 81.772-47.986 81.340Q-47.731 80.909-47.295 80.657Q-46.860 80.405-46.360 80.405Q-45.973 80.405-45.631 80.549Q-45.289 80.694-45.028 80.955Q-44.766 81.217-44.623 81.553Q-44.481 81.889-44.481 82.276Q-44.481 82.768-44.744 83.178Q-45.008 83.588-45.438 83.819Q-45.867 84.049-46.360 84.049Q-46.852 84.049-47.285 83.817Q-47.719 83.584-47.981 83.176Q-48.242 82.768-48.242 82.276M-46.360 83.772Q-45.903 83.772-45.651 83.549Q-45.399 83.326-45.311 82.975Q-45.223 82.623-45.223 82.178Q-45.223 81.748-45.317 81.410Q-45.410 81.073-45.664 80.866Q-45.918 80.659-46.360 80.659Q-47.008 80.659-47.252 81.075Q-47.496 81.491-47.496 82.178Q-47.496 82.623-47.408 82.975Q-47.320 83.326-47.069 83.549Q-46.817 83.772-46.360 83.772M-43.996 84.580Q-43.996 84.299-43.785 84.088Q-43.574 83.877-43.289 83.787Q-43.445 83.662-43.524 83.473Q-43.602 83.284-43.602 83.084Q-43.602 82.729-43.371 82.436Q-43.738 82.096-43.738 81.627Q-43.738 81.276-43.535 81.006Q-43.332 80.737-43.012 80.590Q-42.692 80.444-42.348 80.444Q-41.828 80.444-41.457 80.725Q-41.094 80.354-40.547 80.354Q-40.367 80.354-40.240 80.481Q-40.113 80.608-40.113 80.787Q-40.113 80.893-40.192 80.971Q-40.270 81.049-40.379 81.049Q-40.488 81.049-40.565 80.973Q-40.641 80.897-40.641 80.787Q-40.641 80.686-40.602 80.635Q-40.594 80.627-40.590 80.621Q-40.586 80.616-40.586 80.612Q-40.961 80.612-41.281 80.866Q-40.961 81.205-40.961 81.627Q-40.961 81.897-41.078 82.114Q-41.195 82.330-41.401 82.489Q-41.606 82.647-41.848 82.729Q-42.090 82.811-42.348 82.811Q-42.567 82.811-42.779 82.752Q-42.992 82.694-43.188 82.573Q-43.281 82.713-43.281 82.893Q-43.281 83.100-43.145 83.252Q-43.008 83.405-42.801 83.405L-42.106 83.405Q-41.617 83.405-41.205 83.489Q-40.793 83.573-40.514 83.830Q-40.235 84.088-40.235 84.580Q-40.235 84.944-40.555 85.176Q-40.875 85.409-41.317 85.510Q-41.758 85.612-42.113 85.612Q-42.469 85.612-42.912 85.510Q-43.356 85.409-43.676 85.176Q-43.996 84.944-43.996 84.580M-43.492 84.580Q-43.492 84.776-43.348 84.924Q-43.203 85.073-42.990 85.162Q-42.778 85.252-42.537 85.299Q-42.297 85.346-42.113 85.346Q-41.871 85.346-41.541 85.268Q-41.211 85.190-40.975 85.016Q-40.738 84.842-40.738 84.580Q-40.738 84.174-41.149 84.065Q-41.559 83.955-42.121 83.955L-42.801 83.955Q-43.070 83.955-43.281 84.133Q-43.492 84.311-43.492 84.580M-42.348 82.545Q-41.625 82.545-41.625 81.627Q-41.625 80.705-42.348 80.705Q-43.074 80.705-43.074 81.627Q-43.074 82.545-42.348 82.545\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(259.608 2)\">\u003Cpath d=\"M-35.024 85.522L-36.879 85.522L-36.879 85.229Q-36.610 85.229-36.442 85.184Q-36.274 85.139-36.274 84.963L-36.274 81.139Q-36.274 80.932-36.430 80.879Q-36.586 80.826-36.879 80.826L-36.879 80.530L-35.657 80.444L-35.657 80.909Q-35.426 80.686-35.112 80.565Q-34.797 80.444-34.458 80.444Q-33.985 80.444-33.581 80.690Q-33.176 80.936-32.944 81.352Q-32.711 81.768-32.711 82.244Q-32.711 82.619-32.860 82.948Q-33.008 83.276-33.278 83.528Q-33.547 83.780-33.891 83.914Q-34.235 84.049-34.594 84.049Q-34.883 84.049-35.155 83.928Q-35.426 83.807-35.633 83.596L-35.633 84.963Q-35.633 85.139-35.465 85.184Q-35.297 85.229-35.024 85.229L-35.024 85.522M-35.633 81.307L-35.633 83.147Q-35.481 83.436-35.219 83.616Q-34.958 83.795-34.649 83.795Q-34.364 83.795-34.141 83.657Q-33.918 83.518-33.766 83.287Q-33.614 83.057-33.536 82.785Q-33.458 82.514-33.458 82.244Q-33.458 81.912-33.583 81.555Q-33.708 81.198-33.956 80.961Q-34.204 80.725-34.551 80.725Q-34.875 80.725-35.170 80.881Q-35.465 81.037-35.633 81.307\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(259.608 2)\">\u003Cpath d=\"M-31.949 82.217Q-31.949 81.737-31.716 81.321Q-31.484 80.905-31.074 80.655Q-30.664 80.405-30.187 80.405Q-29.457 80.405-29.058 80.846Q-28.660 81.287-28.660 82.018Q-28.660 82.123-28.753 82.147L-31.203 82.147L-31.203 82.217Q-31.203 82.627-31.082 82.983Q-30.960 83.338-30.689 83.555Q-30.417 83.772-29.988 83.772Q-29.624 83.772-29.328 83.543Q-29.031 83.315-28.929 82.963Q-28.921 82.916-28.835 82.901L-28.753 82.901Q-28.660 82.928-28.660 83.010Q-28.660 83.018-28.667 83.049Q-28.730 83.276-28.869 83.459Q-29.007 83.643-29.199 83.776Q-29.390 83.909-29.609 83.979Q-29.828 84.049-30.066 84.049Q-30.437 84.049-30.775 83.912Q-31.113 83.776-31.380 83.524Q-31.648 83.272-31.798 82.932Q-31.949 82.592-31.949 82.217M-31.195 81.909L-29.234 81.909Q-29.234 81.604-29.335 81.313Q-29.437 81.022-29.654 80.840Q-29.871 80.659-30.187 80.659Q-30.488 80.659-30.718 80.846Q-30.949 81.034-31.072 81.325Q-31.195 81.616-31.195 81.909M-26.164 83.971L-28.144 83.971L-28.144 83.674Q-27.874 83.674-27.707 83.629Q-27.539 83.584-27.539 83.412L-27.539 81.276Q-27.539 81.061-27.601 80.965Q-27.664 80.869-27.781 80.848Q-27.898 80.826-28.144 80.826L-28.144 80.530L-26.976 80.444L-26.976 81.229Q-26.898 81.018-26.746 80.832Q-26.593 80.647-26.394 80.545Q-26.195 80.444-25.968 80.444Q-25.722 80.444-25.531 80.588Q-25.339 80.733-25.339 80.963Q-25.339 81.119-25.445 81.229Q-25.550 81.338-25.707 81.338Q-25.863 81.338-25.972 81.229Q-26.082 81.119-26.082 80.963Q-26.082 80.803-25.976 80.698Q-26.300 80.698-26.515 80.926Q-26.730 81.155-26.826 81.494Q-26.921 81.834-26.921 82.139L-26.921 83.412Q-26.921 83.580-26.695 83.627Q-26.468 83.674-26.164 83.674L-26.164 83.971M-22.999 83.971L-24.777 83.971L-24.777 83.674Q-24.503 83.674-24.335 83.627Q-24.167 83.580-24.167 83.412L-24.167 81.276Q-24.167 81.061-24.224 80.965Q-24.281 80.869-24.394 80.848Q-24.507 80.826-24.753 80.826L-24.753 80.530L-23.554 80.444L-23.554 83.412Q-23.554 83.580-23.408 83.627Q-23.261 83.674-22.999 83.674L-22.999 83.971M-24.441 79.049Q-24.441 78.858-24.306 78.727Q-24.171 78.596-23.976 78.596Q-23.855 78.596-23.751 78.659Q-23.648 78.721-23.585 78.825Q-23.523 78.928-23.523 79.049Q-23.523 79.244-23.654 79.379Q-23.785 79.514-23.976 79.514Q-24.175 79.514-24.308 79.381Q-24.441 79.248-24.441 79.049M-22.499 82.276Q-22.499 81.772-22.244 81.340Q-21.988 80.909-21.552 80.657Q-21.117 80.405-20.617 80.405Q-20.230 80.405-19.888 80.549Q-19.546 80.694-19.285 80.955Q-19.023 81.217-18.880 81.553Q-18.738 81.889-18.738 82.276Q-18.738 82.768-19.001 83.178Q-19.265 83.588-19.695 83.819Q-20.124 84.049-20.617 84.049Q-21.109 84.049-21.542 83.817Q-21.976 83.584-22.238 83.176Q-22.499 82.768-22.499 82.276M-20.617 83.772Q-20.160 83.772-19.908 83.549Q-19.656 83.326-19.568 82.975Q-19.480 82.623-19.480 82.178Q-19.480 81.748-19.574 81.410Q-19.667 81.073-19.921 80.866Q-20.175 80.659-20.617 80.659Q-21.265 80.659-21.509 81.075Q-21.753 81.491-21.753 82.178Q-21.753 82.623-21.666 82.975Q-21.578 83.326-21.326 83.549Q-21.074 83.772-20.617 83.772\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(259.608 2)\">\u003Cpath d=\"M-16.194 84.049Q-16.675 84.049-17.083 83.805Q-17.491 83.561-17.729 83.147Q-17.968 82.733-17.968 82.244Q-17.968 81.752-17.710 81.336Q-17.452 80.920-17.020 80.682Q-16.589 80.444-16.097 80.444Q-15.476 80.444-15.026 80.881L-15.026 79.252Q-15.026 79.037-15.089 78.942Q-15.151 78.846-15.269 78.825Q-15.386 78.803-15.632 78.803L-15.632 78.506L-14.409 78.420L-14.409 83.229Q-14.409 83.440-14.347 83.535Q-14.284 83.631-14.167 83.653Q-14.050 83.674-13.800 83.674L-13.800 83.971L-15.050 84.049L-15.050 83.565Q-15.515 84.049-16.194 84.049M-16.128 83.795Q-15.788 83.795-15.495 83.604Q-15.202 83.412-15.050 83.116L-15.050 81.284Q-15.198 81.010-15.460 80.854Q-15.722 80.698-16.034 80.698Q-16.659 80.698-16.942 81.145Q-17.226 81.592-17.226 82.252Q-17.226 82.897-16.974 83.346Q-16.722 83.795-16.128 83.795\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" d=\"M-50.84 83.97V-57.892\"\u002F>\u003Cpath fill=\"none\" d=\"M-53.24-56.013c1.44-.38 2.12-1.227 2.4-2.08.28.853.96 1.7 2.4 2.08\" style=\"stroke-linecap:round;stroke-linejoin:round\"\u002F>\u003Cg fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\">\u003Cg fill=\"var(--tk-line)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(-14.764 -147.352)\">\u003Cpath d=\"M-49.688 83.971L-49.969 83.971L-49.969 79.252Q-49.969 79.037-50.031 78.942Q-50.094 78.846-50.211 78.825Q-50.328 78.803-50.574 78.803L-50.574 78.506L-49.352 78.420L-49.352 80.909Q-48.875 80.444-48.176 80.444Q-47.695 80.444-47.287 80.688Q-46.879 80.932-46.643 81.346Q-46.406 81.760-46.406 82.244Q-46.406 82.619-46.555 82.948Q-46.703 83.276-46.973 83.528Q-47.242 83.780-47.586 83.914Q-47.930 84.049-48.289 84.049Q-48.610 84.049-48.908 83.901Q-49.207 83.752-49.414 83.491L-49.688 83.971M-49.328 81.299L-49.328 83.139Q-49.176 83.436-48.916 83.616Q-48.656 83.795-48.344 83.795Q-47.918 83.795-47.651 83.576Q-47.383 83.358-47.268 83.012Q-47.153 82.666-47.153 82.244Q-47.153 81.596-47.401 81.147Q-47.649 80.698-48.246 80.698Q-48.582 80.698-48.871 80.856Q-49.160 81.014-49.328 81.299M-43.875 83.971L-45.856 83.971L-45.856 83.674Q-45.586 83.674-45.418 83.629Q-45.250 83.584-45.250 83.412L-45.250 81.276Q-45.250 81.061-45.313 80.965Q-45.375 80.869-45.492 80.848Q-45.610 80.826-45.856 80.826L-45.856 80.530L-44.688 80.444L-44.688 81.229Q-44.610 81.018-44.457 80.832Q-44.305 80.647-44.106 80.545Q-43.906 80.444-43.680 80.444Q-43.434 80.444-43.242 80.588Q-43.051 80.733-43.051 80.963Q-43.051 81.119-43.156 81.229Q-43.262 81.338-43.418 81.338Q-43.574 81.338-43.684 81.229Q-43.793 81.119-43.793 80.963Q-43.793 80.803-43.688 80.698Q-44.012 80.698-44.227 80.926Q-44.442 81.155-44.537 81.494Q-44.633 81.834-44.633 82.139L-44.633 83.412Q-44.633 83.580-44.406 83.627Q-44.180 83.674-43.875 83.674L-43.875 83.971M-40.711 83.971L-42.488 83.971L-42.488 83.674Q-42.215 83.674-42.047 83.627Q-41.879 83.580-41.879 83.412L-41.879 81.276Q-41.879 81.061-41.936 80.965Q-41.992 80.869-42.106 80.848Q-42.219 80.826-42.465 80.826L-42.465 80.530L-41.266 80.444L-41.266 83.412Q-41.266 83.580-41.119 83.627Q-40.973 83.674-40.711 83.674L-40.711 83.971M-42.153 79.049Q-42.153 78.858-42.018 78.727Q-41.883 78.596-41.688 78.596Q-41.567 78.596-41.463 78.659Q-41.360 78.721-41.297 78.825Q-41.235 78.928-41.235 79.049Q-41.235 79.244-41.365 79.379Q-41.496 79.514-41.688 79.514Q-41.887 79.514-42.020 79.381Q-42.153 79.248-42.153 79.049M-40.211 84.580Q-40.211 84.299-40 84.088Q-39.789 83.877-39.504 83.787Q-39.660 83.662-39.738 83.473Q-39.817 83.284-39.817 83.084Q-39.817 82.729-39.586 82.436Q-39.953 82.096-39.953 81.627Q-39.953 81.276-39.750 81.006Q-39.547 80.737-39.227 80.590Q-38.906 80.444-38.563 80.444Q-38.043 80.444-37.672 80.725Q-37.309 80.354-36.762 80.354Q-36.582 80.354-36.455 80.481Q-36.328 80.608-36.328 80.787Q-36.328 80.893-36.406 80.971Q-36.485 81.049-36.594 81.049Q-36.703 81.049-36.779 80.973Q-36.856 80.897-36.856 80.787Q-36.856 80.686-36.817 80.635Q-36.809 80.627-36.805 80.621Q-36.801 80.616-36.801 80.612Q-37.176 80.612-37.496 80.866Q-37.176 81.205-37.176 81.627Q-37.176 81.897-37.293 82.114Q-37.410 82.330-37.615 82.489Q-37.820 82.647-38.063 82.729Q-38.305 82.811-38.563 82.811Q-38.781 82.811-38.994 82.752Q-39.207 82.694-39.403 82.573Q-39.496 82.713-39.496 82.893Q-39.496 83.100-39.360 83.252Q-39.223 83.405-39.016 83.405L-38.320 83.405Q-37.832 83.405-37.420 83.489Q-37.008 83.573-36.729 83.830Q-36.449 84.088-36.449 84.580Q-36.449 84.944-36.770 85.176Q-37.090 85.409-37.531 85.510Q-37.973 85.612-38.328 85.612Q-38.684 85.612-39.127 85.510Q-39.570 85.409-39.891 85.176Q-40.211 84.944-40.211 84.580M-39.707 84.580Q-39.707 84.776-39.563 84.924Q-39.418 85.073-39.205 85.162Q-38.992 85.252-38.752 85.299Q-38.512 85.346-38.328 85.346Q-38.086 85.346-37.756 85.268Q-37.426 85.190-37.190 85.016Q-36.953 84.842-36.953 84.580Q-36.953 84.174-37.363 84.065Q-37.774 83.955-38.336 83.955L-39.016 83.955Q-39.285 83.955-39.496 84.133Q-39.707 84.311-39.707 84.580M-38.563 82.545Q-37.840 82.545-37.840 81.627Q-37.840 80.705-38.563 80.705Q-39.289 80.705-39.289 81.627Q-39.289 82.545-38.563 82.545M-34.035 83.971L-35.891 83.971L-35.891 83.674Q-35.617 83.674-35.449 83.627Q-35.281 83.580-35.281 83.412L-35.281 79.252Q-35.281 79.037-35.344 78.942Q-35.406 78.846-35.526 78.825Q-35.645 78.803-35.891 78.803L-35.891 78.506L-34.668 78.420L-34.668 81.123Q-34.543 80.912-34.356 80.762Q-34.168 80.612-33.942 80.528Q-33.715 80.444-33.469 80.444Q-32.301 80.444-32.301 81.522L-32.301 83.412Q-32.301 83.580-32.131 83.627Q-31.961 83.674-31.692 83.674L-31.692 83.971L-33.547 83.971L-33.547 83.674Q-33.274 83.674-33.106 83.627Q-32.938 83.580-32.938 83.412L-32.938 81.537Q-32.938 81.155-33.059 80.926Q-33.180 80.698-33.531 80.698Q-33.844 80.698-34.098 80.860Q-34.352 81.022-34.498 81.291Q-34.645 81.561-34.645 81.858L-34.645 83.412Q-34.645 83.580-34.475 83.627Q-34.305 83.674-34.035 83.674\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(-14.764 -147.352)\">\u003Cpath d=\"M-30.844 83.010L-30.844 80.819L-31.547 80.819L-31.547 80.565Q-31.191 80.565-30.949 80.332Q-30.707 80.100-30.596 79.752Q-30.484 79.405-30.484 79.049L-30.203 79.049L-30.203 80.522L-29.027 80.522L-29.027 80.819L-30.203 80.819L-30.203 82.994Q-30.203 83.315-30.084 83.543Q-29.965 83.772-29.684 83.772Q-29.504 83.772-29.387 83.649Q-29.270 83.526-29.217 83.346Q-29.164 83.166-29.164 82.994L-29.164 82.522L-28.883 82.522L-28.883 83.010Q-28.883 83.264-28.988 83.504Q-29.094 83.744-29.291 83.897Q-29.488 84.049-29.746 84.049Q-30.062 84.049-30.314 83.926Q-30.566 83.803-30.705 83.569Q-30.844 83.334-30.844 83.010M-28.164 82.217Q-28.164 81.737-27.932 81.321Q-27.699 80.905-27.289 80.655Q-26.879 80.405-26.402 80.405Q-25.672 80.405-25.273 80.846Q-24.875 81.287-24.875 82.018Q-24.875 82.123-24.969 82.147L-27.418 82.147L-27.418 82.217Q-27.418 82.627-27.297 82.983Q-27.176 83.338-26.904 83.555Q-26.633 83.772-26.203 83.772Q-25.840 83.772-25.543 83.543Q-25.246 83.315-25.145 82.963Q-25.137 82.916-25.051 82.901L-24.969 82.901Q-24.875 82.928-24.875 83.010Q-24.875 83.018-24.883 83.049Q-24.945 83.276-25.084 83.459Q-25.223 83.643-25.414 83.776Q-25.605 83.909-25.824 83.979Q-26.043 84.049-26.281 84.049Q-26.652 84.049-26.990 83.912Q-27.328 83.776-27.596 83.524Q-27.863 83.272-28.014 82.932Q-28.164 82.592-28.164 82.217M-27.410 81.909L-25.449 81.909Q-25.449 81.604-25.551 81.313Q-25.652 81.022-25.869 80.840Q-26.086 80.659-26.402 80.659Q-26.703 80.659-26.934 80.846Q-27.164 81.034-27.287 81.325Q-27.410 81.616-27.410 81.909M-22.379 83.971L-24.359 83.971L-24.359 83.674Q-24.090 83.674-23.922 83.629Q-23.754 83.584-23.754 83.412L-23.754 81.276Q-23.754 81.061-23.816 80.965Q-23.879 80.869-23.996 80.848Q-24.113 80.826-24.359 80.826L-24.359 80.530L-23.191 80.444L-23.191 81.229Q-23.113 81.018-22.961 80.832Q-22.809 80.647-22.609 80.545Q-22.410 80.444-22.184 80.444Q-21.937 80.444-21.746 80.588Q-21.555 80.733-21.555 80.963Q-21.555 81.119-21.660 81.229Q-21.766 81.338-21.922 81.338Q-22.078 81.338-22.187 81.229Q-22.297 81.119-22.297 80.963Q-22.297 80.803-22.191 80.698Q-22.516 80.698-22.730 80.926Q-22.945 81.155-23.041 81.494Q-23.137 81.834-23.137 82.139L-23.137 83.412Q-23.137 83.580-22.910 83.627Q-22.684 83.674-22.379 83.674\" fill=\"var(--tk-line)\" stroke=\"var(--tk-line)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath fill=\"none\" stroke=\"var(--tk-accent)\" d=\"M-30.923 64.054 182.473-46.912\" style=\"stroke-width:1.2\"\u002F>\u003Cg fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\">\u003Cg fill=\"var(--tk-accent)\" stroke=\"none\" font-family=\"cmr8\" font-size=\"8\">\u003Cg transform=\"translate(108.125 -101.828)\">\u003Cpath d=\"M-50.559 83.963L-50.559 82.741Q-50.559 82.713-50.528 82.682Q-50.496 82.651-50.473 82.651L-50.367 82.651Q-50.297 82.651-50.281 82.713Q-50.219 83.034-50.080 83.274Q-49.942 83.514-49.709 83.655Q-49.477 83.795-49.168 83.795Q-48.930 83.795-48.721 83.735Q-48.512 83.674-48.375 83.526Q-48.238 83.377-48.238 83.131Q-48.238 82.877-48.449 82.711Q-48.660 82.545-48.930 82.491L-49.551 82.377Q-49.957 82.299-50.258 82.043Q-50.559 81.787-50.559 81.412Q-50.559 81.045-50.358 80.823Q-50.156 80.600-49.832 80.502Q-49.508 80.405-49.168 80.405Q-48.703 80.405-48.406 80.612L-48.184 80.428Q-48.160 80.405-48.129 80.405L-48.078 80.405Q-48.047 80.405-48.020 80.432Q-47.992 80.459-47.992 80.491L-47.992 81.475Q-47.992 81.506-48.018 81.535Q-48.043 81.565-48.078 81.565L-48.184 81.565Q-48.219 81.565-48.246 81.537Q-48.274 81.510-48.274 81.475Q-48.274 81.076-48.526 80.856Q-48.778 80.635-49.176 80.635Q-49.531 80.635-49.815 80.758Q-50.098 80.881-50.098 81.186Q-50.098 81.405-49.897 81.537Q-49.695 81.670-49.449 81.713L-48.824 81.826Q-48.395 81.916-48.086 82.213Q-47.778 82.510-47.778 82.924Q-47.778 83.494-48.176 83.772Q-48.574 84.049-49.168 84.049Q-49.719 84.049-50.070 83.713L-50.367 84.026Q-50.391 84.049-50.426 84.049L-50.473 84.049Q-50.496 84.049-50.528 84.018Q-50.559 83.987-50.559 83.963M-45.336 83.971L-47.168 83.971L-47.168 83.674Q-46.895 83.674-46.727 83.627Q-46.559 83.580-46.559 83.412L-46.559 79.252Q-46.559 79.037-46.621 78.942Q-46.684 78.846-46.803 78.825Q-46.922 78.803-47.168 78.803L-47.168 78.506L-45.945 78.420L-45.945 83.412Q-45.945 83.580-45.778 83.627Q-45.610 83.674-45.336 83.674L-45.336 83.971M-44.891 82.276Q-44.891 81.772-44.635 81.340Q-44.379 80.909-43.944 80.657Q-43.508 80.405-43.008 80.405Q-42.621 80.405-42.279 80.549Q-41.938 80.694-41.676 80.955Q-41.414 81.217-41.272 81.553Q-41.129 81.889-41.129 82.276Q-41.129 82.768-41.393 83.178Q-41.656 83.588-42.086 83.819Q-42.516 84.049-43.008 84.049Q-43.500 84.049-43.934 83.817Q-44.367 83.584-44.629 83.176Q-44.891 82.768-44.891 82.276M-43.008 83.772Q-42.551 83.772-42.299 83.549Q-42.047 83.326-41.959 82.975Q-41.871 82.623-41.871 82.178Q-41.871 81.748-41.965 81.410Q-42.059 81.073-42.313 80.866Q-42.567 80.659-43.008 80.659Q-43.656 80.659-43.901 81.075Q-44.145 81.491-44.145 82.178Q-44.145 82.623-44.057 82.975Q-43.969 83.326-43.717 83.549Q-43.465 83.772-43.008 83.772M-38.762 85.522L-40.617 85.522L-40.617 85.229Q-40.348 85.229-40.180 85.184Q-40.012 85.139-40.012 84.963L-40.012 81.139Q-40.012 80.932-40.168 80.879Q-40.324 80.826-40.617 80.826L-40.617 80.530L-39.395 80.444L-39.395 80.909Q-39.164 80.686-38.850 80.565Q-38.535 80.444-38.195 80.444Q-37.723 80.444-37.319 80.690Q-36.914 80.936-36.682 81.352Q-36.449 81.768-36.449 82.244Q-36.449 82.619-36.598 82.948Q-36.746 83.276-37.016 83.528Q-37.285 83.780-37.629 83.914Q-37.973 84.049-38.332 84.049Q-38.621 84.049-38.893 83.928Q-39.164 83.807-39.371 83.596L-39.371 84.963Q-39.371 85.139-39.203 85.184Q-39.035 85.229-38.762 85.229L-38.762 85.522M-39.371 81.307L-39.371 83.147Q-39.219 83.436-38.957 83.616Q-38.695 83.795-38.387 83.795Q-38.102 83.795-37.879 83.657Q-37.656 83.518-37.504 83.287Q-37.352 83.057-37.274 82.785Q-37.195 82.514-37.195 82.244Q-37.195 81.912-37.320 81.555Q-37.445 81.198-37.694 80.961Q-37.942 80.725-38.289 80.725Q-38.613 80.725-38.908 80.881Q-39.203 81.037-39.371 81.307\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(108.125 -101.828)\">\u003Cpath d=\"M-35.679 82.217Q-35.679 81.737-35.446 81.321Q-35.214 80.905-34.804 80.655Q-34.394 80.405-33.917 80.405Q-33.187 80.405-32.788 80.846Q-32.390 81.287-32.390 82.018Q-32.390 82.123-32.483 82.147L-34.933 82.147L-34.933 82.217Q-34.933 82.627-34.812 82.983Q-34.690 83.338-34.419 83.555Q-34.147 83.772-33.718 83.772Q-33.355 83.772-33.058 83.543Q-32.761 83.315-32.659 82.963Q-32.651 82.916-32.565 82.901L-32.483 82.901Q-32.390 82.928-32.390 83.010Q-32.390 83.018-32.397 83.049Q-32.460 83.276-32.599 83.459Q-32.737 83.643-32.929 83.776Q-33.120 83.909-33.339 83.979Q-33.558 84.049-33.796 84.049Q-34.167 84.049-34.505 83.912Q-34.843 83.776-35.110 83.524Q-35.378 83.272-35.528 82.932Q-35.679 82.592-35.679 82.217M-34.925 81.909L-32.964 81.909Q-32.964 81.604-33.065 81.313Q-33.167 81.022-33.384 80.840Q-33.601 80.659-33.917 80.659Q-34.218 80.659-34.448 80.846Q-34.679 81.034-34.802 81.325Q-34.925 81.616-34.925 81.909\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(108.125 -101.828)\">\u003Cpath d=\"M-27.138 83.971L-28.994 83.971L-28.994 83.674Q-28.720 83.674-28.552 83.627Q-28.384 83.580-28.384 83.412L-28.384 81.276Q-28.384 81.061-28.447 80.965Q-28.509 80.869-28.628 80.848Q-28.747 80.826-28.994 80.826L-28.994 80.530L-27.802 80.444L-27.802 81.178Q-27.689 80.963-27.495 80.795Q-27.302 80.627-27.064 80.535Q-26.826 80.444-26.572 80.444Q-25.404 80.444-25.404 81.522L-25.404 83.412Q-25.404 83.580-25.234 83.627Q-25.064 83.674-24.794 83.674L-24.794 83.971L-26.650 83.971L-26.650 83.674Q-26.376 83.674-26.208 83.627Q-26.040 83.580-26.040 83.412L-26.040 81.537Q-26.040 81.155-26.161 80.926Q-26.283 80.698-26.634 80.698Q-26.947 80.698-27.201 80.860Q-27.454 81.022-27.601 81.291Q-27.747 81.561-27.747 81.858L-27.747 83.412Q-27.747 83.580-27.577 83.627Q-27.408 83.674-27.138 83.674L-27.138 83.971M-24.349 82.217Q-24.349 81.737-24.117 81.321Q-23.884 80.905-23.474 80.655Q-23.064 80.405-22.587 80.405Q-21.857 80.405-21.458 80.846Q-21.060 81.287-21.060 82.018Q-21.060 82.123-21.154 82.147L-23.603 82.147L-23.603 82.217Q-23.603 82.627-23.482 82.983Q-23.361 83.338-23.089 83.555Q-22.818 83.772-22.388 83.772Q-22.025 83.772-21.728 83.543Q-21.431 83.315-21.329 82.963Q-21.322 82.916-21.236 82.901L-21.154 82.901Q-21.060 82.928-21.060 83.010Q-21.060 83.018-21.068 83.049Q-21.130 83.276-21.269 83.459Q-21.408 83.643-21.599 83.776Q-21.790 83.909-22.009 83.979Q-22.228 84.049-22.466 84.049Q-22.837 84.049-23.175 83.912Q-23.513 83.776-23.781 83.524Q-24.048 83.272-24.199 82.932Q-24.349 82.592-24.349 82.217M-23.595 81.909L-21.634 81.909Q-21.634 81.604-21.736 81.313Q-21.837 81.022-22.054 80.840Q-22.271 80.659-22.587 80.659Q-22.888 80.659-23.119 80.846Q-23.349 81.034-23.472 81.325Q-23.595 81.616-23.595 81.909M-20.474 83.139Q-20.474 82.655-20.072 82.360Q-19.669 82.065-19.119 81.946Q-18.568 81.826-18.076 81.826L-18.076 81.537Q-18.076 81.311-18.191 81.104Q-18.306 80.897-18.503 80.778Q-18.701 80.659-18.931 80.659Q-19.357 80.659-19.642 80.764Q-19.572 80.791-19.525 80.846Q-19.478 80.901-19.452 80.971Q-19.427 81.041-19.427 81.116Q-19.427 81.221-19.478 81.313Q-19.529 81.405-19.620 81.455Q-19.712 81.506-19.818 81.506Q-19.923 81.506-20.015 81.455Q-20.107 81.405-20.158 81.313Q-20.208 81.221-20.208 81.116Q-20.208 80.698-19.820 80.551Q-19.431 80.405-18.931 80.405Q-18.599 80.405-18.245 80.535Q-17.892 80.666-17.663 80.920Q-17.435 81.174-17.435 81.522L-17.435 83.323Q-17.435 83.455-17.363 83.565Q-17.290 83.674-17.161 83.674Q-17.036 83.674-16.968 83.569Q-16.900 83.463-16.900 83.323L-16.900 82.811L-16.619 82.811L-16.619 83.323Q-16.619 83.526-16.736 83.684Q-16.853 83.842-17.035 83.926Q-17.216 84.010-17.419 84.010Q-17.650 84.010-17.802 83.838Q-17.954 83.666-17.986 83.436Q-18.146 83.717-18.454 83.883Q-18.763 84.049-19.115 84.049Q-19.626 84.049-20.050 83.826Q-20.474 83.604-20.474 83.139M-19.786 83.139Q-19.786 83.424-19.560 83.610Q-19.333 83.795-19.040 83.795Q-18.794 83.795-18.570 83.678Q-18.345 83.561-18.210 83.358Q-18.076 83.155-18.076 82.901L-18.076 82.069Q-18.341 82.069-18.626 82.123Q-18.911 82.178-19.183 82.307Q-19.454 82.436-19.620 82.643Q-19.786 82.850-19.786 83.139M-14.318 83.971L-16.298 83.971L-16.298 83.674Q-16.029 83.674-15.861 83.629Q-15.693 83.584-15.693 83.412L-15.693 81.276Q-15.693 81.061-15.755 80.965Q-15.818 80.869-15.935 80.848Q-16.052 80.826-16.298 80.826L-16.298 80.530L-15.130 80.444L-15.130 81.229Q-15.052 81.018-14.900 80.832Q-14.747 80.647-14.548 80.545Q-14.349 80.444-14.122 80.444Q-13.876 80.444-13.685 80.588Q-13.494 80.733-13.494 80.963Q-13.494 81.119-13.599 81.229Q-13.704 81.338-13.861 81.338Q-14.017 81.338-14.126 81.229Q-14.236 81.119-14.236 80.963Q-14.236 80.803-14.130 80.698Q-14.454 80.698-14.669 80.926Q-14.884 81.155-14.980 81.494Q-15.076 81.834-15.076 82.139L-15.076 83.412Q-15.076 83.580-14.849 83.627Q-14.622 83.674-14.318 83.674\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(108.125 -101.828)\">\u003Cpath d=\"M-8.242 83.971L-10.098 83.971L-10.098 83.674Q-9.824 83.674-9.656 83.627Q-9.488 83.580-9.488 83.412L-9.488 81.276Q-9.488 81.061-9.551 80.965Q-9.613 80.869-9.732 80.848Q-9.851 80.826-10.098 80.826L-10.098 80.530L-8.906 80.444L-8.906 81.178Q-8.793 80.963-8.599 80.795Q-8.406 80.627-8.168 80.535Q-7.930 80.444-7.676 80.444Q-6.715 80.444-6.539 81.155Q-6.355 80.826-6.027 80.635Q-5.699 80.444-5.320 80.444Q-4.144 80.444-4.144 81.522L-4.144 83.412Q-4.144 83.580-3.976 83.627Q-3.808 83.674-3.539 83.674L-3.539 83.971L-5.394 83.971L-5.394 83.674Q-5.121 83.674-4.953 83.629Q-4.785 83.584-4.785 83.412L-4.785 81.537Q-4.785 81.151-4.910 80.924Q-5.035 80.698-5.387 80.698Q-5.691 80.698-5.947 80.860Q-6.203 81.022-6.351 81.291Q-6.500 81.561-6.500 81.858L-6.500 83.412Q-6.500 83.580-6.330 83.627Q-6.160 83.674-5.890 83.674L-5.890 83.971L-7.746 83.971L-7.746 83.674Q-7.473 83.674-7.305 83.627Q-7.137 83.580-7.137 83.412L-7.137 81.537Q-7.137 81.151-7.262 80.924Q-7.387 80.698-7.738 80.698Q-8.043 80.698-8.299 80.860Q-8.555 81.022-8.703 81.291Q-8.851 81.561-8.851 81.858L-8.851 83.412Q-8.851 83.580-8.681 83.627Q-8.512 83.674-8.242 83.674L-8.242 83.971M-1.234 83.971L-3.012 83.971L-3.012 83.674Q-2.738 83.674-2.570 83.627Q-2.402 83.580-2.402 83.412L-2.402 81.276Q-2.402 81.061-2.459 80.965Q-2.515 80.869-2.629 80.848Q-2.742 80.826-2.988 80.826L-2.988 80.530L-1.789 80.444L-1.789 83.412Q-1.789 83.580-1.642 83.627Q-1.496 83.674-1.234 83.674L-1.234 83.971M-2.676 79.049Q-2.676 78.858-2.541 78.727Q-2.406 78.596-2.211 78.596Q-2.090 78.596-1.986 78.659Q-1.883 78.721-1.820 78.825Q-1.758 78.928-1.758 79.049Q-1.758 79.244-1.889 79.379Q-2.019 79.514-2.211 79.514Q-2.410 79.514-2.543 79.381Q-2.676 79.248-2.676 79.049M1.195 83.971L-0.660 83.971L-0.660 83.674Q-0.387 83.674-0.219 83.627Q-0.051 83.580-0.051 83.412L-0.051 81.276Q-0.051 81.061-0.113 80.965Q-0.176 80.869-0.295 80.848Q-0.414 80.826-0.660 80.826L-0.660 80.530L0.531 80.444L0.531 81.178Q0.645 80.963 0.838 80.795Q1.031 80.627 1.270 80.535Q1.508 80.444 1.762 80.444Q2.930 80.444 2.930 81.522L2.930 83.412Q2.930 83.580 3.100 83.627Q3.270 83.674 3.539 83.674L3.539 83.971L1.684 83.971L1.684 83.674Q1.957 83.674 2.125 83.627Q2.293 83.580 2.293 83.412L2.293 81.537Q2.293 81.155 2.172 80.926Q2.051 80.698 1.699 80.698Q1.387 80.698 1.133 80.860Q0.879 81.022 0.733 81.291Q0.586 81.561 0.586 81.858L0.586 83.412Q0.586 83.580 0.756 83.627Q0.926 83.674 1.195 83.674\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(108.125 -101.828)\">\u003Cpath d=\"M4.443 83.018L4.443 81.276Q4.443 81.061 4.380 80.965Q4.318 80.869 4.199 80.848Q4.080 80.826 3.833 80.826L3.833 80.530L5.080 80.444L5.080 82.994L5.080 83.018Q5.080 83.330 5.134 83.492Q5.189 83.655 5.339 83.725Q5.490 83.795 5.810 83.795Q6.240 83.795 6.513 83.457Q6.787 83.119 6.787 82.674L6.787 81.276Q6.787 81.061 6.724 80.965Q6.662 80.869 6.542 80.848Q6.423 80.826 6.177 80.826L6.177 80.530L7.423 80.444L7.423 83.229Q7.423 83.440 7.486 83.535Q7.548 83.631 7.667 83.653Q7.787 83.674 8.033 83.674L8.033 83.971L6.810 84.049L6.810 83.428Q6.642 83.717 6.361 83.883Q6.080 84.049 5.759 84.049Q4.443 84.049 4.443 83.018M8.521 83.963L8.521 82.741Q8.521 82.713 8.552 82.682Q8.584 82.651 8.607 82.651L8.712 82.651Q8.783 82.651 8.798 82.713Q8.861 83.034 9 83.274Q9.138 83.514 9.371 83.655Q9.603 83.795 9.912 83.795Q10.150 83.795 10.359 83.735Q10.568 83.674 10.705 83.526Q10.841 83.377 10.841 83.131Q10.841 82.877 10.630 82.711Q10.419 82.545 10.150 82.491L9.529 82.377Q9.123 82.299 8.822 82.043Q8.521 81.787 8.521 81.412Q8.521 81.045 8.722 80.823Q8.923 80.600 9.248 80.502Q9.572 80.405 9.912 80.405Q10.376 80.405 10.673 80.612L10.896 80.428Q10.919 80.405 10.951 80.405L11.001 80.405Q11.033 80.405 11.060 80.432Q11.087 80.459 11.087 80.491L11.087 81.475Q11.087 81.506 11.062 81.535Q11.037 81.565 11.001 81.565L10.896 81.565Q10.861 81.565 10.834 81.537Q10.806 81.510 10.806 81.475Q10.806 81.076 10.554 80.856Q10.302 80.635 9.904 80.635Q9.548 80.635 9.265 80.758Q8.982 80.881 8.982 81.186Q8.982 81.405 9.183 81.537Q9.384 81.670 9.630 81.713L10.255 81.826Q10.685 81.916 10.994 82.213Q11.302 82.510 11.302 82.924Q11.302 83.494 10.904 83.772Q10.505 84.049 9.912 84.049Q9.361 84.049 9.009 83.713L8.712 84.026Q8.689 84.049 8.654 84.049L8.607 84.049Q8.584 84.049 8.552 84.018Q8.521 83.987 8.521 83.963\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003Cg transform=\"translate(108.125 -101.828)\">\u003Cpath d=\"M18.015 83.971L14.855 83.971L14.855 83.764Q14.855 83.737 14.878 83.705L16.230 82.307Q16.609 81.920 16.857 81.631Q17.105 81.342 17.279 80.985Q17.452 80.627 17.452 80.237Q17.452 79.889 17.320 79.596Q17.187 79.303 16.933 79.125Q16.679 78.948 16.324 78.948Q15.964 78.948 15.673 79.143Q15.382 79.338 15.238 79.666L15.292 79.666Q15.476 79.666 15.601 79.787Q15.726 79.909 15.726 80.100Q15.726 80.280 15.601 80.409Q15.476 80.537 15.292 80.537Q15.113 80.537 14.984 80.409Q14.855 80.280 14.855 80.100Q14.855 79.698 15.075 79.362Q15.296 79.026 15.661 78.838Q16.027 78.651 16.429 78.651Q16.909 78.651 17.325 78.838Q17.742 79.026 17.993 79.387Q18.245 79.748 18.245 80.237Q18.245 80.596 18.091 80.899Q17.937 81.201 17.685 81.461Q17.433 81.721 17.083 82.006Q16.734 82.291 16.566 82.444L15.636 83.284L16.351 83.284Q17.726 83.284 17.765 83.244Q17.835 83.166 17.878 82.981Q17.921 82.795 17.964 82.506L18.245 82.506L18.015 83.971M19.394 83.506Q19.394 83.323 19.531 83.186Q19.667 83.049 19.859 83.049Q20.050 83.049 20.183 83.182Q20.316 83.315 20.316 83.506Q20.316 83.705 20.183 83.838Q20.050 83.971 19.859 83.971Q19.667 83.971 19.531 83.834Q19.394 83.698 19.394 83.506M21.386 82.748Q21.386 82.252 21.712 81.887Q22.038 81.522 22.562 81.276L22.292 81.116Q21.995 80.932 21.812 80.637Q21.628 80.342 21.628 80.002Q21.628 79.608 21.847 79.297Q22.066 78.987 22.419 78.819Q22.773 78.651 23.156 78.651Q23.429 78.651 23.702 78.729Q23.976 78.807 24.193 78.955Q24.409 79.104 24.546 79.330Q24.683 79.557 24.683 79.850Q24.683 80.256 24.413 80.563Q24.144 80.869 23.722 81.084L24.171 81.354Q24.390 81.491 24.558 81.684Q24.726 81.877 24.824 82.116Q24.921 82.354 24.921 82.612Q24.921 82.951 24.771 83.239Q24.620 83.526 24.374 83.723Q24.128 83.920 23.804 84.030Q23.480 84.139 23.156 84.139Q22.726 84.139 22.320 83.977Q21.913 83.815 21.650 83.496Q21.386 83.178 21.386 82.748M21.874 82.748Q21.874 83.233 22.265 83.549Q22.656 83.866 23.156 83.866Q23.449 83.866 23.747 83.754Q24.046 83.643 24.240 83.424Q24.433 83.205 24.433 82.893Q24.433 82.662 24.292 82.451Q24.152 82.241 23.945 82.123L22.835 81.444Q22.417 81.647 22.146 81.983Q21.874 82.319 21.874 82.748M22.460 80.315L23.449 80.916Q23.796 80.733 24.023 80.463Q24.249 80.194 24.249 79.850Q24.249 79.631 24.158 79.455Q24.066 79.280 23.911 79.157Q23.757 79.034 23.556 78.963Q23.355 78.893 23.156 78.893Q22.749 78.893 22.404 79.104Q22.058 79.315 22.058 79.698Q22.058 79.881 22.169 80.043Q22.281 80.205 22.460 80.315\" fill=\"var(--tk-accent)\" stroke=\"var(--tk-accent)\" class=\"tikz-text\" style=\"stroke-width:0.240\"\u002F>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cpath stroke=\"none\" d=\"M-9.606 49.828a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0M16.002 41.292a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0M38.763999999999996 24.22a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0M64.371 18.53a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0M92.82400000000001-4.233a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0M118.43100000000001-7.078a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0M144.04-26.995a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0M163.95600000000002-32.686a1.4 1.4 0 1 0-2.8 0 1.4 1.4 0 0 0 2.8 0m-1.4 0\"\u002F>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cfigcaption class=\"tikz-cap\">The Cepheid period–luminosity relation; the absolute magnitude brightens linearly with the logarithm of the pulsation period, with a narrow scatter set by the width of the instability strip.\u003C\u002Ffigcaption>",1786059679833]